Excuse me, I'm very new here, but what's the main purpose behind users blogs on mapleprimes ? I see many (perhaps most ?) blog postings that could just as easily (and perhaps more usefully, for other members, that is) be posted in forums since they are often asking for advice on various matters.....

This post is a quick book review of

The Art of Multiprocessor Programming
by Maurice Herlihy and Nir Shavit

I am studying the Julia sets and Mandelbrot. I know how to generate them. I know how to animate a simple function in the real field but until now not able to animate the Julia sets and the Mandelbrot. Is there any user guide or examples that explaines how to animate these two things in 2-D or 3-D?  I already have the user manual guide and the advanced programming guide downloaded from maplesoft but they do not contain any information or examples about what I am looking for.

This blog post does not really have that much to do with Maple a little bit about mathematics though.

I started to play around with www.stumbleupon.com/   and some quite nice things came out from it
 

For example :    www.financialsense.com/editorials/casey/2008/1210.html

I have not yet research the accuracy of such made claims but the below charts certainly makes you think....

This is something I produced for my Calculus students.  It is based on some actual research in Biology by Larry Dill of Simon Fraser University, showing that the escape response of the Zebra Danio, a small tropical fish, is triggered when the rate of change of the visual angle of a potential predator becomes too large (see ugrad.math.ubc.ca/coursedoc/math102/keshet.notes/chapter11Notes.pdf, section 11.2).
Here's my Maple document.

A favorite diversion of mine (and of many around the Maplesoft office) is xkcd. Its author, Randall Munroe, bills it as “a webcomic of romance, sarcasm, math, and language.” Since 2005, he’s been entertaining many self-proclaimed geeks with his unique and slightly skewed jokes on technology, computer science, mathematics, and relationships.

I really like the post in which a substitute teacher – hm, Mr. Munroe......

I recently started experimenting with autocompile in Maple.

I must say that I am bit surprised by the difference in performance for different loops and procedures

depending of what type of notation you use. I have below presented 3 procedures that uses slightly

difference notation. We can see that the first procedure (iterating over list elements) is extremely slow in Maple.

The second procedure is faster but the third procedure (compiled, converted to C ) is fastest.

Is possible to understand how to use maple 12 to input equations like this. I have difficulty in understanding the help section of Maple. I dont see the functions listed in any of the pallettes as they are in my homework.

Thank You. I appreciate your time.

1.)Find the Fourier series for the function:

I wrote a simple worksheet which allows one to explore the results of iterated applications of the perfect (out) shuffle.

<a href='http://mapleoracles.maplesoft.com:8080/maplenet/primes/worksheet/9973_shuffle.mw'>View 9973_shuffle.mw on MapleNet</a> or <a href='http://www.mapleprimes.com/files/9973_shuffle.mw'>Download 9973_shuffle.mw</a><br/><a href='http://www.mapleprimes.com/viewfile/3140'>View file details</a>

In this post I would like to kindly ask users of this package (if there are any) for a feedback. Please, add a comment to share your experience with FourierTrigSeries package (how do you use it) and suggest new features or report bugs.

The attached worksheet is a wonderful introduction to the concept of obtaining the area under a curve.

You'll see how easy it is to learn how to find the limit of the sum of a series using Maple.

An interactive video tutorial that shows you how to do Riemann sums really fast is linked below:

(Ctrl+Click on the link to view the video)

Riemann Sums...

Back to school, back to school, to prove to dad that I'm not a fool...(if you don't know what this is from, google it)

Well now that the school year has started, it's time to get the old grey matter going.  Now if you're a student on this board, there's a good chance that:

a) you know how to use Maple and are helping others out; or

b) you are not familiar with Maple and you want all the help you can get.

I'm assuming there are more people...

Here is some standard alternative to Newton's method (and
thus may safe some homework ... so what). 

It will find a root of f (I think it must be continuous C^1)
in the interval ax ... bx, if it has different signs at the
boundaries.

The code is more or less translated from netlib C library
(or similar).

Usage:

  Digits:=16;

  f:= x -> exp(x)-Pi;
  zBrent( f, 0.0, 2.0);
  'f(%)': '%'= evalf(%);

If F is a quadratic function on a n-dimensional vector space,
then F(x) is affine equivalent to one of the following:

  Sum( epsilon[j]*x[j]^2, j=1 ..r  ), 
  Sum( epsilon[j]*x[j]^2, j=1 ..r  ) + alpha,