다중혈관 관상동맥 환자에서 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

[신간의 별자리x] 우리/미술, 그리고 ‘슬픔의 박물관’

http://www.maths.qmul.ac.uk/%7Elatora/report_06.pdf

Complex networks: Structure and dynamics

We analyze gene coexpression network under the random matrix theory framework. The nearest-neighbor spacing distribution of the adjacency matrix of this network follows Gaussian orthogonal statistics of random matrix theory (RMT). Spectral rigidity test follows random matrix prediction for a certain range and deviates afterwards. Eigenvector analysis of the network using inverse participation ratio suggests that the statistics of bulk of the eigenvalues of network is consistent with those of the real symmetric random matrix, whereas few eigenvalues are localized. Based on these IPR calculations, we can divide eigenvalues in three sets: (a) The nondegenerate part that follows RMT. (b) The nondegenerate part, at both ends and at intermediate eigenvalues, which deviates from RMT and expected to contain information about important nodes in the network. (c) The degenerate part with zero eigenvalue, which fluctuates around RMT-predicted value. We identify nodes corresponding to the dominant modes of the corresponding eigenvectors and analyze their structural properties.

Random matrix analysis of localization properties of gene coexpression network.

We investigate spatio-temporal patterns occurring in a two-layer multiplex network of oscillatory FitzHugh-Nagumo neurons, where each layer is represented by a nonlocally coupled ring. We show that weak multiplexing, i.e., when the coupling between the layers is smaller than that within the layers, can have a significant impact on the dynamics of the neural network. We develop control strategies based on weak multiplexing and demonstrate how the desired state in one layer can be achieved without manipulating its parameters, but only by adjusting the other layer. We find that for coupling range mismatch weak multiplexing leads to the appearance of chimera states with different shapes of the mean velocity profile for parameter ranges where they do not exist in isolation. Moreover, we show that introducing a coupling strength mismatch between the layers can suppress chimera states with one incoherent domain (one-headed chimeras) and induce various other regimes such as in-phase synchronization or two-headed chimeras. Interestingly, small intra-layer coupling strength mismatch allows to achieve solitary states throughout the whole network.

Weak multiplexing in neural networks: Switching between chimera and solitary states

We study self-organized (s-) and driven (d-) synchronization in coupled map networks for some simple networks, namely two and three node networks and their natural generalization to globally coupled and complete bipartite networks. We use both linear stability analysis and Lyapunov function approach for this study and determine stability conditions for synchronization. We see that most of the features of coupled dynamics of small networks with two or three nodes, are carried over to the larger networks of the same type. The phase diagrams for the networks studied here have features very similar to the different kinds of networks studied in Ref. \cite{sarika-REA2}. The analysis of the dynamics of the difference variable corresponding to any two nodes shows that when the two nodes are in driven synchronization, all the coupling terms cancel out whereas when they are in self-organized synchronization, the direct coupling term between the two nodes adds an extra decay term while the other couplings cancel out.

Synchronized clusters in coupled map networks: Stability analysis

We present the emergence of chimeras, a state referring to coexistence of partly coherent, partly incoherent dynamics in networks of identical oscillators, in a multiplex network consisting of two non-identical layers which are interconnected. We demonstrate that the parameter range displaying the chimera state in the homogeneous first layer of the multiplex networks can be tuned by changing the link density or connection architecture of the same nodes in the second layer. We focus on the impact of the interconnected second layer on the enlargement or shrinking of the coupling regime for which chimeras are displayed in the homogeneous first layer. We find that a denser homogeneous second layer promotes chimera in a sparse first layer, where chimeras do not occur in isolation. Furthermore, while a dense connection density is required for the second layer if it is homogeneous, this is not true if the second layer is inhomogeneous. We demonstrate that a sparse inhomogeneous second layer which is common in real-world complex systems, can promote chimera states in a sparse homogeneous first layer.

Non-identical multiplexing promotes chimera states

To date, explosive synchronization (ES) in a network is shown to be originated from considering either degree-frequency correlation, frequency-coupling strength correlation, inertia, or adaptively controlled phase oscillators. Here we show that ES is a generic phenomenon and can occur in any network by multiplexing it with an appropriate layer without even considering any prerequisite for the emergence of ES. We devise a technique which leads to the occurrence of ES with hysteresis loop in a network upon its multiplexing with a negatively coupled (or inhibitory) layer. The impact of various structural properties of positively coupled (or excitatory) and inhibitory layers along with the strength of multiplexing in gaining control over the induced ES transition is discussed. Analytical prediction for the spread of phase distribution of each layer is provided, which is in good agreement with the numerical assessment. This investigation is a step forward in highlighting the importance of multiplex framework not only in bringing phenomena which are not possible in an isolated network but also in providing more structural control over the induced phenomena.

Sarika Jalan

Papers

Random matrix analysis of localization properties of gene coexpression network.

Weak multiplexing in neural networks: Switching between chimera and solitary states

Synchronized clusters in coupled map networks: Stability analysis

Non-identical multiplexing promotes chimera states

Inhibition-induced explosive synchronization in multiplex networks.