

Maybe you can move all your widgets to a parallel discussion board ?






The Grand Negus wrote: 3.14159
It seems you already took a couple of steps inside the parallel universe...
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
 Alfonso the Wise, 13th Century King of Castile.





The Grand Negus wrote: The actual universe is discrete
The current dominating perception of the universe is. It wasn't for centuries, maybe will be not the future one.
The Grand Negus wrote: (1) there's no end to numbers like those
Of course it's a feature, not a problem
The Grand Negus wrote: (2) there's nothing exactly like them in this universe
Actually there's no mathematical model that exactly resembles even a little piece of this universe.
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
 Alfonso the Wise, 13th Century King of Castile.





The Grand Negus wrote: Exactly how, in your universe, do you pack nine widgets into four boxes, where each box is only big enough for two? And how does 9/4=2.25 help you do that more than 9/4=2r1?
How would you pour 9 liters of water into 4 containers ensuring each container has an equal quantity? I would pour 2.25 (9/4) liters into each glass. 9/4=2r1 is not as useful as 9/4=2.25 in this example. I’m afraid I’m not ready to give up my rational (or even real) numbers.
Steve





If you were determined to use only integers you could, in theory, use the number of water molecules as a measure of volume. At one level this system is ultimately simple: unfortunately it is also impractical to the point of near impossibility. You say that you would use a smaller unit of measurement: so in this example each glass would contain 2250 milliliters. Is this really much simpler or more intuitive than 2.25 liters?
Steve





The Grand Negus wrote: Nine divided by four is two with one left over.
So it seems you also believe in rational numbers. Pity real life isn't always so simple. Presenting a simple example does not negate the existence of more complex ones or the more advanced tools which may be required to deal with them.
Steve





Actually he believe in a discrete universe.
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
 Alfonso the Wise, 13th Century King of Castile.





Most people, including people who consider basic trigonomic function like sine and cosine advanced, could readily understand them if they were explained properly.
Steve






This appears to me to be a simple modification of the nqueens problem. Placing n queens on a board such that no queen can capture any other queen. I would persue this line of thought with a google search on the nqueens problem.





Hi,
I beg to differ. On an n*n board (with n>2) you can place n queens, the only problem
is finding one of the many solutions. In the problem at hand, you dont know beforehand
how many "queens" you can put; you loose some squares to the walls, and in return
the walls typically offer the possibility to put more than n.
BTW the maximum seems to be n*n/2 (putting a wall on all the squares of one color).





I agree with you totally on the number of queens that could be placed on this board due to wall constraints, this is why I suggested a modified version of n queens. The wall constraints could easily be taken into account and still allow for the same "Basic" n queens algorithm to function correctly.





I was thinking today that it should be relatively easy to implement lock free data structures using Thread Local Storage but surprisingly Google didn't reveal anything that really stood out or even a library of basic data structures that have been built using this.
Is there something I am missing?
I always think that the idea of a compiler that compiles another compiler or itself is rather incestuous in a binary way.  Colin Davies
My .Net Blog





Hi,
thread local storage offers storage that is private to the thread.
When threads cooperate, they have to share data; thread local data does not help here,
it prevents sharing.
To share data safely most often one needs a synchronization mechanism; a lock is one
example thereof.





Of course, thanks for clearing that up
I always think that the idea of a compiler that compiles another compiler or itself is rather incestuous in a binary way.  Colin Davies
My Blog





Sijin wrote: Lock free data structures
There are many lock free algorithms, unfortunately most are patented. But as pointed out local storage comes off the thread's private memory storage and is by definition "local" only to that thread and cannot be shared.
I keep debating on writing something for this, and have been encouraged to do so.... started once, but it is not as easy concept as it sounds. It gets complicated real quick.
_________________________
Asu no koto o ieba, tenjo de nezumi ga warau.
Talk about things of tomorrow and the mice in the ceiling laugh. (Japanese Proverb)





Mind you  that most are patented it a great thing  you can read exactly how it is done. www.uspto.gov or patents.google.com. I'm not advocating IP theft, but the constitutional point of the patent system is to exchange temporary monopoly for full public disclosure. The best parts of a patent for nonlawyers is the background and following 'spec' (specification).
Good luck,
spinvec





