Catch up on stories from the past week (and beyond) at the Slashdot story archive

 



Forgot your password?
typodupeerror
×
Space

Scientists Discover Biggest Star 202

Hugh Pickens writes "Scientists at the University of Sheffield have discovered the most massive stellar giant, R136a1 measured at 265 solar masses, using the European Southern Observatory's Very Large Telescope in Chile and data from the Hubble Space Telescope. It's in the Tarantula Nebula in the Large Magellanic Cloud, a small 'satellite' galaxy which orbits the Milky Way. Previously, the heaviest known stars were around 150 times the mass of the Sun, known as the 'Eddington Limit,' and this was believed to be close to the cosmic size limit because as stars get larger, the amount of energy created in their cores grows faster than the force of gravity which holds them together. 'Because of their proximity to the Eddington Limit they lose mass at a pretty high rate,' says Professor Paul Crowther, the chief researcher in the Sheffield team. Hyper-stars like R136a1 are believed to be formed from several young stars merging together, and are only found in the very heart of stellar clusters. R136a1 is believed to have a surface temperature of more than 40,000 degrees Celsius, and is 10 million times brighter than the Sun. Crowther adds that R136a1 is about as big as stars can get. 'Owing to the rarity of these monsters, I think it is unlikely that this new record will be broken any time soon.'"

Comment Re:No surprise here, this is DePaul (Score 1) 71

Yes, sometimes they do have programs that are very easy to go through quickly. However, if you get a good advisor (which CDM has, more often than not) you can substitute more classes and in turn, get more knowledge in useful areas. They do (at least for CS) have a lot of professors who teach fun independent studies and seminar classes.
Patents

HP Patents Bignum Implementation From 1912 144

I Don't Believe in Imaginary Property writes "The authors of GMP (the GNU Multiple Precision Arithmetic Library) were invited to join Peer-to-Patent to review HP's recent patent on a very old technique for implementing bignums because their software might infringe. Basically, HP's patent claims choosing an exponent based on processor word size. If you choose a 4-bit word size and a binary number, you end up working in hexadecimal. Or for a computer with a 16-bit word and a base-10 number, you use base 10,000 so that each digit of the base-10,000 number would fit into a single 16-bit word. The obvious problem with that is that there's plenty of prior art here. Someone who spent a few minutes Googling found that Knuth describing the idea in TAOCP Vol. 2 and other citations go back to 1912 (which implemented the same algorithm using strips of cardboard and a calculating machine). None of this can be found in the 'references cited' section. Even though the patent examiner did add a couple of references, they appear to have cited some old patents. The patent issued a few months ago was filed back in October of 2004, and collected dust at the USPTO for some 834 days."

Slashdot Top Deals

The rule on staying alive as a program manager is to give 'em a number or give 'em a date, but never give 'em both at once.

Working...