Hi all, Looking for some advice here. Does anyone know a good place to start looking into matching algorithm in a n-dimensional space. For example, any dating site out there must be using some sort of algorithm to match 2 people. What I have read is that we can map characteristics of a person in a n-dimensional array with a point syst...
I am trying to return a binary from the DB using linq for display in the browser. The method below using ado.net works but I am trying to ypgrade to linq but the linq version returned the error. Public Sub ProcessRequest(ByVal context As System.Web.HttpContext) Dim imageId As String = context.Request.QueryString("id") Dim r...
Hey, I am building a mySQL table listing points in n-dimensions, each dimension being indexed. Given any point in the n-dimensional system, I would like to be able to output all of the other points in order of their distance from the chosen point. A simple solution would be to calculate distances from each point using the pythagorean ...
I have a N-dimensional vector, X and 'n' equidistant points along each dimension and a parameter 'delta'. I need a way to find the total of n^N vectors enclosed by the Hypercube defined with the vector X at the center and each side of Hypercube being of size 2*delta. For example: Consider a case of N=3, so we have a Cube of size (2*de...
I'm trying to generate random numbers from a gaussian distribution. Python has the very useful random.gauss() method, but this is only a one-dimensional random variable. How could I programmatically generate random numbers from this distribution in n-dimensions? For example, in two dimensions, the return value of this method is essentia...
I wish to generate some data that represents the co-ordinates of a cloud of points representing an n-cube of n dimensions. These points should be evenly distributed throughout the n-space and should be able to be generated with a user-defined spacing between them. This data will be stored in an array. ...
I want to write a function to generate and store the co-ordinates of an n-cube and I have no idea how to start. Specifically, I wish to generate the co-ordinates for an evenly or randomly distributed cloud of points for this n-cube and store them. What would be a good way to start with this or if possible, a quick solution? ...
Hi, Is it possible to allocate a 1D memory space int *x=(int *)malloc(100*sizeof(int)); and then recast the returned pointer to 2D array e.g. int **y=(int **)x; and access it as if it was 2D array e.g. y[1][2] = 12;? My aim is to take a shared memory segment and return 1D,2D,...ND array depending how the user wants to interpret this...