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

Many real-world networks exhibit a high degeneracy at few eigenvalues. We show that a simple transformation of the network's adjacency matrix provides an understanding of the origins of occurrence of high multiplicities in the networks spectra. We find that the eigenvectors associated with the degenerate eigenvalues shed light on the structures contributing to the degeneracy. Since these degeneracies are rarely observed in model graphs, we present results for various cancer networks. This approach gives an opportunity to search for structures contributing to degeneracy which might have an important role in a network.

Analysing degeneracies in networks spectra

(Bi)multi-partite interaction patterns are observed frequently in real-world systems which have inhibitory and excitatory couplings. We hypothesize these structural interaction patterns to be stable and naturally arising in the course of evolution. We demonstrate that a random structure evolves to a (bi)multi-partite structure by imposing stability criterion through minimization of the largest eigenvalue in the genetic algorithm devised on the interacting units having inhibitory and excitatory couplings. The evolved interaction patterns are robust against changes in the initial network architecture as well as against fluctuations in the interaction weights.

Emergence of (bi)multi-partiteness in networks having inhibitory and excitatory couplings

We study the phase synchronized clusters in the diffusively coupled maps on the Cayley tree networks for heterogeneous delay values. Cayley tree networks comprise of two parts: the inner nodes and the boundary nodes. We find that heterogeneous delays lead to various cluster states, such as; (a) cluster state consisting of inner nodes and boundary nodes, and (b) cluster state consisting of only boundary nodes. The former state may comprise of nodes from all the generations forming self-organized cluster or nodes from few generations yielding driven clusters depending upon on the parity of heterogeneous delay values. Furthermore, heterogeneity in delays leads to the lag synchronization between the siblings lying on the boundary by destroying the exact synchronization among them. The time lag being equal to the difference in the delay values. The Lyapunov function analysis sheds light on the destruction of the exact synchrony among the last generation nodes. To the end we discuss the relevance of our results with respect to their applications in the family business as well as in understanding the occurrence of genetic diseases.

Heterogeneous delays making parents synchronized: A coupled maps on Cayley tree model

Understanding the localization properties of eigenvectors of complex networks is important to get insight into various structural and dynamical properties of the corresponding systems. Here, we analytically develop a scheme to construct a highly localized network for a given set of networks parameters that is the number of nodes and the number of interactions. We find that the localization behavior of the principal eigenvector (PEV) of such a network is sensitive against a single edge rewiring. We find evidences for eigenvalue crossing phenomena as a consequence of the single edge rewiring, in turn providing an origin to the sensitive behavior of the PEV localization. These insights were then used to analytically construct the highly localized network for a given set of networks parameters. The analysis provides fundamental insight into relationships between the structural and the spectral properties of networks for PEV localized networks. Further, we substantiate the existence of the eigenvalue crossing phenomenon by considering a linear-dynamical process, namely the ribonucleic acid (RNA) neutral network population dynamical model. The analysis presented here on model networks aids in understanding the steady-state behavior of a broad range of linear-dynamical processes, from epidemic spreading to biochemical dynamics associated with the adjacency matrices.

From Spectra to Localized Networks: A Reverse Engineering Approach

We study localization properties of principal eigenvector (PEV) of multiplex networks. Starting with a multiplex network corresponding to a delocalized PEV, we rewire the network edges using an optimization technique such that the PEV of the rewired multiplex network becomes more localized. The framework allows us to scrutinize structural and spectral properties of the networks at various localization points during the rewiring process. We show that by rewiring only one layer of the multiplex network, we can achieve the PEV localization of the entire system. Our investigations reveal the sensitivity of the PEV to a single edge rewiring in the optimized multiplex network structure corresponding to the most localized PEV providing the deeper insight into the localization behavior of the multiplex networks. Furthermore, by constructing multiplex network using real-world social and biological data, we show that our simulation results for model multiplex network are in good agreement with the properties of these real-world multiplex network. The study is relevant to applications that require understanding of how perturbation propagates in multiplex networks.

Sarika Jalan

Papers

Analysing degeneracies in networks spectra

Emergence of (bi)multi-partiteness in networks having inhibitory and excitatory couplings

Heterogeneous delays making parents synchronized: A coupled maps on Cayley tree model

From Spectra to Localized Networks: A Reverse Engineering Approach

Localization of multiplex networks by the optimized single-layer rewiring