spin vector wrote: you can read exactly how it is done.
I am quite familiar with how it is done. I was pointing out that most algorithms are patented, as both a warning, and information since as you pointed out they all can be searched online. What someone chooses to do with that information, learn, use, or find another way is up to them.
_________________________
Asu no koto o ieba, tenjo de nezumi ga warau.
Talk about things of tomorrow and the mice in the ceiling laugh. (Japanese Proverb)





I am trying to understand the Math of a Camera in Computer Graphics.
Here is the question
If i have a camera a point a, How do I compute the view matrix so the camera looks at point b?





javascript:ol('http://www.codeproject.com/article.asp?tag=22254790602739235');
Any help here, just read it an hour ago and it came to mind, sorry if its out in left field.





Could anyone write a function in mathematica to do the same with the following program?
main(){
char s[300],t[300];
int i,j,c,m,n,edit;
int a[301][301];
m=strlen(s);
n=strlen(t);
if(n==0){printf("Edit distance = %d\n",m); }
if(m==0){printf("Edit distance = %d\n",n);}
else{
for(i=0;i<=m;i++){
a[i][0]=i; }
for(j=1;j<=n;j++){
a[0][j]=j; }
for(i=1;i<=m;i++){
for(j=1;j<=n;j++){
if(s[i1]==t[j1])
c=0;
else c=1;
a[i][j]=min(a[i1][j]+1,min(a[i][j1]+1,a[i1][j1]+c));
edit=a[i][j];
}
}
printf("\nEdit distance = %d\n\n",edit);
}
}





"Real programmers just throw a bunch of 1s and 0s at the computer to see what sticks"  Pete O'Hanlon





Hi
I am working on Speech Recognition using microsoft speech SDK 5.1 (SAPI 5,1). I wish to implement two different speech recognition engine in one application. The problem is that when I create one engine, the other can not be created in shared mode. However if I create the two in In proc recognizers, the recognition does not work. What can be the possible solution to implement to recognizers in one application specially when the two have different languages.
Regards
Zia





How is the project doing?
"Real programmers just throw a bunch of 1s and 0s at the computer to see what sticks"  Pete O'Hanlon





I’m very pleased to announce that Foundations of F#, the first book to be published on the F# programming, will finish its first printing run, tomorrow, Friday 25th May. It should reach any preorder customers between 5 to 10 days later, meaning if ordered it on Amazon or Borders (or any other online store), it should be with you before the end of May. A few weeks after that it should start appearing in books stores, at least bookstores that have very big tech departments.
F# is a functional programming language implemented on the .NET framework. F# blends nice the paradigms of functional programming with those imperative and object oriented programming. Allowing you to write functional programs that allows take advantage of the huge range of libraries that exist in the .NET framework. Plus F# includes a “toplevel”, that has also been integrated into visual studio, allowing you to select sections of your code and execute them dynamically.
So what are you waiting for? Order a copy today, if you haven’t already:
http://www.amazon.com/dp/1590597575?tag=strangelights20&camp=14573&creative=327641&linkCode=as1&creativeASIN=1590597575&adid=0F4QKB6A95B2Z4NW1BFN
Foundations of F# is the first of several books on the F# programming language, which include Expert F# and F# for Scientist.
http://www.amazon.com/ExpertFDonSyme/dp/1590598504/ref=sr_1_2/10253057363745759?ie=UTF8&s=books&qid=1179999013&sr=12
http://www.ffconsultancy.com/products/fsharp_for_scientists/index.html
You can find out more about F# itself by visiting the official F# site of “the hubfs” a community site for F# users.
http://research.microsoft.com/fsharp/fsharp.aspx
http://cs.hubfs.net/

Robert
http://www.strangelights.com





Don't advertise.
"Real programmers just throw a bunch of 1s and 0s at the computer to see what sticks"  Pete O'Hanlon





hi there,
in my app i have to calculate a value using this syntax:
x = 2^(y / 2)
but ^ ist a logical operator in c#. what could be meant? how would i calculate x if, for example y = 4,33984375? or does ^ have a different meaning in this context (for example Math.Pow?).
does anyone possibly understand what i'm after? any help is greatly appreciated.
/matthias
I love deadlines. I like the whooshing sound they make as they fly by. [Douglas Adams]





