Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

Machine learning

So far in this course we have dealt entirely with the evolution of characters that are controlled by simple Mendelian inheritance at a single locus. There are notes on the course website about gametic disequilibrium and how allele frequencies change at two loci simultaneously, but we didn’t discuss them. In every example we’ve considered we’ve imagined that we could understand something about evolution by examining the evolution of a single gene. That’s the domain of classical population genetics. For the next few weeks we’re going to be exploring a field that’s actually older than classical population genetics, although the approach we’ll be taking to it involves the use of population genetic machinery. If you know a little about the history of evolutionary biology, you may know that after the rediscovery of Mendel’s work in 1900 there was a heated debate between the “biometricians” (e.g., Galton and Pearson) and the “Mendelians” (e.g., de Vries, Correns, Bateson, and Morgan). Biometricians asserted that the really important variation in evolution didn’t follow Mendelian rules. Height, weight, skin color, and similar traits seemed to

Human biochemical genetics

Statistical physics has proven to be a fruitful framework to describe phenomena outside the realm of traditional physics. Recent years have witnessed an attempt by physicists to study collective phenomena emerging from the interactions of individuals as elementary units in social structures. A wide list of topics are reviewed ranging from opinion and cultural and language dynamics to crowd behavior, hierarchy formation, human dynamics, and social spreading. The connections between these problems and other, more traditional, topics of statistical physics are highlighted. Comparison of model results with empirical data from social systems are also emphasized.

Statistical physics of social dynamics

1980 Preface * 1999 Preface * 1999 Acknowledgements * Introduction * 1 Circular Logic * 2 Phase Singularities (Screwy Results of Circular Logic) * 3 The Rules of the Ring * 4 Ring Populations * 5 Getting Off the Ring * 6 Attracting Cycles and Isochrons * 7 Measuring the Trajectories of a Circadian Clock * 8 Populations of Attractor Cycle Oscillators * 9 Excitable Kinetics and Excitable Media * 10 The Varieties of Phaseless Experience: In Which the Geometrical Orderliness of Rhythmic Organization Breaks Down in Diverse Ways * 11 The Firefly Machine 12 Energy Metabolism in Cells * 13 The Malonic Acid Reagent ('Sodium Geometrate') * 14 Electrical Rhythmicity and Excitability in Cell Membranes * 15 The Aggregation of Slime Mold Amoebae * 16 Numerical Organizing Centers * 17 Electrical Singular Filaments in the Heart Wall * 18 Pattern Formation in the Fungi * 19 Circadian Rhythms in General * 20 The Circadian Clocks of Insect Eclosion * 21 The Flower of Kalanchoe * 22 The Cell Mitotic Cycle * 23 The Female Cycle * References * Index of Names * Index of Subjects

https://www.cambridge.org/core/services/aop-cambridge-core/content/view/596B270197FE27DE5FABB598B6210622/S0025557200150892a.pdf/div-class-title-span-class-italic-the-geometry-of-biological-time-span-by-a-t-winfree-pp-544-dm68-corrected-second-printing-1990-isbn-3-540-52528-9-springer-div.pdf

The geometry of biological time , by A. T. Winfree. Pp 544. DM68. Corrected Second Printing 1990. ISBN 3-540-52528-9 (Springer)

Monthly Notices is one of the three largest general primary astronomical research publications. It is an international journal, published by the Royal Astronomical Society. This article 1 describes its publication policy and practice.

Monthly Notices of the Royal Astronomical Society

Arrays of identical oscillators can display a remarkable spatiotemporal pattern in which phase-locked oscillators coexist with drifting ones. Discovered two years ago, such "chimera states" are believed to be impossible for locally or globally coupled systems; they are peculiar to the intermediate case of nonlocal coupling. Here we present an exact solution for this state, for a ring of phase oscillators coupled by a cosine kernel. We show that the stable chimera state bifurcates from a spatially modulated drift state, and dies in a saddle-node bifurcation with an unstable chimera state.

http://dmabrams.esam.northwestern.edu/pubs/Abrams%20and%20Strogatz%20-%20Chimera%20States%20for%20Coupled%20Oscillators%20-%20PRL%202004.pdf

Chimera states for coupled oscillators.

A chimera state is a spatio-temporal pattern in a network of identical coupled oscillators in which synchronous and asynchronous oscillation coexist. This state of broken symmetry, which usually coexists with a stable spatially symmetric state, has intrigued the nonlinear dynamics community since its discovery in the early 2000s. Recent experiments have led to increasing interest in the origin and dynamics of these states. Here we review the history of research on chimera states and highlight major advances in understanding their behaviour.

http://dmabrams.esam.northwestern.edu/pubs/Panaggio%20and%20Abrams%20-%20Chimera%20states%20(review)%20-%20Nonlinearity%2028,%20R67-R87%20(2015).pdf

Chimera states: Coexistence of coherence and incoherence in networks of coupled oscillators

Networks of identical, symmetrically coupled oscillators can spontaneously split into synchronized and desynchronized subpopulations. Such chimera states were discovered in 2002, but are not well understood theoretically. Here we obtain the first exact results about the stability, dynamics, and bifurcations of chimera states by analyzing a minimal model consisting of two interacting populations of oscillators. Along with a completely synchronous state, the system displays stable chimeras, breathing chimeras, and saddle-node, Hopf, and homoclinic bifurcations of chimeras.

/pdf/solvable-model-for-chimera-states-of-coupled-oscillators-27bhz8ixn8.pdf

Solvable model for chimera states of coupled oscillators

Thousands of the world's languages are vanishing at an alarming rate, with 90% of them being expected to disappear with the current generation1. Here we develop a simple model of language competition that explains historical data on the decline of Welsh, Scottish Gaelic, Quechua (the most common surviving indigenous language in the Americas) and other endangered languages. A linguistic parameter that quantifies the threat of language extinction can be derived from the model and may be useful in the design and evaluation of language-preservation programmes.

Daniel M. Abrams

Papers

Chimera states for coupled oscillators.

Chimera states: Coexistence of coherence and incoherence in networks of coupled oscillators

Solvable model for chimera states of coupled oscillators

Chimera states: Coexistence of coherence and incoherence in networks of coupled oscillators

Linguistics: modelling the dynamics of language death.