Recent content by uwowizard

Thank you! I'm looking for a way to find distance from a point to an object (line, hyperplane, etc) that goes through n points.. I've just done a search on a distance from a point to an affine subspace and it seems that it's not a trivial topic (at least not as simple as in the case of a line or...

Hello All, It's rather a simple question for advanced people. Consider a 3D Euclidean space: if one is given 2 points, a line can be build that goes through the points; for 3 points -- there is a plane. For 4D space: a line goes through 2 points and a hyperplane through 4 points...

Thanks for the reply. However, the system a_0 = a_1*x_1 + ... + a_n*x_n b_0 = b_1*x_1 + ... + b_n*x_n x_1 + ... + x_n = 1 will have an infinite amount of solutions, and the problem is how to select at least one that satisfy the inequality. 0<= x_1, ... , x_n <= 1

I'm looking for a general-case method to find at least one solution to a system such as a_0 = a_1*x_1 + ... + a_n*x_n b_0 = b_1*x_1 + ... + b_n*x_n x_1 + ... + x_n = 1 0<= x_1, ... , x_n <= 1 where a_i, b_i are known real numbers, x_i are unknown and n > 4 Thank you in advance.

In particular, I want to be able to represent the following operations list l l.add(l1,i) //add element l1 in the i-th position l.remove(j) // remove an element in the j-th position

I'm looking for a standard way to represent a list (data structure) in pseudo-code. I looked at the documentation of standard algorithmic packages in latex, e.g. http://en.wikibooks.org/wiki/LaTeX/Algorithms_and_Pseudocode but could find anything about lists. Pls, let me know if I need...

I'm working with the algorithmic and algorithm packages in LaTeX and looking for a way to perform some operations on a list in the algorithm.. Any ideas how I can do that? Any advice is highly appreciated. Thank you in advance.

Good idea, Stephen. Thanks.

"oriented" angle between vectors Say, we are given two vectors v1(1,2) and v2(2,1). Question - how to find an "oriented" angle in clockwise direction between the given vectors? Note, the angle between v1 and v2 will be equal to (360-(the angle between v2 and v1)) Any suggestions will be...

Micromass, is there a name for the process that you described?

Thanks a lot!

Hi there, I have 23D subspace, defined by an equation (hyperplane) c1*x1 + ... + c24*x24 = 0; I wonder if there is an automated way to find basis of the subspace? I have access to Maple and Matlab. Thanks.

Hi there, I was looking at an SVM implementation svm-java and it accepts a parameter to indicate whether the data is sparse. What's the definition of the sparse data? Thanks.