quandl (http://www.quandl.com/) has a great feature called superset (you need a free acount)
where the user can combine different data variables (4 000 000 to choice from) into a big
dataset (csv file) that can be downloaded from a permenant web url. This a great data feed
for maple. The problem is however that you have to use stringtools (quite messy) in maple to
extract the data. Hence, it would be great to have a simple procedure that only needs the web

"Welch-Satterthwaite formula":
With the package "ScientificErrorAnalysis" is easily calculated, the combined uncertainty of a mathematical model M = f (x1, x1, .. xn). But if I need to know the components of the calculation model uncertainty becomes very repetitive. For example to calculate the expanded uncertainty should be calculated uncertainty components model for using the Welch-Satterthwaite formula ". Which determines the effective degrees of freedom υeff:

Why does this not work?

restart:
with(Statistics):

P := Sample(RandomVariable(Normal(10, 10)), 500):
X := RandomVariable(EmpiricalDistribution(P)):

DensityPlot(X);

I can define a discrete, finite universal set U, say the digits 1-5.

U:={1,2,3,4,5}

I can define a subset such as

X:={2,4}

Maple will compute the complement

U\X

but I cannot find any common textbook way of naming that complement that Maple will accept.  I cannot use a superscript c.  I cannot use a prime.  I cannot use an apostrophe.  I cannot use an overbar. Yes, I can type any of those using the various symbol...

I just started with maple 16 trying to complete an into assinment.  I am in a worksheet trying to just enter simple expresions 3+4 or 3*4 ect.  Whne i enter the operator + * using the keyboard, ther operators menu or pasting from notepad about 90%  of the time the previous number i typed disapears and the worksheet will no longer accept imput

I have tried reinstalling several times with no AV active even installed in safe mode same issue..

Maple...

Determine if

[ 9 ]                         { [ 3 ]  [ 1 ]  [ 4 ]  [ 1 ] [ 5 ] }

[ 8 ]                         { [ 2 ]  [ 6 ]  [ 5 ]  [ 3 ] [ 5 ] }

[ 3 ] E (curvy E) span  { [ 9 ], [ 7 ], [ 9 ], [ 3 ],[ 2 ] }

Consider a signal which is a real sine series, f(x)=2*sin(2*Pi*x) + 5*sin(2*Pi*6*x) + 9*sin(2*Pi*11*x).

Let F(w) be its Fourier transform. Answer F(w) is purely complex and expressed in terms of symbol Dirac.

Maple "plot" fails.

Plots of impulse trains like F(w)=sqrt(Pi)*I*(2*Dirac(w-Pi)+4*Dirac(w-4*Pi)) involve user intervention. Maple won't plot such expressions, because they are DISTRIBUTIONS (not FUNCTIONS).

Try plotting F(w) to see the engine's uninformative error message....

Hello,

I've written a code that I'd ultimately like to process in parallel over a grid of parameters, but before I can even think of doing that, I need to find a workaround for the memory allocation issues I'm having. Probably due to the way that it's written, Maple's built in garbage collection isn't working very well (if at all), and the code allocates another 100 MB or so every 10,000 iterations. Even if I content myself with running it for say 200,000 iterations,...

Hi, I have created over time a module with a number of procedures that are useful for me for certain calculations.

From time to time I am adding new stuff to it. Now I find that the thing has gotten long enough that (a) I need to do a lot of scrolling and (b) I forget where exactly certain procedures are in the file.

So I was trying to put in bookmarks that e.g. could carry the names of procedures, or sections of the whole thing. But Maple refuses to put more...

For the last few releases of Maple, we have been adding features to take advantage of multi-core processors.  Most of this work has focused on particular algorithms or on tools that allow users to author their own parallel code.  Although this was very useful for those users who were able to use those tools, many users did not see a performance improvement.  To help all users we need to integrate parallelism into the core algorithms of Maple.  In Maple 17 we have taken the first step towards general parallelism in the core algorithms by implementing a parallel garbage collector.

Could you please look at the following piace of code:

>assume(d::complex):
>z:=t=a/d:
>additionally(d≠0):
>z:=z*d;

The result of last command is

z:=d~t=d~*a/d~

that is not z:=d~t=a.

If I skip the command additionally(d≠0): then everything is good. However I need this command. Could you help to handle this problem?

amu^4+bmu^3+cmu^2+dmu+e=0

The unknown is mu

> int(abs(x), x = -1 .. 1);
                               1
> int(sign(x)*abs(x), x = -1 .. 1);
                               1
> int('sign(x)'*abs(x), x = -1 .. 1);

I would uninstall maple but i get the following error:

java.lang.IllegalArgumentException: No product for ID=16000347-aaa2-0000-99a9-b0cb0eddf46e

                at ZeroGgv.<init>(DashoA10*..)

                at ZeroGf3.c(DashoA10*..)

               ...

   Let GL(2,Z) be the  group of all the matrices of dimension 2 over the integers with the determinant equal to +/-1.
   A matrix M in GL(2,Z) is called primitive if M is not equal to K^n for any K in GL(2,Z) and any positive integer n >= 2.
   Is the matrix M:= Matrix([[27,5],[11,2]]) primitive? How to determine it in Maple?

Edit. GL(2,Z) instead of UL(2,Z).