The year is 4018. German is widely studied by scholars of classical antiquity, but all knowledge of the mysterious English language has died out.
Scene: A classics department faculty lounge; a few professors are relaxing.
I worry about things like this all the time. Apparently it’s a terrible affliction that strikes those with a background in information theory at higher rates than the general public.
Scientists solve problems; that’s their job. But which problems are promising topics of research? This is the question I set out to answer in Lost in Math at least concerning the foundations of physics.
A first, rough, classification of research problems can be made using Thomas Kuhn’s cycle of scientific theories. Kuhn’s cycle consists of a phase of “normal science” followed by “crisis” leading to a paradigm change, after which a new phase of “normal science” begins. This grossly oversimplifies reality, but it will be good enough for what follows.
A nice little article on a question many of us should be asking ourselves more often. This one has some additional nice overview of bits of physics in addition, but circling back around to the original question is always very valuable.
NetSci 2018, the flagship conference of the Network Science Society, aims to bring together leading researchers and practitioners working in the emerging area of network science. The conference fosters interdisciplinary communication and collaboration in network science research across computer and information sciences, physics, mathematics, statistics, the life sciences, neuroscience, environmental sciences, social sciences, finance and business, arts and design.
NetSci 2018 in Paris, France will be a combination of:
* An International School for students and non-experts (June 11-12, 2018)
* Satellite Symposia (June 11-12, 2018)
* A 3-day Conference (June 13-15, 2018) featuring research in a wide range of topics and in different formats, including keynote and invited talks, oral presentations, posters, and lightning talks.
February 8: Registration opens.
March 20: Registration for presenters of accepted contributions ends.
April 10: Early registration ends.
May 28: Online registration ends.
The International Conference on Complex Systems is a unique interdisciplinary forum that unifies and bridges the traditional domains of science and a multitude of real world systems. Participants will contribute and be exposed to mind expanding concepts and methods from across the diverse field of complex systems science. The conference will be held July 22-27, 2018, in Cambridge, MA, USA.
Special Topic - Artificial Intelligence: This year’s conference will include a day on AI, including its development and potential future. This session will be chaired by Iyad Rahwan of MIT's Media Lab.
A great looking conference coming up with a strong line up of people who’s work I appreciate. It could certainly use some more balance however as it’s almost all white men.
In particular I’d want to see:
Albert-László Barabási (Northeastern University, USA)
Nassim Nicholas Taleb (Real World Risk Institute, USA)
Stuart Kauffman (Institute for Systems Biology, USA)
Simon DeDeo (Carnegie Mellon University, USA)
Stephen Wolfram (Wolfram Research)
César Hidalgo (MIT Media Lab, USA)
Marta González (University of California Berkeley, USA)
Peter Turchin (University of Connecticut, USA)
Mercedes Pascual (University of Chicago, USA) Pending confirmation
Iyad Rahwan (MIT Media Lab, USA)
Sandy Pentland (MIT Media Lab, USA)
Theresa Whelan (U.S. Department of Defense) Pending DOD approval
H. Eugene Stanley (Boston University, USA)
Ricardo Hausmann (Harvard University, USA)
Stephen Grossberg (Boston University, USA)
Daniela Rus (MIT Computer Science & Artificial Intelligence Lab, USA) Pending confirmation
Olaf Sporns (Indiana University Network Science Institute, USA)
Michelle Girvan (University of Maryland, USA) Pending confirmation
Cameron Kerry (MIT Media Lab, USA)
Irving Epstein (Brandeis University, USA)
Algorithmic decipherment is a prime example of a truly unsupervised problem. The first step in the decipherment process is the identification of the encrypted language. We propose three methods for determining the source language of a document enciphered with a monoalphabetic substitution cipher. The best method achieves 97% accuracy on 380 languages. We then present an approach to decoding anagrammed substitution ciphers, in which the letters within words have been arbitrarily transposed. It obtains the average decryption word accuracy of 93% on a set of 50 ciphertexts in 5 languages. Finally, we report the results on the Voynich manuscript, an unsolved fifteenth century cipher, which suggest Hebrew as the language of the document.
Aside: It’s been ages since I’ve seen someone with Refbacks listed on their site!
Another high-profile instance of sexual harassment has rocked a major institution — this time Princeton University in New Jersey. And students say administrators didn’t act transparently or strongly enough when disciplining the alleged perpetrator, a decorated professor.
Once you start reaching Sergio Verdu’s age, and particularly with his achievements, your value to the University becomes more geared toward service. How much service can a professor do with an albatross like this hanging around their neck?
It would be nice if Universities were required to register offenders like this so that applicants to programs would be aware of them prior to applying–a sort of Megan’s Law for the professoriate. Naturally they don’t do this because it goes against their interests, but by the same token this is how a lot of issues run out of control within their sports programs as well. If someone did create such a website, I imagine the chilling effects on colleges and universities would be such that they might change their tunes about how these cases are handled. Immediately recent cases like Michigan State’s athletics problem, USC’s Medical School Dean issues, Christian Ott at Caltech come to mind, but I’m sure there must be hundreds if not thousands of others.
Fortunately even given Sergio’s accomplishments and profile, it will probably take forever for web searches for his name to not surface the story within the top couple of links, but this is sad consolation, particularly in a field like Information Theory which is heavily underrepresented already.
DNA as a data storage medium has several advantages, including far greater data density compared to electronic media. We propose that schemes for data storage in the DNA of living organisms may benefit from studying the reconstruction problem, which is applicable whenever multiple reads of noisy data are available. This strategy is uniquely suited to the medium, which inherently replicates stored data in multiple distinct ways, caused by mutations. We consider noise introduced solely by uniform tandem-duplication, and utilize the relation to constant-weight integer codes in the Manhattan metric. By bounding the intersection of the cross-polytope with hyperplanes, we prove the existence of reconstruction codes with greater capacity than known error-correcting codes, which we can determine analytically for any set of parameters.
The theory developed here (that you will not find in any other course :) has much in common with (and complements) statistical mechanics and field theory courses; partition functions and transfer operators are applied to computation of observables and spectra of chaotic systems.
Nonlinear dynamics 1: Geometry of chaos (see syllabus)
Topology of flows - how to enumerate orbits, Smale horseshoes
Dynamics, quantitative - periodic orbits, local stability
Role of symmetries in dynamics
Nonlinear dynamics 2: Chaos rules (see syllabus)
Transfer operators - statistical distributions in dynamics
Spectroscopy of chaotic systems
Dynamical zeta functions
Dynamical theory of turbulence
The course, which covers the same material and the same exercises as the Georgia Tech course PHYS 7224, is in part an advanced seminar in nonlinear dynamics, aimed at PhD students, postdoctoral fellows and advanced undergraduates in physics, mathematics, chemistry and engineering.
An interesting looking online course that appears to be on a white-labeled Coursera platform.
I’ve come across Predrag Cvitanovic’s work on Group Theory and Lie Groups before, so this portends some interesting work. I’ll have to see if I can carve out some time to sample some of it.
Lane lays out a “brief” history of the 4 billion years of life on Earth. Discusses isotopic fractionation and other evidence that essentially shows a bottleneck between bacteria and archaea (procaryotes) on the one hand and eucaryotes on the other, the latter of which all must have had a single common ancestor based on the genetic profiles we currently see. He suggest that while we should see even more diversity of complex life, we do not, and he hints at the end of the chapter that the reason is energy.
In general, it’s much easier to follow than I anticipated it might be. His writing style is lucid and fluid and he has some lovely prose not often seen in books of this sort. It’s quite a pleasure to read. Additionally he’s doing a very solid job of building an argument in small steps.
I’m watching closely how he’s repeatedly using the word information in his descriptions, and it seems to be a much more universal and colloquial version than the more technical version, but something interesting may come out of it from my philosophical leanings. I can’t wait to get further into the book to see how things develop.