There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。

疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A

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

In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three cases: 1) directed networks with fixed topology; 2) directed networks with switching topology; and 3) undirected networks with communication time-delays and fixed topology. We introduce two consensus protocols for networks with and without time-delays and provide a convergence analysis in all three cases. We establish a direct connection between the algebraic connectivity (or Fiedler eigenvalue) of the network and the performance (or negotiation speed) of a linear consensus protocol. This required the generalization of the notion of algebraic connectivity of undirected graphs to digraphs. It turns out that balanced digraphs play a key role in addressing average-consensus problems. We introduce disagreement functions for convergence analysis of consensus protocols. A disagreement function is a Lyapunov function for the disagreement network dynamics. We proposed a simple disagreement function that is a common Lyapunov function for the disagreement dynamics of a directed network with switching topology. A distinctive feature of this work is to address consensus problems for networks with directed information flow. We provide analytical tools that rely on algebraic graph theory, matrix theory, and control theory. Simulations are provided that demonstrate the effectiveness of our theoretical results.

/pdf/consensus-problems-in-networks-of-agents-with-switching-25c3hqvtd8.pdf

Consensus problems in networks of agents with switching topology and time-delays

Dynamic models of nanometer-scale phenomena often require an explicit consideration of interactions among a large number of atoms or molecules. The corresponding mathematical representation may thus be high-dimensional and stochastic, incompatible with tools in nonlinear control theory that are designed for low-dimensional deterministic equations. We consider here a general class of probabilistic systems that are linear in the state, but whose input enters as a function multiplying the state vector. Model reduction is accomplished by grouping probabilities that evolve together, and truncating states that are unlikely to be accessed. An error bound for this reduction is also derived. A system identification approach that exploits the inherent linearity is then developed, that generates all coefficients in either a full or reduced model. These concepts are then extended to extremely high-dimensional systems, in which kinetic Monte Carlo simulations provide the input-output data. This work was motivated by our interest in thin film deposition. We demonstrate the approaches developed in the paper on a kinetic Monte Carlo simulation of surface evolution during film growth, and use the reduced model to compute optimal temperature profiles that minimize surface roughness.

Reduction and Identification Methods for Nonhomogeneous Markovian Control Systems, with Applications to Thin Film Deposition

Delineating the strategies by which cells contend with combinatorial changing environments is crucial for understanding cellular regulatory organization. When presented with two carbon sources, microorganisms first consume the carbon substrate that supports the highest growth rate (e.g. glucose) and then switch to the secondary carbon source (e.g. galactose), a paradigm known as the Monod model. Sequential sugar utilization has been attributed to transcriptional repression of the secondary metabolic pathway, followed by activation of this pathway upon depletion of the preferred carbon source. In this work, we challenge this notion. Although Saccharomyces cerevisiae cells consume glucose before galactose, we demonstrate that the galactose regulatory pathway is activated in a fraction of the cell population hours before glucose is fully consumed. This early activation reduces the time required for the population to transition between the two metabolic programs and provides a fitness advantage that might be crucial in competitive environments. Importantly, these findings define a new paradigm for the response of microbial populations to combinatorial carbon sources.

/pdf/population-diversification-in-a-yeast-metabolic-program-59ocej7wgq.pdf

Population diversification in a yeast metabolic program promotes anticipation of environmental shifts

Chapter 1. Introductory Concepts

Motivated by exploration of communication-constrained underground environments using robot teams, we study the problem of planning for intermittent connectivity in multi-agent systems. We propose a novel concept of information-consistency to handle situations where the plan is not initially known by all agents, and suggest an integer linear program for synthesizing information-consistent plans that also achieve auxiliary goals. Furthermore, inspired by network flow problems we propose a novel way to pose connectivity constraints that scales much better than previous methods. In the second part of the paper we apply these results in an exploration setting, and propose a clustering method that separates a large exploration problem into smaller problems that can be solved independently. We demonstrate how the resulting exploration algorithm is able to coordinate a team of ten agents to explore a large environment.

Intermittent Connectivity for Exploration in Communication-Constrained Multi-Agent Systems

As a direct contribution to recent efforts of bringing formal design-by-contract methods to hybrid systems, we introduce a variant of modal interface contract theory based on input/output automata with guarded transitions. We present an algebra of operators for interface composition, contract composition, contract conjunction, contract refinement and some theorems to demonstrate that our contract object has reasonably universal semantics. As an application, we use our framework to aid the design of a networked control system of traffic.

/pdf/a-modal-interface-contract-theory-for-guarded-input-output-2tdbgmhdkj.pdf

Richard M. Murray

Papers

Reduction and Identification Methods for Nonhomogeneous Markovian Control Systems, with Applications to Thin Film Deposition

Population diversification in a yeast metabolic program promotes anticipation of environmental shifts

Chapter 1. Introductory Concepts

Intermittent Connectivity for Exploration in Communication-Constrained Multi-Agent Systems

A modal interface contract theory for guarded input/output automata with an application in traffic system design