How is one supposed to use the curl function in numeric mode? Tried with
syms r t p cs2 real; names=[r t p];
X=[r*sin(t)*cos(p);r*sin(t)*sin(p);r*cos(t)];% Basis of Covariant Vectors

>> curltst
??? The following error occurred converting from sym to double:
Error using ==> sym.double at 25
DOUBLE cannot convert the input expression into a double array.
If the input expression contains a symbolic variable, use the VPA function instead.

Error in ==> curltst at 11
cs2(:,:,1) = [[ 0, 0, 0], [ 0, -r, 0], [ 0, 0, 0]];

Tried this out and is pretty slow. Check this out: jdoric(1000,1000,1000,1,1000) - runs forever (didn't even terminate on my PC) although there is just a single integer composition, namely 1000 = 1+1+...+1. Runtime increases exponentially in the number of parts.

Well, it's still my firm view that this algorithm (not the implementation) is awfully slow and no bit more general than other algorithms for restricted integer compositions.

For example, when I set n=16; a=1; b=4; and run

tic; jdoric(n,1,16,a,b); toc

this yields, on my computer, a run time of 21 seconds. Contrarily, when I run

tic; for k=1:16; colex(n,k,a,b); toc

this runs in 2.5 seconds. (Colex is the Vajnovszki/Vernay algorithm that is also available as a matlab implementation).

When I set n=18, run times become 289 seconds and 25.6 seconds, respectively.

So, why on earth would anyone want to use this slow algorithm?

Other issues:
1) The good rating of this algorithm here on mathworks appears to be manipulated.
2) You may wish to google "Corrections" to the Opdyke algorithm "A unified approach ..."

Alright, I agree, John D'Errico, that the argumentation should remain factual.

It's just really difficult to argue with Mr. Opdyke because he apparently doesn't understand some basic principles of the things he has published about. Writing problematic papers is one thing, defending errors beyond reason is another. Whatever his contributions in his paper have been, they have neither been the provision of solutions to open problems nor the provision of a general algorithm for solving the restricted integer composition/partition problem. I think that the "success" of his paper is due to self-promotion - and recipients of his work should be made aware of his paper's and algorithm's deficiencies.

In the interest of his readers, I have summarized my points of critique in a pdf file.
http://www.adiuvaris.org/correction.pdf

PLEASE! Intelligent comments from all parties are valid and invited. But STOP the venomous comments, character assassination, insults, and what has been verging on libel.

ACT LIKE ADULTS, OR PROVE YOURSELVES TO BE SMALL CHILDREN.

When I ran setup_fdt, met an error as:
"Function UNZIP was unable to find file 'mexw64.zip'."
Would you please help me to check it? Thank you so much.
By the way, I use MATLAB 7.8 and VC2010

Thank you for your great toolbox, but I have some problem with the 2.8 version.
I cannt find the model model_detector_haar_24x24.mat. I tried to build the model using Example 3 in train_cascade. Then using this model and run demo_detector_haar I have this error:
Error using detector_haar
sum(cascade(1 , :)) <= T
Error in demo_detector_haar (line 83)
pos = detector_haar(rgb2gray(aa) , model);
Would you please check it? Thank you so much.

Comment only