
Keynote Speakers
We are very pleased to have the following distinguished keynote speakers at IMS 2004:
 Dr. Richard Crandall
Apple Distinguished Scientist, Advanced Computation Group, Apple Computer
Vollum Adjunct Professor of Science,
Director, Center for Advanced Computation,
Reed College, Portland, Oregon, USA.
Computational studies in bioterror
With such tools as Mathematica we can establish deep relations between statistical measures in regard to epidemiological scenarios. Though simple combinatorial rules can give rise to extremely complex disease propagation, we may yet perform certain calculations to establish such as optimal vaccination and prevention strategies.
 Dr. Gerald Hushlak
Head, Department of Art, Faculty of Fine Arts,
University of Calgary, Calgary, Alberta, CANADA.
The Power of Two
On art & science, and beyond ...
 Dr. Mark Kotanchek
The Dow Chemical Company,
Freeport, Texas, USA.
Industrial Strength Mathematica
Mathematica is not just for symbolics anymore. In fact, in combination with WebMathematica, it can be a foundation technology for a rapid analysis system development methodology. In this talk we will review some of the history of Mathematica within Dow and the issues and opportunities associated with enduser package development and analysis system development. Illustrations will be drawn from realworld examples ranging from symbolic regression via genetic programming to electrical power generation and trading.
 Dr. Hugh C. Williams
Director, Centre for Information Security and Cryptography,
iCORE Chair, Algorithmic Number Theory and Cryptography,
University of Calgary, Calgary, Alberta, CANADA.
Cryptography, Sieving and Primality Proving
Over the last twentyfive years, a number of ingenious schemes have been developed for ensuring the security of communication. Several of these, such as RSA, rely on the presumed difficulty of the integer factoring problem. In order to use such a scheme it is first necessary to find two large prime numbers (primes) whose product is made public. The inability of an eavesdropper to determine these two primes, given their product, is what makes the system safe. This, of course, leads us to the question of how to identify the large primes that would be used in such a scheme. The problem of establishing that a given integer is a prime is called the problem of primality proving. The usual way we learn to do this is to trial divide the number by all primes less than its square root; if no such prime divides the original number, then it must be a prime number. Unfortunately, this technique is hopelessly impractical for the numbers that need to be used in the RSA cryptosystem.
A pseudosquare is an integer that acts in some respects like a perfect integer square, but is not such a square. These numbers were first considered by Kraïtchik, who computed several of them in 1924. Since that time a number of investigators have added to Kraïtchik’s table.
The process of finding these numbers has always involved the use of a device called a number sieve.
In this talk I will discuss some of these machines, the oldest dating back to 1912. I will also give a brief description of a recently completed number sieve (CASSIE) constructed at the University of Calgary by Kjell Wooding. With this new device, which for the pseudosquare problem can be made to execute up to 1000 times faster than the fastest previous number sieve, we were able to find 12 new pseudosquares. These numbers also conform to the conjectured growth rate, providing more evidence for the widely believed complexity of the problem of primality testing. We are also able to make use of these results to find the fastest known primality proving algorithm for numbers of 100 bits. This is very useful for digital signature verification.
 Dr. Stephen Wolfram
Creator of Mathematica and CEO of Wolfram Research, Inc.
Author of "A New Kind of Science"
Wolfram Research
Champaign, Illinois, USA.
Check out the IMS 2004 Conference Schedule.


