Slashdot is powered by your submissions, so send in your scoop


Forgot your password?

Cutting Umbilical Cord Early Eliminates Stem Cells 139

GeneralSoh writes "Delaying clamping the umbilical cord at birth may have far-reaching benefits for your baby, according to researchers at the University of South Florida's Center of Excellence for Aging and Brain Repair — and should be delayed for at least a few minutes longer after birth. This new recommendation published in the most recent Journal of Cellular and Molecular Medicine (14:3) notes that delaying clamping the umbilical cord allows more umbilical cord blood and crucial stem cells to transfer from mama to baby."

Jetman Attempts Intercontinental Flight 140

Last year we ran the story of Yves Rossy and his DIY jetwings. Yves spent $190,000 and countless hours building a set of jet-powered wings which he used to cross the English Channel. Rossy's next goal is to cross the Strait of Gibraltar, from Tangier in Morocco and Tarifa on the southwestern tip of Spain. From the article: "Using a four-cylinder jet pack and carbon fibre wings spanning over 8ft, he will jump out of a plane at 6,500 ft and cruise at 130 mph until he reaches the Spanish coast, when he will parachute to earth." Update 18:57 GMT: mytrip writes: "Yves Rossy took off from Tangiers but five minutes into an expected 15-minute flight he was obliged to ditch into the wind-swept waters."

Comment Article misrepresents complexity theory (Score 2) 421

From the article: "By showing that some common game-theoretical problems are so hard that they’d take the lifetime of the universe to solve, Daskalakis is suggesting that they can’t accurately represent what happens in the real world." But he didn't actually show this. He showed (again from TFA): "Daskalakis proved that the Nash equilibrium belongs to a subset of NP consisting of hard problems with the property that a solution to one can be adapted to solve all the others." I.e. computing the Nash equilibrium is NP-complete. These problems have no efficient solution if (and only if) P != NP. That is if there is a polynomial (efficient) solution for any of these, then there is a polynomial time solution for all. We don't know WHETHER THAT'S TRUE. Computer scientists suspect very strongly that there is no polynomial time solution for these problems, but it isn't known for sure.

Rotten Office Fridge Cleanup Sends 7 To Hospital 410

bokske writes "An office worker cleaning a fridge full of rotten food created a smell so noxious that it sent seven co-workers to the hospital and made many others ill. Firefighters had to evacuate the AT&T building in downtown San Jose on Tuesday, after the flagrant fumes prompted someone to call 911. A hazmat team was called in. Just another day at the office."

Comment CO2 is Balanced (Score 2, Informative) 468

Actually shouldn't have TOO much effect. I can't comment on the cylinders of CO2 used in pumping or carbonation, but the CO2 that the yeast releases is balanced by the CO2 which the plant absorb in order to produce the sugar that is fermented.

As to how many petrochemicals/fossil fuels are used in the production/creation of those plants and that sugar, that's a different story, but that is less related to alcohol specifically and more to how our agricultural/transportation system function generally.

Comment Re:Very cool, but np-complete? (Score 3, Interesting) 48

If it is done in polynomial time, then it would by definition be in P which means it would NOT be NP complete unless P=NP.

I think you are trying to ask how it could be done in less than exponential time (which is how fast the fastest algorithms to solve NP complete problems run).

I personally would expect an algorithm to perform the match would run in O(U*US+K*KS+UI*KI*U) where U=the number of unknown (ie flickr pictures), K=the number of known pictures, US=the average size of an unknown picture, K=the size of the average known picture, UI=the number of interesting things in an unknown picture and KI=the number of interesting things in a known picture. However, it would often run faster because it should be fairly easy to disqualify two pictures as containing any of the same interesting features.


The Ouroborus 67

If I could do this I'd never leave the house.

Slashdot Top Deals

Vax Vobiscum