CLAMP An effort to devise an open hardware/software combination to solve the problems of broadband access providers and users internationally. http://sourceforge.net/projects/clamp/
JMP - Sparse Matrix Library A library for sparse matrix computations. Includes a sparse BLAS, many iterative solvers for different problems, sparse matrix I/O and parallelization. open source, GPL http://www.math.uib.no/~bjornoh/jmp/
The Memory MineĀ Summary A standalone application for monitoring and stressing heaps in open applications, and helping to find problems such as memory leaks and heap corruption. http://www.adianta.com/files/MMSummary.html
Growing Matters Horticultural Therapy Project providing voluntary work for people with mental health problems. open to the public 5 days a week selling plants, garden furniture and crafts. http://www.growingmatters.co.uk
Novell Will Challenge SCO Over Unix Ownership Wall Street Journal reports today Novell claims it owns rights to Unix OS; may cause problems in SCO lawsuit against IBM and Linux community. Novell is ally of open source community. The Inquirer http://www.theinquirer.net/?article=9719
Shambhala Meditation Center Of Los Angeles Shambhala Training is a secular path of spiritual training. The Shambhala Training path is one of fearless and gentle action in the world; it is open to people who follow any spiritual tradition or who have chosen no particular spiritual tradition. Shambhala Training is founded on the premise that there is basic human wisdom that can help to solve the world's problems. http://isd.usc.edu/~czachary/ShCen.html
Extractions: Submit primes Below are just a few of the many conjectures concerning primes. Goldbach's Conjecture: Every even n Goldbach wrote a letter to Euler in 1742 suggesting that . Euler replied that this is equivalent to this is now know as Goldbach's conjecture. Schnizel showed that Goldbach's conjecture is equivalent to distinct primes It has been proven that every even integer is the sum of at most six primes [ ] (Goldbach's conjecture suggests two) and in 1966 Chen proved every sufficiently large even integers is the sum of a prime plus a number with no more than two prime factors (a P ). In 1993 Sinisalo verified Goldbach's conjecture for all integers less than 4 ]. More recently Jean-Marc Deshouillers, Yannick Saouter and Herman te Riele have verified this up to 10 with the help, of a Cray C90 and various workstations. In July 1998, Joerg Richstein completed a verification to 4
Frame Page ParentDirectory 07Jan-2004 1623 - frame_a.htm 25-Sep-1998 1727Index of /~hedet/problems. Name Last modified Size http://www.cs.clemson.edu/~hedet/Problems/
Clay Mathematics Institute Typical of the NP problems is that of the Hamiltonian Path Problem given N citiesto visit (by car), how can one do this without visiting a city twice? http://www.claymath.org/
Extractions: Clay Mathematics Institute Dedicated to increasing and disseminating mathematical knowledge On April 19, 2004, CMI announced eighteen new liftoff fellows. Each will be supported by CMI for one month in the summer of 2004. This year's fellows were drawn from thirteen universities. ... more ... March 19, 2004. The Clay Mathematics Institute announces its Senior Scholars program. Its aim is to foster mathematical research and the exchange of ideas by providing support for senior mathematicians who will play a central role in a topical program at an institute or university. ... more ... ... more ... March 19-28, 2004. The Clay Research Academy, led by Richard Stanley and Pavel Etingof of MIT, conducted an introduction to research program for 12 high school students at its offices at One Bow Street in Cambridge. Some of the a Colloquium Series lecture notes are now available. Timothy Gowers , recipient of the 1998 Fields Medal for his contributions to functional analysis, delivered the first Clay Public Lecture on Monday, March 22 at 7pm in Lecture Hall A of the Science Center, Harvard University. Gowers spoke on "Is there such a thing as infinity?" This year's public lecture was hosted by the
SIGGRAPH Computer Graphics Newsletter - VisFiles - May 99 Systems succeed or fail largely on how well they solve this problem. standard andMicrosoft needs to lose its fear of platform independence, open standards and http://www.siggraph.org/publications/newsletter/v33n2/columns/hibbard.html
Extractions: First, thanks to Todd Elvins for asking me to take over the VisFiles column. He set a high standard to live up to. I'll start my VisFiles columns by expressing a vision of the future of visualization and discussing the difficult problems that have to be solved to reach that future. This is inspired by Jim Blinn's list of 10 unsolved computer graphics problems - my favorite moment at SIGGRAPH 98. Your comments and thoughts on this column are welcome, as are your suggestions for future columns. (Editor's note: you can review Jim Blinn's SIGGRAPH 98 comments in Computer Graphics 33(1) February 1999 , pps. 43-47.) Computer science and technology are constantly changing, which is what makes them so much fun. The two most important areas of change are: The interface between computers and people - that's where visualization comes in The interface between people and other people created by computer networking.
141-151 of 151 Back | 1
| 2
| 3
| 4
| 5
| 6
| 7
| 8
