Coexistence and specialization of pathogen strains on contact networks.
Eames, Ken T D; Keeling, Matt J
2006-08-01
The coexistence of different pathogen strains has implications for pathogen variability and disease control and has been explained in a number of different ways. We use contact networks, which represent interactions between individuals through which infection could be transmitted, to investigate strain coexistence. For sexually transmitted diseases the structure of contact networks has received detailed study and has been shown to be a vital determinant of the epidemiological dynamics. By using analytical pairwise models and stochastic simulations, we demonstrate that network structure also has a profound influence on the interaction between pathogen strains. In particular, when the population is serially monogamous, fully cross-reactive strains can coexist, with different strains dominating in network regions with different characteristics. Furthermore, we observe specialization of different strains in different risk groups within the network, suggesting the existence of diverging evolutionary pressures.
What serial homologs can tell us about the origin of insect wings
2017-01-01
Although the insect wing is a textbook example of morphological novelty, the origin of insect wings remains a mystery and is regarded as a chief conundrum in biology. Centuries of debates have culminated into two prominent hypotheses: the tergal origin hypothesis and the pleural origin hypothesis. However, between these two hypotheses, there is little consensus in regard to the origin tissue of the wing as well as the evolutionary route from the origin tissue to the functional flight device. Recent evolutionary developmental (evo-devo) studies have shed new light on the origin of insect wings. A key concept in these studies is “serial homology”. In this review, we discuss how the wing serial homologs identified in recent evo-devo studies have provided a new angle through which this century-old conundrum can be explored. We also review what we have learned so far from wing serial homologs and discuss what we can do to go beyond simply identifying wing serial homologs and delve further into the developmental and genetic mechanisms that have facilitated the evolution of insect wings. PMID:28357056
Reverse engineering a gene network using an asynchronous parallel evolution strategy
2010-01-01
Background The use of reverse engineering methods to infer gene regulatory networks by fitting mathematical models to gene expression data is becoming increasingly popular and successful. However, increasing model complexity means that more powerful global optimisation techniques are required for model fitting. The parallel Lam Simulated Annealing (pLSA) algorithm has been used in such approaches, but recent research has shown that island Evolutionary Strategies can produce faster, more reliable results. However, no parallel island Evolutionary Strategy (piES) has yet been demonstrated to be effective for this task. Results Here, we present synchronous and asynchronous versions of the piES algorithm, and apply them to a real reverse engineering problem: inferring parameters in the gap gene network. We find that the asynchronous piES exhibits very little communication overhead, and shows significant speed-up for up to 50 nodes: the piES running on 50 nodes is nearly 10 times faster than the best serial algorithm. We compare the asynchronous piES to pLSA on the same test problem, measuring the time required to reach particular levels of residual error, and show that it shows much faster convergence than pLSA across all optimisation conditions tested. Conclusions Our results demonstrate that the piES is consistently faster and more reliable than the pLSA algorithm on this problem, and scales better with increasing numbers of nodes. In addition, the piES is especially well suited to further improvements and adaptations: Firstly, the algorithm's fast initial descent speed and high reliability make it a good candidate for being used as part of a global/local search hybrid algorithm. Secondly, it has the potential to be used as part of a hierarchical evolutionary algorithm, which takes advantage of modern multi-core computing architectures. PMID:20196855
Molluscan engrailed expression, serial organization, and shell evolution
NASA Technical Reports Server (NTRS)
Jacobs, D. K.; Wray, C. G.; Wedeen, C. J.; Kostriken, R.; DeSalle, R.; Staton, J. L.; Gates, R. D.; Lindberg, D. R.
2000-01-01
Whether the serial features found in some molluscs are ancestral or derived is considered controversial. Here, in situ hybridization and antibody studies show iterated engrailed-gene expression in transverse rows of ectodermal cells bounding plate field development and spicule formation in the chiton, Lepidochitona cavema, as well as in cells surrounding the valves and in the early development of the shell hinge in the clam, Transennella tantilla. Ectodermal expression of engrailed is associated with skeletogenesis across a range of bilaterian phyla, suggesting a single evolutionary origin of invertebrate skeletons. The shared ancestry of bilaterian-invertebrate skeletons may help explain the sudden appearance of shelly fossils in the Cambrian. Our interpretation departs from the consideration of canonical metameres or segments as units of evolutionary analysis. In this interpretation, the shared ancestry of engrailed-gene function in the terminal/posterior addition of serially repeated elements during development explains the iterative expression of engrailed genes in a range of metazoan body plans.
Reaction kinetics in open reactors and serial transfers between closed reactors
NASA Astrophysics Data System (ADS)
Blokhuis, Alex; Lacoste, David; Gaspard, Pierre
2018-04-01
Kinetic theory and thermodynamics of reaction networks are extended to the out-of-equilibrium dynamics of continuous-flow stirred tank reactors (CSTR) and serial transfers. On the basis of their stoichiometry matrix, the conservation laws and the cycles of the network are determined for both dynamics. It is shown that the CSTR and serial transfer dynamics are equivalent in the limit where the time interval between the transfers tends to zero proportionally to the ratio of the fractions of fresh to transferred solutions. These results are illustrated with a finite cross-catalytic reaction network and an infinite reaction network describing mass exchange between polymers. Serial transfer dynamics is typically used in molecular evolution experiments in the context of research on the origins of life. The present study is shedding a new light on the role played by serial transfer parameters in these experiments.
Diogo, Rui; Molnar, Julia
2014-06-01
For more than two centuries, the idea that the forelimb and hindlimb are serially homologous structures has been accepted without serious question. This study presents the first detailed analysis of the evolution and homologies of all hindlimb muscles in representatives of each major tetrapod group and proposes a unifying nomenclature for these muscles. These data are compared with information obtained previously about the forelimb muscles of tetrapods and the muscles of other gnathostomes in order to address one of the most central and enigmatic questions in evolutionary and comparative anatomy: why are the pelvic and pectoral appendages of gnathostomes generally so similar to each other? An integrative analysis of the new myological data, combined with a review of recent paleontological, developmental, and genetic works and of older studies, does not support serial homology between the structures of these appendages. For instance, many of the strikingly similar forelimb and hindlimb muscles found in each major extant tetrapod taxon were acquired at different geological times and/or have different embryonic origins. These similar muscles are not serial homologues, but the result of evolutionary parallelism/convergence due to a complex interplay of ontogenetic, functional, topological, and phylogenetic constraints/factors. Copyright © 2014 Wiley Periodicals, Inc.
Abbasi, R; Marcus, J M
2015-11-01
Ocelli are serially repeated colour patterns on the wings of many butterflies. Eyespots are elaborate ocelli that function in predator avoidance and deterrence as well as in mate choice. A phylogenetic approach was used to study ocelli and eyespot evolution in Vanessa butterflies, a genus exhibiting diverse phenotypes among these serial homologs. Forty-four morphological characters based on eyespot number, arrangement, shape and the number of elements in each eyespot were defined and scored. Ocelli from eight wing cells on the dorsal and ventral surfaces of the forewing and hindwing were evaluated. The evolution of these characters was traced over a phylogeny of Vanessa based on 7750 DNA base pairs from 10 genes. Our reconstruction predicts that the ancestral Vanessa had 5 serially arranged ocelli on all four wing surfaces. The ancestral state on the dorsal forewing and ventral hindwing was ocelli arranged in two heterogeneous groups. On the dorsal hindwing, the ancestral state was either homogenous or ocelli arranged in two heterogeneous groups. On the ventral forewing, we determined that the ancestral state was organized into three heterogeneous groups. In Vanessa, almost all ocelli are individuated and capable of independent evolution relative to other colour patterns except for the ocelli in cells -1 and 0 on the dorsal and ventral forewings, which appear to be constrained to evolve in parallel. The genus Vanessa is a good model system for the study of serial homology and the interaction of selective forces with developmental architecture to produce diversity in butterfly colour patterns. © 2015 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2015 European Society For Evolutionary Biology.
Allen, Cerisse E; Beldade, Patrícia; Zwaan, Bas J; Brakefield, Paul M
2008-03-26
There is spectacular morphological diversity in nature but lineages typically display a limited range of phenotypes. Because developmental processes generate the phenotypic variation that fuels natural selection, they are a likely source of evolutionary biases, facilitating some changes and limiting others. Although shifts in developmental regulation are associated with morphological differences between taxa, it is unclear how underlying mechanisms affect the rate and direction of evolutionary change within populations under selection. Here we focus on two ecologically relevant features of butterfly wing color patterns, eyespot size and color composition, which are similarly and strongly correlated across the serially repeated eyespots. Though these two characters show similar patterns of standing variation and covariation within a population, they differ in key features of their underlying development. We targeted pairs of eyespots with artificial selection for coordinated (concerted selection) versus independent (antagonistic selection) change in their color composition and size and compared evolutionary responses of the two color pattern characters. The two characters respond to selection in strikingly different ways despite initially similar patterns of variation in all directions present in the starting population. Size (determined by local properties of a diffusing inductive signal) evolves flexibly in all selected directions. However, color composition (determined by a tissue-level response to the signal concentration gradient) evolves only in the direction of coordinated change. There was no independent evolutionary change in the color composition of two eyespots in response to antagonistic selection. Moreover, these differences in the directions of short-term evolutionary change in eyespot size and color composition within a single species are consistent with the observed wing pattern diversity in the genus. Both characters respond rapidly to selection for coordinated change, but there are striking differences in their response to selection for antagonistic, independent change across eyespots. While many additional factors may contribute to both short- and long-term evolutionary response, we argue that the compartmentalization of developmental processes can influence the diversification of serial repeats such as butterfly eyespots, even under strong selection.
Serials Control System Procedures and Policies.
ERIC Educational Resources Information Center
Schlembach, Mary C.
This document includes procedures and policies for a networked serials control system originally developed at the Grainger Engineering Library Information Center at the University of Illinois at Urbana-Champaign (UIUC). The serials control systems encompass serials processing, public service, and end-user functions. The system employs a…
Crosetto, D.B.
1996-12-31
The present device provides for a dynamically configurable communication network having a multi-processor parallel processing system having a serial communication network and a high speed parallel communication network. The serial communication network is used to disseminate commands from a master processor to a plurality of slave processors to effect communication protocol, to control transmission of high density data among nodes and to monitor each slave processor`s status. The high speed parallel processing network is used to effect the transmission of high density data among nodes in the parallel processing system. Each node comprises a transputer, a digital signal processor, a parallel transfer controller, and two three-port memory devices. A communication switch within each node connects it to a fast parallel hardware channel through which all high density data arrives or leaves the node. 6 figs.
Crosetto, Dario B.
1996-01-01
The present device provides for a dynamically configurable communication network having a multi-processor parallel processing system having a serial communication network and a high speed parallel communication network. The serial communication network is used to disseminate commands from a master processor (100) to a plurality of slave processors (200) to effect communication protocol, to control transmission of high density data among nodes and to monitor each slave processor's status. The high speed parallel processing network is used to effect the transmission of high density data among nodes in the parallel processing system. Each node comprises a transputer (104), a digital signal processor (114), a parallel transfer controller (106), and two three-port memory devices. A communication switch (108) within each node (100) connects it to a fast parallel hardware channel (70) through which all high density data arrives or leaves the node.
Sexually transmitted infection and the evolution of serial monogamy
McLeod, David V.; Day, Troy
2014-01-01
The selective forces shaping mating systems have long been of interest to biologists. One particular selective pressure that has received comparatively little attention is sexually transmitted infections (STIs). While it has been hypothesized that STIs could drive the evolutionary emergence of monogamy, there is little theoretical support. Here we use an evolutionary invasion analysis to determine what aspects of pathogen virulence and transmission are necessary for serial monogamy to evolve in a promiscuous population. We derive a biologically intuitive invasion condition in terms of population-specific quantities. From this condition, we obtain two main results. First, when pathogen virulence causes mortality rather than sterility, monogamy is more likely to evolve. Second, we find that at intermediate pathogen transmission rates, monogamy is the most selectively advantageous, whereas at high- and low-transmission rates, monogamy is generally selected against. As a result, it is possible for a pathogen to be highly virulent, yet for promiscuity to persist. PMID:25320174
Using the OCLC union listing component for a statewide health sciences union list of serials.
Sutton, L S; Wolfgram, P A
1986-01-01
Union lists of serials are critical to the effective operation of interlibrary loan networks. The Michigan Health Sciences Libraries Association used the OCLC union list component to produce the Michigan Statewide Health Sciences Union List of Serials (MISHULS). MISHULS, which includes the serials holdings of ninety-three hospital health sciences libraries, is a subset of a statewide multi-type union list maintained on OCLC. The rationale for a statewide list and the criteria for choosing vendors are discussed. Typical costs are provided. Funding sources are identified and a unique approach to decentralized input is described. The benefits of resource sharing in a larger, multi-type library network are also explored. PMID:3708192
Using the OCLC union listing component for a statewide health sciences union list of serials.
Sutton, L S; Wolfgram, P A
1986-04-01
Union lists of serials are critical to the effective operation of interlibrary loan networks. The Michigan Health Sciences Libraries Association used the OCLC union list component to produce the Michigan Statewide Health Sciences Union List of Serials (MISHULS). MISHULS, which includes the serials holdings of ninety-three hospital health sciences libraries, is a subset of a statewide multi-type union list maintained on OCLC. The rationale for a statewide list and the criteria for choosing vendors are discussed. Typical costs are provided. Funding sources are identified and a unique approach to decentralized input is described. The benefits of resource sharing in a larger, multi-type library network are also explored.
Language repetition and short-term memory: an integrative framework.
Majerus, Steve
2013-01-01
Short-term maintenance of verbal information is a core factor of language repetition, especially when reproducing multiple or unfamiliar stimuli. Many models of language processing locate the verbal short-term maintenance function in the left posterior superior temporo-parietal area and its connections with the inferior frontal gyrus. However, research in the field of short-term memory has implicated bilateral fronto-parietal networks, involved in attention and serial order processing, as being critical for the maintenance and reproduction of verbal sequences. We present here an integrative framework aimed at bridging research in the language processing and short-term memory fields. This framework considers verbal short-term maintenance as an emergent function resulting from synchronized and integrated activation in dorsal and ventral language processing networks as well as fronto-parietal attention and serial order processing networks. To-be-maintained item representations are temporarily activated in the dorsal and ventral language processing networks, novel phoneme and word serial order information is proposed to be maintained via a right fronto-parietal serial order processing network, and activation in these different networks is proposed to be coordinated and maintained via a left fronto-parietal attention processing network. This framework provides new perspectives for our understanding of information maintenance at the non-word-, word- and sentence-level as well as of verbal maintenance deficits in case of brain injury.
Language repetition and short-term memory: an integrative framework
Majerus, Steve
2013-01-01
Short-term maintenance of verbal information is a core factor of language repetition, especially when reproducing multiple or unfamiliar stimuli. Many models of language processing locate the verbal short-term maintenance function in the left posterior superior temporo-parietal area and its connections with the inferior frontal gyrus. However, research in the field of short-term memory has implicated bilateral fronto-parietal networks, involved in attention and serial order processing, as being critical for the maintenance and reproduction of verbal sequences. We present here an integrative framework aimed at bridging research in the language processing and short-term memory fields. This framework considers verbal short-term maintenance as an emergent function resulting from synchronized and integrated activation in dorsal and ventral language processing networks as well as fronto-parietal attention and serial order processing networks. To-be-maintained item representations are temporarily activated in the dorsal and ventral language processing networks, novel phoneme and word serial order information is proposed to be maintained via a right fronto-parietal serial order processing network, and activation in these different networks is proposed to be coordinated and maintained via a left fronto-parietal attention processing network. This framework provides new perspectives for our understanding of information maintenance at the non-word-, word- and sentence-level as well as of verbal maintenance deficits in case of brain injury. PMID:23874280
Chen, Bor-Sen; Tsai, Kun-Wei; Li, Cheng-Wei
2015-01-01
Molecular biologists have long recognized carcinogenesis as an evolutionary process that involves natural selection. Cancer is driven by the somatic evolution of cell lineages. In this study, the evolution of somatic cancer cell lineages during carcinogenesis was modeled as an equilibrium point (ie, phenotype of attractor) shifting, the process of a nonlinear stochastic evolutionary biological network. This process is subject to intrinsic random fluctuations because of somatic genetic and epigenetic variations, as well as extrinsic disturbances because of carcinogens and stressors. In order to maintain the normal function (ie, phenotype) of an evolutionary biological network subjected to random intrinsic fluctuations and extrinsic disturbances, a network robustness scheme that incorporates natural selection needs to be developed. This can be accomplished by selecting certain genetic and epigenetic variations to modify the network structure to attenuate intrinsic fluctuations efficiently and to resist extrinsic disturbances in order to maintain the phenotype of the evolutionary biological network at an equilibrium point (attractor). However, during carcinogenesis, the remaining (or neutral) genetic and epigenetic variations accumulate, and the extrinsic disturbances become too large to maintain the normal phenotype at the desired equilibrium point for the nonlinear evolutionary biological network. Thus, the network is shifted to a cancer phenotype at a new equilibrium point that begins a new evolutionary process. In this study, the natural selection scheme of an evolutionary biological network of carcinogenesis was derived from a robust negative feedback scheme based on the nonlinear stochastic Nash game strategy. The evolvability and phenotypic robustness criteria of the evolutionary cancer network were also estimated by solving a Hamilton–Jacobi inequality – constrained optimization problem. The simulation revealed that the phenotypic shift of the lung cancer-associated cell network takes 54.5 years from a normal state to stage I cancer, 1.5 years from stage I to stage II cancer, and 2.5 years from stage II to stage III cancer, with a reasonable match for the statistical result of the average age of lung cancer. These results suggest that a robust negative feedback scheme, based on a stochastic evolutionary game strategy, plays a critical role in an evolutionary biological network of carcinogenesis under a natural selection scheme. PMID:26244004
The Stochastic Evolutionary Game for a Population of Biological Networks Under Natural Selection
Chen, Bor-Sen; Ho, Shih-Ju
2014-01-01
In this study, a population of evolutionary biological networks is described by a stochastic dynamic system with intrinsic random parameter fluctuations due to genetic variations and external disturbances caused by environmental changes in the evolutionary process. Since information on environmental changes is unavailable and their occurrence is unpredictable, they can be considered as a game player with the potential to destroy phenotypic stability. The biological network needs to develop an evolutionary strategy to improve phenotypic stability as much as possible, so it can be considered as another game player in the evolutionary process, ie, a stochastic Nash game of minimizing the maximum network evolution level caused by the worst environmental disturbances. Based on the nonlinear stochastic evolutionary game strategy, we find that some genetic variations can be used in natural selection to construct negative feedback loops, efficiently improving network robustness. This provides larger genetic robustness as a buffer against neutral genetic variations, as well as larger environmental robustness to resist environmental disturbances and maintain a network phenotypic traits in the evolutionary process. In this situation, the robust phenotypic traits of stochastic biological networks can be more frequently selected by natural selection in evolution. However, if the harbored neutral genetic variations are accumulated to a sufficiently large degree, and environmental disturbances are strong enough that the network robustness can no longer confer enough genetic robustness and environmental robustness, then the phenotype robustness might break down. In this case, a network phenotypic trait may be pushed from one equilibrium point to another, changing the phenotypic trait and starting a new phase of network evolution through the hidden neutral genetic variations harbored in network robustness by adaptive evolution. Further, the proposed evolutionary game is extended to an n-tuple evolutionary game of stochastic biological networks with m players (competitive populations) and k environmental dynamics. PMID:24558296
ERIC Educational Resources Information Center
Gow, David W., Jr.; Keller, Corey J.; Eskandar, Emad; Meng, Nate; Cash, Sydney S.
2009-01-01
In this work, we apply Granger causality analysis to high spatiotemporal resolution intracranial EEG (iEEG) data to examine how different components of the left perisylvian language network interact during spoken language perception. The specific focus is on the characterization of serial versus parallel processing dependencies in the dominant…
Serial network simplifies the design of multiple microcomputer systems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Folkes, D.
1981-01-01
Recently there has been a lot of interest in developing network communication schemes for carrying digital data between locally distributed computing stations. Many of these schemes have focused on distributed networking techniques for data processing applications. These applications suggest the use of a serial, multipoint bus, where a number of remote intelligent units act as slaves to a central or host computer. Each slave would be serially addressable from the host and would perform required operations upon being addressed by the host. Based on an MK3873 single-chip microcomputer, the SCU 20 is designed to be such a remote slave device.more » The capabilities of the SCU 20 and its use in systems applications are examined.« less
An evolutionary game approach for determination of the structural conflicts in signed networks
Tan, Shaolin; Lü, Jinhu
2016-01-01
Social or biochemical networks can often divide into two opposite alliances in response to structural conflicts between positive (friendly, activating) and negative (hostile, inhibiting) interactions. Yet, the underlying dynamics on how the opposite alliances are spontaneously formed to minimize the structural conflicts is still unclear. Here, we demonstrate that evolutionary game dynamics provides a felicitous possible tool to characterize the evolution and formation of alliances in signed networks. Indeed, an evolutionary game dynamics on signed networks is proposed such that each node can adaptively adjust its choice of alliances to maximize its own fitness, which yet leads to a minimization of the structural conflicts in the entire network. Numerical experiments show that the evolutionary game approach is universally efficient in quality and speed to find optimal solutions for all undirected or directed, unweighted or weighted signed networks. Moreover, the evolutionary game approach is inherently distributed. These characteristics thus suggest the evolutionary game dynamic approach as a feasible and effective tool for determining the structural conflicts in large-scale on-line signed networks. PMID:26915581
The neural signature of emotional memories in serial crimes.
Chassy, Philippe
2017-10-01
Neural plasticity is the process whereby semantic information and emotional responses are stored in neural networks. It is hypothesized that the neural networks built over time to encode the sexual fantasies that motivate serial killers to act should display a unique, detectable activation pattern. The pathological neural watermark hypothesis posits that such networks comprise activation of brain sites that reflect four cognitive components: autobiographical memory, sexual arousal, aggression, and control over aggression. The neural sites performing these cognitive functions have been successfully identified by previous research. The key findings are reviewed to hypothesise the typical pattern of activity that serial killers should display. Through the integration of biological findings into one framework, the neural approach proposed in this paper is in stark contrast with the many theories accounting for serial killers that offer non-medical taxonomies. The pathological neural watermark hypothesis offers a new framework to understand and detect deviant individuals. The technical and legal issues are briefly discussed. Copyright © 2017 Elsevier Ltd. All rights reserved.
An evolutionary algorithm that constructs recurrent neural networks.
Angeline, P J; Saunders, G M; Pollack, J B
1994-01-01
Standard methods for simultaneously inducing the structure and weights of recurrent neural networks limit every task to an assumed class of architectures. Such a simplification is necessary since the interactions between network structure and function are not well understood. Evolutionary computations, which include genetic algorithms and evolutionary programming, are population-based search methods that have shown promise in many similarly complex tasks. This paper argues that genetic algorithms are inappropriate for network acquisition and describes an evolutionary program, called GNARL, that simultaneously acquires both the structure and weights for recurrent networks. GNARL's empirical acquisition method allows for the emergence of complex behaviors and topologies that are potentially excluded by the artificial architectural constraints imposed in standard network induction methods.
Modelling the influence of parental effects on gene-network evolution.
Odorico, Andreas; Rünneburger, Estelle; Le Rouzic, Arnaud
2018-05-01
Understanding the importance of nongenetic heredity in the evolutionary process is a major topic in modern evolutionary biology. We modified a classical gene-network model by allowing parental transmission of gene expression and studied its evolutionary properties through individual-based simulations. We identified ontogenetic time (i.e. the time gene networks have to stabilize before being submitted to natural selection) as a crucial factor in determining the evolutionary impact of this phenotypic inheritance. Indeed, fast-developing organisms display enhanced adaptation and greater robustness to mutations when evolving in presence of nongenetic inheritance (NGI). In contrast, in our model, long development reduces the influence of the inherited state of the gene network. NGI thus had a negligible effect on the evolution of gene networks when the speed at which transcription levels reach equilibrium is not constrained. Nevertheless, simulations show that intergenerational transmission of the gene-network state negatively affects the evolution of robustness to environmental disturbances for either fast- or slow-developing organisms. Therefore, these results suggest that the evolutionary consequences of NGI might not be sought only in the way species respond to selection, but also on the evolution of emergent properties (such as environmental and genetic canalization) in complex genetic architectures. © 2018 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2018 European Society For Evolutionary Biology.
Chen, Bor-Sen; Yeh, Chin-Hsun
2017-12-01
We review current static and dynamic evolutionary game strategies of biological networks and discuss the lack of random genetic variations and stochastic environmental disturbances in these models. To include these factors, a population of evolving biological networks is modeled as a nonlinear stochastic biological system with Poisson-driven genetic variations and random environmental fluctuations (stimuli). To gain insight into the evolutionary game theory of stochastic biological networks under natural selection, the phenotypic robustness and network evolvability of noncooperative and cooperative evolutionary game strategies are discussed from a stochastic Nash game perspective. The noncooperative strategy can be transformed into an equivalent multi-objective optimization problem and is shown to display significantly improved network robustness to tolerate genetic variations and buffer environmental disturbances, maintaining phenotypic traits for longer than the cooperative strategy. However, the noncooperative case requires greater effort and more compromises between partly conflicting players. Global linearization is used to simplify the problem of solving nonlinear stochastic evolutionary games. Finally, a simple stochastic evolutionary model of a metabolic pathway is simulated to illustrate the procedure of solving for two evolutionary game strategies and to confirm and compare their respective characteristics in the evolutionary process. Copyright © 2017 Elsevier B.V. All rights reserved.
Drummond, A; Rodrigo, A G
2000-12-01
Reconstruction of evolutionary relationships from noncontemporaneous molecular samples provides a new challenge for phylogenetic reconstruction methods. With recent biotechnological advances there has been an increase in molecular sequencing throughput, and the potential to obtain serial samples of sequences from populations, including rapidly evolving pathogens, is fast being realized. A new method called the serial-sample unweighted pair grouping method with arithmetic means (sUPGMA) is presented that reconstructs a genealogy or phylogeny of sequences sampled serially in time using a matrix of pairwise distances. The resulting tree depicts the terminal lineages of each sample ending at a different level consistent with the sample's temporal order. Since sUPGMA is a variant of UPGMA, it will perform best when sequences have evolved at a constant rate (i.e., according to a molecular clock). On simulated data, this new method performs better than standard cluster analysis under a variety of longitudinal sampling strategies. Serial-sample UPGMA is particularly useful for analysis of longitudinal samples of viruses and bacteria, as well as ancient DNA samples, with the minimal requirement that samples of sequences be ordered in time.
Huang, Lei; Liao, Li; Wu, Cathy H.
2016-01-01
Revealing the underlying evolutionary mechanism plays an important role in understanding protein interaction networks in the cell. While many evolutionary models have been proposed, the problem about applying these models to real network data, especially for differentiating which model can better describe evolutionary process for the observed network urgently remains as a challenge. The traditional way is to use a model with presumed parameters to generate a network, and then evaluate the fitness by summary statistics, which however cannot capture the complete network structures information and estimate parameter distribution. In this work we developed a novel method based on Approximate Bayesian Computation and modified Differential Evolution (ABC-DEP) that is capable of conducting model selection and parameter estimation simultaneously and detecting the underlying evolutionary mechanisms more accurately. We tested our method for its power in differentiating models and estimating parameters on the simulated data and found significant improvement in performance benchmark, as compared with a previous method. We further applied our method to real data of protein interaction networks in human and yeast. Our results show Duplication Attachment model as the predominant evolutionary mechanism for human PPI networks and Scale-Free model as the predominant mechanism for yeast PPI networks. PMID:26357273
Iyer, Swami; Killingback, Timothy
2014-10-01
The traveler's dilemma game and the minimum-effort coordination game are social dilemmas that have received significant attention resulting from the fact that the predictions of classical game theory are inconsistent with the results found when the games are studied experimentally. Moreover, both the traveler's dilemma and the minimum-effort coordination games have potentially important applications in evolutionary biology. Interestingly, standard deterministic evolutionary game theory, as represented by the replicator dynamics in a well-mixed population, is also inadequate to account for the behavior observed in these games. Here we study the evolutionary dynamics of both these games in populations with interaction patterns described by a variety of complex network topologies. We investigate the evolutionary dynamics of these games through agent-based simulations on both model and empirical networks. In particular, we study the effects of network clustering and assortativity on the evolutionary dynamics of both games. In general, we show that the evolutionary behavior of the traveler's dilemma and minimum-effort coordination games on complex networks is in good agreement with that observed experimentally. Thus, formulating the traveler's dilemma and the minimum-effort coordination games on complex networks neatly resolves the paradoxical aspects of these games.
NASA Astrophysics Data System (ADS)
Iyer, Swami; Killingback, Timothy
2014-10-01
The traveler's dilemma game and the minimum-effort coordination game are social dilemmas that have received significant attention resulting from the fact that the predictions of classical game theory are inconsistent with the results found when the games are studied experimentally. Moreover, both the traveler's dilemma and the minimum-effort coordination games have potentially important applications in evolutionary biology. Interestingly, standard deterministic evolutionary game theory, as represented by the replicator dynamics in a well-mixed population, is also inadequate to account for the behavior observed in these games. Here we study the evolutionary dynamics of both these games in populations with interaction patterns described by a variety of complex network topologies. We investigate the evolutionary dynamics of these games through agent-based simulations on both model and empirical networks. In particular, we study the effects of network clustering and assortativity on the evolutionary dynamics of both games. In general, we show that the evolutionary behavior of the traveler's dilemma and minimum-effort coordination games on complex networks is in good agreement with that observed experimentally. Thus, formulating the traveler's dilemma and the minimum-effort coordination games on complex networks neatly resolves the paradoxical aspects of these games.
Reciprocity in spatial evolutionary public goods game on double-layered network
NASA Astrophysics Data System (ADS)
Kim, Jinho; Yook, Soon-Hyung; Kim, Yup
2016-08-01
Spatial evolutionary games have mainly been studied on a single, isolated network. However, in real world systems, many interaction topologies are not isolated but many different types of networks are inter-connected to each other. In this study, we investigate the spatial evolutionary public goods game (SEPGG) on double-layered random networks (DRN). Based on the mean-field type arguments and numerical simulations, we find that SEPGG on DRN shows very rich interesting phenomena, especially, depending on the size of each layer, intra-connectivity, and inter-connected couplings, the network reciprocity of SEPGG on DRN can be drastically enhanced through the inter-connected coupling. Furthermore, SEPGG on DRN can provide a more general framework which includes the evolutionary dynamics on multiplex networks and inter-connected networks at the same time.
Reciprocity in spatial evolutionary public goods game on double-layered network
Kim, Jinho; Yook, Soon-Hyung; Kim, Yup
2016-01-01
Spatial evolutionary games have mainly been studied on a single, isolated network. However, in real world systems, many interaction topologies are not isolated but many different types of networks are inter-connected to each other. In this study, we investigate the spatial evolutionary public goods game (SEPGG) on double-layered random networks (DRN). Based on the mean-field type arguments and numerical simulations, we find that SEPGG on DRN shows very rich interesting phenomena, especially, depending on the size of each layer, intra-connectivity, and inter-connected couplings, the network reciprocity of SEPGG on DRN can be drastically enhanced through the inter-connected coupling. Furthermore, SEPGG on DRN can provide a more general framework which includes the evolutionary dynamics on multiplex networks and inter-connected networks at the same time. PMID:27503801
Sexually transmitted infection and the evolution of serial monogamy.
McLeod, David V; Day, Troy
2014-12-07
The selective forces shaping mating systems have long been of interest to biologists. One particular selective pressure that has received comparatively little attention is sexually transmitted infections (STIs). While it has been hypothesized that STIs could drive the evolutionary emergence of monogamy, there is little theoretical support. Here we use an evolutionary invasion analysis to determine what aspects of pathogen virulence and transmission are necessary for serial monogamy to evolve in a promiscuous population. We derive a biologically intuitive invasion condition in terms of population-specific quantities. From this condition, we obtain two main results. First, when pathogen virulence causes mortality rather than sterility, monogamy is more likely to evolve. Second, we find that at intermediate pathogen transmission rates, monogamy is the most selectively advantageous, whereas at high- and low-transmission rates, monogamy is generally selected against. As a result, it is possible for a pathogen to be highly virulent, yet for promiscuity to persist. © 2014 The Author(s) Published by the Royal Society. All rights reserved.
Hidden long evolutionary memory in a model biochemical network
NASA Astrophysics Data System (ADS)
Ali, Md. Zulfikar; Wingreen, Ned S.; Mukhopadhyay, Ranjan
2018-04-01
We introduce a minimal model for the evolution of functional protein-interaction networks using a sequence-based mutational algorithm, and apply the model to study neutral drift in networks that yield oscillatory dynamics. Starting with a functional core module, random evolutionary drift increases network complexity even in the absence of specific selective pressures. Surprisingly, we uncover a hidden order in sequence space that gives rise to long-term evolutionary memory, implying strong constraints on network evolution due to the topology of accessible sequence space.
NASA Astrophysics Data System (ADS)
Sarles, Stephen A.
2013-09-01
The droplet interface bilayer (DIB) is a simple technique for constructing a stable lipid bilayer at the interface of two lipid-encased water droplets submerged in oil. Networks of DIBs formed by connecting more than two droplets constitute a new form of modular biomolecular smart material, where the transduction properties of a single lipid bilayer can affect the actions performed at other interface bilayers in the network via diffusion through the aqueous environments of shared droplet connections. The passive electrical properties of a lipid bilayer and the arrangement of droplets that determine the paths for transport in the network require specific electrical control to stimulate and interrogate each bilayer. Here, we explore the use of virtual ground for electrodes inserted into specific droplets in the network and employ a multichannel patch clamp amplifier to characterize bilayer formation and ion-channel activity in a serial DIB array. Analysis of serial connections of DIBs is discussed to understand how assigning electrode connections to the measurement device can be used to measure activity across all lipid membranes within a network. Serial arrays of DIBs are assembled using the regulated attachment method within a multi-compartment flexible substrate, and wire-type electrodes inserted into each droplet compartment of the substrate enable the application of voltage and measurement of current in each droplet in the array.
Identification of serial number on bank card using recurrent neural network
NASA Astrophysics Data System (ADS)
Liu, Li; Huang, Linlin; Xue, Jian
2018-04-01
Identification of serial number on bank card has many applications. Due to the different number printing mode, complex background, distortion in shape, etc., it is quite challenging to achieve high identification accuracy. In this paper, we propose a method using Normalization-Cooperated Gradient Feature (NCGF) and Recurrent Neural Network (RNN) based on Long Short-Term Memory (LSTM) for serial number identification. The NCGF maps the gradient direction elements of original image to direction planes such that the RNN with direction planes as input can recognize numbers more accurately. Taking the advantages of NCGF and RNN, we get 90%digit string recognition accuracy.
Packets Distributing Evolutionary Algorithm Based on PSO for Ad Hoc Network
NASA Astrophysics Data System (ADS)
Xu, Xiao-Feng
2018-03-01
Wireless communication network has such features as limited bandwidth, changeful channel and dynamic topology, etc. Ad hoc network has lots of difficulties in accessing control, bandwidth distribution, resource assign and congestion control. Therefore, a wireless packets distributing Evolutionary algorithm based on PSO (DPSO)for Ad Hoc Network is proposed. Firstly, parameters impact on performance of network are analyzed and researched to obtain network performance effective function. Secondly, the improved PSO Evolutionary Algorithm is used to solve the optimization problem from local to global in the process of network packets distributing. The simulation results show that the algorithm can ensure fairness and timeliness of network transmission, as well as improve ad hoc network resource integrated utilization efficiency.
Research on Information Sharing Mechanism of Network Organization Based on Evolutionary Game
NASA Astrophysics Data System (ADS)
Wang, Lin; Liu, Gaozhi
2018-02-01
This article first elaborates the concept and effect of network organization, and the ability to share information is analyzed, secondly introduces the evolutionary game theory, network organization for information sharing all kinds of limitations, establishes the evolutionary game model, analyzes the dynamic evolution of network organization of information sharing, through reasoning and evolution. The network information sharing by the initial state and two sides of the game payoff matrix of excess profits and information is the information sharing of cost and risk sharing are the influence of network organization node information sharing decision.
The motivation behind serial sexual homicide: is it sex, power, and control, or anger?
Myers, Wade C; Husted, David S; Safarik, Mark E; O'Toole, Mary Ellen
2006-07-01
Controversy exists in the literature and society regarding what motivates serial sexual killers to commit their crimes. Hypotheses range from the seeking of sexual gratification to the achievement of power and control to the expression of anger. The authors provide theoretical, empirical, evolutionary, and physiological support for the argument that serial sexual murderers above all commit their crimes in pursuit of sadistic pleasure. The seeking of power and control over victims is believed to serve the two secondary purposes of heightening sexual arousal and ensuring victim presence for the crime. Anger is not considered a key component of these offenders' motivation due to its inhibitory physiological effect on sexual functioning. On the contrary, criminal investigations into serial sexual killings consistently reveal erotically charged crimes, with sexual motivation expressed either overtly or symbolically. Although anger may be correlated with serial sexual homicide offenders, as it is with criminal offenders in general, it is not causative. The authors further believe serial sexual murderers should be considered sex offenders. A significant proportion of them appear to have paraphilic disorders within the spectrum of sexual sadism. "sexual sadism, homicidal type" is proposed as a diagnostic subtype of sexual sadism applicable to many of these offenders, and a suggested modification of DSM criteria is presented.
Structure versus time in the evolutionary diversification of avian carotenoid metabolic networks.
Morrison, Erin S; Badyaev, Alexander V
2018-05-01
Historical associations of genes and proteins are thought to delineate pathways available to subsequent evolution; however, the effects of past functional involvements on contemporary evolution are rarely quantified. Here, we examined the extent to which the structure of a carotenoid enzymatic network persists in avian evolution. Specifically, we tested whether the evolution of carotenoid networks was most concordant with phylogenetically structured expansion from core reactions of common ancestors or with subsampling of biochemical pathway modules from an ancestral network. We compared structural and historical associations in 467 carotenoid networks of extant and ancestral species and uncovered the overwhelming effect of pre-existing metabolic network structure on carotenoid diversification over the last 50 million years of avian evolution. Over evolutionary time, birds repeatedly subsampled and recombined conserved biochemical modules, which likely maintained the overall structure of the carotenoid metabolic network during avian evolution. These findings explain the recurrent convergence of evolutionary distant species in carotenoid metabolism and weak phylogenetic signal in avian carotenoid evolution. Remarkable retention of an ancient metabolic structure throughout extensive and prolonged ecological diversification in avian carotenoid metabolism illustrates a fundamental requirement of organismal evolution - historical continuity of a deterministic network that links past and present functional associations of its components. © 2018 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2018 European Society For Evolutionary Biology.
Between “design” and “bricolage”: Genetic networks, levels of selection, and adaptive evolution
Wilkins, Adam S.
2007-01-01
The extent to which “developmental constraints” in complex organisms restrict evolutionary directions remains contentious. Yet, other forms of internal constraint, which have received less attention, may also exist. It will be argued here that a set of partial constraints below the level of phenotypes, those involving genes and molecules, influences and channels the set of possible evolutionary trajectories. At the top-most organizational level there are the genetic network modules, whose operations directly underlie complex morphological traits. The properties of these network modules, however, have themselves been set by the evolutionary history of the component genes and their interactions. Characterization of the components, structures, and operational dynamics of specific genetic networks should lead to a better understanding not only of the morphological traits they underlie but of the biases that influence the directions of evolutionary change. Furthermore, such knowledge may permit assessment of the relative degrees of probability of short evolutionary trajectories, those on the microevolutionary scale. In effect, a “network perspective” may help transform evolutionary biology into a scientific enterprise with greater predictive capability than it has hitherto possessed. PMID:17494754
Between "design" and "bricolage": genetic networks, levels of selection, and adaptive evolution.
Wilkins, Adam S
2007-05-15
The extent to which "developmental constraints" in complex organisms restrict evolutionary directions remains contentious. Yet, other forms of internal constraint, which have received less attention, may also exist. It will be argued here that a set of partial constraints below the level of phenotypes, those involving genes and molecules, influences and channels the set of possible evolutionary trajectories. At the top-most organizational level there are the genetic network modules, whose operations directly underlie complex morphological traits. The properties of these network modules, however, have themselves been set by the evolutionary history of the component genes and their interactions. Characterization of the components, structures, and operational dynamics of specific genetic networks should lead to a better understanding not only of the morphological traits they underlie but of the biases that influence the directions of evolutionary change. Furthermore, such knowledge may permit assessment of the relative degrees of probability of short evolutionary trajectories, those on the microevolutionary scale. In effect, a "network perspective" may help transform evolutionary biology into a scientific enterprise with greater predictive capability than it has hitherto possessed.
Application of kin theory to long-standing problem in nematode production for biocontrol
USDA-ARS?s Scientific Manuscript database
We present a review of Shapiro-Ilan and Raymond (2016. Limiting opportunities for cheating stabilizes virulence in insect parasitic nematodes. Evolutionary Applications 9:462-470. doi: 10.1111/eva.12348) who tested changes in virulence and reproductive output in a serially propagated entomopathogeni...
Default Mode and Executive Networks Areas: Association with the Serial Order in Divergent Thinking
Heinonen, Jarmo; Numminen, Jussi; Hlushchuk, Yevhen; Antell, Henrik; Taatila, Vesa; Suomala, Jyrki
2016-01-01
Scientific findings have suggested a two-fold structure of the cognitive process. By using the heuristic thinking mode, people automatically process information that tends to be invariant across days, whereas by using the explicit thinking mode people explicitly process information that tends to be variant compared to typical previously learned information patterns. Previous studies on creativity found an association between creativity and the brain regions in the prefrontal cortex, the anterior cingulate cortex, the default mode network and the executive network. However, which neural networks contribute to the explicit mode of thinking during idea generation remains an open question. We employed an fMRI paradigm to examine which brain regions were activated when participants (n = 16) mentally generated alternative uses for everyday objects. Most previous creativity studies required participants to verbalize responses during idea generation, whereas in this study participants produced mental alternatives without verbalizing. This study found activation in the left anterior insula when contrasting idea generation and object identification. This finding suggests that the insula (part of the brain’s salience network) plays a role in facilitating both the central executive and default mode networks to activate idea generation. We also investigated closely the effect of the serial order of idea being generated on brain responses: The amplitude of fMRI responses correlated positively with the serial order of idea being generated in the anterior cingulate cortex, which is part of the central executive network. Positive correlation with the serial order was also observed in the regions typically assigned to the default mode network: the precuneus/cuneus, inferior parietal lobule and posterior cingulate cortex. These networks support the explicit mode of thinking and help the individual to convert conventional mental models to new ones. The serial order correlated negatively with the BOLD responses in the posterior presupplementary motor area, left premotor cortex, right cerebellum and left inferior frontal gyrus. This finding might imply that idea generation without a verbal processing demand reflecting lack of need for new object identification in idea generation events. The results of the study are consistent with recent creativity studies, which emphasize that the creativity process involves working memory capacity to spontaneously shift between different kinds of thinking modes according to the context. PMID:27627760
Evolutionary games on multilayer networks: a colloquium
NASA Astrophysics Data System (ADS)
Wang, Zhen; Wang, Lin; Szolnoki, Attila; Perc, Matjaž
2015-05-01
Networks form the backbone of many complex systems, ranging from the Internet to human societies. Accordingly, not only is the range of our interactions limited and thus best described and modeled by networks, it is also a fact that the networks that are an integral part of such models are often interdependent or even interconnected. Networks of networks or multilayer networks are therefore a more apt description of social systems. This colloquium is devoted to evolutionary games on multilayer networks, and in particular to the evolution of cooperation as one of the main pillars of modern human societies. We first give an overview of the most significant conceptual differences between single-layer and multilayer networks, and we provide basic definitions and a classification of the most commonly used terms. Subsequently, we review fascinating and counterintuitive evolutionary outcomes that emerge due to different types of interdependencies between otherwise independent populations. The focus is on coupling through the utilities of players, through the flow of information, as well as through the popularity of different strategies on different network layers. The colloquium highlights the importance of pattern formation and collective behavior for the promotion of cooperation under adverse conditions, as well as the synergies between network science and evolutionary game theory.
Changing Staffing Patterns in Technical Services since the 1970s: A Study in Change.
ERIC Educational Resources Information Center
Andrews, Virgina Lee; Kelley, Carol Marie
1988-01-01
Describes the impact of automation on the responsibilities of both support and professional staff as well as evolutionary role of library assistants at Texas Tech University. Workflows for retrospective conversion of monographs and serials, current processing techniques, and the organization of the processing units are discussed. (Author/CLB)
A Novel Handwritten Letter Recognizer Using Enhanced Evolutionary Neural Network
NASA Astrophysics Data System (ADS)
Mahmoudi, Fariborz; Mirzashaeri, Mohsen; Shahamatnia, Ehsan; Faridnia, Saed
This paper introduces a novel design for handwritten letter recognition by employing a hybrid back-propagation neural network with an enhanced evolutionary algorithm. Feeding the neural network consists of a new approach which is invariant to translation, rotation, and scaling of input letters. Evolutionary algorithm is used for the global search of the search space and the back-propagation algorithm is used for the local search. The results have been computed by implementing this approach for recognizing 26 English capital letters in the handwritings of different people. The computational results show that the neural network reaches very satisfying results with relatively scarce input data and a promising performance improvement in convergence of the hybrid evolutionary back-propagation algorithms is exhibited.
Beyond topology: coevolution of structure and flux in metabolic networks.
Morrison, E S; Badyaev, A V
2017-10-01
Interactions between the structure of a metabolic network and its functional properties underlie its evolutionary diversification, but the mechanism by which such interactions arise remains elusive. Particularly unclear is whether metabolic fluxes that determine the concentrations of compounds produced by a metabolic network, are causally linked to a network's structure or emerge independently of it. A direct empirical study of populations where both structural and functional properties vary among individuals' metabolic networks is required to establish whether changes in structure affect the distribution of metabolic flux. In a population of house finches (Haemorhous mexicanus), we reconstructed full carotenoid metabolic networks for 442 individuals and uncovered 11 structural variants of this network with different compounds and reactions. We examined the consequences of this structural diversity for the concentrations of plumage-bound carotenoids produced by flux in these networks. We found that concentrations of metabolically derived, but not dietary carotenoids, depended on network structure. Flux was partitioned similarly among compounds in individuals of the same network structure: within each network, compound concentrations were closely correlated. The highest among-individual variation in flux occurred in networks with the strongest among-compound correlations, suggesting that changes in the magnitude, but not the distribution of flux, underlie individual differences in compound concentrations on a static network structure. These findings indicate that the distribution of flux in carotenoid metabolism closely follows network structure. Thus, evolutionary diversification and local adaptations in carotenoid metabolism may depend more on the gain or loss of enzymatic reactions than on changes in flux within a network structure. © 2017 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2017 European Society For Evolutionary Biology.
Controlled recovery of phylogenetic communities from an evolutionary model using a network approach
NASA Astrophysics Data System (ADS)
Sousa, Arthur M. Y. R.; Vieira, André P.; Prado, Carmen P. C.; Andrade, Roberto F. S.
2016-04-01
This works reports the use of a complex network approach to produce a phylogenetic classification tree of a simple evolutionary model. This approach has already been used to treat proteomic data of actual extant organisms, but an investigation of its reliability to retrieve a traceable evolutionary history is missing. The used evolutionary model includes key ingredients for the emergence of groups of related organisms by differentiation through random mutations and population growth, but purposefully omits other realistic ingredients that are not strictly necessary to originate an evolutionary history. This choice causes the model to depend only on a small set of parameters, controlling the mutation probability and the population of different species. Our results indicate that for a set of parameter values, the phylogenetic classification produced by the used framework reproduces the actual evolutionary history with a very high average degree of accuracy. This includes parameter values where the species originated by the evolutionary dynamics have modular structures. In the more general context of community identification in complex networks, our model offers a simple setting for evaluating the effects, on the efficiency of community formation and identification, of the underlying dynamics generating the network itself.
Evolutionary versatility of eukaryotic protein domains revealed by their bigram networks
2011-01-01
Background Protein domains are globular structures of independently folded polypeptides that exert catalytic or binding activities. Their sequences are recognized as evolutionary units that, through genome recombination, constitute protein repertoires of linkage patterns. Via mutations, domains acquire modified functions that contribute to the fitness of cells and organisms. Recent studies have addressed the evolutionary selection that may have shaped the functions of individual domains and the emergence of particular domain combinations, which led to new cellular functions in multi-cellular animals. This study focuses on modeling domain linkage globally and investigates evolutionary implications that may be revealed by novel computational analysis. Results A survey of 77 completely sequenced eukaryotic genomes implies a potential hierarchical and modular organization of biological functions in most living organisms. Domains in a genome or multiple genomes are modeled as a network of hetero-duplex covalent linkages, termed bigrams. A novel computational technique is introduced to decompose such networks, whereby the notion of domain "networking versatility" is derived and measured. The most and least "versatile" domains (termed "core domains" and "peripheral domains" respectively) are examined both computationally via sequence conservation measures and experimentally using selected domains. Our study suggests that such a versatility measure extracted from the bigram networks correlates with the adaptivity of domains during evolution, where the network core domains are highly adaptive, significantly contrasting the network peripheral domains. Conclusions Domain recombination has played a major part in the evolution of eukaryotes attributing to genome complexity. From a system point of view, as the results of selection and constant refinement, networks of domain linkage are structured in a hierarchical modular fashion. Domains with high degree of networking versatility appear to be evolutionary adaptive, potentially through functional innovations. Domain bigram networks are informative as a model of biological functions. The networking versatility indices extracted from such networks for individual domains reflect the strength of evolutionary selection that the domains have experienced. PMID:21849086
Evolutionary versatility of eukaryotic protein domains revealed by their bigram networks.
Xie, Xueying; Jin, Jing; Mao, Yongyi
2011-08-18
Protein domains are globular structures of independently folded polypeptides that exert catalytic or binding activities. Their sequences are recognized as evolutionary units that, through genome recombination, constitute protein repertoires of linkage patterns. Via mutations, domains acquire modified functions that contribute to the fitness of cells and organisms. Recent studies have addressed the evolutionary selection that may have shaped the functions of individual domains and the emergence of particular domain combinations, which led to new cellular functions in multi-cellular animals. This study focuses on modeling domain linkage globally and investigates evolutionary implications that may be revealed by novel computational analysis. A survey of 77 completely sequenced eukaryotic genomes implies a potential hierarchical and modular organization of biological functions in most living organisms. Domains in a genome or multiple genomes are modeled as a network of hetero-duplex covalent linkages, termed bigrams. A novel computational technique is introduced to decompose such networks, whereby the notion of domain "networking versatility" is derived and measured. The most and least "versatile" domains (termed "core domains" and "peripheral domains" respectively) are examined both computationally via sequence conservation measures and experimentally using selected domains. Our study suggests that such a versatility measure extracted from the bigram networks correlates with the adaptivity of domains during evolution, where the network core domains are highly adaptive, significantly contrasting the network peripheral domains. Domain recombination has played a major part in the evolution of eukaryotes attributing to genome complexity. From a system point of view, as the results of selection and constant refinement, networks of domain linkage are structured in a hierarchical modular fashion. Domains with high degree of networking versatility appear to be evolutionary adaptive, potentially through functional innovations. Domain bigram networks are informative as a model of biological functions. The networking versatility indices extracted from such networks for individual domains reflect the strength of evolutionary selection that the domains have experienced.
Chen, Bor-Sen; Lin, Ying-Po
2011-01-01
In the evolutionary process, the random transmission and mutation of genes provide biological diversities for natural selection. In order to preserve functional phenotypes between generations, gene networks need to evolve robustly under the influence of random perturbations. Therefore, the robustness of the phenotype, in the evolutionary process, exerts a selection force on gene networks to keep network functions. However, gene networks need to adjust, by variations in genetic content, to generate phenotypes for new challenges in the network’s evolution, ie, the evolvability. Hence, there should be some interplay between the evolvability and network robustness in evolutionary gene networks. In this study, the interplay between the evolvability and network robustness of a gene network and a biochemical network is discussed from a nonlinear stochastic system point of view. It was found that if the genetic robustness plus environmental robustness is less than the network robustness, the phenotype of the biological network is robust in evolution. The tradeoff between the genetic robustness and environmental robustness in evolution is discussed from the stochastic stability robustness and sensitivity of the nonlinear stochastic biological network, which may be relevant to the statistical tradeoff between bias and variance, the so-called bias/variance dilemma. Further, the tradeoff could be considered as an antagonistic pleiotropic action of a gene network and discussed from the systems biology perspective. PMID:22084563
Evolutionary Wavelet Neural Network ensembles for breast cancer and Parkinson's disease prediction.
Khan, Maryam Mahsal; Mendes, Alexandre; Chalup, Stephan K
2018-01-01
Wavelet Neural Networks are a combination of neural networks and wavelets and have been mostly used in the area of time-series prediction and control. Recently, Evolutionary Wavelet Neural Networks have been employed to develop cancer prediction models. The present study proposes to use ensembles of Evolutionary Wavelet Neural Networks. The search for a high quality ensemble is directed by a fitness function that incorporates the accuracy of the classifiers both independently and as part of the ensemble itself. The ensemble approach is tested on three publicly available biomedical benchmark datasets, one on Breast Cancer and two on Parkinson's disease, using a 10-fold cross-validation strategy. Our experimental results show that, for the first dataset, the performance was similar to previous studies reported in literature. On the second dataset, the Evolutionary Wavelet Neural Network ensembles performed better than all previous methods. The third dataset is relatively new and this study is the first to report benchmark results.
Evolutionary Wavelet Neural Network ensembles for breast cancer and Parkinson’s disease prediction
Mendes, Alexandre; Chalup, Stephan K.
2018-01-01
Wavelet Neural Networks are a combination of neural networks and wavelets and have been mostly used in the area of time-series prediction and control. Recently, Evolutionary Wavelet Neural Networks have been employed to develop cancer prediction models. The present study proposes to use ensembles of Evolutionary Wavelet Neural Networks. The search for a high quality ensemble is directed by a fitness function that incorporates the accuracy of the classifiers both independently and as part of the ensemble itself. The ensemble approach is tested on three publicly available biomedical benchmark datasets, one on Breast Cancer and two on Parkinson’s disease, using a 10-fold cross-validation strategy. Our experimental results show that, for the first dataset, the performance was similar to previous studies reported in literature. On the second dataset, the Evolutionary Wavelet Neural Network ensembles performed better than all previous methods. The third dataset is relatively new and this study is the first to report benchmark results. PMID:29420578
Mustafin, Zakhar Sergeevich; Lashin, Sergey Alexandrovich; Matushkin, Yury Georgievich; Gunbin, Konstantin Vladimirovich; Afonnikov, Dmitry Arkadievich
2017-01-27
There are many available software tools for visualization and analysis of biological networks. Among them, Cytoscape ( http://cytoscape.org/ ) is one of the most comprehensive packages, with many plugins and applications which extends its functionality by providing analysis of protein-protein interaction, gene regulatory and gene co-expression networks, metabolic, signaling, neural as well as ecological-type networks including food webs, communities networks etc. Nevertheless, only three plugins tagged 'network evolution' found in Cytoscape official app store and in literature. We have developed a new Cytoscape 3.0 application Orthoscape aimed to facilitate evolutionary analysis of gene networks and visualize the results. Orthoscape aids in analysis of evolutionary information available for gene sets and networks by highlighting: (1) the orthology relationships between genes; (2) the evolutionary origin of gene network components; (3) the evolutionary pressure mode (diversifying or stabilizing, negative or positive selection) of orthologous groups in general and/or branch-oriented mode. The distinctive feature of Orthoscape is the ability to control all data analysis steps via user-friendly interface. Orthoscape allows its users to analyze gene networks or separated gene sets in the context of evolution. At each step of data analysis, Orthoscape also provides for convenient visualization and data manipulation.
Robinson, Kathryn M; Hauzy, Céline; Loeuille, Nicolas; Albrectsen, Benedicte R
2015-01-01
Nestedness and modularity are measures of ecological networks whose causative effects are little understood. We analyzed antagonistic plant–herbivore bipartite networks using common gardens in two contrasting environments comprised of aspen trees with differing evolutionary histories of defence against herbivores. These networks were tightly connected owing to a high level of specialization of arthropod herbivores that spend a large proportion of the life cycle on aspen. The gardens were separated by ten degrees of latitude with resultant differences in abiotic conditions. We evaluated network metrics and reported similar connectance between gardens but greater numbers of links per species in the northern common garden. Interaction matrices revealed clear nestedness, indicating subsetting of the bipartite interactions into specialist divisions, in both the environmental and evolutionary aspen groups, although nestedness values were only significant in the northern garden. Variation in plant vulnerability, measured as the frequency of herbivore specialization in the aspen population, was significantly partitioned by environment (common garden) but not by evolutionary origin of the aspens. Significant values of modularity were observed in all network matrices. Trait-matching indicated that growth traits, leaf morphology, and phenolic metabolites affected modular structure in both the garden and evolutionary groups, whereas extra-floral nectaries had little influence. Further examination of module configuration revealed that plant vulnerability explained considerable variance in web structure. The contrasting conditions between the two gardens resulted in bottom-up effects of the environment, which most strongly influenced the overall network architecture, however, the aspen groups with dissimilar evolutionary history also showed contrasting degrees of nestedness and modularity. Our research therefore shows that, while evolution does affect the structure of aspen–herbivore bipartite networks, the role of environmental variations is a dominant constraint. PMID:26306175
1991-01-01
visual and three-layer connectionist network, in that the input layer of memory processing is serial, and is likely to represent each module is... Selective attention gates visual University Press. processing in the extrastnate cortex. Science, 229:782-784. Treasman, A.M. (1985). Preartentive...AD-A242 225 A CONNECTIONIST SIMULATION OF ATTENTION AND VECTOR COMPARISON: THE NEED FOR SERIAL PROCESSING IN PARALLEL HARDWARE Technical Report AlP
Community detection in complex networks by using membrane algorithm
NASA Astrophysics Data System (ADS)
Liu, Chuang; Fan, Linan; Liu, Zhou; Dai, Xiang; Xu, Jiamei; Chang, Baoren
Community detection in complex networks is a key problem of network analysis. In this paper, a new membrane algorithm is proposed to solve the community detection in complex networks. The proposed algorithm is based on membrane systems, which consists of objects, reaction rules, and a membrane structure. Each object represents a candidate partition of a complex network, and the quality of objects is evaluated according to network modularity. The reaction rules include evolutionary rules and communication rules. Evolutionary rules are responsible for improving the quality of objects, which employ the differential evolutionary algorithm to evolve objects. Communication rules implement the information exchanged among membranes. Finally, the proposed algorithm is evaluated on synthetic, real-world networks with real partitions known and the large-scaled networks with real partitions unknown. The experimental results indicate the superior performance of the proposed algorithm in comparison with other experimental algorithms.
Wen, Dingqiao; Yu, Yun; Hahn, Matthew W.; Nakhleh, Luay
2016-01-01
The role of hybridization and subsequent introgression has been demonstrated in an increasing number of species. Recently, Fontaine et al. (Science, 347, 2015, 1258524) conducted a phylogenomic analysis of six members of the Anopheles gambiae species complex. Their analysis revealed a reticulate evolutionary history and pointed to extensive introgression on all four autosomal arms. The study further highlighted the complex evolutionary signals that the co-occurrence of incomplete lineage sorting (ILS) and introgression can give rise to in phylogenomic analyses. While tree-based methodologies were used in the study, phylogenetic networks provide a more natural model to capture reticulate evolutionary histories. In this work, we reanalyse the Anopheles data using a recently devised framework that combines the multispecies coalescent with phylogenetic networks. This framework allows us to capture ILS and introgression simultaneously, and forms the basis for statistical methods for inferring reticulate evolutionary histories. The new analysis reveals a phylogenetic network with multiple hybridization events, some of which differ from those reported in the original study. To elucidate the extent and patterns of introgression across the genome, we devise a new method that quantifies the use of reticulation branches in the phylogenetic network by each genomic region. Applying the method to the mosquito data set reveals the evolutionary history of all the chromosomes. This study highlights the utility of ‘network thinking’ and the new insights it can uncover, in particular in phylogenomic analyses of large data sets with extensive gene tree incongruence. PMID:26808290
Vacher, Corinne; Piou, Dominique; Desprez-Loustau, Marie-Laure
2008-01-01
Background Compartmentalization and nestedness are common patterns in ecological networks. The aim of this study was to elucidate some of the processes shaping these patterns in a well resolved network of host/pathogen interactions. Methology/Principal Findings Based on a long-term (1972–2005) survey of forest health at the regional scale (all French forests; 15 million ha), we uncovered an almost fully connected network of 51 tree taxa and 157 parasitic fungal species. Our analyses revealed that the compartmentalization of the network maps out the ancient evolutionary history of seed plants, but not the ancient evolutionary history of fungal species. The very early divergence of the major fungal phyla may account for this asymmetric influence of past evolutionary history. Unlike compartmentalization, nestedness did not reflect any consistent phylogenetic signal. Instead, it seemed to reflect the ecological features of the current species, such as the relative abundance of tree species and the life-history strategies of fungal pathogens. We discussed how the evolution of host range in fungal species may account for the observed nested patterns. Conclusion/Significance Overall, our analyses emphasized how the current complexity of ecological networks results from the diversification of the species and their interactions over evolutionary times. They confirmed that the current architecture of ecological networks is not only dependant on recent ecological processes. PMID:18320058
Mean-field approximations of fixation time distributions of evolutionary game dynamics on graphs
NASA Astrophysics Data System (ADS)
Ying, Li-Min; Zhou, Jie; Tang, Ming; Guan, Shu-Guang; Zou, Yong
2018-02-01
The mean fixation time is often not accurate for describing the timescales of fixation probabilities of evolutionary games taking place on complex networks. We simulate the game dynamics on top of complex network topologies and approximate the fixation time distributions using a mean-field approach. We assume that there are two absorbing states. Numerically, we show that the mean fixation time is sufficient in characterizing the evolutionary timescales when network structures are close to the well-mixing condition. In contrast, the mean fixation time shows large inaccuracies when networks become sparse. The approximation accuracy is determined by the network structure, and hence by the suitability of the mean-field approach. The numerical results show good agreement with the theoretical predictions.
Bit-serial neuroprocessor architecture
NASA Technical Reports Server (NTRS)
Tawel, Raoul (Inventor)
2001-01-01
A neuroprocessor architecture employs a combination of bit-serial and serial-parallel techniques for implementing the neurons of the neuroprocessor. The neuroprocessor architecture includes a neural module containing a pool of neurons, a global controller, a sigmoid activation ROM look-up-table, a plurality of neuron state registers, and a synaptic weight RAM. The neuroprocessor reduces the number of neurons required to perform the task by time multiplexing groups of neurons from a fixed pool of neurons to achieve the successive hidden layers of a recurrent network topology.
Dynamics, morphogenesis and convergence of evolutionary quantum Prisoner's Dilemma games on networks
Yong, Xi
2016-01-01
The authors proposed a quantum Prisoner's Dilemma (PD) game as a natural extension of the classic PD game to resolve the dilemma. Here, we establish a new Nash equilibrium principle of the game, propose the notion of convergence and discover the convergence and phase-transition phenomena of the evolutionary games on networks. We investigate the many-body extension of the game or evolutionary games in networks. For homogeneous networks, we show that entanglement guarantees a quick convergence of super cooperation, that there is a phase transition from the convergence of defection to the convergence of super cooperation, and that the threshold for the phase transitions is principally determined by the Nash equilibrium principle of the game, with an accompanying perturbation by the variations of structures of networks. For heterogeneous networks, we show that the equilibrium frequencies of super-cooperators are divergent, that entanglement guarantees emergence of super-cooperation and that there is a phase transition of the emergence with the threshold determined by the Nash equilibrium principle, accompanied by a perturbation by the variations of structures of networks. Our results explore systematically, for the first time, the dynamics, morphogenesis and convergence of evolutionary games in interacting and competing systems. PMID:27118882
Renn, Jürgen
2015-01-01
ABSTRACT This paper introduces a conceptual framework for the evolution of complex systems based on the integration of regulatory network and niche construction theories. It is designed to apply equally to cases of biological, social and cultural evolution. Within the conceptual framework we focus especially on the transformation of complex networks through the linked processes of externalization and internalization of causal factors between regulatory networks and their corresponding niches and argue that these are an important part of evolutionary explanations. This conceptual framework extends previous evolutionary models and focuses on several challenges, such as the path‐dependent nature of evolutionary change, the dynamics of evolutionary innovation and the expansion of inheritance systems. J. Exp. Zool. (Mol. Dev. Evol.) 324B: 565–577, 2015. © 2015 The Authors. Journal of Experimental Zoology Part B: Molecular and Developmental Evolution published by Wiley Periodicals, Inc. PMID:26097188
Selection on Network Dynamics Drives Differential Rates of Protein Domain Evolution
Mannakee, Brian K.; Gutenkunst, Ryan N.
2016-01-01
The long-held principle that functionally important proteins evolve slowly has recently been challenged by studies in mice and yeast showing that the severity of a protein knockout only weakly predicts that protein’s rate of evolution. However, the relevance of these studies to evolutionary changes within proteins is unknown, because amino acid substitutions, unlike knockouts, often only slightly perturb protein activity. To quantify the phenotypic effect of small biochemical perturbations, we developed an approach to use computational systems biology models to measure the influence of individual reaction rate constants on network dynamics. We show that this dynamical influence is predictive of protein domain evolutionary rate within networks in vertebrates and yeast, even after controlling for expression level and breadth, network topology, and knockout effect. Thus, our results not only demonstrate the importance of protein domain function in determining evolutionary rate, but also the power of systems biology modeling to uncover unanticipated evolutionary forces. PMID:27380265
Design Report for Isolated RS-485 Bus Node
2016-07-01
controlled wired RS-485 network. The Android-based smartphone or tablet is used in conjunction with a USB to serial bridge to operate as the bus master in...Android-based smartphone or tablet is used in conjunction with a USB to serial bridge to operate as the bus master in the system. The Android device
Social traits, social networks and evolutionary biology.
Fisher, D N; McAdam, A G
2017-12-01
The social environment is both an important agent of selection for most organisms, and an emergent property of their interactions. As an aggregation of interactions among members of a population, the social environment is a product of many sets of relationships and so can be represented as a network or matrix. Social network analysis in animals has focused on why these networks possess the structure they do, and whether individuals' network traits, representing some aspect of their social phenotype, relate to their fitness. Meanwhile, quantitative geneticists have demonstrated that traits expressed in a social context can depend on the phenotypes and genotypes of interacting partners, leading to influences of the social environment on the traits and fitness of individuals and the evolutionary trajectories of populations. Therefore, both fields are investigating similar topics, yet have arrived at these points relatively independently. We review how these approaches are diverged, and yet how they retain clear parallelism and so strong potential for complementarity. This demonstrates that, despite separate bodies of theory, advances in one might inform the other. Techniques in network analysis for quantifying social phenotypes, and for identifying community structure, should be useful for those studying the relationship between individual behaviour and group-level phenotypes. Entering social association matrices into quantitative genetic models may also reduce bias in heritability estimates, and allow the estimation of the influence of social connectedness on trait expression. Current methods for measuring natural selection in a social context explicitly account for the fact that a trait is not necessarily the property of a single individual, something the network approaches have not yet considered when relating network metrics to individual fitness. Harnessing evolutionary models that consider traits affected by genes in other individuals (i.e. indirect genetic effects) provides the potential to understand how entire networks of social interactions in populations influence phenotypes and predict how these traits may evolve. By theoretical integration of social network analysis and quantitative genetics, we hope to identify areas of compatibility and incompatibility and to direct research efforts towards the most promising areas. Continuing this synthesis could provide important insights into the evolution of traits expressed in a social context and the evolutionary consequences of complex and nuanced social phenotypes. © 2017 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2017 European Society For Evolutionary Biology.
Spoken Word Recognition and Serial Recall of Words from Components in the Phonological Network
ERIC Educational Resources Information Center
Siew, Cynthia S. Q.; Vitevitch, Michael S.
2016-01-01
Network science uses mathematical techniques to study complex systems such as the phonological lexicon (Vitevitch, 2008). The phonological network consists of a "giant component" (the largest connected component of the network) and "lexical islands" (smaller groups of words that are connected to each other, but not to the giant…
Shao, Chenzhong; Tanaka, Shuji; Nakayama, Takahiro; Hata, Yoshiyuki; Muroyama, Masanori
2018-01-15
For installing many sensors in a limited space with a limited computing resource, the digitization of the sensor output at the site of sensation has advantages such as a small amount of wiring, low signal interference and high scalability. For this purpose, we have developed a dedicated Complementary Metal-Oxide-Semiconductor (CMOS) Large-Scale Integration (LSI) (referred to as "sensor platform LSI") for bus-networked Micro-Electro-Mechanical-Systems (MEMS)-LSI integrated sensors. In this LSI, collision avoidance, adaptation and event-driven functions are simply implemented to relieve data collision and congestion in asynchronous serial bus communication. In this study, we developed a network system with 48 sensor platform LSIs based on Printed Circuit Board (PCB) in a backbone bus topology with the bus length being 2.4 m. We evaluated the serial communication performance when 48 LSIs operated simultaneously with the adaptation function. The number of data packets received from each LSI was almost identical, and the average sampling frequency of 384 capacitance channels (eight for each LSI) was 73.66 Hz.
Charles Darwin and the evolution of human grammatical systems.
Buckingham, Hugh W; Christman, Sarah S
2010-04-08
Charles Darwin's evolutionary theories of animal communication were deeply embedded in a centuries-old model of association psychology, whose prodromes have most often been traced to the writings of Aristotle. His notions of frequency of occurrence of pairings have been passed down through the centuries and were a major ontological feature in the formation of associative connectivity. He focused on the associations of cause and effect, contiguity of sequential occurrence, and similarity among items. Cause and effect were often reduced to another type of contiguity relation, so that Aristotle is most often evoked as the originator of the associative bondings through similarity and contiguity, contiguity being the most powerful and frequent means of association. Contiguity eventually became the overriding mechanism for serial ordering of mental events in both perception and action. The notions of concatenation throughout the association psychology took the form of "trains" of events, both sensory and motor, in such a way that serial ordering came to be viewed as an item-by-item string of locally contiguous events. Modern developments in the mathematics of serial ordering have advanced in sophistication since the early and middle twentieth century, and new computational methods have allowed us to reevaluate the serial concatenative theories of Darwin and the associationists. These new models of serial order permit a closer comparative scrutiny between human and nonhuman. The present study considers Darwin's insistence on a "degree" continuity between human and nonhuman animal serial ordering. We will consider a study of starling birdsongs and whether the serial ordering of those songs provides evidence that they have a syntax that at best differs only in degree and not in kind with the computations of human grammatical structures. We will argue that they, in fact, show no such thing.
The drug target genes show higher evolutionary conservation than non-target genes.
Lv, Wenhua; Xu, Yongdeng; Guo, Yiying; Yu, Ziqi; Feng, Guanglong; Liu, Panpan; Luan, Meiwei; Zhu, Hongjie; Liu, Guiyou; Zhang, Mingming; Lv, Hongchao; Duan, Lian; Shang, Zhenwei; Li, Jin; Jiang, Yongshuai; Zhang, Ruijie
2016-01-26
Although evidence indicates that drug target genes share some common evolutionary features, there have been few studies analyzing evolutionary features of drug targets from an overall level. Therefore, we conducted an analysis which aimed to investigate the evolutionary characteristics of drug target genes. We compared the evolutionary conservation between human drug target genes and non-target genes by combining both the evolutionary features and network topological properties in human protein-protein interaction network. The evolution rate, conservation score and the percentage of orthologous genes of 21 species were included in our study. Meanwhile, four topological features including the average shortest path length, betweenness centrality, clustering coefficient and degree were considered for comparison analysis. Then we got four results as following: compared with non-drug target genes, 1) drug target genes had lower evolutionary rates; 2) drug target genes had higher conservation scores; 3) drug target genes had higher percentages of orthologous genes and 4) drug target genes had a tighter network structure including higher degrees, betweenness centrality, clustering coefficients and lower average shortest path lengths. These results demonstrate that drug target genes are more evolutionarily conserved than non-drug target genes. We hope that our study will provide valuable information for other researchers who are interested in evolutionary conservation of drug targets.
The evolutionary and ecological consequences of animal social networks: emerging issues.
Kurvers, Ralf H J M; Krause, Jens; Croft, Darren P; Wilson, Alexander D M; Wolf, Max
2014-06-01
The first generation of research on animal social networks was primarily aimed at introducing the concept of social networks to the fields of animal behaviour and behavioural ecology. More recently, a diverse body of evidence has shown that social fine structure matters on a broader scale than initially expected, affecting many key ecological and evolutionary processes. Here, we review this development. We discuss the effects of social network structure on evolutionary dynamics (genetic drift, fixation probabilities, and frequency-dependent selection) and social evolution (cooperation and between-individual behavioural differences). We discuss how social network structure can affect important coevolutionary processes (host-pathogen interactions and mutualisms) and population stability. We also discuss the potentially important, but poorly studied, role of social network structure on dispersal and invasion. Throughout, we highlight important areas for future research. Copyright © 2014 Elsevier Ltd. All rights reserved.
Tong, Xiaoling; Bear, Ashley; Liew, Seng Fatt; Bhardwaj, Shivam; Wasik, Bethany R.; Dinwiddie, April; Bastianelli, Carole; Cheong, Wei Fun; Wenk, Markus R.; Cao, Hui
2015-01-01
Bodies are often made of repeated units, or serial homologs, that develop using the same core gene regulatory network. Local inputs and modifications to this network allow serial homologs to evolve different morphologies, but currently we do not understand which modifications allow these repeated traits to evolve different levels of phenotypic plasticity. Here we describe variation in phenotypic plasticity across serial homologous eyespots of the butterfly Bicyclus anynana, hypothesized to be under selection for similar or different functions in the wet and dry seasonal forms. Specifically, we document the presence of eyespot size and scale brightness plasticity in hindwing eyespots hypothesized to vary in function across seasons, and reduced size plasticity and absence of brightness plasticity in forewing eyespots hypothesized to have the same function across seasons. By exploring the molecular and physiological causes of this variation in plasticity across fore and hindwing serial homologs we discover that: 1) temperature experienced during the wandering stages of larval development alters titers of an ecdysteroid hormone, 20-hydroxyecdysone (20E), in the hemolymph of wet and dry seasonal forms at that stage; 2) the 20E receptor (EcR) is differentially expressed in the forewing and hindwing eyespot centers of both seasonal forms during this critical developmental stage; and 3) manipulations of EcR signaling disproportionately affected hindwing eyespots relative to forewing eyespots. We propose that differential EcR expression across forewing and hindwing eyespots at a critical stage of development explains the variation in levels of phenotypic plasticity across these serial homologues. This finding provides a novel signaling pathway, 20E, and a novel molecular candidate, EcR, for the regulation of levels of phenotypic plasticity across body parts or serial homologs. PMID:26405828
A Revised Model of Short-Term Memory and Long-Term Learning of Verbal Sequences
ERIC Educational Resources Information Center
Burgess, Neil; Hitch, Graham J.
2006-01-01
The interaction between short- and long-term memory is studied within a model in which phonemic and (temporal) contextual information have separate influences on immediate verbal serial recall via connections with short- and long-term plasticity [Burgess, N., & Hitch, G.J. (1999). Memory for serial order: a network model of the phonological loop…
Laarits, T; Bordalo, P; Lemos, B
2016-08-01
Regulatory networks play a central role in the modulation of gene expression, the control of cellular differentiation, and the emergence of complex phenotypes. Regulatory networks could constrain or facilitate evolutionary adaptation in gene expression levels. Here, we model the adaptation of regulatory networks and gene expression levels to a shift in the environment that alters the optimal expression level of a single gene. Our analyses show signatures of natural selection on regulatory networks that both constrain and facilitate rapid evolution of gene expression level towards new optima. The analyses are interpreted from the standpoint of neutral expectations and illustrate the challenge to making inferences about network adaptation. Furthermore, we examine the consequence of variable stabilizing selection across genes on the strength and direction of interactions in regulatory networks and in their subsequent adaptation. We observe that directional selection on a highly constrained gene previously under strong stabilizing selection was more efficient when the gene was embedded within a network of partners under relaxed stabilizing selection pressure. The observation leads to the expectation that evolutionarily resilient regulatory networks will contain optimal ratios of genes whose expression is under weak and strong stabilizing selection. Altogether, our results suggest that the variable strengths of stabilizing selection across genes within regulatory networks might itself contribute to the long-term adaptation of complex phenotypes. © 2016 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2016 European Society For Evolutionary Biology.
Lee, Wei-Po; Hsiao, Yu-Ting; Hwang, Wei-Che
2014-01-16
To improve the tedious task of reconstructing gene networks through testing experimentally the possible interactions between genes, it becomes a trend to adopt the automated reverse engineering procedure instead. Some evolutionary algorithms have been suggested for deriving network parameters. However, to infer large networks by the evolutionary algorithm, it is necessary to address two important issues: premature convergence and high computational cost. To tackle the former problem and to enhance the performance of traditional evolutionary algorithms, it is advisable to use parallel model evolutionary algorithms. To overcome the latter and to speed up the computation, it is advocated to adopt the mechanism of cloud computing as a promising solution: most popular is the method of MapReduce programming model, a fault-tolerant framework to implement parallel algorithms for inferring large gene networks. This work presents a practical framework to infer large gene networks, by developing and parallelizing a hybrid GA-PSO optimization method. Our parallel method is extended to work with the Hadoop MapReduce programming model and is executed in different cloud computing environments. To evaluate the proposed approach, we use a well-known open-source software GeneNetWeaver to create several yeast S. cerevisiae sub-networks and use them to produce gene profiles. Experiments have been conducted and the results have been analyzed. They show that our parallel approach can be successfully used to infer networks with desired behaviors and the computation time can be largely reduced. Parallel population-based algorithms can effectively determine network parameters and they perform better than the widely-used sequential algorithms in gene network inference. These parallel algorithms can be distributed to the cloud computing environment to speed up the computation. By coupling the parallel model population-based optimization method and the parallel computational framework, high quality solutions can be obtained within relatively short time. This integrated approach is a promising way for inferring large networks.
2014-01-01
Background To improve the tedious task of reconstructing gene networks through testing experimentally the possible interactions between genes, it becomes a trend to adopt the automated reverse engineering procedure instead. Some evolutionary algorithms have been suggested for deriving network parameters. However, to infer large networks by the evolutionary algorithm, it is necessary to address two important issues: premature convergence and high computational cost. To tackle the former problem and to enhance the performance of traditional evolutionary algorithms, it is advisable to use parallel model evolutionary algorithms. To overcome the latter and to speed up the computation, it is advocated to adopt the mechanism of cloud computing as a promising solution: most popular is the method of MapReduce programming model, a fault-tolerant framework to implement parallel algorithms for inferring large gene networks. Results This work presents a practical framework to infer large gene networks, by developing and parallelizing a hybrid GA-PSO optimization method. Our parallel method is extended to work with the Hadoop MapReduce programming model and is executed in different cloud computing environments. To evaluate the proposed approach, we use a well-known open-source software GeneNetWeaver to create several yeast S. cerevisiae sub-networks and use them to produce gene profiles. Experiments have been conducted and the results have been analyzed. They show that our parallel approach can be successfully used to infer networks with desired behaviors and the computation time can be largely reduced. Conclusions Parallel population-based algorithms can effectively determine network parameters and they perform better than the widely-used sequential algorithms in gene network inference. These parallel algorithms can be distributed to the cloud computing environment to speed up the computation. By coupling the parallel model population-based optimization method and the parallel computational framework, high quality solutions can be obtained within relatively short time. This integrated approach is a promising way for inferring large networks. PMID:24428926
Application of network methods for understanding evolutionary dynamics in discrete habitats.
Greenbaum, Gili; Fefferman, Nina H
2017-06-01
In populations occupying discrete habitat patches, gene flow between habitat patches may form an intricate population structure. In such structures, the evolutionary dynamics resulting from interaction of gene-flow patterns with other evolutionary forces may be exceedingly complex. Several models describing gene flow between discrete habitat patches have been presented in the population-genetics literature; however, these models have usually addressed relatively simple settings of habitable patches and have stopped short of providing general methodologies for addressing nontrivial gene-flow patterns. In the last decades, network theory - a branch of discrete mathematics concerned with complex interactions between discrete elements - has been applied to address several problems in population genetics by modelling gene flow between habitat patches using networks. Here, we present the idea and concepts of modelling complex gene flows in discrete habitats using networks. Our goal is to raise awareness to existing network theory applications in molecular ecology studies, as well as to outline the current and potential contribution of network methods to the understanding of evolutionary dynamics in discrete habitats. We review the main branches of network theory that have been, or that we believe potentially could be, applied to population genetics and molecular ecology research. We address applications to theoretical modelling and to empirical population-genetic studies, and we highlight future directions for extending the integration of network science with molecular ecology. © 2017 John Wiley & Sons Ltd.
Evolutionary Games in Multi-Agent Systems of Weighted Social Networks
NASA Astrophysics Data System (ADS)
Du, Wen-Bo; Cao, Xian-Bin; Zheng, Hao-Ran; Zhou, Hong; Hu, Mao-Bin
Much empirical evidence has shown realistic networks are weighted. Compared with those on unweighted networks, the dynamics on weighted network often exhibit distinctly different phenomena. In this paper, we investigate the evolutionary game dynamics (prisoner's dilemma game and snowdrift game) on a weighted social network consisted of rational agents and focus on the evolution of cooperation in the system. Simulation results show that the cooperation level is strongly affected by the weighted nature of the network. Moreover, the variation of time series has also been investigated. Our work may be helpful in understanding the cooperative behavior in the social systems.
NASA Astrophysics Data System (ADS)
Song, Chen; Zhong-Cheng, Wu; Hong, Lv
2018-03-01
Building Energy forecasting plays an important role in energy management and plan. Using mind evolutionary algorithm to find the optimal network weights and threshold, to optimize the BP neural network, can overcome the problem of the BP neural network into a local minimum point. The optimized network is used for time series prediction, and the same month forecast, to get two predictive values. Then two kinds of predictive values are put into neural network, to get the final forecast value. The effectiveness of the method was verified by experiment with the energy value of three buildings in Hefei.
Modeling evolution of crosstalk in noisy signal transduction networks
NASA Astrophysics Data System (ADS)
Tareen, Ammar; Wingreen, Ned S.; Mukhopadhyay, Ranjan
2018-02-01
Signal transduction networks can form highly interconnected systems within cells due to crosstalk between constituent pathways. To better understand the evolutionary design principles underlying such networks, we study the evolution of crosstalk for two parallel signaling pathways that arise via gene duplication. We use a sequence-based evolutionary algorithm and evolve the network based on two physically motivated fitness functions related to information transmission. We find that one fitness function leads to a high degree of crosstalk while the other leads to pathway specificity. Our results offer insights on the relationship between network architecture and information transmission for noisy biomolecular networks.
Importance of tie strengths in the prisoner's dilemma game on social networks
NASA Astrophysics Data System (ADS)
Xu, Bo; Liu, Lu; You, Weijia
2011-06-01
Though numerous researches have shown that tie strengths play a key role in the formation of collective behavior in social networks, little work has been done to explore their impact on the outcome of evolutionary games. In this Letter, we studied the effect of tie strength in the dynamics of evolutionary prisoner's dilemma games by using online social network datasets. The results show that the fraction of cooperators has a non-trivial dependence on tie strength. Weak ties, just like previous researches on epidemics and information diffusion have shown, play a key role by the maintenance of cooperators in evolutionary prisoner's dilemma games.
Communications and control for electric power systems
NASA Technical Reports Server (NTRS)
Kirkham, H.
1992-01-01
A long-term strategy for the integration of new control technologies for power generation and delivery is proposed: the industry would benefit from an evolutionary approach that would adapt to its needs future technologies as well as those that it has so far not heeded. The integrated operation of the entire system, including the distribution system, was proposed as a future goal. The AbNET communication protocols are reviewed, and additions that were made in 1991 are described. In the original network, traffic was controlled by polling at the master station, located at the substation, and routed by a flooding algorithm. In a revised version, the polling and flooding are modified. The question of interfacing low-energy measurement transducers or instrument transformers is considered. There is presently little or no agreement on what the output of optical current transducers (CT's) should be. Appendices deal with the calibration of current transducers; with Delta modulation, a simple means of serially encoding the output of an OCT; and with noise shaping, a method of digital signal processing that trades off the number of bits in a digital sample for a higher number of samples.
NASA Technical Reports Server (NTRS)
Robinson, Julie A.; Tate-Brown, Judy M.
2009-01-01
Using a commercial software CD and minimal up-mass, SNFM monitors the Payload local area network (LAN) to analyze and troubleshoot LAN data traffic. Validating LAN traffic models may allow for faster and more reliable computer networks to sustain systems and science on future space missions. Research Summary: This experiment studies the function of the computer network onboard the ISS. On-orbit packet statistics are captured and used to validate ground based medium rate data link models and enhance the way that the local area network (LAN) is monitored. This information will allow monitoring and improvement in the data transfer capabilities of on-orbit computer networks. The Serial Network Flow Monitor (SNFM) experiment attempts to characterize the network equivalent of traffic jams on board ISS. The SNFM team is able to specifically target historical problem areas including the SAMS (Space Acceleration Measurement System) communication issues, data transmissions from the ISS to the ground teams, and multiple users on the network at the same time. By looking at how various users interact with each other on the network, conflicts can be identified and work can begin on solutions. SNFM is comprised of a commercial off the shelf software package that monitors packet traffic through the payload Ethernet LANs (local area networks) on board ISS.
Developmental time windows for axon growth influence neuronal network topology.
Lim, Sol; Kaiser, Marcus
2015-04-01
Early brain connectivity development consists of multiple stages: birth of neurons, their migration and the subsequent growth of axons and dendrites. Each stage occurs within a certain period of time depending on types of neurons and cortical layers. Forming synapses between neurons either by growing axons starting at similar times for all neurons (much-overlapped time windows) or at different time points (less-overlapped) may affect the topological and spatial properties of neuronal networks. Here, we explore the extreme cases of axon formation during early development, either starting at the same time for all neurons (parallel, i.e., maximally overlapped time windows) or occurring for each neuron separately one neuron after another (serial, i.e., no overlaps in time windows). For both cases, the number of potential and established synapses remained comparable. Topological and spatial properties, however, differed: Neurons that started axon growth early on in serial growth achieved higher out-degrees, higher local efficiency and longer axon lengths while neurons demonstrated more homogeneous connectivity patterns for parallel growth. Second, connection probability decreased more rapidly with distance between neurons for parallel growth than for serial growth. Third, bidirectional connections were more numerous for parallel growth. Finally, we tested our predictions with C. elegans data. Together, this indicates that time windows for axon growth influence the topological and spatial properties of neuronal networks opening up the possibility to a posteriori estimate developmental mechanisms based on network properties of a developed network.
Shao, Chenzhong; Tanaka, Shuji; Nakayama, Takahiro; Hata, Yoshiyuki
2018-01-01
For installing many sensors in a limited space with a limited computing resource, the digitization of the sensor output at the site of sensation has advantages such as a small amount of wiring, low signal interference and high scalability. For this purpose, we have developed a dedicated Complementary Metal-Oxide-Semiconductor (CMOS) Large-Scale Integration (LSI) (referred to as “sensor platform LSI”) for bus-networked Micro-Electro-Mechanical-Systems (MEMS)-LSI integrated sensors. In this LSI, collision avoidance, adaptation and event-driven functions are simply implemented to relieve data collision and congestion in asynchronous serial bus communication. In this study, we developed a network system with 48 sensor platform LSIs based on Printed Circuit Board (PCB) in a backbone bus topology with the bus length being 2.4 m. We evaluated the serial communication performance when 48 LSIs operated simultaneously with the adaptation function. The number of data packets received from each LSI was almost identical, and the average sampling frequency of 384 capacitance channels (eight for each LSI) was 73.66 Hz. PMID:29342923
EvoluCode: Evolutionary Barcodes as a Unifying Framework for Multilevel Evolutionary Data.
Linard, Benjamin; Nguyen, Ngoc Hoan; Prosdocimi, Francisco; Poch, Olivier; Thompson, Julie D
2012-01-01
Evolutionary systems biology aims to uncover the general trends and principles governing the evolution of biological networks. An essential part of this process is the reconstruction and analysis of the evolutionary histories of these complex, dynamic networks. Unfortunately, the methodologies for representing and exploiting such complex evolutionary histories in large scale studies are currently limited. Here, we propose a new formalism, called EvoluCode (Evolutionary barCode), which allows the integration of different evolutionary parameters (eg, sequence conservation, orthology, synteny …) in a unifying format and facilitates the multilevel analysis and visualization of complex evolutionary histories at the genome scale. The advantages of the approach are demonstrated by constructing barcodes representing the evolution of the complete human proteome. Two large-scale studies are then described: (i) the mapping and visualization of the barcodes on the human chromosomes and (ii) automatic clustering of the barcodes to highlight protein subsets sharing similar evolutionary histories and their functional analysis. The methodologies developed here open the way to the efficient application of other data mining and knowledge extraction techniques in evolutionary systems biology studies. A database containing all EvoluCode data is available at: http://lbgi.igbmc.fr/barcodes.
Saida, Satoshi; Watanabe, Ken-ichiro; Sato-Otsubo, Aiko; Terui, Kiminori; Yoshida, Kenichi; Okuno, Yusuke; Toki, Tsutomu; Wang, RuNan; Shiraishi, Yuichi; Miyano, Satoru; Kato, Itaru; Morishima, Tatsuya; Fujino, Hisanori; Umeda, Katsutsugu; Hiramatsu, Hidefumi; Adachi, Souichi; Ito, Etsuro; Ogawa, Seishi; Ito, Mamoru; Nakahata, Tatsutoshi; Heike, Toshio
2013-05-23
Transient abnormal myelopoiesis (TAM) is a clonal preleukemic disorder that progresses to myeloid leukemia of Down syndrome (ML-DS) through the accumulation of genetic alterations. To investigate the mechanism of leukemogenesis in this disorder, a xenograft model of TAM was established using NOD/Shi-scid, interleukin (IL)-2Rγ(null) mice. Serial engraftment after transplantation of cells from a TAM patient who developed ML-DS a year later demonstrated their self-renewal capacity. A GATA1 mutation and no copy number alterations (CNAs) were detected in the primary patient sample by conventional genomic sequencing and CNA profiling. However, in serial transplantations, engrafted TAM-derived cells showed the emergence of divergent subclones with another GATA1 mutation and various CNAs, including a 16q deletion and 1q gain, which are clinically associated with ML-DS. Detailed genomic analysis identified minor subclones with a 16q deletion or this distinct GATA1 mutation in the primary patient sample. These results suggest that genetically heterogeneous subclones with varying leukemia-initiating potential already exist in the neonatal TAM phase, and ML-DS may develop from a pool of such minor clones through clonal selection. Our xenograft model of TAM may provide unique insight into the evolutionary process of leukemia.
Evolutionary fuzzy ARTMAP neural networks for classification of semiconductor defects.
Tan, Shing Chiang; Watada, Junzo; Ibrahim, Zuwairie; Khalid, Marzuki
2015-05-01
Wafer defect detection using an intelligent system is an approach of quality improvement in semiconductor manufacturing that aims to enhance its process stability, increase production capacity, and improve yields. Occasionally, only few records that indicate defective units are available and they are classified as a minority group in a large database. Such a situation leads to an imbalanced data set problem, wherein it engenders a great challenge to deal with by applying machine-learning techniques for obtaining effective solution. In addition, the database may comprise overlapping samples of different classes. This paper introduces two models of evolutionary fuzzy ARTMAP (FAM) neural networks to deal with the imbalanced data set problems in a semiconductor manufacturing operations. In particular, both the FAM models and hybrid genetic algorithms are integrated in the proposed evolutionary artificial neural networks (EANNs) to classify an imbalanced data set. In addition, one of the proposed EANNs incorporates a facility to learn overlapping samples of different classes from the imbalanced data environment. The classification results of the proposed evolutionary FAM neural networks are presented, compared, and analyzed using several classification metrics. The outcomes positively indicate the effectiveness of the proposed networks in handling classification problems with imbalanced data sets.
High-Performance Satellite/Terrestrial-Network Gateway
NASA Technical Reports Server (NTRS)
Beering, David R.
2005-01-01
A gateway has been developed to enable digital communication between (1) the high-rate receiving equipment at NASA's White Sands complex and (2) a standard terrestrial digital communication network at data rates up to 622 Mb/s. The design of this gateway can also be adapted for use in commercial Earth/satellite and digital communication networks, and in terrestrial digital communication networks that include wireless subnetworks. Gateway as used here signifies an electronic circuit that serves as an interface between two electronic communication networks so that a computer (or other terminal) on one network can communicate with a terminal on the other network. The connection between this gateway and the high-rate receiving equipment is made via a synchronous serial data interface at the emitter-coupled-logic (ECL) level. The connection between this gateway and a standard asynchronous transfer mode (ATM) terrestrial communication network is made via a standard user network interface with a synchronous optical network (SONET) connector. The gateway contains circuitry that performs the conversion between the ECL and SONET interfaces. The data rate of the SONET interface can be either 155.52 or 622.08 Mb/s. The gateway derives its clock signal from a satellite modem in the high-rate receiving equipment and, hence, is agile in the sense that it adapts to the data rate of the serial interface.
A novel method to acquire 3D data from serial 2D images of a dental cast
NASA Astrophysics Data System (ADS)
Yi, Yaxing; Li, Zhongke; Chen, Qi; Shao, Jun; Li, Xinshe; Liu, Zhiqin
2007-05-01
This paper introduced a newly developed method to acquire three-dimensional data from serial two-dimensional images of a dental cast. The system consists of a computer and a set of data acquiring device. The data acquiring device is used to take serial pictures of the a dental cast; an artificial neural network works to translate two-dimensional pictures to three-dimensional data; then three-dimensional image can reconstruct by the computer. The three-dimensional data acquiring of dental casts is the foundation of computer-aided diagnosis and treatment planning in orthodontics.
When Reputation Enforces Evolutionary Cooperation in Unreliable MANETs.
Tang, Changbing; Li, Ang; Li, Xiang
2015-10-01
In self-organized mobile ad hoc networks (MANETs), network functions rely on cooperation of self-interested nodes, where a challenge is to enforce their mutual cooperation. In this paper, we study cooperative packet forwarding in a one-hop unreliable channel which results from loss of packets and noisy observation of transmissions. We propose an indirect reciprocity framework based on evolutionary game theory, and enforce cooperation of packet forwarding strategies in both structured and unstructured MANETs. Furthermore, we analyze the evolutionary dynamics of cooperative strategies and derive the threshold of benefit-to-cost ratio to guarantee the convergence of cooperation. The numerical simulations verify that the proposed evolutionary game theoretic solution enforces cooperation when the benefit-to-cost ratio of the altruistic exceeds the critical condition. In addition, the network throughput performance of our proposed strategy in structured MANETs is measured, which is in close agreement with that of the full cooperative strategy.
Yao, Ke-Han; Jiang, Jehn-Ruey; Tsai, Chung-Hsien; Wu, Zong-Syun
2017-08-20
This paper investigates how to efficiently charge sensor nodes in a wireless rechargeable sensor network (WRSN) with radio frequency (RF) chargers to make the network sustainable. An RF charger is assumed to be equipped with a uniform circular array (UCA) of 12 antennas with the radius λ , where λ is the RF wavelength. The UCA can steer most RF energy in a target direction to charge a specific WRSN node by the beamforming technology. Two evolutionary algorithms (EAs) using the evolution strategy (ES), namely the Evolutionary Beamforming Optimization (EBO) algorithm and the Evolutionary Beamforming Optimization Reseeding (EBO-R) algorithm, are proposed to nearly optimize the power ratio of the UCA beamforming peak side lobe (PSL) and the main lobe (ML) aimed at the given target direction. The proposed algorithms are simulated for performance evaluation and are compared with a related algorithm, called Particle Swarm Optimization Gravitational Search Algorithm-Explore (PSOGSA-Explore), to show their superiority.
Designing synthetic networks in silico: a generalised evolutionary algorithm approach.
Smith, Robert W; van Sluijs, Bob; Fleck, Christian
2017-12-02
Evolution has led to the development of biological networks that are shaped by environmental signals. Elucidating, understanding and then reconstructing important network motifs is one of the principal aims of Systems & Synthetic Biology. Consequently, previous research has focused on finding optimal network structures and reaction rates that respond to pulses or produce stable oscillations. In this work we present a generalised in silico evolutionary algorithm that simultaneously finds network structures and reaction rates (genotypes) that can satisfy multiple defined objectives (phenotypes). The key step to our approach is to translate a schema/binary-based description of biological networks into systems of ordinary differential equations (ODEs). The ODEs can then be solved numerically to provide dynamic information about an evolved networks functionality. Initially we benchmark algorithm performance by finding optimal networks that can recapitulate concentration time-series data and perform parameter optimisation on oscillatory dynamics of the Repressilator. We go on to show the utility of our algorithm by finding new designs for robust synthetic oscillators, and by performing multi-objective optimisation to find a set of oscillators and feed-forward loops that are optimal at balancing different system properties. In sum, our results not only confirm and build on previous observations but we also provide new designs of synthetic oscillators for experimental construction. In this work we have presented and tested an evolutionary algorithm that can design a biological network to produce desired output. Given that previous designs of synthetic networks have been limited to subregions of network- and parameter-space, the use of our evolutionary optimisation algorithm will enable Synthetic Biologists to construct new systems with the potential to display a wider range of complex responses.
Liu, Fuxiao; Wu, Xiaodong; Li, Lin; Zou, Yanli; Liu, Shan; Wang, Zhiliang
2016-08-01
The genus Morbillivirus is classified into the family Paramyxoviridae, and is composed of 6 members, namely measles virus (MV), rinderpest virus (RPV), peste-des-petits-ruminants virus (PPRV), canine distemper virus (CDV), phocine distemper virus (PDV) and cetacean morbillivirus (CeMV). The MV, RPV, PPRV and CDV have been successfully attenuated through their serial passages in vitro for the production of live vaccines. It has been demonstrated that the morbilliviral virulence in animals was progressively attenuated with their consecutive passages in vitro. However, only a few reports were involved in explanation of an attenuation-related mechanism on them until many years after the establishment of a quasispecies theory. RNA virus quasispecies arise from rapid evolution of viruses with high mutation rate during genomic replication, and play an important role in gradual loss of viral virulence by serial passages. Here, we overviewed the development of live-attenuated vaccine strains against morbilliviruses by consecutive passages in vitro, and further discussed a related mechanism concerning the relationship between virulence attenuation and viral evolution. Copyright © 2016 Elsevier Ltd. All rights reserved.
US stock market efficiency over weekly, monthly, quarterly and yearly time scales
NASA Astrophysics Data System (ADS)
Rodriguez, E.; Aguilar-Cornejo, M.; Femat, R.; Alvarez-Ramirez, J.
2014-11-01
In financial markets, the weak form of the efficient market hypothesis implies that price returns are serially uncorrelated sequences. In other words, prices should follow a random walk behavior. Recent developments in evolutionary economic theory (Lo, 2004) have tailored the concept of adaptive market hypothesis (AMH) by proposing that market efficiency is not an all-or-none concept, but rather market efficiency is a characteristic that varies continuously over time and across markets. Within the AMH framework, this work considers the Dow Jones Index Average (DJIA) for studying the deviations from the random walk behavior over time. It is found that the market efficiency also varies over different time scales, from weeks to years. The well-known detrended fluctuation analysis was used for the characterization of the serial correlations of the return sequences. The results from the empirical showed that interday and intraday returns are more serially correlated than overnight returns. Also, some insights in the presence of business cycles (e.g., Juglar and Kuznets) are provided in terms of time variations of the scaling exponent.
Hierarchical classification with a competitive evolutionary neural tree.
Adams, R G.; Butchart, K; Davey, N
1999-04-01
A new, dynamic, tree structured network, the Competitive Evolutionary Neural Tree (CENT) is introduced. The network is able to provide a hierarchical classification of unlabelled data sets. The main advantage that the CENT offers over other hierarchical competitive networks is its ability to self determine the number, and structure, of the competitive nodes in the network, without the need for externally set parameters. The network produces stable classificatory structures by halting its growth using locally calculated heuristics. The results of network simulations are presented over a range of data sets, including Anderson's IRIS data set. The CENT network demonstrates its ability to produce a representative hierarchical structure to classify a broad range of data sets.
Bipartite graphs as models of population structures in evolutionary multiplayer games.
Peña, Jorge; Rochat, Yannick
2012-01-01
By combining evolutionary game theory and graph theory, "games on graphs" study the evolutionary dynamics of frequency-dependent selection in population structures modeled as geographical or social networks. Networks are usually represented by means of unipartite graphs, and social interactions by two-person games such as the famous prisoner's dilemma. Unipartite graphs have also been used for modeling interactions going beyond pairwise interactions. In this paper, we argue that bipartite graphs are a better alternative to unipartite graphs for describing population structures in evolutionary multiplayer games. To illustrate this point, we make use of bipartite graphs to investigate, by means of computer simulations, the evolution of cooperation under the conventional and the distributed N-person prisoner's dilemma. We show that several implicit assumptions arising from the standard approach based on unipartite graphs (such as the definition of replacement neighborhoods, the intertwining of individual and group diversity, and the large overlap of interaction neighborhoods) can have a large impact on the resulting evolutionary dynamics. Our work provides a clear example of the importance of construction procedures in games on graphs, of the suitability of bigraphs and hypergraphs for computational modeling, and of the importance of concepts from social network analysis such as centrality, centralization and bipartite clustering for the understanding of dynamical processes occurring on networked population structures.
NASA Technical Reports Server (NTRS)
Chau, Savio; Vatan, Farrokh; Randolph, Vincent; Baroth, Edmund C.
2006-01-01
Future In-Space propulsion systems for exploration programs will invariably require data collection from a large number of sensors. Consider the sensors needed for monitoring several vehicle systems states of health, including the collection of structural health data, over a large area. This would include the fuel tanks, habitat structure, and science containment of systems required for Lunar, Mars, or deep space exploration. Such a system would consist of several hundred or even thousands of sensors. Conventional avionics system design will require these sensors to be connected to a few Remote Health Units (RHU), which are connected to robust, micro flight computers through a serial bus. This results in a large mass of cabling and unacceptable weight. This paper first gives a survey of several techniques that may reduce the cabling mass for sensors. These techniques can be categorized into four classes: power line communication, serial sensor buses, compound serial buses, and wireless network. The power line communication approach uses the power line to carry both power and data, so that the conventional data lines can be eliminated. The serial sensor bus approach reduces most of the cabling by connecting all the sensors with a single (or redundant) serial bus. Many standard buses for industrial control and sensor buses can support several hundreds of nodes, however, have not been space qualified. Conventional avionics serial buses such as the Mil-Std-1553B bus and IEEE 1394a are space qualified but can support only a limited number of nodes. The third approach is to combine avionics buses to increase their addressability. The reliability, EMI/EMC, and flight qualification issues of wireless networks have to be addressed. Several wireless networks such as the IEEE 802.11 and Ultra Wide Band are surveyed in this paper. The placement of sensors can also affect cable mass. Excessive sensors increase the number of cables unnecessarily. Insufficient number of sensors may not provide adequate coverage of the system. This paper also discusses an optimal technique to place and validate sensors.
Underlying Principles of Natural Selection in Network Evolution: Systems Biology Approach
Chen, Bor-Sen; Wu, Wei-Sheng
2007-01-01
Systems biology is a rapidly expanding field that integrates diverse areas of science such as physics, engineering, computer science, mathematics, and biology toward the goal of elucidating the underlying principles of hierarchical metabolic and regulatory systems in the cell, and ultimately leading to predictive understanding of cellular response to perturbations. Because post-genomics research is taking place throughout the tree of life, comparative approaches offer a way for combining data from many organisms to shed light on the evolution and function of biological networks from the gene to the organismal level. Therefore, systems biology can build on decades of theoretical work in evolutionary biology, and at the same time evolutionary biology can use the systems biology approach to go in new uncharted directions. In this study, we present a review of how the post-genomics era is adopting comparative approaches and dynamic system methods to understand the underlying design principles of network evolution and to shape the nascent field of evolutionary systems biology. Finally, the application of evolutionary systems biology to robust biological network designs is also discussed from the synthetic biology perspective. PMID:19468310
International Access to Bibliographic Data: MARC and MARC-Related Activities.
ERIC Educational Resources Information Center
Hopkinson, Alan
1984-01-01
This review of international information exchange formats focuses on the international standard ISO 2709 and MARC formats, "UNISIST Reference Manual," UNIMARC (Universal MARC format), the Common Communications Format, centralized network formats (International Serials Data System, MINISIS, regional), International MARC network study…
The Virginia Tech Library System (VTLS).
ERIC Educational Resources Information Center
McGrath, Deborah Hall; Lee, Carl R.
1989-01-01
Discusses topics relating to the Virginia Tech Library System: the company (VTLS, Inc.); the software; data structure; cataloging, status, and authority control; circulation; serials control and acquisitions; the online catalog; management reporting; networking; and the operating environment. Sidebars discuss the Vanilla Network; LINNEA--a network…
Experimental evolution of protein–protein interaction networks
Kaçar, Betül; Gaucher, Eric A.
2013-01-01
The modern synthesis of evolutionary theory and genetics has enabled us to discover underlying molecular mechanisms of organismal evolution. We know that in order to maximize an organism's fitness in a particular environment, individual interactions among components of protein and nucleic acid networks need to be optimized by natural selection, or sometimes through random processes, as the organism responds to changes and/or challenges in the environment. Despite the significant role of molecular networks in determining an organism's adaptation to its environment, we still do not know how such inter- and intra-molecular interactions within networks change over time and contribute to an organism's evolvability while maintaining overall network functions. One way to address this challenge is to identify connections between molecular networks and their host organisms, to manipulate these connections, and then attempt to understand how such perturbations influence molecular dynamics of the network and thus influence evolutionary paths and organismal fitness. In the present review, we discuss how integrating evolutionary history with experimental systems that combine tools drawn from molecular evolution, synthetic biology and biochemistry allow us to identify the underlying mechanisms of organismal evolution, particularly from the perspective of protein interaction networks. PMID:23849056
Evolution of SH2 domains and phosphotyrosine signalling networks
Liu, Bernard A.; Nash, Piers D.
2012-01-01
Src homology 2 (SH2) domains mediate selective protein–protein interactions with tyrosine phosphorylated proteins, and in doing so define specificity of phosphotyrosine (pTyr) signalling networks. SH2 domains and protein-tyrosine phosphatases expand alongside protein-tyrosine kinases (PTKs) to coordinate cellular and organismal complexity in the evolution of the unikont branch of the eukaryotes. Examination of conserved families of PTKs and SH2 domain proteins provides fiduciary marks that trace the evolutionary landscape for the development of complex cellular systems in the proto-metazoan and metazoan lineages. The evolutionary provenance of conserved SH2 and PTK families reveals the mechanisms by which diversity is achieved through adaptations in tissue-specific gene transcription, altered ligand binding, insertions of linear motifs and the gain or loss of domains following gene duplication. We discuss mechanisms by which pTyr-mediated signalling networks evolve through the development of novel and expanded families of SH2 domain proteins and the elaboration of connections between pTyr-signalling proteins. These changes underlie the variety of general and specific signalling networks that give rise to tissue-specific functions and increasingly complex developmental programmes. Examination of SH2 domains from an evolutionary perspective provides insight into the process by which evolutionary expansion and modification of molecular protein interaction domain proteins permits the development of novel protein-interaction networks and accommodates adaptation of signalling networks. PMID:22889907
The Brain's Router: A Cortical Network Model of Serial Processing in the Primate Brain
Zylberberg, Ariel; Fernández Slezak, Diego; Roelfsema, Pieter R.; Dehaene, Stanislas; Sigman, Mariano
2010-01-01
The human brain efficiently solves certain operations such as object recognition and categorization through a massively parallel network of dedicated processors. However, human cognition also relies on the ability to perform an arbitrarily large set of tasks by flexibly recombining different processors into a novel chain. This flexibility comes at the cost of a severe slowing down and a seriality of operations (100–500 ms per step). A limit on parallel processing is demonstrated in experimental setups such as the psychological refractory period (PRP) and the attentional blink (AB) in which the processing of an element either significantly delays (PRP) or impedes conscious access (AB) of a second, rapidly presented element. Here we present a spiking-neuron implementation of a cognitive architecture where a large number of local parallel processors assemble together to produce goal-driven behavior. The precise mapping of incoming sensory stimuli onto motor representations relies on a “router” network capable of flexibly interconnecting processors and rapidly changing its configuration from one task to another. Simulations show that, when presented with dual-task stimuli, the network exhibits parallel processing at peripheral sensory levels, a memory buffer capable of keeping the result of sensory processing on hold, and a slow serial performance at the router stage, resulting in a performance bottleneck. The network captures the detailed dynamics of human behavior during dual-task-performance, including both mean RTs and RT distributions, and establishes concrete predictions on neuronal dynamics during dual-task experiments in humans and non-human primates. PMID:20442869
NASA Astrophysics Data System (ADS)
Fu, Shihua; Li, Haitao; Zhao, Guodong
2018-05-01
This paper investigates the evolutionary dynamic and strategy optimisation for a kind of networked evolutionary games whose strategy updating rules incorporate 'bankruptcy' mechanism, and the situation that each player's bankruptcy is due to the previous continuous low profits gaining from the game is considered. First, by using semi-tensor product of matrices method, the evolutionary dynamic of this kind of games is expressed as a higher order logical dynamic system and then converted into its algebraic form, based on which, the evolutionary dynamic of the given games can be discussed. Second, the strategy optimisation problem is investigated, and some free-type control sequences are designed to maximise the total payoff of the whole game. Finally, an illustrative example is given to show that our new results are very effective.
A systems approach to physiologic evolution: From micelles to consciousness.
Torday, John S; Miller, William B
2018-01-01
A systems approach to evolutionary biology offers the promise of an improved understanding of the fundamental principles of life through the effective integration of many biologic disciplines. It is presented that any critical integrative approach to evolutionary development involves a paradigmatic shift in perspective, more than just the engagement of a large number of disciplines. Critical to this differing viewpoint is the recognition that all biological processes originate from the unicellular state and remain permanently anchored to that phase throughout evolutionary development despite their macroscopic appearances. Multicellular eukaryotic development can, therefore, be viewed as a series of connected responses to epiphenomena that proceeds from that base in continuous iterative maintenance of collective cellular homeostatic equipoise juxtaposed against an ever-changing and challenging environment. By following this trajectory of multicellular eukaryotic evolution from within unicellular First Principles of Physiology forward, the mechanistic nature of complex physiology can be identified through a step-wise analysis of a continuous arc of vertebrate evolution based upon serial exaptations. © 2017 Wiley Periodicals, Inc.
A sparse matrix algorithm on the Boolean vector machine
NASA Technical Reports Server (NTRS)
Wagner, Robert A.; Patrick, Merrell L.
1988-01-01
VLSI technology is being used to implement a prototype Boolean Vector Machine (BVM), which is a large network of very small processors with equally small memories that operate in SIMD mode; these use bit-serial arithmetic, and communicate via cube-connected cycles network. The BVM's bit-serial arithmetic and the small memories of individual processors are noted to compromise the system's effectiveness in large numerical problem applications. Attention is presently given to the implementation of a basic matrix-vector iteration algorithm for space matrices of the BVM, in order to generate over 1 billion useful floating-point operations/sec for this iteration algorithm. The algorithm is expressed in a novel language designated 'BVM'.
Network Analysis of Protein Adaptation: Modeling the Functional Impact of Multiple Mutations
Beleva Guthrie, Violeta; Masica, David L; Fraser, Andrew; Federico, Joseph; Fan, Yunfan; Camps, Manel; Karchin, Rachel
2018-01-01
Abstract The evolution of new biochemical activities frequently involves complex dependencies between mutations and rapid evolutionary radiation. Mutation co-occurrence and covariation have previously been used to identify compensating mutations that are the result of physical contacts and preserve protein function and fold. Here, we model pairwise functional dependencies and higher order interactions that enable evolution of new protein functions. We use a network model to find complex dependencies between mutations resulting from evolutionary trade-offs and pleiotropic effects. We present a method to construct these networks and to identify functionally interacting mutations in both extant and reconstructed ancestral sequences (Network Analysis of Protein Adaptation). The time ordering of mutations can be incorporated into the networks through phylogenetic reconstruction. We apply NAPA to three distantly homologous β-lactamase protein clusters (TEM, CTX-M-3, and OXA-51), each of which has experienced recent evolutionary radiation under substantially different selective pressures. By analyzing the network properties of each protein cluster, we identify key adaptive mutations, positive pairwise interactions, different adaptive solutions to the same selective pressure, and complex evolutionary trajectories likely to increase protein fitness. We also present evidence that incorporating information from phylogenetic reconstruction and ancestral sequence inference can reduce the number of spurious links in the network, whereas preserving overall network community structure. The analysis does not require structural or biochemical data. In contrast to function-preserving mutation dependencies, which are frequently from structural contacts, gain-of-function mutation dependencies are most commonly between residues distal in protein structure. PMID:29522102
Exploiting a GSM Network for Precise Payload Delivery
2009-05-07
N is shown in Fig.6. As shown in this figure the Snowflake payload now includes a standard Blackberry 8310 cell phone , which communicates with the...weather station, measuring winds and barometric pressure, serial to Bluetooth interface, and Blackberry 8310 cell phone . The portable Kestrel 4000...interfacing the serial stream with a standard Blackberry 8310 cell phone carrying a AT&T SIM card. 6 American Institute of Aeronautics and
PARAMESH: A Parallel Adaptive Mesh Refinement Community Toolkit
NASA Technical Reports Server (NTRS)
MacNeice, Peter; Olson, Kevin M.; Mobarry, Clark; deFainchtein, Rosalinda; Packer, Charles
1999-01-01
In this paper, we describe a community toolkit which is designed to provide parallel support with adaptive mesh capability for a large and important class of computational models, those using structured, logically cartesian meshes. The package of Fortran 90 subroutines, called PARAMESH, is designed to provide an application developer with an easy route to extend an existing serial code which uses a logically cartesian structured mesh into a parallel code with adaptive mesh refinement. Alternatively, in its simplest use, and with minimal effort, it can operate as a domain decomposition tool for users who want to parallelize their serial codes, but who do not wish to use adaptivity. The package can provide them with an incremental evolutionary path for their code, converting it first to uniformly refined parallel code, and then later if they so desire, adding adaptivity.
Dynamic Adaptive Neural Network Arrays: A Neuromorphic Architecture
DOE Office of Scientific and Technical Information (OSTI.GOV)
Disney, Adam; Reynolds, John
2015-01-01
Dynamic Adaptive Neural Network Array (DANNA) is a neuromorphic hardware implementation. It differs from most other neuromorphic projects in that it allows for programmability of structure, and it is trained or designed using evolutionary optimization. This paper describes the DANNA structure, how DANNA is trained using evolutionary optimization, and an application of DANNA to a very simple classification task.
Breeding novel solutions in the brain: a model of Darwinian neurodynamics.
Szilágyi, András; Zachar, István; Fedor, Anna; de Vladar, Harold P; Szathmáry, Eörs
2016-01-01
Background : The fact that surplus connections and neurons are pruned during development is well established. We complement this selectionist picture by a proof-of-principle model of evolutionary search in the brain, that accounts for new variations in theory space. We present a model for Darwinian evolutionary search for candidate solutions in the brain. Methods : We combine known components of the brain - recurrent neural networks (acting as attractors), the action selection loop and implicit working memory - to provide the appropriate Darwinian architecture. We employ a population of attractor networks with palimpsest memory. The action selection loop is employed with winners-share-all dynamics to select for candidate solutions that are transiently stored in implicit working memory. Results : We document two processes: selection of stored solutions and evolutionary search for novel solutions. During the replication of candidate solutions attractor networks occasionally produce recombinant patterns, increasing variation on which selection can act. Combinatorial search acts on multiplying units (activity patterns) with hereditary variation and novel variants appear due to (i) noisy recall of patterns from the attractor networks, (ii) noise during transmission of candidate solutions as messages between networks, and, (iii) spontaneously generated, untrained patterns in spurious attractors. Conclusions : Attractor dynamics of recurrent neural networks can be used to model Darwinian search. The proposed architecture can be used for fast search among stored solutions (by selection) and for evolutionary search when novel candidate solutions are generated in successive iterations. Since all the suggested components are present in advanced nervous systems, we hypothesize that the brain could implement a truly evolutionary combinatorial search system, capable of generating novel variants.
Inferring explicit weighted consensus networks to represent alternative evolutionary histories
2013-01-01
Background The advent of molecular biology techniques and constant increase in availability of genetic material have triggered the development of many phylogenetic tree inference methods. However, several reticulate evolution processes, such as horizontal gene transfer and hybridization, have been shown to blur the species evolutionary history by causing discordance among phylogenies inferred from different genes. Methods To tackle this problem, we hereby describe a new method for inferring and representing alternative (reticulate) evolutionary histories of species as an explicit weighted consensus network which can be constructed from a collection of gene trees with or without prior knowledge of the species phylogeny. Results We provide a way of building a weighted phylogenetic network for each of the following reticulation mechanisms: diploid hybridization, intragenic recombination and complete or partial horizontal gene transfer. We successfully tested our method on some synthetic and real datasets to infer the above-mentioned evolutionary events which may have influenced the evolution of many species. Conclusions Our weighted consensus network inference method allows one to infer, visualize and validate statistically major conflicting signals induced by the mechanisms of reticulate evolution. The results provided by the new method can be used to represent the inferred conflicting signals by means of explicit and easy-to-interpret phylogenetic networks. PMID:24359207
Evolutionary analyses of non-genealogical bonds produced by introgressive descent.
Bapteste, Eric; Lopez, Philippe; Bouchard, Frédéric; Baquero, Fernando; McInerney, James O; Burian, Richard M
2012-11-06
All evolutionary biologists are familiar with evolutionary units that evolve by vertical descent in a tree-like fashion in single lineages. However, many other kinds of processes contribute to evolutionary diversity. In vertical descent, the genetic material of a particular evolutionary unit is propagated by replication inside its own lineage. In what we call introgressive descent, the genetic material of a particular evolutionary unit propagates into different host structures and is replicated within these host structures. Thus, introgressive descent generates a variety of evolutionary units and leaves recognizable patterns in resemblance networks. We characterize six kinds of evolutionary units, of which five involve mosaic lineages generated by introgressive descent. To facilitate detection of these units in resemblance networks, we introduce terminology based on two notions, P3s (subgraphs of three nodes: A, B, and C) and mosaic P3s, and suggest an apparatus for systematic detection of introgressive descent. Mosaic P3s correspond to a distinct type of evolutionary bond that is orthogonal to the bonds of kinship and genealogy usually examined by evolutionary biologists. We argue that recognition of these evolutionary bonds stimulates radical rethinking of key questions in evolutionary biology (e.g., the relations among evolutionary players in very early phases of evolutionary history, the origin and emergence of novelties, and the production of new lineages). This line of research will expand the study of biological complexity beyond the usual genealogical bonds, revealing additional sources of biodiversity. It provides an important step to a more realistic pluralist treatment of evolutionary complexity.
Iris double recognition based on modified evolutionary neural network
NASA Astrophysics Data System (ADS)
Liu, Shuai; Liu, Yuan-Ning; Zhu, Xiao-Dong; Huo, Guang; Liu, Wen-Tao; Feng, Jia-Kai
2017-11-01
Aiming at multicategory iris recognition under illumination and noise interference, this paper proposes a method of iris double recognition based on a modified evolutionary neural network. An equalization histogram and Laplace of Gaussian operator are used to process the iris to suppress illumination and noise interference and Haar wavelet to convert the iris feature to binary feature encoding. Calculate the Hamming distance for the test iris and template iris , and compare with classification threshold, determine the type of iris. If the iris cannot be identified as a different type, there needs to be a secondary recognition. The connection weights in back-propagation (BP) neural network use modified evolutionary neural network to adaptively train. The modified neural network is composed of particle swarm optimization with mutation operator and BP neural network. According to different iris libraries in different circumstances of experimental results, under illumination and noise interference, the correct recognition rate of this algorithm is higher, the ROC curve is closer to the coordinate axis, the training and recognition time is shorter, and the stability and the robustness are better.
Jaeger, Johannes; Crombach, Anton
2012-01-01
We propose an approach to evolutionary systems biology which is based on reverse engineering of gene regulatory networks and in silico evolutionary simulations. We infer regulatory parameters for gene networks by fitting computational models to quantitative expression data. This allows us to characterize the regulatory structure and dynamical repertoire of evolving gene regulatory networks with a reasonable amount of experimental and computational effort. We use the resulting network models to identify those regulatory interactions that are conserved, and those that have diverged between different species. Moreover, we use the models obtained by data fitting as starting points for simulations of evolutionary transitions between species. These simulations enable us to investigate whether such transitions are random, or whether they show stereotypical series of regulatory changes which depend on the structure and dynamical repertoire of an evolving network. Finally, we present a case study-the gap gene network in dipterans (flies, midges, and mosquitoes)-to illustrate the practical application of the proposed methodology, and to highlight the kind of biological insights that can be gained by this approach.
Bipartite Graphs as Models of Population Structures in Evolutionary Multiplayer Games
Peña, Jorge; Rochat, Yannick
2012-01-01
By combining evolutionary game theory and graph theory, “games on graphs” study the evolutionary dynamics of frequency-dependent selection in population structures modeled as geographical or social networks. Networks are usually represented by means of unipartite graphs, and social interactions by two-person games such as the famous prisoner’s dilemma. Unipartite graphs have also been used for modeling interactions going beyond pairwise interactions. In this paper, we argue that bipartite graphs are a better alternative to unipartite graphs for describing population structures in evolutionary multiplayer games. To illustrate this point, we make use of bipartite graphs to investigate, by means of computer simulations, the evolution of cooperation under the conventional and the distributed N-person prisoner’s dilemma. We show that several implicit assumptions arising from the standard approach based on unipartite graphs (such as the definition of replacement neighborhoods, the intertwining of individual and group diversity, and the large overlap of interaction neighborhoods) can have a large impact on the resulting evolutionary dynamics. Our work provides a clear example of the importance of construction procedures in games on graphs, of the suitability of bigraphs and hypergraphs for computational modeling, and of the importance of concepts from social network analysis such as centrality, centralization and bipartite clustering for the understanding of dynamical processes occurring on networked population structures. PMID:22970237
Low-frequency sine wave hard-limiting technique
NASA Technical Reports Server (NTRS)
Anderson, T. O.
1977-01-01
Circuit includes serial-in/parallel-out shift register and weighting network that are used to eliminate effects of noise and other nonrepetitive circuit transients. Register and weighting network average decisions from section of signal where decisions are more dependable or where differences between two consecutive samples are larger.
An Evolutionary Optimization Framework for Neural Networks and Neuromorphic Architectures
DOE Office of Scientific and Technical Information (OSTI.GOV)
Schuman, Catherine D; Plank, James; Disney, Adam
2016-01-01
As new neural network and neuromorphic architectures are being developed, new training methods that operate within the constraints of the new architectures are required. Evolutionary optimization (EO) is a convenient training method for new architectures. In this work, we review a spiking neural network architecture and a neuromorphic architecture, and we describe an EO training framework for these architectures. We present the results of this training framework on four classification data sets and compare those results to other neural network and neuromorphic implementations. We also discuss how this EO framework may be extended to other architectures.
Yao, Ke-Han; Jiang, Jehn-Ruey; Tsai, Chung-Hsien; Wu, Zong-Syun
2017-01-01
This paper investigates how to efficiently charge sensor nodes in a wireless rechargeable sensor network (WRSN) with radio frequency (RF) chargers to make the network sustainable. An RF charger is assumed to be equipped with a uniform circular array (UCA) of 12 antennas with the radius λ, where λ is the RF wavelength. The UCA can steer most RF energy in a target direction to charge a specific WRSN node by the beamforming technology. Two evolutionary algorithms (EAs) using the evolution strategy (ES), namely the Evolutionary Beamforming Optimization (EBO) algorithm and the Evolutionary Beamforming Optimization Reseeding (EBO-R) algorithm, are proposed to nearly optimize the power ratio of the UCA beamforming peak side lobe (PSL) and the main lobe (ML) aimed at the given target direction. The proposed algorithms are simulated for performance evaluation and are compared with a related algorithm, called Particle Swarm Optimization Gravitational Search Algorithm-Explore (PSOGSA-Explore), to show their superiority. PMID:28825648
The evolution of cooperation on geographical networks
NASA Astrophysics Data System (ADS)
Li, Yixiao; Wang, Yi; Sheng, Jichuan
2017-11-01
We study evolutionary public goods game on geographical networks, i.e., complex networks which are located on a geographical plane. The geographical feature effects in two ways: In one way, the geographically-induced network structure influences the overall evolutionary dynamics, and, in the other way, the geographical length of an edge influences the cost when the two players at the two ends interact. For the latter effect, we design a new cost function of cooperators, which simply assumes that the longer the distance between two players, the higher cost the cooperator(s) of them have to pay. In this study, network substrates are generated by a previous spatial network model with a cost-benefit parameter controlling the network topology. Our simulations show that the greatest promotion of cooperation is achieved in the intermediate regime of the parameter, in which empirical estimates of various railway networks fall. Further, we investigate how the distribution of edges' geographical costs influences the evolutionary dynamics and consider three patterns of the distribution: an approximately-equal distribution, a diverse distribution, and a polarized distribution. For normal geographical networks which are generated using intermediate values of the cost-benefit parameter, a diverse distribution hinders the evolution of cooperation, whereas a polarized distribution lowers the threshold value of the amplification factor for cooperation in public goods game. These results are helpful for understanding the evolution of cooperation on real-world geographical networks.
Network Management System for Tactical Mobile Ad Hoc Network Segments
2011-09-01
Protocol UFO UHF Follow-On UHF Ultra High Frequency USB Universal Serial Bus VHF Very High Frequency VIRT Valuable Information at the Right Time...military satellite system known as the UHF Follow-on system ( UFO ) only provides capacity for 600 concurrent users. DoD users also have commercial
Kroshl, William M; Sarkani, Shahram; Mazzuchi, Thomas A
2015-09-01
This article presents ongoing research that focuses on efficient allocation of defense resources to minimize the damage inflicted on a spatially distributed physical network such as a pipeline, water system, or power distribution system from an attack by an active adversary, recognizing the fundamental difference between preparing for natural disasters such as hurricanes, earthquakes, or even accidental systems failures and the problem of allocating resources to defend against an opponent who is aware of, and anticipating, the defender's efforts to mitigate the threat. Our approach is to utilize a combination of integer programming and agent-based modeling to allocate the defensive resources. We conceptualize the problem as a Stackelberg "leader follower" game where the defender first places his assets to defend key areas of the network, and the attacker then seeks to inflict the maximum damage possible within the constraints of resources and network structure. The criticality of arcs in the network is estimated by a deterministic network interdiction formulation, which then informs an evolutionary agent-based simulation. The evolutionary agent-based simulation is used to determine the allocation of resources for attackers and defenders that results in evolutionary stable strategies, where actions by either side alone cannot increase its share of victories. We demonstrate these techniques on an example network, comparing the evolutionary agent-based results to a more traditional, probabilistic risk analysis (PRA) approach. Our results show that the agent-based approach results in a greater percentage of defender victories than does the PRA-based approach. © 2015 Society for Risk Analysis.
NASA Technical Reports Server (NTRS)
Burns, R. R.
1981-01-01
The potential and functional requirements of fiber optic bus designs for next generation aircraft are assessed. State-of-the-art component evaluations and projections were used in the system study. Complex networks were decomposed into dedicated structures, star buses, and serial buses for detailed analysis. Comparisons of dedicated links, star buses, and serial buses with and without full duplex operation and with considerations for terminal to terminal communication requirements were obtained. This baseline was then used to consider potential extensions of busing methods to include wavelength multiplexing and optical switches. Example buses were illustrated for various areas of the aircraft as potential starting points for more detail analysis as the platform becomes definitized.
Nonbinary Tree-Based Phylogenetic Networks.
Jetten, Laura; van Iersel, Leo
2018-01-01
Rooted phylogenetic networks are used to describe evolutionary histories that contain non-treelike evolutionary events such as hybridization and horizontal gene transfer. In some cases, such histories can be described by a phylogenetic base-tree with additional linking arcs, which can, for example, represent gene transfer events. Such phylogenetic networks are called tree-based. Here, we consider two possible generalizations of this concept to nonbinary networks, which we call tree-based and strictly-tree-based nonbinary phylogenetic networks. We give simple graph-theoretic characterizations of tree-based and strictly-tree-based nonbinary phylogenetic networks. Moreover, we show for each of these two classes that it can be decided in polynomial time whether a given network is contained in the class. Our approach also provides a new view on tree-based binary phylogenetic networks. Finally, we discuss two examples of nonbinary phylogenetic networks in biology and show how our results can be applied to them.
Chen, Bor-Sen; Lin, Ying-Po
2013-01-01
Robust stabilization and environmental disturbance attenuation are ubiquitous systematic properties observed in biological systems at different levels. The underlying principles for robust stabilization and environmental disturbance attenuation are universal to both complex biological systems and sophisticated engineering systems. In many biological networks, network robustness should be enough to confer intrinsic robustness in order to tolerate intrinsic parameter fluctuations, genetic robustness for buffering genetic variations, and environmental robustness for resisting environmental disturbances. With this, the phenotypic stability of biological network can be maintained, thus guaranteeing phenotype robustness. This paper presents a survey on biological systems and then develops a unifying mathematical framework for investigating the principles of both robust stabilization and environmental disturbance attenuation in systems and evolutionary biology. Further, from the unifying mathematical framework, it was discovered that the phenotype robustness criterion for biological networks at different levels relies upon intrinsic robustness + genetic robustness + environmental robustness ≦ network robustness. When this is true, the phenotype robustness can be maintained in spite of intrinsic parameter fluctuations, genetic variations, and environmental disturbances. Therefore, the trade-offs between intrinsic robustness, genetic robustness, environmental robustness, and network robustness in systems and evolutionary biology can also be investigated through their corresponding phenotype robustness criterion from the systematic point of view. PMID:23515240
Chen, Bor-Sen; Lin, Ying-Po
2013-01-01
Robust stabilization and environmental disturbance attenuation are ubiquitous systematic properties observed in biological systems at different levels. The underlying principles for robust stabilization and environmental disturbance attenuation are universal to both complex biological systems and sophisticated engineering systems. In many biological networks, network robustness should be enough to confer intrinsic robustness in order to tolerate intrinsic parameter fluctuations, genetic robustness for buffering genetic variations, and environmental robustness for resisting environmental disturbances. With this, the phenotypic stability of biological network can be maintained, thus guaranteeing phenotype robustness. This paper presents a survey on biological systems and then develops a unifying mathematical framework for investigating the principles of both robust stabilization and environmental disturbance attenuation in systems and evolutionary biology. Further, from the unifying mathematical framework, it was discovered that the phenotype robustness criterion for biological networks at different levels relies upon intrinsic robustness + genetic robustness + environmental robustness ≦ network robustness. When this is true, the phenotype robustness can be maintained in spite of intrinsic parameter fluctuations, genetic variations, and environmental disturbances. Therefore, the trade-offs between intrinsic robustness, genetic robustness, environmental robustness, and network robustness in systems and evolutionary biology can also be investigated through their corresponding phenotype robustness criterion from the systematic point of view.
The great opportunity: Evolutionary applications to medicine and public health.
Nesse, Randolph M; Stearns, Stephen C
2008-02-01
Evolutionary biology is an essential basic science for medicine, but few doctors and medical researchers are familiar with its most relevant principles. Most medical schools have geneticists who understand evolution, but few have even one evolutionary biologist to suggest other possible applications. The canyon between evolutionary biology and medicine is wide. The question is whether they offer each other enough to make bridge building worthwhile. What benefits could be expected if evolution were brought fully to bear on the problems of medicine? How would studying medical problems advance evolutionary research? Do doctors need to learn evolution, or is it valuable mainly for researchers? What practical steps will promote the application of evolutionary biology in the areas of medicine where it offers the most? To address these questions, we review current and potential applications of evolutionary biology to medicine and public health. Some evolutionary technologies, such as population genetics, serial transfer production of live vaccines, and phylogenetic analysis, have been widely applied. Other areas, such as infectious disease and aging research, illustrate the dramatic recent progress made possible by evolutionary insights. In still other areas, such as epidemiology, psychiatry, and understanding the regulation of bodily defenses, applying evolutionary principles remains an open opportunity. In addition to the utility of specific applications, an evolutionary perspective fundamentally challenges the prevalent but fundamentally incorrect metaphor of the body as a machine designed by an engineer. Bodies are vulnerable to disease - and remarkably resilient - precisely because they are not machines built from a plan. They are, instead, bundles of compromises shaped by natural selection in small increments to maximize reproduction, not health. Understanding the body as a product of natural selection, not design, offers new research questions and a framework for making medical education more coherent. We conclude with recommendations for actions that would better connect evolutionary biology and medicine in ways that will benefit public health. It is our hope that faculty and students will send this article to their undergraduate and medical school Deans, and that this will initiate discussions about the gap, the great opportunity, and action plans to bring the full power of evolutionary biology to bear on human health problems.
Functional vs. Structural Modularity: do they imply each other?
NASA Astrophysics Data System (ADS)
Toroczkai, Zoltan
2009-03-01
While many deterministic and stochastic processes have been proposed to produce heterogeneous graphs mimicking real-world networks, only a handful of studies attempt to connect structure and dynamics with the function(s) performed by the network. In this talk I will present an approach built on the premise that structure, dynamics, and their observed heterogeneity, are implementations of various functions and their compositions. After a brief review of real-world networks where this connection can explicitly be made, I will focus on biological networks. Biological networks are known to possess functionally specialized modules, which perform tasks almost independently of each other. While proposals have been made for the evolutionary emergence of modularity, it is far from clear that adaptation on evolutionary timescales is the sole mechanism leading to functional specialization. We show that non-evolutionary learning can also lead to the formation of functionally specialized modules in a system exposed to multiple environmental constraints. A natural example suggesting that this is possible is the cerebral cortex, where there are clearly delineated functional areas in spite of the largely uniform anatomical construction of the cortical tissue. However, as numerous experiments show, when damaged, regions specialized for a certain function can be retrained to perform functions normally attributed to other regions. We use the paradigm of neural networks to represent a multitasking system, and use several non-evolutionary learning algorithms as mechanisms for phenotypic adaptation. We show that for a network learning to perform multiple tasks, the degree of independence between the tasks dictates the degree of functional specialization emerging in the network. To uncover the functional modules, we introduce a method of node knockouts that explicitly rates the contribution of each node to different tasks (differential robustness). Through a concrete example we also demonstrate the potential inability of purely topology-based clustering methods to detect functional modules. The robustness of these results suggests that similar mechanisms might be responsible for the emergence of functional specialization in other multitasking networks, as well, including social networks.
Genetic diversity, virulence and fitness evolution in an obligate fungal parasite of bees.
Evison, S E F; Foley, K; Jensen, A B; Hughes, W O H
2015-01-01
Within-host competition is predicted to drive the evolution of virulence in parasites, but the precise outcomes of such interactions are often unpredictable due to many factors including the biology of the host and the parasite, stochastic events and co-evolutionary interactions. Here, we use a serial passage experiment (SPE) with three strains of a heterothallic fungal parasite (Ascosphaera apis) of the Honey bee (Apis mellifera) to assess how evolving under increasing competitive pressure affects parasite virulence and fitness evolution. The results show an increase in virulence after successive generations of selection and consequently faster production of spores. This faster sporulation, however, did not translate into more spores being produced during this longer window of sporulation; rather, it appeared to induce a loss of fitness in terms of total spore production. There was no evidence to suggest that a greater diversity of competing strains was a driver of this increased virulence and subsequent fitness cost, but rather that strain-specific competitive interactions influenced the evolutionary outcomes of mixed infections. It is possible that the parasite may have evolved to avoid competition with multiple strains because of its heterothallic mode of reproduction, which highlights the importance of understanding parasite biology when predicting disease dynamics. © 2014 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2014 European Society For Evolutionary Biology.
A Study on Standard Competition with Network Effect Based on Evolutionary Game Model
NASA Astrophysics Data System (ADS)
Wang, Ye; Wang, Bingdong; Li, Kangning
Owing to networks widespread in modern society, standard competition with network effect is now endowed with new connotation. This paper aims to study the impact of network effect on standard competition; it is organized in the mode of "introduction-model setup-equilibrium analysis-conclusion". Starting from a well-structured model of evolutionary game, it is then extended to a dynamic analysis. This article proves both theoretically and empirically that whether or not a standard can lead the market trends depends on the utility it would bring, and the author also discusses some advisable strategies revolving around the two factors of initial position and border break.
Wei, Fangping; Chen, Bowen
2012-03-01
To find out the evolutionary relationships among different tRNA sequences of 21 amino acids, 22 networks are constructed. One is constructed from whole tRNAs, and the other 21 networks are constructed from the tRNAs which carry the same amino acids. A new method is proposed such that the alignment scores of any two amino acids groups are determined by the average degree and the average clustering coefficient of their networks. The anticodon feature of isolated tRNA and the phylogenetic trees of 21 group networks are discussed. We find that some isolated tRNA sequences in 21 networks still connect with other tRNAs outside their group, which reflects the fact that those tRNAs might evolve by intercrossing among these 21 groups. We also find that most anticodons among the same cluster are only one base different in the same sites when S ≥ 70, and they stay in the same rank in the ladder of evolutionary relationships. Those observations seem to agree on that some tRNAs might mutate from the same ancestor sequences based on point mutation mechanisms.
Davies, T Jonathan; Urban, Mark C; Rayfield, Bronwyn; Cadotte, Marc W; Peres-Neto, Pedro R
2016-09-01
Recent studies have supported a link between phylogenetic diversity and various ecological properties including ecosystem function. However, such studies typically assume that phylogenetic branches of equivalent length are more or less interchangeable. Here we suggest that there is a need to consider not only branch lengths but also their placement on the phylogeny. We demonstrate how two common indices of network centrality can be used to describe the evolutionary distinctiveness of network elements (nodes and branches) on a phylogeny. If phylogenetic diversity enhances ecosystem function via complementarity and the representation of functional diversity, we would predict a correlation between evolutionary distinctiveness of network elements and their contribution to ecosystem process. In contrast, if one or a few evolutionary innovations play key roles in ecosystem function, the relationship between evolutionary distinctiveness and functional contribution may be weak or absent. We illustrate how network elements associated with high functional contribution can be identified from regressions between phylogenetic diversity and productivity using a well-known empirical data set on plant productivity from the Cedar Creek Long-Term Ecological Research. We find no association between evolutionary distinctiveness and ecosystem functioning, but we are able to identify phylogenetic elements associated with species of known high functional contribution within the Fabaceae. Our perspective provides a useful guide in the search for ecological traits linking diversity and ecosystem function, and suggests a more nuanced consideration of phylogenetic diversity is required in the conservation and biodiversity-ecosystem-function literature. © 2016 by the Ecological Society of America.
Medical serials control systems by computer--a state of the art review.
Brodman, E; Johnson, M F
1976-01-01
A review of the problems encountered in serials control systems is followed by a description of some of the present-day attempts to solve these problems. Specific networks are described, notably PHILSOM (developed at Washington University School of Medicine Library), the UCLA Biomedical Library's system, and OCLC in Columbus, Ohio. Finally, the role of minicomputers in present and future developments is discussed, and some cautious guesses are made on future directions in the field.
Wu, Kai; Liu, Jing; Wang, Shuai
2016-01-01
Evolutionary games (EG) model a common type of interactions in various complex, networked, natural and social systems. Given such a system with only profit sequences being available, reconstructing the interacting structure of EG networks is fundamental to understand and control its collective dynamics. Existing approaches used to handle this problem, such as the lasso, a convex optimization method, need a user-defined constant to control the tradeoff between the natural sparsity of networks and measurement error (the difference between observed data and simulated data). However, a shortcoming of these approaches is that it is not easy to determine these key parameters which can maximize the performance. In contrast to these approaches, we first model the EG network reconstruction problem as a multiobjective optimization problem (MOP), and then develop a framework which involves multiobjective evolutionary algorithm (MOEA), followed by solution selection based on knee regions, termed as MOEANet, to solve this MOP. We also design an effective initialization operator based on the lasso for MOEA. We apply the proposed method to reconstruct various types of synthetic and real-world networks, and the results show that our approach is effective to avoid the above parameter selecting problem and can reconstruct EG networks with high accuracy. PMID:27886244
NASA Astrophysics Data System (ADS)
Wu, Kai; Liu, Jing; Wang, Shuai
2016-11-01
Evolutionary games (EG) model a common type of interactions in various complex, networked, natural and social systems. Given such a system with only profit sequences being available, reconstructing the interacting structure of EG networks is fundamental to understand and control its collective dynamics. Existing approaches used to handle this problem, such as the lasso, a convex optimization method, need a user-defined constant to control the tradeoff between the natural sparsity of networks and measurement error (the difference between observed data and simulated data). However, a shortcoming of these approaches is that it is not easy to determine these key parameters which can maximize the performance. In contrast to these approaches, we first model the EG network reconstruction problem as a multiobjective optimization problem (MOP), and then develop a framework which involves multiobjective evolutionary algorithm (MOEA), followed by solution selection based on knee regions, termed as MOEANet, to solve this MOP. We also design an effective initialization operator based on the lasso for MOEA. We apply the proposed method to reconstruct various types of synthetic and real-world networks, and the results show that our approach is effective to avoid the above parameter selecting problem and can reconstruct EG networks with high accuracy.
Crossover between structured and well-mixed networks in an evolutionary prisoner's dilemma game
NASA Astrophysics Data System (ADS)
Dai, Qionglin; Cheng, Hongyan; Li, Haihong; Li, Yuting; Zhang, Mei; Yang, Junzhong
2011-07-01
In a spatial evolutionary prisoner’s dilemma game (PDG), individuals interact with their neighbors and update their strategies according to some rules. As is well known, cooperators are destined to become extinct in a well-mixed population, whereas they could emerge and be sustained on a structured network. In this work, we introduce a simple model to investigate the crossover between a structured network and a well-mixed one in an evolutionary PDG. In the model, each link j is designated a rewiring parameter τj, which defines the time interval between two successive rewiring events for link j. By adjusting the rewiring parameter τ (the mean time interval for any link in the network), we could change a structured network into a well-mixed one. For the link rewiring events, three situations are considered: one synchronous situation and two asynchronous situations. Simulation results show that there are three regimes of τ: large τ where the density of cooperators ρc rises to ρc,∞ (the value of ρc for the case without link rewiring), small τ where the mean-field description for a well-mixed network is applicable, and moderate τ where the crossover between a structured network and a well-mixed one happens.
The influence of tie strength on evolutionary games on networks: An empirical investigation
NASA Astrophysics Data System (ADS)
Buesser, Pierre; Peña, Jorge; Pestelacci, Enea; Tomassini, Marco
2011-11-01
Extending previous work on unweighted networks, we present here a systematic numerical investigation of standard evolutionary games on weighted networks. In the absence of any reliable model for generating weighted social networks, we attribute weights to links in a few ways supported by empirical data ranging from totally uncorrelated to weighted bipartite networks. The results of the extensive simulation work on standard complex network models show that, except in a case that does not seem to be common in social networks, taking the tie strength into account does not change in a radical manner the long-run steady-state behavior of the studied games. Besides model networks, we also included a real-life case drawn from a coauthorship network. In this case also, taking the weights into account only changes the results slightly with respect to the raw unweighted graph, although to draw more reliable conclusions on real social networks many more cases should be studied as these weighted networks become available.
2014-01-01
decrease in virus count. This overall behavior of total species count (uninfected cells and viruses of all genotypes) shown in Fig. 1 was qualitatively...respiratory syndrome corona - virus host range expansion in human airway epithelium. J. Virol. 82: 2274 –2285. http://dx.doi.org/10.1128/JVI.02041-07...2008.12.014. 44. Bouvier NM, Lowen AC. 2010. Animal models for influenza virus patho- genesis and transmission. Viruses 2:1530 –1563. http
Network-level architecture and the evolutionary potential of underground metabolism.
Notebaart, Richard A; Szappanos, Balázs; Kintses, Bálint; Pál, Ferenc; Györkei, Ádám; Bogos, Balázs; Lázár, Viktória; Spohn, Réka; Csörgő, Bálint; Wagner, Allon; Ruppin, Eytan; Pál, Csaba; Papp, Balázs
2014-08-12
A central unresolved issue in evolutionary biology is how metabolic innovations emerge. Low-level enzymatic side activities are frequent and can potentially be recruited for new biochemical functions. However, the role of such underground reactions in adaptation toward novel environments has remained largely unknown and out of reach of computational predictions, not least because these issues demand analyses at the level of the entire metabolic network. Here, we provide a comprehensive computational model of the underground metabolism in Escherichia coli. Most underground reactions are not isolated and 45% of them can be fully wired into the existing network and form novel pathways that produce key precursors for cell growth. This observation allowed us to conduct an integrated genome-wide in silico and experimental survey to characterize the evolutionary potential of E. coli to adapt to hundreds of nutrient conditions. We revealed that underground reactions allow growth in new environments when their activity is increased. We estimate that at least ∼20% of the underground reactions that can be connected to the existing network confer a fitness advantage under specific environments. Moreover, our results demonstrate that the genetic basis of evolutionary adaptations via underground metabolism is computationally predictable. The approach used here has potential for various application areas from bioengineering to medical genetics.
Network Analysis of Plasmidomes: The Azospirillum brasilense Sp245 Case
Fondi, Marco
2014-01-01
Azospirillum brasilense is a nitrogen-fixing bacterium living in association with plant roots. The genome of the strain Sp245, isolated in Brazil from wheat roots, consists of one chromosome and six plasmids. In this work, the A. brasilense Sp245 plasmids were analyzed in order to shed some light on the evolutionary pathways they followed over time. To this purpose, a similarity network approach was applied in order to identify the evolutionary relationships among all the A. brasilense plasmids encoded proteins; in this context a computational pipeline specifically devoted to the analysis and the visualization of the network-like evolutionary relationships among different plasmids molecules was developed. This information was supplemented with a detailed (in silico) functional characterization of both the connected (i.e., sharing homology with other sequences in the dataset) and the unconnected (i.e., not sharing homology) components of the network. Furthermore, the most likely source organism for each of the genes encoded by A. brasilense plasmids was checked, allowing the identification of possible trends of gene loss/gain in this microorganism. Data obtained provided a detailed description of the evolutionary landscape of the plasmids of A. brasilense Sp245, suggesting some of the molecular mechanisms responsible for the present-day structure of these molecules. PMID:25610702
Zheng, Xiaoyan; Cai, Danying; Potter, Daniel; Postman, Joseph; Liu, Jing; Teng, Yuanwen
2014-11-01
Reconstructing the phylogeny of Pyrus has been difficult due to the wide distribution of the genus and lack of informative data. In this study, we collected 110 accessions representing 25 Pyrus species and constructed both phylogenetic trees and phylogenetic networks based on multiple DNA sequence datasets. Phylogenetic trees based on both cpDNA and nuclear LFY2int2-N (LN) data resulted in poor resolution, especially, only five primary species were monophyletic in the LN tree. A phylogenetic network of LN suggested that reticulation caused by hybridization is one of the major evolutionary processes for Pyrus species. Polytomies of the gene trees and star-like structure of cpDNA networks suggested rapid radiation is another major evolutionary process, especially for the occidental species. Pyrus calleryana and P. regelii were the earliest diverged Pyrus species. Two North African species, P. cordata, P. spinosa and P. betulaefolia were descendent of primitive stock Pyrus species and still share some common molecular characters. Southwestern China, where a large number of P. pashia populations are found, is probably the most important diversification center of Pyrus. More accessions and nuclear genes are needed for further understanding the evolutionary histories of Pyrus. Copyright © 2014 Elsevier Inc. All rights reserved.
García-Pedrajas, Nicolás; Ortiz-Boyer, Domingo; Hervás-Martínez, César
2006-05-01
In this work we present a new approach to crossover operator in the genetic evolution of neural networks. The most widely used evolutionary computation paradigm for neural network evolution is evolutionary programming. This paradigm is usually preferred due to the problems caused by the application of crossover to neural network evolution. However, crossover is the most innovative operator within the field of evolutionary computation. One of the most notorious problems with the application of crossover to neural networks is known as the permutation problem. This problem occurs due to the fact that the same network can be represented in a genetic coding by many different codifications. Our approach modifies the standard crossover operator taking into account the special features of the individuals to be mated. We present a new model for mating individuals that considers the structure of the hidden layer and redefines the crossover operator. As each hidden node represents a non-linear projection of the input variables, we approach the crossover as a problem on combinatorial optimization. We can formulate the problem as the extraction of a subset of near-optimal projections to create the hidden layer of the new network. This new approach is compared to a classical crossover in 25 real-world problems with an excellent performance. Moreover, the networks obtained are much smaller than those obtained with classical crossover operator.
An Evolutionary Game Theory Model of Spontaneous Brain Functioning.
Madeo, Dario; Talarico, Agostino; Pascual-Leone, Alvaro; Mocenni, Chiara; Santarnecchi, Emiliano
2017-11-22
Our brain is a complex system of interconnected regions spontaneously organized into distinct networks. The integration of information between and within these networks is a continuous process that can be observed even when the brain is at rest, i.e. not engaged in any particular task. Moreover, such spontaneous dynamics show predictive value over individual cognitive profile and constitute a potential marker in neurological and psychiatric conditions, making its understanding of fundamental importance in modern neuroscience. Here we present a theoretical and mathematical model based on an extension of evolutionary game theory on networks (EGN), able to capture brain's interregional dynamics by balancing emulative and non-emulative attitudes among brain regions. This results in the net behavior of nodes composing resting-state networks identified using functional magnetic resonance imaging (fMRI), determining their moment-to-moment level of activation and inhibition as expressed by positive and negative shifts in BOLD fMRI signal. By spontaneously generating low-frequency oscillatory behaviors, the EGN model is able to mimic functional connectivity dynamics, approximate fMRI time series on the basis of initial subset of available data, as well as simulate the impact of network lesions and provide evidence of compensation mechanisms across networks. Results suggest evolutionary game theory on networks as a new potential framework for the understanding of human brain network dynamics.
Begum, Tina; Ghosh, Tapash Chandra
2014-10-05
To date, numerous studies have been attempted to determine the extent of variation in evolutionary rates between human disease and nondisease (ND) genes. In our present study, we have considered human autosomal monogenic (Mendelian) disease genes, which were classified into two groups according to the number of phenotypic defects, that is, specific disease (SPD) gene (one gene: one defect) and shared disease (SHD) gene (one gene: multiple defects). Here, we have compared the evolutionary rates of these two groups of genes, that is, SPD genes and SHD genes with respect to ND genes. We observed that the average evolutionary rates are slow in SHD group, intermediate in SPD group, and fast in ND group. Group-to-group evolutionary rate differences remain statistically significant regardless of their gene expression levels and number of defects. We demonstrated that disease genes are under strong selective constraint if they emerge through edgetic perturbation or drug-induced perturbation of the interactome network, show tissue-restricted expression, and are involved in transmembrane transport. Among all the factors, our regression analyses interestingly suggest the independent effects of 1) drug-induced perturbation and 2) the interaction term of expression breadth and transmembrane transport on protein evolutionary rates. We reasoned that the drug-induced network disruption is a combination of several edgetic perturbations and, thus, has more severe effect on gene phenotypes. © The Author(s) 2014. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.
Medical serials control systems by computer--a state of the art review.
Brodman, E; Johnson, M F
1976-01-01
A review of the problems encountered in serials control systems is followed by a description of some of the present-day attempts to solve these problems. Specific networks are described, notably PHILSOM (developed at Washington University School of Medicine Library), the UCLA Biomedical Library's system, and OCLC in Columbus, Ohio. Finally, the role of minicomputers in present and future developments is discussed, and some cautious guesses are made on future directions in the field. PMID:1247704
Self-organizing network services with evolutionary adaptation.
Nakano, Tadashi; Suda, Tatsuya
2005-09-01
This paper proposes a novel framework for developing adaptive and scalable network services. In the proposed framework, a network service is implemented as a group of autonomous agents that interact in the network environment. Agents in the proposed framework are autonomous and capable of simple behaviors (e.g., replication, migration, and death). In this paper, an evolutionary adaptation mechanism is designed using genetic algorithms (GAs) for agents to evolve their behaviors and improve their fitness values (e.g., response time to a service request) to the environment. The proposed framework is evaluated through simulations, and the simulation results demonstrate the ability of autonomous agents to adapt to the network environment. The proposed framework may be suitable for disseminating network services in dynamic and large-scale networks where a large number of data and services need to be replicated, moved, and deleted in a decentralized manner.
Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees.
Mirzaei, Sajad; Wu, Yufeng
2016-01-01
Hybridization networks represent plausible evolutionary histories of species that are affected by reticulate evolutionary processes. An established computational problem on hybridization networks is constructing the most parsimonious hybridization network such that each of the given phylogenetic trees (called gene trees) is "displayed" in the network. There have been several previous approaches, including an exact method and several heuristics, for this NP-hard problem. However, the exact method is only applicable to a limited range of data, and heuristic methods can be less accurate and also slow sometimes. In this paper, we develop a new algorithm for constructing near parsimonious networks for multiple binary gene trees. This method is more efficient for large numbers of gene trees than previous heuristics. This new method also produces more parsimonious results on many simulated datasets as well as a real biological dataset than a previous method. We also show that our method produces topologically more accurate networks for many datasets.
Supercooperation in evolutionary games on correlated weighted networks.
Buesser, Pierre; Tomassini, Marco
2012-01-01
In this work we study the behavior of classical two-person, two-strategies evolutionary games on a class of weighted networks derived from Barabási-Albert and random scale-free unweighted graphs. Using customary imitative dynamics, our numerical simulation results show that the presence of link weights that are correlated in a particular manner with the degree of the link end points leads to unprecedented levels of cooperation in the whole games' phase space, well above those found for the corresponding unweighted complex networks. We provide intuitive explanations for this favorable behavior by transforming the weighted networks into unweighted ones with particular topological properties. The resulting structures help us to understand why cooperation can thrive and also give ideas as to how such supercooperative networks might be built.
Computational architecture of the yeast regulatory network
NASA Astrophysics Data System (ADS)
Maslov, Sergei; Sneppen, Kim
2005-12-01
The topology of regulatory networks contains clues to their overall design principles and evolutionary history. We find that while in- and out-degrees of a given protein in the regulatory network are not correlated with each other, there exists a strong negative correlation between the out-degree of a regulatory protein and in-degrees of its targets. Such correlation positions large regulatory modules on the periphery of the network and makes them rather well separated from each other. We also address the question of relative importance of different classes of proteins quantified by the lethality of null-mutants lacking one of them as well as by the level of their evolutionary conservation. It was found that in the yeast regulatory network highly connected proteins are in fact less important than their low-connected counterparts.
The evolutionary advantage of limited network knowledge.
Larson, Jennifer M
2016-06-07
Groups of individuals have social networks that structure interactions within the groups; evolutionary theory increasingly uses this fact to explain the emergence of cooperation (Eshel and Cavalli-Sforza, 1982; Boyd and Richerson, 1988, 1989; Ohtsuki et al., 2006; Nowak et al., 2010; Van Veelen et al., 2012). This approach has resulted in a number of important insights for the evolution of cooperation in the biological and social sciences, but omits a key function of social networks that has persisted throughout recent evolutionary history (Apicella et al., 2012): their role in transmitting gossip about behavior within a group. Accounting for this well-established role of social networks among rational agents in a setting of indirect reciprocity not only shows a new mechanism by which the structure of networks is fitness-relevant, but also reveals that knowledge of social networks can be fitness-relevant as well. When groups enforce cooperation by sanctioning peers whom gossip reveals to have deviated, individuals in certain peripheral network positions are tempting targets of uncooperative behavior because gossip they share about misbehavior spreads slowly through the network. The ability to identify these individuals creates incentives to behave uncooperatively. Consequently, groups comprised of individuals who knew precise information about their social networks would be at a fitness disadvantage relative to groups of individuals with a coarser knowledge of their networks. Empirical work has consistently shown that modern humans know little about the structure of their own social networks and perform poorly when tasked with learning new ones. This robust empirical regularity may be the product of natural selection in an environment of strong selective pressure at the group level. Imprecise views of networks make enforcing cooperation easier. Copyright © 2016 Elsevier Ltd. All rights reserved.
Evolutionary dynamics of group interactions on structured populations: a review
Perc, Matjaž; Gómez-Gardeñes, Jesús; Szolnoki, Attila; Floría, Luis M.; Moreno, Yamir
2013-01-01
Interactions among living organisms, from bacteria colonies to human societies, are inherently more complex than interactions among particles and non-living matter. Group interactions are a particularly important and widespread class, representative of which is the public goods game. In addition, methods of statistical physics have proved valuable for studying pattern formation, equilibrium selection and self-organization in evolutionary games. Here, we review recent advances in the study of evolutionary dynamics of group interactions on top of structured populations, including lattices, complex networks and coevolutionary models. We also compare these results with those obtained on well-mixed populations. The review particularly highlights that the study of the dynamics of group interactions, like several other important equilibrium and non-equilibrium dynamical processes in biological, economical and social sciences, benefits from the synergy between statistical physics, network science and evolutionary game theory. PMID:23303223
Effects of topology on network evolution
NASA Astrophysics Data System (ADS)
Oikonomou, Panos; Cluzel, Philippe
2006-08-01
The ubiquity of scale-free topology in nature raises the question of whether this particular network design confers an evolutionary advantage. A series of studies has identified key principles controlling the growth and the dynamics of scale-free networks. Here, we use neuron-based networks of boolean components as a framework for modelling a large class of dynamical behaviours in both natural and artificial systems. Applying a training algorithm, we characterize how networks with distinct topologies evolve towards a pre-established target function through a process of random mutations and selection. We find that homogeneous random networks and scale-free networks exhibit drastically different evolutionary paths. Whereas homogeneous random networks accumulate neutral mutations and evolve by sparse punctuated steps, scale-free networks evolve rapidly and continuously. Remarkably, this latter property is robust to variations of the degree exponent. In contrast, homogeneous random networks require a specific tuning of their connectivity to optimize their ability to evolve. These results highlight an organizing principle that governs the evolution of complex networks and that can improve the design of engineered systems.
Collective influence in evolutionary social dilemmas
NASA Astrophysics Data System (ADS)
Szolnoki, Attila; Perc, Matjaž
2016-03-01
When evolutionary games are contested in structured populations, the degree of each player in the network plays an important role. If they exist, hubs often determine the fate of the population in remarkable ways. Recent research based on optimal percolation in random networks has shown, however, that the degree is neither the sole nor the best predictor of influence in complex networks. Low-degree nodes may also be optimal influencers if they are hierarchically linked to hubs. Taking this into account leads to the formalism of collective influence in complex networks, which as we show here, has far-reaching implications for the favorable resolution of social dilemmas. In particular, there exists an optimal hierarchical depth for the determination of collective influence that we use to describe the potency of players for passing their strategies, which depends on the strength of the social dilemma. Interestingly, the degree, which corresponds to the baseline depth zero, is optimal only when the temptation to defect is small. Our research reveals that evolutionary success stories are related to spreading processes which are rooted in favorable hierarchical structures that extend beyond local neighborhoods.
The co-evolutionary dynamics of directed network of spin market agents
NASA Astrophysics Data System (ADS)
Horváth, Denis; Kuscsik, Zoltán; Gmitra, Martin
2006-09-01
The spin market model [S. Bornholdt, Int. J. Mod. Phys. C 12 (2001) 667] is generalized by employing co-evolutionary principles, where strategies of the interacting and competitive traders are represented by local and global couplings between the nodes of dynamic directed stochastic network. The co-evolutionary principles are applied in the frame of Bak-Sneppen self-organized dynamics [P. Bak, K. Sneppen, Phys. Rev. Lett. 71 (1993) 4083] that includes the processes of selection and extinction actuated by the local (node) fitness. The local fitness is related to orientation of spin agent with respect to the instant magnetization. The stationary regime is formed due to the interplay of self-organization and adaptivity effects. The fat tailed distributions of log-price returns are identified numerically. The non-trivial model consequence is the evidence of the long time market memory indicated by the power-law range of the autocorrelation function of volatility with exponent smaller than one. The simulations yield network topology with broad-scale node degree distribution characterized by the range of exponents 1.3<γin<3 coinciding with social networks.
Toward Optimal Transport Networks
NASA Technical Reports Server (NTRS)
Alexandrov, Natalia; Kincaid, Rex K.; Vargo, Erik P.
2008-01-01
Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.
Impact of auditory selective attention on verbal short-term memory and vocabulary development.
Majerus, Steve; Heiligenstein, Lucie; Gautherot, Nathalie; Poncelet, Martine; Van der Linden, Martial
2009-05-01
This study investigated the role of auditory selective attention capacities as a possible mediator of the well-established association between verbal short-term memory (STM) and vocabulary development. A total of 47 6- and 7-year-olds were administered verbal immediate serial recall and auditory attention tasks. Both task types probed processing of item and serial order information because recent studies have shown this distinction to be critical when exploring relations between STM and lexical development. Multiple regression and variance partitioning analyses highlighted two variables as determinants of vocabulary development: (a) a serial order processing variable shared by STM order recall and a selective attention task for sequence information and (b) an attentional variable shared by selective attention measures targeting item or sequence information. The current study highlights the need for integrative STM models, accounting for conjoined influences of attentional capacities and serial order processing capacities on STM performance and the establishment of the lexical language network.
Constraints imposed by pollinator behaviour on the ecology and evolution of plant mating systems.
Devaux, C; Lepers, C; Porcher, E
2014-07-01
Most flowering plants rely on pollinators for their reproduction. Plant-pollinator interactions, although mutualistic, involve an inherent conflict of interest between both partners and may constrain plant mating systems at multiple levels: the immediate ecological plant selfing rates, their distribution in and contribution to pollination networks, and their evolution. Here, we review experimental evidence that pollinator behaviour influences plant selfing rates in pairs of interacting species, and that plants can modify pollinator behaviour through plastic and evolutionary changes in floral traits. We also examine how theoretical studies include pollinators, implicitly or explicitly, to investigate the role of their foraging behaviour in plant mating system evolution. In doing so, we call for more evolutionary models combining ecological and genetic factors, and additional experimental data, particularly to describe pollinator foraging behaviour. Finally, we show that recent developments in ecological network theory help clarify the impact of community-level interactions on plant selfing rates and their evolution and suggest new research avenues to expand the study of mating systems of animal-pollinated plant species to the level of the plant-pollinator networks. © 2014 The Authors. Journal of Evolutionary Biology © 2014 European Society For Evolutionary Biology.
Local Nash equilibrium in social networks.
Zhang, Yichao; Aziz-Alaoui, M A; Bertelle, Cyrille; Guan, Jihong
2014-08-29
Nash equilibrium is widely present in various social disputes. As of now, in structured static populations, such as social networks, regular, and random graphs, the discussions on Nash equilibrium are quite limited. In a relatively stable static gaming network, a rational individual has to comprehensively consider all his/her opponents' strategies before they adopt a unified strategy. In this scenario, a new strategy equilibrium emerges in the system. We define this equilibrium as a local Nash equilibrium. In this paper, we present an explicit definition of the local Nash equilibrium for the two-strategy games in structured populations. Based on the definition, we investigate the condition that a system reaches the evolutionary stable state when the individuals play the Prisoner's dilemma and snow-drift game. The local Nash equilibrium provides a way to judge whether a gaming structured population reaches the evolutionary stable state on one hand. On the other hand, it can be used to predict whether cooperators can survive in a system long before the system reaches its evolutionary stable state for the Prisoner's dilemma game. Our work therefore provides a theoretical framework for understanding the evolutionary stable state in the gaming populations with static structures.
Local Nash Equilibrium in Social Networks
Zhang, Yichao; Aziz-Alaoui, M. A.; Bertelle, Cyrille; Guan, Jihong
2014-01-01
Nash equilibrium is widely present in various social disputes. As of now, in structured static populations, such as social networks, regular, and random graphs, the discussions on Nash equilibrium are quite limited. In a relatively stable static gaming network, a rational individual has to comprehensively consider all his/her opponents' strategies before they adopt a unified strategy. In this scenario, a new strategy equilibrium emerges in the system. We define this equilibrium as a local Nash equilibrium. In this paper, we present an explicit definition of the local Nash equilibrium for the two-strategy games in structured populations. Based on the definition, we investigate the condition that a system reaches the evolutionary stable state when the individuals play the Prisoner's dilemma and snow-drift game. The local Nash equilibrium provides a way to judge whether a gaming structured population reaches the evolutionary stable state on one hand. On the other hand, it can be used to predict whether cooperators can survive in a system long before the system reaches its evolutionary stable state for the Prisoner's dilemma game. Our work therefore provides a theoretical framework for understanding the evolutionary stable state in the gaming populations with static structures. PMID:25169150
Local Nash Equilibrium in Social Networks
NASA Astrophysics Data System (ADS)
Zhang, Yichao; Aziz-Alaoui, M. A.; Bertelle, Cyrille; Guan, Jihong
2014-08-01
Nash equilibrium is widely present in various social disputes. As of now, in structured static populations, such as social networks, regular, and random graphs, the discussions on Nash equilibrium are quite limited. In a relatively stable static gaming network, a rational individual has to comprehensively consider all his/her opponents' strategies before they adopt a unified strategy. In this scenario, a new strategy equilibrium emerges in the system. We define this equilibrium as a local Nash equilibrium. In this paper, we present an explicit definition of the local Nash equilibrium for the two-strategy games in structured populations. Based on the definition, we investigate the condition that a system reaches the evolutionary stable state when the individuals play the Prisoner's dilemma and snow-drift game. The local Nash equilibrium provides a way to judge whether a gaming structured population reaches the evolutionary stable state on one hand. On the other hand, it can be used to predict whether cooperators can survive in a system long before the system reaches its evolutionary stable state for the Prisoner's dilemma game. Our work therefore provides a theoretical framework for understanding the evolutionary stable state in the gaming populations with static structures.
Deciphering the Interdependence between Ecological and Evolutionary Networks.
Melián, Carlos J; Matthews, Blake; de Andreazzi, Cecilia S; Rodríguez, Jorge P; Harmon, Luke J; Fortuna, Miguel A
2018-05-24
Biological systems consist of elements that interact within and across hierarchical levels. For example, interactions among genes determine traits of individuals, competitive and cooperative interactions among individuals influence population dynamics, and interactions among species affect the dynamics of communities and ecosystem processes. Such systems can be represented as hierarchical networks, but can have complex dynamics when interdependencies among levels of the hierarchy occur. We propose integrating ecological and evolutionary processes in hierarchical networks to explore interdependencies in biological systems. We connect gene networks underlying predator-prey trait distributions to food webs. Our approach addresses longstanding questions about how complex traits and intraspecific trait variation affect the interdependencies among biological levels and the stability of meta-ecosystems. Copyright © 2018 Elsevier Ltd. All rights reserved.
How altruism works: An evolutionary model of supply networks
NASA Astrophysics Data System (ADS)
Ge, Zehui; Zhang, Zi-Ke; Lü, Linyuan; Zhou, Tao; Xi, Ning
2012-02-01
Recently, supply networks have attracted increasing attention from the scientific community. However, it lacks serious consideration of social preference in Supply Chain Management. In this paper, we develop an evolutionary decision-making model to characterize the effects of suppliers' altruism in supply networks, and find that the performances of both suppliers and supply chains are improved by introducing the role of altruism. Furthermore, an interesting and reasonable phenomenon is discovered that the suppliers' and whole network's profits do not change monotonously with suppliers' altruistic preference, η, but reach the best at η=0.6 and η=0.4, respectively. This work may shed some light on the in-depth understanding of the effects of altruism for both research and commercial applications.
Wang, Hsinkai; Yang, Ya-Tang
2017-09-15
The current standard protocols for characterizing the optogenetic circuit of bacterial cells using flow cytometry in light tubes and light exposure of culture plates are tedious, labor-intensive, and cumbersome. In this work, we engineer a bioreactor with working volume of ∼10 mL for in vivo real-time optogenetic characterization of E. coli with a CcaS-CcaR light-sensing system. In the bioreactor, optical density measurements, reporter protein fluorescence detection, and light input stimuli are provided by four light-emitting diode sources and two photodetectors. Once calibrated, the device can cultivate microbial cells and record their growth and gene expression without human intervention. We measure gene expression during cell growth with different organic substrates (glucose, succinate, acetate, pyruvate) as carbon sources in minimal medium and demonstrate evolutionary tuning of the optogenetic circuit by serial dilution passages.
ERIC Educational Resources Information Center
Hitch, Graham J.; Flude, Brenda; Burgess, Neil
2009-01-01
Three experiments tested predictions of a neural network model of phonological short-term memory that assumes separate representations for order and item information, order being coded via a context-timing signal [Burgess, N., & Hitch, G. J. (1999). Memory for serial order: A network model of the phonological loop and its timing. "Psychological…
D’Esposito, Mark
2017-01-01
Recent work has established that visual working memory is subject to serial dependence: current information in memory blends with that from the recent past as a function of their similarity. This tuned temporal smoothing likely promotes the stability of memory in the face of noise and occlusion. Serial dependence accumulates over several seconds in memory and deteriorates with increased separation between trials. While this phenomenon has been extensively characterized in behavior, its neural mechanism is unknown. In the present study, we investigate the circuit-level origins of serial dependence in a biophysical model of cortex. We explore two distinct kinds of mechanisms: stable persistent activity during the memory delay period and dynamic “activity-silent” synaptic plasticity. We find that networks endowed with both strong reverberation to support persistent activity and dynamic synapses can closely reproduce behavioral serial dependence. Specifically, elevated activity drives synaptic augmentation, which biases activity on the subsequent trial, giving rise to a spatiotemporally tuned shift in the population response. Our hybrid neural model is a theoretical advance beyond abstract mathematical characterizations, offers testable hypotheses for physiological research, and demonstrates the power of biological insights to provide a quantitative explanation of human behavior. PMID:29244810
Evolutionary trends and functional anatomy of the human expanded autophagy network
Till, Andreas; Saito, Rintaro; Merkurjev, Daria; Liu, Jing-Jing; Syed, Gulam Hussain; Kolnik, Martin; Siddiqui, Aleem; Glas, Martin; Scheffler, Björn; Ideker, Trey; Subramani, Suresh
2015-01-01
All eukaryotic cells utilize autophagy for protein and organelle turnover, thus assuring subcellular quality control, homeostasis, and survival. In order to address recent advances in identification of human autophagy associated genes, and to describe autophagy on a system-wide level, we established an autophagy-centered gene interaction network by merging various primary data sets and by retrieving respective interaction data. The resulting network (‘AXAN’) was analyzed with respect to subnetworks, e.g. the prime gene subnetwork (including the core machinery, signaling pathways and autophagy receptors) and the transcription subnetwork. To describe aspects of evolution within this network, we assessed the presence of protein orthologs across 99 eukaryotic model organisms. We visualized evolutionary trends for prime gene categories and evolutionary tracks for selected AXAN genes. This analysis confirms the eukaryotic origin of autophagy core genes while it points to a diverse evolutionary history of autophagy receptors. Next, we used module identification to describe the functional anatomy of the network at the level of pathway modules. In addition to obvious pathways (e.g., lysosomal degradation, insulin signaling) our data unveil the existence of context-related modules such as Rho GTPase signaling. Last, we used a tripartite, image-based RNAi – screen to test candidate genes predicted to play a role in regulation of autophagy. We verified the Rho GTPase, CDC42, as a novel regulator of autophagy-related signaling. This study emphasizes the applicability of system-wide approaches to gain novel insights into a complex biological process and to describe the human autophagy pathway at a hitherto unprecedented level of detail. PMID:26103419
Sotiras, Aristeidis; Toledo, Jon B; Gur, Raquel E; Gur, Ruben C; Satterthwaite, Theodore D; Davatzikos, Christos
2017-03-28
During adolescence, the human cortex undergoes substantial remodeling to support a rapid expansion of behavioral repertoire. Accurately quantifying these changes is a prerequisite for understanding normal brain development, as well as the neuropsychiatric disorders that emerge in this vulnerable period. Past accounts have demonstrated substantial regional heterogeneity in patterns of brain development, but frequently have been limited by small samples and analytics that do not evaluate complex multivariate imaging patterns. Capitalizing on recent advances in multivariate analysis methods, we used nonnegative matrix factorization (NMF) to uncover coordinated patterns of cortical development in a sample of 934 youths ages 8-20, who completed structural neuroimaging as part of the Philadelphia Neurodevelopmental Cohort. Patterns of structural covariance (PSCs) derived by NMF were highly reproducible over a range of resolutions, and differed markedly from common gyral-based structural atlases. Moreover, PSCs were largely symmetric and showed correspondence to specific large-scale functional networks. The level of correspondence was ordered according to their functional role and position in the evolutionary hierarchy, being high in lower-order visual and somatomotor networks and diminishing in higher-order association cortex. Furthermore, PSCs showed divergent developmental associations, with PSCs in higher-order association cortex networks showing greater changes with age than primary somatomotor and visual networks. Critically, such developmental changes within PSCs were significantly associated with the degree of evolutionary cortical expansion. Together, our findings delineate a set of structural brain networks that undergo coordinated cortical thinning during adolescence, which is in part governed by evolutionary novelty and functional specialization.
Multi-Objective Community Detection Based on Memetic Algorithm
2015-01-01
Community detection has drawn a lot of attention as it can provide invaluable help in understanding the function and visualizing the structure of networks. Since single objective optimization methods have intrinsic drawbacks to identifying multiple significant community structures, some methods formulate the community detection as multi-objective problems and adopt population-based evolutionary algorithms to obtain multiple community structures. Evolutionary algorithms have strong global search ability, but have difficulty in locating local optima efficiently. In this study, in order to identify multiple significant community structures more effectively, a multi-objective memetic algorithm for community detection is proposed by combining multi-objective evolutionary algorithm with a local search procedure. The local search procedure is designed by addressing three issues. Firstly, nondominated solutions generated by evolutionary operations and solutions in dominant population are set as initial individuals for local search procedure. Then, a new direction vector named as pseudonormal vector is proposed to integrate two objective functions together to form a fitness function. Finally, a network specific local search strategy based on label propagation rule is expanded to search the local optimal solutions efficiently. The extensive experiments on both artificial and real-world networks evaluate the proposed method from three aspects. Firstly, experiments on influence of local search procedure demonstrate that the local search procedure can speed up the convergence to better partitions and make the algorithm more stable. Secondly, comparisons with a set of classic community detection methods illustrate the proposed method can find single partitions effectively. Finally, the method is applied to identify hierarchical structures of networks which are beneficial for analyzing networks in multi-resolution levels. PMID:25932646
Multi-objective community detection based on memetic algorithm.
Wu, Peng; Pan, Li
2015-01-01
Community detection has drawn a lot of attention as it can provide invaluable help in understanding the function and visualizing the structure of networks. Since single objective optimization methods have intrinsic drawbacks to identifying multiple significant community structures, some methods formulate the community detection as multi-objective problems and adopt population-based evolutionary algorithms to obtain multiple community structures. Evolutionary algorithms have strong global search ability, but have difficulty in locating local optima efficiently. In this study, in order to identify multiple significant community structures more effectively, a multi-objective memetic algorithm for community detection is proposed by combining multi-objective evolutionary algorithm with a local search procedure. The local search procedure is designed by addressing three issues. Firstly, nondominated solutions generated by evolutionary operations and solutions in dominant population are set as initial individuals for local search procedure. Then, a new direction vector named as pseudonormal vector is proposed to integrate two objective functions together to form a fitness function. Finally, a network specific local search strategy based on label propagation rule is expanded to search the local optimal solutions efficiently. The extensive experiments on both artificial and real-world networks evaluate the proposed method from three aspects. Firstly, experiments on influence of local search procedure demonstrate that the local search procedure can speed up the convergence to better partitions and make the algorithm more stable. Secondly, comparisons with a set of classic community detection methods illustrate the proposed method can find single partitions effectively. Finally, the method is applied to identify hierarchical structures of networks which are beneficial for analyzing networks in multi-resolution levels.
A program to compute the soft Robinson-Foulds distance between phylogenetic networks.
Lu, Bingxin; Zhang, Louxin; Leong, Hon Wai
2017-03-14
Over the past two decades, phylogenetic networks have been studied to model reticulate evolutionary events. The relationships among phylogenetic networks, phylogenetic trees and clusters serve as the basis for reconstruction and comparison of phylogenetic networks. To understand these relationships, two problems are raised: the tree containment problem, which asks whether a phylogenetic tree is displayed in a phylogenetic network, and the cluster containment problem, which asks whether a cluster is represented at a node in a phylogenetic network. Both the problems are NP-complete. A fast exponential-time algorithm for the cluster containment problem on arbitrary networks is developed and implemented in C. The resulting program is further extended into a computer program for fast computation of the Soft Robinson-Foulds distance between phylogenetic networks. Two computer programs are developed for facilitating reconstruction and validation of phylogenetic network models in evolutionary and comparative genomics. Our simulation tests indicated that they are fast enough for use in practice. Additionally, the distribution of the Soft Robinson-Foulds distance between phylogenetic networks is demonstrated to be unlikely normal by our simulation data.
Constructing Robust Cooperative Networks using a Multi-Objective Evolutionary Algorithm
Wang, Shuai; Liu, Jing
2017-01-01
The design and construction of network structures oriented towards different applications has attracted much attention recently. The existing studies indicated that structural heterogeneity plays different roles in promoting cooperation and robustness. Compared with rewiring a predefined network, it is more flexible and practical to construct new networks that satisfy the desired properties. Therefore, in this paper, we study a method for constructing robust cooperative networks where the only constraint is that the number of nodes and links is predefined. We model this network construction problem as a multi-objective optimization problem and propose a multi-objective evolutionary algorithm, named MOEA-Netrc, to generate the desired networks from arbitrary initializations. The performance of MOEA-Netrc is validated on several synthetic and real-world networks. The results show that MOEA-Netrc can construct balanced candidates and is insensitive to the initializations. MOEA-Netrc can find the Pareto fronts for networks with different levels of cooperation and robustness. In addition, further investigation of the robustness of the constructed networks revealed the impact on other aspects of robustness during the construction process. PMID:28134314
Evolutionary rewiring of bacterial regulatory networks
Taylor, Tiffany B.; Mulley, Geraldine; McGuffin, Liam J.; Johnson, Louise J.; Brockhurst, Michael A.; Arseneault, Tanya; Silby, Mark W.; Jackson, Robert W.
2015-01-01
Bacteria have evolved complex regulatory networks that enable integration of multiple intracellular and extracellular signals to coordinate responses to environmental changes. However, our knowledge of how regulatory systems function and evolve is still relatively limited. There is often extensive homology between components of different networks, due to past cycles of gene duplication, divergence, and horizontal gene transfer, raising the possibility of cross-talk or redundancy. Consequently, evolutionary resilience is built into gene networks - homology between regulators can potentially allow rapid rescue of lost regulatory function across distant regions of the genome. In our recent study [Taylor, et al. Science (2015), 347(6225)] we find that mutations that facilitate cross-talk between pathways can contribute to gene network evolution, but that such mutations come with severe pleiotropic costs. Arising from this work are a number of questions surrounding how this phenomenon occurs. PMID:28357301
Multi-stained whole slide image alignment in digital pathology
NASA Astrophysics Data System (ADS)
Déniz, Oscar; Toomey, David; Conway, Catherine; Bueno, Gloria
2015-03-01
In Digital Pathology, one of the most simple and yet most useful feature is the ability to view serial sections of tissue simultaneously on a computer monitor. This enables the pathologist to evaluate the histology and expression of multiple markers for a patient in a single review. However, the rate limiting step in this process is the time taken for the pathologist to open each individual image, align the sections within the viewer, with a maximum of four slides at a time, and then manually move around the section. In addition, due to tissue processing and pre-analytical steps, sections with different stains have non-linear variations between the two acquisitions, that is, they will stretch and change shape from section to section. To date, no solution has come close to a workable solution to automatically align the serial sections into one composite image. This research work address this problem to obtain an automated serial section alignment tool enabling the pathologists to simply scroll through the various sections in a single viewer. To this aim a multi-resolution intensity-based registration method using mutual information as a similarity metric, an optimizer based on an evolutionary process and a bilinear transformation has been used. To characterize the performance of the algorithm 40 cases x 5 different serial sections stained with hematoxiline-eosine (HE), estrogen receptor (ER), progesterone receptor (PR), Ki67 and human epidermal growth factor receptor 2 (Her2), have been considered. The qualitative results obtained are promising, with average computation time of 26.4s for up to 14660x5799 images running interpreted code.
MOCASSIN-prot: A multi-objective clustering approach for protein similarity networks
USDA-ARS?s Scientific Manuscript database
Motivation: Proteins often include multiple conserved domains. Various evolutionary events including duplication and loss of domains, domain shuffling, as well as sequence divergence contribute to generating complexities in protein structures, and consequently, in their functions. The evolutionary h...
DOE Office of Scientific and Technical Information (OSTI.GOV)
Busbey, A.B.
A number of methods and products, both hardware and software, to allow data exchange between Apple Macintosh computers and MS-DOS based systems. These included serial null modem connections, MS-DOS hardware and/or software emulation, MS-DOS disk-reading hardware and networking.
NASA Astrophysics Data System (ADS)
Fu, Yu-Hsiang; Huang, Chung-Yuan; Sun, Chuen-Tsai
2016-11-01
Using network community structures to identify multiple influential spreaders is an appropriate method for analyzing the dissemination of information, ideas and infectious diseases. For example, data on spreaders selected from groups of customers who make similar purchases may be used to advertise products and to optimize limited resource allocation. Other examples include community detection approaches aimed at identifying structures and groups in social or complex networks. However, determining the number of communities in a network remains a challenge. In this paper we describe our proposal for a two-phase evolutionary framework (TPEF) for determining community numbers and maximizing community modularity. Lancichinetti-Fortunato-Radicchi benchmark networks were used to test our proposed method and to analyze execution time, community structure quality, convergence, and the network spreading effect. Results indicate that our proposed TPEF generates satisfactory levels of community quality and convergence. They also suggest a need for an index, mechanism or sampling technique to determine whether a community detection approach should be used for selecting multiple network spreaders.
Evolutionary transitions in controls reconcile adaptation with continuity of evolution.
Badyaev, Alexander V
2018-05-19
Evolution proceeds by accumulating functional solutions, necessarily forming an uninterrupted lineage from past solutions of ancestors to the current design of extant forms. At the population level, this process requires an organismal architecture in which the maintenance of local adaptation does not preclude the ability to innovate in the same traits and their continuous evolution. Representing complex traits as networks enables us to visualize a fundamental principle that resolves tension between adaptation and continuous evolution: phenotypic states encompassing adaptations traverse the continuous multi-layered landscape of past physical, developmental and functional associations among traits. The key concept that captures such traversing is network controllability - the ability to move a network from one state into another while maintaining its functionality (reflecting evolvability) and to efficiently propagate information or products through the network within a phenotypic state (maintaining its robustness). Here I suggest that transitions in network controllability - specifically in the topology of controls - help to explain how robustness and evolvability are balanced during evolution. I will focus on evolutionary transitions in degeneracy of metabolic networks - a ubiquitous property of phenotypic robustness where distinct pathways achieve the same end product - to suggest that associated changes in network controls is a common rule underlying phenomena as distinct as phenotypic plasticity, organismal accommodation of novelties, genetic assimilation, and macroevolutionary diversification. Capitalizing on well understood principles by which network structure translates into function of control nodes, I show that accumulating redundancy in one type of network controls inevitably leads to the emergence of another type of controls, forming evolutionary cycles of network controllability that, ultimately, reconcile local adaptation with continuity of evolution. Copyright © 2018 Elsevier Ltd. All rights reserved.
The molecular biology and evolution of feline immunodeficiency viruses of cougars
Poss, Mary; Ross, Howard; Rodrigo, Allen; Terwee, Julie; VandeWoude, Sue; Biek, Roman
2008-01-01
Feline immunodeficiency virus (FIV) is a lentivirus that has been identified in many members of the family Felidae but domestic cats are the only FIV host in which infection results in disease. We studied FIVpco infection of cougars (Puma concolor) as a model for asymptomatic lentivirus infections to understand the mechanisms of host-virus coexistence. Several natural cougar populations were evaluated to determine if there are any consequences of FIVpco infection on cougar fecundity, survival, or susceptibility to other infections. We have sequenced full length viral genomes and conducted a detailed analysis of viral molecular evolution on these sequences and on genome fragments of serially sampled animals to determine the evolutionary forces experienced by this virus in cougars. In addition, we have evaluated the molecular genetics of FIVpco in a new host, domestic cats, to determine the evolutionary consequences to a host-adapted virus associated with cross-species infection. Our results indicate that there are no significant differences in survival, fecundity or susceptibility to other infections between FIVpco-infected and uninfected cougars. The molecular evolution of FIVpco is characterized by a slower evolutionary rate and an absence of positive selection, but also by proviral and plasma viral loads comparable to those of epidemic lentiviruses such as HIV-1 or FIVfca. Evolutionary and recombination rates and selection profiles change significantly when FIVpco replicates in a new host. PMID:18295904
Di Poi, Carole; Bélanger, Dominic; Amyot, Marc; Rogers, Sean; Aubin-Horth, Nadia
2016-07-01
The molecular mechanisms underlying behavioural evolution following colonization of novel environments are largely unknown. Molecules that interact to control equilibrium within an organism form physiological regulatory networks. It is essential to determine whether particular components of physiological regulatory networks evolve or if the network as a whole is affected in populations diverging in behavioural responses, as this may affect the nature, amplitude and number of impacted traits. We studied the regulation of four physiological regulatory networks in freshwater and marine populations of threespine stickleback raised in a common environment, which were previously characterized as showing evolutionary divergence in behaviour and stress reactivity. We measured nineteen components of these networks (ligands and receptors) using mRNA and monoamine levels in the brain, pituitary and interrenal gland, as well as hormone levels. Freshwater fish showed higher expression in the brain of adrenergic (adrb2a), serotonergic (htr2a) and dopaminergic (DRD2) receptors, but lower expression of the htr2b receptor. Freshwater fish also showed higher expression of the mc2r receptor of the glucocorticoid axis in the interrenals. Collectively, our results suggest that the inheritance of the regulation of these networks may be implicated in the evolution of behaviour and stress reactivity in association with population divergence. Our results also suggest that evolutionary change in freshwater threespine stickleback may be more associated with the expression of specific receptors rather than with global changes of all the measured constituents of the physiological regulatory networks. © 2016 John Wiley & Sons Ltd.
Proteus: a reconfigurable computational network for computer vision
NASA Astrophysics Data System (ADS)
Haralick, Robert M.; Somani, Arun K.; Wittenbrink, Craig M.; Johnson, Robert; Cooper, Kenneth; Shapiro, Linda G.; Phillips, Ihsin T.; Hwang, Jenq N.; Cheung, William; Yao, Yung H.; Chen, Chung-Ho; Yang, Larry; Daugherty, Brian; Lorbeski, Bob; Loving, Kent; Miller, Tom; Parkins, Larye; Soos, Steven L.
1992-04-01
The Proteus architecture is a highly parallel MIMD, multiple instruction, multiple-data machine, optimized for large granularity tasks such as machine vision and image processing The system can achieve 20 Giga-flops (80 Giga-flops peak). It accepts data via multiple serial links at a rate of up to 640 megabytes/second. The system employs a hierarchical reconfigurable interconnection network with the highest level being a circuit switched Enhanced Hypercube serial interconnection network for internal data transfers. The system is designed to use 256 to 1,024 RISC processors. The processors use one megabyte external Read/Write Allocating Caches for reduced multiprocessor contention. The system detects, locates, and replaces faulty subsystems using redundant hardware to facilitate fault tolerance. The parallelism is directly controllable through an advanced software system for partitioning, scheduling, and development. System software includes a translator for the INSIGHT language, a parallel debugger, low and high level simulators, and a message passing system for all control needs. Image processing application software includes a variety of point operators neighborhood, operators, convolution, and the mathematical morphology operations of binary and gray scale dilation, erosion, opening, and closing.
Serial and parallel power equipment with high-temperature superconducting elements
NASA Technical Reports Server (NTRS)
Bencze, Laszlo; Goebl, Nandor; Palotas, Bela; Vajda, Istvan
1995-01-01
One of the prospective, practical applications of high-temperature superconductors is the fault-current limitation in electrical energy networks. The development and testing of experimental HTSC serial current limiters have been reported in the literature. A Hungarian electric power company has proposed the development of a parallel equipment for arc suppressing both in the industrial and customers' networks. On the basis of the company's proposal the authors have outlined the scheme of a compound circuit that can be applied both for current limitation and arc suppressing. In this paper the design principles and methods of the shunt equipment are presented. These principles involve the electrical, mechanical and cryogenic aspects with the special view on the electrical and mechanical connection between the HTSC material and the current lead. Preliminary experiments and tests have been carried out to demonstrate the validity of the design principles developed. The results of the experiments and of the technological investigations are presented.
Impact of deterministic and stochastic updates on network reciprocity in the prisoner's dilemma game
NASA Astrophysics Data System (ADS)
Tanimoto, Jun
2014-08-01
In 2 × 2 prisoner's dilemma games, network reciprocity is one mechanism for adding social viscosity, which leads to cooperative equilibrium. This study introduced an intriguing framework for the strategy update rule that allows any combination of a purely deterministic method, imitation max (IM), and a purely probabilistic one, pairwise Fermi (Fermi-PW). A series of simulations covering the whole range from IM to Fermi-PW reveals that, as a general tendency, the larger fractions of stochastic updating reduce network reciprocity, so long as the underlying lattice contains no noise in the degree of distribution. However, a small amount of stochastic flavor added to an otherwise perfectly deterministic update rule was actually found to enhance network reciprocity. This occurs because a subtle stochastic effect in the update rule improves the evolutionary trail in games having more stag-hunt-type dilemmas, although the same stochastic effect degenerates evolutionary trails in games having more chicken-type dilemmas. We explain these effects by dividing evolutionary trails into the enduring and expanding periods defined by Shigaki et al. [Phys. Rev. E 86, 031141 (2012), 10.1103/PhysRevE.86.031141].
Android malware detection based on evolutionary super-network
NASA Astrophysics Data System (ADS)
Yan, Haisheng; Peng, Lingling
2018-04-01
In the paper, an android malware detection method based on evolutionary super-network is proposed in order to improve the precision of android malware detection. Chi square statistics method is used for selecting characteristics on the basis of analyzing android authority. Boolean weighting is utilized for calculating characteristic weight. Processed characteristic vector is regarded as the system training set and test set; hyper edge alternative strategy is used for training super-network classification model, thereby classifying test set characteristic vectors, and it is compared with traditional classification algorithm. The results show that the detection method proposed in the paper is close to or better than traditional classification algorithm. The proposed method belongs to an effective Android malware detection means.
NASA Astrophysics Data System (ADS)
Szabó, György; Fáth, Gábor
2007-07-01
Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first four sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fifth section surveys the topological complications implied by non-mean-field-type social network structures in general. The next three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.
Evolutionary Construction of Block-Based Neural Networks in Consideration of Failure
NASA Astrophysics Data System (ADS)
Takamori, Masahito; Koakutsu, Seiichi; Hamagami, Tomoki; Hirata, Hironori
In this paper we propose a modified gene coding and an evolutionary construction in consideration of failure in evolutionary construction of Block-Based Neural Networks. In the modified gene coding, we arrange the genes of weights on a chromosome in consideration of the position relation of the genes of weight and structure. By the modified gene coding, the efficiency of search by crossover is increased. Thereby, it is thought that improvement of the convergence rate of construction and shortening of construction time can be performed. In the evolutionary construction in consideration of failure, the structure which is adapted for failure is built in the state where failure occured. Thereby, it is thought that BBNN can be reconstructed in a short time at the time of failure. To evaluate the proposed method, we apply it to pattern classification and autonomous mobile robot control problems. The computational experiments indicate that the proposed method can improve convergence rate of construction and shorten of construction and reconstruction time.
A new evolutionary system for evolving artificial neural networks.
Yao, X; Liu, Y
1997-01-01
This paper presents a new evolutionary system, i.e., EPNet, for evolving artificial neural networks (ANNs). The evolutionary algorithm used in EPNet is based on Fogel's evolutionary programming (EP). Unlike most previous studies on evolving ANN's, this paper puts its emphasis on evolving ANN's behaviors. Five mutation operators proposed in EPNet reflect such an emphasis on evolving behaviors. Close behavioral links between parents and their offspring are maintained by various mutations, such as partial training and node splitting. EPNet evolves ANN's architectures and connection weights (including biases) simultaneously in order to reduce the noise in fitness evaluation. The parsimony of evolved ANN's is encouraged by preferring node/connection deletion to addition. EPNet has been tested on a number of benchmark problems in machine learning and ANNs, such as the parity problem, the medical diagnosis problems, the Australian credit card assessment problem, and the Mackey-Glass time series prediction problem. The experimental results show that EPNet can produce very compact ANNs with good generalization ability in comparison with other algorithms.
Mesoscopic structure conditions the emergence of cooperation on social networks
DOE Office of Scientific and Technical Information (OSTI.GOV)
Lozano, S.; Arenas, A.; Sanchez, A.
We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement withmore » the observations in both real substrates. Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.« less
The origins and evolutionary history of human non-coding RNA regulatory networks.
Sherafatian, Masih; Mowla, Seyed Javad
2017-04-01
The evolutionary history and origin of the regulatory function of animal non-coding RNAs are not well understood. Lack of conservation of long non-coding RNAs and small sizes of microRNAs has been major obstacles in their phylogenetic analysis. In this study, we tried to shed more light on the evolution of ncRNA regulatory networks by changing our phylogenetic strategy to focus on the evolutionary pattern of their protein coding targets. We used available target databases of miRNAs and lncRNAs to find their protein coding targets in human. We were able to recognize evolutionary hallmarks of ncRNA targets by phylostratigraphic analysis. We found the conventional 3'-UTR and lesser known 5'-UTR targets of miRNAs to be enriched at three consecutive phylostrata. Firstly, in eukaryata phylostratum corresponding to the emergence of miRNAs, our study revealed that miRNA targets function primarily in cell cycle processes. Moreover, the same overrepresentation of the targets observed in the next two consecutive phylostrata, opisthokonta and eumetazoa, corresponded to the expansion periods of miRNAs in animals evolution. Coding sequence targets of miRNAs showed a delayed rise at opisthokonta phylostratum, compared to the 3' and 5' UTR targets of miRNAs. LncRNA regulatory network was the latest to evolve at eumetazoa.
Carter, Richard J.; Wiesner, Karoline
2018-01-01
As a step towards understanding pre-evolutionary organization in non-genetic systems, we develop a model to investigate the emergence and dynamics of proto-autopoietic networks in an interacting population of simple information processing entities (automata). Our simulations indicate that dynamically stable strongly connected networks of mutually producing communication channels emerge under specific environmental conditions. We refer to these distinct organizational steady states as information niches. In each case, we measure the information content by the Shannon entropy, and determine the fitness landscape, robustness and transition pathways for information niches subjected to intermittent environmental perturbations under non-evolutionary conditions. By determining the information required to generate each niche, we show that niche transitions are only allowed if accompanied by an equal or increased level of information production that arises internally or via environmental perturbations that serve as an exogenous source of population diversification. Overall, our simulations show how proto-autopoietic networks of basic information processors form and compete, and under what conditions they persist over time or go extinct. These findings may be relevant to understanding how inanimate systems such as chemically communicating protocells can initiate the transition to living matter prior to the onset of contemporary evolutionary and genetic mechanisms. PMID:29343630
Serial sectioning for examination of photoreceptor cell architecture by focused ion beam technology
Mustafi, Debarshi; Avishai, Amir; Avishai, Nanthawan; Engel, Andreas; Heuer, Arthur; Palczewski, Krzysztof
2011-01-01
Structurally deciphering complex neural networks requires technology with sufficient resolution to allow visualization of single cells and their intimate surrounding connections. Scanning electron microscopy (SEM), coupled with serial ion ablation (SIA) technology, presents a new avenue to study these networks. SIA allows ion ablation to remove nanometer sections of tissue for SEM imaging, resulting in serial section data collection for three-dimensional reconstruction. Here we highlight a method for preparing retinal tissues for imaging of photoreceptors by SIA-SEM technology. We show that this technique can be used to visualize whole rod photoreceptors and the internal disc elements from wild-type (wt) mice. The distance parameters of the discs and photoreceptors are in good agreement with previous work with other methods. Moreover, we show that large planes of retinal tissue can be imaged at high resolution to display the packing of normal rods. Finally, SIA-SEM imaging of retinal tissue from a mouse model (Nrl−/−) with phenotypic changes akin to the human disease enhanced S-cone syndrome (ESCS) revealed a structural profile of overall photoreceptor ultrastructure and internal elements that accompany this disease. Overall, this work presents a new method to study photoreceptor cells at high structural resolution that has a broad applicability to the visual neuroscience field. PMID:21439323
Prangishvili, David
2016-01-01
ABSTRACT Archaea and particularly hyperthermophilic crenarchaea are hosts to many unusual viruses with diverse virion shapes and distinct gene compositions. As is typical of viruses in general, there are no universal genes in the archaeal virosphere. Therefore, to obtain a comprehensive picture of the evolutionary relationships between viruses, network analysis methods are more productive than traditional phylogenetic approaches. Here we present a comprehensive comparative analysis of genomes and proteomes from all currently known taxonomically classified and unclassified, cultivated and uncultivated archaeal viruses. We constructed a bipartite network of archaeal viruses that includes two classes of nodes, the genomes and gene families that connect them. Dissection of this network using formal community detection methods reveals strong modularity, with 10 distinct modules and 3 putative supermodules. However, compared to similar previously analyzed networks of eukaryotic and bacterial viruses, the archaeal virus network is sparsely connected. With the exception of the tailed viruses related to bacteriophages of the order Caudovirales and the families Turriviridae and Sphaerolipoviridae that are linked to a distinct supermodule of eukaryotic and bacterial viruses, there are few connector genes shared by different archaeal virus modules. In contrast, most of these modules include, in addition to viruses, capsidless mobile elements, emphasizing tight evolutionary connections between the two types of entities in archaea. The relative contributions of distinct evolutionary origins, in particular from nonviral elements, and insufficient sampling to the sparsity of the archaeal virus network remain to be determined by further exploration of the archaeal virosphere. IMPORTANCE Viruses infecting archaea are among the most mysterious denizens of the virosphere. Many of these viruses display no genetic or even morphological relationship to viruses of bacteria and eukaryotes, raising questions regarding their origins and position in the global virosphere. Analysis of 5,740 protein sequences from 116 genomes allowed dissection of the archaeal virus network and showed that most groups of archaeal viruses are evolutionarily connected to capsidless mobile genetic elements, including various plasmids and transposons. This finding could reflect actual independent origins of the distinct groups of archaeal viruses from different nonviral elements, providing important insights into the emergence and evolution of the archaeal virome. PMID:27681128
Application of stochastic processes in random growth and evolutionary dynamics
NASA Astrophysics Data System (ADS)
Oikonomou, Panagiotis
We study the effect of power-law distributed randomness on the dynamical behavior of processes such as stochastic growth patterns and evolution. First, we examine the geometrical properties of random shapes produced by a generalized stochastic Loewner Evolution driven by a superposition of a Brownian motion and a stable Levy process. The situation is defined by the usual stochastic Loewner Evolution parameter, kappa, as well as alpha which defines the power-law tail of the stable Levy distribution. We show that the properties of these patterns change qualitatively and singularly at critical values of kappa and alpha. It is reasonable to call such changes "phase transitions". These transitions occur as kappa passes through four and as alpha passes through one. Numerical simulations are used to explore the global scaling behavior of these patterns in each "phase". We show both analytically and numerically that the growth continues indefinitely in the vertical direction for alpha greater than 1, goes as logarithmically with time for alpha equals to 1, and saturates for alpha smaller than 1. The probability density has two different scales corresponding to directions along and perpendicular to the boundary. Scaling functions for the probability density are given for various limiting cases. Second, we study the effect of the architecture of biological networks on their evolutionary dynamics. In recent years, studies of the architecture of large networks have unveiled a common topology, called scale-free, in which a majority of the elements are poorly connected except for a small fraction of highly connected components. We ask how networks with distinct topologies can evolve towards a pre-established target phenotype through a process of random mutations and selection. We use networks of Boolean components as a framework to model a large class of phenotypes. Within this approach, we find that homogeneous random networks and scale-free networks exhibit drastically different evolutionary paths. While homogeneous random networks accumulate neutral mutations and evolve by sparse punctuated steps, scale-free networks evolve rapidly and continuously towards the target phenotype. Moreover, we show that scale-free networks always evolve faster than homogeneous random networks; remarkably, this property does not depend on the precise value of the topological parameter. By contrast, homogeneous random networks require a specific tuning of their topological parameter in order to optimize their fitness. This model suggests that the evolutionary paths of biological networks, punctuated or continuous, may solely be determined by the network topology.
Positive and negative effects of social impact on evolutionary vaccination game in networks
NASA Astrophysics Data System (ADS)
Ichinose, Genki; Kurisaku, Takehiro
2017-02-01
Preventing infectious disease like flu from spreading to large communities is one of the most important issues for humans. One effective strategy is voluntary vaccination, however, there is always the temptation for people refusing to be vaccinated because once herd immunity is achieved, infection risk is greatly reduced. In this paper, we study the effect of social impact on the vaccination behavior resulting in preventing infectious disease in networks. The evolutionary simulation results show that the social impact has both positive and negative effects on the vaccination behavior. Especially, in heterogeneous networks, if the vaccination cost is low the behavior is more promoted than the case without social impact. In contrast, if the cost is high, the behavior is reduced compared to the case without social impact. Moreover, the vaccination behavior is effective in heterogeneous networks more than in homogeneous networks. This implies that the social impact puts people at risk in homogeneous networks. We also evaluate the results from the social cost related to the vaccination policy.
Tree-Based Unrooted Phylogenetic Networks.
Francis, A; Huber, K T; Moulton, V
2018-02-01
Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An unrooted phylogenetic network on a non-empty, finite set X of taxa, or network, is a connected, simple graph in which every vertex has degree 1 or 3 and whose leaf set is X. It is called a phylogenetic tree if the underlying graph is a tree. In this paper we consider properties of tree-based networks, that is, networks that can be constructed by adding edges into a phylogenetic tree. We show that although they have some properties in common with their rooted analogues which have recently drawn much attention in the literature, they have some striking differences in terms of both their structural and computational properties. We expect that our results could eventually have applications to, for example, detecting horizontal gene transfer or hybridization which are important factors in the evolution of many organisms.
Homophyly/Kinship Model: Naturally Evolving Networks
NASA Astrophysics Data System (ADS)
Li, Angsheng; Li, Jiankou; Pan, Yicheng; Yin, Xianchen; Yong, Xi
2015-10-01
It has been a challenge to understand the formation and roles of social groups or natural communities in the evolution of species, societies and real world networks. Here, we propose the hypothesis that homophyly/kinship is the intrinsic mechanism of natural communities, introduce the notion of the affinity exponent and propose the homophyly/kinship model of networks. We demonstrate that the networks of our model satisfy a number of topological, probabilistic and combinatorial properties and, in particular, that the robustness and stability of natural communities increase as the affinity exponent increases and that the reciprocity of the networks in our model decreases as the affinity exponent increases. We show that both homophyly/kinship and reciprocity are essential to the emergence of cooperation in evolutionary games and that the homophyly/kinship and reciprocity determined by the appropriate affinity exponent guarantee the emergence of cooperation in evolutionary games, verifying Darwin’s proposal that kinship and reciprocity are the means of individual fitness. We propose the new principle of structure entropy minimisation for detecting natural communities of networks and verify the functional module property and characteristic properties by a healthy tissue cell network, a citation network, some metabolic networks and a protein interaction network.
Homophyly/Kinship Model: Naturally Evolving Networks
Li, Angsheng; Li, Jiankou; Pan, Yicheng; Yin, Xianchen; Yong, Xi
2015-01-01
It has been a challenge to understand the formation and roles of social groups or natural communities in the evolution of species, societies and real world networks. Here, we propose the hypothesis that homophyly/kinship is the intrinsic mechanism of natural communities, introduce the notion of the affinity exponent and propose the homophyly/kinship model of networks. We demonstrate that the networks of our model satisfy a number of topological, probabilistic and combinatorial properties and, in particular, that the robustness and stability of natural communities increase as the affinity exponent increases and that the reciprocity of the networks in our model decreases as the affinity exponent increases. We show that both homophyly/kinship and reciprocity are essential to the emergence of cooperation in evolutionary games and that the homophyly/kinship and reciprocity determined by the appropriate affinity exponent guarantee the emergence of cooperation in evolutionary games, verifying Darwin’s proposal that kinship and reciprocity are the means of individual fitness. We propose the new principle of structure entropy minimisation for detecting natural communities of networks and verify the functional module property and characteristic properties by a healthy tissue cell network, a citation network, some metabolic networks and a protein interaction network. PMID:26478264
Wagner, Andreas
2014-07-07
Networks of evolving genotypes can be constructed from the worldwide time-resolved genotyping of pathogens like influenza viruses. Such genotype networks are graphs where neighbouring vertices (viral strains) differ in a single nucleotide or amino acid. A rich trove of network analysis methods can help understand the evolutionary dynamics reflected in the structure of these networks. Here, I analyse a genotype network comprising hundreds of influenza A (H3N2) haemagglutinin genes. The network is rife with cycles that reflect non-random parallel or convergent (homoplastic) evolution. These cycles also show patterns of sequence change characteristic for strong and local evolutionary constraints, positive selection and mutation-limited evolution. Such cycles would not be visible on a phylogenetic tree, illustrating that genotype network analysis can complement phylogenetic analyses. The network also shows a distinct modular or community structure that reflects temporal more than spatial proximity of viral strains, where lowly connected bridge strains connect different modules. These and other organizational patterns illustrate that genotype networks can help us study evolution in action at an unprecedented level of resolution. © 2014 The Author(s) Published by the Royal Society. All rights reserved.
Serial-to-parallel color-TV converter
NASA Technical Reports Server (NTRS)
Doak, T. W.; Merwin, R. B.; Zuckswert, S. E.; Sepper, W.
1976-01-01
Solid analog-to-digital converter eliminates flicker and problems with time base stability and gain variation in sequential color TV cameras. Device includes 3-bit delta modulator; two-field memory; timing, switching, and sync network; and three 3-bit delta demodulators
ERIC Educational Resources Information Center
Elsweiler, John A., Jr.; And Others
1990-01-01
Presents summaries of 12 papers presented at the 1990 Computers in Libraries Conference. Topics discussed include online searching; microcomputer-based serials management; microcomputer-based workstations; online public access catalogs (OPACs); multitype library networking; CD-ROM searches; locally mounted online databases; collection evaluation;…
Supersystems: OCLC Continues to Innovate.
ERIC Educational Resources Information Center
Jenkins, Judith
1983-01-01
Activities of Online Computer Library Center, a nonprofit corporation developed in 1967 that provides a cooperative, computerized network, are discussed. Member, staff, and financial growth; unique subsystems (cataloging, acquisitions, serials control, interlibrary loan, retrospective conversion); problems with terminals, taxes, and competitive…
Genetic Regulatory Networks in Embryogenesis and Evolution
NASA Technical Reports Server (NTRS)
1998-01-01
The article introduces a series of papers that were originally presented at a workshop titled Genetic Regulatory Network in Embryogenesis and Evaluation. Contents include the following: evolution of cleavage programs in relationship to axial specification and body plan evolution, changes in cell lineage specification elucidate evolutionary relations in spiralia, axial patterning in the leech: developmental mechanisms and evolutionary implications, hox genes in arthropod development and evolution, heterochronic genes in development and evolution, a common theme for LIM homeobox gene function across phylogeny, and mechanisms of specification in ascidian embryos.
Evolutionary systems biology: historical and philosophical perspectives on an emerging synthesis.
O'Malley, Maureen A
2012-01-01
Systems biology (SB) is at least a decade old now and maturing rapidly. A more recent field, evolutionary systems biology (ESB), is in the process of further developing system-level approaches through the expansion of their explanatory and potentially predictive scope. This chapter will outline the varieties of ESB existing today by tracing the diverse roots and fusions that make up this integrative project. My approach is philosophical and historical. As well as examining the recent origins of ESB, I will reflect on its central features and the different clusters of research it comprises. In its broadest interpretation, ESB consists of five overlapping approaches: comparative and correlational ESB; network architecture ESB; network property ESB; population genetics ESB; and finally, standard evolutionary questions answered with SB methods. After outlining each approach with examples, I will examine some strong general claims about ESB, particularly that it can be viewed as the next step toward a fuller modern synthesis of evolutionary biology (EB), and that it is also the way forward for evolutionary and systems medicine. I will conclude with a discussion of whether the emerging field of ESB has the capacity to combine an even broader scope of research aims and efforts than it presently does.
Discovery of tanshinone derivatives with anti-MRSA activity via targeted bio-transformation.
He, Wenni; Liu, Miaomiao; Huang, Pei; Abdel-Mageed, Wael M; Han, Jianying; Watrous, Jeramie D; Nguyen, Don D; Wang, Wenzhao; Song, Fuhang; Dai, Huanqin; Zhang, Jingyu; Quinn, Ronald J; Grkovi, Tanja; Luo, Houwei; Zhang, Lixin; Liu, Xueting
2016-09-01
Two potent anti-MRSA tanshinone glycosides ( 1 and 2 ) were discovered by targeted microbial biotransformation, along with rapid identification via MS/MS networking. Serial reactions including dehydrogenation, demethylations, reduction, glycosylation and methylation have been observed after incubation of tanshinone IIA and fungus Mucor rouxianus AS 3.3447. In addition, tanshinosides B ( 2 ) showed potent activities against serial clinical isolates of oxacillin-resistant Staphylococcus aureus with MIC values of 0.78 μg/mL. This is the first study that shows a significant increase in the level and activities of tanshinone glycosides relative to the substrate tanshinone IIA.
Chase, Mark W.; Kim, Joo-Hwan
2013-01-01
Phylogenetic analysis aims to produce a bifurcating tree, which disregards conflicting signals and displays only those that are present in a large proportion of the data. However, any character (or tree) conflict in a dataset allows the exploration of support for various evolutionary hypotheses. Although data-display network approaches exist, biologists cannot easily and routinely use them to compute rooted phylogenetic networks on real datasets containing hundreds of taxa. Here, we constructed an original neighbour-net for a large dataset of Asparagales to highlight the aspects of the resulting network that will be important for interpreting phylogeny. The analyses were largely conducted with new data collected for the same loci as in previous studies, but from different species accessions and greater sampling in many cases than in published analyses. The network tree summarised the majority data pattern in the characters of plastid sequences before tree building, which largely confirmed the currently recognised phylogenetic relationships. Most conflicting signals are at the base of each group along the Asparagales backbone, which helps us to establish the expectancy and advance our understanding of some difficult taxa relationships and their phylogeny. The network method should play a greater role in phylogenetic analyses than it has in the past. To advance the understanding of evolutionary history of the largest order of monocots Asparagales, absolute diversification times were estimated for family-level clades using relaxed molecular clock analyses. PMID:23544071
Why don’t you use Evolutionary Algorithms in Big Data?
NASA Astrophysics Data System (ADS)
Stanovov, Vladimir; Brester, Christina; Kolehmainen, Mikko; Semenkina, Olga
2017-02-01
In this paper we raise the question of using evolutionary algorithms in the area of Big Data processing. We show that evolutionary algorithms provide evident advantages due to their high scalability and flexibility, their ability to solve global optimization problems and optimize several criteria at the same time for feature selection, instance selection and other data reduction problems. In particular, we consider the usage of evolutionary algorithms with all kinds of machine learning tools, such as neural networks and fuzzy systems. All our examples prove that Evolutionary Machine Learning is becoming more and more important in data analysis and we expect to see the further development of this field especially in respect to Big Data.
Tracking the Evolution of Infrastructure Systems and Mass Responses Using Publically Available Data
Guan, Xiangyang; Chen, Cynthia; Work, Dan
2016-01-01
Networks can evolve even on a short-term basis. This phenomenon is well understood by network scientists, but receive little attention in empirical literature involving real-world networks. On one hand, this is due to the deceitfully fixed topology of some networks such as many physical infrastructures, whose evolution is often deemed unlikely to occur in short term; on the other hand, the lack of data prohibits scientists from studying subjects such as social networks that seem likely to evolve on a short-term basis. We show that both networks—the infrastructure network and social network—are able to demonstrate evolutionary dynamics at the system level even in the short-term, characterized by shifting between different phases as predicted in network science. We develop a methodology of tracking the evolutionary dynamics of the two networks by incorporating flows and the microstructure of networks such as motifs. This approach is applied to the human interaction network and two transportation networks (subway and taxi) in the context of Hurricane Sandy, using publically available Twitter data and transportation data. Our result shows that significant changes in the system-level structure of networks can be detected on a continuous basis. This result provides a promising channel for real-time tracking in the future. PMID:27907061
Rapid molecular evolution across amniotes of the IIS/TOR network
McGaugh, Suzanne E.; Bronikowski, Anne M.; Kuo, Chih-Horng; Reding, Dawn M.; Addis, Elizabeth A.; Flagel, Lex E.; Janzen, Fredric J.
2015-01-01
The insulin/insulin-like signaling and target of rapamycin (IIS/TOR) network regulates lifespan and reproduction, as well as metabolic diseases, cancer, and aging. Despite its vital role in health, comparative analyses of IIS/TOR have been limited to invertebrates and mammals. We conducted an extensive evolutionary analysis of the IIS/TOR network across 66 amniotes with 18 newly generated transcriptomes from nonavian reptiles and additional available genomes/transcriptomes. We uncovered rapid and extensive molecular evolution between reptiles (including birds) and mammals: (i) the IIS/TOR network, including the critical nodes insulin receptor substrate (IRS) and phosphatidylinositol 3-kinase (PI3K), exhibit divergent evolutionary rates between reptiles and mammals; (ii) compared with a proxy for the rest of the genome, genes of the IIS/TOR extracellular network exhibit exceptionally fast evolutionary rates; and (iii) signatures of positive selection and coevolution of the extracellular network suggest reptile- and mammal-specific interactions between members of the network. In reptiles, positively selected sites cluster on the binding surfaces of insulin-like growth factor 1 (IGF1), IGF1 receptor (IGF1R), and insulin receptor (INSR); whereas in mammals, positively selected sites clustered on the IGF2 binding surface, suggesting that these hormone-receptor binding affinities are targets of positive selection. Further, contrary to reports that IGF2R binds IGF2 only in marsupial and placental mammals, we found positively selected sites clustered on the hormone binding surface of reptile IGF2R that suggest that IGF2R binds to IGF hormones in diverse taxa and may have evolved in reptiles. These data suggest that key IIS/TOR paralogs have sub- or neofunctionalized between mammals and reptiles and that this network may underlie fundamental life history and physiological differences between these amniote sister clades. PMID:25991861
Rapid molecular evolution across amniotes of the IIS/TOR network.
McGaugh, Suzanne E; Bronikowski, Anne M; Kuo, Chih-Horng; Reding, Dawn M; Addis, Elizabeth A; Flagel, Lex E; Janzen, Fredric J; Schwartz, Tonia S
2015-06-02
The insulin/insulin-like signaling and target of rapamycin (IIS/TOR) network regulates lifespan and reproduction, as well as metabolic diseases, cancer, and aging. Despite its vital role in health, comparative analyses of IIS/TOR have been limited to invertebrates and mammals. We conducted an extensive evolutionary analysis of the IIS/TOR network across 66 amniotes with 18 newly generated transcriptomes from nonavian reptiles and additional available genomes/transcriptomes. We uncovered rapid and extensive molecular evolution between reptiles (including birds) and mammals: (i) the IIS/TOR network, including the critical nodes insulin receptor substrate (IRS) and phosphatidylinositol 3-kinase (PI3K), exhibit divergent evolutionary rates between reptiles and mammals; (ii) compared with a proxy for the rest of the genome, genes of the IIS/TOR extracellular network exhibit exceptionally fast evolutionary rates; and (iii) signatures of positive selection and coevolution of the extracellular network suggest reptile- and mammal-specific interactions between members of the network. In reptiles, positively selected sites cluster on the binding surfaces of insulin-like growth factor 1 (IGF1), IGF1 receptor (IGF1R), and insulin receptor (INSR); whereas in mammals, positively selected sites clustered on the IGF2 binding surface, suggesting that these hormone-receptor binding affinities are targets of positive selection. Further, contrary to reports that IGF2R binds IGF2 only in marsupial and placental mammals, we found positively selected sites clustered on the hormone binding surface of reptile IGF2R that suggest that IGF2R binds to IGF hormones in diverse taxa and may have evolved in reptiles. These data suggest that key IIS/TOR paralogs have sub- or neofunctionalized between mammals and reptiles and that this network may underlie fundamental life history and physiological differences between these amniote sister clades.
Network motif frequency vectors reveal evolving metabolic network organisation.
Pearcy, Nicole; Crofts, Jonathan J; Chuzhanova, Nadia
2015-01-01
At the systems level many organisms of interest may be described by their patterns of interaction, and as such, are perhaps best characterised via network or graph models. Metabolic networks, in particular, are fundamental to the proper functioning of many important biological processes, and thus, have been widely studied over the past decade or so. Such investigations have revealed a number of shared topological features, such as a short characteristic path-length, large clustering coefficient and hierarchical modular structure. However, the extent to which evolutionary and functional properties of metabolism manifest via this underlying network architecture remains unclear. In this paper, we employ a novel graph embedding technique, based upon low-order network motifs, to compare metabolic network structure for 383 bacterial species categorised according to a number of biological features. In particular, we introduce a new global significance score which enables us to quantify important evolutionary relationships that exist between organisms and their physical environments. Using this new approach, we demonstrate a number of significant correlations between environmental factors, such as growth conditions and habitat variability, and network motif structure, providing evidence that organism adaptability leads to increased complexities in the resultant metabolic networks.
How mutation alters the evolutionary dynamics of cooperation on networks
NASA Astrophysics Data System (ADS)
Ichinose, Genki; Satotani, Yoshiki; Sayama, Hiroki
2018-05-01
Cooperation is ubiquitous at every level of living organisms. It is known that spatial (network) structure is a viable mechanism for cooperation to evolve. A recently proposed numerical metric, average gradient of selection (AGoS), a useful tool for interpreting and visualizing evolutionary dynamics on networks, allows simulation results to be visualized on a one-dimensional phase space. However, stochastic mutation of strategies was not considered in the analysis of AGoS. Here we extend AGoS so that it can analyze the evolution of cooperation where mutation may alter strategies of individuals on networks. We show that our extended AGoS correctly visualizes the final states of cooperation with mutation in the individual-based simulations. Our analyses revealed that mutation always has a negative effect on the evolution of cooperation regardless of the payoff functions, fraction of cooperators, and network structures. Moreover, we found that scale-free networks are the most vulnerable to mutation and thus the dynamics of cooperation are altered from bistability to coexistence on those networks, undergoing an imperfect pitchfork bifurcation.
2009-02-01
can be quickly reused to face new analytic tasks. Other humanities projects like Monk and Nema have also recently adopted Meandre. The evolutionary...keynote], Congresso Mexicano dc Com- putation Evolutiva (CONCEV), Aguas Calientes, Mexico, May, 2005. Evolutionary Tools for Human-Innovation and
Jargon that Computes: Today's PC Terminology.
ERIC Educational Resources Information Center
Crawford, Walt
1997-01-01
Discusses PC (personal computer) and telecommunications terminology in context: Integrated Services Digital Network (ISDN); Asymmetric Digital Subscriber Line (ADSL); cable modems; satellite downloads; T1 and T3 lines; magnitudes ("giga-,""nano-"); Central Processing Unit (CPU); Random Access Memory (RAM); Universal Serial Bus…
Spirov, Alexander; Holloway, David
2013-07-15
This paper surveys modeling approaches for studying the evolution of gene regulatory networks (GRNs). Modeling of the design or 'wiring' of GRNs has become increasingly common in developmental and medical biology, as a means of quantifying gene-gene interactions, the response to perturbations, and the overall dynamic motifs of networks. Drawing from developments in GRN 'design' modeling, a number of groups are now using simulations to study how GRNs evolve, both for comparative genomics and to uncover general principles of evolutionary processes. Such work can generally be termed evolution in silico. Complementary to these biologically-focused approaches, a now well-established field of computer science is Evolutionary Computations (ECs), in which highly efficient optimization techniques are inspired from evolutionary principles. In surveying biological simulation approaches, we discuss the considerations that must be taken with respect to: (a) the precision and completeness of the data (e.g. are the simulations for very close matches to anatomical data, or are they for more general exploration of evolutionary principles); (b) the level of detail to model (we proceed from 'coarse-grained' evolution of simple gene-gene interactions to 'fine-grained' evolution at the DNA sequence level); (c) to what degree is it important to include the genome's cellular context; and (d) the efficiency of computation. With respect to the latter, we argue that developments in computer science EC offer the means to perform more complete simulation searches, and will lead to more comprehensive biological predictions. Copyright © 2013 Elsevier Inc. All rights reserved.
A convolutional neural network-based screening tool for X-ray serial crystallography
Ke, Tsung-Wei; Brewster, Aaron S.; Yu, Stella X.; Ushizima, Daniela; Yang, Chao; Sauter, Nicholas K.
2018-01-01
A new tool is introduced for screening macromolecular X-ray crystallography diffraction images produced at an X-ray free-electron laser light source. Based on a data-driven deep learning approach, the proposed tool executes a convolutional neural network to detect Bragg spots. Automatic image processing algorithms described can enable the classification of large data sets, acquired under realistic conditions consisting of noisy data with experimental artifacts. Outcomes are compared for different data regimes, including samples from multiple instruments and differing amounts of training data for neural network optimization. PMID:29714177
Congestion estimation technique in the optical network unit registration process.
Kim, Geunyong; Yoo, Hark; Lee, Dongsoo; Kim, Youngsun; Lim, Hyuk
2016-07-01
We present a congestion estimation technique (CET) to estimate the optical network unit (ONU) registration success ratio for the ONU registration process in passive optical networks. An optical line terminal (OLT) estimates the number of collided ONUs via the proposed scheme during the serial number state. The OLT can obtain congestion level among ONUs to be registered such that this information may be exploited to change the size of a quiet window to decrease the collision probability. We verified the efficiency of the proposed method through simulation and experimental results.
A convolutional neural network-based screening tool for X-ray serial crystallography.
Ke, Tsung Wei; Brewster, Aaron S; Yu, Stella X; Ushizima, Daniela; Yang, Chao; Sauter, Nicholas K
2018-05-01
A new tool is introduced for screening macromolecular X-ray crystallography diffraction images produced at an X-ray free-electron laser light source. Based on a data-driven deep learning approach, the proposed tool executes a convolutional neural network to detect Bragg spots. Automatic image processing algorithms described can enable the classification of large data sets, acquired under realistic conditions consisting of noisy data with experimental artifacts. Outcomes are compared for different data regimes, including samples from multiple instruments and differing amounts of training data for neural network optimization. open access.
A convolutional neural network-based screening tool for X-ray serial crystallography
Ke, Tsung-Wei; Brewster, Aaron S.; Yu, Stella X.; ...
2018-04-24
A new tool is introduced for screening macromolecular X-ray crystallography diffraction images produced at an X-ray free-electron laser light source. Based on a data-driven deep learning approach, the proposed tool executes a convolutional neural network to detect Bragg spots. Automatic image processing algorithms described can enable the classification of large data sets, acquired under realistic conditions consisting of noisy data with experimental artifacts. Outcomes are compared for different data regimes, including samples from multiple instruments and differing amounts of training data for neural network optimization.
A convolutional neural network-based screening tool for X-ray serial crystallography
DOE Office of Scientific and Technical Information (OSTI.GOV)
Ke, Tsung-Wei; Brewster, Aaron S.; Yu, Stella X.
A new tool is introduced for screening macromolecular X-ray crystallography diffraction images produced at an X-ray free-electron laser light source. Based on a data-driven deep learning approach, the proposed tool executes a convolutional neural network to detect Bragg spots. Automatic image processing algorithms described can enable the classification of large data sets, acquired under realistic conditions consisting of noisy data with experimental artifacts. Outcomes are compared for different data regimes, including samples from multiple instruments and differing amounts of training data for neural network optimization.
1990-09-01
military pilot acceptance of a safety network system would be based , as always, on the following: a. Do I really need such a system and will it be a...inferring pilot state based on computer analysis of pilot control inputs (or lack of)l. Having decided that the pilot is incapacitated, PMAS would alert...the advances being made in neural network computing machinery have necessitated a complete re-thinking of the conventional serial von Neuman machine
Research on Nonlinear Time Series Forecasting of Time-Delay NN Embedded with Bayesian Regularization
NASA Astrophysics Data System (ADS)
Jiang, Weijin; Xu, Yusheng; Xu, Yuhui; Wang, Jianmin
Based on the idea of nonlinear prediction of phase space reconstruction, this paper presented a time delay BP neural network model, whose generalization capability was improved by Bayesian regularization. Furthermore, the model is applied to forecast the imp&exp trades in one industry. The results showed that the improved model has excellent generalization capabilities, which not only learned the historical curve, but efficiently predicted the trend of business. Comparing with common evaluation of forecasts, we put on a conclusion that nonlinear forecast can not only focus on data combination and precision improvement, it also can vividly reflect the nonlinear characteristic of the forecasting system. While analyzing the forecasting precision of the model, we give a model judgment by calculating the nonlinear characteristic value of the combined serial and original serial, proved that the forecasting model can reasonably 'catch' the dynamic characteristic of the nonlinear system which produced the origin serial.
The human phosphotyrosine signaling network: Evolution and hotspots of hijacking in cancer
Li, Lei; Tibiche, Chabane; Fu, Cong; Kaneko, Tomonori; Moran, Michael F.; Schiller, Martin R.; Li, Shawn Shun-Cheng; Wang, Edwin
2012-01-01
Phosphotyrosine (pTyr) signaling, which plays a central role in cell–cell and cell–environment interactions, has been considered to be an evolutionary innovation in multicellular metazoans. However, neither the emergence nor the evolution of the human pTyr signaling system is currently understood. Tyrosine kinase (TK) circuits, each of which consists of a TK writer, a kinase substrate, and a related reader, such as Src homology (SH) 2 domains and pTyr-binding (PTB) domains, comprise the core machinery of the pTyr signaling network. In this study, we analyzed the evolutionary trajectories of 583 literature-derived and 50,000 computationally predicted human TK circuits in 19 representative eukaryotic species and assigned their evolutionary origins. We found that human TK circuits for intracellular pTyr signaling originated largely from primitive organisms, whereas the inter- or extracellular signaling circuits experienced significant expansion in the bilaterian lineage through the “back-wiring” of newly evolved kinases to primitive substrates and SH2/PTB domains. Conversely, the TK circuits that are involved in tissue-specific signaling evolved mainly in vertebrates by the back-wiring of vertebrate substrates to primitive kinases and SH2/PTB domains. Importantly, we found that cancer signaling preferentially employs the pTyr sites, which are linked to more TK circuits. Our work provides insights into the evolutionary paths of the human pTyr signaling circuits and suggests the use of a network approach for cancer intervention through the targeting of key pTyr sites and their associated signaling hubs in the network. PMID:22194470
Quantifying ecological impacts of mass extinctions with network analysis of fossil communities
Muscente, A. D.; Prabhu, Anirudh; Zhong, Hao; Eleish, Ahmed; Meyer, Michael B.; Fox, Peter; Hazen, Robert M.; Knoll, Andrew H.
2018-01-01
Mass extinctions documented by the fossil record provide critical benchmarks for assessing changes through time in biodiversity and ecology. Efforts to compare biotic crises of the past and present, however, encounter difficulty because taxonomic and ecological changes are decoupled, and although various metrics exist for describing taxonomic turnover, no methods have yet been proposed to quantify the ecological impacts of extinction events. To address this issue, we apply a network-based approach to exploring the evolution of marine animal communities over the Phanerozoic Eon. Network analysis of fossil co-occurrence data enables us to identify nonrandom associations of interrelated paleocommunities. These associations, or evolutionary paleocommunities, dominated total diversity during successive intervals of relative community stasis. Community turnover occurred largely during mass extinctions and radiations, when ecological reorganization resulted in the decline of one association and the rise of another. Altogether, we identify five evolutionary paleocommunities at the generic and familial levels in addition to three ordinal associations that correspond to Sepkoski’s Cambrian, Paleozoic, and Modern evolutionary faunas. In this context, we quantify magnitudes of ecological change by measuring shifts in the representation of evolutionary paleocommunities over geologic time. Our work shows that the Great Ordovician Biodiversification Event had the largest effect on ecology, followed in descending order by the Permian–Triassic, Cretaceous–Paleogene, Devonian, and Triassic–Jurassic mass extinctions. Despite its taxonomic severity, the Ordovician extinction did not strongly affect co-occurrences of taxa, affirming its limited ecological impact. Network paleoecology offers promising approaches to exploring ecological consequences of extinctions and radiations. PMID:29686079
Quantifying ecological impacts of mass extinctions with network analysis of fossil communities.
Muscente, A D; Prabhu, Anirudh; Zhong, Hao; Eleish, Ahmed; Meyer, Michael B; Fox, Peter; Hazen, Robert M; Knoll, Andrew H
2018-05-15
Mass extinctions documented by the fossil record provide critical benchmarks for assessing changes through time in biodiversity and ecology. Efforts to compare biotic crises of the past and present, however, encounter difficulty because taxonomic and ecological changes are decoupled, and although various metrics exist for describing taxonomic turnover, no methods have yet been proposed to quantify the ecological impacts of extinction events. To address this issue, we apply a network-based approach to exploring the evolution of marine animal communities over the Phanerozoic Eon. Network analysis of fossil co-occurrence data enables us to identify nonrandom associations of interrelated paleocommunities. These associations, or evolutionary paleocommunities, dominated total diversity during successive intervals of relative community stasis. Community turnover occurred largely during mass extinctions and radiations, when ecological reorganization resulted in the decline of one association and the rise of another. Altogether, we identify five evolutionary paleocommunities at the generic and familial levels in addition to three ordinal associations that correspond to Sepkoski's Cambrian, Paleozoic, and Modern evolutionary faunas. In this context, we quantify magnitudes of ecological change by measuring shifts in the representation of evolutionary paleocommunities over geologic time. Our work shows that the Great Ordovician Biodiversification Event had the largest effect on ecology, followed in descending order by the Permian-Triassic, Cretaceous-Paleogene, Devonian, and Triassic-Jurassic mass extinctions. Despite its taxonomic severity, the Ordovician extinction did not strongly affect co-occurrences of taxa, affirming its limited ecological impact. Network paleoecology offers promising approaches to exploring ecological consequences of extinctions and radiations. Copyright © 2018 the Author(s). Published by PNAS.
Evolution, learning, and cognition
DOE Office of Scientific and Technical Information (OSTI.GOV)
Lee, Y.C.
1988-01-01
The book comprises more than fifteen articles in the areas of neural networks and connectionist systems, classifier systems, adaptive network systems, genetic algorithm, cellular automata, artificial immune systems, evolutionary genetics, cognitive science, optical computing, combinatorial optimization, and cybernetics.
Wireless Local Area Networks: The Next Evolutionary Step.
ERIC Educational Resources Information Center
Wodarz, Nan
2001-01-01
The Institute of Electrical and Electronics Engineers recently approved a high-speed wireless standard that enables devices from different manufacturers to communicate through a common backbone, making wireless local area networks more feasible in schools. Schools can now use wireless access points and network cards to provide flexible…
Ranking Information in Networks
NASA Astrophysics Data System (ADS)
Eliassi-Rad, Tina; Henderson, Keith
Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would like to discover sets of authors with expertise in a wide range of disciplines. We present this ranking task as a Top-K problem; utilize fixed-memory heuristic search; and present performance of both the serial and distributed search algorithms on synthetic and real-world data sets.
DDN (Defense Data Network) Protocol Implementations and Vendors Guide,
1988-02-01
TELNET) TCP/IP on an ethernet network. The program simulates a Hayes modem through the serial port. BWFTP is a thorough implementation of the FTP...25 IMP interface at VV from 19.2 Kbps to 56K bps. The IP, ICMP, TCP, Telnet. FFP and SMTP protocols are implemented along with R-Utxities...WANs. microcomputers, dataswitches. minicomputers. "black boxes" and modems . DOCUMENTATION: Software System Overview, Generic X.25 Porting Guide
Chimeric origins of ochrophytes and haptophytes revealed through an ancient plastid proteome
Dorrell, Richard G; Gile, Gillian; McCallum, Giselle; Méheust, Raphaël; Bapteste, Eric P; Klinger, Christen M; Brillet-Guéguen, Loraine; Freeman, Katalina D; Richter, Daniel J; Bowler, Chris
2017-01-01
Plastids are supported by a wide range of proteins encoded within the nucleus and imported from the cytoplasm. These plastid-targeted proteins may originate from the endosymbiont, the host, or other sources entirely. Here, we identify and characterise 770 plastid-targeted proteins that are conserved across the ochrophytes, a major group of algae including diatoms, pelagophytes and kelps, that possess plastids derived from red algae. We show that the ancestral ochrophyte plastid proteome was an evolutionary chimera, with 25% of its phylogenetically tractable nucleus-encoded proteins deriving from green algae. We additionally show that functional mixing of host and plastid proteomes, such as through dual-targeting, is an ancestral feature of plastid evolution. Finally, we detect a clear phylogenetic signal from one ochrophyte subgroup, the lineage containing pelagophytes and dictyochophytes, in plastid-targeted proteins from another major algal lineage, the haptophytes. This may represent a possible serial endosymbiosis event deep in eukaryotic evolutionary history. DOI: http://dx.doi.org/10.7554/eLife.23717.001 PMID:28498102
Baldominos, Alejandro; Saez, Yago; Isasi, Pedro
2018-04-23
Human activity recognition is a challenging problem for context-aware systems and applications. It is gaining interest due to the ubiquity of different sensor sources, wearable smart objects, ambient sensors, etc. This task is usually approached as a supervised machine learning problem, where a label is to be predicted given some input data, such as the signals retrieved from different sensors. For tackling the human activity recognition problem in sensor network environments, in this paper we propose the use of deep learning (convolutional neural networks) to perform activity recognition using the publicly available OPPORTUNITY dataset. Instead of manually choosing a suitable topology, we will let an evolutionary algorithm design the optimal topology in order to maximize the classification F1 score. After that, we will also explore the performance of committees of the models resulting from the evolutionary process. Results analysis indicates that the proposed model was able to perform activity recognition within a heterogeneous sensor network environment, achieving very high accuracies when tested with new sensor data. Based on all conducted experiments, the proposed neuroevolutionary system has proved to be able to systematically find a classification model which is capable of outperforming previous results reported in the state-of-the-art, showing that this approach is useful and improves upon previously manually-designed architectures.
2018-01-01
Human activity recognition is a challenging problem for context-aware systems and applications. It is gaining interest due to the ubiquity of different sensor sources, wearable smart objects, ambient sensors, etc. This task is usually approached as a supervised machine learning problem, where a label is to be predicted given some input data, such as the signals retrieved from different sensors. For tackling the human activity recognition problem in sensor network environments, in this paper we propose the use of deep learning (convolutional neural networks) to perform activity recognition using the publicly available OPPORTUNITY dataset. Instead of manually choosing a suitable topology, we will let an evolutionary algorithm design the optimal topology in order to maximize the classification F1 score. After that, we will also explore the performance of committees of the models resulting from the evolutionary process. Results analysis indicates that the proposed model was able to perform activity recognition within a heterogeneous sensor network environment, achieving very high accuracies when tested with new sensor data. Based on all conducted experiments, the proposed neuroevolutionary system has proved to be able to systematically find a classification model which is capable of outperforming previous results reported in the state-of-the-art, showing that this approach is useful and improves upon previously manually-designed architectures. PMID:29690587
ERIC Educational Resources Information Center
Benson, Chris, Ed.
1999-01-01
This serial issue contains nine articles all on the subject of "changing practice," i.e., innovative practices of rural English teachers in the Bread Loaf Rural Teacher Network. "Byte-ing into Medieval Literature" (John Fyler) describes an online conference on medieval literature for rural high school students. "Literacy…
ERIC Educational Resources Information Center
Benson, Chris, Ed.
2000-01-01
This serial issue contains 12 articles on the theme of "Professional Development," specifically about how teachers in the Bread Loaf Rural Teacher Network (BLRTN) are fostering their own and each other's development as teachers. The BLRTN consists of approximately 260 rural teachers in Alaska, Arizona, Colorado, Georgia, Kentucky,…
Fabian, Benjamin; Schneeberg, Katharina; Beutel, Rolf Georg
2016-11-01
Genetically modified organisms are crucial for our understanding of gene regulatory networks, physiological processes and ontogeny. With modern molecular genetic techniques allowing the rapid generation of different Drosophila melanogaster mutants, efficient in-depth morphological investigations become an important issue. Anatomical studies can elucidate the role of certain genes in developmental processes and point out which parts of gene regulatory networks are involved in evolutionary changes of morphological structures. The wingless mutation wg 1 of D. melanogaster was discovered more than 40 years ago. While early studies addressed the external phenotype of these mutants, the documentation of the internal organization was largely restricted to the prominent indirect flight muscles. We used SEM micrographs, histological serial sections, μ-computed tomography, CLSM and 3D reconstructions to study and document the thoracic skeletomuscular system of the wild type and mutant. A recently introduced nomenclature for the musculature of neopteran insects was applied to facilitate comparisons with closely or more distantly related taxa. The mutation is phenotypically mainly characterized by the absence of one or both wings and halteres. The wing is partly or entirely replaced by duplications of mesonotal structures, whereas the haltere and its associated muscles are completely absent on body sides showing the reduction. Both the direct and indirect mesothoracic flight muscles are affected by loss and reorientation of bundles or fibers. Our observations lead to the conclusion that the wingless mutation causes a homeotic transformation in the imaginal discs of wings and halteres with a direct effect on the development of skeletal structures and an indirect effect on the associated muscular system. Copyright © 2016 Elsevier Ltd. All rights reserved.
A novel framework of classical and quantum prisoner's dilemma games on coupled networks.
Deng, Xinyang; Zhang, Qi; Deng, Yong; Wang, Zhen
2016-03-15
Evolutionary games on multilayer networks are attracting growing interest. While among previous studies, the role of quantum games in such a infrastructure is still virgin and may become a fascinating issue across a myriad of research realms. To mimick two kinds of different interactive environments and mechanisms, in this paper a new framework of classical and quantum prisoner's dilemma games on two-layer coupled networks is considered. Within the proposed model, the impact of coupling factor of networks and entanglement degree in quantum games on the evolutionary process has been studied. Simulation results show that the entanglement has no impact on the evolution of the classical prisoner's dilemma, while the rise of the coupling factor obviously impedes cooperation in this game, and the evolution of quantum prisoner's dilemma is greatly impacted by the combined effect of entanglement and coupling.
Poultangari, Iman; Shahnazi, Reza; Sheikhan, Mansour
2012-09-01
In order to control the pitch angle of blades in wind turbines, commonly the proportional and integral (PI) controller due to its simplicity and industrial usability is employed. The neural networks and evolutionary algorithms are tools that provide a suitable ground to determine the optimal PI gains. In this paper, a radial basis function (RBF) neural network based PI controller is proposed for collective pitch control (CPC) of a 5-MW wind turbine. In order to provide an optimal dataset to train the RBF neural network, particle swarm optimization (PSO) evolutionary algorithm is used. The proposed method does not need the complexities, nonlinearities and uncertainties of the system under control. The simulation results show that the proposed controller has satisfactory performance. Copyright © 2012 ISA. Published by Elsevier Ltd. All rights reserved.
A novel framework of classical and quantum prisoner’s dilemma games on coupled networks
Deng, Xinyang; Zhang, Qi; Deng, Yong; Wang, Zhen
2016-01-01
Evolutionary games on multilayer networks are attracting growing interest. While among previous studies, the role of quantum games in such a infrastructure is still virgin and may become a fascinating issue across a myriad of research realms. To mimick two kinds of different interactive environments and mechanisms, in this paper a new framework of classical and quantum prisoner’s dilemma games on two-layer coupled networks is considered. Within the proposed model, the impact of coupling factor of networks and entanglement degree in quantum games on the evolutionary process has been studied. Simulation results show that the entanglement has no impact on the evolution of the classical prisoner’s dilemma, while the rise of the coupling factor obviously impedes cooperation in this game, and the evolution of quantum prisoner’s dilemma is greatly impacted by the combined effect of entanglement and coupling. PMID:26975447
Using Evolved Fuzzy Neural Networks for Injury Detection from Isokinetic Curves
NASA Astrophysics Data System (ADS)
Couchet, Jorge; Font, José María; Manrique, Daniel
In this paper we propose an evolutionary fuzzy neural networks system for extracting knowledge from a set of time series containing medical information. The series represent isokinetic curves obtained from a group of patients exercising the knee joint on an isokinetic dynamometer. The system has two parts: i) it analyses the time series input in order generate a simplified model of an isokinetic curve; ii) it applies a grammar-guided genetic program to obtain a knowledge base represented by a fuzzy neural network. Once the knowledge base has been generated, the system is able to perform knee injuries detection. The results suggest that evolved fuzzy neural networks perform better than non-evolutionary approaches and have a high accuracy rate during both the training and testing phases. Additionally, they are robust, as the system is able to self-adapt to changes in the problem without human intervention.
Impact of Social Punishment on Cooperative Behavior in Complex Networks
NASA Astrophysics Data System (ADS)
Wang, Zhen; Xia, Cheng-Yi; Meloni, Sandro; Zhou, Chang-Song; Moreno, Yamir
2013-10-01
Social punishment is a mechanism by which cooperative individuals spend part of their resources to penalize defectors. In this paper, we study the evolution of cooperation in 2-person evolutionary games on networks when a mechanism for social punishment is introduced. Specifically, we introduce a new kind of role, punisher, which is aimed at reducing the earnings of defectors by applying to them a social fee. Results from numerical simulations show that different equilibria allowing the three strategies to coexist are possible as well as that social punishment further enhance the robustness of cooperation. Our results are confirmed for different network topologies and two evolutionary games. In addition, we analyze the microscopic mechanisms that give rise to the observed macroscopic behaviors in both homogeneous and heterogeneous networks. Our conclusions might provide additional insights for understanding the roots of cooperation in social systems.
Ecological networks to unravel the routes to horizontal transposon transfers.
Venner, Samuel; Miele, Vincent; Terzian, Christophe; Biémont, Christian; Daubin, Vincent; Feschotte, Cédric; Pontier, Dominique
2017-02-01
Transposable elements (TEs) represent the single largest component of numerous eukaryotic genomes, and their activity and dispersal constitute an important force fostering evolutionary innovation. The horizontal transfer of TEs (HTT) between eukaryotic species is a common and widespread phenomenon that has had a profound impact on TE dynamics and, consequently, on the evolutionary trajectory of many species' lineages. However, the mechanisms promoting HTT remain largely unknown. In this article, we argue that network theory combined with functional ecology provides a robust conceptual framework and tools to delineate how complex interactions between diverse organisms may act in synergy to promote HTTs.
Jurrus, Elizabeth; Paiva, Antonio R C; Watanabe, Shigeki; Anderson, James R; Jones, Bryan W; Whitaker, Ross T; Jorgensen, Erik M; Marc, Robert E; Tasdizen, Tolga
2010-12-01
Study of nervous systems via the connectome, the map of connectivities of all neurons in that system, is a challenging problem in neuroscience. Towards this goal, neurobiologists are acquiring large electron microscopy datasets. However, the shear volume of these datasets renders manual analysis infeasible. Hence, automated image analysis methods are required for reconstructing the connectome from these very large image collections. Segmentation of neurons in these images, an essential step of the reconstruction pipeline, is challenging because of noise, anisotropic shapes and brightness, and the presence of confounding structures. The method described in this paper uses a series of artificial neural networks (ANNs) in a framework combined with a feature vector that is composed of image intensities sampled over a stencil neighborhood. Several ANNs are applied in series allowing each ANN to use the classification context provided by the previous network to improve detection accuracy. We develop the method of serial ANNs and show that the learned context does improve detection over traditional ANNs. We also demonstrate advantages over previous membrane detection methods. The results are a significant step towards an automated system for the reconstruction of the connectome. Copyright 2010 Elsevier B.V. All rights reserved.
Arpaia, P; Cimmino, P; Girone, M; La Commara, G; Maisto, D; Manna, C; Pezzetti, M
2014-09-01
Evolutionary approach to centralized multiple-faults diagnostics is extended to distributed transducer networks monitoring large experimental systems. Given a set of anomalies detected by the transducers, each instance of the multiple-fault problem is formulated as several parallel communicating sub-tasks running on different transducers, and thus solved one-by-one on spatially separated parallel processes. A micro-genetic algorithm merges evaluation time efficiency, arising from a small-size population distributed on parallel-synchronized processors, with the effectiveness of centralized evolutionary techniques due to optimal mix of exploitation and exploration. In this way, holistic view and effectiveness advantages of evolutionary global diagnostics are combined with reliability and efficiency benefits of distributed parallel architectures. The proposed approach was validated both (i) by simulation at CERN, on a case study of a cold box for enhancing the cryogeny diagnostics of the Large Hadron Collider, and (ii) by experiments, under the framework of the industrial research project MONDIEVOB (Building Remote Monitoring and Evolutionary Diagnostics), co-funded by EU and the company Del Bo srl, Napoli, Italy.
NASA Astrophysics Data System (ADS)
Park, Solip; Yang, Jae-Seong; Kim, Jinho; Shin, Young-Eun; Hwang, Jihye; Park, Juyong; Jang, Sung Key; Kim, Sanguk
2012-10-01
The extent to which evolutionary changes have impacted the phenotypic relationships among human diseases remains unclear. In this work, we report that phenotypically similar diseases are connected by the evolutionary constraints on human disease genes. Human disease groups can be classified into slowly or rapidly evolving classes, where the diseases in the slowly evolving class are enriched with morphological phenotypes and those in the rapidly evolving class are enriched with physiological phenotypes. Our findings establish a clear evolutionary connection between disease classes and disease phenotypes for the first time. Furthermore, the high comorbidity found between diseases connected by similar evolutionary constraints enables us to improve the predictability of the relative risk of human diseases. We find the evolutionary constraints on disease genes are a new layer of molecular connection in the network-based exploration of human diseases.
Park, Solip; Yang, Jae-Seong; Kim, Jinho; Shin, Young-Eun; Hwang, Jihye; Park, Juyong; Jang, Sung Key; Kim, Sanguk
2012-01-01
The extent to which evolutionary changes have impacted the phenotypic relationships among human diseases remains unclear. In this work, we report that phenotypically similar diseases are connected by the evolutionary constraints on human disease genes. Human disease groups can be classified into slowly or rapidly evolving classes, where the diseases in the slowly evolving class are enriched with morphological phenotypes and those in the rapidly evolving class are enriched with physiological phenotypes. Our findings establish a clear evolutionary connection between disease classes and disease phenotypes for the first time. Furthermore, the high comorbidity found between diseases connected by similar evolutionary constraints enables us to improve the predictability of the relative risk of human diseases. We find the evolutionary constraints on disease genes are a new layer of molecular connection in the network-based exploration of human diseases.
NASA Astrophysics Data System (ADS)
Hadzibeganovic, Tarik; Stauffer, Dietrich; Han, Xiao-Pu
2018-04-01
Cooperation is fundamental for the long-term survival of biological, social, and technological networks. Previously, mechanisms for the enhancement of cooperation, such as network reciprocity, have largely been studied in isolation and with often inconclusive findings. Here, we present an evolutionary, multiagent-based, and spatially explicit computer model to specifically address the interactive interplay between such mechanisms. We systematically investigate the effects of phenotypic diversity, network structure, and rewards on cooperative behavior emerging in a population of reproducing artificial decision makers playing tag-mediated evolutionary games. Cooperative interactions are rewarded such that both the benefits of recipients and costs of donators are affected by the reward size. The reward size is determined by the number of cooperative acts occurring within a given reward time frame. Our computational experiments reveal that small reward frames promote unconditional cooperation in populations with both low and high diversity, whereas large reward frames lead to cycles of conditional and unconditional strategies at high but not at low diversity. Moreover, an interaction between rewards and spatial structure shows that relative to small reward frames, there is a strong difference between the frequency of conditional cooperators populating rewired versus non-rewired networks when the reward frame is large. Notably, in a less diverse population, the total number of defections is comparable across different network topologies, whereas in more diverse environments defections become more frequent in a regularly structured than in a rewired, small-world network of contacts. Acknowledging the importance of such interaction effects in social dilemmas will have inevitable consequences for the future design of cooperation-enhancing protocols in large-scale, distributed, and decentralized systems such as peer-to-peer networks.
Inference of Transmission Network Structure from HIV Phylogenetic Trees
Giardina, Federica; Romero-Severson, Ethan Obie; Albert, Jan; ...
2017-01-13
Phylogenetic inference is an attractive means to reconstruct transmission histories and epidemics. However, there is not a perfect correspondence between transmission history and virus phylogeny. Both node height and topological differences may occur, depending on the interaction between within-host evolutionary dynamics and between-host transmission patterns. To investigate these interactions, we added a within-host evolutionary model in epidemiological simulations and examined if the resulting phylogeny could recover different types of contact networks. To further improve realism, we also introduced patient-specific differences in infectivity across disease stages, and on the epidemic level we considered incomplete sampling and the age of the epidemic.more » Second, we implemented an inference method based on approximate Bayesian computation (ABC) to discriminate among three well-studied network models and jointly estimate both network parameters and key epidemiological quantities such as the infection rate. Our ABC framework used both topological and distance-based tree statistics for comparison between simulated and observed trees. Overall, our simulations showed that a virus time-scaled phylogeny (genealogy) may be substantially different from the between-host transmission tree. This has important implications for the interpretation of what a phylogeny reveals about the underlying epidemic contact network. In particular, we found that while the within-host evolutionary process obscures the transmission tree, the diversification process and infectivity dynamics also add discriminatory power to differentiate between different types of contact networks. We also found that the possibility to differentiate contact networks depends on how far an epidemic has progressed, where distance-based tree statistics have more power early in an epidemic. Finally, we applied our ABC inference on two different outbreaks from the Swedish HIV-1 epidemic.« less
Inference of Transmission Network Structure from HIV Phylogenetic Trees
DOE Office of Scientific and Technical Information (OSTI.GOV)
Giardina, Federica; Romero-Severson, Ethan Obie; Albert, Jan
Phylogenetic inference is an attractive means to reconstruct transmission histories and epidemics. However, there is not a perfect correspondence between transmission history and virus phylogeny. Both node height and topological differences may occur, depending on the interaction between within-host evolutionary dynamics and between-host transmission patterns. To investigate these interactions, we added a within-host evolutionary model in epidemiological simulations and examined if the resulting phylogeny could recover different types of contact networks. To further improve realism, we also introduced patient-specific differences in infectivity across disease stages, and on the epidemic level we considered incomplete sampling and the age of the epidemic.more » Second, we implemented an inference method based on approximate Bayesian computation (ABC) to discriminate among three well-studied network models and jointly estimate both network parameters and key epidemiological quantities such as the infection rate. Our ABC framework used both topological and distance-based tree statistics for comparison between simulated and observed trees. Overall, our simulations showed that a virus time-scaled phylogeny (genealogy) may be substantially different from the between-host transmission tree. This has important implications for the interpretation of what a phylogeny reveals about the underlying epidemic contact network. In particular, we found that while the within-host evolutionary process obscures the transmission tree, the diversification process and infectivity dynamics also add discriminatory power to differentiate between different types of contact networks. We also found that the possibility to differentiate contact networks depends on how far an epidemic has progressed, where distance-based tree statistics have more power early in an epidemic. Finally, we applied our ABC inference on two different outbreaks from the Swedish HIV-1 epidemic.« less
Switch for serial or parallel communication networks
Crosette, D.B.
1994-07-19
A communication switch apparatus and a method for use in a geographically extensive serial, parallel or hybrid communication network linking a multi-processor or parallel processing system has a very low software processing overhead in order to accommodate random burst of high density data. Associated with each processor is a communication switch. A data source and a data destination, a sensor suite or robot for example, may also be associated with a switch. The configuration of the switches in the network are coordinated through a master processor node and depends on the operational phase of the multi-processor network: data acquisition, data processing, and data exchange. The master processor node passes information on the state to be assumed by each switch to the processor node associated with the switch. The processor node then operates a series of multi-state switches internal to each communication switch. The communication switch does not parse and interpret communication protocol and message routing information. During a data acquisition phase, the communication switch couples sensors producing data to the processor node associated with the switch, to a downlink destination on the communications network, or to both. It also may couple an uplink data source to its processor node. During the data exchange phase, the switch couples its processor node or an uplink data source to a downlink destination (which may include a processor node or a robot), or couples an uplink source to its processor node and its processor node to a downlink destination. 9 figs.
Switch for serial or parallel communication networks
Crosette, Dario B.
1994-01-01
A communication switch apparatus and a method for use in a geographically extensive serial, parallel or hybrid communication network linking a multi-processor or parallel processing system has a very low software processing overhead in order to accommodate random burst of high density data. Associated with each processor is a communication switch. A data source and a data destination, a sensor suite or robot for example, may also be associated with a switch. The configuration of the switches in the network are coordinated through a master processor node and depends on the operational phase of the multi-processor network: data acquisition, data processing, and data exchange. The master processor node passes information on the state to be assumed by each switch to the processor node associated with the switch. The processor node then operates a series of multi-state switches internal to each communication switch. The communication switch does not parse and interpret communication protocol and message routing information. During a data acquisition phase, the communication switch couples sensors producing data to the processor node associated with the switch, to a downlink destination on the communications network, or to both. It also may couple an uplink data source to its processor node. During the data exchange phase, the switch couples its processor node or an uplink data source to a downlink destination (which may include a processor node or a robot), or couples an uplink source to its processor node and its processor node to a downlink destination.
NASA Astrophysics Data System (ADS)
Cusma, Jack T.; Spero, Laurence A.; Groshong, Bennett R.; Cho, Teddy; Bashore, Thomas M.
1993-09-01
An economical and practical digital solution for the replacement of 35 mm cine film as the archive media in the cardiac x-ray imaging environment has remained lacking to date due to the demanding requirements of high capacity, high acquisition rate, high transfer rate, and a need for application in a distributed environment. A clinical digital image library and network based on the D2 digital video format has been installed in the Duke University Cardiac Catheterization Laboratory. The system architecture includes a central image library with digital video recorders and robotic tape retrieval, three acquisition stations, and remote review stations connected via a serial image network. The library has a capacity for over 20,000 Gigabytes of uncompressed image data, equivalent to records for approximately 20,000 patients. Image acquisition in the clinical laboratories is via a real-time digital interface between the digital angiography system and a local digital recorder. Images are transferred to the library over the serial network at a rate of 14.3 Mbytes/sec and permanently stored for later review. The image library and network are currently undergoing a clinical comparison with cine film for visual and quantitative assessment of coronary artery disease. At the conclusion of the evaluation, the configuration will be expanded to include four additional catheterization laboratories and remote review stations throughout the hospital.
Network analysis of the COSMOS galaxy field
NASA Astrophysics Data System (ADS)
de Regt, R.; Apunevych, S.; von Ferber, C.; Holovatch, Yu; Novosyadlyj, B.
2018-07-01
The galaxy data provided by COSMOS survey for 1°×1° field of sky are analysed by methods of complex networks. Three galaxy samples (slices) with redshifts ranging within intervals 0.88÷0.91, 0.91÷0.94, and 0.94÷0.97 are studied as two-dimensional projections for the spatial distributions of galaxies. We construct networks and calculate network measures for each sample, in order to analyse the network similarity of different samples, distinguish various topological environments, and find associations between galaxy properties (colour index and stellar mass) and their topological environments. Results indicate a high level of similarity between geometry and topology for different galaxy samples and no clear evidence of evolutionary trends in network measures. The distribution of local clustering coefficient C manifests three modes which allow for discrimination between stand-alone singlets and dumbbells (0 ≤ C ≤ 0.1), intermediately packed (0.1 < C < 0.9) and clique (0.9 ≤ C ≤ 1) like galaxies. Analysing astrophysical properties of galaxies (colour index and stellar masses), we show that distributions are similar in all slices, however weak evolutionary trends can also be seen across redshift slices. To specify different topological environments, we have extracted selections of galaxies from each sample according to different modes of C distribution. We have found statistically significant associations between evolutionary parameters of galaxies and selections of C: the distribution of stellar mass for galaxies with interim C differs from the corresponding distributions for stand-alone and clique galaxies, and this difference holds for all redshift slices. The colour index realizes somewhat different behaviour.
Network analysis of the COSMOS galaxy field
NASA Astrophysics Data System (ADS)
de Regt, R.; Apunevych, S.; Ferber, C. von; Holovatch, Yu; Novosyadlyj, B.
2018-03-01
The galaxy data provided by COSMOS survey for 1° × 1° field of sky are analysed by methods of complex networks. Three galaxy samples (slices) with redshifts ranging within intervals 0.88÷0.91, 0.91÷0.94 and 0.94÷0.97 are studied as two-dimensional projections for the spatial distributions of galaxies. We construct networks and calculate network measures for each sample, in order to analyse the network similarity of different samples, distinguish various topological environments, and find associations between galaxy properties (colour index and stellar mass) and their topological environments. Results indicate a high level of similarity between geometry and topology for different galaxy samples and no clear evidence of evolutionary trends in network measures. The distribution of local clustering coefficient C manifests three modes which allow for discrimination between stand-alone singlets and dumbbells (0 ≤ C ≤ 0.1), intermediately packed (0.1 < C < 0.9) and clique (0.9 ≤ C ≤ 1) like galaxies. Analysing astrophysical properties of galaxies (colour index and stellar masses), we show that distributions are similar in all slices, however weak evolutionary trends can also be seen across redshift slices. To specify different topological environments we have extracted selections of galaxies from each sample according to different modes of C distribution. We have found statistically significant associations between evolutionary parameters of galaxies and selections of C: the distribution of stellar mass for galaxies with interim C differ from the corresponding distributions for stand-alone and clique galaxies, and this difference holds for all redshift slices. The colour index realises somewhat different behaviour.
Evolutionary in Technology, Revolutionary in Impact
ERIC Educational Resources Information Center
Grush, Mary
2007-01-01
Ken Klingenstein has led national networking initiatives for the past 25 years. He served as director of computing and network services at the University of Colorado at Boulder from 1985-1999, and today, Klingenstein is director of middleware and security for Internet2. Truth is, this networking innovator has participated in the development of the…
Evolutionary neural networks for anomaly detection based on the behavior of a program.
Han, Sang-Jun; Cho, Sung-Bae
2006-06-01
The process of learning the behavior of a given program by using machine-learning techniques (based on system-call audit data) is effective to detect intrusions. Rule learning, neural networks, statistics, and hidden Markov models (HMMs) are some of the kinds of representative methods for intrusion detection. Among them, neural networks are known for good performance in learning system-call sequences. In order to apply this knowledge to real-world problems successfully, it is important to determine the structures and weights of these call sequences. However, finding the appropriate structures requires very long time periods because there are no suitable analytical solutions. In this paper, a novel intrusion-detection technique based on evolutionary neural networks (ENNs) is proposed. One advantage of using ENNs is that it takes less time to obtain superior neural networks than when using conventional approaches. This is because they discover the structures and weights of the neural networks simultaneously. Experimental results with the 1999 Defense Advanced Research Projects Agency (DARPA) Intrusion Detection Evaluation (IDEVAL) data confirm that ENNs are promising tools for intrusion detection.
In-silico studies of neutral drift for functional protein interaction networks
NASA Astrophysics Data System (ADS)
Ali, Md Zulfikar; Wingreen, Ned S.; Mukhopadhyay, Ranjan
We have developed a minimal physically-motivated model of protein-protein interaction networks. Our system consists of two classes of enzymes, activators (e.g. kinases) and deactivators (e.g. phosphatases), and the enzyme-mediated activation/deactivation rates are determined by sequence-dependent binding strengths between enzymes and their targets. The network is evolved by introducing random point mutations in the binding sequences where we assume that each new mutation is either fixed or entirely lost. We apply this model to studies of neutral drift in networks that yield oscillatory dynamics, where we start, for example, with a relatively simple network and allow it to evolve by adding nodes and connections while requiring that dynamics be conserved. Our studies demonstrate both the importance of employing a sequence-based evolutionary scheme and the relative rapidity (in evolutionary time) for the redistribution of function over new nodes via neutral drift. Surprisingly, in addition to this redistribution time we discovered another much slower timescale for network evolution, reflecting hidden order in sequence space that we interpret in terms of sparsely connected domains.
Intracellular metabolite profiling of Saccharomyces cerevisiae evolved under furfural.
Jung, Young Hoon; Kim, Sooah; Yang, Jungwoo; Seo, Jin-Ho; Kim, Kyoung Heon
2017-03-01
Furfural, one of the most common inhibitors in pre-treatment hydrolysates, reduces the cell growth and ethanol production of yeast. Evolutionary engineering has been used as a selection scheme to obtain yeast strains that exhibit furfural tolerance. However, the response of Saccharomyces cerevisiae to furfural at the metabolite level during evolution remains unknown. In this study, evolutionary engineering and metabolomic analyses were applied to determine the effects of furfural on yeasts and their metabolic response to continuous exposure to furfural. After 50 serial transfers of cultures in the presence of furfural, the evolved strains acquired the ability to stably manage its physiological status under the furfural stress. A total of 98 metabolites were identified, and their abundance profiles implied that yeast metabolism was globally regulated. Under the furfural stress, stress-protective molecules and cofactor-related mechanisms were mainly induced in the parental strain. However, during evolution under the furfural stress, S. cerevisiae underwent global metabolic allocations to quickly overcome the stress, particularly by maintaining higher levels of metabolites related to energy generation, cofactor regeneration and recovery from cellular damage. Mapping the mechanisms of furfural tolerance conferred by evolutionary engineering in the present study will be led to rational design of metabolically engineered yeasts. © 2016 The Authors. Microbial Biotechnology published by John Wiley & Sons Ltd and Society for Applied Microbiology.
Hunley, Keith L; Cabana, Graciela S
2016-07-01
Geneticists have argued that the linear decay in within-population genetic diversity with increasing geographic distance from East Africa is best explained by a phylogenetic process of repeated founder effects, growth, and isolation. However, this serial founder effect (SFE) process has not yet been adequately vetted against other evolutionary processes that may also affect geospatial patterns of diversity. Additionally, studies of the SFE process have been largely based on a limited 52-population sample. Here, we assess the effects of founder effect, admixture, and localized gene flow processes on patterns of global and regional diversity using a published data set of 645 autosomal microsatellite genotypes from 5,415 individuals in 248 widespread populations. We used a formal tree-fitting approach to explore the role of founder effects. The approach involved fitting global and regional population trees to extant patterns of gene diversity and then systematically examining the deviations in fit. We also informally tested the SFE process using linear models of gene diversity versus waypoint geographic distances from Africa. We tested the role of localized gene flow using partial Mantel correlograms of gene diversity versus geographic distance controlling for the confounding effects of treelike genetic structure. We corroborate previous findings that global patterns of diversity, both within and between populations, are the product of an out-of-Africa SFE process. Within regions, however, diversity within populations is uncorrelated with geographic distance from Africa. Here, patterns of diversity have been largely shaped by recent interregional admixture and secondary range expansions. Our detailed analyses of the pattern of diversity within and between populations reveal that the signatures of different evolutionary processes dominate at different geographic scales. These findings have important implications for recent publications on the biology of race.
Iranzo, Jaime; Koonin, Eugene V; Prangishvili, David; Krupovic, Mart
2016-12-15
Archaea and particularly hyperthermophilic crenarchaea are hosts to many unusual viruses with diverse virion shapes and distinct gene compositions. As is typical of viruses in general, there are no universal genes in the archaeal virosphere. Therefore, to obtain a comprehensive picture of the evolutionary relationships between viruses, network analysis methods are more productive than traditional phylogenetic approaches. Here we present a comprehensive comparative analysis of genomes and proteomes from all currently known taxonomically classified and unclassified, cultivated and uncultivated archaeal viruses. We constructed a bipartite network of archaeal viruses that includes two classes of nodes, the genomes and gene families that connect them. Dissection of this network using formal community detection methods reveals strong modularity, with 10 distinct modules and 3 putative supermodules. However, compared to similar previously analyzed networks of eukaryotic and bacterial viruses, the archaeal virus network is sparsely connected. With the exception of the tailed viruses related to bacteriophages of the order Caudovirales and the families Turriviridae and Sphaerolipoviridae that are linked to a distinct supermodule of eukaryotic and bacterial viruses, there are few connector genes shared by different archaeal virus modules. In contrast, most of these modules include, in addition to viruses, capsidless mobile elements, emphasizing tight evolutionary connections between the two types of entities in archaea. The relative contributions of distinct evolutionary origins, in particular from nonviral elements, and insufficient sampling to the sparsity of the archaeal virus network remain to be determined by further exploration of the archaeal virosphere. Viruses infecting archaea are among the most mysterious denizens of the virosphere. Many of these viruses display no genetic or even morphological relationship to viruses of bacteria and eukaryotes, raising questions regarding their origins and position in the global virosphere. Analysis of 5,740 protein sequences from 116 genomes allowed dissection of the archaeal virus network and showed that most groups of archaeal viruses are evolutionarily connected to capsidless mobile genetic elements, including various plasmids and transposons. This finding could reflect actual independent origins of the distinct groups of archaeal viruses from different nonviral elements, providing important insights into the emergence and evolution of the archaeal virome. Copyright © 2016, American Society for Microbiology. All Rights Reserved.
ERIC Educational Resources Information Center
Japan Broadcasting Co., Tokyo
Nippon Hoso Kyokai (Japan Broadcasting Corporation--NHK) is the only public service broadcasting corporation in Japan. Financed almost exclusively by subscribers fees, NHK runs two television services, two radio networks, and an FM service. Its 60 million viewers may choose from entertainment programing such as quiz shows, musicals, serials, and…
Surfing the Internet. An Introduction.
ERIC Educational Resources Information Center
Polly, Jean Armour
1992-01-01
Describes resources available through INTERNET that are of interest to librarians, including electronic newsletters and serials, online library catalogs, bulletin boards, remote access to software or text files, utilities to help navigate the network, sources for learning more about the INTERNET, discussion list guides, and INTERNET library…
Internet Connections: Understanding Your Access Options.
ERIC Educational Resources Information Center
Notess, Greg R.
1994-01-01
Describes levels of Internet connectivity, physical connections, and connection speeds. Compares options for connecting to the Internet, including terminal accounts, dial-up terminal accounts, direct connections through a local area network, and direct connections using SLIP (Serial Line Internet Protocol) or PPP (Point-to-Point Protocol). (eight…
Prescott, Steven A.
1998-01-01
Repetitive stimulation often results in habituation of the elicited response. However, if the stimulus is sufficiently strong, habituation may be preceded by transient sensitization or even replaced by enduring sensitization. In 1970, Groves and Thompson formulated the dual-process theory of plasticity to explain these characteristic behavioral changes on the basis of competition between decremental plasticity (depression) and incremental plasticity (facilitation) occurring within the neural network. Data from both vertebrate and invertebrate systems are reviewed and indicate that the effects of depression and facilitation are not exclusively additive but, rather, that those processes interact in a complex manner. Serial ordering of induction of learning, in which a depressing locus precedes the modulatory system responsible for inducing facilitation, causes the facilitation to wane. The parallel and/or serial expression of depression and waning facilitation within the stimulus–response pathway culminates in the behavioral changes that characterize dual-process learning. A mathematical model is presented to formally express and extend understanding of the interactions between depression and facilitation. PMID:10489261
Kopp, Franziska; Schröger, Erich; Lipka, Sigrid
2004-01-02
Rehearsal mechanisms in human short-term memory are increasingly understood in the light of both behavioural and neuroanatomical findings. However, little is known about the cooperation of participating brain structures and how such cooperations are affected when memory performance is disrupted. In this paper we use EEG coherence as a measure of synchronization to investigate rehearsal processes and their disruption by irrelevant speech in a delayed serial recall paradigm. Fronto-central and fronto-parietal theta (4-7.5 Hz), beta (13-20 Hz), and gamma (35-47 Hz) synchronizations are shown to be involved in our short-term memory task. Moreover, the impairment in serial recall due to irrelevant speech was preceded by a reduction of gamma band coherence. Results suggest that the irrelevant speech effect has its neural basis in the disruption of left-lateralized fronto-central networks. This stresses the importance of gamma band activity for short-term memory operations.
Kumar, Avishek; Butler, Brandon M.; Kumar, Sudhir; Ozkan, S. Banu
2016-01-01
Summary Sequencing technologies are revealing many new non-synonymous single nucleotide variants (nsSNVs) in each personal exome. To assess their functional impacts, comparative genomics is frequently employed to predict if they are benign or not. However, evolutionary analysis alone is insufficient, because it misdiagnoses many disease-associated nsSNVs, such as those at positions involved in protein interfaces, and because evolutionary predictions do not provide mechanistic insights into functional change or loss. Structural analyses can aid in overcoming both of these problems by incorporating conformational dynamics and allostery in nSNV diagnosis. Finally, protein-protein interaction networks using systems-level methodologies shed light onto disease etiology and pathogenesis. Bridging these network approaches with structurally resolved protein interactions and dynamics will advance genomic medicine. PMID:26684487
Evolutionary Topology of a Currency Network in Asia
NASA Astrophysics Data System (ADS)
Feng, Xiaobing; Wang, Xiaofan
Although recently there are extensive research on currency network using minimum spanning trees approach, the knowledge about the actual evolution of a currency web in Asia is still limited. In the paper, we study the structural evolution of an Asian network using daily exchange rate data. It was found that the correlation between Asian currencies and US Dollar, the previous regional key currency has become weaker and the intra-Asia interactions have increased. This becomes more salient after the exchange rate reform of China. Different from the previous studies, we further reveal that it is the trade volume, national wealth gap and countries growth cycle that has contributed to the evolutionary topology of the minimum spanning tree. These findings provide a valuable platform for theoretical modeling and further analysis.
Evolutionary Dynamics of Collective Action in Structured Populations
NASA Astrophysics Data System (ADS)
Santos, Marta Daniela de Almeida
The pervasiveness of cooperation in Nature is not easily explained. If evolution is characterized by competition and survival of the fittest, why should selfish individuals cooperate with each other? Evolutionary Game Theory (EGT) provides a suitable mathematical framework to study this problem, central to many areas of science. Conventionally, interactions between individuals are modeled in terms of one-shot, symmetric 2-Person Dilemmas of Cooperation, but many real-life situations involve decisions within groups with more than 2 individuals, which are best-dealt in the framework of N-Person games. In this Thesis, we investigate the evolutionary dynamics of two paradigmatic collective social dilemmas - the N-Person Prisoner's Dilemma (NPD) and the N-Person Snowdrift Game (NSG) on structured populations, modeled by networks with diverse topological properties. Cooperative strategies are just one example of the many traits that can be transmitted on social networks. Several recent studies based on empirical evidence from a medical database have suggested the existence of a 3 degrees of influence rule, according to which not only our "friends", but also our friends' friends, and our friends' friends' friends, have a non-trivial influence on our decisions. We investigate the degree of peer influence that emerges from the spread of cooperative strategies, opinions and diseases on populations with distinct underlying networks of contacts. Our results show that networks naturally entangle individuals into interactions of many-body nature and that for each network class considered different processes lead to identical degrees of influence. None
Evolutionary image simplification for lung nodule classification with convolutional neural networks.
Lückehe, Daniel; von Voigt, Gabriele
2018-05-29
Understanding decisions of deep learning techniques is important. Especially in the medical field, the reasons for a decision in a classification task are as crucial as the pure classification results. In this article, we propose a new approach to compute relevant parts of a medical image. Knowing the relevant parts makes it easier to understand decisions. In our approach, a convolutional neural network is employed to learn structures of images of lung nodules. Then, an evolutionary algorithm is applied to compute a simplified version of an unknown image based on the learned structures by the convolutional neural network. In the simplified version, irrelevant parts are removed from the original image. In the results, we show simplified images which allow the observer to focus on the relevant parts. In these images, more than 50% of the pixels are simplified. The simplified pixels do not change the meaning of the images based on the learned structures by the convolutional neural network. An experimental analysis shows the potential of the approach. Besides the examples of simplified images, we analyze the run time development. Simplified images make it easier to focus on relevant parts and to find reasons for a decision. The combination of an evolutionary algorithm employing a learned convolutional neural network is well suited for the simplification task. From a research perspective, it is interesting which areas of the images are simplified and which parts are taken as relevant.
Stochastic win-stay-lose-shift strategy with dynamic aspirations in evolutionary social dilemmas
NASA Astrophysics Data System (ADS)
Amaral, Marco A.; Wardil, Lucas; Perc, Matjaž; da Silva, Jafferson K. L.
2016-09-01
In times of plenty expectations rise, just as in times of crisis they fall. This can be mathematically described as a win-stay-lose-shift strategy with dynamic aspiration levels, where individuals aspire to be as wealthy as their average neighbor. Here we investigate this model in the realm of evolutionary social dilemmas on the square lattice and scale-free networks. By using the master equation and Monte Carlo simulations, we find that cooperators coexist with defectors in the whole phase diagram, even at high temptations to defect. We study the microscopic mechanism that is responsible for the striking persistence of cooperative behavior and find that cooperation spreads through second-order neighbors, rather than by means of network reciprocity that dominates in imitation-based models. For the square lattice the master equation can be solved analytically in the large temperature limit of the Fermi function, while for other cases the resulting differential equations must be solved numerically. Either way, we find good qualitative agreement with the Monte Carlo simulation results. Our analysis also reveals that the evolutionary outcomes are to a large degree independent of the network topology, including the number of neighbors that are considered for payoff determination on lattices, which further corroborates the local character of the microscopic dynamics. Unlike large-scale spatial patterns that typically emerge due to network reciprocity, here local checkerboard-like patterns remain virtually unaffected by differences in the macroscopic properties of the interaction network.
Badyaev, Alexander V; Morrison, Erin S; Belloni, Virginia; Sanderson, Michael J
2015-08-20
Resolution of the link between micro- and macroevolution calls for comparing both processes on the same deterministic landscape, such as genomic, metabolic or fitness networks. We apply this perspective to the evolution of carotenoid pigmentation that produces spectacular diversity in avian colors and show that basic structural properties of the underlying carotenoid metabolic network are reflected in global patterns of elaboration and diversification in color displays. Birds color themselves by consuming and metabolizing several dietary carotenoids from the environment. Such fundamental dependency on the most upstream external compounds should intrinsically constrain sustained evolutionary elongation of multi-step metabolic pathways needed for color elaboration unless the metabolic network gains robustness - the ability to synthesize the same carotenoid from an additional dietary starting point. We found that gains and losses of metabolic robustness were associated with evolutionary cycles of elaboration and stasis in expressed carotenoids in birds. Lack of metabolic robustness constrained lineage's metabolic explorations to the immediate biochemical vicinity of their ecologically distinct dietary carotenoids, whereas gains of robustness repeatedly resulted in sustained elongation of metabolic pathways on evolutionary time scales and corresponding color elaboration. The structural link between length and robustness in metabolic pathways may explain periodic convergence of phylogenetically distant and ecologically distinct species in expressed carotenoid pigmentation; account for stasis in carotenoid colors in some ecological lineages; and show how the connectivity of the underlying metabolic network provides a mechanistic link between microevolutionary elaboration and macroevolutionary diversification.
Gene regulatory and signaling networks exhibit distinct topological distributions of motifs
NASA Astrophysics Data System (ADS)
Ferreira, Gustavo Rodrigues; Nakaya, Helder Imoto; Costa, Luciano da Fontoura
2018-04-01
The biological processes of cellular decision making and differentiation involve a plethora of signaling pathways and gene regulatory circuits. These networks in turn exhibit a multitude of motifs playing crucial parts in regulating network activity. Here we compare the topological placement of motifs in gene regulatory and signaling networks and observe that it suggests different evolutionary strategies in motif distribution for distinct cellular subnetworks.
Holden, Brian J; Pinney, John W; Lovell, Simon C; Amoutzias, Grigoris D; Robertson, David L
2007-01-01
Background Alternative representations of biochemical networks emphasise different aspects of the data and contribute to the understanding of complex biological systems. In this study we present a variety of automated methods for visualisation of a protein-protein interaction network, using the basic helix-loop-helix (bHLH) family of transcription factors as an example. Results Network representations that arrange nodes (proteins) according to either continuous or discrete information are investigated, revealing the existence of protein sub-families and the retention of interactions following gene duplication events. Methods of network visualisation in conjunction with a phylogenetic tree are presented, highlighting the evolutionary relationships between proteins, and clarifying the context of network hubs and interaction clusters. Finally, an optimisation technique is used to create a three-dimensional layout of the phylogenetic tree upon which the protein-protein interactions may be projected. Conclusion We show that by incorporating secondary genomic, functional or phylogenetic information into network visualisation, it is possible to move beyond simple layout algorithms based on network topology towards more biologically meaningful representations. These new visualisations can give structure to complex networks and will greatly help in interpreting their evolutionary origins and functional implications. Three open source software packages (InterView, TVi and OptiMage) implementing our methods are available. PMID:17683601
Analyzing GAIAN Database (GaianDB) on a Tactical Network
2015-11-30
we connected 3 Raspberry Pi’s running GaianDB and our augmented version of splatform to a network of 3 CSRs. The Raspberry Pi is a low power, low...based on Debian from a connected secure digital high capacity (SDHC) card or a universal serial bus (USB) device. The Raspberry Pi comes equipped with...requirements, capabilities, and cost make the Raspberry Pi a useful device for sensor experimentation. From there, we performed 3 types of benchmarks
High Speed All-Optical Data Distribution Network
NASA Astrophysics Data System (ADS)
Braun, Steve; Hodara, Henri
2017-11-01
This article describes the performance and capabilities of an all-optical network featuring low latency, high speed file transfer between serially connected optical nodes. A basic component of the network is a network interface card (NIC) implemented through a unique planar lightwave circuit (PLC) that performs add/drop data and optical signal amplification. The network uses a linear bus topology with nodes in a "T" configuration, as described in the text. The signal is sent optically (hence, no latency) to all nodes via wavelength division multiplexing (WDM), with each node receiver tuned to wavelength of choice via an optical de-multiplexer. Each "T" node routes a portion of the signal to/from the bus through optical couplers, embedded in the network interface card (NIC), to each of the 1 through n computers.
Quantifying a Negative: How Homeland Security Adds Value
2015-12-01
access to future victims. The Law Enforcement agency could then identifying and quantifying the value of future crimes. For example, if a serial ... killer is captured with evidence of the next victim or an established pattern of victimization, network theory could be used to identify the next
Have You Got What It Takes...And Are You Using All You Could?
ERIC Educational Resources Information Center
Dyer, Hilary
1994-01-01
Suggests ways of using personal computers in special libraries, including online searching; CD-ROM networks; reference work; current awareness services; press cuttings services; selective dissemination of information; local databases; object linking and embedding; cataloging; acquisitions; circulation; serials control; interlibrary loan; space…
NASA Astrophysics Data System (ADS)
Chiesl, T. N.; Benhabib, M.; Stockton, A. M.; Mathies, R. A.
2010-04-01
We present the Multichannel Mars Organic Analyzer (McMOA) for the analysis of Amino Acids, PAHs, and Oxidized Carbon. Microfluidic architecures integrating automated metering, mixing, on chip reactions, and serial dilutions are also discussed.
Lindy B. Mullen; H. Arthur Woods; Michael K. Schwartz; Adam J. Sepulveda; Winsor H. Lowe
2010-01-01
The network architecture of streams and rivers constrains evolutionary, demographic and ecological processes of freshwater organisms. This consistent architecture also makes stream networks useful for testing general models of population genetic structure and the scaling of gene flow. We examined genetic structure and gene flow in the facultatively paedomorphic Idaho...
Caudell, Thomas P; Xiao, Yunhai; Healy, Michael J
2003-01-01
eLoom is an open source graph simulation software tool, developed at the University of New Mexico (UNM), that enables users to specify and simulate neural network models. Its specification language and libraries enables users to construct and simulate arbitrary, potentially hierarchical network structures on serial and parallel processing systems. In addition, eLoom is integrated with UNM's Flatland, an open source virtual environments development tool to provide real-time visualizations of the network structure and activity. Visualization is a useful method for understanding both learning and computation in artificial neural networks. Through 3D animated pictorially representations of the state and flow of information in the network, a better understanding of network functionality is achieved. ART-1, LAPART-II, MLP, and SOM neural networks are presented to illustrate eLoom and Flatland's capabilities.
Back to the future: Rational maps for exploring acetylcholine receptor space and time.
Tessier, Christian J G; Emlaw, Johnathon R; Cao, Zhuo Qian; Pérez-Areales, F Javier; Salameh, Jean-Paul J; Prinston, Jethro E; McNulty, Melissa S; daCosta, Corrie J B
2017-11-01
Global functions of nicotinic acetylcholine receptors, such as subunit cooperativity and compatibility, likely emerge from a network of amino acid residues distributed across the entire pentameric complex. Identification of such networks has stymied traditional approaches to acetylcholine receptor structure and function, likely due to the cryptic interdependency of their underlying amino acid residues. An emerging evolutionary biochemistry approach, which traces the evolutionary history of acetylcholine receptor subunits, allows for rational mapping of acetylcholine receptor sequence space, and offers new hope for uncovering the amino acid origins of these enigmatic properties. Copyright © 2017 Elsevier B.V. All rights reserved.
A consensus opinion model based on the evolutionary game
NASA Astrophysics Data System (ADS)
Yang, Han-Xin
2016-08-01
We propose a consensus opinion model based on the evolutionary game. In our model, both of the two connected agents receive a benefit if they have the same opinion, otherwise they both pay a cost. Agents update their opinions by comparing payoffs with neighbors. The opinion of an agent with higher payoff is more likely to be imitated. We apply this model in scale-free networks with tunable degree distribution. Interestingly, we find that there exists an optimal ratio of cost to benefit, leading to the shortest consensus time. Qualitative analysis is obtained by examining the evolution of the opinion clusters. Moreover, we find that the consensus time decreases as the average degree of the network increases, but increases with the noise introduced to permit irrational choices. The dependence of the consensus time on the network size is found to be a power-law form. For small or larger ratio of cost to benefit, the consensus time decreases as the degree exponent increases. However, for moderate ratio of cost to benefit, the consensus time increases with the degree exponent. Our results may provide new insights into opinion dynamics driven by the evolutionary game theory.
Punctuated equilibrium in the large-scale evolution of programming languages†
Valverde, Sergi; Solé, Ricard V.
2015-01-01
The analogies and differences between biological and cultural evolution have been explored by evolutionary biologists, historians, engineers and linguists alike. Two well-known domains of cultural change are language and technology. Both share some traits relating the evolution of species, but technological change is very difficult to study. A major challenge in our way towards a scientific theory of technological evolution is how to properly define evolutionary trees or clades and how to weight the role played by horizontal transfer of information. Here, we study the large-scale historical development of programming languages, which have deeply marked social and technological advances in the last half century. We analyse their historical connections using network theory and reconstructed phylogenetic networks. Using both data analysis and network modelling, it is shown that their evolution is highly uneven, marked by innovation events where new languages are created out of improved combinations of different structural components belonging to previous languages. These radiation events occur in a bursty pattern and are tied to novel technological and social niches. The method can be extrapolated to other systems and consistently captures the major classes of languages and the widespread horizontal design exchanges, revealing a punctuated evolutionary path. PMID:25994298
Alignment-free protein interaction network comparison
Ali, Waqar; Rito, Tiago; Reinert, Gesine; Sun, Fengzhu; Deane, Charlotte M.
2014-01-01
Motivation: Biological network comparison software largely relies on the concept of alignment where close matches between the nodes of two or more networks are sought. These node matches are based on sequence similarity and/or interaction patterns. However, because of the incomplete and error-prone datasets currently available, such methods have had limited success. Moreover, the results of network alignment are in general not amenable for distance-based evolutionary analysis of sets of networks. In this article, we describe Netdis, a topology-based distance measure between networks, which offers the possibility of network phylogeny reconstruction. Results: We first demonstrate that Netdis is able to correctly separate different random graph model types independent of network size and density. The biological applicability of the method is then shown by its ability to build the correct phylogenetic tree of species based solely on the topology of current protein interaction networks. Our results provide new evidence that the topology of protein interaction networks contains information about evolutionary processes, despite the lack of conservation of individual interactions. As Netdis is applicable to all networks because of its speed and simplicity, we apply it to a large collection of biological and non-biological networks where it clusters diverse networks by type. Availability and implementation: The source code of the program is freely available at http://www.stats.ox.ac.uk/research/proteins/resources. Contact: w.ali@stats.ox.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25161230
Origin, development, and evolution of butterfly eyespots.
Monteiro, Antónia
2015-01-07
This article reviews the latest developments in our understanding of the origin, development, and evolution of nymphalid butterfly eyespots. Recent contributions to this field include insights into the evolutionary and developmental origin of eyespots and their ancestral deployment on the wing, the evolution of eyespot number and eyespot sexual dimorphism, and the identification of genes affecting eyespot development and black pigmentation. I also compare features of old and more recently proposed models of eyespot development and propose a schematic for the genetic regulatory architecture of eyespots. Using this schematic I propose two hypotheses for why we observe limits to morphological diversity across these serially homologous traits.
Spatial operator algebra framework for multibody system dynamics
NASA Technical Reports Server (NTRS)
Rodriguez, G.; Jain, Abhinandan; Kreutz, K.
1989-01-01
The Spatial Operator Algebra framework for the dynamics of general multibody systems is described. The use of a spatial operator-based methodology permits the formulation of the dynamical equations of motion of multibody systems in a concise and systematic way. The dynamical equations of progressively more complex grid multibody systems are developed in an evolutionary manner beginning with a serial chain system, followed by a tree topology system and finally, systems with arbitrary closed loops. Operator factorizations and identities are used to develop novel recursive algorithms for the forward dynamics of systems with closed loops. Extensions required to deal with flexible elements are also discussed.
Spatial Operator Algebra for multibody system dynamics
NASA Technical Reports Server (NTRS)
Rodriguez, G.; Jain, A.; Kreutz-Delgado, K.
1992-01-01
The Spatial Operator Algebra framework for the dynamics of general multibody systems is described. The use of a spatial operator-based methodology permits the formulation of the dynamical equations of motion of multibody systems in a concise and systematic way. The dynamical equations of progressively more complex grid multibody systems are developed in an evolutionary manner beginning with a serial chain system, followed by a tree topology system and finally, systems with arbitrary closed loops. Operator factorizations and identities are used to develop novel recursive algorithms for the forward dynamics of systems with closed loops. Extensions required to deal with flexible elements are also discussed.
Getting a better picture of microbial evolution en route to a network of genomes.
Dagan, Tal; Martin, William
2009-08-12
Most current thinking about evolution is couched in the concept of trees. The notion of a tree with recursively bifurcating branches representing recurrent divergence events is a plausible metaphor to describe the evolution of multicellular organisms like vertebrates or land plants. But if we try to force the tree metaphor onto the whole of the evolutionary process, things go badly awry, because the more closely we inspect microbial genomes through the looking glass of gene and genome sequence comparisons, the smaller the amount of the data that fits the concept of a bifurcating tree becomes. That is mainly because among microbes, endosymbiosis and lateral gene transfer are important, two mechanisms of natural variation that differ from the kind of natural variation that Darwin had in mind. For such reasons, when it comes to discussing the relationships among all living things, that is, including the microbes and all of their genes rather than just one or a select few, many biologists are now beginning to talk about networks rather than trees in the context of evolutionary relationships among microbial chromosomes. But talk is not enough. If we were to actually construct networks instead of trees to describe the evolutionary process, what would they look like? Here we consider endosymbiosis and an example of a network of genomes involving 181 sequenced prokaryotes and how that squares off with some ideas about early cell evolution.
Clustering in large networks does not promote upstream reciprocity.
Masuda, Naoki
2011-01-01
Upstream reciprocity (also called generalized reciprocity) is a putative mechanism for cooperation in social dilemma situations with which players help others when they are helped by somebody else. It is a type of indirect reciprocity. Although upstream reciprocity is often observed in experiments, most theories suggest that it is operative only when players form short cycles such as triangles, implying a small population size, or when it is combined with other mechanisms that promote cooperation on their own. An expectation is that real social networks, which are known to be full of triangles and other short cycles, may accommodate upstream reciprocity. In this study, I extend the upstream reciprocity game proposed for a directed cycle by Boyd and Richerson to the case of general networks. The model is not evolutionary and concerns the conditions under which the unanimity of cooperative players is a Nash equilibrium. I show that an abundance of triangles or other short cycles in a network does little to promote upstream reciprocity. Cooperation is less likely for a larger population size even if triangles are abundant in the network. In addition, in contrast to the results for evolutionary social dilemma games on networks, scale-free networks lead to less cooperation than networks with a homogeneous degree distribution.
Clustering in Large Networks Does Not Promote Upstream Reciprocity
Masuda, Naoki
2011-01-01
Upstream reciprocity (also called generalized reciprocity) is a putative mechanism for cooperation in social dilemma situations with which players help others when they are helped by somebody else. It is a type of indirect reciprocity. Although upstream reciprocity is often observed in experiments, most theories suggest that it is operative only when players form short cycles such as triangles, implying a small population size, or when it is combined with other mechanisms that promote cooperation on their own. An expectation is that real social networks, which are known to be full of triangles and other short cycles, may accommodate upstream reciprocity. In this study, I extend the upstream reciprocity game proposed for a directed cycle by Boyd and Richerson to the case of general networks. The model is not evolutionary and concerns the conditions under which the unanimity of cooperative players is a Nash equilibrium. I show that an abundance of triangles or other short cycles in a network does little to promote upstream reciprocity. Cooperation is less likely for a larger population size even if triangles are abundant in the network. In addition, in contrast to the results for evolutionary social dilemma games on networks, scale-free networks lead to less cooperation than networks with a homogeneous degree distribution. PMID:21998641
Effective seeding strategy in evolutionary prisoner's dilemma games on online social networks
NASA Astrophysics Data System (ADS)
Xu, Bo; Shi, Huibin; Wang, Jianwei; Huang, Yun
2015-04-01
This paper explores effective seeding strategies in prisoner's dilemma game (PDG) on online social networks, i.e. the optimal strategy to obtain global cooperation with minimum cost. Three distinct seeding strategies are compared by performing computer simulations on real online social network datasets. Our finding suggests that degree centrality seeding outperforms other strategies regardless of the initial payoff setting or network size. Celebrities of online social networks play key roles in preserving cooperation.
Kumar, Avishek; Butler, Brandon M; Kumar, Sudhir; Ozkan, S Banu
2015-12-01
Sequencing technologies are revealing many new non-synonymous single nucleotide variants (nsSNVs) in each personal exome. To assess their functional impacts, comparative genomics is frequently employed to predict if they are benign or not. However, evolutionary analysis alone is insufficient, because it misdiagnoses many disease-associated nsSNVs, such as those at positions involved in protein interfaces, and because evolutionary predictions do not provide mechanistic insights into functional change or loss. Structural analyses can aid in overcoming both of these problems by incorporating conformational dynamics and allostery in nSNV diagnosis. Finally, protein-protein interaction networks using systems-level methodologies shed light onto disease etiology and pathogenesis. Bridging these network approaches with structurally resolved protein interactions and dynamics will advance genomic medicine. Copyright © 2015 Elsevier Ltd. All rights reserved.
Spatial serial order processing in schizophrenia.
Fraser, David; Park, Sohee; Clark, Gina; Yohanna, Daniel; Houk, James C
2004-10-01
The aim of this study was to examine serial order processing deficits in 21 schizophrenia patients and 16 age- and education-matched healthy controls. In a spatial serial order working memory task, one to four spatial targets were presented in a randomized sequence. Subjects were required to remember the locations and the order in which the targets were presented. Patients showed a marked deficit in ability to remember the sequences compared with controls. Increasing the number of targets within a sequence resulted in poorer memory performance for both control and schizophrenia subjects, but the effect was much more pronounced in the patients. Targets presented at the end of a long sequence were more vulnerable to memory error in schizophrenia patients. Performance deficits were not attributable to motor errors, but to errors in target choice. The results support the idea that the memory errors seen in schizophrenia patients may be due to saturating the working memory network at relatively low levels of memory load.
INFO RELEASE. National Information Network for Recreation, Leisure and Sport.
ERIC Educational Resources Information Center
Sharma, Vidya S.
A study by the Northern Territories Department of Community Development systematically and specifically identified information needs and categories of clients through a set of intellectual concepts in the fields of sport, recreation, and leisure. A survey of Australia's serials holdings was conducted to assess the country's existing information…
Core Serial Titles in an Interdisciplinary Field: The Case of Environmental Geology.
ERIC Educational Resources Information Center
Zipp, Louise S.
1999-01-01
Identifies core journals in environmental geology and explores facets of interdisciplinarity to consider the visibility of this field to collection-development librarians. Intercitation analysis of citing and cited patterns in 1995 articles revealed the journal network of environmental geology. Titles clustered into three categories:…
For All of Us? A Report on the 12th National Cataloguing Conference, Canberra, 1997.
ERIC Educational Resources Information Center
Naun, Chew Chiat
1997-01-01
Provides an overview of the 1997 national cataloging conference of the Australian Library and Information Association (ALIA). Topics include innovation and enervation, cataloging skills for electronic documents, the Anglo-American Cataloging Rules, content versus carrier, issues related to seriality, networking, human resource management, career…
Single- and Multiple-Objective Optimization with Differential Evolution and Neural Networks
NASA Technical Reports Server (NTRS)
Rai, Man Mohan
2006-01-01
Genetic and evolutionary algorithms have been applied to solve numerous problems in engineering design where they have been used primarily as optimization procedures. These methods have an advantage over conventional gradient-based search procedures became they are capable of finding global optima of multi-modal functions and searching design spaces with disjoint feasible regions. They are also robust in the presence of noisy data. Another desirable feature of these methods is that they can efficiently use distributed and parallel computing resources since multiple function evaluations (flow simulations in aerodynamics design) can be performed simultaneously and independently on ultiple processors. For these reasons genetic and evolutionary algorithms are being used more frequently in design optimization. Examples include airfoil and wing design and compressor and turbine airfoil design. They are also finding increasing use in multiple-objective and multidisciplinary optimization. This lecture will focus on an evolutionary method that is a relatively new member to the general class of evolutionary methods called differential evolution (DE). This method is easy to use and program and it requires relatively few user-specified constants. These constants are easily determined for a wide class of problems. Fine-tuning the constants will off course yield the solution to the optimization problem at hand more rapidly. DE can be efficiently implemented on parallel computers and can be used for continuous, discrete and mixed discrete/continuous optimization problems. It does not require the objective function to be continuous and is noise tolerant. DE and applications to single and multiple-objective optimization will be included in the presentation and lecture notes. A method for aerodynamic design optimization that is based on neural networks will also be included as a part of this lecture. The method offers advantages over traditional optimization methods. It is more flexible than other methods in dealing with design in the context of both steady and unsteady flows, partial and complete data sets, combined experimental and numerical data, inclusion of various constraints and rules of thumb, and other issues that characterize the aerodynamic design process. Neural networks provide a natural framework within which a succession of numerical solutions of increasing fidelity, incorporating more realistic flow physics, can be represented and utilized for optimization. Neural networks also offer an excellent framework for multiple-objective and multi-disciplinary design optimization. Simulation tools from various disciplines can be integrated within this framework and rapid trade-off studies involving one or many disciplines can be performed. The prospect of combining neural network based optimization methods and evolutionary algorithms to obtain a hybrid method with the best properties of both methods will be included in this presentation. Achieving solution diversity and accurate convergence to the exact Pareto front in multiple objective optimization usually requires a significant computational effort with evolutionary algorithms. In this lecture we will also explore the possibility of using neural networks to obtain estimates of the Pareto optimal front using non-dominated solutions generated by DE as training data. Neural network estimators have the potential advantage of reducing the number of function evaluations required to obtain solution accuracy and diversity, thus reducing cost to design.
Ma, Jingjing; Liu, Jie; Ma, Wenping; Gong, Maoguo; Jiao, Licheng
2014-01-01
Community structure is one of the most important properties in social networks. In dynamic networks, there are two conflicting criteria that need to be considered. One is the snapshot quality, which evaluates the quality of the community partitions at the current time step. The other is the temporal cost, which evaluates the difference between communities at different time steps. In this paper, we propose a decomposition-based multiobjective community detection algorithm to simultaneously optimize these two objectives to reveal community structure and its evolution in dynamic networks. It employs the framework of multiobjective evolutionary algorithm based on decomposition to simultaneously optimize the modularity and normalized mutual information, which quantitatively measure the quality of the community partitions and temporal cost, respectively. A local search strategy dealing with the problem-specific knowledge is incorporated to improve the effectiveness of the new algorithm. Experiments on computer-generated and real-world networks demonstrate that the proposed algorithm can not only find community structure and capture community evolution more accurately, but also be steadier than the two compared algorithms. PMID:24723806
Ma, Jingjing; Liu, Jie; Ma, Wenping; Gong, Maoguo; Jiao, Licheng
2014-01-01
Community structure is one of the most important properties in social networks. In dynamic networks, there are two conflicting criteria that need to be considered. One is the snapshot quality, which evaluates the quality of the community partitions at the current time step. The other is the temporal cost, which evaluates the difference between communities at different time steps. In this paper, we propose a decomposition-based multiobjective community detection algorithm to simultaneously optimize these two objectives to reveal community structure and its evolution in dynamic networks. It employs the framework of multiobjective evolutionary algorithm based on decomposition to simultaneously optimize the modularity and normalized mutual information, which quantitatively measure the quality of the community partitions and temporal cost, respectively. A local search strategy dealing with the problem-specific knowledge is incorporated to improve the effectiveness of the new algorithm. Experiments on computer-generated and real-world networks demonstrate that the proposed algorithm can not only find community structure and capture community evolution more accurately, but also be steadier than the two compared algorithms.
A controllable sensor management algorithm capable of learning
NASA Astrophysics Data System (ADS)
Osadciw, Lisa A.; Veeramacheneni, Kalyan K.
2005-03-01
Sensor management technology progress is challenged by the geographic space it spans, the heterogeneity of the sensors, and the real-time timeframes within which plans controlling the assets are executed. This paper presents a new sensor management paradigm and demonstrates its application in a sensor management algorithm designed for a biometric access control system. This approach consists of an artificial intelligence (AI) algorithm focused on uncertainty measures, which makes the high level decisions to reduce uncertainties and interfaces with the user, integrated cohesively with a bottom up evolutionary algorithm, which optimizes the sensor network"s operation as determined by the AI algorithm. The sensor management algorithm presented is composed of a Bayesian network, the AI algorithm component, and a swarm optimization algorithm, the evolutionary algorithm. Thus, the algorithm can change its own performance goals in real-time and will modify its own decisions based on observed measures within the sensor network. The definition of the measures as well as the Bayesian network determine the robustness of the algorithm and its utility in reacting dynamically to changes in the global system.
The Effects of Sacred Value Networks Within an Evolutionary, Adversarial Game
NASA Astrophysics Data System (ADS)
McCalla, Scott G.; Short, Martin B.; Brantingham, P. Jeffrey
2013-05-01
The effects of personal relationships and shared ideologies on levels of crime and the formation of criminal coalitions are studied within the context of an adversarial, evolutionary game first introduced in Short et al. (Phys. Rev. E 82:066114, 2010). Here, we interpret these relationships as connections on a graph of N players. These connections are then used in a variety of ways to define each player's "sacred value network"—groups of individuals that are subject to special consideration or treatment by that player. We explore the effects on the dynamics of the system that these networks introduce, through various forms of protection from both victimization and punishment. Under local protection, these networks introduce a new fixed point within the game dynamics, which we find through a continuum approximation of the discrete game. Under more complicated, extended protection, we numerically observe the emergence of criminal coalitions, or "gangs". We also find that a high-crime steady state is much more frequent in the context of extended protection networks, in both the case of Erdős-Rényi and small world random graphs.
Criticality Is an Emergent Property of Genetic Networks that Exhibit Evolvability
Torres-Sosa, Christian; Huang, Sui; Aldana, Maximino
2012-01-01
Accumulating experimental evidence suggests that the gene regulatory networks of living organisms operate in the critical phase, namely, at the transition between ordered and chaotic dynamics. Such critical dynamics of the network permits the coexistence of robustness and flexibility which are necessary to ensure homeostatic stability (of a given phenotype) while allowing for switching between multiple phenotypes (network states) as occurs in development and in response to environmental change. However, the mechanisms through which genetic networks evolve such critical behavior have remained elusive. Here we present an evolutionary model in which criticality naturally emerges from the need to balance between the two essential components of evolvability: phenotype conservation and phenotype innovation under mutations. We simulated the Darwinian evolution of random Boolean networks that mutate gene regulatory interactions and grow by gene duplication. The mutating networks were subjected to selection for networks that both (i) preserve all the already acquired phenotypes (dynamical attractor states) and (ii) generate new ones. Our results show that this interplay between extending the phenotypic landscape (innovation) while conserving the existing phenotypes (conservation) suffices to cause the evolution of all the networks in a population towards criticality. Furthermore, the networks produced by this evolutionary process exhibit structures with hubs (global regulators) similar to the observed topology of real gene regulatory networks. Thus, dynamical criticality and certain elementary topological properties of gene regulatory networks can emerge as a byproduct of the evolvability of the phenotypic landscape. PMID:22969419
Ghosh, Ranadhir; Yearwood, John; Ghosh, Moumita; Bagirov, Adil
2006-06-01
In this paper we investigate a hybrid model based on the Discrete Gradient method and an evolutionary strategy for determining the weights in a feed forward artificial neural network. Also we discuss different variants for hybrid models using the Discrete Gradient method and an evolutionary strategy for determining the weights in a feed forward artificial neural network. The Discrete Gradient method has the advantage of being able to jump over many local minima and find very deep local minima. However, earlier research has shown that a good starting point for the discrete gradient method can improve the quality of the solution point. Evolutionary algorithms are best suited for global optimisation problems. Nevertheless they are cursed with longer training times and often unsuitable for real world application. For optimisation problems such as weight optimisation for ANNs in real world applications the dimensions are large and time complexity is critical. Hence the idea of a hybrid model can be a suitable option. In this paper we propose different fusion strategies for hybrid models combining the evolutionary strategy with the discrete gradient method to obtain an optimal solution much quicker. Three different fusion strategies are discussed: a linear hybrid model, an iterative hybrid model and a restricted local search hybrid model. Comparative results on a range of standard datasets are provided for different fusion hybrid models.
Adding HDLC Framing to CCSDS Recommendations
NASA Technical Reports Server (NTRS)
Hogie, Keith; Criscuolo, Ed; Parise, Ron
2004-01-01
Current Space IP missions use High-Level Data Link Control (HDLC) framing to provide standard serial link interfaces over a space link. HDLC is the standard framing technique used by all routers over clock and data serial lines and is also the basic framing used in all Frame Relay services which are widely deployed in national and international communication networks. In late 2003 a presentation was made to CCSDS committees to initiate discussion on including HDLC in the CCSDS recommendations for space systems. This presentation will summarize the differences between variable length HDLC frames and fixed length CCSDS frames. It will also discuss where and how HDLC framing would fit into the overall CCSDS structures.
NASA Astrophysics Data System (ADS)
Marconi, S.; Orfanelli, S.; Karagounis, M.; Hemperek, T.; Christiansen, J.; Placidi, P.
2017-02-01
A dedicated power analysis methodology, based on modern digital design tools and integrated with the VEPIX53 simulation framework developed within RD53 collaboration, is being used to guide vital choices for the design and optimization of the next generation ATLAS and CMS pixel chips and their critical serial powering circuit (shunt-LDO). Power consumption is studied at different stages of the design flow under different operating conditions. Significant effort is put into extensive investigations of dynamic power variations in relation with the decoupling seen by the powering network. Shunt-LDO simulations are also reported to prove the reliability at the system level.
Can Multilayer Networks Advance Animal Behavior Research?
Silk, Matthew J; Finn, Kelly R; Porter, Mason A; Pinter-Wollman, Noa
2018-06-01
Interactions among individual animals - and between these individuals and their environment - yield complex, multifaceted systems. The development of multilayer network analysis offers a promising new approach for studying animal social behavior and its relation to eco-evolutionary dynamics. Copyright © 2018 Elsevier Ltd. All rights reserved.
Multi-level human evolution: ecological patterns in hominin phylogeny.
Parravicini, Andrea; Pievani, Telmo
2016-06-20
Evolution is a process that occurs at many different levels, from genes to ecosystems. Genetic variations and ecological pressures are hence two sides of the same coin; but due both to fragmentary evidence and to the influence of a gene-centered and gradualistic approach to evolutionary phenomena, the field of paleoanthropology has been slow to take the role of macro-evolutionary patterns (i.e. ecological and biogeographical at large scale) seriously. However, several very recent findings in paleoanthropology stress both climate instability and ecological disturbance as key factors affecting the highly branching hominin phylogeny, from the earliest hominins to the appearance of cognitively modern humans. Allopatric speciation due to geographic displacement, turnover-pulses of species, adaptive radiation, mosaic evolution of traits in several coeval species, bursts of behavioral innovation, serial dispersals out of Africa, are just some of the macro-evolutionary patterns emerging from the field. The multilevel approach to evolution proposed by paleontologist Niles Eldredge is adopted here as interpretative tool, and has yielded a larger picture of human evolution that integrates different levels of evolutionary change, from local adaptations in limited ecological niches to dispersal phenotypes able to colonize an unprecedented range of ecosystems. Changes in global climate and Earth's surface most greatly affected human evolution. Precisely because it is cognitively hard for us to appreciate the long-term common destiny we share with the whole biosphere, it is particularly valuable to highlight the accumulating evidence that human evolution has been deeply affected by global ecological changes that transformed our African continent of origin.
Kim, Seongkyun; Kim, Hyoungkyu; Kralik, Jerald D.; Jeong, Jaeseung
2016-01-01
Determining the fundamental architectural design of complex nervous systems will lead to significant medical and technological advances. Yet it remains unclear how nervous systems evolved highly efficient networks with near optimal sharing of pathways that yet produce multiple distinct behaviors to reach the organism’s goals. To determine this, the nematode roundworm Caenorhabditis elegans is an attractive model system. Progress has been made in delineating the behavioral circuits of the C. elegans, however, many details are unclear, including the specific functions of every neuron and synapse, as well as the extent the behavioral circuits are separate and parallel versus integrative and serial. Network analysis provides a normative approach to help specify the network design. We investigated the vulnerability of the Caenorhabditis elegans connectome by performing computational experiments that (a) “attacked” 279 individual neurons and 2,990 weighted synaptic connections (composed of 6,393 chemical synapses and 890 electrical junctions) and (b) quantified the effects of each removal on global network properties that influence information processing. The analysis identified 12 critical neurons and 29 critical synapses for establishing fundamental network properties. These critical constituents were found to be control elements—i.e., those with the most influence over multiple underlying pathways. Additionally, the critical synapses formed into circuit-level pathways. These emergent pathways provide evidence for (a) the importance of backward locomotion, avoidance behavior, and social feeding behavior to the organism; (b) the potential roles of specific neurons whose functions have been unclear; and (c) both parallel and serial design elements in the connectome—i.e., specific evidence for a mixed architectural design. PMID:27540747
Weßling, Ralf; Epple, Petra; Altmann, Stefan; He, Yijian; Yang, Li; Henz, Stefan R.; McDonald, Nathan; Wiley, Kristin; Bader, Kai Christian; Gläßer, Christine; Mukhtar, M. Shahid; Haigis, Sabine; Ghamsari, Lila; Stephens, Amber E.; Ecker, Joseph R.; Vidal, Marc; Jones, Jonathan D. G.; Mayer, Klaus F. X.; van Themaat, Emiel Ver Loren; Weigel, Detlef; Schulze-Lefert, Paul; Dangl, Jeffery L.; Panstruga, Ralph; Braun, Pascal
2014-01-01
SUMMARY While conceptual principles governing plant immunity are becoming clear, its systems-level organization and the evolutionary dynamic of the host-pathogen interface are still obscure. We generated a systematic protein-protein interaction network of virulence effectors from the ascomycete pathogen Golovinomyces orontii and Arabidopsis thaliana host proteins. We combined this dataset with corresponding data for the eubacterial pathogen Pseudomonas syringae and the oomycete pathogen Hyaloperonospora arabidopsidis. The resulting network identifies host proteins onto which intraspecies and interspecies pathogen effectors converge. Phenotyping of 124 Arabidopsis effector-interactor mutants revealed a correlation between intra- and interspecies convergence and several altered immune response phenotypes. The effectors and most heavily targeted host protein co-localized in sub-nuclear foci. Products of adaptively selected Arabidopsis genes are enriched for interactions with effector targets. Our data suggest the existence of a molecular host-pathogen interface that is conserved across Arabidopsis accessions, while evolutionary adaptation occurs in the immediate network neighborhood of effector targets. PMID:25211078
The maintenance of cooperation in multiplex networks with limited and partible resources of agents
NASA Astrophysics Data System (ADS)
Li, Zhaofeng; Shen, Bi; Jiang, Yichuan
2017-02-01
In this paper, we try to explain the maintenance of cooperation in multiplex networks with limited and partible resources of agents: defection brings larger short-term benefit and cooperative agents may become defective because of the unaffordable costs of cooperative behaviors that are performed in multiple layers simultaneously. Recent studies have identified the positive effects of multiple layers on evolutionary cooperation but generally overlook the maximum costs of agents in these synchronous games. By utilizing network effects and designing evolutionary mechanisms, cooperative behaviors become prevailing in public goods games, and agents can allocate personal resources across multiple layers. First, we generalize degree diversity into multiplex networks to improve the prospect for cooperation. Second, to prevent agents allocating all the resources into one layer, a greedy-first mechanism is proposed, in which agents prefer to add additional investments in the higher-payoff layer. It is found that greedy-first agents can perform cooperative behaviors in multiplex networks when one layer is scale-free network and degree differences between conjoint nodes increase. Our work may help to explain the emergence of cooperation in the absence of individual reputation and punishment mechanisms.
How mutation affects evolutionary games on graphs
Allen, Benjamin; Traulsen, Arne; Tarnita, Corina E.; Nowak, Martin A.
2011-01-01
Evolutionary dynamics are affected by population structure, mutation rates and update rules. Spatial or network structure facilitates the clustering of strategies, which represents a mechanism for the evolution of cooperation. Mutation dilutes this effect. Here we analyze how mutation influences evolutionary clustering on graphs. We introduce new mathematical methods to evolutionary game theory, specifically the analysis of coalescing random walks via generating functions. These techniques allow us to derive exact identity-by-descent (IBD) probabilities, which characterize spatial assortment on lattices and Cayley trees. From these IBD probabilities we obtain exact conditions for the evolution of cooperation and other game strategies, showing the dual effects of graph topology and mutation rate. High mutation rates diminish the clustering of cooperators, hindering their evolutionary success. Our model can represent either genetic evolution with mutation, or social imitation processes with random strategy exploration. PMID:21473871
2007-03-01
Intelligence AIS Artificial Immune System ANN Artificial Neural Networks API Application Programming Interface BFS Breadth-First Search BIS Biological...problem domain is too large for only one algorithm’s application . It ranges from network - based sniffer systems, responsible for Enterprise-wide coverage...options to network administrators in choosing detectors to employ in future ID applications . Objectives Our hypothesis validity is based on a set
Cooperation in memory-based prisoner's dilemma game on interdependent networks
NASA Astrophysics Data System (ADS)
Luo, Chao; Zhang, Xiaolin; Liu, Hong; Shao, Rui
2016-05-01
Memory or so-called experience normally plays the important role to guide the human behaviors in real world, that is essential for rational decisions made by individuals. Hence, when the evolutionary behaviors of players with bounded rationality are investigated, it is reasonable to make an assumption that players in system are with limited memory. Besides, in order to unravel the intricate variability of complex systems in real world and make a highly integrative understanding of their dynamics, in recent years, interdependent networks as a comprehensive network structure have obtained more attention in this community. In this article, the evolution of cooperation in memory-based prisoner's dilemma game (PDG) on interdependent networks composed by two coupled square lattices is studied. Herein, all or part of players are endowed with finite memory ability, and we focus on the mutual influence of memory effect and interdependent network reciprocity on cooperation of spatial PDG. We show that the density of cooperation can be significantly promoted within an optimal region of memory length and interdependent strength. Furthermore, distinguished by whether having memory ability/external links or not, each kind of players on networks would have distinct evolutionary behaviors. Our work could be helpful to understand the emergence and maintenance of cooperation under the evolution of memory-based players on interdependent networks.
Probabilistic Priority Message Checking Modeling Based on Controller Area Networks
NASA Astrophysics Data System (ADS)
Lin, Cheng-Min
Although the probabilistic model checking tool called PRISM has been applied in many communication systems, such as wireless local area network, Bluetooth, and ZigBee, the technique is not used in a controller area network (CAN). In this paper, we use PRISM to model the mechanism of priority messages for CAN because the mechanism has allowed CAN to become the leader in serial communication for automobile and industry control. Through modeling CAN, it is easy to analyze the characteristic of CAN for further improving the security and efficiency of automobiles. The Markov chain model helps us to model the behaviour of priority messages.
Wild cricket social networks show stability across generations.
Fisher, David N; Rodríguez-Muñoz, Rolando; Tregenza, Tom
2016-07-27
A central part of an animal's environment is its interactions with conspecifics. There has been growing interest in the potential to capture these interactions in the form of a social network. Such networks can then be used to examine how relationships among individuals affect ecological and evolutionary processes. However, in the context of selection and evolution, the utility of this approach relies on social network structures persisting across generations. This is an assumption that has been difficult to test because networks spanning multiple generations have not been available. We constructed social networks for six annual generations over a period of eight years for a wild population of the cricket Gryllus campestris. Through the use of exponential random graph models (ERGMs), we found that the networks in any given year were able to predict the structure of networks in other years for some network characteristics. The capacity of a network model of any given year to predict the networks of other years did not depend on how far apart those other years were in time. Instead, the capacity of a network model to predict the structure of a network in another year depended on the similarity in population size between those years. Our results indicate that cricket social network structure resists the turnover of individuals and is stable across generations. This would allow evolutionary processes that rely on network structure to take place. The influence of network size may indicate that scaling up findings on social behaviour from small populations to larger ones will be difficult. Our study also illustrates the utility of ERGMs for comparing networks, a task for which an effective approach has been elusive.
NASA Astrophysics Data System (ADS)
Vivoni, Enrique R.; Mascaro, Giuseppe; Mniszewski, Susan; Fasel, Patricia; Springer, Everett P.; Ivanov, Valeriy Y.; Bras, Rafael L.
2011-10-01
SummaryA major challenge in the use of fully-distributed hydrologic models has been the lack of computational capabilities for high-resolution, long-term simulations in large river basins. In this study, we present the parallel model implementation and real-world hydrologic assessment of the Triangulated Irregular Network (TIN)-based Real-time Integrated Basin Simulator (tRIBS). Our parallelization approach is based on the decomposition of a complex watershed using the channel network as a directed graph. The resulting sub-basin partitioning divides effort among processors and handles hydrologic exchanges across boundaries. Through numerical experiments in a set of nested basins, we quantify parallel performance relative to serial runs for a range of processors, simulation complexities and lengths, and sub-basin partitioning methods, while accounting for inter-run variability on a parallel computing system. In contrast to serial simulations, the parallel model speed-up depends on the variability of hydrologic processes. Load balancing significantly improves parallel speed-up with proportionally faster runs as simulation complexity (domain resolution and channel network extent) increases. The best strategy for large river basins is to combine a balanced partitioning with an extended channel network, with potential savings through a lower TIN resolution. Based on these advances, a wider range of applications for fully-distributed hydrologic models are now possible. This is illustrated through a set of ensemble forecasts that account for precipitation uncertainty derived from a statistical downscaling model.
Topological enslavement in evolutionary games on correlated multiplex networks
NASA Astrophysics Data System (ADS)
Kleineberg, Kaj-Kolja; Helbing, Dirk
2018-05-01
Governments and enterprises strongly rely on incentives to generate favorable outcomes from social and strategic interactions between individuals. The incentives are usually modeled by payoffs in evolutionary games, such as the prisoners dilemma or the harmony game, with imitation dynamics. Adjusting the incentives by changing the payoff parameters can favor cooperation, as found in the harmony game, over defection, which prevails in the prisoner’s dilemma. Here, we show that this is not always the case if individuals engage in strategic interactions in multiple domains. In particular, we investigate evolutionary games on multiplex networks where individuals obtain an aggregate payoff. We explicitly control the strength of degree correlations between nodes in the different layers of the multiplex. We find that if the multiplex is composed of many layers and degree correlations are strong, the topology of the system enslaves the dynamics and the final outcome, cooperation or defection, becomes independent of the payoff parameters. The fate of the system is then determined by the initial conditions.
Multi Sensor Fusion Using Fitness Adaptive Differential Evolution
NASA Astrophysics Data System (ADS)
Giri, Ritwik; Ghosh, Arnob; Chowdhury, Aritra; Das, Swagatam
The rising popularity of multi-source, multi-sensor networks supports real-life applications calls for an efficient and intelligent approach to information fusion. Traditional optimization techniques often fail to meet the demands. The evolutionary approach provides a valuable alternative due to its inherent parallel nature and its ability to deal with difficult problems. We present a new evolutionary approach based on a modified version of Differential Evolution (DE), called Fitness Adaptive Differential Evolution (FiADE). FiADE treats sensors in the network as distributed intelligent agents with various degrees of autonomy. Existing approaches based on intelligent agents cannot completely answer the question of how their agents could coordinate their decisions in a complex environment. The proposed approach is formulated to produce good result for the problems that are high-dimensional, highly nonlinear, and random. The proposed approach gives better result in case of optimal allocation of sensors. The performance of the proposed approach is compared with an evolutionary algorithm coordination generalized particle model (C-GPM).
Acedo-Carmona, Cristina; Gomila, Antoni
2015-11-27
The upper-east and northern regions of Ghana offers a unique opportunity to study the influence of evolutionary social dynamics in making cooperation possible, despite cultural differences. These regions are occupied by several distinct ethnic groups, in interaction, such as the Kussasi, Mamprusi, Bimoba, Konkomba, and Fulani. We will report our fieldwork related to how cooperation takes places there, both within each group and among people from the different groups. Methods included personal networks of cooperation (ego networks), interviews and analysis of group contexts. The most important result is that, while each ethnic group may differ in terms of family and clan structure, a similar pattern can be found in all of them, of cooperation structured around small groups of trust-based close relationships. The study suggests that habitual decisions about cooperation are not strategic or self-interested, but instead are based on unconscious processes sustained by the emotional bonds of trust. These kind of emotional bonds are claimed to be relevant from an evolutionary point of view.
Investigation on Law and Economics Based on Complex Network and Time Series Analysis.
Yang, Jian; Qu, Zhao; Chang, Hui
2015-01-01
The research focuses on the cooperative relationship and the strategy tendency among three mutually interactive parties in financing: small enterprises, commercial banks and micro-credit companies. Complex network theory and time series analysis were applied to figure out the quantitative evidence. Moreover, this paper built up a fundamental model describing the particular interaction among them through evolutionary game. Combining the results of data analysis and current situation, it is justifiable to put forward reasonable legislative recommendations for regulations on lending activities among small enterprises, commercial banks and micro-credit companies. The approach in this research provides a framework for constructing mathematical models and applying econometrics and evolutionary game in the issue of corporation financing.
Neural-network-enhanced evolutionary algorithm applied to supported metal nanoparticles
NASA Astrophysics Data System (ADS)
Kolsbjerg, E. L.; Peterson, A. A.; Hammer, B.
2018-05-01
We show that approximate structural relaxation with a neural network enables orders of magnitude faster global optimization with an evolutionary algorithm in a density functional theory framework. The increased speed facilitates reliable identification of global minimum energy structures, as exemplified by our finding of a hollow Pt13 nanoparticle on an MgO support. We highlight the importance of knowing the correct structure when studying the catalytic reactivity of the different particle shapes. The computational speedup further enables screening of hundreds of different pathways in the search for optimum kinetic transitions between low-energy conformers and hence pushes the limits of the insight into thermal ensembles that can be obtained from theory.
Duchêne, David; Duchêne, Sebastian; Ho, Simon Y W
2015-07-01
Phylogenetic estimation of evolutionary timescales has become routine in biology, forming the basis of a wide range of evolutionary and ecological studies. However, there are various sources of bias that can affect these estimates. We investigated whether tree imbalance, a property that is commonly observed in phylogenetic trees, can lead to reduced accuracy or precision of phylogenetic timescale estimates. We analysed simulated data sets with calibrations at internal nodes and at the tips, taking into consideration different calibration schemes and levels of tree imbalance. We also investigated the effect of tree imbalance on two empirical data sets: mitogenomes from primates and serial samples of the African swine fever virus. In analyses calibrated using dated, heterochronous tips, we found that tree imbalance had a detrimental impact on precision and produced a bias in which the overall timescale was underestimated. A pronounced effect was observed in analyses with shallow calibrations. The greatest decreases in accuracy usually occurred in the age estimates for medium and deep nodes of the tree. In contrast, analyses calibrated at internal nodes did not display a reduction in estimation accuracy or precision due to tree imbalance. Our results suggest that molecular-clock analyses can be improved by increasing taxon sampling, with the specific aims of including deeper calibrations, breaking up long branches and reducing tree imbalance. © 2014 John Wiley & Sons Ltd.
Spontaneous Spatial Mapping of Learned Sequence in Chimpanzees: Evidence for a SNARC-Like Effect
Adachi, Ikuma
2014-01-01
In the last couple of decades, there has been a growing number of reports on space-based representation of numbers and serial order in humans. In the present study, to explore evolutionary origins of such representations, we examined whether our closest evolutionary relatives, chimpanzees, map an acquired sequence onto space in a similar way to humans. The subjects had been trained to perform a number sequence task in which they touched a sequence of “small” to “large” Arabic numerals presented in random locations on the monitor. This task was presented in sessions that also included test trials consisting of only two numerals (1 and 9) horizontally arranged. On half of the trials 1 was located to the left of 9, whereas on the other half 1 was to the right to 9. The Chimpanzees' performance was systematically influenced by the spatial arrangement of the stimuli; specifically, they responded quicker when 1 was on the left and 9 on the right compared to the other way around. This result suggests that chimpanzees, like humans, spontaneously map a learned sequence onto space. PMID:24643044
Evolution and development of brain networks: from Caenorhabditis elegans to Homo sapiens.
Kaiser, Marcus; Varier, Sreedevi
2011-01-01
Neural networks show a progressive increase in complexity during the time course of evolution. From diffuse nerve nets in Cnidaria to modular, hierarchical systems in macaque and humans, there is a gradual shift from simple processes involving a limited amount of tasks and modalities to complex functional and behavioral processing integrating different kinds of information from highly specialized tissue. However, studies in a range of species suggest that fundamental similarities, in spatial and topological features as well as in developmental mechanisms for network formation, are retained across evolution. 'Small-world' topology and highly connected regions (hubs) are prevalent across the evolutionary scale, ensuring efficient processing and resilience to internal (e.g. lesions) and external (e.g. environment) changes. Furthermore, in most species, even the establishment of hubs, long-range connections linking distant components, and a modular organization, relies on similar mechanisms. In conclusion, evolutionary divergence leads to greater complexity while following essential developmental constraints.
Collaboration Networks in the Brazilian Scientific Output in Evolutionary Biology: 2000-2012.
Santin, Dirce M; Vanz, Samile A S; Stumpf, Ida R C
2016-03-01
This article analyzes the existing collaboration networks in the Brazilian scientific output in Evolutionary Biology, considering articles published during the period from 2000 to 2012 in journals indexed by Web of Science. The methodology integrates bibliometric techniques and Social Network Analysis resources to describe the growth of Brazilian scientific output and understand the levels, dynamics and structure of collaboration between authors, institutions and countries. The results unveil an enhancement and consolidation of collaborative relationships over time and suggest the existence of key institutions and authors, whose influence on research is expressed by the variety and intensity of the relationships established in the co-authorship of articles. International collaboration, present in more than half of the publications, is highly significant and unusual in Brazilian science. The situation indicates the internationalization of scientific output and the ability of the field to take part in the science produced by the international scientific community.
In silico Evolutionary Developmental Neurobiology and the Origin of Natural Language
NASA Astrophysics Data System (ADS)
Szathmáry, Eörs; Szathmáry, Zoltán; Ittzés, Péter; Orbaán, Geroő; Zachár, István; Huszár, Ferenc; Fedor, Anna; Varga, Máté; Számadó, Szabolcs
It is justified to assume that part of our genetic endowment contributes to our language skills, yet it is impossible to tell at this moment exactly how genes affect the language faculty. We complement experimental biological studies by an in silico approach in that we simulate the evolution of neuronal networks under selection for language-related skills. At the heart of this project is the Evolutionary Neurogenetic Algorithm (ENGA) that is deliberately biomimetic. The design of the system was inspired by important biological phenomena such as brain ontogenesis, neuron morphologies, and indirect genetic encoding. Neuronal networks were selected and were allowed to reproduce as a function of their performance in the given task. The selected neuronal networks in all scenarios were able to solve the communication problem they had to face. The most striking feature of the model is that it works with highly indirect genetic encoding--just as brains do.
Kittelmann, Sebastian; Buffry, Alexandra D; Franke, Franziska A; Almudi, Isabel; Yoth, Marianne; Sabaris, Gonzalo; Couso, Juan Pablo; Nunes, Maria D S; Frankel, Nicolás; Gómez-Skarmeta, José Luis; Pueyo-Marques, Jose; Arif, Saad; McGregor, Alistair P
2018-05-01
Convergent phenotypic evolution is often caused by recurrent changes at particular nodes in the underlying gene regulatory networks (GRNs). The genes at such evolutionary 'hotspots' are thought to maximally affect the phenotype with minimal pleiotropic consequences. This has led to the suggestion that if a GRN is understood in sufficient detail, the path of evolution may be predictable. The repeated evolutionary loss of larval trichomes among Drosophila species is caused by the loss of shavenbaby (svb) expression. svb is also required for development of leg trichomes, but the evolutionary gain of trichomes in the 'naked valley' on T2 femurs in Drosophila melanogaster is caused by reduced microRNA-92a (miR-92a) expression rather than changes in svb. We compared the expression and function of components between the larval and leg trichome GRNs to investigate why the genetic basis of trichome pattern evolution differs in these developmental contexts. We found key differences between the two networks in both the genes employed, and in the regulation and function of common genes. These differences in the GRNs reveal why mutations in svb are unlikely to contribute to leg trichome evolution and how instead miR-92a represents the key evolutionary switch in this context. Our work shows that variability in GRNs across different developmental contexts, as well as whether a morphological feature is lost versus gained, influence the nodes at which a GRN evolves to cause morphological change. Therefore, our findings have important implications for understanding the pathways and predictability of evolution.
OCLC Utilization in Health Sciences Libraries. CE 35, Revised Edition.
ERIC Educational Resources Information Center
Armes, Patti
This syllabus for a continuing education course describes the OCLC system and considers how it can be used by health science libraries. The general governance and administrative structure of OCLC and its network affiliates are detailed, and the OCLC subsystems--online union catalog, serials, interlibrary loan, and acquisitions--and their major…
Order Short-Term Memory Capacity Predicts Nonword Reading and Spelling in First and Second Grade
ERIC Educational Resources Information Center
Binamé, Florence; Poncelet, Martine
2016-01-01
Recent theories of short-term memory (STM) distinguish between item information, which reflects the temporary activation of long-term representations stored in the language system, and serial-order information, which is encoded in a specific representational system that is independent of the language network. Some studies examining the…
Postscript: Winnowing out Some Take-Home Points
ERIC Educational Resources Information Center
Botvinick, Matthew M.; Plaut, David C.
2009-01-01
Presents a postscript to the current authors' response to the comments by J. S. Bowers, M. F. Damian, and C. J. Davis on the current authors' original article, "Short-term memory for serial order: A recurrent neural network model,". Here, Botvinick and Plaut address Bowers et al's assertions that neurophysiological studies that have reported…
Evolutionary Scheduler for the Deep Space Network
NASA Technical Reports Server (NTRS)
Guillaume, Alexandre; Lee, Seungwon; Wang, Yeou-Fang; Zheng, Hua; Chau, Savio; Tung, Yu-Wen; Terrile, Richard J.; Hovden, Robert
2010-01-01
A computer program assists human schedulers in satisfying, to the maximum extent possible, competing demands from multiple spacecraft missions for utilization of the transmitting/receiving Earth stations of NASA s Deep Space Network. The program embodies a concept of optimal scheduling to attain multiple objectives in the presence of multiple constraints.
Yao, Yao; Marchal, Kathleen; Van de Peer, Yves
2014-01-01
One of the important challenges in the field of evolutionary robotics is the development of systems that can adapt to a changing environment. However, the ability to adapt to unknown and fluctuating environments is not straightforward. Here, we explore the adaptive potential of simulated swarm robots that contain a genomic encoding of a bio-inspired gene regulatory network (GRN). An artificial genome is combined with a flexible agent-based system, representing the activated part of the regulatory network that transduces environmental cues into phenotypic behaviour. Using an artificial life simulation framework that mimics a dynamically changing environment, we show that separating the static from the conditionally active part of the network contributes to a better adaptive behaviour. Furthermore, in contrast with most hitherto developed ANN-based systems that need to re-optimize their complete controller network from scratch each time they are subjected to novel conditions, our system uses its genome to store GRNs whose performance was optimized under a particular environmental condition for a sufficiently long time. When subjected to a new environment, the previous condition-specific GRN might become inactivated, but remains present. This ability to store ‘good behaviour’ and to disconnect it from the novel rewiring that is essential under a new condition allows faster re-adaptation if any of the previously observed environmental conditions is reencountered. As we show here, applying these evolutionary-based principles leads to accelerated and improved adaptive evolution in a non-stable environment. PMID:24599485
The Evolutionary Origins of Hierarchy
Huizinga, Joost; Clune, Jeff
2016-01-01
Hierarchical organization—the recursive composition of sub-modules—is ubiquitous in biological networks, including neural, metabolic, ecological, and genetic regulatory networks, and in human-made systems, such as large organizations and the Internet. To date, most research on hierarchy in networks has been limited to quantifying this property. However, an open, important question in evolutionary biology is why hierarchical organization evolves in the first place. It has recently been shown that modularity evolves because of the presence of a cost for network connections. Here we investigate whether such connection costs also tend to cause a hierarchical organization of such modules. In computational simulations, we find that networks without a connection cost do not evolve to be hierarchical, even when the task has a hierarchical structure. However, with a connection cost, networks evolve to be both modular and hierarchical, and these networks exhibit higher overall performance and evolvability (i.e. faster adaptation to new environments). Additional analyses confirm that hierarchy independently improves adaptability after controlling for modularity. Overall, our results suggest that the same force–the cost of connections–promotes the evolution of both hierarchy and modularity, and that these properties are important drivers of network performance and adaptability. In addition to shedding light on the emergence of hierarchy across the many domains in which it appears, these findings will also accelerate future research into evolving more complex, intelligent computational brains in the fields of artificial intelligence and robotics. PMID:27280881
The Evolutionary Origins of Hierarchy.
Mengistu, Henok; Huizinga, Joost; Mouret, Jean-Baptiste; Clune, Jeff
2016-06-01
Hierarchical organization-the recursive composition of sub-modules-is ubiquitous in biological networks, including neural, metabolic, ecological, and genetic regulatory networks, and in human-made systems, such as large organizations and the Internet. To date, most research on hierarchy in networks has been limited to quantifying this property. However, an open, important question in evolutionary biology is why hierarchical organization evolves in the first place. It has recently been shown that modularity evolves because of the presence of a cost for network connections. Here we investigate whether such connection costs also tend to cause a hierarchical organization of such modules. In computational simulations, we find that networks without a connection cost do not evolve to be hierarchical, even when the task has a hierarchical structure. However, with a connection cost, networks evolve to be both modular and hierarchical, and these networks exhibit higher overall performance and evolvability (i.e. faster adaptation to new environments). Additional analyses confirm that hierarchy independently improves adaptability after controlling for modularity. Overall, our results suggest that the same force-the cost of connections-promotes the evolution of both hierarchy and modularity, and that these properties are important drivers of network performance and adaptability. In addition to shedding light on the emergence of hierarchy across the many domains in which it appears, these findings will also accelerate future research into evolving more complex, intelligent computational brains in the fields of artificial intelligence and robotics.
Lhuaire, Martin; Tonnelet, Romain; Renard, Yohann; Piardi, Tullio; Sommacale, Daniele; Duparc, Fabrice; Braun, Marc; Labrousse, Marc
2015-07-01
Some aspects of human embryogenesis and organogenesis remain unclear, especially concerning the development of the liver and its vasculature. The purpose of this study was to investigate, from a descriptive standpoint, the evolutionary morphogenesis of the human liver and its vasculature by computerized three-dimensional reconstructions of human embryos. Serial histological sections of four human embryos at successive stages of development belonging to three prestigious French historical collections were digitized and reconstructed in 3D using software commonly used in medical radiology. Manual segmentation of the hepatic anatomical regions of interest was performed section by section. In this study, human liver organogenesis was examined at Carnegie stages 14, 18, 21 and 23. Using a descriptive and an analytical method, we showed that these stages correspond to the implementation of the large hepatic vascular patterns (the portal system, the hepatic artery and the hepatic venous system) and the biliary system. To our knowledge, our work is the first descriptive morphological study using 3D computerized reconstructions from serial histological sections of the embryonic development of the human liver between Carnegie stages 14 and 23. Copyright © 2015 Elsevier GmbH. All rights reserved.
Ruths, Troy; Nakhleh, Luay
2013-05-07
Cis-regulatory networks (CRNs) play a central role in cellular decision making. Like every other biological system, CRNs undergo evolution, which shapes their properties by a combination of adaptive and nonadaptive evolutionary forces. Teasing apart these forces is an important step toward functional analyses of the different components of CRNs, designing regulatory perturbation experiments, and constructing synthetic networks. Although tests of neutrality and selection based on molecular sequence data exist, no such tests are currently available based on CRNs. In this work, we present a unique genotype model of CRNs that is grounded in a genomic context and demonstrate its use in identifying portions of the CRN with properties explainable by neutral evolutionary forces at the system, subsystem, and operon levels. We leverage our model against experimentally derived data from Escherichia coli. The results of this analysis show statistically significant and substantial neutral trends in properties previously identified as adaptive in origin--degree distribution, clustering coefficient, and motifs--within the E. coli CRN. Our model captures the tightly coupled genome-interactome of an organism and enables analyses of how evolutionary events acting at the genome level, such as mutation, and at the population level, such as genetic drift, give rise to neutral patterns that we can quantify in CRNs.
Entanglement guarantees emergence of cooperation in quantum prisoner's dilemma games on networks.
Li, Angsheng; Yong, Xi
2014-09-05
It was known that cooperation of evolutionary prisoner's dilemma games fails to emerge in homogenous networks such as random graphs. Here we proposed a quantum prisoner's dilemma game. The game consists of two players, in which each player has three choices of strategy: cooperator (C), defector (D) and super cooperator (denoted by Q). We found that quantum entanglement guarantees emergence of a new cooperation, the super cooperation of the quantum prisoner's dilemma games, and that entanglement is the mechanism of guaranteed emergence of cooperation of evolutionary prisoner's dilemma games on networks. We showed that for a game with temptation b, there exists a threshold arccos √b/b for a measurement of entanglement, beyond which, (super) cooperation of evolutionary quantum prisoner's dilemma games is guaranteed to quickly emerge, giving rise to stochastic convergence of the cooperations, that if the entanglement degree γ is less than the threshold arccos √b/b, then the equilibrium frequency of cooperations of the games is positively correlated to the entanglement degree γ, and that if γ is less than arccos √b/b and b is beyond some boundary, then the equilibrium frequency of cooperations of the games on random graphs decreases as the average degree of the graphs increases.
Turning gold into ‘junk’: transposable elements utilize central proteins of cellular networks
Abrusán, György; Szilágyi, András; Zhang, Yang; Papp, Balázs
2013-01-01
The numerous discovered cases of domesticated transposable element (TE) proteins led to the recognition that TEs are a significant source of evolutionary innovation. However, much less is known about the reverse process, whether and to what degree the evolution of TEs is influenced by the genome of their hosts. We addressed this issue by searching for cases of incorporation of host genes into the sequence of TEs and examined the systems-level properties of these genes using the Saccharomyces cerevisiae and Drosophila melanogaster genomes. We identified 51 cases where the evolutionary scenario was the incorporation of a host gene fragment into a TE consensus sequence, and we show that both the yeast and fly homologues of the incorporated protein sequences have central positions in the cellular networks. An analysis of selective pressure (Ka/Ks ratio) detected significant selection in 37% of the cases. Recent research on retrovirus-host interactions shows that virus proteins preferentially target hubs of the host interaction networks enabling them to take over the host cell using only a few proteins. We propose that TEs face a similar evolutionary pressure to evolve proteins with high interacting capacities and take some of the necessary protein domains directly from their hosts. PMID:23341038
Punctuated equilibrium in the large-scale evolution of programming languages.
Valverde, Sergi; Solé, Ricard V
2015-06-06
The analogies and differences between biological and cultural evolution have been explored by evolutionary biologists, historians, engineers and linguists alike. Two well-known domains of cultural change are language and technology. Both share some traits relating the evolution of species, but technological change is very difficult to study. A major challenge in our way towards a scientific theory of technological evolution is how to properly define evolutionary trees or clades and how to weight the role played by horizontal transfer of information. Here, we study the large-scale historical development of programming languages, which have deeply marked social and technological advances in the last half century. We analyse their historical connections using network theory and reconstructed phylogenetic networks. Using both data analysis and network modelling, it is shown that their evolution is highly uneven, marked by innovation events where new languages are created out of improved combinations of different structural components belonging to previous languages. These radiation events occur in a bursty pattern and are tied to novel technological and social niches. The method can be extrapolated to other systems and consistently captures the major classes of languages and the widespread horizontal design exchanges, revealing a punctuated evolutionary path. © 2015 The Author(s) Published by the Royal Society. All rights reserved.
Wavelet evolutionary network for complex-constrained portfolio rebalancing
NASA Astrophysics Data System (ADS)
Suganya, N. C.; Vijayalakshmi Pai, G. A.
2012-07-01
Portfolio rebalancing problem deals with resetting the proportion of different assets in a portfolio with respect to changing market conditions. The constraints included in the portfolio rebalancing problem are basic, cardinality, bounding, class and proportional transaction cost. In this study, a new heuristic algorithm named wavelet evolutionary network (WEN) is proposed for the solution of complex-constrained portfolio rebalancing problem. Initially, the empirical covariance matrix, one of the key inputs to the problem, is estimated using the wavelet shrinkage denoising technique to obtain better optimal portfolios. Secondly, the complex cardinality constraint is eliminated using k-means cluster analysis. Finally, WEN strategy with logical procedures is employed to find the initial proportion of investment in portfolio of assets and also rebalance them after certain period. Experimental studies of WEN are undertaken on Bombay Stock Exchange, India (BSE200 index, period: July 2001-July 2006) and Tokyo Stock Exchange, Japan (Nikkei225 index, period: March 2002-March 2007) data sets. The result obtained using WEN is compared with the only existing counterpart named Hopfield evolutionary network (HEN) strategy and also verifies that WEN performs better than HEN. In addition, different performance metrics and data envelopment analysis are carried out to prove the robustness and efficiency of WEN over HEN strategy.
Grothausmann, Roman; Knudsen, Lars; Ochs, Matthias; Mühlfeld, Christian
2017-02-01
Grothausmann R, Knudsen L, Ochs M, Mühlfeld C. Digital 3D reconstructions using histological serial sections of lung tissue including the alveolar capillary network. Am J Physiol Lung Cell Mol Physiol 312: L243-L257, 2017. First published December 2, 2016; doi:10.1152/ajplung.00326.2016-The alveolar capillary network (ACN) provides an enormously large surface area that is necessary for pulmonary gas exchange. Changes of the ACN during normal or pathological development or in pulmonary diseases are of great functional impact and warrant further analysis. Due to the complexity of the three-dimensional (3D) architecture of the ACN, 2D approaches are limited in providing a comprehensive impression of the characteristics of the normal ACN or the nature of its alterations. Stereological methods offer a quantitative way to assess the ACN in 3D in terms of capillary volume, surface area, or number but lack a 3D visualization to interpret the data. Hence, the necessity to visualize the ACN in 3D and to correlate this with data from the same set of data arises. Such an approach requires a large sample volume combined with a high resolution. Here, we present a technically simple and cost-efficient approach to create 3D representations of lung tissue ranging from bronchioles over alveolar ducts and alveoli up to the ACN from more than 1 mm sample extent to a resolution of less than 1 μm. The method is based on automated image acquisition of serially sectioned epoxy resin-embedded lung tissue fixed by vascular perfusion and subsequent automated digital reconstruction and analysis of the 3D data. This efficient method may help to better understand mechanisms of vascular development and pathology of the lung. Copyright © 2017 the American Physiological Society.
Yutin, Natalya; Raoult, Didier; Koonin, Eugene V
2013-05-23
Recent advances of genomics and metagenomics reveal remarkable diversity of viruses and other selfish genetic elements. In particular, giant viruses have been shown to possess their own mobilomes that include virophages, small viruses that parasitize on giant viruses of the Mimiviridae family, and transpovirons, distinct linear plasmids. One of the virophages known as the Mavirus, a parasite of the giant Cafeteria roenbergensis virus, shares several genes with large eukaryotic self-replicating transposon of the Polinton (Maverick) family, and it has been proposed that the polintons evolved from a Mavirus-like ancestor. We performed a comprehensive phylogenomic analysis of the available genomes of virophages and traced the evolutionary connections between the virophages and other selfish genetic elements. The comparison of the gene composition and genome organization of the virophages reveals 6 conserved, core genes that are organized in partially conserved arrays. Phylogenetic analysis of those core virophage genes, for which a sufficient diversity of homologs outside the virophages was detected, including the maturation protease and the packaging ATPase, supports the monophyly of the virophages. The results of this analysis appear incompatible with the origin of polintons from a Mavirus-like agent but rather suggest that Mavirus evolved through recombination between a polinton and an unknown virus. Altogether, virophages, polintons, a distinct Tetrahymena transposable element Tlr1, transpovirons, adenoviruses, and some bacteriophages form a network of evolutionary relationships that is held together by overlapping sets of shared genes and appears to represent a distinct module in the vast total network of viruses and mobile elements. The results of the phylogenomic analysis of the virophages and related genetic elements are compatible with the concept of network-like evolution of the virus world and emphasize multiple evolutionary connections between bona fide viruses and other classes of capsid-less mobile elements.
2013-01-01
Background Recent advances of genomics and metagenomics reveal remarkable diversity of viruses and other selfish genetic elements. In particular, giant viruses have been shown to possess their own mobilomes that include virophages, small viruses that parasitize on giant viruses of the Mimiviridae family, and transpovirons, distinct linear plasmids. One of the virophages known as the Mavirus, a parasite of the giant Cafeteria roenbergensis virus, shares several genes with large eukaryotic self-replicating transposon of the Polinton (Maverick) family, and it has been proposed that the polintons evolved from a Mavirus-like ancestor. Results We performed a comprehensive phylogenomic analysis of the available genomes of virophages and traced the evolutionary connections between the virophages and other selfish genetic elements. The comparison of the gene composition and genome organization of the virophages reveals 6 conserved, core genes that are organized in partially conserved arrays. Phylogenetic analysis of those core virophage genes, for which a sufficient diversity of homologs outside the virophages was detected, including the maturation protease and the packaging ATPase, supports the monophyly of the virophages. The results of this analysis appear incompatible with the origin of polintons from a Mavirus-like agent but rather suggest that Mavirus evolved through recombination between a polinton and an unknownvirus. Altogether, virophages, polintons, a distinct Tetrahymena transposable element Tlr1, transpovirons, adenoviruses, and some bacteriophages form a network of evolutionary relationships that is held together by overlapping sets of shared genes and appears to represent a distinct module in the vast total network of viruses and mobile elements. Conclusions The results of the phylogenomic analysis of the virophages and related genetic elements are compatible with the concept of network-like evolution of the virus world and emphasize multiple evolutionary connections between bona fide viruses and other classes of capsid-less mobile elements. PMID:23701946
Hybrid evolutionary computing model for mobile agents of wireless Internet multimedia
NASA Astrophysics Data System (ADS)
Hortos, William S.
2001-03-01
The ecosystem is used as an evolutionary paradigm of natural laws for the distributed information retrieval via mobile agents to allow the computational load to be added to server nodes of wireless networks, while reducing the traffic on communication links. Based on the Food Web model, a set of computational rules of natural balance form the outer stage to control the evolution of mobile agents providing multimedia services with a wireless Internet protocol WIP. The evolutionary model shows how mobile agents should behave with the WIP, in particular, how mobile agents can cooperate, compete and learn from each other, based on an underlying competition for radio network resources to establish the wireless connections to support the quality of service QoS of user requests. Mobile agents are also allowed to clone themselves, propagate and communicate with other agents. A two-layer model is proposed for agent evolution: the outer layer is based on the law of natural balancing, the inner layer is based on a discrete version of a Kohonen self-organizing feature map SOFM to distribute network resources to meet QoS requirements. The former is embedded in the higher OSI layers of the WIP, while the latter is used in the resource management procedures of Layer 2 and 3 of the protocol. Algorithms for the distributed computation of mobile agent evolutionary behavior are developed by adding a learning state to the agent evolution state diagram. When an agent is in an indeterminate state, it can communicate to other agents. Computing models can be replicated from other agents. Then the agents transitions to the mutating state to wait for a new information-retrieval goal. When a wireless terminal or station lacks a network resource, an agent in the suspending state can change its policy to submit to the environment before it transitions to the searching state. The agents learn the facts of agent state information entered into an external database. In the cloning process, two agents on a host station sharing a common goal can be merged or married to compose a new agent. Application of the two-layer set of algorithms for mobile agent evolution, performed in a distributed processing environment, is made to the QoS management functions of the IP multimedia IM sub-network of the third generation 3G Wideband Code-division Multiple Access W-CDMA wireless network.
Kemppainen, Petri; Knight, Christopher G; Sarma, Devojit K; Hlaing, Thaung; Prakash, Anil; Maung Maung, Yan Naung; Somboon, Pradya; Mahanta, Jagadish; Walton, Catherine
2015-09-01
Recent advances in sequencing allow population-genomic data to be generated for virtually any species. However, approaches to analyse such data lag behind the ability to generate it, particularly in nonmodel species. Linkage disequilibrium (LD, the nonrandom association of alleles from different loci) is a highly sensitive indicator of many evolutionary phenomena including chromosomal inversions, local adaptation and geographical structure. Here, we present linkage disequilibrium network analysis (LDna), which accesses information on LD shared between multiple loci genomewide. In LD networks, vertices represent loci, and connections between vertices represent the LD between them. We analysed such networks in two test cases: a new restriction-site-associated DNA sequence (RAD-seq) data set for Anopheles baimaii, a Southeast Asian malaria vector; and a well-characterized single nucleotide polymorphism (SNP) data set from 21 three-spined stickleback individuals. In each case, we readily identified five distinct LD network clusters (single-outlier clusters, SOCs), each comprising many loci connected by high LD. In A. baimaii, further population-genetic analyses supported the inference that each SOC corresponds to a large inversion, consistent with previous cytological studies. For sticklebacks, we inferred that each SOC was associated with a distinct evolutionary phenomenon: two chromosomal inversions, local adaptation, population-demographic history and geographic structure. LDna is thus a useful exploratory tool, able to give a global overview of LD associated with diverse evolutionary phenomena and identify loci potentially involved. LDna does not require a linkage map or reference genome, so it is applicable to any population-genomic data set, making it especially valuable for nonmodel species. © 2015 The Authors. Molecular Ecology Resources Published by John Wiley & Sons Ltd.
A network approach to analyzing highly recombinant malaria parasite genes.
Larremore, Daniel B; Clauset, Aaron; Buckee, Caroline O
2013-01-01
The var genes of the human malaria parasite Plasmodium falciparum present a challenge to population geneticists due to their extreme diversity, which is generated by high rates of recombination. These genes encode a primary antigen protein called PfEMP1, which is expressed on the surface of infected red blood cells and elicits protective immune responses. Var gene sequences are characterized by pronounced mosaicism, precluding the use of traditional phylogenetic tools that require bifurcating tree-like evolutionary relationships. We present a new method that identifies highly variable regions (HVRs), and then maps each HVR to a complex network in which each sequence is a node and two nodes are linked if they share an exact match of significant length. Here, networks of var genes that recombine freely are expected to have a uniformly random structure, but constraints on recombination will produce network communities that we identify using a stochastic block model. We validate this method on synthetic data, showing that it correctly recovers populations of constrained recombination, before applying it to the Duffy Binding Like-α (DBLα) domain of var genes. We find nine HVRs whose network communities map in distinctive ways to known DBLα classifications and clinical phenotypes. We show that the recombinational constraints of some HVRs are correlated, while others are independent. These findings suggest that this micromodular structuring facilitates independent evolutionary trajectories of neighboring mosaic regions, allowing the parasite to retain protein function while generating enormous sequence diversity. Our approach therefore offers a rigorous method for analyzing evolutionary constraints in var genes, and is also flexible enough to be easily applied more generally to any highly recombinant sequences.
A Network Approach to Analyzing Highly Recombinant Malaria Parasite Genes
Larremore, Daniel B.; Clauset, Aaron; Buckee, Caroline O.
2013-01-01
The var genes of the human malaria parasite Plasmodium falciparum present a challenge to population geneticists due to their extreme diversity, which is generated by high rates of recombination. These genes encode a primary antigen protein called PfEMP1, which is expressed on the surface of infected red blood cells and elicits protective immune responses. Var gene sequences are characterized by pronounced mosaicism, precluding the use of traditional phylogenetic tools that require bifurcating tree-like evolutionary relationships. We present a new method that identifies highly variable regions (HVRs), and then maps each HVR to a complex network in which each sequence is a node and two nodes are linked if they share an exact match of significant length. Here, networks of var genes that recombine freely are expected to have a uniformly random structure, but constraints on recombination will produce network communities that we identify using a stochastic block model. We validate this method on synthetic data, showing that it correctly recovers populations of constrained recombination, before applying it to the Duffy Binding Like-α (DBLα) domain of var genes. We find nine HVRs whose network communities map in distinctive ways to known DBLα classifications and clinical phenotypes. We show that the recombinational constraints of some HVRs are correlated, while others are independent. These findings suggest that this micromodular structuring facilitates independent evolutionary trajectories of neighboring mosaic regions, allowing the parasite to retain protein function while generating enormous sequence diversity. Our approach therefore offers a rigorous method for analyzing evolutionary constraints in var genes, and is also flexible enough to be easily applied more generally to any highly recombinant sequences. PMID:24130474
Radiology: "killer app" for next generation networks?
McNeill, Kevin M
2004-03-01
The core principles of digital radiology were well developed by the end of the 1980 s. During the following decade tremendous improvements in computer technology enabled realization of those principles at an affordable cost. In this decade work can focus on highly distributed radiology in the context of the integrated health care enterprise. Over the same period computer networking has evolved from a relatively obscure field used by a small number of researchers across low-speed serial links to a pervasive technology that affects nearly all facets of society. Development directions in network technology will ultimately provide end-to-end data paths with speeds that match or exceed the speeds of data paths within the local network and even within workstations. This article describes key developments in Next Generation Networks, potential obstacles, and scenarios in which digital radiology can become a "killer app" that helps to drive deployment of new network infrastructure.
Burkle, Laura A; Myers, Jonathan A; Belote, R Travis
2016-01-01
Geographic patterns of biodiversity have long inspired interest in processes that shape the assembly, diversity, and dynamics of communities at different spatial scales. To study mechanisms of community assembly, ecologists often compare spatial variation in community composition (beta-diversity) across environmental and spatial gradients. These same patterns inspired evolutionary biologists to investigate how micro- and macro-evolutionary processes create gradients in biodiversity. Central to these perspectives are species interactions, which contribute to community assembly and geographic variation in evolutionary processes. However, studies of beta-diversity have predominantly focused on single trophic levels, resulting in gaps in our understanding of variation in species-interaction networks (interaction beta-diversity), especially at scales most relevant to evolutionary studies of geographic variation. We outline two challenges and their consequences in scaling-up studies of interaction beta-diversity from local to biogeographic scales using plant-pollinator interactions as a model system in ecology, evolution, and conservation. First, we highlight how variation in regional species pools may contribute to variation in interaction beta-diversity among biogeographic regions with dissimilar evolutionary history. Second, we highlight how pollinator behavior (host-switching) links ecological networks to geographic patterns of plant-pollinator interactions and evolutionary processes. Third, we outline key unanswered questions regarding the role of geographic variation in plant-pollinator interactions for conservation and ecosystem services (pollination) in changing environments. We conclude that the largest advances in the burgeoning field of interaction beta-diversity will come from studies that integrate frameworks in ecology, evolution, and conservation to understand the causes and consequences of interaction beta-diversity across scales. © 2016 Botanical Society of America.
1983-12-15
7 "AD-RI38 iig CONTINUED DE VELOPMlENT OF UNIERSL NETWORK INTERFCE 1/2 DEVICE USING THE I..(U) AIR FORCE INST OF TECHD-F13 ill WRIGHT PATTERSON AFB...Protocols," IEEE Transactions on Communications, COM-28(4):433-44 (April 1980). 3. Borgsmiller, Michael. "The Serial Communications Interface Board...Interconnections," IEEE Transactions on Communications, COM-28(4): 425- 432, (April 1980). 4. I L Appendix A UNID II Data Flow Diagrams (Ref 10:26-34) This
Evolutionary method for finding communities in bipartite networks.
Zhan, Weihua; Zhang, Zhongzhi; Guan, Jihong; Zhou, Shuigeng
2011-06-01
An important step in unveiling the relation between network structure and dynamics defined on networks is to detect communities, and numerous methods have been developed separately to identify community structure in different classes of networks, such as unipartite networks, bipartite networks, and directed networks. Here, we show that the finding of communities in such networks can be unified in a general framework-detection of community structure in bipartite networks. Moreover, we propose an evolutionary method for efficiently identifying communities in bipartite networks. To this end, we show that both unipartite and directed networks can be represented as bipartite networks, and their modularity is completely consistent with that for bipartite networks, the detection of modular structure on which can be reformulated as modularity maximization. To optimize the bipartite modularity, we develop a modified adaptive genetic algorithm (MAGA), which is shown to be especially efficient for community structure detection. The high efficiency of the MAGA is based on the following three improvements we make. First, we introduce a different measure for the informativeness of a locus instead of the standard deviation, which can exactly determine which loci mutate. This measure is the bias between the distribution of a locus over the current population and the uniform distribution of the locus, i.e., the Kullback-Leibler divergence between them. Second, we develop a reassignment technique for differentiating the informative state a locus has attained from the random state in the initial phase. Third, we present a modified mutation rule which by incorporating related operations can guarantee the convergence of the MAGA to the global optimum and can speed up the convergence process. Experimental results show that the MAGA outperforms existing methods in terms of modularity for both bipartite and unipartite networks.
Double-dealing behavior potentially promotes cooperation in evolutionary prisoner's dilemma games
NASA Astrophysics Data System (ADS)
Dai, Qionglin; Li, Haihong; Cheng, Hongyan; Li, Yuting; Yang, Junzhong
2010-11-01
We investigate the effects of double-dealing behavior on cooperation in evolutionary games. Each individual in a population has two attributes: character and action. One's action may be consistent with one's character or not. We provide analytical results by a mean-field description of evolutionary prisoner's dilemma games (PDGs). Moreover, we give numerical results on different networks, ranging from square lattices to scale-free networks (SFNs). Two important conclusions have been drawn from the results on SFNs. Firstly, if only non-influential individuals (those with low degrees) have chances of becoming double-dealers, cooperation is certain to deteriorate. Secondly, when influential individuals (those with high degrees) adopt double-dealing behavior moderately, cooperation would be enhanced, which is in opposition to the traditional belief. These results help us to understand better the social phenomenon of the existence of double-dealers. In addition to the PDG, other types of games including the snowdrift game, the stag-hunt game and the harmony game have also been studied on our model. The results for these three games are also presented, which are consistent with the results for the PDG qualitatively. Furthermore, we consider our model under the co-evolution framework, in which the probability of an individual changing into a double-dealer and the individual strategy both could evolve during the evolutionary process.
Improved Maximum Parsimony Models for Phylogenetic Networks.
Van Iersel, Leo; Jones, Mark; Scornavacca, Celine
2018-05-01
Phylogenetic networks are well suited to represent evolutionary histories comprising reticulate evolution. Several methods aiming at reconstructing explicit phylogenetic networks have been developed in the last two decades. In this article, we propose a new definition of maximum parsimony for phylogenetic networks that permits to model biological scenarios that cannot be modeled by the definitions currently present in the literature (namely, the "hardwired" and "softwired" parsimony). Building on this new definition, we provide several algorithmic results that lay the foundations for new parsimony-based methods for phylogenetic network reconstruction.
Moran-evolution of cooperation: From well-mixed to heterogeneous complex networks
NASA Astrophysics Data System (ADS)
Sarkar, Bijan
2018-05-01
Configurational arrangement of network architecture and interaction character of individuals are two most influential factors on the mechanisms underlying the evolutionary outcome of cooperation, which is explained by the well-established framework of evolutionary game theory. In the current study, not only qualitatively but also quantitatively, we measure Moran-evolution of cooperation to support an analytical agreement based on the consequences of the replicator equation in a finite population. The validity of the measurement has been double-checked in the well-mixed network by the Langevin stochastic differential equation and the Gillespie-algorithmic version of Moran-evolution, while in a structured network, the measurement of accuracy is verified by the standard numerical simulation. Considering the Birth-Death and Death-Birth updating rules through diffusion of individuals, the investigation is carried out in the wide range of game environments those relate to the various social dilemmas where we are able to draw a new rigorous mathematical track to tackle the heterogeneity of complex networks. The set of modified criteria reveals the exact fact about the emergence and maintenance of cooperation in the structured population. We find that in general, nature promotes the environment of coexistent traits.
Li, Yao; Dwivedi, Gaurav; Huang, Wen; Yi, Yingfei
2012-01-01
There is an evolutionary advantage in having multiple components with overlapping functionality (i.e degeneracy) in organisms. While theoretical considerations of degeneracy have been well established in neural networks using information theory, the same concepts have not been developed for differential systems, which form the basis of many biochemical reaction network descriptions in systems biology. Here we establish mathematical definitions of degeneracy, complexity and robustness that allow for the quantification of these properties in a system. By exciting a dynamical system with noise, the mutual information associated with a selected observable output and the interacting subspaces of input components can be used to define both complexity and degeneracy. The calculation of degeneracy in a biological network is a useful metric for evaluating features such as the sensitivity of a biological network to environmental evolutionary pressure. Using a two-receptor signal transduction network, we find that redundant components will not yield high degeneracy whereas compensatory mechanisms established by pathway crosstalk will. This form of analysis permits interrogation of large-scale differential systems for non-identical, functionally equivalent features that have evolved to maintain homeostasis during disruption of individual components. PMID:22619750
Ferentinos, Konstantinos P
2005-09-01
Two neural network (NN) applications in the field of biological engineering are developed, designed and parameterized by an evolutionary method based on the evolutionary process of genetic algorithms. The developed systems are a fault detection NN model and a predictive modeling NN system. An indirect or 'weak specification' representation was used for the encoding of NN topologies and training parameters into genes of the genetic algorithm (GA). Some a priori knowledge of the demands in network topology for specific application cases is required by this approach, so that the infinite search space of the problem is limited to some reasonable degree. Both one-hidden-layer and two-hidden-layer network architectures were explored by the GA. Except for the network architecture, each gene of the GA also encoded the type of activation functions in both hidden and output nodes of the NN and the type of minimization algorithm that was used by the backpropagation algorithm for the training of the NN. Both models achieved satisfactory performance, while the GA system proved to be a powerful tool that can successfully replace the problematic trial-and-error approach that is usually used for these tasks.
Recent Coselection in Human Populations Revealed by Protein–Protein Interaction Network
Qian, Wei; Zhou, Hang; Tang, Kun
2015-01-01
Genome-wide scans for signals of natural selection in human populations have identified a large number of candidate loci that underlie local adaptations. This is surprising given the relatively short evolutionary time since the divergence of the human population. One hypothesis that has not been formally examined is whether and how the recent human evolution may have been shaped by coselection in the context of complex molecular interactome. In this study, genome-wide signals of selection were scanned in East Asians, Europeans, and Africans using 1000 Genome data, and subsequently mapped onto the protein–protein interaction (PPI) network. We found that the candidate genes of recent positive selection localized significantly closer to each other on the PPI network than expected, revealing substantial clustering of selected genes. Furthermore, gene pairs of shorter PPI network distances showed higher similarities of their recent evolutionary paths than those further apart. Last, subnetworks enriched with recent coselection signals were identified, which are substantially overrepresented in biological pathways related to signal transduction, neurogenesis, and immune function. These results provide the first genome-wide evidence for association of recent selection signals with the PPI network, shedding light on the potential mechanisms of recent coselection in the human genome. PMID:25532814
Pandey, Ravi S; Azad, Rajeev K
2016-03-01
Sex chromosomes have evolved from a pair of homologous autosomes which differentiated into sex determination systems, such as XY or ZW system, as a consequence of successive recombination suppression between the gametologous chromosomes. Identifying the regions of recombination suppression, namely, the "evolutionary strata", is central to understanding the history and dynamics of sex chromosome evolution. Evolution of sex chromosomes as a consequence of serial recombination suppressions is well-studied for mammals and birds, but not for plants, although 48 dioecious plants have already been reported. Only two plants Silene latifolia and papaya have been studied until now for the presence of evolutionary strata on their X chromosomes, made possible by the sequencing of sex-linked genes on both the X and Y chromosomes, which is a requirement of all current methods that determine stratum structure based on the comparison of gametologous sex chromosomes. To circumvent this limitation and detect strata even if only the sequence of sex chromosome in the homogametic sex (i.e. X or Z chromosome) is available, we have developed an integrated segmentation and clustering method. In application to gene sequences on the papaya X chromosome and protein-coding sequences on the S. latifolia X chromosome, our method could decipher all known evolutionary strata, as reported by previous studies. Our method, after validating on known strata on the papaya and S. latifolia X chromosome, was applied to the chromosome 19 of Populus trichocarpa, an incipient sex chromosome, deciphering two, yet unknown, evolutionary strata. In addition, we applied this approach to the recently sequenced sex chromosome V of the brown alga Ectocarpus sp. that has a haploid sex determination system (UV system) recovering the sex determining and pseudoautosomal regions, and then to the mating-type chromosomes of an anther-smut fungus Microbotryum lychnidis-dioicae predicting five strata in the non-recombining region of both the chromosomes.
Cooperation in N-person evolutionary snowdrift game in scale-free Barabási Albert networks
NASA Astrophysics Data System (ADS)
Lee, K. H.; Chan, Chun-Him; Hui, P. M.; Zheng, Da-Fang
2008-09-01
Cooperation in the N-person evolutionary snowdrift game (NESG) is studied in scale-free Barabási-Albert (BA) networks. Due to the inhomogeneity of the network, two versions of NESG are proposed and studied. In a model where the size of the competing group varies from agent to agent, the fraction of cooperators drops as a function of the payoff parameter. The networking effect is studied via the fraction of cooperative agents for nodes with a particular degree. For small payoff parameters, it is found that the small- k agents are dominantly cooperators, while large- k agents are of non-cooperators. Studying the spatial correlation reveals that cooperative agents will avoid to be nearest neighbors and the correlation disappears beyond the next-nearest neighbors. The behavior can be explained in terms of the networking effect and payoffs. In another model with a fixed size of competing groups, the fraction of cooperators could show a non-monotonic behavior in the regime of small payoff parameters. This non-trivial behavior is found to be a combined effect of the many agents with the smallest degree in the BA network and the increasing fraction of cooperators among these agents with the payoff for small payoffs.
Quantum Prisoner’s Dilemma game on hypergraph networks
NASA Astrophysics Data System (ADS)
Pawela, Łukasz; Sładkowski, Jan
2013-02-01
We study the possible advantages of adopting quantum strategies in multi-player evolutionary games. We base our study on the three-player Prisoner’s Dilemma (PD) game. In order to model the simultaneous interaction between three agents we use hypergraphs and hypergraph networks. In particular, we study two types of networks: a random network and a SF-like network. The obtained results show that in the case of a three-player game on a hypergraph network, quantum strategies are not necessarily stochastically stable strategies. In some cases, the defection strategy can be as good as a quantum one.
Madrid, Eric N.; Friedman, William E.
2009-01-01
Background and Aims Fritillaria-type female gametophyte development is a complex, yet homoplasious developmental pattern that is interesting from both evolutionary and developmental perspectives. Piper (Piperaceae) was chosen for this study of Fritillaria-type female gametophyte development because Piperales represent a ‘hotspot’ of female gametophyte developmental evolution and have been the subject of several recent molecular phylogenetic analyses. This wealth of phylogenetic and descriptive data make Piper an excellent candidate for inferring the evolutionary developmental basis for the origin of Fritillaria-type female gametophytes. Methods Developing ovules of Piper peltatum were taken from greenhouse collections, embedded in glycol methacrylate, and serially sectioned. Light microscopy and laser scanning confocal microscopy were combined to produce three-dimensional computer reconstructions of developing female gametophytes. The ploidies of the developing embryos and endosperms were calculated using microspectrofluorometry. Key Results The data describe female gametophyte development in Piper with highly detailed three-dimensional models, and document two previously unknown arrangements of megaspore nuclei during early development. Also collected were microspectrofluorometric data that indicate that Fritillaria-type female gametophyte development in Piper results in pentaploid endosperm. Conclusions The three-dimensional models resolve previous ambiguities in developmental interpretations of Fritillaria-type female gametophytes in Piper. The newly discovered arrangements of megaspore nuclei that are described allow for the construction of explicit hypotheses of female gametophyte developmental evolution within Piperaceae, and more broadly throughout Piperales. These detailed hypotheses indicate that the common ancestor of Piperaceae minus Verhuellia had a Drusa-type female gametophyte, and that evolutionary transitions to derived tetrasporic female gametophyte ontogenies in Piperaceae, including Fritillaria-type female gametophyte development, are the consequence of key nuclear migration and patterning events at the end of megasporogenesis. PMID:19202137
Networking and the Role of the Academic Systems Librarian: An Evolutionary Perspective.
ERIC Educational Resources Information Center
Lavagnino, Merri Beth
1997-01-01
This paper examines the role of academic systems librarians, focusing on the effect of networking technologies. Outlines stages in the evolution of the field derived from the literature and surveys, discusses new administrative and professional tasks and trends resulting from technological change, and speculates about the future of academic…
NASA Astrophysics Data System (ADS)
Hon, Marc; Stello, Dennis; Yu, Jie
2018-05-01
Deep learning in the form of 1D convolutional neural networks have previously been shown to be capable of efficiently classifying the evolutionary state of oscillating red giants into red giant branch stars and helium-core burning stars by recognizing visual features in their asteroseismic frequency spectra. We elaborate further on the deep learning method by developing an improved convolutional neural network classifier. To make our method useful for current and future space missions such as K2, TESS, and PLATO, we train classifiers that are able to classify the evolutionary states of lower frequency resolution spectra expected from these missions. Additionally, we provide new classifications for 8633 Kepler red giants, out of which 426 have previously not been classified using asteroseismology. This brings the total to 14983 Kepler red giants classified with our new neural network. We also verify that our classifiers are remarkably robust to suboptimal data, including low signal-to-noise and incorrect training truth labels.
Population Fluctuation Promotes Cooperation in Networks
Miller, Steve; Knowles, Joshua
2015-01-01
We consider the problem of explaining the emergence and evolution of cooperation in dynamic network-structured populations. Building on seminal work by Poncela et al., which shows how cooperation (in one-shot prisoner’s dilemma) is supported in growing populations by an evolutionary preferential attachment (EPA) model, we investigate the effect of fluctuations in the population size. We find that a fluctuating model – based on repeated population growth and truncation – is more robust than Poncela et al.’s in that cooperation flourishes for a wider variety of initial conditions. In terms of both the temptation to defect, and the types of strategies present in the founder network, the fluctuating population is found to lead more securely to cooperation. Further, we find that this model will also support the emergence of cooperation from pre-existing non-cooperative random networks. This model, like Poncela et al.’s, does not require agents to have memory, recognition of other agents, or other cognitive abilities, and so may suggest a more general explanation of the emergence of cooperation in early evolutionary transitions, than mechanisms such as kin selection, direct and indirect reciprocity. PMID:26061705
Gap Gene Regulatory Dynamics Evolve along a Genotype Network
Crombach, Anton; Wotton, Karl R.; Jiménez-Guri, Eva; Jaeger, Johannes
2016-01-01
Developmental gene networks implement the dynamic regulatory mechanisms that pattern and shape the organism. Over evolutionary time, the wiring of these networks changes, yet the patterning outcome is often preserved, a phenomenon known as “system drift.” System drift is illustrated by the gap gene network—involved in segmental patterning—in dipteran insects. In the classic model organism Drosophila melanogaster and the nonmodel scuttle fly Megaselia abdita, early activation and placement of gap gene expression domains show significant quantitative differences, yet the final patterning output of the system is essentially identical in both species. In this detailed modeling analysis of system drift, we use gene circuits which are fit to quantitative gap gene expression data in M. abdita and compare them with an equivalent set of models from D. melanogaster. The results of this comparative analysis show precisely how compensatory regulatory mechanisms achieve equivalent final patterns in both species. We discuss the larger implications of the work in terms of “genotype networks” and the ways in which the structure of regulatory networks can influence patterns of evolutionary change (evolvability). PMID:26796549
Buchweitz, Augusto; Mason, Robert A.; Tomitch, Lêda M. B.; Just, Marcel Adam
2010-01-01
The study compared the brain activation patterns associated with the comprehension of written and spoken Portuguese sentences. An fMRI study measured brain activity while participants read and listened to sentences about general world knowledge. Participants had to decide if the sentences were true or false. To mirror the transient nature of spoken sentences, visual input was presented in rapid serial visual presentation format. The results showed a common core of amodal left inferior frontal and middle temporal gyri activation, as well as modality specific brain activation associated with listening and reading comprehension. Reading comprehension was associated with more left-lateralized activation and with left inferior occipital cortex (including fusiform gyrus) activation. Listening comprehension was associated with extensive bilateral temporal cortex activation and more overall activation of the whole cortex. Results also showed individual differences in brain activation for reading comprehension. Readers with lower working memory capacity showed more activation of right-hemisphere areas (spillover of activation) and more activation in the prefrontal cortex, potentially associated with more demand placed on executive control processes. Readers with higher working memory capacity showed more activation in a frontal-posterior network of areas (left angular and precentral gyri, and right inferior frontal gyrus). The activation of this network may be associated with phonological rehearsal of linguistic information when reading text presented in rapid serial visual format. The study demonstrates the modality fingerprints for language comprehension and indicates how low- and high working memory capacity readers deal with reading text presented in serial format. PMID:21526132
Impedance Discontinuity Reduction Between High-Speed Differential Connectors and PCB Interfaces
NASA Technical Reports Server (NTRS)
Navidi, Sal; Agdinaoay, Rodell; Walter, Keith
2013-01-01
High-speed serial communication (i.e., Gigabit Ethernet) requires differential transmission and controlled impedances. Impedance control is essential throughout cabling, connector, and circuit board construction. An impedance discontinuity arises at the interface of a high-speed quadrax and twinax connectors and the attached printed circuit board (PCB). This discontinuity usually is lower impedance since the relative dielectric constant of the board is higher (i.e., polyimide approx. = 4) than the connector (Teflon approx. = 2.25). The discontinuity can be observed in transmit or receive eye diagrams, and can reduce the effective link margin of serial data networks. High-speed serial data network transmission improvements can be made at the connector-to-board interfaces as well as improving differential via hole impedances. The impedance discontinuity was improved by 10 percent by drilling a 20-mil (approx. = 0.5-mm) hole in between the pin of a differential connector spaced 55 mils (approx. = 1.4 mm) apart as it is attached to the PCB. The effective dielectric constant of the board can be lowered by drilling holes into the board material between the differential lines in a quadrax or twinax connector attachment points. The differential impedance is inversely proportional to the square root of the relative dielectric constant. This increases the differential impedance and thus reduces the above described impedance discontinuity. The differential via hole impedance can also be increased in the same manner. This technique can be extended to multiple smaller drilled holes as well as tapered holes (i.e., big in the middle followed by smaller ones diagonally).
Investigation on Law and Economics Based on Complex Network and Time Series Analysis
Yang, Jian; Qu, Zhao; Chang, Hui
2015-01-01
The research focuses on the cooperative relationship and the strategy tendency among three mutually interactive parties in financing: small enterprises, commercial banks and micro-credit companies. Complex network theory and time series analysis were applied to figure out the quantitative evidence. Moreover, this paper built up a fundamental model describing the particular interaction among them through evolutionary game. Combining the results of data analysis and current situation, it is justifiable to put forward reasonable legislative recommendations for regulations on lending activities among small enterprises, commercial banks and micro-credit companies. The approach in this research provides a framework for constructing mathematical models and applying econometrics and evolutionary game in the issue of corporation financing. PMID:26076460
Serial Interface through Stream Protocol on EPICS Platform for Distributed Control and Monitoring
NASA Astrophysics Data System (ADS)
Das Gupta, Arnab; Srivastava, Amit K.; Sunil, S.; Khan, Ziauddin
2017-04-01
Remote operation of any equipment or device is implemented in distributed systems in order to control and proper monitoring of process values. For such remote operations, Experimental Physics and Industrial Control System (EPICS) is used as one of the important software tool for control and monitoring of a wide range of scientific parameters. A hardware interface is developed for implementation of EPICS software so that different equipment such as data converters, power supplies, pump controllers etc. could be remotely operated through stream protocol. EPICS base was setup on windows as well as Linux operating system for control and monitoring while EPICS modules such as asyn and stream device were used to interface the equipment with standard RS-232/RS-485 protocol. Stream Device protocol communicates with the serial line with an interface to asyn drivers. Graphical user interface and alarm handling were implemented with Motif Editor and Display Manager (MEDM) and Alarm Handler (ALH) command line channel access utility tools. This paper will describe the developed application which was tested with different equipment and devices serially interfaced to the PCs on a distributed network.
ERIC Educational Resources Information Center
Needleman, Mark H.
1996-01-01
Reviews developments related to standards in electronic and networked information. Discusses traditional library and Internet communities, and notes the importance of having a supporting infrastructure in place. Topics include: Z39.50; Z39.56 Serial Item/Contribution Identifier (SICI); Interlibrary Loan (ILL) Protocol; character set standards;…
Bio-inspired algorithms applied to molecular docking simulations.
Heberlé, G; de Azevedo, W F
2011-01-01
Nature as a source of inspiration has been shown to have a great beneficial impact on the development of new computational methodologies. In this scenario, analyses of the interactions between a protein target and a ligand can be simulated by biologically inspired algorithms (BIAs). These algorithms mimic biological systems to create new paradigms for computation, such as neural networks, evolutionary computing, and swarm intelligence. This review provides a description of the main concepts behind BIAs applied to molecular docking simulations. Special attention is devoted to evolutionary algorithms, guided-directed evolutionary algorithms, and Lamarckian genetic algorithms. Recent applications of these methodologies to protein targets identified in the Mycobacterium tuberculosis genome are described.
Learning in stochastic neural networks for constraint satisfaction problems
NASA Technical Reports Server (NTRS)
Johnston, Mark D.; Adorf, Hans-Martin
1989-01-01
Researchers describe a newly-developed artificial neural network algorithm for solving constraint satisfaction problems (CSPs) which includes a learning component that can significantly improve the performance of the network from run to run. The network, referred to as the Guarded Discrete Stochastic (GDS) network, is based on the discrete Hopfield network but differs from it primarily in that auxiliary networks (guards) are asymmetrically coupled to the main network to enforce certain types of constraints. Although the presence of asymmetric connections implies that the network may not converge, it was found that, for certain classes of problems, the network often quickly converges to find satisfactory solutions when they exist. The network can run efficiently on serial machines and can find solutions to very large problems (e.g., N-queens for N as large as 1024). One advantage of the network architecture is that network connection strengths need not be instantiated when the network is established: they are needed only when a participating neural element transitions from off to on. They have exploited this feature to devise a learning algorithm, based on consistency techniques for discrete CSPs, that updates the network biases and connection strengths and thus improves the network performance.
López-Ibáñez, Manuel; Prasad, T Devi; Paechter, Ben
2011-01-01
Reducing the energy consumption of water distribution networks has never had more significance. The greatest energy savings can be obtained by carefully scheduling the operations of pumps. Schedules can be defined either implicitly, in terms of other elements of the network such as tank levels; or explicitly, by specifying the time during which each pump is on/off. The traditional representation of explicit schedules is a string of binary values with each bit representing pump on/off status during a particular time interval. In this paper, we formally define and analyze two new explicit representations based on time-controlled triggers, where the maximum number of pump switches is established beforehand and the schedule may contain fewer than the maximum number of switches. In these representations, a pump schedule is divided into a series of integers with each integer representing the number of hours for which a pump is active/inactive. This reduces the number of potential schedules compared to the binary representation, and allows the algorithm to operate on the feasible region of the search space. We propose evolutionary operators for these two new representations. The new representations and their corresponding operations are compared with the two most-used representations in pump scheduling, namely, binary representation and level-controlled triggers. A detailed statistical analysis of the results indicates which parameters have the greatest effect on the performance of evolutionary algorithms. The empirical results show that an evolutionary algorithm using the proposed representations is an improvement over the results obtained by a recent state of the art hybrid genetic algorithm for pump scheduling using level-controlled triggers.
Ross, Craig S; Brewer, Robert D; Jernigan, David H
2016-01-01
The purpose of this study was to outline a method to improve alcohol industry compliance with its self-regulatory advertising placement guidelines on television with the goal of reducing youth exposure to noncompliant advertisements. Data were sourced from Nielsen (The Nielsen Company, New York, NY) for all alcohol advertisements on television in the United States for 2005-2012. A "no-buy" list, that is a list of cable television programs and networks to be avoided when purchasing alcohol advertising, was devised using three criteria: avoid placements on programs that were noncompliant in the past (serially noncompliant), avoid placements on networks at times of day when youth make up a high proportion of the audience (high-risk network dayparts), and use a "guardbanded" (or more restrictive) composition guideline when placing ads on low-rated programs (low rated). Youth were exposed to 15.1 billion noncompliant advertising impressions from 2005 to 2012, mostly on cable television. Together, the three no-buy list criteria accounted for 99% of 12.9 billion noncompliant advertising exposures on cable television for youth ages 2-20 years. When we evaluated the no-buy list criteria sequentially and mutually exclusively, serially noncompliant ads accounted for 67% of noncompliant exposure, high-risk network-daypart ads accounted for 26%, and low-rated ads accounted for 7%. These findings suggest that the prospective use of the no-buy list criteria when purchasing alcohol advertising could eliminate most noncompliant advertising exposures and could be incorporated into standard post-audit procedures that are widely used by the alcohol industry in assessing exposure to television advertising.
A single determinant dominates the rate of yeast protein evolution.
Drummond, D Allan; Raval, Alpan; Wilke, Claus O
2006-02-01
A gene's rate of sequence evolution is among the most fundamental evolutionary quantities in common use, but what determines evolutionary rates has remained unclear. Here, we carry out the first combined analysis of seven predictors (gene expression level, dispensability, protein abundance, codon adaptation index, gene length, number of protein-protein interactions, and the gene's centrality in the interaction network) previously reported to have independent influences on protein evolutionary rates. Strikingly, our analysis reveals a single dominant variable linked to the number of translation events which explains 40-fold more variation in evolutionary rate than any other, suggesting that protein evolutionary rate has a single major determinant among the seven predictors. The dominant variable explains nearly half the variation in the rate of synonymous and protein evolution. We show that the two most commonly used methods to disentangle the determinants of evolutionary rate, partial correlation analysis and ordinary multivariate regression, produce misleading or spurious results when applied to noisy biological data. We overcome these difficulties by employing principal component regression, a multivariate regression of evolutionary rate against the principal components of the predictor variables. Our results support the hypothesis that translational selection governs the rate of synonymous and protein sequence evolution in yeast.
Nature-Inspired Cognitive Evolution to Play MS. Pac-Man
NASA Astrophysics Data System (ADS)
Tan, Tse Guan; Teo, Jason; Anthony, Patricia
Recent developments in nature-inspired computation have heightened the need for research into the three main areas of scientific, engineering and industrial applications. Some approaches have reported that it is able to solve dynamic problems and very useful for improving the performance of various complex systems. So far however, there has been little discussion about the effectiveness of the application of these models to computer and video games in particular. The focus of this research is to explore the hybridization of nature-inspired computation methods for optimization of neural network-based cognition in video games, in this case the combination of a neural network with an evolutionary algorithm. In essence, a neural network is an attempt to mimic the extremely complex human brain system, which is building an artificial brain that is able to self-learn intelligently. On the other hand, an evolutionary algorithm is to simulate the biological evolutionary processes that evolve potential solutions in order to solve the problems or tasks by applying the genetic operators such as crossover, mutation and selection into the solutions. This paper investigates the abilities of Evolution Strategies (ES) to evolve feed-forward artificial neural network's internal parameters (i.e. weight and bias values) for automatically generating Ms. Pac-man controllers. The main objective of this game is to clear a maze of dots while avoiding the ghosts and to achieve the highest possible score. The experimental results show that an ES-based system can be successfully applied to automatically generate artificial intelligence for a complex, dynamic and highly stochastic video game environment.
A Study of Driver's Route Choice Behavior Based on Evolutionary Game Theory
Jiang, Xiaowei; Ji, Yanjie; Deng, Wei
2014-01-01
This paper proposes a route choice analytic method that embeds cumulative prospect theory in evolutionary game theory to analyze how the drivers adjust their route choice behaviors under the influence of the traffic information. A simulated network with two alternative routes and one variable message sign is built to illustrate the analytic method. We assume that the drivers in the transportation system are bounded rational, and the traffic information they receive is incomplete. An evolutionary game model is constructed to describe the evolutionary process of the drivers' route choice decision-making behaviors. Here we conclude that the traffic information plays an important role in the route choice behavior. The driver's route decision-making process develops towards different evolutionary stable states in accordance with different transportation situations. The analysis results also demonstrate that employing cumulative prospect theory and evolutionary game theory to study the driver's route choice behavior is effective. This analytic method provides an academic support and suggestion for the traffic guidance system, and may optimize the travel efficiency to a certain extent. PMID:25610455
A study of driver's route choice behavior based on evolutionary game theory.
Jiang, Xiaowei; Ji, Yanjie; Du, Muqing; Deng, Wei
2014-01-01
This paper proposes a route choice analytic method that embeds cumulative prospect theory in evolutionary game theory to analyze how the drivers adjust their route choice behaviors under the influence of the traffic information. A simulated network with two alternative routes and one variable message sign is built to illustrate the analytic method. We assume that the drivers in the transportation system are bounded rational, and the traffic information they receive is incomplete. An evolutionary game model is constructed to describe the evolutionary process of the drivers' route choice decision-making behaviors. Here we conclude that the traffic information plays an important role in the route choice behavior. The driver's route decision-making process develops towards different evolutionary stable states in accordance with different transportation situations. The analysis results also demonstrate that employing cumulative prospect theory and evolutionary game theory to study the driver's route choice behavior is effective. This analytic method provides an academic support and suggestion for the traffic guidance system, and may optimize the travel efficiency to a certain extent.
NASA Astrophysics Data System (ADS)
Dash, Rajashree
2017-11-01
Forecasting purchasing power of one currency with respect to another currency is always an interesting topic in the field of financial time series prediction. Despite the existence of several traditional and computational models for currency exchange rate forecasting, there is always a need for developing simpler and more efficient model, which will produce better prediction capability. In this paper, an evolutionary framework is proposed by using an improved shuffled frog leaping (ISFL) algorithm with a computationally efficient functional link artificial neural network (CEFLANN) for prediction of currency exchange rate. The model is validated by observing the monthly prediction measures obtained for three currency exchange data sets such as USD/CAD, USD/CHF, and USD/JPY accumulated within same period of time. The model performance is also compared with two other evolutionary learning techniques such as Shuffled frog leaping algorithm and Particle Swarm optimization algorithm. Practical analysis of results suggest that, the proposed model developed using the ISFL algorithm with CEFLANN network is a promising predictor model for currency exchange rate prediction compared to other models included in the study.
Mooers, Arne Ø.; Caccone, Adalgisa; Russello, Michael A.
2016-01-01
In the midst of the current biodiversity crisis, conservation efforts might profitably be directed towards ensuring that extinctions do not result in inordinate losses of evolutionary history. Numerous methods have been developed to evaluate the importance of species based on their contribution to total phylogenetic diversity on trees and networks, but existing methods fail to take complementarity into account, and thus cannot identify the best order or subset of taxa to protect. Here, we develop a novel iterative calculation of the heightened evolutionary distinctiveness and globally endangered metric (I-HEDGE) that produces the optimal ranked list for conservation prioritization, taking into account complementarity and based on both phylogenetic diversity and extinction probability. We applied this metric to a phylogenetic network based on mitochondrial control region data from extant and recently extinct giant Galápagos tortoises, a highly endangered group of closely related species. We found that the restoration of two extinct species (a project currently underway) will contribute the greatest gain in phylogenetic diversity, and present an ordered list of rankings that is the optimum complementarity set for conservation prioritization. PMID:27635324
Jensen, Evelyn L; Mooers, Arne Ø; Caccone, Adalgisa; Russello, Michael A
2016-01-01
In the midst of the current biodiversity crisis, conservation efforts might profitably be directed towards ensuring that extinctions do not result in inordinate losses of evolutionary history. Numerous methods have been developed to evaluate the importance of species based on their contribution to total phylogenetic diversity on trees and networks, but existing methods fail to take complementarity into account, and thus cannot identify the best order or subset of taxa to protect. Here, we develop a novel iterative calculation of the heightened evolutionary distinctiveness and globally endangered metric (I-HEDGE) that produces the optimal ranked list for conservation prioritization, taking into account complementarity and based on both phylogenetic diversity and extinction probability. We applied this metric to a phylogenetic network based on mitochondrial control region data from extant and recently extinct giant Galápagos tortoises, a highly endangered group of closely related species. We found that the restoration of two extinct species (a project currently underway) will contribute the greatest gain in phylogenetic diversity, and present an ordered list of rankings that is the optimum complementarity set for conservation prioritization.
Wang, Xue; Wang, Sheng; Ma, Jun-Jie
2007-01-01
The effectiveness of wireless sensor networks (WSNs) depends on the coverage and target detection probability provided by dynamic deployment, which is usually supported by the virtual force (VF) algorithm. However, in the VF algorithm, the virtual force exerted by stationary sensor nodes will hinder the movement of mobile sensor nodes. Particle swarm optimization (PSO) is introduced as another dynamic deployment algorithm, but in this case the computation time required is the big bottleneck. This paper proposes a dynamic deployment algorithm which is named “virtual force directed co-evolutionary particle swarm optimization” (VFCPSO), since this algorithm combines the co-evolutionary particle swarm optimization (CPSO) with the VF algorithm, whereby the CPSO uses multiple swarms to optimize different components of the solution vectors for dynamic deployment cooperatively and the velocity of each particle is updated according to not only the historical local and global optimal solutions, but also the virtual forces of sensor nodes. Simulation results demonstrate that the proposed VFCPSO is competent for dynamic deployment in WSNs and has better performance with respect to computation time and effectiveness than the VF, PSO and VFPSO algorithms.
NASA Astrophysics Data System (ADS)
Sheynin, Yuriy; Shutenko, Felix; Suvorova, Elena; Yablokov, Evgenej
2008-04-01
High rate interconnections are important subsystems in modern data processing and control systems of many classes. They are especially important in prospective embedded and on-board systems that used to be multicomponent systems with parallel or distributed architecture, [1]. Modular architecture systems of previous generations were based on parallel busses that were widely used and standardised: VME, PCI, CompactPCI, etc. Busses evolution went in improvement of bus protocol efficiency (burst transactions, split transactions, etc.) and increasing operation frequencies. However, due to multi-drop bus nature and multi-wire skew problems the parallel bussing speedup became more and more limited. For embedded and on-board systems additional reason for this trend was in weight, size and power constraints of an interconnection and its components. Parallel interfaces have become technologically more challenging as their respective clock frequencies have increased to keep pace with the bandwidth requirements of their attached storage devices. Since each interface uses a data clock to gate and validate the parallel data (which is normally 8 bits or 16 bits wide), the clock frequency need only be equivalent to the byte rate or word rate being transmitted. In other words, for a given transmission frequency, the wider the data bus, the slower the clock. As the clock frequency increases, more high frequency energy is available in each of the data lines, and a portion of this energy is dissipated in radiation. Each data line not only transmits this energy but also receives some from its neighbours. This form of mutual interference is commonly called "cross-talk," and the signal distortion it produces can become another major contributor to loss of data integrity unless compensated by appropriate cable designs. Other transmission problems such as frequency-dependent attenuation and signal reflections, while also applicable to serial interfaces, are more troublesome in parallel interfaces due to the number of additional cable conductors involved. In order to compensate for these drawbacks, higher quality cables, shorter cable runs and fewer devices on the bus have been the norm. Finally, the physical bulk of the parallel cables makes them more difficult to route inside an enclosure, hinders cooling airflow and is incompatible with the trend toward smaller form-factor devices. Parallel busses worked in systems during the past 20 years, but the accumulated problems dictate the need for change and the technology is available to spur the transition. The general trend in high-rate interconnections turned from parallel bussing to scalable interconnections with a network architecture and high-rate point-to-point links. Analysis showed that data links with serial information transfer could achieve higher throughput and efficiency and it was confirmed in various research and practical design. Serial interfaces offer an improvement over older parallel interfaces: better performance, better scalability, and also better reliability as the parallel interfaces are at their limits of speed with reliable data transfers and others. The trend was implemented in major standards' families evolution: e.g. from PCI/PCI-X parallel bussing to PCIExpress interconnection architecture with serial lines, from CompactPCI parallel bus to ATCA (Advanced Telecommunications Architecture) specification with serial links and network topologies of an interconnection, etc. In the article we consider a general set of characteristics and features of serial interconnections, give a brief overview of serial interconnections specifications. In more details we present the SpaceWire interconnection technology. Have been developed for space on-board systems applications the SpaceWire has important features and characteristics that make it a prospective interconnection for wide range of embedded systems.
Spatial Structure of Evolutionary Models of Dialects in Contact
Murawaki, Yugo
2015-01-01
Phylogenetic models, originally developed to demonstrate evolutionary biology, have been applied to a wide range of cultural data including natural language lexicons, manuscripts, folktales, material cultures, and religions. A fundamental question regarding the application of phylogenetic inference is whether trees are an appropriate approximation of cultural evolutionary history. Their validity in cultural applications has been scrutinized, particularly with respect to the lexicons of dialects in contact. Phylogenetic models organize evolutionary data into a series of branching events through time. However, branching events are typically not included in dialectological studies to interpret the distributions of lexical terms. Instead, dialectologists have offered spatial interpretations to represent lexical data. For example, new lexical items that emerge in a politico-cultural center are likely to spread to peripheries, but not vice versa. To explore the question of the tree model’s validity, we present a simple simulation model in which dialects form a spatial network and share lexical items through contact rather than through common ancestors. We input several network topologies to the model to generate synthetic data. We then analyze the synthesized data using conventional phylogenetic techniques. We found that a group of dialects can be considered tree-like even if it has not evolved in a temporally tree-like manner but has a temporally invariant, spatially tree-like structure. In addition, the simulation experiments appear to reproduce unnatural results observed in reconstructed trees for real data. These results motivate further investigation into the spatial structure of the evolutionary history of dialect lexicons as well as other cultural characteristics. PMID:26221958
Kiranyaz, Serkan; Mäkinen, Toni; Gabbouj, Moncef
2012-10-01
In this paper, we propose a novel framework based on a collective network of evolutionary binary classifiers (CNBC) to address the problems of feature and class scalability. The main goal of the proposed framework is to achieve a high classification performance over dynamic audio and video repositories. The proposed framework adopts a "Divide and Conquer" approach in which an individual network of binary classifiers (NBC) is allocated to discriminate each audio class. An evolutionary search is applied to find the best binary classifier in each NBC with respect to a given criterion. Through the incremental evolution sessions, the CNBC framework can dynamically adapt to each new incoming class or feature set without resorting to a full-scale re-training or re-configuration. Therefore, the CNBC framework is particularly designed for dynamically varying databases where no conventional static classifiers can adapt to such changes. In short, it is entirely a novel topology, an unprecedented approach for dynamic, content/data adaptive and scalable audio classification. A large set of audio features can be effectively used in the framework, where the CNBCs make appropriate selections and combinations so as to achieve the highest discrimination among individual audio classes. Experiments demonstrate a high classification accuracy (above 90%) and efficiency of the proposed framework over large and dynamic audio databases. Copyright © 2012 Elsevier Ltd. All rights reserved.
Affective Monitoring: A Generic Mechanism for Affect Elicitation
Phaf, R. Hans; Rotteveel, Mark
2012-01-01
In this paper we sketch a new framework for affect elicitation, which is based on previous evolutionary and connectionist modeling and experimental work from our group. Affective monitoring is considered a local match–mismatch process within a module of the neural network. Negative affect is raised instantly by mismatches, incongruency, disfluency, novelty, incoherence, and dissonance, whereas positive affect follows from matches, congruency, fluency, familiarity, coherence, and resonance, at least when an initial mismatch can be solved quickly. Affective monitoring is considered an evolutionary-early conflict and change detection process operating at the same level as, for instance, attentional selection. It runs in parallel and imparts affective flavor to emotional behavior systems, which involve evolutionary-prepared stimuli and action tendencies related to for instance defensive, exploratory, attachment, or appetitive behavior. Positive affect is represented in the networks by high-frequency oscillations, presumably in the gamma band. Negative affect corresponds to more incoherent lower-frequency oscillations, presumably in the theta band. For affect to become conscious, large-scale synchronization of the oscillations over the network and the construction of emotional experiences are required. These constructions involve perceptions of bodily states and action tendencies, but also appraisals as well as efforts to regulate the emotion. Importantly, affective monitoring accompanies every kind of information processing, but conscious emotions, which result from the later integration of affect in a cognitive context, are much rarer events. PMID:22403557
Target recognition of ladar range images using even-order Zernike moments.
Liu, Zheng-Jun; Li, Qi; Xia, Zhi-Wei; Wang, Qi
2012-11-01
Ladar range images have attracted considerable attention in automatic target recognition fields. In this paper, Zernike moments (ZMs) are applied to classify the target of the range image from an arbitrary azimuth angle. However, ZMs suffer from high computational costs. To improve the performance of target recognition based on small samples, even-order ZMs with serial-parallel backpropagation neural networks (BPNNs) are applied to recognize the target of the range image. It is found that the rotation invariance and classified performance of the even-order ZMs are both better than for odd-order moments and for moments compressed by principal component analysis. The experimental results demonstrate that combining the even-order ZMs with serial-parallel BPNNs can significantly improve the recognition rate for small samples.
A Neural Network Model of the Structure and Dynamics of Human Personality
ERIC Educational Resources Information Center
Read, Stephen J.; Monroe, Brian M.; Brownstein, Aaron L.; Yang, Yu; Chopra, Gurveen; Miller, Lynn C.
2010-01-01
We present a neural network model that aims to bridge the historical gap between dynamic and structural approaches to personality. The model integrates work on the structure of the trait lexicon, the neurobiology of personality, temperament, goal-based models of personality, and an evolutionary analysis of motives. It is organized in terms of two…
USDA-ARS?s Scientific Manuscript database
Reconstructing the phylogeny of Pyrus has been difficult due to the wide distribution of the genus and lack of informative data. In this study, we collected 110 accessions representing 25 Pyrus species and constructed both phylogenetic trees and phylogenetic networks based on multiple DNA sequence d...
Topology-dependent density optima for efficient simultaneous network exploration
NASA Astrophysics Data System (ADS)
Wilson, Daniel B.; Baker, Ruth E.; Woodhouse, Francis G.
2018-06-01
A random search process in a networked environment is governed by the time it takes to visit every node, termed the cover time. Often, a networked process does not proceed in isolation but competes with many instances of itself within the same environment. A key unanswered question is how to optimize this process: How many concurrent searchers can a topology support before the benefits of parallelism are outweighed by competition for space? Here, we introduce the searcher-averaged parallel cover time (APCT) to quantify these economies of scale. We show that the APCT of the networked symmetric exclusion process is optimized at a searcher density that is well predicted by the spectral gap. Furthermore, we find that nonequilibrium processes, realized through the addition of bias, can support significantly increased density optima. Our results suggest alternative hybrid strategies of serial and parallel search for efficient information gathering in social interaction and biological transport networks.
Convergent evolution of gene networks by single-gene duplications in higher eukaryotes.
Amoutzias, Gregory D; Robertson, David L; Oliver, Stephen G; Bornberg-Bauer, Erich
2004-03-01
By combining phylogenetic, proteomic and structural information, we have elucidated the evolutionary driving forces for the gene-regulatory interaction networks of basic helix-loop-helix transcription factors. We infer that recurrent events of single-gene duplication and domain rearrangement repeatedly gave rise to distinct networks with almost identical hub-based topologies, and multiple activators and repressors. We thus provide the first empirical evidence for scale-free protein networks emerging through single-gene duplications, the dominant importance of molecular modularity in the bottom-up construction of complex biological entities, and the convergent evolution of networks.
Wang, Wen-Xu; Lai, Ying-Cheng; Armbruster, Dieter
2011-09-01
We study catastrophic behaviors in large networked systems in the paradigm of evolutionary games by incorporating a realistic "death" or "bankruptcy" mechanism. We find that a cascading bankruptcy process can arise when defection strategies exist and individuals are vulnerable to deficit. Strikingly, we observe that, after the catastrophic cascading process terminates, cooperators are the sole survivors, regardless of the game types and of the connection patterns among individuals as determined by the topology of the underlying network. It is necessary that individuals cooperate with each other to survive the catastrophic failures. Cooperation thus becomes the optimal strategy and absolutely outperforms defection in the game evolution with respect to the "death" mechanism. Our results can be useful for understanding large-scale catastrophe in real-world systems and in particular, they may yield insights into significant social and economical phenomena such as large-scale failures of financial institutions and corporations during an economic recession.
NASA Astrophysics Data System (ADS)
Wang, Wen-Xu; Lai, Ying-Cheng; Armbruster, Dieter
2011-09-01
We study catastrophic behaviors in large networked systems in the paradigm of evolutionary games by incorporating a realistic "death" or "bankruptcy" mechanism. We find that a cascading bankruptcy process can arise when defection strategies exist and individuals are vulnerable to deficit. Strikingly, we observe that, after the catastrophic cascading process terminates, cooperators are the sole survivors, regardless of the game types and of the connection patterns among individuals as determined by the topology of the underlying network. It is necessary that individuals cooperate with each other to survive the catastrophic failures. Cooperation thus becomes the optimal strategy and absolutely outperforms defection in the game evolution with respect to the "death" mechanism. Our results can be useful for understanding large-scale catastrophe in real-world systems and in particular, they may yield insights into significant social and economical phenomena such as large-scale failures of financial institutions and corporations during an economic recession.
Impact of Social Reward on the Evolution of the Cooperation Behavior in Complex Networks
NASA Astrophysics Data System (ADS)
Wu, Yu'E.; Chang, Shuhua; Zhang, Zhipeng; Deng, Zhenghong
2017-01-01
Social reward, as a significant mechanism explaining the evolution of cooperation, has attracted great attention both theoretically and experimentally. In this paper, we study the evolution of cooperation by proposing a reward model in network population, where a third strategy, reward, as an independent yet particular type of cooperation is introduced in 2-person evolutionary games. Specifically, a new kind of role corresponding to reward strategy, reward agents, is defined, which is aimed at increasing the income of cooperators by applying to them a social reward. Results from numerical simulations show that consideration of social reward greatly promotes the evolution of cooperation, which is confirmed for different network topologies and two evolutionary games. Moreover, we explore the microscopic mechanisms for the promotion of cooperation in the three-strategy model. As expected, the reward agents play a vital role in the formation of cooperative clusters, thus resisting the aggression of defectors. Our research might provide valuable insights into further exploring the nature of cooperation in the real world.
Impact of Social Reward on the Evolution of the Cooperation Behavior in Complex Networks
Wu, Yu’e; Chang, Shuhua; Zhang, Zhipeng; Deng, Zhenghong
2017-01-01
Social reward, as a significant mechanism explaining the evolution of cooperation, has attracted great attention both theoretically and experimentally. In this paper, we study the evolution of cooperation by proposing a reward model in network population, where a third strategy, reward, as an independent yet particular type of cooperation is introduced in 2-person evolutionary games. Specifically, a new kind of role corresponding to reward strategy, reward agents, is defined, which is aimed at increasing the income of cooperators by applying to them a social reward. Results from numerical simulations show that consideration of social reward greatly promotes the evolution of cooperation, which is confirmed for different network topologies and two evolutionary games. Moreover, we explore the microscopic mechanisms for the promotion of cooperation in the three-strategy model. As expected, the reward agents play a vital role in the formation of cooperative clusters, thus resisting the aggression of defectors. Our research might provide valuable insights into further exploring the nature of cooperation in the real world. PMID:28112276
Yun, Anthony J; Lee, Patrick Y; Doux, John D
2006-01-01
A network constitutes an abstract description of the relationships among entities, respectively termed links and nodes. If a power law describes the probability distribution of the number of links per node, the network is said to be scale-free. Scale-free networks feature link clustering around certain hubs based on preferential attachments that emerge due either to merit or legacy. Biologic systems ranging from sub-atomic to ecosystems represent scale-free networks in which energy efficiency forms the basis of preferential attachments. This paradigm engenders a novel scale-free network theory of evolution based on energy efficiency. As environmental flux induces fitness dislocations and compels a new meritocracy, new merit-based hubs emerge, previously merit-based hubs become legacy hubs, and network recalibration occurs to achieve system optimization. To date, Darwinian evolution, characterized by innovation sampling, variation, and selection through filtered termination, has enabled biologic progress through optimization of energy efficiency. However, as humans remodel their environment, increasing the level of unanticipated fitness dislocations and inducing evolutionary stress, the tendency of networks to exhibit inertia and retain legacy hubs engender maladaptations. Many modern diseases may fundamentally derive from these evolutionary displacements. Death itself may constitute a programmed adaptation, terminating individuals who represent legacy hubs and recalibrating the network. As memes replace genes as the basis of innovation, death itself has become a legacy hub. Post-Darwinian evolution may favor indefinite persistence to optimize energy efficiency. We describe strategies to reprogram or decommission legacy hubs that participate in human disease and death.
Gu, Hao; Goodale, Eben; Chen, Jin
2015-03-18
The study of mutualistic plant and animal networks is an emerging field of ecological research. We reviewed progress in this field over the past 30 years. While earlier studies mostly focused on network structure, stability, and biodiversity maintenance, recent studies have investigated the conservation implications of mutualistic networks, specifically the influence of invasive species and how networks respond to habitat loss. Current research has also focused on evolutionary questions including phylogenetic signal in networks, impact of networks on the coevolution of interacting partners, and network influences on the evolution of interacting species. We outline some directions for future research, particularly the evolution of specialization in mutualistic networks, and provide concrete recommendations for environmental managers.
Favé, Marie-Julie; Johnson, Robert A; Cover, Stefan; Handschuh, Stephan; Metscher, Brian D; Müller, Gerd B; Gopalan, Shyamalika; Abouheif, Ehab
2015-09-04
A fundamental and enduring problem in evolutionary biology is to understand how populations differentiate in the wild, yet little is known about what role organismal development plays in this process. Organismal development integrates environmental inputs with the action of gene regulatory networks to generate the phenotype. Core developmental gene networks have been highly conserved for millions of years across all animals, and therefore, organismal development may bias variation available for selection to work on. Biased variation may facilitate repeatable phenotypic responses when exposed to similar environmental inputs and ecological changes. To gain a more complete understanding of population differentiation in the wild, we integrated evolutionary developmental biology with population genetics, morphology, paleoecology and ecology. This integration was made possible by studying how populations of the ant species Monomorium emersoni respond to climatic and ecological changes across five 'Sky Islands' in Arizona, which are mountain ranges separated by vast 'seas' of desert. Sky Islands represent a replicated natural experiment allowing us to determine how repeatable is the response of M. emersoni populations to climate and ecological changes at the phenotypic, developmental, and gene network levels. We show that a core developmental gene network and its phenotype has kept pace with ecological and climate change on each Sky Island over the last ~90,000 years before present (BP). This response has produced two types of evolutionary change within an ant species: one type is unpredictable and contingent on the pattern of isolation of Sky lsland populations by climate warming, resulting in slight changes in gene expression, organ growth, and morphology. The other type is predictable and deterministic, resulting in the repeated evolution of a novel wingless queen phenotype and its underlying gene network in response to habitat changes induced by climate warming. Our findings reveal dynamics of developmental gene network evolution in wild populations. This holds important implications: (1) for understanding how phenotypic novelty is generated in the wild; (2) for providing a possible bridge between micro- and macroevolution; and (3) for understanding how development mediates the response of organisms to past, and potentially, future climate change.
Power-Aware Intrusion Detection in Mobile Ad Hoc Networks
NASA Astrophysics Data System (ADS)
Şen, Sevil; Clark, John A.; Tapiador, Juan E.
Mobile ad hoc networks (MANETs) are a highly promising new form of networking. However they are more vulnerable to attacks than wired networks. In addition, conventional intrusion detection systems (IDS) are ineffective and inefficient for highly dynamic and resource-constrained environments. Achieving an effective operational MANET requires tradeoffs to be made between functional and non-functional criteria. In this paper we show how Genetic Programming (GP) together with a Multi-Objective Evolutionary Algorithm (MOEA) can be used to synthesise intrusion detection programs that make optimal tradeoffs between security criteria and the power they consume.
Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO)
DOE Office of Scientific and Technical Information (OSTI.GOV)
The INDDGO software package offers a set of tools for finding exact solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework offers serial and parallel (distributed memory) algorithms for finding tree decompositions and solving the maximum weighted independent set problem. The parallel dynamic programming algorithm is implemented on top of the MADNESS task-based runtime.
Voices Rising: A Bulletin about Women and Popular Education. Volumes 1-4. 1987-1990.
ERIC Educational Resources Information Center
Voices Rising: A Bulletin about Women and Popular Education, 1990
1990-01-01
This document consists of the six issues of the serial "Voices Rising" issued during the four-year period 1987-1990. "Voices Rising" is the primary networking tool of the Women's Program of the International Council for Adult Education (ICAE). Articles in these issues include: "Tribute to a Courageous Woman--Nabila Breir"; "Centre for Women's…
Universal Network Access System
2003-11-01
128 Figure 37 The detail of the SCM TX , (LO; local oscillator, LPF; Low-pass filter, AMP; Amplifier, BPF ...with UNAS, ( BPF : band-pass filter, BM Rx; Burst Mode receiver, AWGR; Arrayed waveguide grating router, FBG; Fiber Bragg Grating, TL; Tunable Laser...protocols. Standard specifications and RFCs will be used as guidelines for implementation. Table 1 UNAS Serial I/O Formats Protocol Implement1
POCO-MOEA: Using Evolutionary Algorithms to Solve the Controller Placement Problem
2016-03-24
to gather data on POCO-MOEA performance to a series of iv model networks. The algorithm’s behavior is then evaluated and compared to ex- haustive... evaluation of a third heuristic based on a Multi 3 Objective Evolutionary Algorithm (MOEA). This heuristic is modeled after one of the most well known MOEAs...researchers to extend into more realistic evaluations of the performance characteristics of SDN controllers, such as the use of simulators or live
Secuencias evolutivas e isocronas para estrellas de baja masa e intermedia
NASA Astrophysics Data System (ADS)
Panei, J.; Baume, G.
2016-08-01
We present theoretical evolutionary sequences for low- and intermediate-mass stars. The masses calculated range from 1.7 to 10 M. The initial chemical composition is . In addition, we have taken into account a nuclear network with 17 isotopes and 34 nuclear reactions. With respect to the mix, we considered overshooting with a parameter . The evolutionary calculations were initialized from the region of instability of Hayashi, in order to calculate isochrones of pre-sequence, too.
Unraveling the Tangled Skein: The Evolution of Transcriptional Regulatory Networks in Development.
Rebeiz, Mark; Patel, Nipam H; Hinman, Veronica F
2015-01-01
The molecular and genetic basis for the evolution of anatomical diversity is a major question that has inspired evolutionary and developmental biologists for decades. Because morphology takes form during development, a true comprehension of how anatomical structures evolve requires an understanding of the evolutionary events that alter developmental genetic programs. Vast gene regulatory networks (GRNs) that connect transcription factors to their target regulatory sequences control gene expression in time and space and therefore determine the tissue-specific genetic programs that shape morphological structures. In recent years, many new examples have greatly advanced our understanding of the genetic alterations that modify GRNs to generate newly evolved morphologies. Here, we review several aspects of GRN evolution, including their deep preservation, their mechanisms of alteration, and how they originate to generate novel developmental programs.
Active Low Intrusion Hybrid Monitor for Wireless Sensor Networks
Navia, Marlon; Campelo, Jose C.; Bonastre, Alberto; Ors, Rafael; Capella, Juan V.; Serrano, Juan J.
2015-01-01
Several systems have been proposed to monitor wireless sensor networks (WSN). These systems may be active (causing a high degree of intrusion) or passive (low observability inside the nodes). This paper presents the implementation of an active hybrid (hardware and software) monitor with low intrusion. It is based on the addition to the sensor node of a monitor node (hardware part) which, through a standard interface, is able to receive the monitoring information sent by a piece of software executed in the sensor node. The intrusion on time, code, and energy caused in the sensor nodes by the monitor is evaluated as a function of data size and the interface used. Then different interfaces, commonly available in sensor nodes, are evaluated: serial transmission (USART), serial peripheral interface (SPI), and parallel. The proposed hybrid monitor provides highly detailed information, barely disturbed by the measurement tool (interference), about the behavior of the WSN that may be used to evaluate many properties such as performance, dependability, security, etc. Monitor nodes are self-powered and may be removed after the monitoring campaign to be reused in other campaigns and/or WSNs. No other hardware-independent monitoring platforms with such low interference have been found in the literature. PMID:26393604
YADCLAN: yet another digitally-controlled linear artificial neuron.
Frenger, Paul
2003-01-01
This paper updates the author's 1999 RMBS presentation on digitally controlled linear artificial neuron design. Each neuron is based on a standard operational amplifier having excitatory and inhibitory inputs, variable gain, an amplified linear analog output and an adjustable threshold comparator for digital output. This design employs a 1-wire serial network of digitally controlled potentiometers and resistors whose resistance values are set and read back under microprocessor supervision. This system embodies several unique and useful features, including: enhanced neuronal stability, dynamic reconfigurability and network extensibility. This artificial neuronal is being employed for feature extraction and pattern recognition in an advanced robotic application.
Applications considerations in the system design of highly concurrent multiprocessors
NASA Technical Reports Server (NTRS)
Lundstrom, Stephen F.
1987-01-01
A flow model processor approach to parallel processing is described, using very-high-performance individual processors, high-speed circuit switched interconnection networks, and a high-speed synchronization capability to minimize the effect of the inherently serial portions of applications on performance. Design studies related to the determination of the number of processors, the memory organization, and the structure of the networks used to interconnect the processor and memory resources are discussed. Simulations indicate that applications centered on the large shared data memory should be able to sustain over 500 million floating point operations per second.
Emergence of diversity in homogeneous coupled Boolean networks
NASA Astrophysics Data System (ADS)
Kang, Chris; Aguilar, Boris; Shmulevich, Ilya
2018-05-01
The origin of multicellularity in metazoa is one of the fundamental questions of evolutionary biology. We have modeled the generic behaviors of gene regulatory networks in isogenic cells as stochastic nonlinear dynamical systems—coupled Boolean networks with perturbation. Model simulations under a variety of dynamical regimes suggest that the central characteristic of multicellularity, permanent spatial differentiation (diversification), indeed can arise. Additionally, we observe that diversification is more likely to occur near the critical regime of Lyapunov stability.
2010-03-01
separate LoA heuristic. If any of the examined heuristics produced competitive player , then the final measurement was a success . Barring that, a...if offline training actually results in a successful player . Whereas offline learning plays many games and then trains as many networks as desired...a competitive Lines of Action player , shedding light on the difficulty of developing a neural network to model such a large and complex solution
Evolution of canalizing Boolean networks
NASA Astrophysics Data System (ADS)
Szejka, A.; Drossel, B.
2007-04-01
Boolean networks with canalizing functions are used to model gene regulatory networks. In order to learn how such networks may behave under evolutionary forces, we simulate the evolution of a single Boolean network by means of an adaptive walk, which allows us to explore the fitness landscape. Mutations change the connections and the functions of the nodes. Our fitness criterion is the robustness of the dynamical attractors against small perturbations. We find that with this fitness criterion the global maximum is always reached and that there is a huge neutral space of 100% fitness. Furthermore, in spite of having such a high degree of robustness, the evolved networks still share many features with “chaotic” networks.
Metabolism and evolution: A comparative study of reconstructed genome-level metabolic networks
NASA Astrophysics Data System (ADS)
Almaas, Eivind
2008-03-01
The availability of high-quality annotations of sequenced genomes has made it possible to generate organism-specific comprehensive maps of cellular metabolism. Currently, more than twenty such metabolic reconstructions are publicly available, with the majority focused on bacteria. A typical metabolic reconstruction for a bacterium results in a complex network containing hundreds of metabolites (nodes) and reactions (links), while some even contain more than a thousand. The constrain-based optimization approach of flux-balance analysis (FBA) is used to investigate the functional characteristics of such large-scale metabolic networks, making it possible to estimate an organism's growth behavior in a wide variety of nutrient environments, as well as its robustness to gene loss. We have recently completed the genome-level metabolic reconstruction of Yersinia pseudotuberculosis, as well as the three Yersinia pestis biovars Antiqua, Mediaevalis, and Orientalis. While Y. pseudotuberculosis typically only causes fever and abdominal pain that can mimic appendicitis, the evolutionary closely related Y. pestis strains are the aetiological agents of the bubonic plague. In this presentation, I will discuss our results and conclusions from a comparative study on the evolution of metabolic function in the four Yersiniae networks using FBA and related techniques, and I will give particular focus to the interplay between metabolic network topology and evolutionary flexibility.
Verma, Amit K; Diwan, Danish; Raut, Sandeep; Dobriyal, Neha; Brown, Rebecca E; Gowda, Vinita; Hines, Justin K; Sahi, Chandan
2017-06-07
Heat shock proteins of 70 kDa (Hsp70s) partner with structurally diverse Hsp40s (J proteins), generating distinct chaperone networks in various cellular compartments that perform myriad housekeeping and stress-associated functions in all organisms. Plants, being sessile, need to constantly maintain their cellular proteostasis in response to external environmental cues. In these situations, the Hsp70:J protein machines may play an important role in fine-tuning cellular protein quality control. Although ubiquitous, the functional specificity and complexity of the plant Hsp70:J protein network has not been studied. Here, we analyzed the J protein network in the cytosol of Arabidopsis thaliana and, using yeast genetics, show that the functional specificities of most plant J proteins in fundamental chaperone functions are conserved across long evolutionary timescales. Detailed phylogenetic and functional analysis revealed that increased number, regulatory differences, and neofunctionalization in J proteins together contribute to the emerging functional diversity and complexity in the Hsp70:J protein network in higher plants. Based on the data presented, we propose that higher plants have orchestrated their "chaperome," especially their J protein complement, according to their specialized cellular and physiological stipulations. Copyright © 2017 Verma et al.
The Handicap Principle for Trust in Computer Security, the Semantic Web and Social Networking
NASA Astrophysics Data System (ADS)
Ma, Zhanshan (Sam); Krings, Axel W.; Hung, Chih-Cheng
Communication is a fundamental function of life, and it exists in almost all living things: from single-cell bacteria to human beings. Communication, together with competition and cooperation,arethree fundamental processes in nature. Computer scientists are familiar with the study of competition or 'struggle for life' through Darwin's evolutionary theory, or even evolutionary computing. They may be equally familiar with the study of cooperation or altruism through the Prisoner's Dilemma (PD) game. However, they are likely to be less familiar with the theory of animal communication. The objective of this article is three-fold: (i) To suggest that the study of animal communication, especially the honesty (reliability) of animal communication, in which some significant advances in behavioral biology have been achieved in the last three decades, should be on the verge to spawn important cross-disciplinary research similar to that generated by the study of cooperation with the PD game. One of the far-reaching advances in the field is marked by the publication of "The Handicap Principle: a Missing Piece of Darwin's Puzzle" by Zahavi (1997). The 'Handicap' principle [34][35], which states that communication signals must be costly in some proper way to be reliable (honest), is best elucidated with evolutionary games, e.g., Sir Philip Sidney (SPS) game [23]. Accordingly, we suggest that the Handicap principle may serve as a fundamental paradigm for trust research in computer science. (ii) To suggest to computer scientists that their expertise in modeling computer networks may help behavioral biologists in their study of the reliability of animal communication networks. This is largely due to the historical reason that, until the last decade, animal communication was studied with the dyadic paradigm (sender-receiver) rather than with the network paradigm. (iii) To pose several open questions, the answers to which may bear some refreshing insights to trust research in computer science, especially secure and resilient computing, the semantic web, and social networking. One important thread unifying the three aspects is the evolutionary game theory modeling or its extensions with survival analysis and agreement algorithms [19][20], which offer powerful game models for describing time-, space-, and covariate-dependent frailty (uncertainty and vulnerability) and deception (honesty).
Phylogenetic diversity and biodiversity indices on phylogenetic networks.
Wicke, Kristina; Fischer, Mareike
2018-04-01
In biodiversity conservation it is often necessary to prioritize the species to conserve. Existing approaches to prioritization, e.g. the Fair Proportion Index and the Shapley Value, are based on phylogenetic trees and rank species according to their contribution to overall phylogenetic diversity. However, in many cases evolution is not treelike and thus, phylogenetic networks have been developed as a generalization of phylogenetic trees, allowing for the representation of non-treelike evolutionary events, such as hybridization. Here, we extend the concepts of phylogenetic diversity and phylogenetic diversity indices from phylogenetic trees to phylogenetic networks. On the one hand, we consider the treelike content of a phylogenetic network, e.g. the (multi)set of phylogenetic trees displayed by a network and the so-called lowest stable ancestor tree associated with it. On the other hand, we derive the phylogenetic diversity of subsets of taxa and biodiversity indices directly from the internal structure of the network. We consider both approaches that are independent of so-called inheritance probabilities as well as approaches that explicitly incorporate these probabilities. Furthermore, we introduce our software package NetDiversity, which is implemented in Perl and allows for the calculation of all generalized measures of phylogenetic diversity and generalized phylogenetic diversity indices established in this note that are independent of inheritance probabilities. We apply our methods to a phylogenetic network representing the evolutionary relationships among swordtails and platyfishes (Xiphophorus: Poeciliidae), a group of species characterized by widespread hybridization. Copyright © 2018 Elsevier Inc. All rights reserved.
Statistical mechanics of scale-free gene expression networks
NASA Astrophysics Data System (ADS)
Gross, Eitan
2012-12-01
The gene co-expression networks of many organisms including bacteria, mice and man exhibit scale-free distribution. This heterogeneous distribution of connections decreases the vulnerability of the network to random attacks and thus may confer the genetic replication machinery an intrinsic resilience to such attacks, triggered by changing environmental conditions that the organism may be subject to during evolution. This resilience to random attacks comes at an energetic cost, however, reflected by the lower entropy of the scale-free distribution compared to the more homogenous, random network. In this study we found that the cell cycle-regulated gene expression pattern of the yeast Saccharomyces cerevisiae obeys a power-law distribution with an exponent α = 2.1 and an entropy of 1.58. The latter is very close to the maximal value of 1.65 obtained from linear optimization of the entropy function under the constraint of a constant cost function, determined by the average degree connectivity
Do Branch Lengths Help to Locate a Tree in a Phylogenetic Network?
Gambette, Philippe; van Iersel, Leo; Kelk, Steven; Pardi, Fabio; Scornavacca, Celine
2016-09-01
Phylogenetic networks are increasingly used in evolutionary biology to represent the history of species that have undergone reticulate events such as horizontal gene transfer, hybrid speciation and recombination. One of the most fundamental questions that arise in this context is whether the evolution of a gene with one copy in all species can be explained by a given network. In mathematical terms, this is often translated in the following way: is a given phylogenetic tree contained in a given phylogenetic network? Recently this tree containment problem has been widely investigated from a computational perspective, but most studies have only focused on the topology of the phylogenies, ignoring a piece of information that, in the case of phylogenetic trees, is routinely inferred by evolutionary analyses: branch lengths. These measure the amount of change (e.g., nucleotide substitutions) that has occurred along each branch of the phylogeny. Here, we study a number of versions of the tree containment problem that explicitly account for branch lengths. We show that, although length information has the potential to locate more precisely a tree within a network, the problem is computationally hard in its most general form. On a positive note, for a number of special cases of biological relevance, we provide algorithms that solve this problem efficiently. This includes the case of networks of limited complexity, for which it is possible to recover, among the trees contained by the network with the same topology as the input tree, the closest one in terms of branch lengths.
Surprising migration and population size dynamics in ancient Iberian brown bears (Ursus arctos)
Valdiosera, Cristina E.; García-Garitagoitia, José Luis; Garcia, Nuria; Doadrio, Ignacio; Thomas, Mark G.; Hänni, Catherine; Arsuaga, Juan-Luis; Barnes, Ian; Hofreiter, Michael; Orlando, Ludovic; Götherström, Anders
2008-01-01
The endangered brown bear populations (Ursus arctos) in Iberia have been suggested to be the last fragments of the brown bear population that served as recolonization stock for large parts of Europe during the Pleistocene. Conservation efforts are intense, and results are closely monitored. However, the efforts are based on the assumption that the Iberian bears are a unique unit that has evolved locally for an extended period. We have sequenced mitochondrial DNA (mtDNA) from ancient Iberian bear remains and analyzed them as a serial dataset, monitoring changes in diversity and occurrence of European haplogroups over time. Using these data, we show that the Iberian bear population has experienced a dynamic, recent evolutionary history. Not only has the population undergone mitochondrial gene flow from other European brown bears, but the effective population size also has fluctuated substantially. We conclude that the Iberian bear population has been a fluid evolutionary unit, developed by gene flow from other populations and population bottlenecks, far from being in genetic equilibrium or isolated from other brown bear populations. Thus, the current situation is highly unusual and the population may in fact be isolated for the first time in its history. PMID:18347332
Surprising migration and population size dynamics in ancient Iberian brown bears (Ursus arctos).
Valdiosera, Cristina E; García-Garitagoitia, José Luis; Garcia, Nuria; Doadrio, Ignacio; Thomas, Mark G; Hänni, Catherine; Arsuaga, Juan-Luis; Barnes, Ian; Hofreiter, Michael; Orlando, Ludovic; Götherström, Anders
2008-04-01
The endangered brown bear populations (Ursus arctos) in Iberia have been suggested to be the last fragments of the brown bear population that served as recolonization stock for large parts of Europe during the Pleistocene. Conservation efforts are intense, and results are closely monitored. However, the efforts are based on the assumption that the Iberian bears are a unique unit that has evolved locally for an extended period. We have sequenced mitochondrial DNA (mtDNA) from ancient Iberian bear remains and analyzed them as a serial dataset, monitoring changes in diversity and occurrence of European haplogroups over time. Using these data, we show that the Iberian bear population has experienced a dynamic, recent evolutionary history. Not only has the population undergone mitochondrial gene flow from other European brown bears, but the effective population size also has fluctuated substantially. We conclude that the Iberian bear population has been a fluid evolutionary unit, developed by gene flow from other populations and population bottlenecks, far from being in genetic equilibrium or isolated from other brown bear populations. Thus, the current situation is highly unusual and the population may in fact be isolated for the first time in its history.
Procedure for Adaptive Laboratory Evolution of Microorganisms Using a Chemostat.
Jeong, Haeyoung; Lee, Sang J; Kim, Pil
2016-09-20
Natural evolution involves genetic diversity such as environmental change and a selection between small populations. Adaptive laboratory evolution (ALE) refers to the experimental situation in which evolution is observed using living organisms under controlled conditions and stressors; organisms are thereby artificially forced to make evolutionary changes. Microorganisms are subject to a variety of stressors in the environment and are capable of regulating certain stress-inducible proteins to increase their chances of survival. Naturally occurring spontaneous mutations bring about changes in a microorganism's genome that affect its chances of survival. Long-term exposure to chemostat culture provokes an accumulation of spontaneous mutations and renders the most adaptable strain dominant. Compared to the colony transfer and serial transfer methods, chemostat culture entails the highest number of cell divisions and, therefore, the highest number of diverse populations. Although chemostat culture for ALE requires more complicated culture devices, it is less labor intensive once the operation begins. Comparative genomic and transcriptome analyses of the adapted strain provide evolutionary clues as to how the stressors contribute to mutations that overcome the stress. The goal of the current paper is to bring about accelerated evolution of microorganisms under controlled laboratory conditions.
Method for star identification using neural networks
NASA Astrophysics Data System (ADS)
Lindsey, Clark S.; Lindblad, Thomas; Eide, Age J.
1997-04-01
Identification of star constellations with an onboard star tracker provides the highest precision of all attitude determination techniques for spacecraft. A method for identification of star constellations inspired by neural network (NNW) techniques is presented. It compares feature vectors derived from histograms of distances to multiple stars around the unknown star. The NNW method appears most robust with respect to position noise and would require a smaller database than conventional methods, especially for small fields of view. The neural network method is quite slow when performed on a sequential (serial) processor, but would provide very high speed if implemented in special hardware. Such hardware solutions could also yield lower low weight and low power consumption, both important features for small satellites.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Chaiboonchoe, Amphun; Ghamsari, Lila; Dohai, Bushra
Metabolic networks, which are mathematical representations of organismal metabolism, are reconstructed to provide computational platforms to guide metabolic engineering experiments and explore fundamental questions on metabolism. Systems level analyses, such as interrogation of phylogenetic relationships within the network, can provide further guidance on the modification of metabolic circuitries. Chlamydomonas reinhardtii, a biofuel relevant green alga that has retained key genes with plant, animal, and protist affinities, serves as an ideal model organism to investigate the interplay between gene function and phylogenetic affinities at multiple organizational levels. Here, using detailed topological and functional analyses, coupled with transcriptomics studies on a metabolicmore » network that we have reconstructed for C. reinhardtii, we show that network connectivity has a significant concordance with the co-conservation of genes; however, a distinction between topological and functional relationships is observable within the network. Dynamic and static modes of co-conservation were defined and observed in a subset of gene-pairs across the network topologically. In contrast, genes with predicted synthetic interactions, or genes involved in coupled reactions, show significant enrichment for both shorter and longer phylogenetic distances. Based on our results, we propose that the metabolic network of C. reinhardtii is assembled with an architecture to minimize phylogenetic profile distances topologically, while it includes an expansion of such distances for functionally interacting genes. This arrangement may increase the robustness of C. reinhardtii's network in dealing with varied environmental challenges that the species may face. As a result, the defined evolutionary constraints within the network, which identify important pairings of genes in metabolism, may offer guidance on synthetic biology approaches to optimize the production of desirable metabolites.« less
Chaiboonchoe, Amphun; Ghamsari, Lila; Dohai, Bushra; Ng, Patrick; Khraiwesh, Basel; Jaiswal, Ashish; Jijakli, Kenan; Koussa, Joseph; Nelson, David R; Cai, Hong; Yang, Xinping; Chang, Roger L; Papin, Jason; Yu, Haiyuan; Balaji, Santhanam; Salehi-Ashtiani, Kourosh
2016-07-19
Metabolic networks, which are mathematical representations of organismal metabolism, are reconstructed to provide computational platforms to guide metabolic engineering experiments and explore fundamental questions on metabolism. Systems level analyses, such as interrogation of phylogenetic relationships within the network, can provide further guidance on the modification of metabolic circuitries. Chlamydomonas reinhardtii, a biofuel relevant green alga that has retained key genes with plant, animal, and protist affinities, serves as an ideal model organism to investigate the interplay between gene function and phylogenetic affinities at multiple organizational levels. Here, using detailed topological and functional analyses, coupled with transcriptomics studies on a metabolic network that we have reconstructed for C. reinhardtii, we show that network connectivity has a significant concordance with the co-conservation of genes; however, a distinction between topological and functional relationships is observable within the network. Dynamic and static modes of co-conservation were defined and observed in a subset of gene-pairs across the network topologically. In contrast, genes with predicted synthetic interactions, or genes involved in coupled reactions, show significant enrichment for both shorter and longer phylogenetic distances. Based on our results, we propose that the metabolic network of C. reinhardtii is assembled with an architecture to minimize phylogenetic profile distances topologically, while it includes an expansion of such distances for functionally interacting genes. This arrangement may increase the robustness of C. reinhardtii's network in dealing with varied environmental challenges that the species may face. The defined evolutionary constraints within the network, which identify important pairings of genes in metabolism, may offer guidance on synthetic biology approaches to optimize the production of desirable metabolites.
Chaiboonchoe, Amphun; Ghamsari, Lila; Dohai, Bushra; ...
2016-06-14
Metabolic networks, which are mathematical representations of organismal metabolism, are reconstructed to provide computational platforms to guide metabolic engineering experiments and explore fundamental questions on metabolism. Systems level analyses, such as interrogation of phylogenetic relationships within the network, can provide further guidance on the modification of metabolic circuitries. Chlamydomonas reinhardtii, a biofuel relevant green alga that has retained key genes with plant, animal, and protist affinities, serves as an ideal model organism to investigate the interplay between gene function and phylogenetic affinities at multiple organizational levels. Here, using detailed topological and functional analyses, coupled with transcriptomics studies on a metabolicmore » network that we have reconstructed for C. reinhardtii, we show that network connectivity has a significant concordance with the co-conservation of genes; however, a distinction between topological and functional relationships is observable within the network. Dynamic and static modes of co-conservation were defined and observed in a subset of gene-pairs across the network topologically. In contrast, genes with predicted synthetic interactions, or genes involved in coupled reactions, show significant enrichment for both shorter and longer phylogenetic distances. Based on our results, we propose that the metabolic network of C. reinhardtii is assembled with an architecture to minimize phylogenetic profile distances topologically, while it includes an expansion of such distances for functionally interacting genes. This arrangement may increase the robustness of C. reinhardtii's network in dealing with varied environmental challenges that the species may face. As a result, the defined evolutionary constraints within the network, which identify important pairings of genes in metabolism, may offer guidance on synthetic biology approaches to optimize the production of desirable metabolites.« less
Going End to End to Deliver High-Speed Data
NASA Technical Reports Server (NTRS)
2005-01-01
By the end of the 1990s, the optical fiber "backbone" of the telecommunication and data-communication networks had evolved from megabits-per-second transmission rates to gigabits-per-second transmission rates. Despite this boom in bandwidth, however, users at the end nodes were still not being reached on a consistent basis. (An end node is any device that does not behave like a router or a managed hub or switch. Examples of end node objects are computers, printers, serial interface processor phones, and unmanaged hubs and switches.) The primary reason that prevents bandwidth from reaching the end nodes is the complex local network topology that exists between the optical backbone and the end nodes. This complex network topology consists of several layers of routing and switch equipment which introduce potential congestion points and network latency. By breaking down the complex network topology, a true optical connection can be achieved. Access Optical Networks, Inc., is making this connection a reality with guidance from NASA s nondestructive evaluation experts.
Cooperation in group-structured populations with two layers of interactions
Zhang, Yanling; Fu, Feng; Chen, Xiaojie; Xie, Guangming; Wang, Long
2015-01-01
Recently there has been a growing interest in studying multiplex networks where individuals are structured in multiple network layers. Previous agent-based simulations of games on multiplex networks reveal rich dynamics arising from interdependency of interactions along each network layer, yet there is little known about analytical conditions for cooperation to evolve thereof. Here we aim to tackle this issue by calculating the evolutionary dynamics of cooperation in group-structured populations with two layers of interactions. In our model, an individual is engaged in two layers of group interactions simultaneously and uses unrelated strategies across layers. Evolutionary competition of individuals is determined by the total payoffs accrued from two layers of interactions. We also consider migration which allows individuals to move to a new group within each layer. An approach combining the coalescence theory with the theory of random walks is established to overcome the analytical difficulty upon local migration. We obtain the exact results for all “isotropic” migration patterns, particularly for migration tuned with varying ranges. When the two layers use one game, the optimal migration ranges are proved identical across layers and become smaller as the migration probability grows. PMID:26632251
Beauregard-Racine, Julie; Bicep, Cédric; Schliep, Klaus; Lopez, Philippe; Lapointe, François-Joseph; Bapteste, Eric
2011-07-20
We introduce several forest-based and network-based methods for exploring microbial evolution, and apply them to the study of thousands of genes from 30 strains of E. coli. This case study illustrates how additional analyses could offer fast heuristic alternatives to standard tree of life (TOL) approaches. We use gene networks to identify genes with atypical modes of evolution, and genome networks to characterize the evolution of genetic partnerships between E. coli and mobile genetic elements. We develop a novel polychromatic quartet method to capture patterns of recombination within E. coli, to update the clanistic toolkit, and to search for the impact of lateral gene transfer and of pathogenicity on gene evolution in two large forests of trees bearing E. coli. We unravel high rates of lateral gene transfer involving E. coli (about 40% of the trees under study), and show that both core genes and shell genes of E. coli are affected by non-tree-like evolutionary processes. We show that pathogenic lifestyle impacted the structure of 30% of the gene trees, and that pathogenic strains are more likely to transfer genes with one another than with non-pathogenic strains. In addition, we propose five groups of genes as candidate mobile modules of pathogenicity. We also present strong evidence for recent lateral gene transfer between E. coli and mobile genetic elements. Depending on which evolutionary questions biologists want to address (i.e. the identification of modules, genetic partnerships, recombination, lateral gene transfer, or genes with atypical evolutionary modes, etc.), forest-based and network-based methods are preferable to the reconstruction of a single tree, because they provide insights and produce hypotheses about the dynamics of genome evolution, rather than the relative branching order of species and lineages. Such a methodological pluralism - the use of woods and webs - is to be encouraged to analyse the evolutionary processes at play in microbial evolution.This manuscript was reviewed by: Ford Doolittle, Tal Pupko, Richard Burian, James McInerney, Didier Raoult, and Yan Boucher.
Lafontant, Pascal J; Behzad, Ali R; Brown, Evelyn; Landry, Paul; Hu, Norman; Burns, Alan R
2013-01-01
The zebrafish has emerged as an important model of heart development and regeneration. While the structural characteristics of the developing and adult zebrafish ventricle have been previously studied, little attention has been paid to the nature of the interface between the compact and spongy myocardium. Here we describe how these two distinct layers are structurally and functionally integrated. We demonstrate by transmission electron microscopy that this interface is complex and composed primarily of a junctional region occupied by collagen, as well as a population of fibroblasts that form a highly complex network. We also describe a continuum of uniquely flattened transitional cardiac myocytes that form a circumferential plate upon which the radially-oriented luminal trabeculae are anchored. In addition, we have uncovered within the transitional ring a subpopulation of markedly electron dense cardiac myocytes. At discrete intervals the transitional cardiac myocytes form contact bridges across the junctional space that are stabilized through localized desmosomes and fascia adherentes junctions with adjacent compact cardiac myocytes. Finally using serial block-face scanning electron microscopy, segmentation and volume reconstruction, we confirm the three-dimensional nature of the junctional region as well as the presence of the sheet-like fibroblast network. These ultrastructural studies demonstrate the previously unrecognized complexity with which the compact and spongy layers are structurally integrated, and provide a new basis for understanding development and regeneration in the zebrafish heart.
Ma, Li; Runesha, H Birali; Dvorkin, Daniel; Garbe, John R; Da, Yang
2008-01-01
Background Genome-wide association studies (GWAS) using single nucleotide polymorphism (SNP) markers provide opportunities to detect epistatic SNPs associated with quantitative traits and to detect the exact mode of an epistasis effect. Computational difficulty is the main bottleneck for epistasis testing in large scale GWAS. Results The EPISNPmpi and EPISNP computer programs were developed for testing single-locus and epistatic SNP effects on quantitative traits in GWAS, including tests of three single-locus effects for each SNP (SNP genotypic effect, additive and dominance effects) and five epistasis effects for each pair of SNPs (two-locus interaction, additive × additive, additive × dominance, dominance × additive, and dominance × dominance) based on the extended Kempthorne model. EPISNPmpi is the parallel computing program for epistasis testing in large scale GWAS and achieved excellent scalability for large scale analysis and portability for various parallel computing platforms. EPISNP is the serial computing program based on the EPISNPmpi code for epistasis testing in small scale GWAS using commonly available operating systems and computer hardware. Three serial computing utility programs were developed for graphical viewing of test results and epistasis networks, and for estimating CPU time and disk space requirements. Conclusion The EPISNPmpi parallel computing program provides an effective computing tool for epistasis testing in large scale GWAS, and the epiSNP serial computing programs are convenient tools for epistasis analysis in small scale GWAS using commonly available computer hardware. PMID:18644146
Craston, Patrick; Wyble, Brad; Chennu, Srivas; Bowman, Howard
2009-03-01
Observers often miss a second target (T2) if it follows an identified first target item (T1) within half a second in rapid serial visual presentation (RSVP), a finding termed the attentional blink. If two targets are presented in immediate succession, however, accuracy is excellent (Lag 1 sparing). The resource sharing hypothesis proposes a dynamic distribution of resources over a time span of up to 600 msec during the attentional blink. In contrast, the ST(2) model argues that working memory encoding is serial during the attentional blink and that, due to joint consolidation, Lag 1 is the only case where resources are shared. Experiment 1 investigates the P3 ERP component evoked by targets in RSVP. The results suggest that, in this context, P3 amplitude is an indication of bottom-up strength rather than a measure of cognitive resource allocation. Experiment 2, employing a two-target paradigm, suggests that T1 consolidation is not affected by the presentation of T2 during the attentional blink. However, if targets are presented in immediate succession (Lag 1 sparing), they are jointly encoded into working memory. We use the ST(2) model's neural network implementation, which replicates a range of behavioral results related to the attentional blink, to generate "virtual ERPs" by summing across activation traces. We compare virtual to human ERPs and show how the results suggest a serial nature of working memory encoding as implied by the ST(2) model.
The Potential Impact of a “No-Buy” List on Youth Exposure to Alcohol Advertising on Cable Television
Ross, Craig S.; Brewer, Robert D.; Jernigan, David H.
2016-01-01
Objective: The purpose of this study was to outline a method to improve alcohol industry compliance with its self-regulatory advertising placement guidelines on television with the goal of reducing youth exposure to noncompliant advertisements. Method: Data were sourced from Nielsen (The Nielsen Company, New York, NY) for all alcohol advertisements on television in the United States for 2005–2012. A “no-buy” list, that is a list of cable television programs and networks to be avoided when purchasing alcohol advertising, was devised using three criteria: avoid placements on programs that were noncompliant in the past (serially noncompliant), avoid placements on networks at times of day when youth make up a high proportion of the audience (high-risk network dayparts), and use a “guardbanded” (or more restrictive) composition guideline when placing ads on low-rated programs (low rated). Results: Youth were exposed to 15.1 billion noncompliant advertising impressions from 2005 to 2012, mostly on cable television. Together, the three no-buy list criteria accounted for 99% of 12.9 billion noncompliant advertising exposures on cable television for youth ages 2–20 years. When we evaluated the no-buy list criteria sequentially and mutually exclusively, serially noncompliant ads accounted for 67% of noncompliant exposure, high-risk network-daypart ads accounted for 26%, and low rated ads accounted for 7%. Conclusions: These findings suggest that the prospective use of the no-buy list criteria when purchasing alcohol advertising could eliminate most noncompliant advertising exposures and could be incorporated into standard post-audit procedures that are widely used by the alcohol industry in assessing exposure to television advertising. PMID:26751350
Zanutto, B. Silvano
2017-01-01
Animals are proposed to learn the latent rules governing their environment in order to maximize their chances of survival. However, rules may change without notice, forcing animals to keep a memory of which one is currently at work. Rule switching can lead to situations in which the same stimulus/response pairing is positively and negatively rewarded in the long run, depending on variables that are not accessible to the animal. This fact raises questions on how neural systems are capable of reinforcement learning in environments where the reinforcement is inconsistent. Here we address this issue by asking about which aspects of connectivity, neural excitability and synaptic plasticity are key for a very general, stochastic spiking neural network model to solve a task in which rules change without being cued, taking the serial reversal task (SRT) as paradigm. Contrary to what could be expected, we found strong limitations for biologically plausible networks to solve the SRT. Especially, we proved that no network of neurons can learn a SRT if it is a single neural population that integrates stimuli information and at the same time is responsible of choosing the behavioural response. This limitation is independent of the number of neurons, neuronal dynamics or plasticity rules, and arises from the fact that plasticity is locally computed at each synapse, and that synaptic changes and neuronal activity are mutually dependent processes. We propose and characterize a spiking neural network model that solves the SRT, which relies on separating the functions of stimuli integration and response selection. The model suggests that experimental efforts to understand neural function should focus on the characterization of neural circuits according to their connectivity, neural dynamics, and the degree of modulation of synaptic plasticity with reward. PMID:29077735
Wang, Edwin; Zaman, Naif; Mcgee, Shauna; Milanese, Jean-Sébastien; Masoudi-Nejad, Ali; O'Connor-McCourt, Maureen
2015-02-01
Tumor genome sequencing leads to documenting thousands of DNA mutations and other genomic alterations. At present, these data cannot be analyzed adequately to aid in the understanding of tumorigenesis and its evolution. Moreover, we have little insight into how to use these data to predict clinical phenotypes and tumor progression to better design patient treatment. To meet these challenges, we discuss a cancer hallmark network framework for modeling genome sequencing data to predict cancer clonal evolution and associated clinical phenotypes. The framework includes: (1) cancer hallmarks that can be represented by a few molecular/signaling networks. 'Network operational signatures' which represent gene regulatory logics/strengths enable to quantify state transitions and measures of hallmark traits. Thus, sets of genomic alterations which are associated with network operational signatures could be linked to the state/measure of hallmark traits. The network operational signature transforms genotypic data (i.e., genomic alterations) to regulatory phenotypic profiles (i.e., regulatory logics/strengths), to cellular phenotypic profiles (i.e., hallmark traits) which lead to clinical phenotypic profiles (i.e., a collection of hallmark traits). Furthermore, the framework considers regulatory logics of the hallmark networks under tumor evolutionary dynamics and therefore also includes: (2) a self-promoting positive feedback loop that is dominated by a genomic instability network and a cell survival/proliferation network is the main driver of tumor clonal evolution. Surrounding tumor stroma and its host immune systems shape the evolutionary paths; (3) cell motility initiating metastasis is a byproduct of the above self-promoting loop activity during tumorigenesis; (4) an emerging hallmark network which triggers genome duplication dominates a feed-forward loop which in turn could act as a rate-limiting step for tumor formation; (5) mutations and other genomic alterations have specific patterns and tissue-specificity, which are driven by aging and other cancer-inducing agents. This framework represents the logics of complex cancer biology as a myriad of phenotypic complexities governed by a limited set of underlying organizing principles. It therefore adds to our understanding of tumor evolution and tumorigenesis, and moreover, potential usefulness of predicting tumors' evolutionary paths and clinical phenotypes. Strategies of using this framework in conjunction with genome sequencing data in an attempt to predict personalized drug targets, drug resistance, and metastasis for cancer patients, as well as cancer risks for healthy individuals are discussed. Accurate prediction of cancer clonal evolution and clinical phenotypes will have substantial impact on timely diagnosis, personalized treatment and personalized prevention of cancer. Crown Copyright © 2014. Published by Elsevier Ltd. All rights reserved.
Evolving learning rules and emergence of cooperation in spatial prisoner's dilemma.
Moyano, Luis G; Sánchez, Angel
2009-07-07
In the evolutionary Prisoner's dilemma (PD) game, agents play with each other and update their strategies in every generation according to some microscopic dynamical rule. In its spatial version, agents do not play with every other but, instead, interact only with their neighbours, thus mimicking the existing of a social or contact network that defines who interacts with whom. In this work, we explore evolutionary, spatial PD systems consisting of two types of agents, each with a certain update (reproduction, learning) rule. We investigate two different scenarios: in the first case, update rules remain fixed for the entire evolution of the system; in the second case, agents update both strategy and update rule in every generation. We show that in a well-mixed population the evolutionary outcome is always full defection. We subsequently focus on two-strategy competition with nearest-neighbour interactions on the contact network and synchronised update of strategies. Our results show that, for an important range of the parameters of the game, the final state of the system is largely different from that arising from the usual setup of a single, fixed dynamical rule. Furthermore, the results are also very different if update rules are fixed or evolve with the strategies. In these respect, we have studied representative update rules, finding that some of them may become extinct while others prevail. We describe the new and rich variety of final outcomes that arise from this co-evolutionary dynamics. We include examples of other neighbourhoods and asynchronous updating that confirm the robustness of our conclusions. Our results pave the way to an evolutionary rationale for modelling social interactions through game theory with a preferred set of update rules.
Two CMOS gate arrays for the EPACT experiment
DOE Office of Scientific and Technical Information (OSTI.GOV)
Winkert, G.
1992-08-01
Two semicustom CMOS digital gate arrays are described in this paper which have been developed for the Energetic Particles: Acceleration, Composition, and Transport (EPACT) experiment. The first device, the 'Event Counters: 16 by 24-bit' (EC1624), implements sixteen 24-bit ripple counters and has flexible counting and readout options. The second device, the 'Serial Transmitter/Receiver' (SXR), is a multi-personality chip that can be used at either end of a serial, synchronous communications data link. It can be configured as a master in a central control unit, or as one of many slaves within remote assemblies. Together a network of SXRs allows formore » commanding and verification of distributed control signals. Both gate arrays are radiation hardened and qualified for space flight use. The architecture of each chip is presented and the benefits to the experiment summarized.« less
2005 22nd International Symposium on Ballistics. Volume 3 Thursday - Friday
2005-11-18
QinetiQ; Vladimir Titarev, Eleuterio Toro , Umeritek Limited The Mechanism Analysis of Interior Ballistics of Serial Chamber Gun, Dr. Sanjiu Ying, Charge...Elements and Meshless Particles, Gordon R. Johnson and Robert A. Stryk, Network Computing Services, Inc. Experimental and Numerical Study of the...Internal Ballistics Clive R. Woodley, David Finbow, QinetiQ; Vladimir Titarev, Eleuterio Toro , Numeritek Limited 22nd International Symposium on
Design of Distributed Engine Control Systems for Stability Under Communication Packet Dropouts
2009-08-01
remarks. II. Distributed Engine Control Systems A. FADEC based on Distributed Engine Control Architecture (DEC) In Distributed Engine...Control, the functions of Full Authority Digital Engine Control ( FADEC ) are distributed at the component level. Each sensor/actuator is to be replaced...diagnostics and health management functionality. Dual channel digital serial communication network is used to connect these smart modules with FADEC . Fig
Analysis of Network Topologies Underlying Ethylene Growth Response Kinetics
Prescott, Aaron M.; McCollough, Forest W.; Eldreth, Bryan L.; Binder, Brad M.; Abel, Steven M.
2016-01-01
Most models for ethylene signaling involve a linear pathway. However, measurements of seedling growth kinetics when ethylene is applied and removed have resulted in more complex network models that include coherent feedforward, negative feedback, and positive feedback motifs. The dynamical responses of the proposed networks have not been explored in a quantitative manner. Here, we explore (i) whether any of the proposed models are capable of producing growth-response behaviors consistent with experimental observations and (ii) what mechanistic roles various parts of the network topologies play in ethylene signaling. To address this, we used computational methods to explore two general network topologies: The first contains a coherent feedforward loop that inhibits growth and a negative feedback from growth onto itself (CFF/NFB). In the second, ethylene promotes the cleavage of EIN2, with the product of the cleavage inhibiting growth and promoting the production of EIN2 through a positive feedback loop (PFB). Since few network parameters for ethylene signaling are known in detail, we used an evolutionary algorithm to explore sets of parameters that produce behaviors similar to experimental growth response kinetics of both wildtype and mutant seedlings. We generated a library of parameter sets by independently running the evolutionary algorithm many times. Both network topologies produce behavior consistent with experimental observations, and analysis of the parameter sets allows us to identify important network interactions and parameter constraints. We additionally screened these parameter sets for growth recovery in the presence of sub-saturating ethylene doses, which is an experimentally-observed property that emerges in some of the evolved parameter sets. Finally, we probed simplified networks maintaining key features of the CFF/NFB and PFB topologies. From this, we verified observations drawn from the larger networks about mechanisms underlying ethylene signaling. Analysis of each network topology results in predictions about changes that occur in network components that can be experimentally tested to give insights into which, if either, network underlies ethylene responses. PMID:27625669
NASA Astrophysics Data System (ADS)
Idris, N. H.; Salim, N. A.; Othman, M. M.; Yasin, Z. M.
2018-03-01
This paper presents the Evolutionary Programming (EP) which proposed to optimize the training parameters for Artificial Neural Network (ANN) in predicting cascading collapse occurrence due to the effect of protection system hidden failure. The data has been collected from the probability of hidden failure model simulation from the historical data. The training parameters of multilayer-feedforward with backpropagation has been optimized with objective function to minimize the Mean Square Error (MSE). The optimal training parameters consists of the momentum rate, learning rate and number of neurons in first hidden layer and second hidden layer is selected in EP-ANN. The IEEE 14 bus system has been tested as a case study to validate the propose technique. The results show the reliable prediction of performance validated through MSE and Correlation Coefficient (R).
Hyper-heuristic Evolution of Dispatching Rules: A Comparison of Rule Representations.
Branke, Jürgen; Hildebrandt, Torsten; Scholz-Reiter, Bernd
2015-01-01
Dispatching rules are frequently used for real-time, online scheduling in complex manufacturing systems. Design of such rules is usually done by experts in a time consuming trial-and-error process. Recently, evolutionary algorithms have been proposed to automate the design process. There are several possibilities to represent rules for this hyper-heuristic search. Because the representation determines the search neighborhood and the complexity of the rules that can be evolved, a suitable choice of representation is key for a successful evolutionary algorithm. In this paper we empirically compare three different representations, both numeric and symbolic, for automated rule design: A linear combination of attributes, a representation based on artificial neural networks, and a tree representation. Using appropriate evolutionary algorithms (CMA-ES for the neural network and linear representations, genetic programming for the tree representation), we empirically investigate the suitability of each representation in a dynamic stochastic job shop scenario. We also examine the robustness of the evolved dispatching rules against variations in the underlying job shop scenario, and visualize what the rules do, in order to get an intuitive understanding of their inner workings. Results indicate that the tree representation using an improved version of genetic programming gives the best results if many candidate rules can be evaluated, closely followed by the neural network representation that already leads to good results for small to moderate computational budgets. The linear representation is found to be competitive only for extremely small computational budgets.
Xu, Ke; Schadt, Eric E.; Pollard, Katherine S.; Roussos, Panos; Dudley, Joel T.
2015-01-01
The population persistence of schizophrenia despite associated reductions in fitness and fecundity suggests that the genetic basis of schizophrenia has a complex evolutionary history. A recent meta-analysis of schizophrenia genome-wide association studies offers novel opportunities for assessment of the evolutionary trajectories of schizophrenia-associated loci. In this study, we hypothesize that components of the genetic architecture of schizophrenia are attributable to human lineage-specific evolution. Our results suggest that schizophrenia-associated loci enrich in genes near previously identified human accelerated regions (HARs). Specifically, we find that genes near HARs conserved in nonhuman primates (pHARs) are enriched for schizophrenia-associated loci, and that pHAR-associated schizophrenia genes are under stronger selective pressure than other schizophrenia genes and other pHAR-associated genes. We further evaluate pHAR-associated schizophrenia genes in regulatory network contexts to investigate associated molecular functions and mechanisms. We find that pHAR-associated schizophrenia genes significantly enrich in a GABA-related coexpression module that was previously found to be differentially regulated in schizophrenia affected individuals versus healthy controls. In another two independent networks constructed from gene expression profiles from prefrontal cortex samples, we find that pHAR-associated schizophrenia genes are located in more central positions and their average path lengths to the other nodes are significantly shorter than those of other schizophrenia genes. Together, our results suggest that HARs are associated with potentially important functional roles in the genetic architecture of schizophrenia. PMID:25681384
Learning dynamics explains human behaviour in prisoner's dilemma on networks.
Cimini, Giulio; Sánchez, Angel
2014-05-06
Cooperative behaviour lies at the very basis of human societies, yet its evolutionary origin remains a key unsolved puzzle. Whereas reciprocity or conditional cooperation is one of the most prominent mechanisms proposed to explain the emergence of cooperation in social dilemmas, recent experimental findings on networked Prisoner's Dilemma games suggest that conditional cooperation also depends on the previous action of the player-namely on the 'mood' in which the player is currently in. Roughly, a majority of people behave as conditional cooperators if they cooperated in the past, whereas they ignore the context and free ride with high probability if they did not. However, the ultimate origin of this behaviour represents a conundrum itself. Here, we aim specifically to provide an evolutionary explanation of moody conditional cooperation (MCC). To this end, we perform an extensive analysis of different evolutionary dynamics for players' behavioural traits-ranging from standard processes used in game theory based on pay-off comparison to others that include non-economic or social factors. Our results show that only a dynamic built upon reinforcement learning is able to give rise to evolutionarily stable MCC, and at the end to reproduce the human behaviours observed in the experiments.
Dynamic instability of cooperation due to diverse activity patterns in evolutionary social dilemmas
NASA Astrophysics Data System (ADS)
Xia, Cheng-Yi; Meloni, Sandro; Perc, Matjaž; Moreno, Yamir
2015-03-01
Individuals might abstain from participating in an instance of an evolutionary game for various reasons, ranging from lack of interest to risk aversion. In order to understand the consequences of such diverse activity patterns on the evolution of cooperation, we study a weak prisoner's dilemma where each player's participation is probabilistic rather than certain. Players that do not participate get a null payoff and are unable to replicate. We show that inactivity introduces cascading failures of cooperation, which are particularly severe on scale-free networks with frequently inactive hubs. The drops in the fraction of cooperators are sudden, while the spatiotemporal reorganization of compact cooperative clusters, and thus the recovery, takes time. Nevertheless, if the activity of players is directly proportional to their degree, or if the interaction network is not strongly heterogeneous, the overall evolution of cooperation is not impaired. This is because inactivity negatively affects the potency of low-degree defectors, who are hence unable to utilize on their inherent evolutionary advantage. Between cascading failures, the fraction of cooperators is therefore higher than usual, which lastly balances out the asymmetric dynamic instabilities that emerge due to intermittent blackouts of cooperative hubs.
Phylomemetics—Evolutionary Analysis beyond the Gene
Howe, Christopher J.; Windram, Heather F.
2011-01-01
Genes are propagated by error-prone copying, and the resulting variation provides the basis for phylogenetic reconstruction of evolutionary relationships. Horizontal gene transfer may be superimposed on a tree-like evolutionary pattern, with some relationships better depicted as networks. The copying of manuscripts by scribes is very similar to the replication of genes, and phylogenetic inference programs can be used directly for reconstructing the copying history of different versions of a manuscript text. Phylogenetic methods have also been used for some time to analyse the evolution of languages and the development of physical cultural artefacts. These studies can help to answer a range of anthropological questions. We propose the adoption of the term “phylomemetics” for phylogenetic analysis of reproducing non-genetic elements. PMID:21655311
Traffic Dimensioning and Performance Modeling of 4G LTE Networks
ERIC Educational Resources Information Center
Ouyang, Ye
2011-01-01
Rapid changes in mobile techniques have always been evolutionary, and the deployment of 4G Long Term Evolution (LTE) networks will be the same. It will be another transition from Third Generation (3G) to Fourth Generation (4G) over a period of several years, as is the case still with the transition from Second Generation (2G) to 3G. As a result,…
Quantum games on evolving random networks
NASA Astrophysics Data System (ADS)
Pawela, Łukasz
2016-09-01
We study the advantages of quantum strategies in evolutionary social dilemmas on evolving random networks. We focus our study on the two-player games: prisoner's dilemma, snowdrift and stag-hunt games. The obtained result show the benefits of quantum strategies for the prisoner's dilemma game. For the other two games, we obtain regions of parameters where the quantum strategies dominate, as well as regions where the classical strategies coexist.
Adaptive evolutionary walks require neutral intermediates in RNA fitness landscapes.
Rendel, Mark D
2011-01-01
In RNA fitness landscapes with interconnected networks of neutral mutations, neutral precursor mutations can play an important role in facilitating the accessibility of epistatic adaptive mutant combinations. I use an exhaustively surveyed fitness landscape model based on short sequence RNA genotypes (and their secondary structure phenotypes) to calculate the minimum rate at which mutants initially appearing as neutral are incorporated into an adaptive evolutionary walk. I show first, that incorporating neutral mutations significantly increases the number of point mutations in a given evolutionary walk when compared to estimates from previous adaptive walk models. Second, that incorporating neutral mutants into such a walk significantly increases the final fitness encountered on that walk - indeed evolutionary walks including neutral steps often reach the global optimum in this model. Third, and perhaps most importantly, evolutionary paths of this kind are often extremely winding in their nature and have the potential to undergo multiple mutations at a given sequence position within a single walk; the potential of these winding paths to mislead phylogenetic reconstruction is briefly considered. Copyright © 2010 Elsevier Inc. All rights reserved.
Evolutionary biosemiotics and multilevel construction networks.
Sharov, Alexei A
2016-12-01
In contrast to the traditional relational semiotics, biosemiotics decisively deviates towards dynamical aspects of signs at the evolutionary and developmental time scales. The analysis of sign dynamics requires constructivism (in a broad sense) to explain how new components such as subagents, sensors, effectors, and interpretation networks are produced by developing and evolving organisms. Semiotic networks that include signs, tools, and subagents are multilevel, and this feature supports the plasticity, robustness, and evolvability of organisms. The origin of life is described here as the emergence of simple self-constructing semiotic networks that progressively increased the diversity of their components and relations. Primitive organisms have no capacity to classify and track objects; thus, we need to admit the existence of proto-signs that directly regulate activities of agents without being associated with objects. However, object recognition and handling became possible in eukaryotic species with the development of extensive rewritable epigenetic memory as well as sensorial and effector capacities. Semiotic networks are based on sequential and recursive construction, where each step produces components (i.e., agents, scaffolds, signs, and resources) that are needed for the following steps of construction. Construction is not limited to repair and reproduction of what already exists or is unambiguously encoded, it also includes production of new components and behaviors via learning and evolution. A special case is the emergence of new levels of organization known as metasystem transition . Multilevel semiotic networks reshape the phenotype of organisms by combining a mosaic of features developed via learning and evolution of cooperating and/or conflicting subagents.
Evolutionary biosemiotics and multilevel construction networks
Sharov, Alexei A.
2016-01-01
In contrast to the traditional relational semiotics, biosemiotics decisively deviates towards dynamical aspects of signs at the evolutionary and developmental time scales. The analysis of sign dynamics requires constructivism (in a broad sense) to explain how new components such as subagents, sensors, effectors, and interpretation networks are produced by developing and evolving organisms. Semiotic networks that include signs, tools, and subagents are multilevel, and this feature supports the plasticity, robustness, and evolvability of organisms. The origin of life is described here as the emergence of simple self-constructing semiotic networks that progressively increased the diversity of their components and relations. Primitive organisms have no capacity to classify and track objects; thus, we need to admit the existence of proto-signs that directly regulate activities of agents without being associated with objects. However, object recognition and handling became possible in eukaryotic species with the development of extensive rewritable epigenetic memory as well as sensorial and effector capacities. Semiotic networks are based on sequential and recursive construction, where each step produces components (i.e., agents, scaffolds, signs, and resources) that are needed for the following steps of construction. Construction is not limited to repair and reproduction of what already exists or is unambiguously encoded, it also includes production of new components and behaviors via learning and evolution. A special case is the emergence of new levels of organization known as metasystem transition. Multilevel semiotic networks reshape the phenotype of organisms by combining a mosaic of features developed via learning and evolution of cooperating and/or conflicting subagents. PMID:28163801
Netgram: Visualizing Communities in Evolving Networks
Mall, Raghvendra; Langone, Rocco; Suykens, Johan A. K.
2015-01-01
Real-world complex networks are dynamic in nature and change over time. The change is usually observed in the interactions within the network over time. Complex networks exhibit community like structures. A key feature of the dynamics of complex networks is the evolution of communities over time. Several methods have been proposed to detect and track the evolution of these groups over time. However, there is no generic tool which visualizes all the aspects of group evolution in dynamic networks including birth, death, splitting, merging, expansion, shrinkage and continuation of groups. In this paper, we propose Netgram: a tool for visualizing evolution of communities in time-evolving graphs. Netgram maintains evolution of communities over 2 consecutive time-stamps in tables which are used to create a query database using the sql outer-join operation. It uses a line-based visualization technique which adheres to certain design principles and aesthetic guidelines. Netgram uses a greedy solution to order the initial community information provided by the evolutionary clustering technique such that we have fewer line cross-overs in the visualization. This makes it easier to track the progress of individual communities in time evolving graphs. Netgram is a generic toolkit which can be used with any evolutionary community detection algorithm as illustrated in our experiments. We use Netgram for visualization of topic evolution in the NIPS conference over a period of 11 years and observe the emergence and merging of several disciplines in the field of information processing systems. PMID:26356538
On the Deduction of Galactic Abundances with Evolutionary Neural Networks
NASA Astrophysics Data System (ADS)
Taylor, M.; Diaz, A. I.
2007-12-01
A growing number of indicators are now being used with some confidence to measure the metallicity(Z) of photoionisation regions in planetary nebulae, galactic HII regions(GHIIRs), extra-galactic HII regions(EGHIIRs) and HII galaxies(HIIGs). However, a universal indicator valid also at high metallicities has yet to be found. Here, we report on a new artificial intelligence-based approach to determine metallicity indicators that shows promise for the provision of improved empirical fits. The method hinges on the application of an evolutionary neural network to observational emission line data. The network's DNA, encoded in its architecture, weights and neuron transfer functions, is evolved using a genetic algorithm. Furthermore, selection, operating on a set of 10 distinct neuron transfer functions, means that the empirical relation encoded in the network solution architecture is in functional rather than numerical form. Thus the network solutions provide an equation for the metallicity in terms of line ratios without a priori assumptions. Tapping into the mathematical power offered by this approach, we applied the network to detailed observations of both nebula and auroral emission lines from 0.33μ m-1μ m for a sample of 96 HII-type regions and we were able to obtain an empirical relation between Z and S_{23} with a dispersion of only 0.16 dex. We show how the method can be used to identify new diagnostics as well as the nonlinear relationship supposed to exist between the metallicity Z, ionisation parameter U and effective (or equivalent) temperature T*.
2005-09-01
consumption comparisons between 802.11 and 802.20 were conducted. The HP4700’s used a rechargeable 1800 mAh Lithium -ion internal battery and the expansion...jacket with 1840 mAh Lithium -ion internal rechargeable battery . The HP4700 has integrated WLAN 802.11b, Bluetooth®, Fast Infrared, IrDA, USB & Serial...weighs 1150 pounds and includes the weight of a 2 hour backup battery . [Ref 18] The power requirements for the RR are as follows: • +24VDC, -48VDC, 110
Generation of oscillating gene regulatory network motifs
NASA Astrophysics Data System (ADS)
van Dorp, M.; Lannoo, B.; Carlon, E.
2013-07-01
Using an improved version of an evolutionary algorithm originally proposed by François and Hakim [Proc. Natl. Acad. Sci. USAPNASA60027-842410.1073/pnas.0304532101 101, 580 (2004)], we generated small gene regulatory networks in which the concentration of a target protein oscillates in time. These networks may serve as candidates for oscillatory modules to be found in larger regulatory networks and protein interaction networks. The algorithm was run for 105 times to produce a large set of oscillating modules, which were systematically classified and analyzed. The robustness of the oscillations against variations of the kinetic rates was also determined, to filter out the least robust cases. Furthermore, we show that the set of evolved networks can serve as a database of models whose behavior can be compared to experimentally observed oscillations. The algorithm found three smallest (core) oscillators in which nonlinearities and number of components are minimal. Two of those are two-gene modules: the mixed feedback loop, already discussed in the literature, and an autorepressed gene coupled with a heterodimer. The third one is a single gene module which is competitively regulated by a monomer and a dimer. The evolutionary algorithm also generated larger oscillating networks, which are in part extensions of the three core modules and in part genuinely new modules. The latter includes oscillators which do not rely on feedback induced by transcription factors, but are purely of post-transcriptional type. Analysis of post-transcriptional mechanisms of oscillation may provide useful information for circadian clock research, as recent experiments showed that circadian rhythms are maintained even in the absence of transcription.
CommServer: A Communications Manager For Remote Data Sites
NASA Astrophysics Data System (ADS)
Irving, K.; Kane, D. L.
2012-12-01
CommServer is a software system that manages making connections to remote data-gathering stations, providing a simple network interface to client applications. The client requests a connection to a site by name, and the server establishes the connection, providing a bidirectional channel between the client and the target site if successful. CommServer was developed to manage networks of FreeWave serial data radios with multiple data sites, repeaters, and network-accessed base stations, and has been in continuous operational use for several years. Support for Iridium modems using RUDICS will be added soon, and no changes to the application interface are anticipated. CommServer is implemented on Linux using programs written in bash shell, Python, Perl, AWK, under a set of conventions we refer to as ThinObject.
Topological entropy of catalytic sets: Hypercycles revisited
NASA Astrophysics Data System (ADS)
Sardanyés, Josep; Duarte, Jorge; Januário, Cristina; Martins, Nuno
2012-02-01
The dynamics of catalytic networks have been widely studied over the last decades because of their implications in several fields like prebiotic evolution, virology, neural networks, immunology or ecology. One of the most studied mathematical bodies for catalytic networks was initially formulated in the context of prebiotic evolution, by means of the hypercycle theory. The hypercycle is a set of self-replicating species able to catalyze other replicator species within a cyclic architecture. Hypercyclic organization might arise from a quasispecies as a way to increase the informational containt surpassing the so-called error threshold. The catalytic coupling between replicators makes all the species to behave like a single and coherent evolutionary multimolecular unit. The inherent nonlinearities of catalytic interactions are responsible for the emergence of several types of dynamics, among them, chaos. In this article we begin with a brief review of the hypercycle theory focusing on its evolutionary implications as well as on different dynamics associated to different types of small catalytic networks. Then we study the properties of chaotic hypercycles with error-prone replication with symbolic dynamics theory, characterizing, by means of the theory of topological Markov chains, the topological entropy and the periods of the orbits of unimodal-like iterated maps obtained from the strange attractor. We will focus our study on some key parameters responsible for the structure of the catalytic network: mutation rates, autocatalytic and cross-catalytic interactions.
Savage, V. M.; Bentley, L. P.; Enquist, B. J.; Sperry, J. S.; Smith, D. D.; Reich, P. B.; von Allmen, E. I.
2010-01-01
Plant vascular networks are central to botanical form, function, and diversity. Here, we develop a theory for plant network scaling that is based on optimal space filling by the vascular system along with trade-offs between hydraulic safety and efficiency. Including these evolutionary drivers leads to predictions for sap flow, the taper of the radii of xylem conduits from trunk to terminal twig, and how the frequency of xylem conduits varies with conduit radius. To test our predictions, we use comprehensive empirical measurements of maple, oak, and pine trees and complementary literature data that we obtained for a wide range of tree species. This robust intra- and interspecific assessment of our botanical network model indicates that the central tendency of observed scaling properties supports our predictions much better than the West, Brown, and Enquist (WBE) or pipe models. Consequently, our model is a more accurate description of vascular architecture than what is given by existing network models and should be used as a baseline to understand and to predict the scaling of individual plants to whole forests. In addition, our model is flexible enough to allow the quantification of species variation around rules for network design. These results suggest that the evolutionary drivers that we propose have been fundamental in determining how physiological processes scale within and across plant species. PMID:21149696
Savage, V M; Bentley, L P; Enquist, B J; Sperry, J S; Smith, D D; Reich, P B; von Allmen, E I
2010-12-28
Plant vascular networks are central to botanical form, function, and diversity. Here, we develop a theory for plant network scaling that is based on optimal space filling by the vascular system along with trade-offs between hydraulic safety and efficiency. Including these evolutionary drivers leads to predictions for sap flow, the taper of the radii of xylem conduits from trunk to terminal twig, and how the frequency of xylem conduits varies with conduit radius. To test our predictions, we use comprehensive empirical measurements of maple, oak, and pine trees and complementary literature data that we obtained for a wide range of tree species. This robust intra- and interspecific assessment of our botanical network model indicates that the central tendency of observed scaling properties supports our predictions much better than the West, Brown, and Enquist (WBE) or pipe models. Consequently, our model is a more accurate description of vascular architecture than what is given by existing network models and should be used as a baseline to understand and to predict the scaling of individual plants to whole forests. In addition, our model is flexible enough to allow the quantification of species variation around rules for network design. These results suggest that the evolutionary drivers that we propose have been fundamental in determining how physiological processes scale within and across plant species.
Recent coselection in human populations revealed by protein-protein interaction network.
Qian, Wei; Zhou, Hang; Tang, Kun
2014-12-21
Genome-wide scans for signals of natural selection in human populations have identified a large number of candidate loci that underlie local adaptations. This is surprising given the relatively short evolutionary time since the divergence of the human population. One hypothesis that has not been formally examined is whether and how the recent human evolution may have been shaped by coselection in the context of complex molecular interactome. In this study, genome-wide signals of selection were scanned in East Asians, Europeans, and Africans using 1000 Genome data, and subsequently mapped onto the protein-protein interaction (PPI) network. We found that the candidate genes of recent positive selection localized significantly closer to each other on the PPI network than expected, revealing substantial clustering of selected genes. Furthermore, gene pairs of shorter PPI network distances showed higher similarities of their recent evolutionary paths than those further apart. Last, subnetworks enriched with recent coselection signals were identified, which are substantially overrepresented in biological pathways related to signal transduction, neurogenesis, and immune function. These results provide the first genome-wide evidence for association of recent selection signals with the PPI network, shedding light on the potential mechanisms of recent coselection in the human genome. © The Author(s) 2014. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.
Coevolving agent strategies and network topology for the public goods games
NASA Astrophysics Data System (ADS)
Zhang, C. Y.; Zhang, J. L.; Xie, G. M.; Wang, L.
2011-03-01
Much of human cooperation remains an evolutionary riddle. Coevolutionary public goods games in structured populations are studied where players can change from an unproductive public goods game to a productive one, by evaluating the productivity of the public goods games. In our model, each individual participates in games organized by its neighborhood plus by itself. Coevolution here refers to an evolutionary process entailing both deletion of existing links and addition of new links between agents that accompanies the evolution of their strategies. Furthermore, we investigate the effects of time scale separation of strategy and structure on cooperation level. This study presents the following: Foremost, we observe that high cooperation levels in public goods interactions are attained by the entangled coevolution of strategy and structure. Presented results also confirm that the resulting networks show many features of real systems, such as cooperative behavior and hierarchical clustering. The heterogeneity of the interaction network is held responsible for the observed promotion of cooperation. We hope our work may offer an explanation for the origin of large-scale cooperative behavior among unrelated individuals.
Sikkink, Kristin L; Reynolds, Rose M; Cresko, William A; Phillips, Patrick C
2015-05-01
Selection in novel environments can lead to a coordinated evolutionary response across a suite of characters. Environmental conditions can also potentially induce changes in the genetic architecture of complex traits, which in turn could alter the pattern of the multivariate response to selection. We describe a factorial selection experiment using the nematode Caenorhabditis remanei in which two different stress-related phenotypes (heat and oxidative stress resistance) were selected under three different environmental conditions. The pattern of covariation in the evolutionary response between phenotypes or across environments differed depending on the environment in which selection occurred, including asymmetrical responses to selection in some cases. These results indicate that variation in pleiotropy across the stress response network is highly sensitive to the external environment. Our findings highlight the complexity of the interaction between genes and environment that influences the ability of organisms to acclimate to novel environments. They also make clear the need to identify the underlying genetic basis of genetic correlations in order understand how patterns of pleiotropy are distributed across complex genetic networks. © 2015 The Author(s).
MOCASSIN-prot: a multi-objective clustering approach for protein similarity networks.
Keel, Brittney N; Deng, Bo; Moriyama, Etsuko N
2018-04-15
Proteins often include multiple conserved domains. Various evolutionary events including duplication and loss of domains, domain shuffling, as well as sequence divergence contribute to generating complexities in protein structures, and consequently, in their functions. The evolutionary history of proteins is hence best modeled through networks that incorporate information both from the sequence divergence and the domain content. Here, a game-theoretic approach proposed for protein network construction is adapted into the framework of multi-objective optimization, and extended to incorporate clustering refinement procedure. The new method, MOCASSIN-prot, was applied to cluster multi-domain proteins from ten genomes. The performance of MOCASSIN-prot was compared against two protein clustering methods, Markov clustering (TRIBE-MCL) and spectral clustering (SCPS). We showed that compared to these two methods, MOCASSIN-prot, which uses both domain composition and quantitative sequence similarity information, generates fewer false positives. It achieves more functionally coherent protein clusters and better differentiates protein families. MOCASSIN-prot, implemented in Perl and Matlab, is freely available at http://bioinfolab.unl.edu/emlab/MOCASSINprot. emoriyama2@unl.edu. Supplementary data are available at Bioinformatics online.
Sikkink, Kristin L.; Reynolds, Rose M.; Cresko, William A.; Phillips, Patrick C.
2017-01-01
Selection in novel environments can lead to a coordinated evolutionary response across a suite of characters. Environmental conditions can also potentially induce changes in the genetic architecture of complex traits, which in turn could alter the pattern of the multivariate response to selection. We describe a factorial selection experiment using the nematode Caenorhabditis remanei in which two different stress-related phenotypes (heat and oxidative stress resistance) were selected under three different environmental conditions. The pattern of covariation in the evolutionary response between phenotypes or across environments differed depending on the environment in which selection occurred, including asymmetrical responses to selection in some cases. These results indicate that variation in pleiotropy across the stress response network is highly sensitive to the external environment. Our findings highlight the complexity of the interaction between genes and environment that influences the ability of organisms to acclimate to novel environments. They also make clear the need to identify the underlying genetic basis of genetic correlations in order understand how patterns of pleiotropy are distributed across complex genetic networks. PMID:25809411
An evolutionary game for the diffusion of rumor in complex networks
NASA Astrophysics Data System (ADS)
Li, Dandan; Ma, Jing; Tian, Zihao; Zhu, Hengmin
2015-09-01
In this paper, we investigate the rumor diffusion process according to the evolutionary game framework. By using three real social network datasets, we find that increasing the judgment ability of individuals could curb the diffusion of rumor effectively. Under the same level of punishment cost, there are more spreaders in the network that has larger average degree. Moreover, the punishment fraction has more significant impact than the risk coefficient on the controlling of rumor diffusion. There exist some optimal risk coefficients and punishment fractions that could help more people refusing to spread rumor. In addition, the effect of the tie strength on the final fraction of spreaders is investigated. The results indicate that the rumor can be suppressed soon if the individuals preferentially select the neighbor either weaker or stronger ties persistently to update their strategy. However, choosing neighbor blindly may promote the spread of rumor. Finally, by comparing three kinds of punishment mechanisms, we show that taking the lead in punishing the higher degree nodes is the most effective measure to reduce the coverage of rumor.
Evolutionary engineering of Geobacillus thermoglucosidasius for improved ethanol production.
Zhou, Jiewen; Wu, Kang; Rao, Christopher V
2016-10-01
The ability to grow at high temperatures makes thermophiles attractive for many fermentation processes. In this work, we used evolutionary engineering to increase ethanol production in the thermophile Geobacillus thermoglucosidasius. This bacterium is a facultative anaerobe, grows at an optimal temperature of 60°C, and can ferment diverse carbohydrates. However, it natively performs mixed-acid fermentation. To improve ethanol productivity, we first eliminated lactate and formate production in two strains of G. thermoglucosidasius, 95A1 and C56-YS93. These deletion strains were generated by selection on spectinomycin, which represents, to the best of our knowledge, the first time this antibiotic has been shown to work with thermophiles. Both knockout strains, however, were unable to grow under microaerobic conditions. We were able to recover growth in G. thermoglucosidasius 95A1 by serial adaptation in the presence of acetic acid. The evolved 95A1 strain was able to efficiently produce ethanol during growth on glucose or cellobiose. Genome sequencing identified loss-of-function mutations in adenine phosphoribosyltransferase (aprt) and the stage III sporulation protein AA (spoIIIAA). Disruption of both genes improved ethanol production in the unadapted strains: however, the increase was significant only when aprt was deleted. In conclusion, we were able to engineer a strain of G. thermoglucosidasius to efficiently produce ethanol from glucose and cellobiose using a combination of metabolic engineering and evolutionary strategies. This work further establishes this thermophile as a platform organism for fuel and chemical production. Biotechnol. Bioeng. 2016;113: 2156-2167. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.
The double-edged sword: How evolution can make or break a live-attenuated virus vaccine
Hanley, Kathryn A.
2012-01-01
Even students who reject evolution are often willing to consider cases in which evolutionary biology contributes to, or undermines, biomedical interventions. Moreover the intersection of evolutionary biology and biomedicine is fascinating in its own right. This review offers an overview of the ways in which evolution has impacted the design and deployment of live-attenuated virus vaccines, with subsections that may be useful as lecture material or as the basis for case studies in classes at a variety of levels. Live- attenuated virus vaccines have been modified in ways that restrain their replication in a host, so that infection (vaccination) produces immunity but not disease. Applied evolution, in the form of serial passage in novel host cells, is a “classical” method to generate live-attenuated viruses. However many live-attenuated vaccines exhibit reversion to virulence through back-mutation of attenuating mutations, compensatory mutations elsewhere in the genome, recombination or reassortment, or changes in quasispecies diversity. Additionally the combination of multiple live-attenuated strains may result in competition or facilitation between individual vaccine viruses, resulting in undesirable increases in virulence or decreases in immunogenicity. Genetic engineering informed by evolutionary thinking has led to a number of novel approaches to generate live-attenuated virus vaccines that contain substantial safeguards against reversion to virulence and that ameliorate interference among multiple vaccine strains. Finally, vaccines have the potential to shape the evolution of their wild type counterparts in counter-productive ways; at the extreme vaccine-driven eradication of a virus may create an empty niche that promotes the emergence of new viral pathogens. PMID:22468165
Eco-evolutionary spatial dynamics in the Glanville fritillary butterfly.
Hanski, Ilkka A
2011-08-30
Demographic population dynamics, gene flow, and local adaptation may influence each other and lead to coupling of ecological and evolutionary dynamics, especially in species inhabiting fragmented heterogeneous environments. Here, I review long-term research on eco-evolutionary spatial dynamics in the Glanville fritillary butterfly inhabiting a large network of approximately 4,000 meadows in Finland. The metapopulation persists in a balance between frequent local extinctions and recolonizations. The genetic spatial structure as defined by neutral markers is much more coarse-grained than the demographic spatial structure determined by the fragmented habitat, yet small-scale spatial structure has important consequences for the dynamics. I discuss three examples of eco-evolutionary spatial dynamics. (i) Extinction-colonization metapopulation dynamics influence allele frequency changes in the phosphoglucose isomerase (Pgi) gene, which leads to strong associations between genetic variation in Pgi and dispersal, recolonization, and local population dynamics. (ii) Inbreeding in local populations increases their risk for extinction, whereas reciprocal effects between inbreeding, population size, and emigration represent likely eco-evolutionary feedbacks. (iii) Genetically determined female oviposition preference for two host plant species exhibits a cline paralleling a gradient in host plant relative abundances, and host plant preference of dispersing females in relation to the host plant composition of habitat patches influences immigration (gene flow) and recolonization (founder events). Eco-evolutionary spatial dynamics in heterogeneous environments may not lead to directional evolutionary changes unless the environment itself changes, but eco-evolutionary dynamics may contribute to the maintenance of genetic variation attributable to fluctuating selection in space and time.
Dynamics of brain networks in the aesthetic appreciation
Cela-Conde, Camilo J.; García-Prieto, Juan; Ramasco, José J.; Mirasso, Claudio R.; Bajo, Ricardo; Munar, Enric; Flexas, Albert; del-Pozo, Francisco; Maestú, Fernando
2013-01-01
Neuroimage experiments have been essential for identifying active brain networks. During cognitive tasks as in, e.g., aesthetic appreciation, such networks include regions that belong to the default mode network (DMN). Theoretically, DMN activity should be interrupted during cognitive tasks demanding attention, as is the case for aesthetic appreciation. Analyzing the functional connectivity dynamics along three temporal windows and two conditions, beautiful and not beautiful stimuli, here we report experimental support for the hypothesis that aesthetic appreciation relies on the activation of two different networks, an initial aesthetic network and a delayed aesthetic network, engaged within distinct time frames. Activation of the DMN might correspond mainly to the delayed aesthetic network. We discuss adaptive and evolutionary explanations for the relationships existing between the DMN and aesthetic networks and offer unique inputs to debates on the mind/brain interaction. PMID:23754437
A Network Scheduling Model for Distributed Control Simulation
NASA Technical Reports Server (NTRS)
Culley, Dennis; Thomas, George; Aretskin-Hariton, Eliot
2016-01-01
Distributed engine control is a hardware technology that radically alters the architecture for aircraft engine control systems. Of its own accord, it does not change the function of control, rather it seeks to address the implementation issues for weight-constrained vehicles that can limit overall system performance and increase life-cycle cost. However, an inherent feature of this technology, digital communication networks, alters the flow of information between critical elements of the closed-loop control. Whereas control information has been available continuously in conventional centralized control architectures through virtue of analog signaling, moving forward, it will be transmitted digitally in serial fashion over the network(s) in distributed control architectures. An underlying effect is that all of the control information arrives asynchronously and may not be available every loop interval of the controller, therefore it must be scheduled. This paper proposes a methodology for modeling the nominal data flow over these networks and examines the resulting impact for an aero turbine engine system simulation.
Environmental DNA for wildlife biology and biodiversity monitoring.
Bohmann, Kristine; Evans, Alice; Gilbert, M Thomas P; Carvalho, Gary R; Creer, Simon; Knapp, Michael; Yu, Douglas W; de Bruyn, Mark
2014-06-01
Extraction and identification of DNA from an environmental sample has proven noteworthy recently in detecting and monitoring not only common species, but also those that are endangered, invasive, or elusive. Particular attributes of so-called environmental DNA (eDNA) analysis render it a potent tool for elucidating mechanistic insights in ecological and evolutionary processes. Foremost among these is an improved ability to explore ecosystem-level processes, the generation of quantitative indices for analyses of species, community diversity, and dynamics, and novel opportunities through the use of time-serial samples and unprecedented sensitivity for detecting rare or difficult-to-sample taxa. Although technical challenges remain, here we examine the current frontiers of eDNA, outline key aspects requiring improvement, and suggest future developments and innovations for research. Copyright © 2014 Elsevier Ltd. All rights reserved.
Use of Optical Storage Devices as Shared Resources in Local Area Networks
1989-09-01
13 3. SERVICE CALLS FOR MS-DOS CD-ROM EXTENSIONS . 14 4. MS-DOS PRIMITIVE GROUPS ....................... 15 5. RAM USAGE FOR VARIOUS LAN...17 2. Service Call Translation to DOS Primitives ............. 19 3. MS-DOS Device Drivers ............................. 21 4. MS-DOS/ROM...directed to I/O devices will be referred to as primitive instruction groups). These primitive instruction groups include keyboard, video, disk, serial
2005 22nd International Symposium on Ballistics Volume 2 Wednesday
2005-11-18
Information 1 Experimental and Numerical Study of the Penetration of Tungsten Carbide Into Steel Targets During High Rates of Strain John F . Moxnes...QinetiQ; Vladimir Titarev, Eleuterio Toro , Umeritek Limited The Mechanism Analysis of Interior Ballistics of Serial Chamber Gun, Dr. Sanjiu Ying, Charge...Elements and Meshless Particles, Gordon R. Johnson and Robert A. Stryk, Network Computing Services, Inc. Experimental and Numerical Study of the
Wireless Sensor Buoys for Perimeter Security of Military Vessels and Seabases
2015-12-01
however, additional sensors utilizing modern technology and a self -forming, as well as self - healing , network could further diminish attacks against...Space SSDF Ship’s Self -Defense Force UAV Unmanned Aerial Vehicle UGS Unattended Ground Sensor USB Universal Serial Bus USMC United States Marine...conditions may delay their reaction resulting in the attacking surface craft entering into a critically close position. The Ship’s Self -Defense
1984-11-01
about the length of duration before or after the zero point". The generalization about snow being white holds at PRESENT. If the generic ...tense, serial tense, system network, systemic grammar, tense grammar, tense semantics, text generation , text production, verbal group * 4- •S 20...purposeful way, as a subprocess of the process of generating text. First, a systemic grammar of English tense (based on work by M A.K. Halliday) is
Optical interconnection and packaging technologies for advanced avionics systems
NASA Astrophysics Data System (ADS)
Schroeder, J. E.; Christian, N. L.; Cotti, B.
1992-09-01
An optical backplane developed to demonstrate the advantages of high-performance optical interconnections and supporting technologies and designed to be compatible with standard avionics racks is described. The hardware demonstrates the three basic components of optical interconnects: optical sources, an optical signal distribution network, and optical receivers. Results from characterization and environmental tests, including a demonstration of the reliable transmission of serial data at a 1 Gb/s, are reported.
Modelling the public opinion transmission on social networks under opinion leaders
NASA Astrophysics Data System (ADS)
Li, Zuozhi; Li, Meng; Ji, Wanwan
2017-06-01
In this paper, based on Social Network Analysis (SNA), the social network model of opinion leaders influencing the public opinion transmission is explored. The hot event, A Female Driver Was Beaten Due To Lane Change, has characteristics of individual short-term and non-government intervention, which is used to data extraction, and formed of the network structure on opinion leaders influencing the public opinion transmission. And the evolution mechanism are analyzed in the three evolutionary situations. Opinion leaders influence micro-blogging public opinion on social network evolution model shows that this type of network public opinion transmission is largely constrained by opinion leaders, so the opinion leaders behavior supervising on the spread of this public opinion is pivotal, and which has a guiding significance.
Network dynamics of eukaryotic LTR retroelements beyond phylogenetic trees
Llorens, Carlos; Muñoz-Pomer, Alfonso; Bernad, Lucia; Botella, Hector; Moya, Andrés
2009-01-01
Background Sequencing projects have allowed diverse retroviruses and LTR retrotransposons from different eukaryotic organisms to be characterized. It is known that retroviruses and other retro-transcribing viruses evolve from LTR retrotransposons and that this whole system clusters into five families: Ty3/Gypsy, Retroviridae, Ty1/Copia, Bel/Pao and Caulimoviridae. Phylogenetic analyses usually show that these split into multiple distinct lineages but what is yet to be understood is how deep evolution occurred in this system. Results We combined phylogenetic and graph analyses to investigate the history of LTR retroelements both as a tree and as a network. We used 268 non-redundant LTR retroelements, many of them introduced for the first time in this work, to elucidate all possible LTR retroelement phylogenetic patterns. These were superimposed over the tree of eukaryotes to investigate the dynamics of the system, at distinct evolutionary times. Next, we investigated phenotypic features such as duplication and variability of amino acid motifs, and several differences in genomic ORF organization. Using this information we characterized eight reticulate evolution markers to construct phenotypic network models. Conclusion The evolutionary history of LTR retroelements can be traced as a time-evolving network that depends on phylogenetic patterns, epigenetic host-factors and phenotypic plasticity. The Ty1/Copia and the Ty3/Gypsy families represent the oldest patterns in this network that we found mimics eukaryotic macroevolution. The emergence of the Bel/Pao, Retroviridae and Caulimoviridae families in this network can be related with distinct inflations of the Ty3/Gypsy family, at distinct evolutionary times. This suggests that Ty3/Gypsy ancestors diversified much more than their Ty1/Copia counterparts, at distinct geological eras. Consistent with the principle of preferential attachment, the connectivities among phenotypic markers, taken as network-represented combinations, are power-law distributed. This evidences an inflationary mode of evolution where the system diversity; 1) expands continuously alternating vertical and gradual processes of phylogenetic divergence with episodes of modular, saltatory and reticulate evolution; 2) is governed by the intrinsic capability of distinct LTR retroelement host-communities to self-organize their phenotypes according to emergent laws characteristic of complex systems. Reviewers This article was reviewed by Eugene V. Koonin, Eric Bapteste, and Enmanuelle Lerat (nominated by King Jordan) PMID:19883502
Monogamy and Nonmonogamy: Evolutionary Considerations and Treatment Challenges.
Brandon, Marianne
2016-10-01
Few topics generate such controversy and emotional reactivity as the nature of human mating behavior. Unfortunately, and potentially to the detriment of good patient care, sexual medicine practitioners have largely avoided this matter. An understanding of the scientific literature can empower practitioners to more effectively confront the inevitable monogamy and nonmonogamy challenges present in research and clinical practice. To review and summarize relevant scientific literature as a context to evaluate the more common myths and misunderstanding relating to the practice of monogamy and nonmonogamy in humans. This review also is intended to promote a discussion of the ways human mating strategies may impact sexual function and dysfunction for the individual and couple. A review of English written peer-reviewed evolutionary, anthropological, neuropsychiatric, zoological research, and other scholarly texts was conducted. Work published between 2000 and 2016 concentrating on evolutionary theory, long- and short-term mating strategies in primates and most specifically in humans, and consensual nonmonogamy was highlighted. Main outcomes included a brief explanation of evolutionary theory and a review of relevant literature regarding long- and short-term mating behaviors and consensual nonmonogamy. Serial sexual and social monogamy is the norm for humans. Across time and cultures, humans have adapted both long- and short-term mating strategies that are used flexibly, and sometimes simultaneously, based on unique personal, social, and environmental circumstances. Human mating behavior is individualistic, the result of numerous biopsychosocial influences. The clinician cannot assume that an individual presenting as a patient maintains a monogamy-valued view of his or her intimate relationship. Patients may experience conflict between the cultural monogamous ideal and their actual sexual behaviors. This conflict may be critical in understanding a patient's sexual concerns and in treatment planning. Awareness of these issues will aid the practitioner in sexual medicine. Copyright © 2016 International Society for Sexual Medicine. Published by Elsevier Inc. All rights reserved.
Preferential attachment in evolutionary earthquake networks
NASA Astrophysics Data System (ADS)
Rezaei, Soghra; Moghaddasi, Hanieh; Darooneh, Amir Hossein
2018-04-01
Earthquakes as spatio-temporal complex systems have been recently studied using complex network theory. Seismic networks are dynamical networks due to addition of new seismic events over time leading to establishing new nodes and links to the network. Here we have constructed Iran and Italy seismic networks based on Hybrid Model and testified the preferential attachment hypothesis for the connection of new nodes which states that it is more probable for newly added nodes to join the highly connected nodes comparing to the less connected ones. We showed that the preferential attachment is present in the case of earthquakes network and the attachment rate has a linear relationship with node degree. We have also found the seismic passive points, the most probable points to be influenced by other seismic places, using their preferential attachment values.
NASA Astrophysics Data System (ADS)
Gong, Tao; Shuai, Lan; Wu, Yicheng
2014-12-01
By analyzing complex networks constructed from authentic language data, Cong and Liu [1] advance linguistics research into the big data era. The network approach has revealed many intrinsic generalities and crucial differences at both the macro and micro scales between human languages. The axiom behind this research is that language is a complex adaptive system [2]. Although many lexical, semantic, or syntactic features have been discovered by means of analyzing the static and dynamic linguistic networks of world languages, available network-based language studies have not explicitly addressed the evolutionary dynamics of language systems and the correlations between language and human cognition. This commentary aims to provide some insights on how to use the network approach to study these issues.
Image Understanding by Image-Seeking Adaptive Networks (ISAN).
1987-08-10
our reserch on adaptive neural networks in the visual and sensory-motor cortex of cats. We demonstrate that, under certain conditions, plasticity is...understanding in organisms proceeds directly from adaptively seeking whole images and not via a preliminary analysis of elementary features, followed by object...empirical reserch has always been that ultimately any neural system has to serve behavior and that behavior serves survival. Evolutionary selection makes it
Social games in a social network.
Abramson, G; Kuperman, M
2001-03-01
We study an evolutionary version of the Prisoner's Dilemma game, played by agents placed in a small-world network. Agents are able to change their strategy, imitating that of the most successful neighbor. We observe that different topologies, ranging from regular lattices to random graphs, produce a variety of emergent behaviors. This is a contribution towards the study of social phenomena and transitions governed by the topology of the community.
An Application Development Platform for Neuromorphic Computing
DOE Office of Scientific and Technical Information (OSTI.GOV)
Dean, Mark; Chan, Jason; Daffron, Christopher
2016-01-01
Dynamic Adaptive Neural Network Arrays (DANNAs) are neuromorphic computing systems developed as a hardware based approach to the implementation of neural networks. They feature highly adaptive and programmable structural elements, which model arti cial neural networks with spiking behavior. We design them to solve problems using evolutionary optimization. In this paper, we highlight the current hardware and software implementations of DANNA, including their features, functionalities and performance. We then describe the development of an Application Development Platform (ADP) to support efficient application implementation and testing of DANNA based solutions. We conclude with future directions.
Percolation in insect nest networks: Evidence for optimal wiring
NASA Astrophysics Data System (ADS)
Valverde, Sergi; Corominas-Murtra, Bernat; Perna, Andrea; Kuntz, Pascale; Theraulaz, Guy; Solé, Ricard V.
2009-06-01
Optimization has been shown to be a driving force for the evolution of some biological structures, such as neural maps in the brain or transport networks. Here we show that insect networks also display characteristic traits of optimality. By using a graph representation of the chamber organization of termite nests and a disordered lattice model, it is found that these spatial nests are close to a percolation threshold. This suggests that termites build efficient systems of galleries spanning most of the nest volume at low cost. The evolutionary consequences are outlined.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Johnson, K.R.
1976-01-12
The Nads FSK Modem is a compact unit designed to operate in conjunction with EIA standard interfacing and the data terminal equipment of the 1200 Baud digital communications network of the Nevada Automated Diagnostics System (NADS). The modem is constructed in a Nuclear Instrumentation Module System (NIMS) module for compatability with the NADS system. The modulator section of the modem accepts serial, digital signals at 1200 Baud which may be either standard TTL levels or bipolar signals meeting either the EIA RS-232C or RS-232B standards. The output of the modulator is a Frequency-Shift Keyed (FSK) signal having frequencies of 2.2more » kHz for Mark and 1.2 kHz for Space. The demodulator section accepts the above FSK signal as input, and outputs serial, digital signals at 1200 Baud at either TTL or EIA RS-232C levels. Specifications and operation and calibration instructions are given. (WHK)« less
Serial interactome capture of the human cell nucleus.
Conrad, Thomas; Albrecht, Anne-Susann; de Melo Costa, Veronica Rodrigues; Sauer, Sascha; Meierhofer, David; Ørom, Ulf Andersson
2016-04-04
Novel RNA-guided cellular functions are paralleled by an increasing number of RNA-binding proteins (RBPs). Here we present 'serial RNA interactome capture' (serIC), a multiple purification procedure of ultraviolet-crosslinked poly(A)-RNA-protein complexes that enables global RBP detection with high specificity. We apply serIC to the nuclei of proliferating K562 cells to obtain the first human nuclear RNA interactome. The domain composition of the 382 identified nuclear RBPs markedly differs from previous IC experiments, including few factors without known RNA-binding domains that are in good agreement with computationally predicted RNA binding. serIC extends the number of DNA-RNA-binding proteins (DRBPs), and reveals a network of RBPs involved in p53 signalling and double-strand break repair. serIC is an effective tool to couple global RBP capture with additional selection or labelling steps for specific detection of highly purified RBPs.
Evolutionary dynamics of incubation periods
Ottino-Loffler, Bertrand; Scott, Jacob G
2017-01-01
The incubation period for typhoid, polio, measles, leukemia and many other diseases follows a right-skewed, approximately lognormal distribution. Although this pattern was discovered more than sixty years ago, it remains an open question to explain its ubiquity. Here, we propose an explanation based on evolutionary dynamics on graphs. For simple models of a mutant or pathogen invading a network-structured population of healthy cells, we show that skewed distributions of incubation periods emerge for a wide range of assumptions about invader fitness, competition dynamics, and network structure. The skewness stems from stochastic mechanisms associated with two classic problems in probability theory: the coupon collector and the random walk. Unlike previous explanations that rely crucially on heterogeneity, our results hold even for homogeneous populations. Thus, we predict that two equally healthy individuals subjected to equal doses of equally pathogenic agents may, by chance alone, show remarkably different time courses of disease. PMID:29266000
Cognition and the evolution of music: pitfalls and prospects.
Honing, Henkjan; Ploeger, Annemie
2012-10-01
What was the role of music in the evolutionary history of human beings? We address this question from the point of view that musicality can be defined as a cognitive trait. Although it has been argued that we will never know how cognitive traits evolved (Lewontin, 1998), we argue that we may know the evolution of music by investigating the fundamental cognitive mechanisms of musicality, for example, relative pitch, tonal encoding of pitch, and beat induction. In addition, we show that a nomological network of evidence (Schmitt & Pilcher, 2004) can be built around the hypothesis that musicality is a cognitive adaptation. Within this network, different modes of evidence are gathered to support a specific evolutionary hypothesis. We show that the combination of psychological, medical, physiological, genetic, phylogenetic, hunter-gatherer, and cross-cultural evidence indicates that musicality is a cognitive adaptation. Copyright © 2012 Cognitive Science Society, Inc.
Constraints and spandrels of interareal connectomes
Rubinov, Mikail
2016-01-01
Interareal connectomes are whole-brain wiring diagrams of white-matter pathways. Recent studies have identified modules, hubs, module hierarchies and rich clubs as structural hallmarks of these wiring diagrams. An influential current theory postulates that connectome modules are adequately explained by evolutionary pressures for wiring economy, but that the other hallmarks are not explained by such pressures and are therefore less trivial. Here, we use constraint network models to test these postulates in current gold-standard vertebrate and invertebrate interareal-connectome reconstructions. We show that empirical wiring-cost constraints inadequately explain connectome module organization, and that simultaneous module and hub constraints induce the structural byproducts of hierarchies and rich clubs. These byproducts, known as spandrels in evolutionary biology, include the structural substrate of the default-mode network. Our results imply that currently standard connectome characterizations are based on circular analyses or double dipping, and we emphasize an integrative approach to future connectome analyses for avoiding such pitfalls. PMID:27924867
Constraints and spandrels of interareal connectomes.
Rubinov, Mikail
2016-12-07
Interareal connectomes are whole-brain wiring diagrams of white-matter pathways. Recent studies have identified modules, hubs, module hierarchies and rich clubs as structural hallmarks of these wiring diagrams. An influential current theory postulates that connectome modules are adequately explained by evolutionary pressures for wiring economy, but that the other hallmarks are not explained by such pressures and are therefore less trivial. Here, we use constraint network models to test these postulates in current gold-standard vertebrate and invertebrate interareal-connectome reconstructions. We show that empirical wiring-cost constraints inadequately explain connectome module organization, and that simultaneous module and hub constraints induce the structural byproducts of hierarchies and rich clubs. These byproducts, known as spandrels in evolutionary biology, include the structural substrate of the default-mode network. Our results imply that currently standard connectome characterizations are based on circular analyses or double dipping, and we emphasize an integrative approach to future connectome analyses for avoiding such pitfalls.
Evolutionary dynamics of incubation periods.
Ottino-Loffler, Bertrand; Scott, Jacob G; Strogatz, Steven H
2017-12-21
The incubation period for typhoid, polio, measles, leukemia and many other diseases follows a right-skewed, approximately lognormal distribution. Although this pattern was discovered more than sixty years ago, it remains an open question to explain its ubiquity. Here, we propose an explanation based on evolutionary dynamics on graphs. For simple models of a mutant or pathogen invading a network-structured population of healthy cells, we show that skewed distributions of incubation periods emerge for a wide range of assumptions about invader fitness, competition dynamics, and network structure. The skewness stems from stochastic mechanisms associated with two classic problems in probability theory: the coupon collector and the random walk. Unlike previous explanations that rely crucially on heterogeneity, our results hold even for homogeneous populations. Thus, we predict that two equally healthy individuals subjected to equal doses of equally pathogenic agents may, by chance alone, show remarkably different time courses of disease.
Parallel Evolutionary Optimization for Neuromorphic Network Training
DOE Office of Scientific and Technical Information (OSTI.GOV)
Schuman, Catherine D; Disney, Adam; Singh, Susheela
One of the key impediments to the success of current neuromorphic computing architectures is the issue of how best to program them. Evolutionary optimization (EO) is one promising programming technique; in particular, its wide applicability makes it especially attractive for neuromorphic architectures, which can have many different characteristics. In this paper, we explore different facets of EO on a spiking neuromorphic computing model called DANNA. We focus on the performance of EO in the design of our DANNA simulator, and on how to structure EO on both multicore and massively parallel computing systems. We evaluate how our parallel methods impactmore » the performance of EO on Titan, the U.S.'s largest open science supercomputer, and BOB, a Beowulf-style cluster of Raspberry Pi's. We also focus on how to improve the EO by evaluating commonality in higher performing neural networks, and present the result of a study that evaluates the EO performed by Titan.« less
NASA Astrophysics Data System (ADS)
Du, Wen-Bo; Cao, Xian-Bin; Yang, Han-Xin; Hu, Mao-Bin
2010-01-01
In this paper, we introduce an asymmetric payoff distribution mechanism into the evolutionary prisoner's dilemma game (PDG) on Newman-Watts social networks, and study its effects on the evolution of cooperation. The asymmetric payoff distribution mechanism can be adjusted by the parameter α: if α > 0, the rich will exploit the poor to get richer; if α < 0, the rich are forced to offer part of their income to the poor. Numerical results show that the cooperator frequency monotonously increases with α and is remarkably promoted when α > 0. The effects of updating order and self-interaction are also investigated. The co-action of random updating and self-interaction can induce the highest cooperation level. Moreover, we employ the Gini coefficient to investigate the effect of asymmetric payoff distribution on the the system's wealth distribution. This work may be helpful for understanding cooperative behaviour and wealth inequality in society.
Neutrality and Robustness in Evo-Devo: Emergence of Lateral Inhibition
Munteanu, Andreea; Solé, Ricard V.
2008-01-01
Embryonic development is defined by the hierarchical dynamical process that translates genetic information (genotype) into a spatial gene expression pattern (phenotype) providing the positional information for the correct unfolding of the organism. The nature and evolutionary implications of genotype–phenotype mapping still remain key topics in evolutionary developmental biology (evo-devo). We have explored here issues of neutrality, robustness, and diversity in evo-devo by means of a simple model of gene regulatory networks. The small size of the system allowed an exhaustive analysis of the entire fitness landscape and the extent of its neutrality. This analysis shows that evolution leads to a class of robust genetic networks with an expression pattern characteristic of lateral inhibition. This class is a repertoire of distinct implementations of this key developmental process, the diversity of which provides valuable clues about its underlying causal principles. PMID:19023404
Frietze, Seth; Leatherman, Judith
2014-03-01
New genes that arise from modification of the noncoding portion of a genome rather than being duplicated from parent genes are called de novo genes. These genes, identified by their brief evolution and lack of parent genes, provide an opportunity to study the timeframe in which emerging genes integrate into cellular networks, and how the characteristics of these genes change as they mature into bona fide genes. An article by G. Abrusán provides an opportunity to introduce students to fundamental concepts in evolutionary and comparative genetics and to provide a technical background by which to discuss systems biology approaches when studying the evolutionary process of gene birth. Basic background needed to understand the Abrusán study and details on comparative genomic concepts tailored for a classroom discussion are provided, including discussion questions and a supplemental exercise on navigating a genome database.
The Neural Systems of Forgiveness: An Evolutionary Psychological Perspective
Billingsley, Joseph; Losin, Elizabeth A. R.
2017-01-01
Evolution-minded researchers posit that the suite of human cognitive adaptations may include forgiveness systems. According to these researchers, forgiveness systems regulate interpersonal motivation toward a transgressor in the wake of harm by weighing multiple factors that influence both the potential gains of future interaction with the transgressor and the likelihood of future harm. Although behavioral research generally supports this evolutionary model of forgiveness, the model’s claims have not been examined with available neuroscience specifically in mind, nor has recent neuroscientific research on forgiveness generally considered the evolutionary literature. The current review aims to help bridge this gap by using evolutionary psychology and cognitive neuroscience to mutually inform and interrogate one another. We briefly summarize the evolutionary research on forgiveness, then review recent neuroscientific findings on forgiveness in light of the evolutionary model. We emphasize neuroscientific research that links desire for vengeance to reward-based areas of the brain, that singles out prefrontal areas likely associated with inhibition of vengeful feelings, and that correlates the activity of a theory-of-mind network with assessments of the intentions and blameworthiness of those who commit harm. In addition, we identify gaps in the existing neuroscientific literature, and propose future research directions that might address them, at least in part. PMID:28539904
Evolutionary robotics simulations help explain why reciprocity is rare in nature
André, Jean-Baptiste; Nolfi, Stefano
2016-01-01
The relative rarity of reciprocity in nature, contrary to theoretical predictions that it should be widespread, is currently one of the major puzzles in social evolution theory. Here we use evolutionary robotics to solve this puzzle. We show that models based on game theory are misleading because they neglect the mechanics of behavior. In a series of experiments with simulated robots controlled by artificial neural networks, we find that reciprocity does not evolve, and show that this results from a general constraint that likely also prevents it from evolving in the wild. Reciprocity can evolve if it requires very few mutations, as is usually assumed in evolutionary game theoretic models, but not if, more realistically, it requires the accumulation of many adaptive mutations. PMID:27616139
Optimisation in the Design of Environmental Sensor Networks with Robustness Consideration
Budi, Setia; de Souza, Paulo; Timms, Greg; Malhotra, Vishv; Turner, Paul
2015-01-01
This work proposes the design of Environmental Sensor Networks (ESN) through balancing robustness and redundancy. An Evolutionary Algorithm (EA) is employed to find the optimal placement of sensor nodes in the Region of Interest (RoI). Data quality issues are introduced to simulate their impact on the performance of the ESN. Spatial Regression Test (SRT) is also utilised to promote robustness in data quality of the designed ESN. The proposed method provides high network representativeness (fit for purpose) with minimum sensor redundancy (cost), and ensures robustness by enabling the network to continue to achieve its objectives when some sensors fail. PMID:26633392
Topology and evolution of technology innovation networks
NASA Astrophysics Data System (ADS)
Valverde, Sergi; Solé, Ricard V.; Bedau, Mark A.; Packard, Norman
2007-11-01
The web of relations linking technological innovation can be fairly described in terms of patent citations. The resulting patent citation network provides a picture of the large-scale organization of innovations and its time evolution. Here we study the patterns of change of patents registered by the U.S. Patent and Trademark Office. We show that the scaling behavior exhibited by this network is consistent with a preferential attachment mechanism together with a Weibull-shaped aging term. Such an attachment kernel is shared by scientific citation networks, thus indicating a universal type of mechanism linking ideas and designs and their evolution. The implications for evolutionary theory of innovation are discussed.
Kopp, Franziska; Schröger, Erich; Lipka, Sigrid
2006-08-01
EEG coherence as a measure of synchronization of brain activity was used to investigate effects of irrelevant speech. In a delayed serial recall paradigm 21 healthy participants retained verbal items over a 10-s delay with and without interfering irrelevant speech. Recall after the delay was varied in two modes (spoken vs. written). Behavioral data showed the classic irrelevant speech effect and a superiority of written over spoken recall mode. Coherence, however, was more sensitive to processing characteristics and showed interactions between the irrelevant speech effect and recall mode during the rehearsal delay in theta (4-7.5 Hz), alpha (8-12 Hz), beta (13-20 Hz), and gamma (35-47 Hz) frequency bands. For gamma, a rehearsal-related decrease of the duration of high coherence due to presentation of irrelevant speech was found in a left-lateralized fronto-central and centro-temporal network only in spoken but not in written recall. In theta, coherence at predominantly fronto-parietal electrode combinations was indicative for memory demands and varied with individual working memory capacity assessed by digit span. Alpha coherence revealed similar results and patterns as theta coherence. In beta, a left-hemispheric network showed longer high synchronizations due to irrelevant speech only in written recall mode. EEG results suggest that mode of recall is critical for processing already during the retention period of a delayed serial recall task. Moreover, the finding that different networks are engaged with different recall modes shows that the disrupting effect of irrelevant speech is not a unitary mechanism.
Latino Civic Group Participation, Social Networks, and Physical Activity.
Marquez, Becky; Gonzalez, Patricia; Gallo, Linda; Ji, Ming
2016-07-01
We examined whether social networks and resource awareness for physical activity may mediate the relationship between civic group participation and physical activity. This is a cross-sectional study of a randomly selected sample of 335 Latinos (mean age 42.1 ± 16.4 years) participating in the San Diego Prevention Research Center's 2009 Household Community Survey. Serial multiple mediation analysis tested the hypothesis that civic group participation is associated with meeting physical activity recommendations through an indirect mechanism of larger social networks followed by greater knowledge of physical activity community resources. The indirect effects of level of civic group participation as well as religious, health, neighborhood, or arts group participation on meeting national physical activity recommendations were significant in models testing pathways through social network size and physical activity resource awareness. The direct effect was only significant for health group indicating that participating in a health group predicted physical activity independent of social network size and awareness of physical activity resources. Belonging to civic groups may promote physical activity engagement through social network diffusion of information on community physical activity resources which has implications for health.
A neural network model of memory and higher cognitive functions.
Vogel, David D
2005-01-01
I first describe a neural network model of associative memory in a small region of the brain. The model depends, unconventionally, on disinhibition of inhibitory links between excitatory neurons rather than long-term potentiation (LTP) of excitatory projections. The model may be shown to have advantages over traditional neural network models both in terms of information storage capacity and biological plausibility. The learning and recall algorithms are independent of network architecture, and require no thresholds or finely graded synaptic strengths. Several copies of this local network are then connected by means of many, weak, reciprocal, excitatory projections that allow one region to control the recall of information in another to produce behaviors analogous to serial memory, classical and operant conditioning, secondary reinforcement, refabrication of memory, and fabrication of possible future events. The network distinguishes between perceived and recalled events, and can predicate its response on the absence as well as the presence of particular stimuli. Some of these behaviors are achieved in ways that seem to provide instances of self-awareness and imagination, suggesting that consciousness may emerge as an epiphenomenon in simple brains.
Evolving cell models for systems and synthetic biology.
Cao, Hongqing; Romero-Campero, Francisco J; Heeb, Stephan; Cámara, Miguel; Krasnogor, Natalio
2010-03-01
This paper proposes a new methodology for the automated design of cell models for systems and synthetic biology. Our modelling framework is based on P systems, a discrete, stochastic and modular formal modelling language. The automated design of biological models comprising the optimization of the model structure and its stochastic kinetic constants is performed using an evolutionary algorithm. The evolutionary algorithm evolves model structures by combining different modules taken from a predefined module library and then it fine-tunes the associated stochastic kinetic constants. We investigate four alternative objective functions for the fitness calculation within the evolutionary algorithm: (1) equally weighted sum method, (2) normalization method, (3) randomly weighted sum method, and (4) equally weighted product method. The effectiveness of the methodology is tested on four case studies of increasing complexity including negative and positive autoregulation as well as two gene networks implementing a pulse generator and a bandwidth detector. We provide a systematic analysis of the evolutionary algorithm's results as well as of the resulting evolved cell models.