78303561
submission
JoshuaZ writes:

*November 2nd marked fifteen years of continuous habitation by humans in the International Space Station. Expedition 1 arrived on November 2nd, 2000 and there has been a continual presence through the current Expedition 45. Over that time, the station has grown with the addition of many new modules such as the Destiny module https://en.wikipedia.org/wiki/Destiny_(ISS_module), added in 2001, as well Columbus, was added in 2007 https://en.wikipedia.org/wiki/Columbus_(ISS_module), and Kibo, added also in 2007, https://en.wikipedia.org/wiki/Kibo_(ISS_module), among others. Current plans call for the station to be operational through 2020 but what will happen after that is uncertain. http://www.cbsnews.com/news/nasa-looks-to-post-2020-international-space-station-operations/*
78297137
submission
JoshuaZ writes:

*A major open problem in graph theory is how efficiently one can tell given two graphs whether or not they are isomorphic, that is, the same graph with just the labels changed. This problem is famous along with factoring integers as a problem that is potentially in between P and NP in difficulty. Now, Laszlo Babai has reported that he has a quasipolynomial time algorithm which he sketched out at a set of talks at the University of Chicago http://www.math.uchicago.edu/calendar?calendar=Combinatorics%20and%20Theoretical%20Computer%20Science. Scott Aaronson was one of the first to break the news and his latest blog entry and its comments contains further discussion of the result http://www.scottaaronson.com/blog/?p=2521. The new algorithm places the problem of graph isomorphism as at most just barely above P. Babai's result depends on the classification of finite simple groups https://en.wikipedia.org/wiki/Classification_of_finite_simple_groups a deep result in algebra whose proof consists of thousands of pages over hundreds of distinct papers. Unlike the problem of factoring integers, improvements in this algorithm are unlikely to impact cryptography in any direct way since no cryptographic systems depend on the difficulty of determining when groups are isomorphic.*
74857101
submission
JoshuaZ writes:

*"Researchers from Brown University have tentatively identified an alloy of hafnium, nitrogen and carbon as having an expected melting point of about 7,460 degrees Fahrenheit (4120 Celsius). This exceeds the previous record breaker tantalum hafnium carbide which melts at 7,128 F (3942 C) and had stood as the record holder for almost a century. However, at this point, the record setter is still hypothetical, based on simulations. The new record has not yet been confirmed by experiment. http://journals.aps.org/prb/abstract/10.1103/PhysRevB.92.020104 is the actual article while http://www.washingtonpost.com/news/speaking-of-science/wp/2015/07/28/behold-a-new-record-for-the-worlds-highest-melting-point/ is a lay summary. If the simulations turn out to be correct, the new alloy may be useful in parts like jet engines, and the door will be opened to using similar simulations to search for substances with even higher melting points or with other exotic properties.*