matthias s. wrote: x = 2^(y / 2)
To what context your expression belong?
I mean, if it is a Visual Basic (VB6) one, then it translates to the following C# equivalent:
x = Math.Pow(2, y / 2);
On the other hand, if the context is C#, it simply doesn't make sense.
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
 Alfonso the Wise, 13th Century King of Castile.





Hi,
Even I am not sure, what you want to achieve with that operator, but "^" is a logical exclusive  OR for binary type. Meaning the result will be true only if only one of the operand is true.
"^" for the integral types (as above in your case) computes bitwise exclusiveOR of its operand. hence it will compare the each bit and apply exclusiveOR on each bits to find the last result.
Manoj
Never Gives up





Manoj Kumar Rai wrote: but "^" is a logical exclusive  OR for binary type.
Actually for single bits.
Manoj Kumar Rai wrote: "^" for the integral types (as above in your case) computes bitwise exclusiveOR of its operand. hence it will compare the each bit and apply exclusiveOR on each bits to find the last result.
He asked about doubles!
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
 Alfonso the Wise, 13th Century King of Castile.





I expect that Math.Pow is what you want, but in some organizations you can get in trouble for thinking, so use the statement as told and shrug your shoulders when someone reports a bug.





Hi Matthias,
Try **. Just kidding
Jeff





Hey folks,
I've got a simple question:
What's your favorite MathLibrary (besides Math.h
I need a really good mathlibrary which has FFT and SVD and a bunge of other stuff...
*I tried JAMA, which is not too bad, but has too few functions for me
*Matpack (surely a great Library but I only get errors when trying to compile)
(www.matpack.de  maybe someone can help me get this running)
*I even tried copying (well, more like typing from) "Numerical recipes in C" and even those ended in an endless loop when trying to do an svd.
any suggestions?






I don't know what your detailed requirements are, there is no gold standard of which I am aware. Recently I have been using Intel MKL  this has impressive FFT performance, haven't used SVD yet. For freeware FFT, FFTW is probably the best. I have used IMSL but it is expensive, and I have a query in my mind over licensing for use in products. For free linear algebra you could consider getting a fortran compiler and compiling the NETLIB routines you want into a library.
Peter
"Until the invention of the computer, the machine gun was the device that enabled humans to make the most mistakes in the smallest amount of time."





how about Blitz its gives you matlab like capabilities for C++
here is the link: http://www.oonumerics.org/blitz/





I'm on the same hunt for other reasons. Blitz looks good but even it seems to rely on the IEEE 754:1985 approx implementation built into the C Runtime . Do you know of any indepenent IEEE/libm implementation in C++?
Nothing is exactly what it seems but everything with seems can be unpicked.





Hi Queezy,
I can't speak for FFTs and SVD (what are you doing with decomposition, BTW? I recently read a paper which used SVDs as a text indexing algorithm such as Google), but I personally love Crypto++ for anything Cryptography related. This includes its Large Integer package, and Elliptical Curve implementation.
Jeff





Does anyone know of any good algorithms for calculating a total shipment cube size based on the sizes and quantities of the products in that shipment?





You may have to look at figuring the volume of each individual product, how many to ship at a time, and then figure out the cube size based on the total volume of the products being shipped...
"Any sort of work in VB6 is bound to provide several WTF moments."  Christian Graus





Hi All, I need to find the value after decimal in mathematical way... Ex: I have a number 19.56 and my formula gives me .56 Please help me... Thanks in advance...





What language are you programming in?
The only way to speed up a Macintosh computer is at 9.8 m/sec/sec.





Thanks for the help.I need a mathematical way I dont want to use programming language for this....





By convention there is the [] operator, defined the following way
[x] = the integer part of x
hence you can use
x[x]
to extract the decimal part of x
But, I know, it's just another way to say: 'take the decimal part of x ' (BTW it is also a perfectly accetable function definition).
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
 Alfonso the Wise, 13th Century King of Castile.





ExpertComing wrote: The only way to speed up a Macintosh computer is at 9.8 m/sec/sec.
LOL...





in mathematical way I would say
.56 = 19.56  floor(19.56)
or in c++
float rest = 19.56  int(19.56);
sufficient?







I think it is important for you to clarify what to do with negative numbers. What would you want to obtain with 19.56? .56 or .44 (=19.5620.00)? The formula is usually simple for positive numbers because we all agree the integer part is the largest integer not greater than the given number, but for negative numbers we have to decide which reference to have (either 0 or oo).
Rilhas




