Evidence for the additions of clustered interacting nodes during the evolution of protein interaction networks from network motifs

Directory of Open Access Journals (Sweden)

Guo Hao

2011-05-01

Full Text Available Abstract Background High-throughput screens have revealed large-scale protein interaction networks defining most cellular functions. How the proteins were added to the protein interaction network during its growth is a basic and important issue. Network motifs represent the simplest building blocks of cellular machines and are of biological significance. Results Here we study the evolution of protein interaction networks from the perspective of network motifs. We find that in current protein interaction networks, proteins of the same age class tend to form motifs and such co-origins of motif constituents are affected by their topologies and biological functions. Further, we find that the proteins within motifs whose constituents are of the same age class tend to be densely interconnected, co-evolve and share the same biological functions, and these motifs tend to be within protein complexes. Conclusions Our findings provide novel evidence for the hypothesis of the additions of clustered interacting nodes and point out network motifs, especially the motifs with the dense topology and specific function may play important roles during this process. Our results suggest functional constraints may be the underlying driving force for such additions of clustered interacting nodes.

Stochastic Resonance in Neuronal Network Motifs with Ornstein-Uhlenbeck Colored Noise

Directory of Open Access Journals (Sweden)

Xuyang Lou

2014-01-01

Full Text Available We consider here the effect of the Ornstein-Uhlenbeck colored noise on the stochastic resonance of the feed-forward-loop (FFL network motif. The FFL motif is modeled through the FitzHugh-Nagumo neuron model as well as the chemical coupling. Our results show that the noise intensity and the correlation time of the noise process serve as the control parameters, which have great impacts on the stochastic dynamics of the FFL motif. We find that, with a proper choice of noise intensities and the correlation time of the noise process, the signal-to-noise ratio (SNR can display more than one peak.

Organization of feed-forward loop motifs reveals architectural principles in natural and engineered networks.

Science.gov (United States)

Gorochowski, Thomas E; Grierson, Claire S; di Bernardo, Mario

2018-03-01

Network motifs are significantly overrepresented subgraphs that have been proposed as building blocks for natural and engineered networks. Detailed functional analysis has been performed for many types of motif in isolation, but less is known about how motifs work together to perform complex tasks. To address this issue, we measure the aggregation of network motifs via methods that extract precisely how these structures are connected. Applying this approach to a broad spectrum of networked systems and focusing on the widespread feed-forward loop motif, we uncover striking differences in motif organization. The types of connection are often highly constrained, differ between domains, and clearly capture architectural principles. We show how this information can be used to effectively predict functionally important nodes in the metabolic network of Escherichia coli . Our findings have implications for understanding how networked systems are constructed from motif parts and elucidate constraints that guide their evolution.

Directed connectivity of brain default networks in resting state using GCA and motif.

Science.gov (United States)

Jiao, Zhuqing; Wang, Huan; Ma, Kai; Zou, Ling; Xiang, Jianbo

2017-06-01

Nowadays, there is a lot of interest in assessing functional interactions between key brain regions. In this paper, Granger causality analysis (GCA) and motif structure are adopted to study directed connectivity of brain default mode networks (DMNs) in resting state. Firstly, the time series of functional magnetic resonance imaging (fMRI) data in resting state were extracted, and the causal relationship values of the nodes representing related brain regions are analyzed in time domain to construct a default network. Then, the network structures were searched from the default networks of controls and patients to determine the fixed connection mode in the networks. The important degree of motif structures in directed connectivity of default networks was judged according to p-value and Z-score. Both node degree and average distance were used to analyze the effect degree an information transfer rate of brain regions in motifs and default networks, and efficiency of the network. Finally, activity and functional connectivity strength of the default brain regions are researched according to the change of energy distributions between the normals and the patients' brain regions. Experimental results demonstrate that, both normal subjects and stroke patients have some corresponding fixed connection mode of three nodes, and the efficiency and power spectrum of the patient's default network is somewhat lower than that of the normal person. In particular, the Right Posterior Cingulate Gyrus (PCG.R) has a larger change in functional connectivity and its activity. The research results verify the feasibility of the application of GCA and motif structure to study the functional connectivity of default networks in resting state.

Identification of important nodes in directed biological networks: a network motif approach.

Directory of Open Access Journals (Sweden)

Pei Wang

Full Text Available Identification of important nodes in complex networks has attracted an increasing attention over the last decade. Various measures have been proposed to characterize the importance of nodes in complex networks, such as the degree, betweenness and PageRank. Different measures consider different aspects of complex networks. Although there are numerous results reported on undirected complex networks, few results have been reported on directed biological networks. Based on network motifs and principal component analysis (PCA, this paper aims at introducing a new measure to characterize node importance in directed biological networks. Investigations on five real-world biological networks indicate that the proposed method can robustly identify actually important nodes in different networks, such as finding command interneurons, global regulators and non-hub but evolutionary conserved actually important nodes in biological networks. Receiver Operating Characteristic (ROC curves for the five networks indicate remarkable prediction accuracy of the proposed measure. The proposed index provides an alternative complex network metric. Potential implications of the related investigations include identifying network control and regulation targets, biological networks modeling and analysis, as well as networked medicine.

Do motifs reflect evolved function?--No convergent evolution of genetic regulatory network subgraph topologies.

Science.gov (United States)

Knabe, Johannes F; Nehaniv, Chrystopher L; Schilstra, Maria J

2008-01-01

Methods that analyse the topological structure of networks have recently become quite popular. Whether motifs (subgraph patterns that occur more often than in randomized networks) have specific functions as elementary computational circuits has been cause for debate. As the question is difficult to resolve with currently available biological data, we approach the issue using networks that abstractly model natural genetic regulatory networks (GRNs) which are evolved to show dynamical behaviors. Specifically one group of networks was evolved to be capable of exhibiting two different behaviors ("differentiation") in contrast to a group with a single target behavior. In both groups we find motif distribution differences within the groups to be larger than differences between them, indicating that evolutionary niches (target functions) do not necessarily mold network structure uniquely. These results show that variability operators can have a stronger influence on network topologies than selection pressures, especially when many topologies can create similar dynamics. Moreover, analysis of motif functional relevance by lesioning did not suggest that motifs were of greater importance to the functioning of the network than arbitrary subgraph patterns. Only when drastically restricting network size, so that one motif corresponds to a whole functionally evolved network, was preference for particular connection patterns found. This suggests that in non-restricted, bigger networks, entanglement with the rest of the network hinders topological subgraph analysis.

Distinct configurations of protein complexes and biochemical pathways revealed by epistatic interaction network motifs

LENUS (Irish Health Repository)

Casey, Fergal

2011-08-22

Abstract Background Gene and protein interactions are commonly represented as networks, with the genes or proteins comprising the nodes and the relationship between them as edges. Motifs, or small local configurations of edges and nodes that arise repeatedly, can be used to simplify the interpretation of networks. Results We examined triplet motifs in a network of quantitative epistatic genetic relationships, and found a non-random distribution of particular motif classes. Individual motif classes were found to be associated with different functional properties, suggestive of an underlying biological significance. These associations were apparent not only for motif classes, but for individual positions within the motifs. As expected, NNN (all negative) motifs were strongly associated with previously reported genetic (i.e. synthetic lethal) interactions, while PPP (all positive) motifs were associated with protein complexes. The two other motif classes (NNP: a positive interaction spanned by two negative interactions, and NPP: a negative spanned by two positives) showed very distinct functional associations, with physical interactions dominating for the former but alternative enrichments, typical of biochemical pathways, dominating for the latter. Conclusion We present a model showing how NNP motifs can be used to recognize supportive relationships between protein complexes, while NPP motifs often identify opposing or regulatory behaviour between a gene and an associated pathway. The ability to use motifs to point toward underlying biological organizational themes is likely to be increasingly important as more extensive epistasis mapping projects in higher organisms begin.

Codon based co-occurrence network motifs in human mitochondria

Directory of Open Access Journals (Sweden)

Pramod Shinde

2017-10-01

Full Text Available The nucleotide polymorphism in human mitochondrial genome (mtDNA tolled by codon position bias plays an indispensable role in human population dispersion and expansion. Herein, we constructed genome-wide nucleotide co-occurrence networks using a massive data consisting of five different geographical regions and around 3000 samples for each region. We developed a powerful network model to describe complex mitochondrial evolutionary patterns between codon and non-codon positions. It was interesting to report a different evolution of Asian genomes than those of the rest which is divulged by network motifs. We found evidence that mtDNA undergoes substantial amounts of adaptive evolution, a finding which was supported by a number of previous studies. The dominance of higher order motifs indicated the importance of long-range nucleotide co-occurrence in genomic diversity. Most notably, codon motifs apparently underpinned the preferences among codon positions for co-evolution which is probably highly biased during the origin of the genetic code. Our analyses manifested that codon position co-evolution is very well conserved across human sub-populations and independently maintained within human sub-populations implying the selective role of evolutionary processes on codon position co-evolution. Ergo, this study provided a framework to investigate cooperative genomic interactions which are critical in underlying complex mitochondrial evolution.

Super-transient scaling in time-delay autonomous Boolean network motifs

Energy Technology Data Exchange (ETDEWEB)

D' Huys, Otti, E-mail: otti.dhuys@phy.duke.edu; Haynes, Nicholas D. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Lohmann, Johannes [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstraße 36, 10623 Berlin (Germany); Gauthier, Daniel J. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Department of Physics, The Ohio State University, Columbus, Ohio 43210 (United States)

2016-09-15

Autonomous Boolean networks are commonly used to model the dynamics of gene regulatory networks and allow for the prediction of stable dynamical attractors. However, most models do not account for time delays along the network links and noise, which are crucial features of real biological systems. Concentrating on two paradigmatic motifs, the toggle switch and the repressilator, we develop an experimental testbed that explicitly includes both inter-node time delays and noise using digital logic elements on field-programmable gate arrays. We observe transients that last millions to billions of characteristic time scales and scale exponentially with the amount of time delays between nodes, a phenomenon known as super-transient scaling. We develop a hybrid model that includes time delays along network links and allows for stochastic variation in the delays. Using this model, we explain the observed super-transient scaling of both motifs and recreate the experimentally measured transient distributions.

Comparative genomics of metabolic capacities of regulons controlled by cis-regulatory RNA motifs in bacteria.

Science.gov (United States)

Sun, Eric I; Leyn, Semen A; Kazanov, Marat D; Saier, Milton H; Novichkov, Pavel S; Rodionov, Dmitry A

2013-09-02

In silico comparative genomics approaches have been efficiently used for functional prediction and reconstruction of metabolic and regulatory networks. Riboswitches are metabolite-sensing structures often found in bacterial mRNA leaders controlling gene expression on transcriptional or translational levels.An increasing number of riboswitches and other cis-regulatory RNAs have been recently classified into numerous RNA families in the Rfam database. High conservation of these RNA motifs provides a unique advantage for their genomic identification and comparative analysis. A comparative genomics approach implemented in the RegPredict tool was used for reconstruction and functional annotation of regulons controlled by RNAs from 43 Rfam families in diverse taxonomic groups of Bacteria. The inferred regulons include ~5200 cis-regulatory RNAs and more than 12000 target genes in 255 microbial genomes. All predicted RNA-regulated genes were classified into specific and overall functional categories. Analysis of taxonomic distribution of these categories allowed us to establish major functional preferences for each analyzed cis-regulatory RNA motif family. Overall, most RNA motif regulons showed predictable functional content in accordance with their experimentally established effector ligands. Our results suggest that some RNA motifs (including thiamin pyrophosphate and cobalamin riboswitches that control the cofactor metabolism) are widespread and likely originated from the last common ancestor of all bacteria. However, many more analyzed RNA motifs are restricted to a narrow taxonomic group of bacteria and likely represent more recent evolutionary innovations. The reconstructed regulatory networks for major known RNA motifs substantially expand the existing knowledge of transcriptional regulation in bacteria. The inferred regulons can be used for genetic experiments, functional annotations of genes, metabolic reconstruction and evolutionary analysis. The obtained genome

Dimensionality of social networks using motifs and eigenvalues.

Directory of Open Access Journals (Sweden)

Anthony Bonato

Full Text Available We consider the dimensionality of social networks, and develop experiments aimed at predicting that dimension. We find that a social network model with nodes and links sampled from an m-dimensional metric space with power-law distributed influence regions best fits samples from real-world networks when m scales logarithmically with the number of nodes of the network. This supports a logarithmic dimension hypothesis, and we provide evidence with two different social networks, Facebook and LinkedIn. Further, we employ two different methods for confirming the hypothesis: the first uses the distribution of motif counts, and the second exploits the eigenvalue distribution.

Temporal motifs reveal collaboration patterns in online task-oriented networks

Science.gov (United States)

Xuan, Qi; Fang, Huiting; Fu, Chenbo; Filkov, Vladimir

2015-05-01

Real networks feature layers of interactions and complexity. In them, different types of nodes can interact with each other via a variety of events. Examples of this complexity are task-oriented social networks (TOSNs), where teams of people share tasks towards creating a quality artifact, such as academic research papers or software development in commercial or open source environments. Accomplishing those tasks involves both work, e.g., writing the papers or code, and communication, to discuss and coordinate. Taking into account the different types of activities and how they alternate over time can result in much more precise understanding of the TOSNs behaviors and outcomes. That calls for modeling techniques that can accommodate both node and link heterogeneity as well as temporal change. In this paper, we report on methodology for finding temporal motifs in TOSNs, limited to a system of two people and an artifact. We apply the methods to publicly available data of TOSNs from 31 Open Source Software projects. We find that these temporal motifs are enriched in the observed data. When applied to software development outcome, temporal motifs reveal a distinct dependency between collaboration and communication in the code writing process. Moreover, we show that models based on temporal motifs can be used to more precisely relate both individual developer centrality and team cohesion to programmer productivity than models based on aggregated TOSNs.

How pathogens use linear motifs to perturb host cell networks

KAUST Repository

Via, Allegra; Uyar, Bora; Brun, Christine; Zanzoni, Andreas

2015-01-01

Molecular mimicry is one of the powerful stratagems that pathogens employ to colonise their hosts and take advantage of host cell functions to guarantee their replication and dissemination. In particular, several viruses have evolved the ability to interact with host cell components through protein short linear motifs (SLiMs) that mimic host SLiMs, thus facilitating their internalisation and the manipulation of a wide range of cellular networks. Here we present convincing evidence from the literature that motif mimicry also represents an effective, widespread hijacking strategy in prokaryotic and eukaryotic parasites. Further insights into host motif mimicry would be of great help in the elucidation of the molecular mechanisms behind host cell invasion and the development of anti-infective therapeutic strategies.

Motif distributions in phase-space networks for characterizing experimental two-phase flow patterns with chaotic features.

Science.gov (United States)

Gao, Zhong-Ke; Jin, Ning-De; Wang, Wen-Xu; Lai, Ying-Cheng

2010-07-01

The dynamics of two-phase flows have been a challenging problem in nonlinear dynamics and fluid mechanics. We propose a method to characterize and distinguish patterns from inclined water-oil flow experiments based on the concept of network motifs that have found great usage in network science and systems biology. In particular, we construct from measured time series phase-space complex networks and then calculate the distribution of a set of distinct network motifs. To gain insight, we first test the approach using time series from classical chaotic systems and find a universal feature: motif distributions from different chaotic systems are generally highly heterogeneous. Our main finding is that the distributions from experimental two-phase flows tend to be heterogeneous as well, suggesting the underlying chaotic nature of the flow patterns. Calculation of the maximal Lyapunov exponent provides further support for this. Motif distributions can thus be a feasible tool to understand the dynamics of realistic two-phase flow patterns.

Robustness and backbone motif of a cancer network regulated by miR-17-92 cluster during the G1/S transition.

Directory of Open Access Journals (Sweden)

Lijian Yang

Full Text Available Based on interactions among transcription factors, oncogenes, tumor suppressors and microRNAs, a Boolean model of cancer network regulated by miR-17-92 cluster is constructed, and the network is associated with the control of G1/S transition in the mammalian cell cycle. The robustness properties of this regulatory network are investigated by virtue of the Boolean network theory. It is found that, during G1/S transition in the cell cycle process, the regulatory networks are robustly constructed, and the robustness property is largely preserved with respect to small perturbations to the network. By using the unique process-based approach, the structure of this network is analyzed. It is shown that the network can be decomposed into a backbone motif which provides the main biological functions, and a remaining motif which makes the regulatory system more stable. The critical role of miR-17-92 in suppressing the G1/S cell cycle checkpoint and increasing the uncontrolled proliferation of the cancer cells by targeting a genetic network of interacting proteins is displayed with our model.

Controllability analysis of transcriptional regulatory networks reveals circular control patterns among transcription factors

DEFF Research Database (Denmark)

Österlund, Tobias; Bordel, Sergio; Nielsen, Jens

2015-01-01

% for the human network. The high controllability (low number of drivers needed to control the system) in yeast, mouse and human is due to the presence of internal loops in their regulatory networks where the TFs regulate each other in a circular fashion. We refer to these internal loops as circular control...... motifs (CCM). The E. coli transcriptional regulatory network, which does not have any CCMs, shows a hierarchical structure of the transcriptional regulatory network in contrast to the eukaryal networks. The presence of CCMs also has influence on the stability of these networks, as the presence of cycles...

Cancer-related marketing centrality motifs acting as pivot units in the human signaling network and mediating cross-talk between biological pathways.

Science.gov (United States)

Li, Wan; Chen, Lina; Li, Xia; Jia, Xu; Feng, Chenchen; Zhang, Liangcai; He, Weiming; Lv, Junjie; He, Yuehan; Li, Weiguo; Qu, Xiaoli; Zhou, Yanyan; Shi, Yuchen

2013-12-01

Network motifs in central positions are considered to not only have more in-coming and out-going connections but are also localized in an area where more paths reach the networks. These central motifs have been extensively investigated to determine their consistent functions or associations with specific function categories. However, their functional potentials in the maintenance of cross-talk between different functional communities are unclear. In this paper, we constructed an integrated human signaling network from the Pathway Interaction Database. We identified 39 essential cancer-related motifs in central roles, which we called cancer-related marketing centrality motifs, using combined centrality indices on the system level. Our results demonstrated that these cancer-related marketing centrality motifs were pivotal units in the signaling network, and could mediate cross-talk between 61 biological pathways (25 could be mediated by one motif on average), most of which were cancer-related pathways. Further analysis showed that molecules of most marketing centrality motifs were in the same or adjacent subcellular localizations, such as the motif containing PI3K, PDK1 and AKT1 in the plasma membrane, to mediate signal transduction between 32 cancer-related pathways. Finally, we analyzed the pivotal roles of cancer genes in these marketing centrality motifs in the pathogenesis of cancers, and found that non-cancer genes were potential cancer-related genes.

Asymptotic stability of a genetic network under impulsive control

International Nuclear Information System (INIS)

Li Fangfei; Sun Jitao

2010-01-01

The study of the stability of genetic network is an important motif for the understanding of the living organism at both molecular and cellular levels. In this Letter, we provide a theoretical method for analyzing the asymptotic stability of a genetic network under impulsive control. And the sufficient conditions of its asymptotic stability under impulsive control are obtained. Finally, an example is given to illustrate the effectiveness of the obtained method.

Probabilistic generation of random networks taking into account information on motifs occurrence.

Science.gov (United States)

Bois, Frederic Y; Gayraud, Ghislaine

2015-01-01

Because of the huge number of graphs possible even with a small number of nodes, inference on network structure is known to be a challenging problem. Generating large random directed graphs with prescribed probabilities of occurrences of some meaningful patterns (motifs) is also difficult. We show how to generate such random graphs according to a formal probabilistic representation, using fast Markov chain Monte Carlo methods to sample them. As an illustration, we generate realistic graphs with several hundred nodes mimicking a gene transcription interaction network in Escherichia coli.

An approach to evaluate the topological significance of motifs and other patterns in regulatory networks

Directory of Open Access Journals (Sweden)

Wingender Edgar

2009-05-01

Full Text Available Abstract Background The identification of network motifs as statistically over-represented topological patterns has become one of the most promising topics in the analysis of complex networks. The main focus is commonly made on how they operate by means of their internal organization. Yet, their contribution to a network's global architecture is poorly understood. However, this requires switching from the abstract view of a topological pattern to the level of its instances. Here, we show how a recently proposed metric, the pairwise disconnectivity index, can be adapted to survey if and which kind of topological patterns and their instances are most important for sustaining the connectivity within a network. Results The pairwise disconnectivity index of a pattern instance quantifies the dependency of the pairwise connections between vertices in a network on the presence of this pattern instance. Thereby, it particularly considers how the coherence between the unique constituents of a pattern instance relates to the rest of a network. We have applied the method exemplarily to the analysis of 3-vertex topological pattern instances in the transcription networks of a bacteria (E. coli, a unicellular eukaryote (S. cerevisiae and higher eukaryotes (human, mouse, rat. We found that in these networks only very few pattern instances break lots of the pairwise connections between vertices upon the removal of an instance. Among them network motifs do not prevail. Rather, those patterns that are shared by the three networks exhibit a conspicuously enhanced pairwise disconnectivity index. Additionally, these are often located in close vicinity to each other or are even overlapping, since only a small number of genes are repeatedly present in most of them. Moreover, evidence has gathered that the importance of these pattern instances is due to synergistic rather than merely additive effects between their constituents. Conclusion A new method has been proposed

Repeating Spatial-Temporal Motifs of CA3 Activity Dependent on Engineered Inputs from Dentate Gyrus Neurons in Live Hippocampal Networks.

Science.gov (United States)

Bhattacharya, Aparajita; Desai, Harsh; DeMarse, Thomas B; Wheeler, Bruce C; Brewer, Gregory J

2016-01-01

Anatomical and behavioral studies, and in vivo and slice electrophysiology of the hippocampus suggest specific functions of the dentate gyrus (DG) and the CA3 subregions, but the underlying activity dynamics and repeatability of information processing remains poorly understood. To approach this problem, we engineered separate living networks of the DG and CA3 neurons that develop connections through 51 tunnels for axonal communication. Growing these networks on top of an electrode array enabled us to determine whether the subregion dynamics were separable and repeatable. We found spontaneous development of polarized propagation of 80% of the activity in the native direction from DG to CA3 and different spike and burst dynamics for these subregions. Spatial-temporal differences emerged when the relationships of target CA3 activity were categorized with to the number and timing of inputs from the apposing network. Compared to times of CA3 activity when there was no recorded tunnel input, DG input led to CA3 activity bursts that were 7× more frequent, increased in amplitude and extended in temporal envelope. Logistic regression indicated that a high number of tunnel inputs predict CA3 activity with 90% sensitivity and 70% specificity. Compared to no tunnel input, patterns of >80% tunnel inputs from DG specified different patterns of first-to-fire neurons in the CA3 target well. Clustering dendrograms revealed repeating motifs of three or more patterns at up to 17 sites in CA3 that were importantly associated with specific spatial-temporal patterns of tunnel activity. The number of these motifs recorded in 3 min was significantly higher than shuffled spike activity and not seen above chance in control networks in which CA3 was apposed to CA3 or DG to DG. Together, these results demonstrate spontaneous input-dependent repeatable coding of distributed activity in CA3 networks driven by engineered inputs from DG networks. These functional configurations at measured times

Identifying Controlling Nodes in Neuronal Networks in Different Scales

Science.gov (United States)

Tang, Yang; Gao, Huijun; Zou, Wei; Kurths, Jürgen

2012-01-01

Recent studies have detected hubs in neuronal networks using degree, betweenness centrality, motif and synchronization and revealed the importance of hubs in their structural and functional roles. In addition, the analysis of complex networks in different scales are widely used in physics community. This can provide detailed insights into the intrinsic properties of networks. In this study, we focus on the identification of controlling regions in cortical networks of cats’ brain in microscopic, mesoscopic and macroscopic scales, based on single-objective evolutionary computation methods. The problem is investigated by considering two measures of controllability separately. The impact of the number of driver nodes on controllability is revealed and the properties of controlling nodes are shown in a statistical way. Our results show that the statistical properties of the controlling nodes display a concave or convex shape with an increase of the allowed number of controlling nodes, revealing a transition in choosing driver nodes from the areas with a large degree to the areas with a low degree. Interestingly, the community Auditory in cats’ brain, which has sparse connections with other communities, plays an important role in controlling the neuronal networks. PMID:22848475

Core regulatory network motif underlies the ocellar complex patterning in Drosophila melanogaster

Science.gov (United States)

Aguilar-Hidalgo, D.; Lemos, M. C.; Córdoba, A.

2015-03-01

During organogenesis, developmental programs governed by Gene Regulatory Networks (GRN) define the functionality, size and shape of the different constituents of living organisms. Robustness, thus, is an essential characteristic that GRNs need to fulfill in order to maintain viability and reproducibility in a species. In the present work we analyze the robustness of the patterning for the ocellar complex formation in Drosophila melanogaster fly. We have systematically pruned the GRN that drives the development of this visual system to obtain the minimum pathway able to satisfy this pattern. We found that the mechanism underlying the patterning obeys to the dynamics of a 3-nodes network motif with a double negative feedback loop fed by a morphogenetic gradient that triggers the inhibition in a French flag problem fashion. A Boolean modeling of the GRN confirms robustness in the patterning mechanism showing the same result for different network complexity levels. Interestingly, the network provides a steady state solution in the interocellar part of the patterning and an oscillatory regime in the ocelli. This theoretical result predicts that the ocellar pattern may underlie oscillatory dynamics in its genetic regulation.

MIR@NT@N: a framework integrating transcription factors, microRNAs and their targets to identify sub-network motifs in a meta-regulation network model

Directory of Open Access Journals (Sweden)

Wasserman Wyeth W

2011-03-01

Full Text Available Abstract Background To understand biological processes and diseases, it is crucial to unravel the concerted interplay of transcription factors (TFs, microRNAs (miRNAs and their targets within regulatory networks and fundamental sub-networks. An integrative computational resource generating a comprehensive view of these regulatory molecular interactions at a genome-wide scale would be of great interest to biologists, but is not available to date. Results To identify and analyze molecular interaction networks, we developed MIR@NT@N, an integrative approach based on a meta-regulation network model and a large-scale database. MIR@NT@N uses a graph-based approach to predict novel molecular actors across multiple regulatory processes (i.e. TFs acting on protein-coding or miRNA genes, or miRNAs acting on messenger RNAs. Exploiting these predictions, the user can generate networks and further analyze them to identify sub-networks, including motifs such as feedback and feedforward loops (FBL and FFL. In addition, networks can be built from lists of molecular actors with an a priori role in a given biological process to predict novel and unanticipated interactions. Analyses can be contextualized and filtered by integrating additional information such as microarray expression data. All results, including generated graphs, can be visualized, saved and exported into various formats. MIR@NT@N performances have been evaluated using published data and then applied to the regulatory program underlying epithelium to mesenchyme transition (EMT, an evolutionary-conserved process which is implicated in embryonic development and disease. Conclusions MIR@NT@N is an effective computational approach to identify novel molecular regulations and to predict gene regulatory networks and sub-networks including conserved motifs within a given biological context. Taking advantage of the M@IA environment, MIR@NT@N is a user-friendly web resource freely available at http

Noise transmission and delay-induced stochasticoscillations in biochemical network motifs

Institute of Scientific and Technical Information of China (English)

Liu Sheng-Jun; Wang Qi; Liu Bo; Yan Shi-Wei; Fumihiko Sakata

2011-01-01

With the aid of stochastic delayed-feedback differential equations,we derive an analytic expression for the power spectra of reacting molecules included in a generic biological network motif that is incorporated with a feedback mechanism and time delays in gene regulation.We systematically analyse the effects of time delays,the feedback mechanism,and biological stochasticity on the power spectra.It has been clarified that the time delays together with the feedback mechanism can induce stochastic oscillations at the molecular level and invalidate the noise addition rule for a modular description of the noise propagator.Delay-induced stochastic resonance can be expected,which is related to the stability loss of the reaction systems and Hopf bifurcation occurring for solutions of the corresponding deterministic reaction equations.Through the analysis of the power spectrum,a new approach is proposed to estimate the oscillation period.

MOCCS: Clarifying DNA-binding motif ambiguity using ChIP-Seq data.

Science.gov (United States)

Ozaki, Haruka; Iwasaki, Wataru

2016-08-01

As a key mechanism of gene regulation, transcription factors (TFs) bind to DNA by recognizing specific short sequence patterns that are called DNA-binding motifs. A single TF can accept ambiguity within its DNA-binding motifs, which comprise both canonical (typical) and non-canonical motifs. Clarification of such DNA-binding motif ambiguity is crucial for revealing gene regulatory networks and evaluating mutations in cis-regulatory elements. Although chromatin immunoprecipitation sequencing (ChIP-seq) now provides abundant data on the genomic sequences to which a given TF binds, existing motif discovery methods are unable to directly answer whether a given TF can bind to a specific DNA-binding motif. Here, we report a method for clarifying the DNA-binding motif ambiguity, MOCCS. Given ChIP-Seq data of any TF, MOCCS comprehensively analyzes and describes every k-mer to which that TF binds. Analysis of simulated datasets revealed that MOCCS is applicable to various ChIP-Seq datasets, requiring only a few minutes per dataset. Application to the ENCODE ChIP-Seq datasets proved that MOCCS directly evaluates whether a given TF binds to each DNA-binding motif, even if known position weight matrix models do not provide sufficient information on DNA-binding motif ambiguity. Furthermore, users are not required to provide numerous parameters or background genomic sequence models that are typically unavailable. MOCCS is implemented in Perl and R and is freely available via https://github.com/yuifu/moccs. By complementing existing motif-discovery software, MOCCS will contribute to the basic understanding of how the genome controls diverse cellular processes via DNA-protein interactions. Copyright © 2016 Elsevier Ltd. All rights reserved.

CompariMotif: quick and easy comparisons of sequence motifs.

Science.gov (United States)

Edwards, Richard J; Davey, Norman E; Shields, Denis C

2008-05-15

CompariMotif is a novel tool for making motif-motif comparisons, identifying and describing similarities between regular expression motifs. CompariMotif can identify a number of different relationships between motifs, including exact matches, variants of degenerate motifs and complex overlapping motifs. Motif relationships are scored using shared information content, allowing the best matches to be easily identified in large comparisons. Many input and search options are available, enabling a list of motifs to be compared to itself (to identify recurring motifs) or to datasets of known motifs. CompariMotif can be run online at http://bioware.ucd.ie/ and is freely available for academic use as a set of open source Python modules under a GNU General Public License from http://bioinformatics.ucd.ie/shields/software/comparimotif/

Statistically validated mobile communication networks: the evolution of motifs in European and Chinese data

International Nuclear Information System (INIS)

Li, Ming-Xia; Jiang, Zhi-Qiang; Zhou, Wei-Xing; Palchykov, Vasyl; Kaski, Kimmo; Kertész, János; Miccichè, Salvatore; Tumminello, Michele; N Mantegna, Rosario

2014-01-01

Big data open up unprecedented opportunities for investigating complex systems, including society. In particular, communication data serve as major sources for computational social sciences, but they have to be cleaned and filtered as they may contain spurious information due to recording errors as well as interactions, like commercial and marketing activities, not directly related to the social network. The network constructed from communication data can only be considered as a proxy for the network of social relationships. Here we apply a systematic method, based on multiple-hypothesis testing, to statistically validate the links and then construct the corresponding Bonferroni network, generalized to the directed case. We study two large datasets of mobile phone records, one from Europe and the other from China. For both datasets we compare the raw data networks with the corresponding Bonferroni networks and point out significant differences in the structures and in the basic network measures. We show evidence that the Bonferroni network provides a better proxy for the network of social interactions than the original one. Using the filtered networks, we investigated the statistics and temporal evolution of small directed 3-motifs and concluded that closed communication triads have a formation time scale, which is quite fast and typically intraday. We also find that open communication triads preferentially evolve into other open triads with a higher fraction of reciprocated calls. These stylized facts were observed for both datasets. (paper)

Statistically validated mobile communication networks: the evolution of motifs in European and Chinese data

Science.gov (United States)

Li, Ming-Xia; Palchykov, Vasyl; Jiang, Zhi-Qiang; Kaski, Kimmo; Kertész, János; Miccichè, Salvatore; Tumminello, Michele; Zhou, Wei-Xing; Mantegna, Rosario N.

2014-08-01

Big data open up unprecedented opportunities for investigating complex systems, including society. In particular, communication data serve as major sources for computational social sciences, but they have to be cleaned and filtered as they may contain spurious information due to recording errors as well as interactions, like commercial and marketing activities, not directly related to the social network. The network constructed from communication data can only be considered as a proxy for the network of social relationships. Here we apply a systematic method, based on multiple-hypothesis testing, to statistically validate the links and then construct the corresponding Bonferroni network, generalized to the directed case. We study two large datasets of mobile phone records, one from Europe and the other from China. For both datasets we compare the raw data networks with the corresponding Bonferroni networks and point out significant differences in the structures and in the basic network measures. We show evidence that the Bonferroni network provides a better proxy for the network of social interactions than the original one. Using the filtered networks, we investigated the statistics and temporal evolution of small directed 3-motifs and concluded that closed communication triads have a formation time scale, which is quite fast and typically intraday. We also find that open communication triads preferentially evolve into other open triads with a higher fraction of reciprocated calls. These stylized facts were observed for both datasets.

The Verrucomicrobia LexA-binding Motif: Insights into the Evolutionary Dynamics of the SOS Response

Directory of Open Access Journals (Sweden)

Ivan Erill

2016-07-01

Full Text Available The SOS response is the primary bacterial mechanism to address DNA damage, coordinating multiple cellular processes that include DNA repair, cell division and translesion synthesis. In contrast to other regulatory systems, the composition of the SOS genetic network and the binding motif of its transcriptional repressor, LexA, have been shown to vary greatly across bacterial clades, making it an ideal system to study the co-evolution of transcription factors and their regulons. Leveraging comparative genomics approaches and prior knowledge on the core SOS regulon, here we define the binding motif of the Verrucomicrobia, a recently described phylum of emerging interest due to its association with eukaryotic hosts. Site directed mutagenesis of the Verrucomicrobium spinosum recA promoter confirms that LexA binds a 14 bp palindromic motif with consensus sequence TGTTC-N4-GAACA. Computational analyses suggest that recognition of this novel motif is determined primarily by changes in base-contacting residues of the third alpha helix of the LexA helix-turn-helix DNA binding motif. In conjunction with comparative genomics analysis of the LexA regulon in the Verrucomicrobia phylum, electrophoretic shift assays reveal that LexA binds to operators in the promoter region of DNA repair genes and a mutagenesis cassette in this organism, and identify previously unreported components of the SOS response. The identification of tandem LexA-binding sites generating instances of other LexA-binding motifs in the lexA gene promoter of Verrucomicrobia species leads us to postulate a novel mechanism for LexA-binding motif evolution. This model, based on gene duplication, successfully addresses outstanding questions in the intricate co-evolution of the LexA protein, its binding motif and the regulatory network it controls.

The Verrucomicrobia LexA-Binding Motif: Insights into the Evolutionary Dynamics of the SOS Response.

Science.gov (United States)

Erill, Ivan; Campoy, Susana; Kılıç, Sefa; Barbé, Jordi

2016-01-01

The SOS response is the primary bacterial mechanism to address DNA damage, coordinating multiple cellular processes that include DNA repair, cell division, and translesion synthesis. In contrast to other regulatory systems, the composition of the SOS genetic network and the binding motif of its transcriptional repressor, LexA, have been shown to vary greatly across bacterial clades, making it an ideal system to study the co-evolution of transcription factors and their regulons. Leveraging comparative genomics approaches and prior knowledge on the core SOS regulon, here we define the binding motif of the Verrucomicrobia, a recently described phylum of emerging interest due to its association with eukaryotic hosts. Site directed mutagenesis of the Verrucomicrobium spinosum recA promoter confirms that LexA binds a 14 bp palindromic motif with consensus sequence TGTTC-N4-GAACA. Computational analyses suggest that recognition of this novel motif is determined primarily by changes in base-contacting residues of the third alpha helix of the LexA helix-turn-helix DNA binding motif. In conjunction with comparative genomics analysis of the LexA regulon in the Verrucomicrobia phylum, electrophoretic shift assays reveal that LexA binds to operators in the promoter region of DNA repair genes and a mutagenesis cassette in this organism, and identify previously unreported components of the SOS response. The identification of tandem LexA-binding sites generating instances of other LexA-binding motifs in the lexA gene promoter of Verrucomicrobia species leads us to postulate a novel mechanism for LexA-binding motif evolution. This model, based on gene duplication, successfully addresses outstanding questions in the intricate co-evolution of the LexA protein, its binding motif and the regulatory network it controls.

Motifs in triadic random graphs based on Steiner triple systems

Science.gov (United States)

Winkler, Marco; Reichardt, Jörg

2013-08-01

Conventionally, pairwise relationships between nodes are considered to be the fundamental building blocks of complex networks. However, over the last decade, the overabundance of certain subnetwork patterns, i.e., the so-called motifs, has attracted much attention. It has been hypothesized that these motifs, instead of links, serve as the building blocks of network structures. Although the relation between a network's topology and the general properties of the system, such as its function, its robustness against perturbations, or its efficiency in spreading information, is the central theme of network science, there is still a lack of sound generative models needed for testing the functional role of subgraph motifs. Our work aims to overcome this limitation. We employ the framework of exponential random graph models (ERGMs) to define models based on triadic substructures. The fact that only a small portion of triads can actually be set independently poses a challenge for the formulation of such models. To overcome this obstacle, we use Steiner triple systems (STSs). These are partitions of sets of nodes into pair-disjoint triads, which thus can be specified independently. Combining the concepts of ERGMs and STSs, we suggest generative models capable of generating ensembles of networks with nontrivial triadic Z-score profiles. Further, we discover inevitable correlations between the abundance of triad patterns, which occur solely for statistical reasons and need to be taken into account when discussing the functional implications of motif statistics. Moreover, we calculate the degree distributions of our triadic random graphs analytically.

Analysis of network motifs in cellular regulation: Structural similarities, input-output relations and signal integration.

Science.gov (United States)

Straube, Ronny

2017-12-01

Much of the complexity of regulatory networks derives from the necessity to integrate multiple signals and to avoid malfunction due to cross-talk or harmful perturbations. Hence, one may expect that the input-output behavior of larger networks is not necessarily more complex than that of smaller network motifs which suggests that both can, under certain conditions, be described by similar equations. In this review, we illustrate this approach by discussing the similarities that exist in the steady state descriptions of a simple bimolecular reaction, covalent modification cycles and bacterial two-component systems. Interestingly, in all three systems fundamental input-output characteristics such as thresholds, ultrasensitivity or concentration robustness are described by structurally similar equations. Depending on the system the meaning of the parameters can differ ranging from protein concentrations and affinity constants to complex parameter combinations which allows for a quantitative understanding of signal integration in these systems. We argue that this approach may also be extended to larger regulatory networks. Copyright © 2017 Elsevier B.V. All rights reserved.

Fast social-like learning of complex behaviors based on motor motifs

Science.gov (United States)

Calvo Tapia, Carlos; Tyukin, Ivan Y.; Makarov, Valeri A.

2018-05-01

Social learning is widely observed in many species. Less experienced agents copy successful behaviors exhibited by more experienced individuals. Nevertheless, the dynamical mechanisms behind this process remain largely unknown. Here we assume that a complex behavior can be decomposed into a sequence of n motor motifs. Then a neural network capable of activating motor motifs in a given sequence can drive an agent. To account for (n -1 )! possible sequences of motifs in a neural network, we employ the winnerless competition approach. We then consider a teacher-learner situation: one agent exhibits a complex movement, while another one aims at mimicking the teacher's behavior. Despite the huge variety of possible motif sequences we show that the learner, equipped with the provided learning model, can rewire "on the fly" its synaptic couplings in no more than (n -1 ) learning cycles and converge exponentially to the durations of the teacher's motifs. We validate the learning model on mobile robots. Experimental results show that the learner is indeed capable of copying the teacher's behavior composed of six motor motifs in a few learning cycles. The reported mechanism of learning is general and can be used for replicating different functions, including, for example, sound patterns or speech.

Noise transmission and delay-induced stochastic oscillations in biochemical network motifs

International Nuclear Information System (INIS)

Liu Sheng-Jun; Wang Qi; Liu Bo; Yan Shi-Wei; Sakata Fumihiko

2011-01-01

With the aid of stochastic delayed-feedback differential equations, we derive an analytic expression for the power spectra of reacting molecules included in a generic biological network motif that is incorporated with a feedback mechanism and time delays in gene regulation. We systematically analyse the effects of time delays, the feedback mechanism, and biological stochasticity on the power spectra. It has been clarified that the time delays together with the feedback mechanism can induce stochastic oscillations at the molecular level and invalidate the noise addition rule for a modular description of the noise propagator. Delay-induced stochastic resonance can be expected, which is related to the stability loss of the reaction systems and Hopf bifurcation occurring for solutions of the corresponding deterministic reaction equations. Through the analysis of the power spectrum, a new approach is proposed to estimate the oscillation period. (interdisciplinary physics and related areas of science and technology)

Characterizing Motif Dynamics of Electric Brain Activity Using Symbolic Analysis

Directory of Open Access Journals (Sweden)

Massimiliano Zanin

2014-10-01

Full Text Available Motifs are small recurring circuits of interactions which constitute the backbone of networked systems. Characterizing motif dynamics is therefore key to understanding the functioning of such systems. Here we propose a method to define and quantify the temporal variability and time scales of electroencephalogram (EEG motifs of resting brain activity. Given a triplet of EEG sensors, links between them are calculated by means of linear correlation; each pattern of links (i.e., each motif is then associated to a symbol, and its appearance frequency is analyzed by means of Shannon entropy. Our results show that each motif becomes observable with different coupling thresholds and evolves at its own time scale, with fronto-temporal sensors emerging at high thresholds and changing at fast time scales, and parietal ones at low thresholds and changing at slower rates. Finally, while motif dynamics differed across individuals, for each subject, it showed robustness across experimental conditions, indicating that it could represent an individual dynamical signature.

The identification of functional motifs in temporal gene expression analysis

Directory of Open Access Journals (Sweden)

Michael G. Surette

2005-01-01

Full Text Available The identification of transcription factor binding sites is essential to the understanding of the regulation of gene expression and the reconstruction of genetic regulatory networks. The in silico identification of cis-regulatory motifs is challenging due to sequence variability and lack of sufficient data to generate consensus motifs that are of quantitative or even qualitative predictive value. To determine functional motifs in gene expression, we propose a strategy to adopt false discovery rate (FDR and estimate motif effects to evaluate combinatorial analysis of motif candidates and temporal gene expression data. The method decreases the number of predicted motifs, which can then be confirmed by genetic analysis. To assess the method we used simulated motif/expression data to evaluate parameters. We applied this approach to experimental data for a group of iron responsive genes in Salmonella typhimurium 14028S. The method identified known and potentially new ferric-uptake regulator (Fur binding sites. In addition, we identified uncharacterized functional motif candidates that correlated with specific patterns of expression. A SAS code for the simulation and analysis gene expression data is available from the first author upon request.

Convergent evolution and mimicry of protein linear motifs in host-pathogen interactions.

Science.gov (United States)

Chemes, Lucía Beatriz; de Prat-Gay, Gonzalo; Sánchez, Ignacio Enrique

2015-06-01

Pathogen linear motif mimics are highly evolvable elements that facilitate rewiring of host protein interaction networks. Host linear motifs and pathogen mimics differ in sequence, leading to thermodynamic and structural differences in the resulting protein-protein interactions. Moreover, the functional output of a mimic depends on the motif and domain repertoire of the pathogen protein. Regulatory evolution mediated by linear motifs can be understood by measuring evolutionary rates, quantifying positive and negative selection and performing phylogenetic reconstructions of linear motif natural history. Convergent evolution of linear motif mimics is widespread among unrelated proteins from viral, prokaryotic and eukaryotic pathogens and can also take place within individual protein phylogenies. Statistics, biochemistry and laboratory models of infection link pathogen linear motifs to phenotypic traits such as tropism, virulence and oncogenicity. In vitro evolution experiments and analysis of natural sequences suggest that changes in linear motif composition underlie pathogen adaptation to a changing environment. Copyright © 2015 Elsevier Ltd. All rights reserved.

BayesMotif: de novo protein sorting motif discovery from impure datasets.

Science.gov (United States)

Hu, Jianjun; Zhang, Fan

2010-01-18

Protein sorting is the process that newly synthesized proteins are transported to their target locations within or outside of the cell. This process is precisely regulated by protein sorting signals in different forms. A major category of sorting signals are amino acid sub-sequences usually located at the N-terminals or C-terminals of protein sequences. Genome-wide experimental identification of protein sorting signals is extremely time-consuming and costly. Effective computational algorithms for de novo discovery of protein sorting signals is needed to improve the understanding of protein sorting mechanisms. We formulated the protein sorting motif discovery problem as a classification problem and proposed a Bayesian classifier based algorithm (BayesMotif) for de novo identification of a common type of protein sorting motifs in which a highly conserved anchor is present along with a less conserved motif regions. A false positive removal procedure is developed to iteratively remove sequences that are unlikely to contain true motifs so that the algorithm can identify motifs from impure input sequences. Experiments on both implanted motif datasets and real-world datasets showed that the enhanced BayesMotif algorithm can identify anchored sorting motifs from pure or impure protein sequence dataset. It also shows that the false positive removal procedure can help to identify true motifs even when there is only 20% of the input sequences containing true motif instances. We proposed BayesMotif, a novel Bayesian classification based algorithm for de novo discovery of a special category of anchored protein sorting motifs from impure datasets. Compared to conventional motif discovery algorithms such as MEME, our algorithm can find less-conserved motifs with short highly conserved anchors. Our algorithm also has the advantage of easy incorporation of additional meta-sequence features such as hydrophobicity or charge of the motifs which may help to overcome the limitations of

An experimental test of a fundamental food web motif.

Science.gov (United States)

Rip, Jason M K; McCann, Kevin S; Lynn, Denis H; Fawcett, Sonia

2010-06-07

Large-scale changes to the world's ecosystem are resulting in the deterioration of biostructure-the complex web of species interactions that make up ecological communities. A difficult, yet crucial task is to identify food web structures, or food web motifs, that are the building blocks of this baroque network of interactions. Once identified, these food web motifs can then be examined through experiments and theory to provide mechanistic explanations for how structure governs ecosystem stability. Here, we synthesize recent ecological research to show that generalist consumers coupling resources with different interaction strengths, is one such motif. This motif amazingly occurs across an enormous range of spatial scales, and so acts to distribute coupled weak and strong interactions throughout food webs. We then perform an experiment that illustrates the importance of this motif to ecological stability. We find that weak interactions coupled to strong interactions by generalist consumers dampen strong interaction strengths and increase community stability. This study takes a critical step by isolating a common food web motif and through clear, experimental manipulation, identifies the fundamental stabilizing consequences of this structure for ecological communities.

Identification of helix capping and {beta}-turn motifs from NMR chemical shifts

Energy Technology Data Exchange (ETDEWEB)

Shen Yang; Bax, Ad, E-mail: bax@nih.gov [National Institutes of Health, Laboratory of Chemical Physics, National Institute of Diabetes and Digestive and Kidney Diseases (United States)

2012-03-15

We present an empirical method for identification of distinct structural motifs in proteins on the basis of experimentally determined backbone and {sup 13}C{sup {beta}} chemical shifts. Elements identified include the N-terminal and C-terminal helix capping motifs and five types of {beta}-turns: I, II, I Prime , II Prime and VIII. Using a database of proteins of known structure, the NMR chemical shifts, together with the PDB-extracted amino acid preference of the helix capping and {beta}-turn motifs are used as input data for training an artificial neural network algorithm, which outputs the statistical probability of finding each motif at any given position in the protein. The trained neural networks, contained in the MICS (motif identification from chemical shifts) program, also provide a confidence level for each of their predictions, and values ranging from ca 0.7-0.9 for the Matthews correlation coefficient of its predictions far exceed those attainable by sequence analysis. MICS is anticipated to be useful both in the conventional NMR structure determination process and for enhancing on-going efforts to determine protein structures solely on the basis of chemical shift information, where it can aid in identifying protein database fragments suitable for use in building such structures.

Identification of helix capping and β-turn motifs from NMR chemical shifts

International Nuclear Information System (INIS)

Shen Yang; Bax, Ad

2012-01-01

We present an empirical method for identification of distinct structural motifs in proteins on the basis of experimentally determined backbone and 13 C β chemical shifts. Elements identified include the N-terminal and C-terminal helix capping motifs and five types of β-turns: I, II, I′, II′ and VIII. Using a database of proteins of known structure, the NMR chemical shifts, together with the PDB-extracted amino acid preference of the helix capping and β-turn motifs are used as input data for training an artificial neural network algorithm, which outputs the statistical probability of finding each motif at any given position in the protein. The trained neural networks, contained in the MICS (motif identification from chemical shifts) program, also provide a confidence level for each of their predictions, and values ranging from ca 0.7–0.9 for the Matthews correlation coefficient of its predictions far exceed those attainable by sequence analysis. MICS is anticipated to be useful both in the conventional NMR structure determination process and for enhancing on-going efforts to determine protein structures solely on the basis of chemical shift information, where it can aid in identifying protein database fragments suitable for use in building such structures.

Connectomic Insights into Topologically Centralized Network Edges and Relevant Motifs in the Human Brain

Directory of Open Access Journals (Sweden)

Mingrui eXia

2016-04-01

Full Text Available White matter (WM tracts serve as important material substrates for information transfer across brain regions. However, the topological roles of WM tracts in global brain communications and their underlying microstructural basis remain poorly understood. Here, we employed diffusion magnetic resonance imaging and graph-theoretical approaches to identify the pivotal WM connections in human whole-brain networks and further investigated their wiring substrates (including WM microstructural organization and physical consumption and topological contributions to the brain’s network backbone. We found that the pivotal WM connections with highly topological-edge centrality were primarily distributed in several long-range cortico-cortical connections (including the corpus callosum, cingulum and inferior fronto-occipital fasciculus and some projection tracts linking subcortical regions. These pivotal WM connections exhibited high levels of microstructural organization indicated by diffusion measures (the fractional anisotropy, the mean diffusivity and the axial diffusivity and greater physical consumption indicated by streamline lengths, and contributed significantly to the brain’s hubs and the rich-club structure. Network motif analysis further revealed their heavy participations in the organization of communication blocks, especially in routes involving inter-hemispheric heterotopic and extremely remote intra-hemispheric systems. Computational simulation models indicated the sharp decrease of global network integrity when attacking these highly centralized edges. Together, our results demonstrated high building-cost consumption and substantial communication capacity contributions for pivotal WM connections, which deepens our understanding of the topological mechanisms that govern the organization of human connectomes.

MotifMark: Finding regulatory motifs in DNA sequences.

Science.gov (United States)

Hassanzadeh, Hamid Reza; Kolhe, Pushkar; Isbell, Charles L; Wang, May D

2017-07-01

The interaction between proteins and DNA is a key driving force in a significant number of biological processes such as transcriptional regulation, repair, recombination, splicing, and DNA modification. The identification of DNA-binding sites and the specificity of target proteins in binding to these regions are two important steps in understanding the mechanisms of these biological activities. A number of high-throughput technologies have recently emerged that try to quantify the affinity between proteins and DNA motifs. Despite their success, these technologies have their own limitations and fall short in precise characterization of motifs, and as a result, require further downstream analysis to extract useful and interpretable information from a haystack of noisy and inaccurate data. Here we propose MotifMark, a new algorithm based on graph theory and machine learning, that can find binding sites on candidate probes and rank their specificity in regard to the underlying transcription factor. We developed a pipeline to analyze experimental data derived from compact universal protein binding microarrays and benchmarked it against two of the most accurate motif search methods. Our results indicate that MotifMark can be a viable alternative technique for prediction of motif from protein binding microarrays and possibly other related high-throughput techniques.

Dissemination Patterns and Associated Network Effects of Sentiments in Social Networks

DEFF Research Database (Denmark)

Hillmann, Robert; Trier, Matthias

2012-01-01

. The dissemination patterns analyzed in this study consist of network motifs based on triples of actors and the ties among them. These motifs are associated with common social network effects to derive meaningful insights about dissemination activities. The data basis includes several thousand social networks...... with textual messages classified according to embedded positive and negative sentiments. Based on this data, sub-networks are extracted and analyzed with a dynamic network motif analysis to determine dissemination patterns and associated network effects. Results indicate that the emergence of digital social...... networks exhibits a strong tendency towards reciprocity, followed by the dominance of hierarchy as an intermediate step leading to social clustering with hubs and transitivity effects for both positive and negative sentiments to the same extend. Sentiments embedded in exchanged textual messages do only...

Novel Strategy for Discrimination of Transcription Factor Binding Motifs Employing Mathematical Neural Network

Science.gov (United States)

Sugimoto, Asuka; Sumi, Takuya; Kang, Jiyoung; Tateno, Masaru

2017-07-01

Recognition in biological macromolecular systems, such as DNA-protein recognition, is one of the most crucial problems to solve toward understanding the fundamental mechanisms of various biological processes. Since specific base sequences of genome DNA are discriminated by proteins, such as transcription factors (TFs), finding TF binding motifs (TFBMs) in whole genome DNA sequences is currently a central issue in interdisciplinary biophysical and information sciences. In the present study, a novel strategy to create a discriminant function for discrimination of TFBMs by constituting mathematical neural networks (NNs) is proposed, together with a method to determine the boundary of signals (TFBMs) and noise in the NN-score (output) space. This analysis also leads to the mathematical limitation of discrimination in the recognition of features representing TFBMs, in an information geometrical manifold. Thus, the present strategy enables the identification of the whole space of TFBMs, right up to the noise boundary.

Mechanisms of zero-lag synchronization in cortical motifs.

Directory of Open Access Journals (Sweden)

Leonardo L Gollo

2014-04-01

Full Text Available Zero-lag synchronization between distant cortical areas has been observed in a diversity of experimental data sets and between many different regions of the brain. Several computational mechanisms have been proposed to account for such isochronous synchronization in the presence of long conduction delays: Of these, the phenomenon of "dynamical relaying"--a mechanism that relies on a specific network motif--has proven to be the most robust with respect to parameter mismatch and system noise. Surprisingly, despite a contrary belief in the community, the common driving motif is an unreliable means of establishing zero-lag synchrony. Although dynamical relaying has been validated in empirical and computational studies, the deeper dynamical mechanisms and comparison to dynamics on other motifs is lacking. By systematically comparing synchronization on a variety of small motifs, we establish that the presence of a single reciprocally connected pair--a "resonance pair"--plays a crucial role in disambiguating those motifs that foster zero-lag synchrony in the presence of conduction delays (such as dynamical relaying from those that do not (such as the common driving triad. Remarkably, minor structural changes to the common driving motif that incorporate a reciprocal pair recover robust zero-lag synchrony. The findings are observed in computational models of spiking neurons, populations of spiking neurons and neural mass models, and arise whether the oscillatory systems are periodic, chaotic, noise-free or driven by stochastic inputs. The influence of the resonance pair is also robust to parameter mismatch and asymmetrical time delays amongst the elements of the motif. We call this manner of facilitating zero-lag synchrony resonance-induced synchronization, outline the conditions for its occurrence, and propose that it may be a general mechanism to promote zero-lag synchrony in the brain.

Introduction of N-cadherin-binding motif to alginate hydrogels for controlled stem cell differentiation.

Science.gov (United States)

Lee, Jae Won; An, Hyoseok; Lee, Kuen Yong

2017-07-01

Control of stem cell fate and phenotype using biomimetic synthetic extracellular matrices (ECMs) is an important tissue engineering approach. Many studies have focused on improving cell-matrix interactions. However, proper control of cell-cell interactions using synthetic ECMs could be critical for tissue engineering, especially with undifferentiated stem cells. In this study, alginate hydrogels were modified with a peptide derived from the low-density lipoprotein receptor-related protein 5 (LRP5), which is known to bind to N-cadherin, as a cell-cell interaction motif. In vitro changes in the morphology and differentiation of mouse bone marrow stromal cells (D1 stem cells) cultured in LRP5-alginate hydrogels were investigated. LRP5-alginate gels successfully induced stem cell aggregation and enhanced chondrogenic differentiation of D1 stem cells, compared to RGD-alginate gels, at low cell density. This approach to tailoring synthetic biomimetic ECMs using cell-cell interaction motifs may be critical in tissue engineering approaches using stem cells. Copyright © 2017 Elsevier B.V. All rights reserved.

Automated classification of RNA 3D motifs and the RNA 3D Motif Atlas

Science.gov (United States)

Petrov, Anton I.; Zirbel, Craig L.; Leontis, Neocles B.

2013-01-01

The analysis of atomic-resolution RNA three-dimensional (3D) structures reveals that many internal and hairpin loops are modular, recurrent, and structured by conserved non-Watson–Crick base pairs. Structurally similar loops define RNA 3D motifs that are conserved in homologous RNA molecules, but can also occur at nonhomologous sites in diverse RNAs, and which often vary in sequence. To further our understanding of RNA motif structure and sequence variability and to provide a useful resource for structure modeling and prediction, we present a new method for automated classification of internal and hairpin loop RNA 3D motifs and a new online database called the RNA 3D Motif Atlas. To classify the motif instances, a representative set of internal and hairpin loops is automatically extracted from a nonredundant list of RNA-containing PDB files. Their structures are compared geometrically, all-against-all, using the FR3D program suite. The loops are clustered into motif groups, taking into account geometric similarity and structural annotations and making allowance for a variable number of bulged bases. The automated procedure that we have implemented identifies all hairpin and internal loop motifs previously described in the literature. All motif instances and motif groups are assigned unique and stable identifiers and are made available in the RNA 3D Motif Atlas (http://rna.bgsu.edu/motifs), which is automatically updated every four weeks. The RNA 3D Motif Atlas provides an interactive user interface for exploring motif diversity and tools for programmatic data access. PMID:23970545

The limits of de novo DNA motif discovery.

Directory of Open Access Journals (Sweden)

David Simcha

Full Text Available A major challenge in molecular biology is reverse-engineering the cis-regulatory logic that plays a major role in the control of gene expression. This program includes searching through DNA sequences to identify "motifs" that serve as the binding sites for transcription factors or, more generally, are predictive of gene expression across cellular conditions. Several approaches have been proposed for de novo motif discovery-searching sequences without prior knowledge of binding sites or nucleotide patterns. However, unbiased validation is not straightforward. We consider two approaches to unbiased validation of discovered motifs: testing the statistical significance of a motif using a DNA "background" sequence model to represent the null hypothesis and measuring performance in predicting membership in gene clusters. We demonstrate that the background models typically used are "too null," resulting in overly optimistic assessments of significance, and argue that performance in predicting TF binding or expression patterns from DNA motifs should be assessed by held-out data, as in predictive learning. Applying this criterion to common motif discovery methods resulted in universally poor performance, although there is a marked improvement when motifs are statistically significant against real background sequences. Moreover, on synthetic data where "ground truth" is known, discriminative performance of all algorithms is far below the theoretical upper bound, with pronounced "over-fitting" in training. A key conclusion from this work is that the failure of de novo discovery approaches to accurately identify motifs is basically due to statistical intractability resulting from the fixed size of co-regulated gene clusters, and thus such failures do not necessarily provide evidence that unfound motifs are not active biologically. Consequently, the use of prior knowledge to enhance motif discovery is not just advantageous but necessary. An implementation of

A survey of motif finding Web tools for detecting binding site motifs in ChIP-Seq data.

Science.gov (United States)

Tran, Ngoc Tam L; Huang, Chun-Hsi

2014-02-20

ChIP-Seq (chromatin immunoprecipitation sequencing) has provided the advantage for finding motifs as ChIP-Seq experiments narrow down the motif finding to binding site locations. Recent motif finding tools facilitate the motif detection by providing user-friendly Web interface. In this work, we reviewed nine motif finding Web tools that are capable for detecting binding site motifs in ChIP-Seq data. We showed each motif finding Web tool has its own advantages for detecting motifs that other tools may not discover. We recommended the users to use multiple motif finding Web tools that implement different algorithms for obtaining significant motifs, overlapping resemble motifs, and non-overlapping motifs. Finally, we provided our suggestions for future development of motif finding Web tool that better assists researchers for finding motifs in ChIP-Seq data.

Motif signatures of transcribed enhancers

KAUST Repository

Kleftogiannis, Dimitrios

2017-09-14

In mammalian cells, transcribed enhancers (TrEn) play important roles in the initiation of gene expression and maintenance of gene expression levels in spatiotemporal manner. One of the most challenging questions in biology today is how the genomic characteristics of enhancers relate to enhancer activities. This is particularly critical, as several recent studies have linked enhancer sequence motifs to specific functional roles. To date, only a limited number of enhancer sequence characteristics have been investigated, leaving space for exploring the enhancers genomic code in a more systematic way. To address this problem, we developed a novel computational method, TELS, aimed at identifying predictive cell type/tissue specific motif signatures. We used TELS to compile a comprehensive catalog of motif signatures for all known TrEn identified by the FANTOM5 consortium across 112 human primary cells and tissues. Our results confirm that distinct cell type/tissue specific motif signatures characterize TrEn. These signatures allow discriminating successfully a) TrEn from random controls, proxy of non-enhancer activity, and b) cell type/tissue specific TrEn from enhancers expressed and transcribed in different cell types/tissues. TELS codes and datasets are publicly available at http://www.cbrc.kaust.edu.sa/TELS.

DMINDA: an integrated web server for DNA motif identification and analyses.

Science.gov (United States)

Ma, Qin; Zhang, Hanyuan; Mao, Xizeng; Zhou, Chuan; Liu, Bingqiang; Chen, Xin; Xu, Ying

2014-07-01

DMINDA (DNA motif identification and analyses) is an integrated web server for DNA motif identification and analyses, which is accessible at http://csbl.bmb.uga.edu/DMINDA/. This web site is freely available to all users and there is no login requirement. This server provides a suite of cis-regulatory motif analysis functions on DNA sequences, which are important to elucidation of the mechanisms of transcriptional regulation: (i) de novo motif finding for a given set of promoter sequences along with statistical scores for the predicted motifs derived based on information extracted from a control set, (ii) scanning motif instances of a query motif in provided genomic sequences, (iii) motif comparison and clustering of identified motifs, and (iv) co-occurrence analyses of query motifs in given promoter sequences. The server is powered by a backend computer cluster with over 150 computing nodes, and is particularly useful for motif prediction and analyses in prokaryotic genomes. We believe that DMINDA, as a new and comprehensive web server for cis-regulatory motif finding and analyses, will benefit the genomic research community in general and prokaryotic genome researchers in particular. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.

Space-related pharma-motifs for fast search of protein binding motifs and polypharmacological targets.

Science.gov (United States)

Chiu, Yi-Yuan; Lin, Chun-Yu; Lin, Chih-Ta; Hsu, Kai-Cheng; Chang, Li-Zen; Yang, Jinn-Moon

2012-01-01

To discover a compound inhibiting multiple proteins (i.e. polypharmacological targets) is a new paradigm for the complex diseases (e.g. cancers and diabetes). In general, the polypharmacological proteins often share similar local binding environments and motifs. As the exponential growth of the number of protein structures, to find the similar structural binding motifs (pharma-motifs) is an emergency task for drug discovery (e.g. side effects and new uses for old drugs) and protein functions. We have developed a Space-Related Pharmamotifs (called SRPmotif) method to recognize the binding motifs by searching against protein structure database. SRPmotif is able to recognize conserved binding environments containing spatially discontinuous pharma-motifs which are often short conserved peptides with specific physico-chemical properties for protein functions. Among 356 pharma-motifs, 56.5% interacting residues are highly conserved. Experimental results indicate that 81.1% and 92.7% polypharmacological targets of each protein-ligand complex are annotated with same biological process (BP) and molecular function (MF) terms, respectively, based on Gene Ontology (GO). Our experimental results show that the identified pharma-motifs often consist of key residues in functional (active) sites and play the key roles for protein functions. The SRPmotif is available at http://gemdock.life.nctu.edu.tw/SRP/. SRPmotif is able to identify similar pharma-interfaces and pharma-motifs sharing similar binding environments for polypharmacological targets by rapidly searching against the protein structure database. Pharma-motifs describe the conservations of binding environments for drug discovery and protein functions. Additionally, these pharma-motifs provide the clues for discovering new sequence-based motifs to predict protein functions from protein sequence databases. We believe that SRPmotif is useful for elucidating protein functions and drug discovery.

Systematic comparison of the response properties of protein and RNA mediated gene regulatory motifs.

Science.gov (United States)

Iyengar, Bharat Ravi; Pillai, Beena; Venkatesh, K V; Gadgil, Chetan J

2017-05-30

We present a framework enabling the dissection of the effects of motif structure (feedback or feedforward), the nature of the controller (RNA or protein), and the regulation mode (transcriptional, post-transcriptional or translational) on the response to a step change in the input. We have used a common model framework for gene expression where both motif structures have an activating input and repressing regulator, with the same set of parameters, to enable a comparison of the responses. We studied the global sensitivity of the system properties, such as steady-state gain, overshoot, peak time, and peak duration, to parameters. We find that, in all motifs, overshoot correlated negatively whereas peak duration varied concavely with peak time. Differences in the other system properties were found to be mainly dependent on the nature of the controller rather than the motif structure. Protein mediated motifs showed a higher degree of adaptation i.e. a tendency to return to baseline levels; in particular, feedforward motifs exhibited perfect adaptation. RNA mediated motifs had a mild regulatory effect; they also exhibited a lower peaking tendency and mean overshoot. Protein mediated feedforward motifs showed higher overshoot and lower peak time compared to the corresponding feedback motifs.

Dragon polya spotter: Predictor of poly(A) motifs within human genomic DNA sequences

KAUST Repository

Kalkatawi, Manal M.

2011-11-15

Motivation: Recognition of poly(A) signals in mRNA is relatively straightforward due to the presence of easily recognizable polyadenylic acid tail. However, the task of identifying poly(A) motifs in the primary genomic DNA sequence that correspond to poly(A) signals in mRNA is a far more challenging problem. Recognition of poly(A) signals is important for better gene annotation and understanding of the gene regulation mechanisms. In this work, we present one such poly(A) motif prediction method based on properties of human genomic DNA sequence surrounding a poly(A) motif. These properties include thermodynamic, physico-chemical and statistical characteristics. For predictions, we developed Artificial Neural Network and Random Forest models. These models are trained to recognize 12 most common poly(A) motifs in human DNA. Our predictors are available as a free web-based tool accessible at http://cbrc.kaust.edu.sa/dps. Compared with other reported predictors, our models achieve higher sensitivity and specificity and furthermore provide a consistent level of accuracy for 12 poly(A) motif variants. The Author(s) 2011. Published by Oxford University Press. All rights reserved.

Conserved binding of GCAC motifs by MEC-8, couch potato, and the RBPMS protein family

Science.gov (United States)

Soufari, Heddy

2017-01-01

Precise regulation of mRNA processing, translation, localization, and stability relies on specific interactions with RNA-binding proteins whose biological function and target preference are dictated by their preferred RNA motifs. The RBPMS family of RNA-binding proteins is defined by a conserved RNA recognition motif (RRM) domain found in metazoan RBPMS/Hermes and RBPMS2, Drosophila couch potato, and MEC-8 from Caenorhabditis elegans. In order to determine the parameters of RNA sequence recognition by the RBPMS family, we have first used the N-terminal domain from MEC-8 in binding assays and have demonstrated a preference for two GCAC motifs optimally separated by >6 nucleotides (nt). We have also determined the crystal structure of the dimeric N-terminal RRM domain from MEC-8 in the unbound form, and in complex with an oligonucleotide harboring two copies of the optimal GCAC motif. The atomic details reveal the molecular network that provides specificity to all four bases in the motif, including multiple hydrogen bonds to the initial guanine. Further studies with human RBPMS, as well as Drosophila couch potato, confirm a general preference for this double GCAC motif by other members of the protein family and the presence of this motif in known targets. PMID:28003515

Automatic annotation of protein motif function with Gene Ontology terms

Directory of Open Access Journals (Sweden)

Gopalakrishnan Vanathi

2004-09-01

Full Text Available Abstract Background Conserved protein sequence motifs are short stretches of amino acid sequence patterns that potentially encode the function of proteins. Several sequence pattern searching algorithms and programs exist foridentifying candidate protein motifs at the whole genome level. However, amuch needed and importanttask is to determine the functions of the newly identified protein motifs. The Gene Ontology (GO project is an endeavor to annotate the function of genes or protein sequences with terms from a dynamic, controlled vocabulary and these annotations serve well as a knowledge base. Results This paperpresents methods to mine the GO knowledge base and use the association between the GO terms assigned to a sequence and the motifs matched by the same sequence as evidence for predicting the functions of novel protein motifs automatically. The task of assigning GO terms to protein motifsis viewed as both a binary classification and information retrieval problem, where PROSITE motifs are used as samples for mode training and functional prediction. The mutual information of a motif and aGO term association isfound to be a very useful feature. We take advantageof the known motifs to train a logistic regression classifier, which allows us to combine mutual information with other frequency-based features and obtain a probability of correctassociation. The trained logistic regression model has intuitively meaningful and logically plausible parameter values, and performs very well empirically according to our evaluation criteria. Conclusions In this research, different methods for automatic annotation of protein motifs have been investigated. Empirical result demonstrated that the methods have a great potential for detecting and augmenting information about thefunctions of newly discovered candidate protein motifs.

A novel k-mer set memory (KSM) motif representation improves regulatory variant prediction.

Science.gov (United States)

Guo, Yuchun; Tian, Kevin; Zeng, Haoyang; Guo, Xiaoyun; Gifford, David Kenneth

2018-04-13

The representation and discovery of transcription factor (TF) sequence binding specificities is critical for understanding gene regulatory networks and interpreting the impact of disease-associated noncoding genetic variants. We present a novel TF binding motif representation, the k -mer set memory (KSM), which consists of a set of aligned k -mers that are overrepresented at TF binding sites, and a new method called KMAC for de novo discovery of KSMs. We find that KSMs more accurately predict in vivo binding sites than position weight matrix (PWM) models and other more complex motif models across a large set of ChIP-seq experiments. Furthermore, KSMs outperform PWMs and more complex motif models in predicting in vitro binding sites. KMAC also identifies correct motifs in more experiments than five state-of-the-art motif discovery methods. In addition, KSM-derived features outperform both PWM and deep learning model derived sequence features in predicting differential regulatory activities of expression quantitative trait loci (eQTL) alleles. Finally, we have applied KMAC to 1600 ENCODE TF ChIP-seq data sets and created a public resource of KSM and PWM motifs. We expect that the KSM representation and KMAC method will be valuable in characterizing TF binding specificities and in interpreting the effects of noncoding genetic variations. © 2018 Guo et al.; Published by Cold Spring Harbor Laboratory Press.

The MHC motif viewer: a visualization tool for MHC binding motifs

DEFF Research Database (Denmark)

Rapin, Nicolas; Hoof, Ilka; Lund, Ole

2010-01-01

is hampered by the lack of tools for browsing and comparing specificity of these molecules. We have developed a Web server, MHC Motif Viewer, which allows the display of the binding motif for MHC class I proteins for human, chimpanzee, rhesus monkey, mouse, and swine, as well as HLA-DR protein sequences...

Intelligent networked teleoperation control

CERN Document Server

Li, Zhijun; Su, Chun-Yi

2015-01-01

This book describes a unified framework for networked teleoperation systems involving multiple research fields: networked control systems for linear and nonlinear forms, bilateral teleoperation, trilateral teleoperation, multilateral teleoperation and cooperative teleoperation. It closely examines networked control as a field at the intersection of systems & control and robotics and presents a number of experimental case studies on testbeds for robotic systems, including networked haptic devices, robotic network systems and sensor network systems. The concepts and results outlined are easy to understand, even for readers fairly new to the subject. As such, the book offers a valuable reference work for researchers and engineers in the fields of systems & control and robotics.

Kopi dan Kakao dalam Kreasi Motif Batik Khas Jember

Directory of Open Access Journals (Sweden)

Irfa'ina Rohana Salma

2015-06-01

Full Text Available ABSTRAK Batik Jember selama ini identik dengan motif daun tembakau. Visualisasi daun tembakau dalam motif Batik Jember cukup lemah, yaitu kurang berkarakter karena motif yang muncul adalah seperti gambar daun pada umumnya. Oleh karena itu perlu diciptakan desain motif batik khas Jember yang sumber inspirasinya digali dari kekayaan alam lainnya dari Jember yang mempunyai bentuk spesifik dan karakteristik sehingga identitas motif bisa didapatkan dengan lebih kuat. Hasil alam khas Jember tersebut adalah kopi dan kakao. Tujuan penciptaan seni ini adalah untuk menghasilkan motif batik  baru yang mempunyai ciri khas Jember. Metode yang digunakan yaitu pengumpulan data, pengamatan mendalam terhadap objek penciptaan, pengkajian sumber inspirasi, pembuatan desain motif, dan perwujudan menjadi batik. Dari penciptaan seni ini berhasil dikreasikan 6 (enam motif batik yaitu: (1 Motif Uwoh Kopi; (2 Motif Godong Kopi;  (3 Motif Ceplok Kakao; (4 Motif Kakao Raja; (5 Motif Kakao Biru; dan (6 Motif Wiji Mukti. Berdasarkan hasil penilaian “Selera Estetika” diketahui bahwa motif yang paling banyak disukai adalah Motif Uwoh Kopi dan Motif Kakao Raja. Kata kunci: Motif Woh Kopi, Motif Godong Kopi, Motif Ceplok Kakao, Motif Kakao Raja, Motif Kakao Biru, Motif Wiji Mukti ABSTRACTBatik Jember is synonymous with tobacco leaf motif. Tobacco leaf shape is quite weak in the visual appearance characterized as that motif emerges like a picture of leaves in general. Therefore, it is necessary to create a distinctive design motif extracted from other natural resources of Jember that have specific shapes and characteristics that can be obtained as the stronger motif identity. The typical natural resources from Jember are coffee and cocoa. The purpose of the creation of this art is to produce the unique, creative and innovative batik and have specific characteristics of Jember. The method used are data collection, observation of the object, reviewing inspiration sources

iELM—a web server to explore short linear motif-mediated interactions

Science.gov (United States)

Weatheritt, Robert J.; Jehl, Peter; Dinkel, Holger; Gibson, Toby J.

2012-01-01

The recent expansion in our knowledge of protein–protein interactions (PPIs) has allowed the annotation and prediction of hundreds of thousands of interactions. However, the function of many of these interactions remains elusive. The interactions of Eukaryotic Linear Motif (iELM) web server provides a resource for predicting the function and positional interface for a subset of interactions mediated by short linear motifs (SLiMs). The iELM prediction algorithm is based on the annotated SLiM classes from the Eukaryotic Linear Motif (ELM) resource and allows users to explore both annotated and user-generated PPI networks for SLiM-mediated interactions. By incorporating the annotated information from the ELM resource, iELM provides functional details of PPIs. This can be used in proteomic analysis, for example, to infer whether an interaction promotes complex formation or degradation. Furthermore, details of the molecular interface of the SLiM-mediated interactions are also predicted. This information is displayed in a fully searchable table, as well as graphically with the modular architecture of the participating proteins extracted from the UniProt and Phospho.ELM resources. A network figure is also presented to aid the interpretation of results. The iELM server supports single protein queries as well as large-scale proteomic submissions and is freely available at http://i.elm.eu.org. PMID:22638578

A Network Traffic Control Enhancement Approach over Bluetooth Networks

DEFF Research Database (Denmark)

Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

2003-01-01

This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated solu...... as capacity limitations and flow requirements in the network. Simulation shows that the performance of Bluetooth networks could be improved by applying the adaptive distributed network traffic control scheme...... solution of the stated optimization problem that satisfies quality of service requirements and topologically induced constraints in Bluetooth networks, such as link capacity and node resource limitations. The proposed scheme is decentralized and complies with frequent changes of topology as well......This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated...

Ménage à trois: the complex relationships between mitogen-activated protein kinases, WRKY transcription factors, and VQ-motif-containing proteins.

Science.gov (United States)

Weyhe, Martin; Eschen-Lippold, Lennart; Pecher, Pascal; Scheel, Dierk; Lee, Justin

2014-01-01

Out of the 34 members of the VQ-motif-containing protein (VQP) family, 10 are phosphorylated by the mitogen-activated protein kinases (MAPKs), MPK3 and MPK6. Most of these MPK3/6-targeted VQPs (MVQs) interacted with specific sub-groups of WRKY transcription factors in a VQ-motif-dependent manner. In some cases, the MAPK appears to phosphorylate either the MVQ or the WRKY, while in other cases, both proteins have been reported to act as MAPK substrates. We propose a network of dynamic interactions between members from the MAPK, MVQ and WRKY families - either as binary or as tripartite interactions. The compositions of the WRKY-MVQ transcriptional protein complexes may change - for instance, through MPK3/6-mediated modulation of protein stability - and therefore control defense gene transcription.

Identifying potential survival strategies of HIV-1 through virus-host protein interaction networks

Directory of Open Access Journals (Sweden)

Boucher Charles AB

2010-07-01

Full Text Available Abstract Background The National Institute of Allergy and Infectious Diseases has launched the HIV-1 Human Protein Interaction Database in an effort to catalogue all published interactions between HIV-1 and human proteins. In order to systematically investigate these interactions functionally and dynamically, we have constructed an HIV-1 human protein interaction network. This network was analyzed for important proteins and processes that are specific for the HIV life-cycle. In order to expose viral strategies, network motif analysis was carried out showing reoccurring patterns in virus-host dynamics. Results Our analyses show that human proteins interacting with HIV form a densely connected and central sub-network within the total human protein interaction network. The evaluation of this sub-network for connectivity and centrality resulted in a set of proteins essential for the HIV life-cycle. Remarkably, we were able to associate proteins involved in RNA polymerase II transcription with hubs and proteasome formation with bottlenecks. Inferred network motifs show significant over-representation of positive and negative feedback patterns between virus and host. Strikingly, such patterns have never been reported in combined virus-host systems. Conclusions HIV infection results in a reprioritization of cellular processes reflected by an increase in the relative importance of transcriptional machinery and proteasome formation. We conclude that during the evolution of HIV, some patterns of interaction have been selected for resulting in a system where virus proteins preferably interact with central human proteins for direct control and with proteasomal proteins for indirect control over the cellular processes. Finally, the patterns described by network motifs illustrate how virus and host interact with one another.

MSDmotif: exploring protein sites and motifs

Directory of Open Access Journals (Sweden)

Henrick Kim

2008-07-01

Full Text Available Abstract Background Protein structures have conserved features – motifs, which have a sufficient influence on the protein function. These motifs can be found in sequence as well as in 3D space. Understanding of these fragments is essential for 3D structure prediction, modelling and drug-design. The Protein Data Bank (PDB is the source of this information however present search tools have limited 3D options to integrate protein sequence with its 3D structure. Results We describe here a web application for querying the PDB for ligands, binding sites, small 3D structural and sequence motifs and the underlying database. Novel algorithms for chemical fragments, 3D motifs, ϕ/ψ sequences, super-secondary structure motifs and for small 3D structural motif associations searches are incorporated. The interface provides functionality for visualization, search criteria creation, sequence and 3D multiple alignment options. MSDmotif is an integrated system where a results page is also a search form. A set of motif statistics is available for analysis. This set includes molecule and motif binding statistics, distribution of motif sequences, occurrence of an amino-acid within a motif, correlation of amino-acids side-chain charges within a motif and Ramachandran plots for each residue. The binding statistics are presented in association with properties that include a ligand fragment library. Access is also provided through the distributed Annotation System (DAS protocol. An additional entry point facilitates XML requests with XML responses. Conclusion MSDmotif is unique by combining chemical, sequence and 3D data in a single search engine with a range of search and visualisation options. It provides multiple views of data found in the PDB archive for exploring protein structures.

SLiMScape 3.x: a Cytoscape 3 app for discovery of Short Linear Motifs in protein interaction networks [version 1; referees: 2 approved

Directory of Open Access Journals (Sweden)

Emily Olorin

2015-08-01

Full Text Available Short linear motifs (SLiMs are small protein sequence patterns that mediate a large number of critical protein-protein interactions, involved in processes such as complex formation, signal transduction, localisation and stabilisation. SLiMs show rapid evolutionary dynamics and are frequently the targets of molecular mimicry by pathogens. Identifying enriched sequence patterns due to convergent evolution in non-homologous proteins has proven to be a successful strategy for computational SLiM prediction. Tools of the SLiMSuite package use this strategy, using a statistical model to identify SLiM enrichment based on the evolutionary relationships, amino acid composition and predicted disorder of the input proteins. The quality of input data is critical for successful SLiM prediction. Cytoscape provides a user-friendly, interactive environment to explore interaction networks and select proteins based on common features, such as shared interaction partners. SLiMScape embeds tools of the SLiMSuite package for de novo SLiM discovery (SLiMFinder and QSLiMFinder and identifying occurrences/enrichment of known SLiMs (SLiMProb within this interactive framework. SLiMScape makes it easier to (1 generate high quality hypothesis-driven datasets for these tools, and (2 visualise predicted SLiM occurrences within the context of the network. To generate new predictions, users can select nodes from a protein network or provide a set of Uniprot identifiers. SLiMProb also requires additional query motif input. Jobs are then run remotely on the SLiMSuite server (http://rest.slimsuite.unsw.edu.au for subsequent retrieval and visualisation. SLiMScape can also be used to retrieve and visualise results from jobs run directly on the server. SLiMScape and SLiMSuite are open source and freely available via GitHub under GNU licenses.

Maximum entropy networks are more controllable than preferential attachment networks

International Nuclear Information System (INIS)

Hou, Lvlin; Small, Michael; Lao, Songyang

2014-01-01

A maximum entropy (ME) method to generate typical scale-free networks has been recently introduced. We investigate the controllability of ME networks and Barabási–Albert preferential attachment networks. Our experimental results show that ME networks are significantly more easily controlled than BA networks of the same size and the same degree distribution. Moreover, the control profiles are used to provide insight into control properties of both classes of network. We identify and classify the driver nodes and analyze the connectivity of their neighbors. We find that driver nodes in ME networks have fewer mutual neighbors and that their neighbors have lower average degree. We conclude that the properties of the neighbors of driver node sensitively affect the network controllability. Hence, subtle and important structural differences exist between BA networks and typical scale-free networks of the same degree distribution. - Highlights: • The controllability of maximum entropy (ME) and Barabási–Albert (BA) networks is investigated. • ME networks are significantly more easily controlled than BA networks of the same degree distribution. • The properties of the neighbors of driver node sensitively affect the network controllability. • Subtle and important structural differences exist between BA networks and typical scale-free networks

Brain network clustering with information flow motifs

NARCIS (Netherlands)

Märtens, M.; Meier, J.M.; Hillebrand, Arjan; Tewarie, Prejaas; Van Mieghem, P.F.A.

2017-01-01

Recent work has revealed frequency-dependent global patterns of information flow by a network analysis of magnetoencephalography data of the human brain. However, it is unknown which properties on a small subgraph-scale of those functional brain networks are dominant at different frequencies bands.

Genome-wide conserved consensus transcription factor binding motifs are hyper-methylated

Directory of Open Access Journals (Sweden)

Down Thomas A

2010-09-01

Full Text Available Abstract Background DNA methylation can regulate gene expression by modulating the interaction between DNA and proteins or protein complexes. Conserved consensus motifs exist across the human genome ("predicted transcription factor binding sites": "predicted TFBS" but the large majority of these are proven by chromatin immunoprecipitation and high throughput sequencing (ChIP-seq not to be biological transcription factor binding sites ("empirical TFBS". We hypothesize that DNA methylation at conserved consensus motifs prevents promiscuous or disorderly transcription factor binding. Results Using genome-wide methylation maps of the human heart and sperm, we found that all conserved consensus motifs as well as the subset of those that reside outside CpG islands have an aggregate profile of hyper-methylation. In contrast, empirical TFBS with conserved consensus motifs have a profile of hypo-methylation. 40% of empirical TFBS with conserved consensus motifs resided in CpG islands whereas only 7% of all conserved consensus motifs were in CpG islands. Finally we further identified a minority subset of TF whose profiles are either hypo-methylated or neutral at their respective conserved consensus motifs implicating that these TF may be responsible for establishing or maintaining an un-methylated DNA state, or whose binding is not regulated by DNA methylation. Conclusions Our analysis supports the hypothesis that at least for a subset of TF, empirical binding to conserved consensus motifs genome-wide may be controlled by DNA methylation.

Statistical tests to compare motif count exceptionalities

Directory of Open Access Journals (Sweden)

Vandewalle Vincent

2007-03-01

Full Text Available Abstract Background Finding over- or under-represented motifs in biological sequences is now a common task in genomics. Thanks to p-value calculation for motif counts, exceptional motifs are identified and represent candidate functional motifs. The present work addresses the related question of comparing the exceptionality of one motif in two different sequences. Just comparing the motif count p-values in each sequence is indeed not sufficient to decide if this motif is significantly more exceptional in one sequence compared to the other one. A statistical test is required. Results We develop and analyze two statistical tests, an exact binomial one and an asymptotic likelihood ratio test, to decide whether the exceptionality of a given motif is equivalent or significantly different in two sequences of interest. For that purpose, motif occurrences are modeled by Poisson processes, with a special care for overlapping motifs. Both tests can take the sequence compositions into account. As an illustration, we compare the octamer exceptionalities in the Escherichia coli K-12 backbone versus variable strain-specific loops. Conclusion The exact binomial test is particularly adapted for small counts. For large counts, we advise to use the likelihood ratio test which is asymptotic but strongly correlated with the exact binomial test and very simple to use.

Control and Optimization of Network in Networked Control System

Directory of Open Access Journals (Sweden)

Wang Zhiwen

2014-01-01

Full Text Available In order to avoid quality of performance (QoP degradation resulting from quality of service (QoS, the solution to network congestion from the point of control theory, which marks departure of our results from the existing methods, is proposed in this paper. The congestion and bandwidth are regarded as state and control variables, respectively; then, the linear time-invariant (LTI model between congestion state and bandwidth of network is established. Consequently, linear quadratic method is used to eliminate the network congestion by allocating bandwidth dynamically. At last, numerical simulation results are given to illustrate the effectiveness of this modeling approach.

Proxy SDN Controller for Wireless Networks

Directory of Open Access Journals (Sweden)

Won-Suk Kim

2016-01-01

Full Text Available Management of wireless networks as well as wired networks by using software-defined networking (SDN has been highlighted continually. However, control features of a wireless network differ from those of a wired network in several aspects. In this study, we identify the various inefficient points when controlling and managing wireless networks by using SDN and propose SDN-based control architecture called Proxcon to resolve these problems. Proxcon introduces the concept of a proxy SDN controller (PSC for the wireless network control, and the PSC entrusted with the role of a main controller performs control operations and provides the latest network state for a network administrator. To address the control inefficiency, Proxcon supports offloaded SDN operations for controlling wireless networks by utilizing the PSC, such as local control by each PSC, hybrid control utilizing the PSC and the main controller, and locally cooperative control utilizing the PSCs. The proposed architecture and the newly supported control operations can enhance scalability and response time when the logically centralized control plane responds to the various wireless network events. Through actual experiments, we verified that the proposed architecture could address the various control issues such as scalability, response time, and control overhead.

Controllability of Surface Water Networks

Science.gov (United States)

Riasi, M. Sadegh; Yeghiazarian, Lilit

2017-12-01

To sustainably manage water resources, we must understand how to control complex networked systems. In this paper, we study surface water networks from the perspective of structural controllability, a concept that integrates classical control theory with graph-theoretic formalism. We present structural controllability theory and compute four metrics: full and target controllability, control centrality and control profile (FTCP) that collectively determine the structural boundaries of the system's control space. We use these metrics to answer the following questions: How does the structure of a surface water network affect its controllability? How to efficiently control a preselected subset of the network? Which nodes have the highest control power? What types of topological structures dominate controllability? Finally, we demonstrate the structural controllability theory in the analysis of a wide range of surface water networks, such as tributary, deltaic, and braided river systems.

Assessing local structure motifs using order parameters for motif recognition, interstitial identification, and diffusion path characterization

Science.gov (United States)

Zimmermann, Nils E. R.; Horton, Matthew K.; Jain, Anubhav; Haranczyk, Maciej

2017-11-01

Structure-property relationships form the basis of many design rules in materials science, including synthesizability and long-term stability of catalysts, control of electrical and optoelectronic behavior in semiconductors as well as the capacity of and transport properties in cathode materials for rechargeable batteries. The immediate atomic environments (i.e., the first coordination shells) of a few atomic sites are often a key factor in achieving a desired property. Some of the most frequently encountered coordination patterns are tetrahedra, octahedra, body and face-centered cubic as well as hexagonal closed packed-like environments. Here, we showcase the usefulness of local order parameters to identify these basic structural motifs in inorganic solid materials by developing classification criteria. We introduce a systematic testing framework, the Einstein crystal test rig, that probes the response of order parameters to distortions in perfect motifs to validate our approach. Subsequently, we highlight three important application cases. First, we map basic crystal structure information of a large materials database in an intuitive manner by screening the Materials Project (MP) database (61,422 compounds) for element-specific motif distributions. Second, we use the structure-motif recognition capabilities to automatically find interstitials in metals, semiconductor, and insulator materials. Our Interstitialcy Finding Tool (InFiT) facilitates high-throughput screenings of defect properties. Third, the order parameters are reliable and compact quantitative structure descriptors for characterizing diffusion hops of intercalants as our example of magnesium in MnO2-spinel indicates. Finally, the tools developed in our work are readily and freely available as software implementations in the pymatgen library, and we expect them to be further applied to machine-learning approaches for emerging applications in materials science.

I-motif DNA structures are formed in the nuclei of human cells

Science.gov (United States)

Zeraati, Mahdi; Langley, David B.; Schofield, Peter; Moye, Aaron L.; Rouet, Romain; Hughes, William E.; Bryan, Tracy M.; Dinger, Marcel E.; Christ, Daniel

2018-06-01

Human genome function is underpinned by the primary storage of genetic information in canonical B-form DNA, with a second layer of DNA structure providing regulatory control. I-motif structures are thought to form in cytosine-rich regions of the genome and to have regulatory functions; however, in vivo evidence for the existence of such structures has so far remained elusive. Here we report the generation and characterization of an antibody fragment (iMab) that recognizes i-motif structures with high selectivity and affinity, enabling the detection of i-motifs in the nuclei of human cells. We demonstrate that the in vivo formation of such structures is cell-cycle and pH dependent. Furthermore, we provide evidence that i-motif structures are formed in regulatory regions of the human genome, including promoters and telomeric regions. Our results support the notion that i-motif structures provide key regulatory roles in the genome.

The APS control system network

International Nuclear Information System (INIS)

Sidorowicz, K.V.; McDowell, W.P.

1995-01-01

The APS accelerator control system is a distributed system consisting of operator interfaces, a network, and computer-controlled interfaces to hardware. This implementation of a control system has come to be called the open-quotes Standard Model.close quotes The operator interface is a UNDC-based workstation with an X-windows graphical user interface. The workstation may be located at any point on the facility network and maintain full functionality. The function of the network is to provide a generalized communication path between the host computers, operator workstations, input/output crates, and other hardware that comprise the control system. The crate or input/output controller (IOC) provides direct control and input/output interfaces for each accelerator subsystem. The network is an integral part of all modem control systems and network performance will determine many characteristics of a control system. This paper will describe the overall APS network and examine the APS control system network in detail. Metrics are provided on the performance of the system under various conditions

Structural controllability and controlling centrality of temporal networks.

Science.gov (United States)

Pan, Yujian; Li, Xiang

2014-01-01

Temporal networks are such networks where nodes and interactions may appear and disappear at various time scales. With the evidence of ubiquity of temporal networks in our economy, nature and society, it's urgent and significant to focus on its structural controllability as well as the corresponding characteristics, which nowadays is still an untouched topic. We develop graphic tools to study the structural controllability as well as its characteristics, identifying the intrinsic mechanism of the ability of individuals in controlling a dynamic and large-scale temporal network. Classifying temporal trees of a temporal network into different types, we give (both upper and lower) analytical bounds of the controlling centrality, which are verified by numerical simulations of both artificial and empirical temporal networks. We find that the positive relationship between aggregated degree and controlling centrality as well as the scale-free distribution of node's controlling centrality are virtually independent of the time scale and types of datasets, meaning the inherent robustness and heterogeneity of the controlling centrality of nodes within temporal networks.

Identity and functions of CxxC-derived motifs.

Science.gov (United States)

Fomenko, Dmitri E; Gladyshev, Vadim N

2003-09-30

Two cysteines separated by two other residues (the CxxC motif) are employed by many redox proteins for formation, isomerization, and reduction of disulfide bonds and for other redox functions. The place of the C-terminal cysteine in this motif may be occupied by serine (the CxxS motif), modifying the functional repertoire of redox proteins. Here we found that the CxxC motif may also give rise to a motif, in which the C-terminal cysteine is replaced with threonine (the CxxT motif). Moreover, in contrast to a view that the N-terminal cysteine in the CxxC motif always serves as a nucleophilic attacking group, this residue could also be replaced with threonine (the TxxC motif), serine (the SxxC motif), or other residues. In each of these CxxC-derived motifs, the presence of a downstream alpha-helix was strongly favored. A search for conserved CxxC-derived motif/helix patterns in four complete genomes representing bacteria, archaea, and eukaryotes identified known redox proteins and suggested possible redox functions for several additional proteins. Catalytic sites in peroxiredoxins were major representatives of the TxxC motif, whereas those in glutathione peroxidases represented the CxxT motif. Structural assessments indicated that threonines in these enzymes could stabilize catalytic thiolates, suggesting revisions to previously proposed catalytic triads. Each of the CxxC-derived motifs was also observed in natural selenium-containing proteins, in which selenocysteine was present in place of a catalytic cysteine.

Control networks and hubs.

Science.gov (United States)

Gratton, Caterina; Sun, Haoxin; Petersen, Steven E

2018-03-01

Executive control functions are associated with frontal, parietal, cingulate, and insular brain regions that interact through distributed large-scale networks. Here, we discuss how fMRI functional connectivity can shed light on the organization of control networks and how they interact with other parts of the brain. In the first section of our review, we present convergent evidence from fMRI functional connectivity, activation, and lesion studies that there are multiple dissociable control networks in the brain with distinct functional properties. In the second section, we discuss how graph theoretical concepts can help illuminate the mechanisms by which control networks interact with other brain regions to carry out goal-directed functions, focusing on the role of specialized hub regions for mediating cross-network interactions. Again, we use a combination of functional connectivity, lesion, and task activation studies to bolster this claim. We conclude that a large-scale network perspective provides important neurobiological constraints on the neural underpinnings of executive control, which will guide future basic and translational research into executive function and its disruption in disease. © 2017 Society for Psychophysiological Research.

Motif decomposition of the phosphotyrosine proteome reveals a new N-terminal binding motif for SHIP2

DEFF Research Database (Denmark)

Miller, Martin Lee; Hanke, S.; Hinsby, A. M.

2008-01-01

set of 481 unique phosphotyrosine (Tyr(P)) peptides by sequence similarity to known ligands of the Src homology 2 (SH2) and the phosphotyrosine binding (PTB) domains. From 20 clusters we extracted 16 known and four new interaction motifs. Using quantitative mass spectrometry we pulled down Tyr......(P)-specific binding partners for peptides corresponding to the extracted motifs. We confirmed numerous previously known interaction motifs and found 15 new interactions mediated by phosphosites not previously known to bind SH2 or PTB. Remarkably, a novel hydrophobic N-terminal motif ((L/V/I)(L/V/I)pY) was identified...

A distance constrained synaptic plasticity model of C. elegans neuronal network

Science.gov (United States)

Badhwar, Rahul; Bagler, Ganesh

2017-03-01

Brain research has been driven by enquiry for principles of brain structure organization and its control mechanisms. The neuronal wiring map of C. elegans, the only complete connectome available till date, presents an incredible opportunity to learn basic governing principles that drive structure and function of its neuronal architecture. Despite its apparently simple nervous system, C. elegans is known to possess complex functions. The nervous system forms an important underlying framework which specifies phenotypic features associated to sensation, movement, conditioning and memory. In this study, with the help of graph theoretical models, we investigated the C. elegans neuronal network to identify network features that are critical for its control. The 'driver neurons' are associated with important biological functions such as reproduction, signalling processes and anatomical structural development. We created 1D and 2D network models of C. elegans neuronal system to probe the role of features that confer controllability and small world nature. The simple 1D ring model is critically poised for the number of feed forward motifs, neuronal clustering and characteristic path-length in response to synaptic rewiring, indicating optimal rewiring. Using empirically observed distance constraint in the neuronal network as a guiding principle, we created a distance constrained synaptic plasticity model that simultaneously explains small world nature, saturation of feed forward motifs as well as observed number of driver neurons. The distance constrained model suggests optimum long distance synaptic connections as a key feature specifying control of the network.

The conserved dileucine- and tyrosine-based motifs in MLV and MPMV envelope glycoproteins are both important to regulate a common Env intracellular trafficking

Directory of Open Access Journals (Sweden)

Lopez-Vergès Sandra

2006-09-01

Full Text Available Abstract Background Retrovirus particles emerge from the assembly of two structural protein components, Gag that is translated as a soluble protein in the cytoplasm of the host cells, and Env, a type I transmembrane protein. Because both components are translated in different intracellular compartments, elucidating the mechanisms of retrovirus assembly thus requires the study of their intracellular trafficking. Results We used a CD25 (Tac chimera-based approach to study the trafficking of Moloney murine leukemia virus and Mason-Pfizer monkey virus Env proteins. We found that the cytoplasmic tails (CTs of both Env conserved two major signals that control a complex intracellular trafficking. A dileucine-based motif controls the sorting of the chimeras from the trans-Golgi network (TGN toward endosomal compartments. Env proteins then follow a retrograde transport to the TGN due to the action of a tyrosine-based motif. Mutation of either motif induces the mis-localization of the chimeric proteins and both motifs are found to mediate interactions of the viral CTs with clathrin adaptors. Conclusion This data reveals the unexpected complexity of the intracellular trafficking of retrovirus Env proteins that cycle between the TGN and endosomes. Given that Gag proteins hijack endosomal host proteins, our work suggests that the endosomal pathway may be used by retroviruses to ensure proper encountering of viral structural Gag and Env proteins in cells, an essential step of virus assembly.

A Novel Dual-cre Motif Enables Two-Way Autoregulation of CcpA in Clostridium acetobutylicum.

Science.gov (United States)

Zhang, Lu; Liu, Yanqiang; Yang, Yunpeng; Jiang, Weihong; Gu, Yang

2018-04-15

The master regulator CcpA (catabolite control protein A) manages a large and complex regulatory network that is essential for cellular physiology and metabolism in Gram-positive bacteria. Although CcpA can affect the expression of target genes by binding to a cis -acting catabolite-responsive element ( cre ), whether and how the expression of CcpA is regulated remain poorly explored. Here, we report a novel dual- cre motif that is employed by the CcpA in Clostridium acetobutylicum , a typical solventogenic Clostridium species, for autoregulation. Two cre sites are involved in CcpA autoregulation, and they reside in the promoter and coding regions of CcpA. In this dual- cre motif, cre P , in the promoter region, positively regulates ccpA transcription, whereas cre ORF , in the coding region, negatively regulates this transcription, thus enabling two-way autoregulation of CcpA. Although CcpA bound cre P more strongly than cre ORF in vitro , the in vivo assay showed that cre ORF -based repression dominates CcpA autoregulation during the entire fermentation. Finally, a synonymous mutation of cre ORF was made within the coding region, achieving an increased intracellular CcpA expression and improved cellular performance. This study provides new insights into the regulatory role of CcpA in C. acetobutylicum and, moreover, contributes a new engineering strategy for this industrial strain. IMPORTANCE CcpA is known to be a key transcription factor in Gram-positive bacteria. However, it is still unclear whether and how the intracellular CcpA level is regulated, which may be essential for maintaining normal cell physiology and metabolism. We discovered here that CcpA employs a dual- cre motif to autoregulate, enabling dynamic control of its own expression level during the entire fermentation process. This finding answers the questions above and fills a void in our understanding of the regulatory network of CcpA. Interference in CcpA autoregulation leads to improved cellular

[Personal motif in art].

Science.gov (United States)

Gerevich, József

2015-01-01

One of the basic questions of the art psychology is whether a personal motif is to be found behind works of art and if so, how openly or indirectly it appears in the work itself. Analysis of examples and documents from the fine arts and literature allow us to conclude that the personal motif that can be identified by the viewer through symbols, at times easily at others with more difficulty, gives an emotional plus to the artistic product. The personal motif may be found in traumatic experiences, in communication to the model or with other emotionally important persons (mourning, disappointment, revenge, hatred, rivalry, revolt etc.), in self-searching, or self-analysis. The emotions are expressed in artistic activity either directly or indirectly. The intention nourished by the artist's identity (Kunstwollen) may stand in the way of spontaneous self-expression, channelling it into hidden paths. Under the influence of certain circumstances, the artist may arouse in the viewer, consciously or unconsciously, an illusionary, misleading image of himself. An examination of the personal motif is one of the important research areas of art therapy.

Controllability of Train Service Network

Directory of Open Access Journals (Sweden)

Xuelei Meng

2015-01-01

Full Text Available Train service network is a network form of train service plan. The controllability of the train service plan determines the recovery possibility of the train service plan in emergencies. We first build the small-world model for train service network and analyze the scale-free character of it. Then based on the linear network controllability theory, we discuss the LB model adaptability in train service network controllability analysis. The LB model is improved and we construct the train service network and define the connotation of the driver nodes based on the immune propagation and cascading failure in the train service network. An algorithm to search for the driver nodes, turning the train service network into a bipartite graph, is proposed and applied in the train service network. We analyze the controllability of the train service network of China with the method and the results of the computing case prove the feasibility of it.

A Nuclear Ribosomal DNA Phylogeny of Acer Inferred with Maximum Likelihood, Splits Graphs, and Motif Analysis of 606 Sequences

Directory of Open Access Journals (Sweden)

Guido W. Grimm

2006-01-01

Full Text Available The multi-copy internal transcribed spacer (ITS region of nuclear ribosomal DNA is widely used to infer phylogenetic relationships among closely related taxa. Here we use maximum likelihood (ML and splits graph analyses to extract phylogenetic information from ~ 600 mostly cloned ITS sequences, representing 81 species and subspecies of Acer, and both species of its sister Dipteronia. Additional analyses compared sequence motifs in Acer and several hundred Anacardiaceae, Burseraceae, Meliaceae, Rutaceae, and Sapindaceae ITS sequences in GenBank. We also assessed the effects of using smaller data sets of consensus sequences with ambiguity coding (accounting for within-species variation instead of the full (partly redundant original sequences. Neighbor-nets and bipartition networks were used to visualize conflict among character state patterns. Species clusters observed in the trees and networks largely agree with morphology-based classifications; of de Jong’s (1994 16 sections, nine are supported in neighbor-net and bipartition networks, and ten by sequence motifs and the ML tree; of his 19 series, 14 are supported in networks, motifs, and the ML tree. Most nodes had higher bootstrap support with matrices of 105 or 40 consensus sequences than with the original matrix. Within-taxon ITS divergence did not differ between diploid and polyploid Acer, and there was little evidence of differentiated parental ITS haplotypes, suggesting that concerted evolution in Acer acts rapidly.

A Nuclear Ribosomal DNA Phylogeny of Acer Inferred with Maximum Likelihood, Splits Graphs, and Motif Analysis of 606 Sequences

Science.gov (United States)

Grimm, Guido W.; Renner, Susanne S.; Stamatakis, Alexandros; Hemleben, Vera

2007-01-01

The multi-copy internal transcribed spacer (ITS) region of nuclear ribosomal DNA is widely used to infer phylogenetic relationships among closely related taxa. Here we use maximum likelihood (ML) and splits graph analyses to extract phylogenetic information from ~ 600 mostly cloned ITS sequences, representing 81 species and subspecies of Acer, and both species of its sister Dipteronia. Additional analyses compared sequence motifs in Acer and several hundred Anacardiaceae, Burseraceae, Meliaceae, Rutaceae, and Sapindaceae ITS sequences in GenBank. We also assessed the effects of using smaller data sets of consensus sequences with ambiguity coding (accounting for within-species variation) instead of the full (partly redundant) original sequences. Neighbor-nets and bipartition networks were used to visualize conflict among character state patterns. Species clusters observed in the trees and networks largely agree with morphology-based classifications; of de Jong’s (1994) 16 sections, nine are supported in neighbor-net and bipartition networks, and ten by sequence motifs and the ML tree; of his 19 series, 14 are supported in networks, motifs, and the ML tree. Most nodes had higher bootstrap support with matrices of 105 or 40 consensus sequences than with the original matrix. Within-taxon ITS divergence did not differ between diploid and polyploid Acer, and there was little evidence of differentiated parental ITS haplotypes, suggesting that concerted evolution in Acer acts rapidly. PMID:19455198

Research on NGN network control technology

Science.gov (United States)

Li, WenYao; Zhou, Fang; Wu, JianXue; Li, ZhiGuang

2004-04-01

Nowadays NGN (Next Generation Network) is the hotspot for discussion and research in IT section. The NGN core technology is the network control technology. The key goal of NGN is to realize the network convergence and evolution. Referring to overlay network model core on Softswitch technology, circuit switch network and IP network convergence realized. Referring to the optical transmission network core on ASTN/ASON, service layer (i.e. IP layer) and optical transmission convergence realized. Together with the distributing feature of NGN network control technology, on NGN platform, overview of combining Softswitch and ASTN/ASON control technology, the solution whether IP should be the NGN core carrier platform attracts general attention, and this is also a QoS problem on NGN end to end. This solution produces the significant practical meaning on equipment development, network deployment, network design and optimization, especially on realizing present network smooth evolving to the NGN. This is why this paper puts forward the research topic on the NGN network control technology. This paper introduces basics on NGN network control technology, then proposes NGN network control reference model, at the same time describes a realizable network structure of NGN. Based on above, from the view of function realization, NGN network control technology is discussed and its work mechanism is analyzed.

Motif enrichment tool.

Science.gov (United States)

Blatti, Charles; Sinha, Saurabh

2014-07-01

The Motif Enrichment Tool (MET) provides an online interface that enables users to find major transcriptional regulators of their gene sets of interest. MET searches the appropriate regulatory region around each gene and identifies which transcription factor DNA-binding specificities (motifs) are statistically overrepresented. Motif enrichment analysis is currently available for many metazoan species including human, mouse, fruit fly, planaria and flowering plants. MET also leverages high-throughput experimental data such as ChIP-seq and DNase-seq from ENCODE and ModENCODE to identify the regulatory targets of a transcription factor with greater precision. The results from MET are produced in real time and are linked to a genome browser for easy follow-up analysis. Use of the web tool is free and open to all, and there is no login requirement. ADDRESS: http://veda.cs.uiuc.edu/MET/. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.

Translational Control of Host Gene Expression by a Cys-Motif Protein Encoded in a Bracovirus.

Directory of Open Access Journals (Sweden)

Eunseong Kim

Full Text Available Translational control is a strategy that various viruses use to manipulate their hosts to suppress acute antiviral response. Polydnaviruses, a group of insect double-stranded DNA viruses symbiotic to some endoparasitoid wasps, are divided into two genera: ichnovirus (IV and bracovirus (BV. In IV, some Cys-motif genes are known as host translation-inhibitory factors (HTIF. The genome of endoparasitoid wasp Cotesia plutellae contains a Cys-motif gene (Cp-TSP13 homologous to an HTIF known as teratocyte-secretory protein 14 (TSP14 of Microplitis croceipes. Cp-TSP13 consists of 129 amino acid residues with a predicted molecular weight of 13.987 kDa and pI value of 7.928. Genomic DNA region encoding its open reading frame has three introns. Cp-TSP13 possesses six conserved cysteine residues as other Cys-motif genes functioning as HTIF. Cp-TSP13 was expressed in Plutella xylostella larvae parasitized by C. plutellae. C. plutellae bracovirus (CpBV was purified and injected into non-parasitized P. xylostella that expressed Cp-TSP13. Cp-TSP13 was cloned into a eukaryotic expression vector and used to infect Sf9 cells to transiently express Cp-TSP13. The synthesized Cp-TSP13 protein was detected in culture broth. An overlaying experiment showed that the purified Cp-TSP13 entered hemocytes. It was localized in the cytosol. Recombinant Cp-TSP13 significantly inhibited protein synthesis of secretory proteins when it was added to in vitro cultured fat body. In addition, the recombinant Cp-TSP13 directly inhibited the translation of fat body mRNAs in in vitro translation assay using rabbit reticulocyte lysate. Moreover, the recombinant Cp-TSP13 significantly suppressed cellular immune responses by inhibiting hemocyte-spreading behavior. It also exhibited significant insecticidal activities by both injection and feeding routes. These results indicate that Cp-TSP13 is a viral HTIF.

Assessing Local Structure Motifs Using Order Parameters for Motif Recognition, Interstitial Identification, and Diffusion Path Characterization

Directory of Open Access Journals (Sweden)

Nils E. R. Zimmermann

2017-11-01

Full Text Available Structure–property relationships form the basis of many design rules in materials science, including synthesizability and long-term stability of catalysts, control of electrical and optoelectronic behavior in semiconductors, as well as the capacity of and transport properties in cathode materials for rechargeable batteries. The immediate atomic environments (i.e., the first coordination shells of a few atomic sites are often a key factor in achieving a desired property. Some of the most frequently encountered coordination patterns are tetrahedra, octahedra, body and face-centered cubic as well as hexagonal close packed-like environments. Here, we showcase the usefulness of local order parameters to identify these basic structural motifs in inorganic solid materials by developing classification criteria. We introduce a systematic testing framework, the Einstein crystal test rig, that probes the response of order parameters to distortions in perfect motifs to validate our approach. Subsequently, we highlight three important application cases. First, we map basic crystal structure information of a large materials database in an intuitive manner by screening the Materials Project (MP database (61,422 compounds for element-specific motif distributions. Second, we use the structure-motif recognition capabilities to automatically find interstitials in metals, semiconductor, and insulator materials. Our Interstitialcy Finding Tool (InFiT facilitates high-throughput screenings of defect properties. Third, the order parameters are reliable and compact quantitative structure descriptors for characterizing diffusion hops of intercalants as our example of magnesium in MnO2-spinel indicates. Finally, the tools developed in our work are readily and freely available as software implementations in the pymatgen library, and we expect them to be further applied to machine-learning approaches for emerging applications in materials science.

Proteome-level assessment of origin, prevalence and function of Leucine-Aspartic Acid (LD) motifs

KAUST Repository

Alam, Tanvir

2018-03-11

Short Linear Motifs (SLiMs) contribute to almost every cellular function by connecting appropriate protein partners. Accurate prediction of SLiMs is difficult due to their shortness and sequence degeneracy. Leucine-aspartic acid (LD) motifs are SLiMs that link paxillin family proteins to factors controlling (cancer) cell adhesion, motility and survival. The existence and importance of LD motifs beyond the paxillin family is poorly understood. To enable a proteome-wide assessment of these motifs, we developed an active-learning based framework that iteratively integrates computational predictions with experimental validation. Our analysis of the human proteome identified a dozen proteins that contain LD motifs, all being involved in cell adhesion and migration, and revealed a new type of inverse LD motif consensus. Our evolutionary analysis suggested that LD motif signalling originated in the common unicellular ancestor of opisthokonts and amoebozoa by co-opting nuclear export sequences. Inter-species comparison revealed a conserved LD signalling core, and reveals the emergence of species-specific adaptive connections, while maintaining a strong functional focus of the LD motif interactome. Collectively, our data elucidate the mechanisms underlying the origin and adaptation of an ancestral SLiM.

Secure network for beamline control

International Nuclear Information System (INIS)

Ohata, T.; Fukui, T.; Ishii, M.; Furukawa, Y.; Nakatani, T.; Matsushita, T.; Takeuchi, M.; Tanaka, R.; Ishikawa, T.

2001-01-01

In SPring-8, beamline control system is constructed with a highly available distributed network system. The socket based communication protocol is used for the beamline control mainly. Beamline users can control the equipment by sending simple control commands to a server process, which is running on a beamline-managing computer (Ohata et al., SPring-8 beamline control system, ICALEPCS'99, Trieste, Italy, 1999). At the beginning the network was based on the shared topology at all beamlines. Consequently, it has a risk for misapplication of the user's program to access different machines on the network system cross over beamlines. It is serious problem for the SPring-8 beamline control system, because all beamlines controlled with unified software interfaces. We introduced the switching technology and the firewalls to support network access control. Also the virtual networking (VLAN: IEEE 802.1Q) and the gigabit Ethernet technology (IEEE 802.3ab) are introduced. Thus the network security and the reliability are guaranteed at the higher level in SPring-8 beamline

Cooperative Team Networks

Science.gov (United States)

2016-06-01

team processes, such as identifying motifs of dynamic communication exchanges which goes well beyond simple dyadic and triadic configurations; as well...new metrics and ways to formulate team processes, such as identifying motifs of dynamic communication exchanges which goes well beyond simple dyadic ...sensing, communication , information, and decision networks - Darryl Ahner (AFIT: Air Force Inst Tech) Panel Session: Mathematical Models of

Generic Properties of Random Gene Regulatory Networks.

Science.gov (United States)

Li, Zhiyuan; Bianco, Simone; Zhang, Zhaoyang; Tang, Chao

2013-12-01

Modeling gene regulatory networks (GRNs) is an important topic in systems biology. Although there has been much work focusing on various specific systems, the generic behavior of GRNs with continuous variables is still elusive. In particular, it is not clear typically how attractors partition among the three types of orbits: steady state, periodic and chaotic, and how the dynamical properties change with network's topological characteristics. In this work, we first investigated these questions in random GRNs with different network sizes, connectivity, fraction of inhibitory links and transcription regulation rules. Then we searched for the core motifs that govern the dynamic behavior of large GRNs. We show that the stability of a random GRN is typically governed by a few embedding motifs of small sizes, and therefore can in general be understood in the context of these short motifs. Our results provide insights for the study and design of genetic networks.

Neural networks for aircraft control

Science.gov (United States)

Linse, Dennis

1990-01-01

Current research in Artificial Neural Networks indicates that networks offer some potential advantages in adaptation and fault tolerance. This research is directed at determining the possible applicability of neural networks to aircraft control. The first application will be to aircraft trim. Neural network node characteristics, network topology and operation, neural network learning and example histories using neighboring optimal control with a neural net are discussed.

Asynchronous control for networked systems

CERN Document Server

Rubio, Francisco; Bencomo, Sebastián

2015-01-01

This book sheds light on networked control systems; it describes different techniques for asynchronous control, moving away from the periodic actions of classical control, replacing them with state-based decisions and reducing the frequency with which communication between subsystems is required. The text focuses specially on event-based control. Split into two parts, Asynchronous Control for Networked Systems begins by addressing the problems of single-loop networked control systems, laying out various solutions which include two alternative model-based control schemes (anticipatory and predictive) and the use of H2/H∞ robust control to deal with network delays and packet losses. Results on self-triggering and send-on-delta sampling are presented to reduce the need for feedback in the loop. In Part II, the authors present solutions for distributed estimation and control. They deal first with reliable networks and then extend their results to scenarios in which delays and packet losses may occur. The novel ...

Convolutional neural network architectures for predicting DNA–protein binding

Science.gov (United States)

Zeng, Haoyang; Edwards, Matthew D.; Liu, Ge; Gifford, David K.

2016-01-01

Motivation: Convolutional neural networks (CNN) have outperformed conventional methods in modeling the sequence specificity of DNA–protein binding. Yet inappropriate CNN architectures can yield poorer performance than simpler models. Thus an in-depth understanding of how to match CNN architecture to a given task is needed to fully harness the power of CNNs for computational biology applications. Results: We present a systematic exploration of CNN architectures for predicting DNA sequence binding using a large compendium of transcription factor datasets. We identify the best-performing architectures by varying CNN width, depth and pooling designs. We find that adding convolutional kernels to a network is important for motif-based tasks. We show the benefits of CNNs in learning rich higher-order sequence features, such as secondary motifs and local sequence context, by comparing network performance on multiple modeling tasks ranging in difficulty. We also demonstrate how careful construction of sequence benchmark datasets, using approaches that control potentially confounding effects like positional or motif strength bias, is critical in making fair comparisons between competing methods. We explore how to establish the sufficiency of training data for these learning tasks, and we have created a flexible cloud-based framework that permits the rapid exploration of alternative neural network architectures for problems in computational biology. Availability and Implementation: All the models analyzed are available at http://cnn.csail.mit.edu. Contact: gifford@mit.edu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:27307608

UKIRAN KERAWANG ACEH GAYO SEBAGAI INSPIRASI PENCIPTAAN MOTIF BATIK KHAS GAYO

Directory of Open Access Journals (Sweden)

Irfa ina Rohana Salma

2016-12-01

Full Text Available ABSTRAK Industri batik mulai berkembang di Gayo, tetapi belum memiliki motif batik khas daerah. Oleh karena itu perlu diciptakan motif batik khas Gayo, dengan mengambil inspirasi dari ukiran yang terdapat pada rumah tradisional yang biasa disebut ukiran kerawang Gayo. Tujuan penciptaan seni ini adalah untuk menciptakan motif batik yang memiliki ciri khas Gayo. Metode yang digunakan yaitu eksplorasi ide, perancangan, dan perwujudan menjadi motif batik. Dalam kegiatan ini telah diciptakan enam motif batik khas Gayo yaitu: (1 Motif Ceplok Gayo; (2 Motif Gayo Tegak; (3 Motif Gayo Lurus; (4 Motif Parang Gayo; (5 Motif Gayo Lembut; dan (6 Motif Geometris Gayo. Hasil uji kesukaan terhadap motif kepada lima puluh responden menunjukkan bahwa Motif Ceplok Gayo paling banyak dipilih oleh responden yaitu sebesar 19%, sedangkan Motif Parang Gayo 18%, Motif Gayo Lembut 17%, Motif Geometris Gayo 17%, Motif Gayo Lurus 15% dan Motif Gayo Tegak 14%. Rata-rata motif yang dihasilkan mendapatkan apresiasi yang baik dari responden, sehingga semua motif layak diproduksi sebagai batik khas Gayo.Kata kunci: batik Gayo, Motif Ceplok Gayo, Motif Parang Gayo.ABSTRACTBatik industry began to develop in Gayo, but have not had a typical batik motif itself. Therefore, it is necessary to create batik motifs of Gayo, by taking inspiration from the carvings found in traditional houses commonly called kerawang Gayo. The purpose of this art is to create motifs those have a Gayo characteristic. The method used are the idea exploration, design, and motifs embodiment. In this activity has created six Gayo batik motifs, namely: (1 Motif Ceplok Gayo; (2 Motif Gayo Tegak; (3 Motif GayoLurus; (4 Motif Parang Gayo; (5 Motif Gayo Lembut; dan (6 Motif Geometris Gayo. The test results fondness of the motives to fifty respondents indicated that the Motif Ceplok Gayo most preferred by respondents ie 19%, while Motif Parang Gayo 18%, Motif Gayo Lembut 17%, Motif Geometris Gayo 17%, Motif Gayo

Promzea: a pipeline for discovery of co-regulatory motifs in maize and other plant species and its application to the anthocyanin and phlobaphene biosynthetic pathways and the Maize Development Atlas.

Science.gov (United States)

Liseron-Monfils, Christophe; Lewis, Tim; Ashlock, Daniel; McNicholas, Paul D; Fauteux, François; Strömvik, Martina; Raizada, Manish N

2013-03-15

The discovery of genetic networks and cis-acting DNA motifs underlying their regulation is a major objective of transcriptome studies. The recent release of the maize genome (Zea mays L.) has facilitated in silico searches for regulatory motifs. Several algorithms exist to predict cis-acting elements, but none have been adapted for maize. A benchmark data set was used to evaluate the accuracy of three motif discovery programs: BioProspector, Weeder and MEME. Analysis showed that each motif discovery tool had limited accuracy and appeared to retrieve a distinct set of motifs. Therefore, using the benchmark, statistical filters were optimized to reduce the false discovery ratio, and then remaining motifs from all programs were combined to improve motif prediction. These principles were integrated into a user-friendly pipeline for motif discovery in maize called Promzea, available at http://www.promzea.org and on the Discovery Environment of the iPlant Collaborative website. Promzea was subsequently expanded to include rice and Arabidopsis. Within Promzea, a user enters cDNA sequences or gene IDs; corresponding upstream sequences are retrieved from the maize genome. Predicted motifs are filtered, combined and ranked. Promzea searches the chosen plant genome for genes containing each candidate motif, providing the user with the gene list and corresponding gene annotations. Promzea was validated in silico using a benchmark data set: the Promzea pipeline showed a 22% increase in nucleotide sensitivity compared to the best standalone program tool, Weeder, with equivalent nucleotide specificity. Promzea was also validated by its ability to retrieve the experimentally defined binding sites of transcription factors that regulate the maize anthocyanin and phlobaphene biosynthetic pathways. Promzea predicted additional promoter motifs, and genome-wide motif searches by Promzea identified 127 non-anthocyanin/phlobaphene genes that each contained all five predicted promoter

Self-Organization of Microcircuits in Networks of Spiking Neurons with Plastic Synapses.

Directory of Open Access Journals (Sweden)

Gabriel Koch Ocker

2015-08-01

Full Text Available The synaptic connectivity of cortical networks features an overrepresentation of certain wiring motifs compared to simple random-network models. This structure is shaped, in part, by synaptic plasticity that promotes or suppresses connections between neurons depending on their joint spiking activity. Frequently, theoretical studies focus on how feedforward inputs drive plasticity to create this network structure. We study the complementary scenario of self-organized structure in a recurrent network, with spike timing-dependent plasticity driven by spontaneous dynamics. We develop a self-consistent theory for the evolution of network structure by combining fast spiking covariance with a slow evolution of synaptic weights. Through a finite-size expansion of network dynamics we obtain a low-dimensional set of nonlinear differential equations for the evolution of two-synapse connectivity motifs. With this theory in hand, we explore how the form of the plasticity rule drives the evolution of microcircuits in cortical networks. When potentiation and depression are in approximate balance, synaptic dynamics depend on weighted divergent, convergent, and chain motifs. For additive, Hebbian STDP these motif interactions create instabilities in synaptic dynamics that either promote or suppress the initial network structure. Our work provides a consistent theoretical framework for studying how spiking activity in recurrent networks interacts with synaptic plasticity to determine network structure.

Self-Organization of Microcircuits in Networks of Spiking Neurons with Plastic Synapses.

Science.gov (United States)

Ocker, Gabriel Koch; Litwin-Kumar, Ashok; Doiron, Brent

2015-08-01

The synaptic connectivity of cortical networks features an overrepresentation of certain wiring motifs compared to simple random-network models. This structure is shaped, in part, by synaptic plasticity that promotes or suppresses connections between neurons depending on their joint spiking activity. Frequently, theoretical studies focus on how feedforward inputs drive plasticity to create this network structure. We study the complementary scenario of self-organized structure in a recurrent network, with spike timing-dependent plasticity driven by spontaneous dynamics. We develop a self-consistent theory for the evolution of network structure by combining fast spiking covariance with a slow evolution of synaptic weights. Through a finite-size expansion of network dynamics we obtain a low-dimensional set of nonlinear differential equations for the evolution of two-synapse connectivity motifs. With this theory in hand, we explore how the form of the plasticity rule drives the evolution of microcircuits in cortical networks. When potentiation and depression are in approximate balance, synaptic dynamics depend on weighted divergent, convergent, and chain motifs. For additive, Hebbian STDP these motif interactions create instabilities in synaptic dynamics that either promote or suppress the initial network structure. Our work provides a consistent theoretical framework for studying how spiking activity in recurrent networks interacts with synaptic plasticity to determine network structure.

RNA-protein binding motifs mining with a new hybrid deep learning based cross-domain knowledge integration approach.

Science.gov (United States)

Pan, Xiaoyong; Shen, Hong-Bin

2017-02-28

RNAs play key roles in cells through the interactions with proteins known as the RNA-binding proteins (RBP) and their binding motifs enable crucial understanding of the post-transcriptional regulation of RNAs. How the RBPs correctly recognize the target RNAs and why they bind specific positions is still far from clear. Machine learning-based algorithms are widely acknowledged to be capable of speeding up this process. Although many automatic tools have been developed to predict the RNA-protein binding sites from the rapidly growing multi-resource data, e.g. sequence, structure, their domain specific features and formats have posed significant computational challenges. One of current difficulties is that the cross-source shared common knowledge is at a higher abstraction level beyond the observed data, resulting in a low efficiency of direct integration of observed data across domains. The other difficulty is how to interpret the prediction results. Existing approaches tend to terminate after outputting the potential discrete binding sites on the sequences, but how to assemble them into the meaningful binding motifs is a topic worth of further investigation. In viewing of these challenges, we propose a deep learning-based framework (iDeep) by using a novel hybrid convolutional neural network and deep belief network to predict the RBP interaction sites and motifs on RNAs. This new protocol is featured by transforming the original observed data into a high-level abstraction feature space using multiple layers of learning blocks, where the shared representations across different domains are integrated. To validate our iDeep method, we performed experiments on 31 large-scale CLIP-seq datasets, and our results show that by integrating multiple sources of data, the average AUC can be improved by 8% compared to the best single-source-based predictor; and through cross-domain knowledge integration at an abstraction level, it outperforms the state-of-the-art predictors by 6

Neural PID Control Strategy for Networked Process Control

Directory of Open Access Journals (Sweden)

Jianhua Zhang

2013-01-01

Full Text Available A new method with a two-layer hierarchy is presented based on a neural proportional-integral-derivative (PID iterative learning method over the communication network for the closed-loop automatic tuning of a PID controller. It can enhance the performance of the well-known simple PID feedback control loop in the local field when real networked process control applied to systems with uncertain factors, such as external disturbance or randomly delayed measurements. The proposed PID iterative learning method is implemented by backpropagation neural networks whose weights are updated via minimizing tracking error entropy of closed-loop systems. The convergence in the mean square sense is analysed for closed-loop networked control systems. To demonstrate the potential applications of the proposed strategies, a pressure-tank experiment is provided to show the usefulness and effectiveness of the proposed design method in network process control systems.

Large-scale discovery of promoter motifs in Drosophila melanogaster.

Directory of Open Access Journals (Sweden)

Thomas A Down

2007-01-01

Full Text Available A key step in understanding gene regulation is to identify the repertoire of transcription factor binding motifs (TFBMs that form the building blocks of promoters and other regulatory elements. Identifying these experimentally is very laborious, and the number of TFBMs discovered remains relatively small, especially when compared with the hundreds of transcription factor genes predicted in metazoan genomes. We have used a recently developed statistical motif discovery approach, NestedMICA, to detect candidate TFBMs from a large set of Drosophila melanogaster promoter regions. Of the 120 motifs inferred in our initial analysis, 25 were statistically significant matches to previously reported motifs, while 87 appeared to be novel. Analysis of sequence conservation and motif positioning suggested that the great majority of these discovered motifs are predictive of functional elements in the genome. Many motifs showed associations with specific patterns of gene expression in the D. melanogaster embryo, and we were able to obtain confident annotation of expression patterns for 25 of our motifs, including eight of the novel motifs. The motifs are available through Tiffin, a new database of DNA sequence motifs. We have discovered many new motifs that are overrepresented in D. melanogaster promoter regions, and offer several independent lines of evidence that these are novel TFBMs. Our motif dictionary provides a solid foundation for further investigation of regulatory elements in Drosophila, and demonstrates techniques that should be applicable in other species. We suggest that further improvements in computational motif discovery should narrow the gap between the set of known motifs and the total number of transcription factors in metazoan genomes.

MHC motif viewer

DEFF Research Database (Denmark)

Rapin, Nicolas Philippe Jean-Pierre; Hoof, Ilka; Lund, Ole

2008-01-01

. Algorithms that predict which peptides MHC molecules bind have recently been developed and cover many different alleles, but the utility of these algorithms is hampered by the lack of tools for browsing and comparing the specificity of these molecules. We have, therefore, developed a web server, MHC motif....... A special viewing feature, MHC fight, allows for display of the specificity of two different MHC molecules side by side. We show how the web server can be used to discover and display surprising similarities as well as differences between MHC molecules within and between different species. The MHC motif...

Towards structural controllability of local-world networks

International Nuclear Information System (INIS)

Sun, Shiwen; Ma, Yilin; Wu, Yafang; Wang, Li; Xia, Chengyi

2016-01-01

Controlling complex networks is of vital importance in science and engineering. Meanwhile, local-world effect is an important ingredient which should be taken into consideration in the complete description of real-world complex systems. In this letter, structural controllability of a class of local-world networks is investigated. Through extensive numerical simulations, firstly, effects of local world size M and network size N on structural controllability are examined. For local-world networks with sparse topological configuration, compared to network size, local-world size can induce stronger influence on controllability, however, for dense networks, controllability is greatly affected by network size and local-world effect can be neglected. Secondly, relationships between controllability and topological properties are analyzed. Lastly, the robustness of local-world networks under targeted attacks regarding structural controllability is discussed. These results can help to deepen the understanding of structural complexity and connectivity patterns of complex systems. - Highlights: • Structural controllability of a class of local-world networks is investigated. • For sparse local-world networks, compared to network size, local-world size can bring stronger influence on controllability. • For dense networks, controllability is greatly affected by network size and the effect of local-world size can be neglected. • Structural controllability against targeted node attacks is discussed.

Towards structural controllability of local-world networks

Energy Technology Data Exchange (ETDEWEB)

Sun, Shiwen, E-mail: sunsw80@126.com [Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384 (China); Key Laboratory of Computer Vision and System (Tianjin University of Technology), Ministry of Education, Tianjin 300384 (China); Ma, Yilin; Wu, Yafang; Wang, Li; Xia, Chengyi [Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384 (China); Key Laboratory of Computer Vision and System (Tianjin University of Technology), Ministry of Education, Tianjin 300384 (China)

2016-05-20

Controlling complex networks is of vital importance in science and engineering. Meanwhile, local-world effect is an important ingredient which should be taken into consideration in the complete description of real-world complex systems. In this letter, structural controllability of a class of local-world networks is investigated. Through extensive numerical simulations, firstly, effects of local world size M and network size N on structural controllability are examined. For local-world networks with sparse topological configuration, compared to network size, local-world size can induce stronger influence on controllability, however, for dense networks, controllability is greatly affected by network size and local-world effect can be neglected. Secondly, relationships between controllability and topological properties are analyzed. Lastly, the robustness of local-world networks under targeted attacks regarding structural controllability is discussed. These results can help to deepen the understanding of structural complexity and connectivity patterns of complex systems. - Highlights: • Structural controllability of a class of local-world networks is investigated. • For sparse local-world networks, compared to network size, local-world size can bring stronger influence on controllability. • For dense networks, controllability is greatly affected by network size and the effect of local-world size can be neglected. • Structural controllability against targeted node attacks is discussed.

Motif discovery in ranked lists of sequences

DEFF Research Database (Denmark)

Nielsen, Morten Muhlig; Tataru, Paula; Madsen, Tobias

2016-01-01

Motif analysis has long been an important method to characterize biological functionality and the current growth of sequencing-based genomics experiments further extends its potential. These diverse experiments often generate sequence lists ranked by some functional property. There is therefore...... advantage of the regular expression feature, including enrichments for combinations of different microRNA seed sites. The method is implemented and made publicly available as an R package and supports high parallelization on multi-core machinery....... a growing need for motif analysis methods that can exploit this coupled data structure and be tailored for specific biological questions. Here, we present an exploratory motif analysis tool, Regmex (REGular expression Motif EXplorer), which offers several methods to evaluate the correlation of motifs...

Prediction of proteasome cleavage motifs by neural networks

DEFF Research Database (Denmark)

Kesimir, C.; Nussbaum, A.K.; Schild, H.

2002-01-01

physiological conditions. Our algorithm has been trained not only on in vitro data, but also on MHC Class I ligand data, which reflect a combination of immunoproteasome and constitutive proteasome specificity. This feature, together with the use of neural networks, a non-linear classification technique, make...... the prediction of MHC Class I ligand boundaries more accurate: 65% of the cleavage sites and 85% of the non-cleavage sites are correctly determined. Moreover, we show that the neural networks trained on the constitutive proteasome data learns a specificity that differs from that of the networks trained on MHC...

Deciphering functional glycosaminoglycan motifs in development.

Science.gov (United States)

Townley, Robert A; Bülow, Hannes E

2018-03-23

Glycosaminoglycans (GAGs) such as heparan sulfate, chondroitin/dermatan sulfate, and keratan sulfate are linear glycans, which when attached to protein backbones form proteoglycans. GAGs are essential components of the extracellular space in metazoans. Extensive modifications of the glycans such as sulfation, deacetylation and epimerization create structural GAG motifs. These motifs regulate protein-protein interactions and are thereby repsonsible for many of the essential functions of GAGs. This review focusses on recent genetic approaches to characterize GAG motifs and their function in defined signaling pathways during development. We discuss a coding approach for GAGs that would enable computational analyses of GAG sequences such as alignments and the computation of position weight matrices to describe GAG motifs. Copyright © 2018 Elsevier Ltd. All rights reserved.

Minimum energy control and optimal-satisfactory control of Boolean control network

International Nuclear Information System (INIS)

Li, Fangfei; Lu, Xiwen

2013-01-01

In the literatures, to transfer the Boolean control network from the initial state to the desired state, the expenditure of energy has been rarely considered. Motivated by this, this Letter investigates the minimum energy control and optimal-satisfactory control of Boolean control network. Based on the semi-tensor product of matrices and Floyd's algorithm, minimum energy, constrained minimum energy and optimal-satisfactory control design for Boolean control network are given respectively. A numerical example is presented to illustrate the efficiency of the obtained results.

Flow motifs reveal limitations of the static framework to represent human interactions

Science.gov (United States)

Rocha, Luis E. C.; Blondel, Vincent D.

2013-04-01

Networks are commonly used to define underlying interaction structures where infections, information, or other quantities may spread. Although the standard approach has been to aggregate all links into a static structure, some studies have shown that the time order in which the links are established may alter the dynamics of spreading. In this paper, we study the impact of the time ordering in the limits of flow on various empirical temporal networks. By using a random walk dynamics, we estimate the flow on links and convert the original undirected network (temporal and static) into a directed flow network. We then introduce the concept of flow motifs and quantify the divergence in the representativity of motifs when using the temporal and static frameworks. We find that the regularity of contacts and persistence of vertices (common in email communication and face-to-face interactions) result on little differences in the limits of flow for both frameworks. On the other hand, in the case of communication within a dating site and of a sexual network, the flow between vertices changes significantly in the temporal framework such that the static approximation poorly represents the structure of contacts. We have also observed that cliques with 3 and 4 vertices containing only low-flow links are more represented than the same cliques with all high-flow links. The representativity of these low-flow cliques is higher in the temporal framework. Our results suggest that the flow between vertices connected in cliques depend on the topological context in which they are placed and in the time sequence in which the links are established. The structure of the clique alone does not completely characterize the potential of flow between the vertices.

Network Traffic Features for Anomaly Detection in Specific Industrial Control System Network

Directory of Open Access Journals (Sweden)

Matti Mantere

2013-09-01

Full Text Available The deterministic and restricted nature of industrial control system networks sets them apart from more open networks, such as local area networks in office environments. This improves the usability of network security, monitoring approaches that would be less feasible in more open environments. One of such approaches is machine learning based anomaly detection. Without proper customization for the special requirements of the industrial control system network environment, many existing anomaly or misuse detection systems will perform sub-optimally. A machine learning based approach could reduce the amount of manual customization required for different industrial control system networks. In this paper we analyze a possible set of features to be used in a machine learning based anomaly detection system in the real world industrial control system network environment under investigation. The network under investigation is represented by architectural drawing and results derived from network trace analysis. The network trace is captured from a live running industrial process control network and includes both control data and the data flowing between the control network and the office network. We limit the investigation to the IP traffic in the traces.

Neural Networks for Optimal Control

DEFF Research Database (Denmark)

Sørensen, O.

1995-01-01

Two neural networks are trained to act as an observer and a controller, respectively, to control a non-linear, multi-variable process.......Two neural networks are trained to act as an observer and a controller, respectively, to control a non-linear, multi-variable process....

Aplikasi Ornamen Khas Maluku untuk Pengembangan Desain Motif Batik

Directory of Open Access Journals (Sweden)

Masiswo Masiswo

2016-04-01

Full Text Available ABSTRAKMaluku memiliki banyak ragam hias budaya warisan nilai leluhur berupa ornamen etnis yang merupakan kesenian dan keterampilan kerajinan. Hasil warisan tersebut sampai saat ini masih lestari hidup serta dapat dinikmati sebagai konsumsi rohani yang memuaskan manusia. Berkaitan dengan keberlangsungan nilai-nilai tradisi etnis yang berwujud pada ornamen-ornamen daerah Maluku, maka dikembangkan untuk kebutuhan manusia berupa motif batik pada kain. Pengembangan ornamen ini lebih menekankan pada representasi akan bentuk-bentuk ornamen yang diterapkan pada kerajinan batik berupa motif khas Maluku. Pengembangan alternatif desain motif batik dibuat tiga variasi yang bersumber dari ornamen khas Maluku dibuat prototipe produknya dan diuji ketahanan luntur warnanya. Hasil uji ketahanan luntur warna terhadap gosokan basah dari tiga prototipe produk berpredikat baik sekali terdapat pada “Motif Siwa” dan predikat baik pada motif “Siwa Talang” dan motif “Matahari Siwa Talang”.Kata kunci: desain, Maluku, motif batik, ornamenABSTRACTMaluku has much decorative ancestral cultural heritage value in the form of ornament ethnic arts and crafts skills. The result of the legacy is still sustainable living can be enjoyed as well as satisfying spiritual human consumption.Related to the sustainability of traditional values in the form of ethnic ornaments Maluku, it was developed for human needs in the form of batik cloth . The development of these ornaments will be more emphasis on the representation forms of ornamentation that is applied to a batik motif Maluku. Development of alternative design motif made three variations. The development of three alternative design motifs derived from the Maluku ornaments made and tested a prototype product color fastness. The test results of color fastness to wet rubbing of the three prototypes are excellent products predicated on the "Motif Siwa" and a good rating on the motif "Siwa Talang" and motif "Matahari Siwa

Parole, Sintagmatik, dan Paradigmatik Motif Batik Mega Mendung

Directory of Open Access Journals (Sweden)

Rudi - Nababan

2012-04-01

Full Text Available ABSTRACT   Discussing traditional batik is related a lot to the organization system of fine arts element ac- companying it, either the pattern of the motif or the technique of the making. In this case, the motif of Mega Mendung Cirebon certainly has patterns and rules which are traditionally different from the other motifs in other areas. Through  semiotics analysis especially with Saussure and Pierce concept, it can be traced that batik with Cirebon motif, in this case Mega Mendung motif, has parole and langue system, as unique fine arts language in batik, and structure of visual syntagmatic and paradigmatic. In the context of batik motif as fine arts language, it is surely related to sign system as symbol and icon.       Keywords: visual semiotic, Cirebon’s batik.

Characterizing English Poetic Style Using Complex Networks

Science.gov (United States)

Roxas-Villanueva, Ranzivelle Marianne; Nambatac, Maelori Krista; Tapang, Giovanni

Complex networks have been proven useful in characterizing written texts. Here, we use networks to probe if there exist a similarity within, and difference across, era as reflected within the poem's structure. In literary history, boundary lines are set to distinguish the change in writing styles through time. We obtain the network parameters and motif frequencies of 845 poems published from 1522 to 1931 and relate this to the writing of the Elizabethan, 17th Century, Augustan, Romantic and Victorian eras. Analysis of the different network parameters shows a significant difference of the Augustan era (1667-1780) with the rest. The network parameters and the convex hull and centroids of the motif frequencies reflect the adjectival sequence pattern of the poems of the Augustan era.

Delays and networked control systems

CERN Document Server

Hetel, Laurentiu; Daafouz, Jamal; Johansson, Karl

2016-01-01

This edited monograph includes state-of-the-art contributions on continuous time dynamical networks with delays. The book is divided into four parts. The first part presents tools and methods for the analysis of time-delay systems with a particular attention on control problems of large scale or infinite-dimensional systems with delays. The second part of the book is dedicated to the use of time-delay models for the analysis and design of Networked Control Systems. The third part of the book focuses on the analysis and design of systems with asynchronous sampling intervals which occur in Networked Control Systems. The last part of the book exposes several contributions dealing with the design of cooperative control and observation laws for networked control systems. The target audience primarily comprises researchers and experts in the field of control theory, but the book may also be beneficial for graduate students. .

Bayesian centroid estimation for motif discovery.

Science.gov (United States)

Carvalho, Luis

2013-01-01

Biological sequences may contain patterns that signal important biomolecular functions; a classical example is regulation of gene expression by transcription factors that bind to specific patterns in genomic promoter regions. In motif discovery we are given a set of sequences that share a common motif and aim to identify not only the motif composition, but also the binding sites in each sequence of the set. We propose a new centroid estimator that arises from a refined and meaningful loss function for binding site inference. We discuss the main advantages of centroid estimation for motif discovery, including computational convenience, and how its principled derivation offers further insights about the posterior distribution of binding site configurations. We also illustrate, using simulated and real datasets, that the centroid estimator can differ from the traditional maximum a posteriori or maximum likelihood estimators.

Bayesian centroid estimation for motif discovery.

Directory of Open Access Journals (Sweden)

Luis Carvalho

Full Text Available Biological sequences may contain patterns that signal important biomolecular functions; a classical example is regulation of gene expression by transcription factors that bind to specific patterns in genomic promoter regions. In motif discovery we are given a set of sequences that share a common motif and aim to identify not only the motif composition, but also the binding sites in each sequence of the set. We propose a new centroid estimator that arises from a refined and meaningful loss function for binding site inference. We discuss the main advantages of centroid estimation for motif discovery, including computational convenience, and how its principled derivation offers further insights about the posterior distribution of binding site configurations. We also illustrate, using simulated and real datasets, that the centroid estimator can differ from the traditional maximum a posteriori or maximum likelihood estimators.

Vulnerability and controllability of networks of networks

International Nuclear Information System (INIS)

Liu, Xueming; Peng, Hao; Gao, Jianxi

2015-01-01

Network science is a highly interdisciplinary field ranging from natural science to engineering technology and it has been applied to model complex systems and used to explain their behaviors. Most previous studies have been focus on isolated networks, but many real-world networks do in fact interact with and depend on other networks via dependency connectivities, forming “networks of networks” (NON). The interdependence between networks has been found to largely increase the vulnerability of interacting systems, when a node in one network fails, it usually causes dependent nodes in other networks to fail, which, in turn, may cause further damage on the first network and result in a cascade of failures with sometimes catastrophic consequences, e.g., electrical blackouts caused by the interdependence of power grids and communication networks. The vulnerability of a NON can be analyzed by percolation theory that can be used to predict the critical threshold where a NON collapses. We review here the analytic framework for analyzing the vulnerability of NON, which yields novel percolation laws for n-interdependent networks and also shows that percolation theory of a single network studied extensively in physics and mathematics in the last 50 years is a specific limited case of the more general case of n interacting networks. Understanding the mechanism behind the cascading failure in NON enables us finding methods to decrease the vulnerability of the natural systems and design of more robust infrastructure systems. By examining the vulnerability of NON under targeted attack and studying the real interdependent systems, we find two methods to decrease the systems vulnerability: (1) protect the high-degree nodes, and (2) increase the degree correlation between networks. Furthermore, the ultimate proof of our understanding of natural and technological systems is reflected in our ability to control them. We also review the recent studies and challenges on the

Launch Control Network Engineer

Science.gov (United States)

Medeiros, Samantha

2017-01-01

The Spaceport Command and Control System (SCCS) is being built at the Kennedy Space Center in order to successfully launch NASA’s revolutionary vehicle that allows humans to explore further into space than ever before. During my internship, I worked with the Network, Firewall, and Hardware teams that are all contributing to the huge SCCS network project effort. I learned the SCCS network design and the several concepts that are running in the background. I also updated and designed documentation for physical networks that are part of SCCS. This includes being able to assist and build physical installations as well as configurations. I worked with the network design for vehicle telemetry interfaces to the Launch Control System (LCS); this allows the interface to interact with other systems at other NASA locations. This network design includes the Space Launch System (SLS), Interim Cryogenic Propulsion Stage (ICPS), and the Orion Multipurpose Crew Vehicle (MPCV). I worked on the network design and implementation in the Customer Avionics Interface Development and Analysis (CAIDA) lab.

CONTEMPORARY USAGE OF TRADITIONAL TURKISH MOTIFS IN PRODUCT DESIGNS

Directory of Open Access Journals (Sweden)

Tulay Gumuser

2012-12-01

Full Text Available The aim of this study is to identify the traditional Turkish motifs and its relations among present industrial designs. Traditional Turkish motifs played a very important role in 16th century onwards. The arts of the Ottoman Empire were used because of their symbolic meanings and unique styles. When we examine these motifs we encounter; Tiger Stripe, Three Spot (Çintemani, Rumi, Hatayi, Penç, Cloud, Crescent, Star, Crown, Hyacinth, Tulip and Carnation motifs. Nowadays, Turkish designers have begun to use these traditional Turkish motifs in their designs so as to create differences and awareness in the world design. The examples of these industrial designs, using the Turkish motifs, have survived and have Ottoman heritage and historical value. In this study, the Turkish motifs will be examined along with their focus on contemporary Turkish industrial designs used today.

RNA motif search with data-driven element ordering.

Science.gov (United States)

Rampášek, Ladislav; Jimenez, Randi M; Lupták, Andrej; Vinař, Tomáš; Brejová, Broňa

2016-05-18

In this paper, we study the problem of RNA motif search in long genomic sequences. This approach uses a combination of sequence and structure constraints to uncover new distant homologs of known functional RNAs. The problem is NP-hard and is traditionally solved by backtracking algorithms. We have designed a new algorithm for RNA motif search and implemented a new motif search tool RNArobo. The tool enhances the RNAbob descriptor language, allowing insertions in helices, which enables better characterization of ribozymes and aptamers. A typical RNA motif consists of multiple elements and the running time of the algorithm is highly dependent on their ordering. By approaching the element ordering problem in a principled way, we demonstrate more than 100-fold speedup of the search for complex motifs compared to previously published tools. We have developed a new method for RNA motif search that allows for a significant speedup of the search of complex motifs that include pseudoknots. Such speed improvements are crucial at a time when the rate of DNA sequencing outpaces growth in computing. RNArobo is available at http://compbio.fmph.uniba.sk/rnarobo .

Transitions from Trees to Cycles in Adaptive Flow Networks

DEFF Research Database (Denmark)

Martens, Erik Andreas; Klemm, Konstantin

2017-01-01

-world transport networks exhibit both tree-like motifs and cycles. When the network is subject to load fluctuations, the presence of cyclic motifs may help to reduce flow fluctuations and, thus, render supply in the network more robust. While previous studies considered network topology via optimization...... principles, here, we take a dynamical systems approach and study a simple model of a flow network with dynamically adapting weights (conductances). We assume a spatially non-uniform distribution of rapidly fluctuating loads in the sinks and investigate what network configurations are dynamically stable......Transport networks are crucial to the functioning of natural and technological systems. Nature features transport networks that are adaptive over a vast range of parameters, thus providing an impressive level of robustness in supply. Theoretical and experimental studies have found that real...

Transitions from Trees to Cycles in Adaptive Flow Networks

DEFF Research Database (Denmark)

Martens, Erik Andreas; Klemm, Konstantin

2017-01-01

. The network converges to a spatially non-uniform stable configuration composed of both cyclic and tree-like structures. Cyclic structures emerge locally in a transcritical bifurcation as the amplitude of the load fluctuations is increased. The resulting adaptive dynamics thus partitions the network into two......Transport networks are crucial to the functioning of natural and technological systems. Nature features transport networks that are adaptive over a vast range of parameters, thus providing an impressive level of robustness in supply. Theoretical and experimental studies have found that real......-world transport networks exhibit both tree-like motifs and cycles. When the network is subject to load fluctuations, the presence of cyclic motifs may help to reduce flow fluctuations and, thus, render supply in the network more robust. While previous studies considered network topology via optimization...

Modeling, Optimization & Control of Hydraulic Networks

DEFF Research Database (Denmark)

Tahavori, Maryamsadat

2014-01-01

. The nonlinear network model is derived based on the circuit theory. A suitable projection is used to reduce the state vector and to express the model in standard state-space form. Then, the controllability of nonlinear nonaffine hydraulic networks is studied. The Lie algebra-based controllability matrix is used......Water supply systems consist of a number of pumping stations, which deliver water to the customers via pipeline networks and elevated reservoirs. A huge amount of drinking water is lost before it reaches to end-users due to the leakage in pipe networks. A cost effective solution to reduce leakage...... in water network is pressure management. By reducing the pressure in the water network, the leakage can be reduced significantly. Also it reduces the amount of energy consumption in water networks. The primary purpose of this work is to develop control algorithms for pressure control in water supply...

Induction of cell death by tospoviral protein NSs and the motif critical for cell death does not control RNA silencing suppression activity.

Science.gov (United States)

Singh, Ajeet; Permar, Vipin; Jain, R K; Goswami, Suneha; Kumar, Ranjeet Ranjan; Canto, Tomas; Palukaitis, Peter; Praveen, Shelly

2017-08-01

Groundnut bud necrosis virus induces necrotic symptoms in different hosts. Previous studies showed reactive oxygen species-mediated programmed cell death (PCD) resulted in necrotic symptoms. Transgenic expression of viral protein NSs mimics viral symptoms. Here, we showed a role for NSs in influencing oxidative burst in the cell, by analyzing H 2 O 2 accumulation, activities of antioxidant enzymes and expression levels of vacuolar processing enzymes, H 2 O 2 -responsive microRNA 319a.2 plus its possible target metacaspase-8. The role of NSs in PCD, was shown using two NSs mutants: one in the Trp/GH3 motif (a homologue of pro-apototic domain) (NSs S189R ) and the other in a non-Trp/GH3 motif (NSs L172R ). Tobacco rattle virus (TRV) expressing NSs S189R enhanced the PCD response, but not TRV-NSs L172R , while RNA silencing suppression activity was lost in TRV-NSs L172R , but not in TRV-NSs S189R . Therefore, we propose dual roles of NSs in RNA silencing suppression and induction of cell death, controlled by different motifs. Copyright © 2017 Elsevier Inc. All rights reserved.

Identification of sequence motifs significantly associated with antisense activity

Directory of Open Access Journals (Sweden)

Peek Andrew S

2007-06-01

Full Text Available Abstract Background Predicting the suppression activity of antisense oligonucleotide sequences is the main goal of the rational design of nucleic acids. To create an effective predictive model, it is important to know what properties of an oligonucleotide sequence associate significantly with antisense activity. Also, for the model to be efficient we must know what properties do not associate significantly and can be omitted from the model. This paper will discuss the results of a randomization procedure to find motifs that associate significantly with either high or low antisense suppression activity, analysis of their properties, as well as the results of support vector machine modelling using these significant motifs as features. Results We discovered 155 motifs that associate significantly with high antisense suppression activity and 202 motifs that associate significantly with low suppression activity. The motifs range in length from 2 to 5 bases, contain several motifs that have been previously discovered as associating highly with antisense activity, and have thermodynamic properties consistent with previous work associating thermodynamic properties of sequences with their antisense activity. Statistical analysis revealed no correlation between a motif's position within an antisense sequence and that sequences antisense activity. Also, many significant motifs existed as subwords of other significant motifs. Support vector regression experiments indicated that the feature set of significant motifs increased correlation compared to all possible motifs as well as several subsets of the significant motifs. Conclusion The thermodynamic properties of the significantly associated motifs support existing data correlating the thermodynamic properties of the antisense oligonucleotide with antisense efficiency, reinforcing our hypothesis that antisense suppression is strongly associated with probe/target thermodynamics, as there are no enzymatic

Control of collective network chaos.

Science.gov (United States)

Wagemakers, Alexandre; Barreto, Ernest; Sanjuán, Miguel A F; So, Paul

2014-06-01

Under certain conditions, the collective behavior of a large globally-coupled heterogeneous network of coupled oscillators, as quantified by the macroscopic mean field or order parameter, can exhibit low-dimensional chaotic behavior. Recent advances describe how a small set of "reduced" ordinary differential equations can be derived that captures this mean field behavior. Here, we show that chaos control algorithms designed using the reduced equations can be successfully applied to imperfect realizations of the full network. To systematically study the effectiveness of this technique, we measure the quality of control as we relax conditions that are required for the strict accuracy of the reduced equations, and hence, the controller. Although the effects are network-dependent, we show that the method is effective for surprisingly small networks, for modest departures from global coupling, and even with mild inaccuracy in the estimate of network heterogeneity.

Stabilization of model-based networked control systems

Energy Technology Data Exchange (ETDEWEB)

Miranda, Francisco [CIDMA, Universidade de Aveiro, Aveiro (Portugal); Instituto Politécnico de Viana do Castelo, Viana do Castelo (Portugal); Abreu, Carlos [Instituto Politécnico de Viana do Castelo, Viana do Castelo (Portugal); CMEMS-UMINHO, Universidade do Minho, Braga (Portugal); Mendes, Paulo M. [CMEMS-UMINHO, Universidade do Minho, Braga (Portugal)

2016-06-08

A class of networked control systems called Model-Based Networked Control Systems (MB-NCSs) is considered. Stabilization of MB-NCSs is studied using feedback controls and simulation of stabilization for different feedbacks is made with the purpose to reduce the network trafic. The feedback control input is applied in a compensated model of the plant that approximates the plant dynamics and stabilizes the plant even under slow network conditions. Conditions for global exponential stabilizability and for the choosing of a feedback control input for a given constant time between the information moments of the network are derived. An optimal control problem to obtain an optimal feedback control is also presented.

Robust network topologies for generating switch-like cellular responses.

Directory of Open Access Journals (Sweden)

Najaf A Shah

2011-06-01

Full Text Available Signaling networks that convert graded stimuli into binary, all-or-none cellular responses are critical in processes ranging from cell-cycle control to lineage commitment. To exhaustively enumerate topologies that exhibit this switch-like behavior, we simulated all possible two- and three-component networks on random parameter sets, and assessed the resulting response profiles for both steepness (ultrasensitivity and extent of memory (bistability. Simulations were used to study purely enzymatic networks, purely transcriptional networks, and hybrid enzymatic/transcriptional networks, and the topologies in each class were rank ordered by parametric robustness (i.e., the percentage of applied parameter sets exhibiting ultrasensitivity or bistability. Results reveal that the distribution of network robustness is highly skewed, with the most robust topologies clustering into a small number of motifs. Hybrid networks are the most robust in generating ultrasensitivity (up to 28% and bistability (up to 18%; strikingly, a purely transcriptional framework is the most fragile in generating either ultrasensitive (up to 3% or bistable (up to 1% responses. The disparity in robustness among the network classes is due in part to zero-order ultrasensitivity, an enzyme-specific phenomenon, which repeatedly emerges as a particularly robust mechanism for generating nonlinearity and can act as a building block for switch-like responses. We also highlight experimentally studied examples of topologies enabling switching behavior, in both native and synthetic systems, that rank highly in our simulations. This unbiased approach for identifying topologies capable of a given response may be useful in discovering new natural motifs and in designing robust synthetic gene networks.

Network Access Control For Dummies

CERN Document Server

Kelley, Jay; Wessels, Denzil

2009-01-01

Network access control (NAC) is how you manage network security when your employees, partners, and guests need to access your network using laptops and mobile devices. Network Access Control For Dummies is where you learn how NAC works, how to implement a program, and how to take real-world challenges in stride. You'll learn how to deploy and maintain NAC in your environment, identify and apply NAC standards, and extend NAC for greater network security. Along the way you'll become familiar with what NAC is (and what it isn't) as well as the key business drivers for deploying NAC.Learn the step

Analisis Unsur Matematika pada Motif Sulam Usus

Directory of Open Access Journals (Sweden)

Fredi Ganda Putra

2017-12-01

Full Text Available Based on interviews with researchers sources said that the beginning of the intestine embroidery is an art of genuine crafts. Called the intestine embroidery because this technique is a technique of combining a strand of cloth resembling the intestine formed according to the pattern by means of embroidered using a thread. Intestinal embroidery techniques were originally used to create a cover of the women's customary wardrobe of Lampung or often referred to as bebe. But not many people in Lampung, especially people who live in Lampung are still many who do not know and recognize the intestine embroidery because most only know tapis only characteristic of Lampung, besides that there are other cultural results that is embroidered intestine. There are still many who do not know that the intestine motif there is a knowledge of mathematics. The researcher's problem formulation is whether there are mathematical elements contained in the intestine embroidery motif based on the concept of geometry. The purpose of this study is to determine whether there are elements of mathematics contained in the intestine motif based on the concept of geometry. Subjects in this study consisted of 4 people obtained by purposive sampling technique. From the results of data analysis conducted by using descriptive analysis and discussion as follows: (1 Intestinal embroidery motif contains the meaning of mathematics and culture or often called Etnomatematika. On the meaning of culture there is a link between the embroidery intestine with a culture that has been there before as the existence of cultural linkage between Hindu belief Buddhism and there are similarities of motifs and decorative patterns contained in the motif embroidery intestine with ornamental variety in Indonesia. (2 The relationship between the intestine with mathematical motifs there are elements of mathematics such as geometry elements in the form of geometry of dimension one and dimension two, and the

Hierarchical structure and modules in the Escherichia coli transcriptional regulatory network revealed by a new top-down approach

Directory of Open Access Journals (Sweden)

Buer Jan

2004-12-01

Full Text Available Abstract Background Cellular functions are coordinately carried out by groups of genes forming functional modules. Identifying such modules in the transcriptional regulatory network (TRN of organisms is important for understanding the structure and function of these fundamental cellular networks and essential for the emerging modular biology. So far, the global connectivity structure of TRN has not been well studied and consequently not applied for the identification of functional modules. Moreover, network motifs such as feed forward loop are recently proposed to be basic building blocks of TRN. However, their relationship to functional modules is not clear. Results In this work we proposed a top-down approach to identify modules in the TRN of E. coli. By studying the global connectivity structure of the regulatory network, we first revealed a five-layer hierarchical structure in which all the regulatory relationships are downward. Based on this regulatory hierarchy, we developed a new method to decompose the regulatory network into functional modules and to identify global regulators governing multiple modules. As a result, 10 global regulators and 39 modules were identified and shown to have well defined functions. We then investigated the distribution and composition of the two basic network motifs (feed forward loop and bi-fan motif in the hierarchical structure of TRN. We found that most of these network motifs include global regulators, indicating that these motifs are not basic building blocks of modules since modules should not contain global regulators. Conclusion The transcriptional regulatory network of E. coli possesses a multi-layer hierarchical modular structure without feedback regulation at transcription level. This hierarchical structure builds the basis for a new and simple decomposition method which is suitable for the identification of functional modules and global regulators in the transcriptional regulatory network of E

Pinning Control Strategy of Multicommunity Structure Networks

Directory of Open Access Journals (Sweden)

Chao Ding

2017-01-01

Full Text Available In order to investigate the effects of community structure on synchronization, a pinning control strategy is researched in a class of complex networks with community structure in this paper. A feedback control law is designed based on the network community structure information. The stability condition is given and proved by using Lyapunov stability theory. Our research shows that as to community structure networks, there being a threshold hT≈5, when coupling strength bellows this threshold, the stronger coupling strength corresponds to higher synchronizability; vice versa, the stronger coupling strength brings lower synchronizability. In addition the synchronizability of overlapping and nonoverlapping community structure networks was simulated and analyzed; while the nodes were controlled randomly and intensively, the results show that intensive control strategy is better than the random one. The network will reach synchronization easily when the node with largest betweenness was controlled. Furthermore, four difference networks’ synchronizability, such as Barabási-Albert network, Watts-Strogatz network, Erdös-Rényi network, and community structure network, are simulated; the research shows that the community structure network is more easily synchronized under the same control strength.

Genetic interaction motif finding by expectation maximization – a novel statistical model for inferring gene modules from synthetic lethality

Directory of Open Access Journals (Sweden)

Ye Ping

2005-12-01

Full Text Available Abstract Background Synthetic lethality experiments identify pairs of genes with complementary function. More direct functional associations (for example greater probability of membership in a single protein complex may be inferred between genes that share synthetic lethal interaction partners than genes that are directly synthetic lethal. Probabilistic algorithms that identify gene modules based on motif discovery are highly appropriate for the analysis of synthetic lethal genetic interaction data and have great potential in integrative analysis of heterogeneous datasets. Results We have developed Genetic Interaction Motif Finding (GIMF, an algorithm for unsupervised motif discovery from synthetic lethal interaction data. Interaction motifs are characterized by position weight matrices and optimized through expectation maximization. Given a seed gene, GIMF performs a nonlinear transform on the input genetic interaction data and automatically assigns genes to the motif or non-motif category. We demonstrate the capacity to extract known and novel pathways for Saccharomyces cerevisiae (budding yeast. Annotations suggested for several uncharacterized genes are supported by recent experimental evidence. GIMF is efficient in computation, requires no training and automatically down-weights promiscuous genes with high degrees. Conclusion GIMF effectively identifies pathways from synthetic lethality data with several unique features. It is mostly suitable for building gene modules around seed genes. Optimal choice of one single model parameter allows construction of gene networks with different levels of confidence. The impact of hub genes the generic probabilistic framework of GIMF may be used to group other types of biological entities such as proteins based on stochastic motifs. Analysis of the strongest motifs discovered by the algorithm indicates that synthetic lethal interactions are depleted between genes within a motif, suggesting that synthetic

Dynamic Frequency Control in Power Networks

OpenAIRE

Zhao, Changhong; Mallada Garcia, Enrique; Low, Steven H.

2016-01-01

Node controllers in power distribution networks in accordance with embodiments of the invention enable dynamic frequency control. One embodiment includes a node controller comprising a network interface a processor; and a memory containing a frequency control application; and a plurality of node operating parameters describing the operating parameters of a node, where the node is selected from a group consisting of at least one generator node in a power distribution network wherein the proces...

Transcription regulatory networks analysis using CAGE

KAUST Repository

Tegnér, Jesper N.

2009-10-01

Mapping out cellular networks in general and transcriptional networks in particular has proved to be a bottle-neck hampering our understanding of biological processes. Integrative approaches fusing computational and experimental technologies for decoding transcriptional networks at a high level of resolution is therefore of uttermost importance. Yet, this is challenging since the control of gene expression in eukaryotes is a complex multi-level process influenced by several epigenetic factors and the fine interplay between regulatory proteins and the promoter structure governing the combinatorial regulation of gene expression. In this chapter we review how the CAGE data can be integrated with other measurements such as expression, physical interactions and computational prediction of regulatory motifs, which together can provide a genome-wide picture of eukaryotic transcriptional regulatory networks at a new level of resolution. © 2010 by Pan Stanford Publishing Pte. Ltd. All rights reserved.

Neural network-based nonlinear model predictive control vs. linear quadratic gaussian control

Science.gov (United States)

Cho, C.; Vance, R.; Mardi, N.; Qian, Z.; Prisbrey, K.

1997-01-01

One problem with the application of neural networks to the multivariable control of mineral and extractive processes is determining whether and how to use them. The objective of this investigation was to compare neural network control to more conventional strategies and to determine if there are any advantages in using neural network control in terms of set-point tracking, rise time, settling time, disturbance rejection and other criteria. The procedure involved developing neural network controllers using both historical plant data and simulation models. Various control patterns were tried, including both inverse and direct neural network plant models. These were compared to state space controllers that are, by nature, linear. For grinding and leaching circuits, a nonlinear neural network-based model predictive control strategy was superior to a state space-based linear quadratic gaussian controller. The investigation pointed out the importance of incorporating state space into neural networks by making them recurrent, i.e., feeding certain output state variables into input nodes in the neural network. It was concluded that neural network controllers can have better disturbance rejection, set-point tracking, rise time, settling time and lower set-point overshoot, and it was also concluded that neural network controllers can be more reliable and easy to implement in complex, multivariable plants.

Virtualized Network Control (VNC)

Energy Technology Data Exchange (ETDEWEB)

Lehman, Thomas [Univ. of Southern California, Los Angeles, CA (United States); Guok, Chin [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Ghani, Nasir [Univ. of New Mexico, Albuquerque, NM (United States)

2013-01-31

The focus of this project was on the development of a "Network Service Plane" as an abstraction model for the control and provisioning of multi-layer networks. The primary motivation for this work were the requirements of next generation networked applications which will need to access advanced networking as a first class resource at the same level as compute and storage resources. A new class of "Intelligent Network Services" were defined in order to facilitate the integration of advanced network services into application specific workflows. This new class of network services are intended to enable real-time interaction between the application co-scheduling algorithms and the network for the purposes of workflow planning, real-time resource availability identification, scheduling, and provisioning actions.

Distributed controller clustering in software defined networks.

Directory of Open Access Journals (Sweden)

Ahmed Abdelaziz

Full Text Available Software Defined Networking (SDN is an emerging promising paradigm for network management because of its centralized network intelligence. However, the centralized control architecture of the software-defined networks (SDNs brings novel challenges of reliability, scalability, fault tolerance and interoperability. In this paper, we proposed a novel clustered distributed controller architecture in the real setting of SDNs. The distributed cluster implementation comprises of multiple popular SDN controllers. The proposed mechanism is evaluated using a real world network topology running on top of an emulated SDN environment. The result shows that the proposed distributed controller clustering mechanism is able to significantly reduce the average latency from 8.1% to 1.6%, the packet loss from 5.22% to 4.15%, compared to distributed controller without clustering running on HP Virtual Application Network (VAN SDN and Open Network Operating System (ONOS controllers respectively. Moreover, proposed method also shows reasonable CPU utilization results. Furthermore, the proposed mechanism makes possible to handle unexpected load fluctuations while maintaining a continuous network operation, even when there is a controller failure. The paper is a potential contribution stepping towards addressing the issues of reliability, scalability, fault tolerance, and inter-operability.

Distributed controller clustering in software defined networks.

Science.gov (United States)

Abdelaziz, Ahmed; Fong, Ang Tan; Gani, Abdullah; Garba, Usman; Khan, Suleman; Akhunzada, Adnan; Talebian, Hamid; Choo, Kim-Kwang Raymond

2017-01-01

Software Defined Networking (SDN) is an emerging promising paradigm for network management because of its centralized network intelligence. However, the centralized control architecture of the software-defined networks (SDNs) brings novel challenges of reliability, scalability, fault tolerance and interoperability. In this paper, we proposed a novel clustered distributed controller architecture in the real setting of SDNs. The distributed cluster implementation comprises of multiple popular SDN controllers. The proposed mechanism is evaluated using a real world network topology running on top of an emulated SDN environment. The result shows that the proposed distributed controller clustering mechanism is able to significantly reduce the average latency from 8.1% to 1.6%, the packet loss from 5.22% to 4.15%, compared to distributed controller without clustering running on HP Virtual Application Network (VAN) SDN and Open Network Operating System (ONOS) controllers respectively. Moreover, proposed method also shows reasonable CPU utilization results. Furthermore, the proposed mechanism makes possible to handle unexpected load fluctuations while maintaining a continuous network operation, even when there is a controller failure. The paper is a potential contribution stepping towards addressing the issues of reliability, scalability, fault tolerance, and inter-operability.

Pinning impulsive control algorithms for complex network

Energy Technology Data Exchange (ETDEWEB)

Sun, Wen [School of Information and Mathematics, Yangtze University, Jingzhou 434023 (China); Lü, Jinhu [Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China); Chen, Shihua [College of Mathematics and Statistics, Wuhan University, Wuhan 430072 (China); Yu, Xinghuo [School of Electrical and Computer Engineering, RMIT University, Melbourne VIC 3001 (Australia)

2014-03-15

In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms.

Pinning impulsive control algorithms for complex network

International Nuclear Information System (INIS)

Sun, Wen; Lü, Jinhu; Chen, Shihua; Yu, Xinghuo

2014-01-01

In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms

Communication and control for networked complex systems

CERN Document Server

Peng, Chen; Han, Qing-Long

2015-01-01

This book reports on the latest advances in the study of Networked Control Systems (NCSs). It highlights novel research concepts on NCSs; the analysis and synthesis of NCSs with special attention to their networked character; self- and event-triggered communication schemes for conserving limited network resources; and communication and control co-design for improving the efficiency of NCSs. The book will be of interest to university researchers, control and network engineers, and graduate students in the control engineering, communication and network sciences interested in learning the core principles, methods, algorithms and applications of NCSs.

Neural Networks in Control Applications

DEFF Research Database (Denmark)

Sørensen, O.

are examined. The models are separated into three groups representing input/output descriptions as well as state space descriptions: - Models, where all in- and outputs are measurable (static networks). - Models, where some inputs are non-measurable (recurrent networks). - Models, where some in- and some...... outputs are non-measurable (recurrent networks with incomplete state information). The three groups are ordered in increasing complexity, and for each group it is shown how to solve the problems concerning training and application of the specific model type. Of particular interest are the model types...... Kalmann filter) representing state space description. The potentials of neural networks for control of non-linear processes are also examined, focusing on three different groups of control concepts, all considered as generalizations of known linear control concepts to handle also non-linear processes...

Direct AUC optimization of regulatory motifs.

Science.gov (United States)

Zhu, Lin; Zhang, Hong-Bo; Huang, De-Shuang

2017-07-15

The discovery of transcription factor binding site (TFBS) motifs is essential for untangling the complex mechanism of genetic variation under different developmental and environmental conditions. Among the huge amount of computational approaches for de novo identification of TFBS motifs, discriminative motif learning (DML) methods have been proven to be promising for harnessing the discovery power of accumulated huge amount of high-throughput binding data. However, they have to sacrifice accuracy for speed and could fail to fully utilize the information of the input sequences. We propose a novel algorithm called CDAUC for optimizing DML-learned motifs based on the area under the receiver-operating characteristic curve (AUC) criterion, which has been widely used in the literature to evaluate the significance of extracted motifs. We show that when the considered AUC loss function is optimized in a coordinate-wise manner, the cost function of each resultant sub-problem is a piece-wise constant function, whose optimal value can be found exactly and efficiently. Further, a key step of each iteration of CDAUC can be efficiently solved as a computational geometry problem. Experimental results on real world high-throughput datasets illustrate that CDAUC outperforms competing methods for refining DML motifs, while being one order of magnitude faster. Meanwhile, preliminary results also show that CDAUC may also be useful for improving the interpretability of convolutional kernels generated by the emerging deep learning approaches for predicting TF sequences specificities. CDAUC is available at: https://drive.google.com/drive/folders/0BxOW5MtIZbJjNFpCeHlBVWJHeW8 . dshuang@tongji.edu.cn. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

MPC control of water supply networks

DEFF Research Database (Denmark)

Baunsgaard, Kenneth Marx Hoe; Ravn, Ole; Kallesoe, Carsten Skovmose

2016-01-01

This paper investigates the modelling and predictive control of a drinking water supply network with the aim of minimising the energy and economic cost. A model predictive controller, MPC, is applied to a nonlinear model of a drinking water network that follows certain constraints to maintain......, controlling the drinking water supply network with the MPC showed reduction of the energy and the economic cost of running the system. This has been achieved by minimising actuator control effort and by shifting the actuator use towards the night time, where energy prices are lower. Along with energy cost...... consumer pressure desire. A model predictive controller, MPC, is based on a simple model that models the main characteristics of a water distribution network, optimizes a desired cost minimisation, and keeps the system inside specified constraints. In comparison to a logic (on/off) control design...

Neural Networks in Control Applications

DEFF Research Database (Denmark)

Sørensen, O.

The intention of this report is to make a systematic examination of the possibilities of applying neural networks in those technical areas, which are familiar to a control engineer. In other words, the potential of neural networks in control applications is given higher priority than a detailed...... study of the networks themselves. With this end in view the following restrictions have been made: - Amongst numerous neural network structures, only the Multi Layer Perceptron (a feed-forward network) is applied. - Amongst numerous training algorithms, only four algorithms are examined, all...... in a recursive form (sample updating). The simplest is the Back Probagation Error Algorithm, and the most complex is the recursive Prediction Error Method using a Gauss-Newton search direction. - Over-fitting is often considered to be a serious problem when training neural networks. This problem is specifically...

Genome-wide targeted prediction of ABA responsive genes in rice based on over-represented cis-motif in co-expressed genes.

Science.gov (United States)

Lenka, Sangram K; Lohia, Bikash; Kumar, Abhay; Chinnusamy, Viswanathan; Bansal, Kailash C

2009-02-01

Abscisic acid (ABA), the popular plant stress hormone, plays a key role in regulation of sub-set of stress responsive genes. These genes respond to ABA through specific transcription factors which bind to cis-regulatory elements present in their promoters. We discovered the ABA Responsive Element (ABRE) core (ACGT) containing CGMCACGTGB motif as over-represented motif among the promoters of ABA responsive co-expressed genes in rice. Targeted gene prediction strategy using this motif led to the identification of 402 protein coding genes potentially regulated by ABA-dependent molecular genetic network. RT-PCR analysis of arbitrarily chosen 45 genes from the predicted 402 genes confirmed 80% accuracy of our prediction. Plant Gene Ontology (GO) analysis of ABA responsive genes showed enrichment of signal transduction and stress related genes among diverse functional categories.

Enabling Controlling Complex Networks with Local Topological Information.

Science.gov (United States)

Li, Guoqi; Deng, Lei; Xiao, Gaoxi; Tang, Pei; Wen, Changyun; Hu, Wuhua; Pei, Jing; Shi, Luping; Stanley, H Eugene

2018-03-15

Complex networks characterize the nature of internal/external interactions in real-world systems including social, economic, biological, ecological, and technological networks. Two issues keep as obstacles to fulfilling control of large-scale networks: structural controllability which describes the ability to guide a dynamical system from any initial state to any desired final state in finite time, with a suitable choice of inputs; and optimal control, which is a typical control approach to minimize the cost for driving the network to a predefined state with a given number of control inputs. For large complex networks without global information of network topology, both problems remain essentially open. Here we combine graph theory and control theory for tackling the two problems in one go, using only local network topology information. For the structural controllability problem, a distributed local-game matching method is proposed, where every node plays a simple Bayesian game with local information and local interactions with adjacent nodes, ensuring a suboptimal solution at a linear complexity. Starring from any structural controllability solution, a minimizing longest control path method can efficiently reach a good solution for the optimal control in large networks. Our results provide solutions for distributed complex network control and demonstrate a way to link the structural controllability and optimal control together.

Adaptive optimization and control using neural networks

Energy Technology Data Exchange (ETDEWEB)

Mead, W.C.; Brown, S.K.; Jones, R.D.; Bowling, P.S.; Barnes, C.W.

1993-10-22

Recent work has demonstrated the ability of neural-network-based controllers to optimize and control machines with complex, non-linear, relatively unknown control spaces. We present a brief overview of neural networks via a taxonomy illustrating some capabilities of different kinds of neural networks. We present some successful control examples, particularly the optimization and control of a small-angle negative ion source.

Wireless sensor network topology control

OpenAIRE

Zuk, Olexandr; Romanjuk, Valeriy; Sova, Oleg

2010-01-01

Topology control process for the wireless sensor network is considered. In this article the use of rule base for making decision on the search of optimum network topology is offered for the realization of different aims of network management.

Simplified LQG Control with Neural Networks

DEFF Research Database (Denmark)

Sørensen, O.

1997-01-01

A new neural network application for non-linear state control is described. One neural network is modelled to form a Kalmann predictor and trained to act as an optimal state observer for a non-linear process. Another neural network is modelled to form a state controller and trained to produce...

Efficient motif finding algorithms for large-alphabet inputs

Directory of Open Access Journals (Sweden)

Pavlovic Vladimir

2010-10-01

Full Text Available Abstract Background We consider the problem of identifying motifs, recurring or conserved patterns, in the biological sequence data sets. To solve this task, we present a new deterministic algorithm for finding patterns that are embedded as exact or inexact instances in all or most of the input strings. Results The proposed algorithm (1 improves search efficiency compared to existing algorithms, and (2 scales well with the size of alphabet. On a synthetic planted DNA motif finding problem our algorithm is over 10× more efficient than MITRA, PMSPrune, and RISOTTO for long motifs. Improvements are orders of magnitude higher in the same setting with large alphabets. On benchmark TF-binding site problems (FNP, CRP, LexA we observed reduction in running time of over 12×, with high detection accuracy. The algorithm was also successful in rapidly identifying protein motifs in Lipocalin, Zinc metallopeptidase, and supersecondary structure motifs for Cadherin and Immunoglobin families. Conclusions Our algorithm reduces computational complexity of the current motif finding algorithms and demonstrate strong running time improvements over existing exact algorithms, especially in important and difficult cases of large-alphabet sequences.

Control range: a controllability-based index for node significance in directed networks

International Nuclear Information System (INIS)

Wang, Bingbo; Gao, Lin; Gao, Yong

2012-01-01

While a large number of methods for module detection have been developed for undirected networks, it is difficult to adapt them to handle directed networks due to the lack of consensus criteria for measuring the node significance in a directed network. In this paper, we propose a novel structural index, the control range, motivated by recent studies on the structural controllability of large-scale directed networks. The control range of a node quantifies the size of the subnetwork that the node can effectively control. A related index, called the control range similarity, is also introduced to measure the structural similarity between two nodes. When applying the index of control range to several real-world and synthetic directed networks, it is observed that the control range of the nodes is mainly influenced by the network's degree distribution and that nodes with a low degree may have a high control range. We use the index of control range similarity to detect and analyze functional modules in glossary networks and the enzyme-centric network of homo sapiens. Our results, as compared with other approaches to module detection such as modularity optimization algorithm, dynamic algorithm and clique percolation method, indicate that the proposed indices are effective and practical in depicting structural and modular characteristics of sparse directed networks

Filtering and control of wireless networked systems

CERN Document Server

Zhang, Dan; Yu, Li

2017-01-01

This self-contained book, written by leading experts, offers a cutting-edge, in-depth overview of the filtering and control of wireless networked systems. It addresses the energy constraint and filter/controller gain variation problems, and presents both the centralized and the distributed solutions. The first two chapters provide an introduction to networked control systems and basic information on system analysis. Chapters (3–6) then discuss the centralized filtering of wireless networked systems, presenting different approaches to deal with energy efficiency and filter/controller gain variation problems. The next part (chapters 7–10) explores the distributed filtering of wireless networked systems, addressing the main problems of energy constraint and filter gain variation. The final part (chapters 11–14) focuses on the distributed control of wireless networked systems. networked systems for communication and control applications, the bo...

Guaranteed Cost Fault-Tolerant Control for Networked Control Systems with Sensor Faults

Directory of Open Access Journals (Sweden)

Qixin Zhu

2015-01-01

Full Text Available For the large scale and complicated structure of networked control systems, time-varying sensor faults could inevitably occur when the system works in a poor environment. Guaranteed cost fault-tolerant controller for the new networked control systems with time-varying sensor faults is designed in this paper. Based on time delay of the network transmission environment, the networked control systems with sensor faults are modeled as a discrete-time system with uncertain parameters. And the model of networked control systems is related to the boundary values of the sensor faults. Moreover, using Lyapunov stability theory and linear matrix inequalities (LMI approach, the guaranteed cost fault-tolerant controller is verified to render such networked control systems asymptotically stable. Finally, simulations are included to demonstrate the theoretical results.

Tuning structural motifs and alloying of bulk immiscible Mo-Cu bimetallic nanoparticles by gas-phase synthesis

Science.gov (United States)

Krishnan, Gopi; Verheijen, Marcel A.; Ten Brink, Gert H.; Palasantzas, George; Kooi, Bart J.

2013-05-01

Nowadays bimetallic nanoparticles (NPs) have emerged as key materials for important modern applications in nanoplasmonics, catalysis, biodiagnostics, and nanomagnetics. Consequently the control of bimetallic structural motifs with specific shapes provides increasing functionality and selectivity for related applications. However, producing bimetallic NPs with well controlled structural motifs still remains a formidable challenge. Hence, we present here a general methodology for gas phase synthesis of bimetallic NPs with distinctively different structural motifs ranging at a single particle level from a fully mixed alloy to core-shell, to onion (multi-shell), and finally to a Janus/dumbbell, with the same overall particle composition. These concepts are illustrated for Mo-Cu NPs, where the precise control of the bimetallic NPs with various degrees of chemical ordering, including different shapes from spherical to cube, is achieved by tailoring the energy and thermal environment that the NPs experience during their production. The initial state of NP growth, either in the liquid or in the solid state phase, has important implications for the different structural motifs and shapes of synthesized NPs. Finally we demonstrate that we are able to tune the alloying regime, for the otherwise bulk immiscible Mo-Cu, by achieving an increase of the critical size, below which alloying occurs, closely up to an order of magnitude. It is discovered that the critical size of the NP alloy is not only affected by controlled tuning of the alloying temperature but also by the particle shape.Nowadays bimetallic nanoparticles (NPs) have emerged as key materials for important modern applications in nanoplasmonics, catalysis, biodiagnostics, and nanomagnetics. Consequently the control of bimetallic structural motifs with specific shapes provides increasing functionality and selectivity for related applications. However, producing bimetallic NPs with well controlled structural motifs still

A framework to find the logic backbone of a biological network.

Science.gov (United States)

Maheshwari, Parul; Albert, Réka

2017-12-06

Cellular behaviors are governed by interaction networks among biomolecules, for example gene regulatory and signal transduction networks. An often used dynamic modeling framework for these networks, Boolean modeling, can obtain their attractors (which correspond to cell types and behaviors) and their trajectories from an initial state (e.g. a resting state) to the attractors, for example in response to an external signal. The existing methods however do not elucidate the causal relationships between distant nodes in the network. In this work, we propose a simple logic framework, based on categorizing causal relationships as sufficient or necessary, as a complement to Boolean networks. We identify and explore the properties of complex subnetworks that are distillable into a single logic relationship. We also identify cyclic subnetworks that ensure the stabilization of the state of participating nodes regardless of the rest of the network. We identify the logic backbone of biomolecular networks, consisting of external signals, self-sustaining cyclic subnetworks (stable motifs), and output nodes. Furthermore, we use the logic framework to identify crucial nodes whose override can drive the system from one steady state to another. We apply these techniques to two biological networks: the epithelial-to-mesenchymal transition network corresponding to a developmental process exploited in tumor invasion, and the network of abscisic acid induced stomatal closure in plants. We find interesting subnetworks with logical implications in these networks. Using these subgraphs and motifs, we efficiently reduce both networks to succinct backbone structures. The logic representation identifies the causal relationships between distant nodes and subnetworks. This knowledge can form the basis of network control or used in the reverse engineering of networks.

Discovery of candidate KEN-box motifs using cell cycle keyword enrichment combined with native disorder prediction and motif conservation.

Science.gov (United States)

Michael, Sushama; Travé, Gilles; Ramu, Chenna; Chica, Claudia; Gibson, Toby J

2008-02-15

KEN-box-mediated target selection is one of the mechanisms used in the proteasomal destruction of mitotic cell cycle proteins via the APC/C complex. While annotating the Eukaryotic Linear Motif resource (ELM, http://elm.eu.org/), we found that KEN motifs were significantly enriched in human protein entries with cell cycle keywords in the UniProt/Swiss-Prot database-implying that KEN-boxes might be more common than reported. Matches to short linear motifs in protein database searches are not, per se, significant. KEN-box enrichment with cell cycle Gene Ontology terms suggests that collectively these motifs are functional but does not prove that any given instance is so. Candidates were surveyed for native disorder prediction using GlobPlot and IUPred and for motif conservation in homologues. Among >25 strong new candidates, the most notable are human HIPK2, CHFR, CDC27, Dab2, Upf2, kinesin Eg5, DNA Topoisomerase 1 and yeast Cdc5 and Swi5. A similar number of weaker candidates were present. These proteins have yet to be tested for APC/C targeted destruction, providing potential new avenues of research.

Detecting Statistically Significant Communities of Triangle Motifs in Undirected Networks

Science.gov (United States)

2016-04-26

Systems, Statistics & Management Science, University of Alabama, USA. 1 DISTRIBUTION A: Distribution approved for public release. Contents 1 Summary 5...13 5 Application to Real Networks 18 5.1 2012 FBS Football Schedule Network... football schedule network. . . . . . . . . . . . . . . . . . . . . . 21 14 Stem plot of degree-ordered vertices versus the degree for college football

Infrastructure of Taiwan photon source control network

International Nuclear Information System (INIS)

Chang, Y.T.; Kuo, C.H.; Cheng, Y.S.; Jenny Chen; Hsu, S.Y.; Wu, C.Y.; Hu, K.H.; Hsu, K.T.

2012-01-01

A reliable, flexible and secure network is essential for the Taiwan Photon Source (TPS) control system which is based upon the EPICS tool-kit framework. Subsystem sub-nets will connect to control system via EPICS based CA gateways for forwarding data and reducing network traffic. Combining cyber security technologies such as fire-wall, NAT and VLAN, control network is isolated to protect IOCs and accelerator components. Network management tools are used to improve network performance. Remote access mechanism will be constructed for maintenance and troubleshooting. The Ethernet is also used as field-bus for instruments such as power supplies. This paper will describe the system architecture for the TPS control network. Cabling topology, redundancy and maintainability are also discussed. (authors)

Joint control algorithm in access network

Institute of Scientific and Technical Information of China (English)

2008-01-01

To deal with long probing delay and inaccurate probing results in the endpoint admission control method,a joint local and end-to-end admission control algorithm is proposed,which introduces local probing of access network besides end-to-end probing.Through local probing,the algorithm accurately estimated the resource status of the access network.Simulation shows that this algorithm can improve admission control performance and reduce users' average waiting time when the access network is heavily loaded.

Information and control in networks

CERN Document Server

Bernhardsson, Bo; Rantzer, Anders

2014-01-01

Information and Control in Networks demonstrates the way in which system dynamics and information flows intertwine as they evolve, and the central role played by information in the control of complex networked systems. It is a milestone on the road to that convergence from traditionally independent development of control theory and information theory which has emerged strongly in the last fifteen years, and is now a very active research field. In addition to efforts in control and information theory, the text is witness to strong research in such diverse fields as computer science, mathematics, and statistics. Aspects that are given specialist treatment include: ·                 data-rate theorems; ·                 computation and control over communication networks; ·                 decentralized stochastic control; ·                 Gaussian networks and Gaussian–Markov random fields; and ·                 routability ...

Control theory of digitally networked dynamic systems

CERN Document Server

Lunze, Jan

2013-01-01

The book gives an introduction to networked control systems and describes new modeling paradigms, analysis methods for event-driven, digitally networked systems, and design methods for distributed estimation and control. Networked model predictive control is developed as a means to tolerate time delays and packet loss brought about by the communication network. In event-based control the traditional periodic sampling is replaced by state-dependent triggering schemes. Novel methods for multi-agent systems ensure complete or clustered synchrony of agents with identical or with individual dynamic

Preserved Network Metrics across Translated Texts

Science.gov (United States)

Cabatbat, Josephine Jill T.; Monsanto, Jica P.; Tapang, Giovanni A.

2014-09-01

Co-occurrence language networks based on Bible translations and the Universal Declaration of Human Rights (UDHR) translations in different languages were constructed and compared with random text networks. Among the considered network metrics, the network size, N, the normalized betweenness centrality (BC), and the average k-nearest neighbors, knn, were found to be the most preserved across translations. Moreover, similar frequency distributions of co-occurring network motifs were observed for translated texts networks.

DNA motif alignment by evolving a population of Markov chains.

Science.gov (United States)

Bi, Chengpeng

2009-01-30

Deciphering cis-regulatory elements or de novo motif-finding in genomes still remains elusive although much algorithmic effort has been expended. The Markov chain Monte Carlo (MCMC) method such as Gibbs motif samplers has been widely employed to solve the de novo motif-finding problem through sequence local alignment. Nonetheless, the MCMC-based motif samplers still suffer from local maxima like EM. Therefore, as a prerequisite for finding good local alignments, these motif algorithms are often independently run a multitude of times, but without information exchange between different chains. Hence it would be worth a new algorithm design enabling such information exchange. This paper presents a novel motif-finding algorithm by evolving a population of Markov chains with information exchange (PMC), each of which is initialized as a random alignment and run by the Metropolis-Hastings sampler (MHS). It is progressively updated through a series of local alignments stochastically sampled. Explicitly, the PMC motif algorithm performs stochastic sampling as specified by a population-based proposal distribution rather than individual ones, and adaptively evolves the population as a whole towards a global maximum. The alignment information exchange is accomplished by taking advantage of the pooled motif site distributions. A distinct method for running multiple independent Markov chains (IMC) without information exchange, or dubbed as the IMC motif algorithm, is also devised to compare with its PMC counterpart. Experimental studies demonstrate that the performance could be improved if pooled information were used to run a population of motif samplers. The new PMC algorithm was able to improve the convergence and outperformed other popular algorithms tested using simulated and biological motif sequences.

On the Design of Energy Efficient Optical Networks with Software Defined Networking Control Across Core and Access Networks

DEFF Research Database (Denmark)

Wang, Jiayuan; Yan, Ying; Dittmann, Lars

2013-01-01

This paper presents a Software Defined Networking (SDN) control plane based on an overlay GMPLS control model. The SDN control platform manages optical core networks (WDM/DWDM networks) and the associated access networks (GPON networks), which makes it possible to gather global information...... and enable wider areas' energy efficiency networking. The energy related information of the networks and the types of the traffic flows are collected and utilized for the end-to-end QoS provision. Dynamic network simulation results show that by applying different routing algorithms according to the type...... of traffic in the core networks, the energy efficiency of the network is improved without compromising the quality of service....

Additive Feed Forward Control with Neural Networks

DEFF Research Database (Denmark)

Sørensen, O.

1999-01-01

This paper demonstrates a method to control a non-linear, multivariable, noisy process using trained neural networks. The basis for the method is a trained neural network controller acting as the inverse process model. A training method for obtaining such an inverse process model is applied....... A suitable 'shaped' (low-pass filtered) reference is used to overcome problems with excessive control action when using a controller acting as the inverse process model. The control concept is Additive Feed Forward Control, where the trained neural network controller, acting as the inverse process model......, is placed in a supplementary pure feed-forward path to an existing feedback controller. This concept benefits from the fact, that an existing, traditional designed, feedback controller can be retained without any modifications, and after training the connection of the neural network feed-forward controller...

DNA motif elucidation using belief propagation.

Science.gov (United States)

Wong, Ka-Chun; Chan, Tak-Ming; Peng, Chengbin; Li, Yue; Zhang, Zhaolei

2013-09-01

Protein-binding microarray (PBM) is a high-throughout platform that can measure the DNA-binding preference of a protein in a comprehensive and unbiased manner. A typical PBM experiment can measure binding signal intensities of a protein to all the possible DNA k-mers (k=8∼10); such comprehensive binding affinity data usually need to be reduced and represented as motif models before they can be further analyzed and applied. Since proteins can often bind to DNA in multiple modes, one of the major challenges is to decompose the comprehensive affinity data into multimodal motif representations. Here, we describe a new algorithm that uses Hidden Markov Models (HMMs) and can derive precise and multimodal motifs using belief propagations. We describe an HMM-based approach using belief propagations (kmerHMM), which accepts and preprocesses PBM probe raw data into median-binding intensities of individual k-mers. The k-mers are ranked and aligned for training an HMM as the underlying motif representation. Multiple motifs are then extracted from the HMM using belief propagations. Comparisons of kmerHMM with other leading methods on several data sets demonstrated its effectiveness and uniqueness. Especially, it achieved the best performance on more than half of the data sets. In addition, the multiple binding modes derived by kmerHMM are biologically meaningful and will be useful in interpreting other genome-wide data such as those generated from ChIP-seq. The executables and source codes are available at the authors' websites: e.g. http://www.cs.toronto.edu/∼wkc/kmerHMM.

DNA motif elucidation using belief propagation

KAUST Repository

Wong, Ka-Chun; Chan, Tak-Ming; Peng, Chengbin; Li, Yue; Zhang, Zhaolei

2013-01-01

Protein-binding microarray (PBM) is a high-throughout platform that can measure the DNA-binding preference of a protein in a comprehensive and unbiased manner. A typical PBM experiment can measure binding signal intensities of a protein to all the possible DNA k-mers (k = 8 ?10); such comprehensive binding affinity data usually need to be reduced and represented as motif models before they can be further analyzed and applied. Since proteins can often bind to DNA in multiple modes, one of the major challenges is to decompose the comprehensive affinity data into multimodal motif representations. Here, we describe a new algorithm that uses Hidden Markov Models (HMMs) and can derive precise and multimodal motifs using belief propagations. We describe an HMM-based approach using belief propagations (kmerHMM), which accepts and preprocesses PBM probe raw data into median-binding intensities of individual k-mers. The k-mers are ranked and aligned for training an HMM as the underlying motif representation. Multiple motifs are then extracted from the HMM using belief propagations. Comparisons of kmerHMM with other leading methods on several data sets demonstrated its effectiveness and uniqueness. Especially, it achieved the best performance on more than half of the data sets. In addition, the multiple binding modes derived by kmerHMM are biologically meaningful and will be useful in interpreting other genome-wide data such as those generated from ChIP-seq. The executables and source codes are available at the authors' websites: e.g. http://www.cs.toronto.edu/?wkc/kmerHMM. 2013 The Author(s).

DNA motif elucidation using belief propagation

KAUST Repository

Wong, Ka-Chun

2013-06-29

Protein-binding microarray (PBM) is a high-throughout platform that can measure the DNA-binding preference of a protein in a comprehensive and unbiased manner. A typical PBM experiment can measure binding signal intensities of a protein to all the possible DNA k-mers (k = 8 ?10); such comprehensive binding affinity data usually need to be reduced and represented as motif models before they can be further analyzed and applied. Since proteins can often bind to DNA in multiple modes, one of the major challenges is to decompose the comprehensive affinity data into multimodal motif representations. Here, we describe a new algorithm that uses Hidden Markov Models (HMMs) and can derive precise and multimodal motifs using belief propagations. We describe an HMM-based approach using belief propagations (kmerHMM), which accepts and preprocesses PBM probe raw data into median-binding intensities of individual k-mers. The k-mers are ranked and aligned for training an HMM as the underlying motif representation. Multiple motifs are then extracted from the HMM using belief propagations. Comparisons of kmerHMM with other leading methods on several data sets demonstrated its effectiveness and uniqueness. Especially, it achieved the best performance on more than half of the data sets. In addition, the multiple binding modes derived by kmerHMM are biologically meaningful and will be useful in interpreting other genome-wide data such as those generated from ChIP-seq. The executables and source codes are available at the authors\\' websites: e.g. http://www.cs.toronto.edu/?wkc/kmerHMM. 2013 The Author(s).

Microbial expression of proteins containing long repetitive Arg-Gly-Asp cell adhesive motifs created by overlap elongation PCR

International Nuclear Information System (INIS)

Kurihara, Hiroyuki; Shinkai, Masashige; Nagamune, Teruyuki

2004-01-01

We developed a novel method for creating repetitive DNA libraries using overlap elongation PCR, and prepared a DNA library encoding repetitive Arg-Gly-Asp (RGD) cell adhesive motifs. We obtained various length DNAs encoding repetitive RGD from a short monomer DNA (18 bp) after a thermal cyclic reaction without a DNA template for amplification, and isolated DNAs encoding 2, 21, and 43 repeats of the RGD motif. We cloned these DNAs into a protein expression vector and overexpressed them as thioredoxin fusion proteins: RGD2, RGD21, and RGD43, respectively. The solubility of RGD43 in water was low and it formed a fibrous precipitate in water. Scanning electron microscopy revealed that RGD43 formed a branched 3D-network structure in the solid state. To evaluate the function of the cell adhesive motifs in RGD43, mouse fibroblast cells were cultivated on the RGD43 scaffold. The fibroblast cells adhered to the RGD43 scaffold and extended long filopodia

Carrier ethernet network control plane based on the Next Generation Network

DEFF Research Database (Denmark)

Fu, Rong; Wang, Yanmeng; Berger, Michael Stubert

2008-01-01

This paper contributes on presenting a step towards the realization of Carrier Ethernet control plane based on the next generation network (NGN). Specifically, transport MPLS (T-MPLS) is taken as the transport technology in Carrier Ethernet. It begins with providing an overview of the evolving...... architecture of the next generation network (NGN). As an essential candidate among the NGN transport technologies, the definition of Carrier Ethernet (CE) is also introduced here. The second part of this paper depicts the contribution on the T-MPLS based Carrier Ethernet network with control plane based on NGN...... at illustrating the improvement of the Carrier Ethernet network with the NGN control plane....

The APS control system network upgrade

International Nuclear Information System (INIS)

Sidorowicz, K. v.; Leibfritz, D.; McDowell, W. P.

1999-01-01

When it was installed,the Advanced Photon Source (APS) control system network was at the state-of-the-art. Different aspects of the system have been reported at previous meetings [1,2]. As loads on the controls network have increased due to newer and faster workstations and front-end computers, we have found performance of the system declining and have implemented an upgraded network. There have been dramatic advances in networking hardware in the last several years. The upgraded APS controls network replaces the original FDDI backbone and shared Ethernet hubs with redundant gigabit uplinks and fully switched 10/100 Ethernet switches with backplane fabrics in excess of 20 Gbits/s (Gbps). The central collapsed backbone FDDI concentrator has been replaced with a Gigabit Ethernet switch with greater than 30 Gbps backplane fabric. Full redundancy of the system has been maintained. This paper will discuss this upgrade and include performance data and performance comparisons with the original network

2016 Network Games, Control, and Optimization Conference

CERN Document Server

Jimenez, Tania; Solan, Eilon

2017-01-01

This contributed volume offers a collection of papers presented at the 2016 Network Games, Control, and Optimization conference (NETGCOOP), held at the University of Avignon in France, November 23-25, 2016. These papers highlight the increasing importance of network control and optimization in many networking application domains, such as mobile and fixed access networks, computer networks, social networks, transportation networks, and, more recently, electricity grids and biological networks. Covering a wide variety of both theoretical and applied topics in the areas listed above, the authors explore several conceptual and algorithmic tools that are needed for efficient and robust control operation, performance optimization, and better understanding the relationships between entities that may be acting cooperatively or selfishly in uncertain and possibly adversarial environments. As such, this volume will be of interest to applied mathematicians, computer scientists, engineers, and researchers in other relate...

Software-Defined Congestion Control Algorithm for IP Networks

Directory of Open Access Journals (Sweden)

Yao Hu

2017-01-01

Full Text Available The rapid evolution of computer networks, increase in the number of Internet users, and popularity of multimedia applications have exacerbated the congestion control problem. Congestion control is a key factor in ensuring network stability and robustness. When the underlying network and flow information are unknown, the transmission control protocol (TCP must increase or reduce the size of the congestion window to adjust to the changes of traffic in the Internet Protocol (IP network. However, it is possible that a software-defined approach can relieve the network congestion problem more efficiently. This approach has the characteristic of centralized control and can obtain a global topology for unified network management. In this paper, we propose a software-defined congestion control (SDCC algorithm for an IP network. We consider the difference between TCP and the user datagram protocol (UDP and propose a new method to judge node congestion. We initially apply the congestion control mechanism in the congested nodes and then optimize the link utilization to control network congestion.

Multiple TPR motifs characterize the Fanconi anemia FANCG protein.

Science.gov (United States)

Blom, Eric; van de Vrugt, Henri J; de Vries, Yne; de Winter, Johan P; Arwert, Fré; Joenje, Hans

2004-01-05

The genome protection pathway that is defective in patients with Fanconi anemia (FA) is controlled by at least eight genes, including BRCA2. A key step in the pathway involves the monoubiquitylation of FANCD2, which critically depends on a multi-subunit nuclear 'core complex' of at least six FANC proteins (FANCA, -C, -E, -F, -G, and -L). Except for FANCL, which has WD40 repeats and a RING finger domain, no significant domain structure has so far been recognized in any of the core complex proteins. By using a homology search strategy comparing the human FANCG protein sequence with its ortholog sequences in Oryzias latipes (Japanese rice fish) and Danio rerio (zebrafish) we identified at least seven tetratricopeptide repeat motifs (TPRs) covering a major part of this protein. TPRs are degenerate 34-amino acid repeat motifs which function as scaffolds mediating protein-protein interactions, often found in multiprotein complexes. In four out of five TPR motifs tested (TPR1, -2, -5, and -6), targeted missense mutagenesis disrupting the motifs at the critical position 8 of each TPR caused complete or partial loss of FANCG function. Loss of function was evident from failure of the mutant proteins to complement the cellular FA phenotype in FA-G lymphoblasts, which was correlated with loss of binding to FANCA. Although the TPR4 mutant fully complemented the cells, it showed a reduced interaction with FANCA, suggesting that this TPR may also be of functional importance. The recognition of FANCG as a typical TPR protein predicts this protein to play a key role in the assembly and/or stabilization of the nuclear FA protein core complex.

Neural network-based model reference adaptive control system.

Science.gov (United States)

Patino, H D; Liu, D

2000-01-01

In this paper, an approach to model reference adaptive control based on neural networks is proposed and analyzed for a class of first-order continuous-time nonlinear dynamical systems. The controller structure can employ either a radial basis function network or a feedforward neural network to compensate adaptively the nonlinearities in the plant. A stable controller-parameter adjustment mechanism, which is determined using the Lyapunov theory, is constructed using a sigma-modification-type updating law. The evaluation of control error in terms of the neural network learning error is performed. That is, the control error converges asymptotically to a neighborhood of zero, whose size is evaluated and depends on the approximation error of the neural network. In the design and analysis of neural network-based control systems, it is important to take into account the neural network learning error and its influence on the control error of the plant. Simulation results showing the feasibility and performance of the proposed approach are given.

Parallel processing data network of master and slave transputers controlled by a serial control network

Science.gov (United States)

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.

Sequence motifs in MADS transcription factors responsible for specificity and diversification of protein-protein interaction.

Directory of Open Access Journals (Sweden)

Aalt D J van Dijk

Full Text Available Protein sequences encompass tertiary structures and contain information about specific molecular interactions, which in turn determine biological functions of proteins. Knowledge about how protein sequences define interaction specificity is largely missing, in particular for paralogous protein families with high sequence similarity, such as the plant MADS domain transcription factor family. In comparison to the situation in mammalian species, this important family of transcription regulators has expanded enormously in plant species and contains over 100 members in the model plant species Arabidopsis thaliana. Here, we provide insight into the mechanisms that determine protein-protein interaction specificity for the Arabidopsis MADS domain transcription factor family, using an integrated computational and experimental approach. Plant MADS proteins have highly similar amino acid sequences, but their dimerization patterns vary substantially. Our computational analysis uncovered small sequence regions that explain observed differences in dimerization patterns with reasonable accuracy. Furthermore, we show the usefulness of the method for prediction of MADS domain transcription factor interaction networks in other plant species. Introduction of mutations in the predicted interaction motifs demonstrated that single amino acid mutations can have a large effect and lead to loss or gain of specific interactions. In addition, various performed bioinformatics analyses shed light on the way evolution has shaped MADS domain transcription factor interaction specificity. Identified protein-protein interaction motifs appeared to be strongly conserved among orthologs, indicating their evolutionary importance. We also provide evidence that mutations in these motifs can be a source for sub- or neo-functionalization. The analyses presented here take us a step forward in understanding protein-protein interactions and the interplay between protein sequences and

Comprehensive human transcription factor binding site map for combinatory binding motifs discovery.

Directory of Open Access Journals (Sweden)

Arnoldo J Müller-Molina

Full Text Available To know the map between transcription factors (TFs and their binding sites is essential to reverse engineer the regulation process. Only about 10%-20% of the transcription factor binding motifs (TFBMs have been reported. This lack of data hinders understanding gene regulation. To address this drawback, we propose a computational method that exploits never used TF properties to discover the missing TFBMs and their sites in all human gene promoters. The method starts by predicting a dictionary of regulatory "DNA words." From this dictionary, it distills 4098 novel predictions. To disclose the crosstalk between motifs, an additional algorithm extracts TF combinatorial binding patterns creating a collection of TF regulatory syntactic rules. Using these rules, we narrowed down a list of 504 novel motifs that appear frequently in syntax patterns. We tested the predictions against 509 known motifs confirming that our system can reliably predict ab initio motifs with an accuracy of 81%-far higher than previous approaches. We found that on average, 90% of the discovered combinatorial binding patterns target at least 10 genes, suggesting that to control in an independent manner smaller gene sets, supplementary regulatory mechanisms are required. Additionally, we discovered that the new TFBMs and their combinatorial patterns convey biological meaning, targeting TFs and genes related to developmental functions. Thus, among all the possible available targets in the genome, the TFs tend to regulate other TFs and genes involved in developmental functions. We provide a comprehensive resource for regulation analysis that includes a dictionary of "DNA words," newly predicted motifs and their corresponding combinatorial patterns. Combinatorial patterns are a useful filter to discover TFBMs that play a major role in orchestrating other factors and thus, are likely to lock/unlock cellular functional clusters.

The LINKS motif zippers trans-acyltransferase polyketide synthase assembly lines into a biosynthetic megacomplex.

Science.gov (United States)

Gay, Darren C; Wagner, Drew T; Meinke, Jessica L; Zogzas, Charles E; Gay, Glen R; Keatinge-Clay, Adrian T

2016-03-01

Polyketides such as the clinically-valuable antibacterial agent mupirocin are constructed by architecturally-sophisticated assembly lines known as trans-acyltransferase polyketide synthases. Organelle-sized megacomplexes composed of several copies of trans-acyltransferase polyketide synthase assembly lines have been observed by others through transmission electron microscopy to be located at the Bacillus subtilis plasma membrane, where the synthesis and export of the antibacterial polyketide bacillaene takes place. In this work we analyze ten crystal structures of trans-acyltransferase polyketide synthases ketosynthase domains, seven of which are reported here for the first time, to characterize a motif capable of zippering assembly lines into a megacomplex. While each of the three-helix LINKS (Laterally-INteracting Ketosynthase Sequence) motifs is observed to similarly dock with a spatially-reversed copy of itself through hydrophobic and ionic interactions, the amino acid sequences of this motif are not conserved. Such a code is appropriate for mediating homotypic contacts between assembly lines to ensure the ordered self-assembly of a noncovalent, yet tightly-knit, enzymatic network. LINKS-mediated lateral interactions would also have the effect of bolstering the vertical association of the polypeptides that comprise a polyketide synthase assembly line. Copyright © 2015 Elsevier Inc. All rights reserved.

Hybrid DNA i-motif: Aminoethylprolyl-PNA (pC5) enhance the stability of DNA (dC5) i-motif structure.

Science.gov (United States)

Gade, Chandrasekhar Reddy; Sharma, Nagendra K

2017-12-15

This report describes the synthesis of C-rich sequence, cytosine pentamer, of aep-PNA and its biophysical studies for the formation of hybrid DNA:aep-PNAi-motif structure with DNA cytosine pentamer (dC 5 ) under acidic pH conditions. Herein, the CD/UV/NMR/ESI-Mass studies strongly support the formation of stable hybrid DNA i-motif structure with aep-PNA even near acidic conditions. Hence aep-PNA C-rich sequence cytosine could be considered as potential DNA i-motif stabilizing agents in vivo conditions. Copyright © 2017 Elsevier Ltd. All rights reserved.

Verification of the MOTIF code version 3.0

International Nuclear Information System (INIS)

Chan, T.; Guvanasen, V.; Nakka, B.W.; Reid, J.A.K.; Scheier, N.W.; Stanchell, F.W.

1996-12-01

As part of the Canadian Nuclear Fuel Waste Management Program (CNFWMP), AECL has developed a three-dimensional finite-element code, MOTIF (Model Of Transport In Fractured/ porous media), for detailed modelling of groundwater flow, heat transport and solute transport in a fractured rock mass. The code solves the transient and steady-state equations of groundwater flow, solute (including one-species radionuclide) transport, and heat transport in variably saturated fractured/porous media. The initial development was completed in 1985 (Guvanasen 1985) and version 3.0 was completed in 1986. This version is documented in detail in Guvanasen and Chan (in preparation). This report describes a series of fourteen verification cases which has been used to test the numerical solution techniques and coding of MOTIF, as well as demonstrate some of the MOTIF analysis capabilities. For each case the MOTIF solution has been compared with a corresponding analytical or independently developed alternate numerical solution. Several of the verification cases were included in Level 1 of the International Hydrologic Code Intercomparison Project (HYDROCOIN). The MOTIF results for these cases were also described in the HYDROCOIN Secretariat's compilation and comparison of results submitted by the various project teams (Swedish Nuclear Power Inspectorate 1988). It is evident from the graphical comparisons presented that the MOTIF solutions for the fourteen verification cases are generally in excellent agreement with known analytical or numerical solutions obtained from independent sources. This series of verification studies has established the ability of the MOTIF finite-element code to accurately model the groundwater flow and solute and heat transport phenomena for which it is intended. (author). 20 refs., 14 tabs., 32 figs

Temperature-controlled two new Co(II) compounds with distinct topological networks: Syntheses, crystal structures and catalytic properties

Science.gov (United States)

Meng, Qing-Hua; Long, Xu; Liu, Jing-Li; Zhang, Shuan; Zhang, Guang-Hui

2018-04-01

Two new Co(II) coordination compounds, namely [Co2(bptc)(bpp)2]n (1) and [Co(bptc)0.5(bpp)]n (2) (H4bptc = biphenyl-3,3‧,5,5‧-tetracarboxylic acid, bpp = 1,3-di(4-pyridyl)propane), have been hydrothermally synthesized from the same reactants via tuning the reaction temperature. Single crystal X-ray diffraction analyses revealed that both 1 and 2 feature 2D sheet motifs. Topological analyses revealed that compounds 1 and 2 show distinct topological networks. Under the weak Van der Waals interactions, the 2D sheet motifs of compounds 1 and 2 are further packed into 2D→3D interdigitated supramolecular frameworks. Moreover, the two Co(II) compounds show high catalytic activities for degradation of methyl orange (MO) in a Fenten-like process.

Neural Network Based Load Frequency Control for Restructuring ...

African Journals Online (AJOL)

Neural Network Based Load Frequency Control for Restructuring Power Industry. ... an artificial neural network (ANN) application of load frequency control (LFC) of a Multi-Area power system by using a neural network controller is presented.

Control patterns in an healthcare network

NARCIS (Netherlands)

Kartseva, V.; Hulstijn, J.; Gordijn, J.; Tan, Y.H.

2010-01-01

To keep a network of enterprises sustainable, inter-organizational control measures are needed to detect or prevent opportunistic behaviour of network participants. We present a requirements engineering method for understanding control problems and designing solutions, based on an economic value

Congestion control and routing over satellite networks

Science.gov (United States)

Cao, Jinhua

Satellite networks and transmissions find their application in fields of computer communications, telephone communications, television broadcasting, transportation, space situational awareness systems and so on. This thesis mainly focuses on two networking issues affecting satellite networking: network congestion control and network routing optimization. Congestion, which leads to long queueing delays, packet losses or both, is a networking problem that has drawn the attention of many researchers. The goal of congestion control mechanisms is to ensure high bandwidth utilization while avoiding network congestion by regulating the rate at which traffic sources inject packets into a network. In this thesis, we propose a stable congestion controller using data-driven, safe switching control theory to improve the dynamic performance of satellite Transmission Control Protocol/Active Queue Management (TCP/AQM) networks. First, the stable region of the Proportional-Integral (PI) parameters for a nominal model is explored. Then, a PI controller, whose parameters are adaptively tuned by switching among members of a given candidate set, using observed plant data, is presented and compared with some classical AQM policy examples, such as Random Early Detection (RED) and fixed PI control. A new cost detectable switching law with an interval cost function switching algorithm, which improves the performance and also saves the computational cost, is developed and compared with a law commonly used in the switching control literature. Finite-gain stability of the system is proved. A fuzzy logic PI controller is incorporated as a special candidate to achieve good performance at all nominal points with the available set of candidate controllers. Simulations are presented to validate the theory. An effocient routing algorithm plays a key role in optimizing network resources. In this thesis, we briefly analyze Low Earth Orbit (LEO) satellite networks, review the Cross Entropy (CE

Purification and functional motifs of the recombinant ATPase of orf virus.

Science.gov (United States)

Lin, Fong-Yuan; Chan, Kun-Wei; Wang, Chi-Young; Wong, Min-Liang; Hsu, Wei-Li

2011-10-01

Our previous study showed that the recombinant ATPase encoded by the A32L gene of orf virus displayed ATP hydrolysis activity as predicted from its amino acids sequence. This viral ATPase contains four known functional motifs (motifs I-IV) and a novel AYDG motif; they are essential for ATP hydrolysis reaction by binding ATP and magnesium ions. The motifs I and II correspond with the Walker A and B motifs of the typical ATPase, respectively. To examine the biochemical roles of these five conserved motifs, recombinant ATPases of five deletion mutants derived from the Taiping strain were expressed and purified. Their ATPase functions were assayed and compared with those of two wild type strains, Taiping and Nantou isolated in Taiwan. Our results showed that deletions at motifs I-III or IV exhibited lower activity than that of the wild type. Interestingly, deletion of AYDG motif decreased the ATPase activity more significantly than those of motifs I-IV deletions. Divalent ions such as magnesium and calcium were essential for ATPase activity. Moreover, our recombinant proteins of orf virus also demonstrated GTPase activity, though weaker than the original ATPase activity. Copyright © 2011 Elsevier Inc. All rights reserved.

A sialoreceptor binding motif in the Mycoplasma synoviae adhesin VlhA.

Directory of Open Access Journals (Sweden)

Meghan May

Full Text Available Mycoplasma synoviae depends on its adhesin VlhA to mediate cytadherence to sialylated host cell receptors. Allelic variants of VlhA arise through recombination between an assemblage of promoterless vlhA pseudogenes and a single transcription promoter site, creating lineages of M. synoviae that each express a different vlhA allele. The predicted full-length VlhA sequences adjacent to the promoter of nine lineages of M. synoviae varying in avidity of cytadherence were aligned with that of the reference strain MS53 and with a 60-a.a. hemagglutinating VlhA C-terminal fragment from a Tunisian lineage of strain WVU1853(T. Seven different sequence variants of an imperfectly conserved, single-copy, 12-a.a. candidate cytadherence motif were evident amid the flanking variable residues of the 11 total sequences examined. The motif was predicted to adopt a short hairpin structure in a low-complexity region near the C-terminus of VlhA. Biotinylated synthetic oligopeptides representing four selected variants of the 12-a.a. motif, with the whole synthesized 60-a.a. fragment as a positive control, differed (P<0.01 in the extent they bound to chicken erythrocyte membranes. All bound to a greater extent (P<0.01 than scrambled or irrelevant VlhA domain negative control peptides did. Experimentally introduced branched-chain amino acid (BCAA substitutions Val3Ile and Leu7Ile did not significantly alter binding, whereas fold-destabilizing substitutions Thr4Gly and Ala9Gly tended to reduce it (P<0.05. Binding was also reduced to background levels (P<0.01 when the peptides were exposed to desialylated membranes, or were pre-saturated with free sialic acid before exposure to untreated membranes. From this evidence we conclude that the motif P-X-(BCAA-X-F-X-(BCAA-X-A-K-X-G binds sialic acid and likely mediates VlhA-dependent M. synoviae attachment to host cells. This conserved mechanism retains the potential for fine-scale rheostasis in binding avidity, which could be a

Network performance for graphical control systems

International Nuclear Information System (INIS)

Clout, P.; Geib, M.; Westervelt, R.

1992-01-01

Vsystem is a toolbox for building graphically-based control systems. The real-tiem database component, Vaccess, includes all the networking support necessary to build multi-computer control systems. Vaccess has two modes of database access, synchronous and asynchronous. Vdraw is another component of Vsystem that allows developers and users to develop control screens and windows by drawing rather than programming. Based on X-windows, Vsystem provides the possibility of running Vdraw either on the workstation with the graphics or on the computer with the database. We have made some measurements on the cpu loading, elapsed time and the network loading to give some guidance in system configuration performance. It will be seen that asynchronous network access gives large performance increases and that the network database change notification protocol can be either more or less efficient than the X-window network protocol, depending on the graphical representation of the data. (author)

Structural motifs of pre-nucleation clusters.

Science.gov (United States)

Zhang, Y; Türkmen, I R; Wassermann, B; Erko, A; Rühl, E

2013-10-07

Structural motifs of pre-nucleation clusters prepared in single, optically levitated supersaturated aqueous aerosol microparticles containing CaBr2 as a model system are reported. Cluster formation is identified by means of X-ray absorption in the Br K-edge regime. The salt concentration beyond the saturation point is varied by controlling the humidity in the ambient atmosphere surrounding the 15-30 μm microdroplets. This leads to the formation of metastable supersaturated liquid particles. Distinct spectral shifts in near-edge spectra as a function of salt concentration are observed, in which the energy position of the Br K-edge is red-shifted by up to 7.1 ± 0.4 eV if the dilute solution is compared to the solid. The K-edge positions of supersaturated solutions are found between these limits. The changes in electronic structure are rationalized in terms of the formation of pre-nucleation clusters. This assumption is verified by spectral simulations using first-principle density functional theory and molecular dynamics calculations, in which structural motifs are considered, explaining the experimental results. These consist of solvated CaBr2 moieties, rather than building blocks forming calcium bromide hexahydrates, the crystal system that is formed by drying aqueous CaBr2 solutions.

Enhanced vaccine control of epidemics in adaptive networks

Science.gov (United States)

Shaw, Leah B.; Schwartz, Ira B.

2010-04-01

We study vaccine control for disease spread on an adaptive network modeling disease avoidance behavior. Control is implemented by adding Poisson-distributed vaccination of susceptibles. We show that vaccine control is much more effective in adaptive networks than in static networks due to feedback interaction between the adaptive network rewiring and the vaccine application. When compared to extinction rates in static social networks, we find that the amount of vaccine resources required to sustain similar rates of extinction are as much as two orders of magnitude lower in adaptive networks.

Highly scalable Ab initio genomic motif identification

KAUST Repository

Marchand, Benoit; Bajic, Vladimir B.; Kaushik, Dinesh

2011-01-01

We present results of scaling an ab initio motif family identification system, Dragon Motif Finder (DMF), to 65,536 processor cores of IBM Blue Gene/P. DMF seeks groups of mutually similar polynucleotide patterns within a set of genomic sequences and builds various motif families from them. Such information is of relevance to many problems in life sciences. Prior attempts to scale such ab initio motif-finding algorithms achieved limited success. We solve the scalability issues using a combination of mixed-mode MPI-OpenMP parallel programming, master-slave work assignment, multi-level workload distribution, multi-level MPI collectives, and serial optimizations. While the scalability of our algorithm was excellent (94% parallel efficiency on 65,536 cores relative to 256 cores on a modest-size problem), the final speedup with respect to the original serial code exceeded 250,000 when serial optimizations are included. This enabled us to carry out many large-scale ab initio motiffinding simulations in a few hours while the original serial code would have needed decades of execution time. Copyright 2011 ACM.

A Woman Voice in an Epic: Tracing Gendered Motifs in Anne Vabarna's Peko

Directory of Open Access Journals (Sweden)

Andreas Kalkun

2008-12-01

Full Text Available In the article the gendered motifs found in Anne Vabarna’s Seto epic Peko are analysed. Besides the narrative telling of the life of the male hero, the motives regarding eating, refusing to eat or offering food, and the aspect of the female body or its control deserve to be noticed. These scenes do not communicate the main plot, they are often related to minor characters of the epic and slow down the narrative, but at the same time they clearly carry artistic purpose and meaning. I consider these motifs, present in the liminal parts of the epic, to be the dominant symbols of the epic where the author’s feminine world is being exposed. Observing these motifs of Peko in the context of Seto religious worldview, the life of Anne Vabarna and the social position of Seto women, the symbols become eloquent and informative.

A speedup technique for (l, d-motif finding algorithms

Directory of Open Access Journals (Sweden)

Dinh Hieu

2011-03-01

Full Text Available Abstract Background The discovery of patterns in DNA, RNA, and protein sequences has led to the solution of many vital biological problems. For instance, the identification of patterns in nucleic acid sequences has resulted in the determination of open reading frames, identification of promoter elements of genes, identification of intron/exon splicing sites, identification of SH RNAs, location of RNA degradation signals, identification of alternative splicing sites, etc. In protein sequences, patterns have proven to be extremely helpful in domain identification, location of protease cleavage sites, identification of signal peptides, protein interactions, determination of protein degradation elements, identification of protein trafficking elements, etc. Motifs are important patterns that are helpful in finding transcriptional regulatory elements, transcription factor binding sites, functional genomics, drug design, etc. As a result, numerous papers have been written to solve the motif search problem. Results Three versions of the motif search problem have been proposed in the literature: Simple Motif Search (SMS, (l, d-motif search (or Planted Motif Search (PMS, and Edit-distance-based Motif Search (EMS. In this paper we focus on PMS. Two kinds of algorithms can be found in the literature for solving the PMS problem: exact and approximate. An exact algorithm identifies the motifs always and an approximate algorithm may fail to identify some or all of the motifs. The exact version of PMS problem has been shown to be NP-hard. Exact algorithms proposed in the literature for PMS take time that is exponential in some of the underlying parameters. In this paper we propose a generic technique that can be used to speedup PMS algorithms. Conclusions We present a speedup technique that can be used on any PMS algorithm. We have tested our speedup technique on a number of algorithms. These experimental results show that our speedup technique is indeed very

Armadillo motifs involved in vesicular transport.

Directory of Open Access Journals (Sweden)

Harald Striegl

Full Text Available Armadillo (ARM repeat proteins function in various cellular processes including vesicular transport and membrane tethering. They contain an imperfect repeating sequence motif that forms a conserved three-dimensional structure. Recently, structural and functional insight into tethering mediated by the ARM-repeat protein p115 has been provided. Here we describe the p115 ARM-motifs for reasons of clarity and nomenclature and show that both sequence and structure are highly conserved among ARM-repeat proteins. We argue that there is no need to invoke repeat types other than ARM repeats for a proper description of the structure of the p115 globular head region. Additionally, we propose to define a new subfamily of ARM-like proteins and show lack of evidence that the ARM motifs found in p115 are present in other long coiled-coil tethering factors of the golgin family.

Autonomous Congestion Control in Delay-Tolerant Networks

Science.gov (United States)

Burleigh, Scott; Jennings, Esther; Schoolcraft, Joshua

2006-01-01

This presentation highlights communication congestion control in delay-tolerant networks (DTNs). Large-scale future space exploration will offer complex communication challenges that may be best addressed by establishing a network infrastructure. However, current internet techniques for congestion control are not well suited for operation of a network over interplanetary distances. An alternative, delay-tolerant technique for congestion control in a delay-tolerant network is presented. A simple DTN was constructed and an experimental congestion control mechanism was applied. The mechanism appeared to be effective and each router was able to make its bundle acceptance decisions autonomously. Future research will examine more complex topologies and alternative bundle acceptance rules that might enhance performance.

Effective augmentation of networked systems and enhancing pinning controllability

Science.gov (United States)

Jalili, Mahdi

2018-06-01

Controlling dynamics of networked systems to a reference state, known as pinning control, has many applications in science and engineering. In this paper, we introduce a method for effective augmentation of networked systems, while also providing high levels of pinning controllability for the final augmented network. The problem is how to connect a sub-network to an already existing network such that the pinning controllability is maximised. We consider the eigenratio of the augmented Laplacian matrix as a pinning controllability metric, and use graph perturbation theory to approximate the influence of edge addition on the eigenratio. The proposed metric can be effectively used to find the inter-network links connecting the disjoint networks. Also, an efficient link rewiring approach is proposed to further optimise the pinning controllability of the augmented network. We provide numerical simulations on synthetic networks and show that the proposed method is more effective than heuristic ones.

Discriminative motif discovery via simulated evolution and random under-sampling.

Directory of Open Access Journals (Sweden)

Tao Song

Full Text Available Conserved motifs in biological sequences are closely related to their structure and functions. Recently, discriminative motif discovery methods have attracted more and more attention. However, little attention has been devoted to the data imbalance problem, which is one of the main reasons affecting the performance of the discriminative models. In this article, a simulated evolution method is applied to solve the multi-class imbalance problem at the stage of data preprocessing, and at the stage of Hidden Markov Models (HMMs training, a random under-sampling method is introduced for the imbalance between the positive and negative datasets. It is shown that, in the task of discovering targeting motifs of nine subcellular compartments, the motifs found by our method are more conserved than the methods without considering data imbalance problem and recover the most known targeting motifs from Minimotif Miner and InterPro. Meanwhile, we use the found motifs to predict protein subcellular localization and achieve higher prediction precision and recall for the minority classes.

Discriminative motif discovery via simulated evolution and random under-sampling.

Science.gov (United States)

Song, Tao; Gu, Hong

2014-01-01

Conserved motifs in biological sequences are closely related to their structure and functions. Recently, discriminative motif discovery methods have attracted more and more attention. However, little attention has been devoted to the data imbalance problem, which is one of the main reasons affecting the performance of the discriminative models. In this article, a simulated evolution method is applied to solve the multi-class imbalance problem at the stage of data preprocessing, and at the stage of Hidden Markov Models (HMMs) training, a random under-sampling method is introduced for the imbalance between the positive and negative datasets. It is shown that, in the task of discovering targeting motifs of nine subcellular compartments, the motifs found by our method are more conserved than the methods without considering data imbalance problem and recover the most known targeting motifs from Minimotif Miner and InterPro. Meanwhile, we use the found motifs to predict protein subcellular localization and achieve higher prediction precision and recall for the minority classes.

Improved i-motif thermal stability by insertion of anthraquinone monomers

DEFF Research Database (Denmark)

Gouda, Alaa S; Amine, Mahasen S.; Pedersen, Erik Bjerregaard

2017-01-01

In order to gain insight into how to improve thermal stability of i-motifs when used in the context of biomedical and nanotechnological applications, novel anthraquinone-modified i-motifs were synthesized by insertion of 1,8-, 1,4-, 1,5- and 2,6-disubstituted anthraquinone monomers into the TAA...... loops of a 22mer cytosine-rich human telomeric DNA sequence. The influence of the four anthraquinone linkers on the i-motif thermal stability was investigated at 295 nm and pH 5.5. Anthraquinone monomers modulate the i-motif stability in a position-depending manner and the modulation also depends...... unlocked nucleic acid monomers or twisted intercalating nucleic acid. The 2,6-disubstituted anthraquinone linker replacing T10 enabled a significant increase of i-motif thermal melting by 8.2 °C. A substantial increase of 5.0 °C in i-motif thermal melting was recorded when both A6 and T16 were modified...

Trends in Integrated Ship Control Networking

DEFF Research Database (Denmark)

Jørgensen, N.; Nielsen, Jens Frederik Dalsgaard

1997-01-01

Integrated Ship Control systems can be designed as robust, distributed, autonomous control systems. The EU funded ATOMOS and ATOMOS II projects involves both technical and non technical aspects of this process. A reference modelling concept giving an outline of a generic ISC system covering...... the network and the equipment connected to it, a framework for verification of network functionality and performance by simulation and a general distribution platform for ISC systems, The ATOMOS Network, are results of this work....

Network aspects of the Fermilab control system

International Nuclear Information System (INIS)

Barton, H.R. Jr.

1977-01-01

The control system of the Fermi National Accelerator is a heavily computerized network of distributed processors. One part of the control system includes a multidrop network of eleven Lockheed MAC-16 processors, a Digital Equipment Corporation PDP-11 computer, a Xerox 530, and a Control Data 6600 system. These computers exchange information using serial hardware and dedicated cable buses. The individual functions of the central processing units in this network, the message protocols for computer communications, and design guidelines for future distributed processing control systems are discussed

Control of autonomous robot using neural networks

Science.gov (United States)

Barton, Adam; Volna, Eva

2017-07-01

The aim of the article is to design a method of control of an autonomous robot using artificial neural networks. The introductory part describes control issues from the perspective of autonomous robot navigation and the current mobile robots controlled by neural networks. The core of the article is the design of the controlling neural network, and generation and filtration of the training set using ART1 (Adaptive Resonance Theory). The outcome of the practical part is an assembled Lego Mindstorms EV3 robot solving the problem of avoiding obstacles in space. To verify models of an autonomous robot behavior, a set of experiments was created as well as evaluation criteria. The speed of each motor was adjusted by the controlling neural network with respect to the situation in which the robot was found.

Identification, occurrence, and validation of DRE and ABRE Cis-regulatory motifs in the promoter regions of genes of Arabidopsis thaliana.

Science.gov (United States)

Mishra, Sonal; Shukla, Aparna; Upadhyay, Swati; Sanchita; Sharma, Pooja; Singh, Seema; Phukan, Ujjal J; Meena, Abha; Khan, Feroz; Tripathi, Vineeta; Shukla, Rakesh Kumar; Shrama, Ashok

2014-04-01

Plants posses a complex co-regulatory network which helps them to elicit a response under diverse adverse conditions. We used an in silico approach to identify the genes with both DRE and ABRE motifs in their promoter regions in Arabidopsis thaliana. Our results showed that Arabidopsis contains a set of 2,052 genes with ABRE and DRE motifs in their promoter regions. Approximately 72% or more of the total predicted 2,052 genes had a gap distance of less than 400 bp between DRE and ABRE motifs. For positional orientation of the DRE and ABRE motifs, we found that the DR form (one in direct and the other one in reverse orientation) was more prevalent than other forms. These predicted 2,052 genes include 155 transcription factors. Using microarray data from The Arabidopsis Information Resource (TAIR) database, we present 44 transcription factors out of 155 which are upregulated by more than twofold in response to osmotic stress and ABA treatment. Fifty-one transcripts from the one predicted above were validated using semiquantitative expression analysis to support the microarray data in TAIR. Taken together, we report a set of genes containing both DRE and ABRE motifs in their promoter regions in A. thaliana, which can be useful to understand the role of ABA under osmotic stress condition. © 2013 Institute of Botany, Chinese Academy of Sciences.

Optical network control plane for multi-domain networking

DEFF Research Database (Denmark)

Manolova, Anna Vasileva

This thesis focuses on multi-domain routing for traffice engineering and survivability support in optical transport networks under the Generalized Multi-Protocol Label Switching (GMPLS) control framework. First, different extensions to the Border Gateway Protocol for multi-domain Traffic...... process are not enough for efficient TE in mesh multi-domain networks. Enhancing the protocol with multi-path dissemination capability, combined with the employment of an end-to-end TE metric proves to be a highly efficient solution. Simulation results show good performance characteristics of the proposed...... is not as essential for improved network performance as the length of the provided paths. Second, the issue of multi-domain survivability support is analyzed. An AS-disjoint paths is beneficial not only for resilience support, but also for facilitating adequate network reactions to changes in the network, which...

PID Neural Network Based Speed Control of Asynchronous Motor Using Programmable Logic Controller

Directory of Open Access Journals (Sweden)

MARABA, V. A.

2011-11-01

Full Text Available This paper deals with the structure and characteristics of PID Neural Network controller for single input and single output systems. PID Neural Network is a new kind of controller that includes the advantages of artificial neural networks and classic PID controller. Functioning of this controller is based on the update of controller parameters according to the value extracted from system output pursuant to the rules of back propagation algorithm used in artificial neural networks. Parameters obtained from the application of PID Neural Network training algorithm on the speed model of the asynchronous motor exhibiting second order linear behavior were used in the real time speed control of the motor. Programmable logic controller (PLC was used as real time controller. The real time control results show that reference speed successfully maintained under various load conditions.

Neural Networks for Non-linear Control

DEFF Research Database (Denmark)

Sørensen, O.

1994-01-01

This paper describes how a neural network, structured as a Multi Layer Perceptron, is trained to predict, simulate and control a non-linear process.......This paper describes how a neural network, structured as a Multi Layer Perceptron, is trained to predict, simulate and control a non-linear process....

The high level programmer and user interface of the NSLS control system

International Nuclear Information System (INIS)

Tang, Y.N.; Smith, J.D.; Sathe, S.

1993-01-01

This paper presents the major components of the high level software in the NSLS upgraded control system. Both programmer and user interfaces are discussed. The use of the high-speed work stations, fast network communications, UNIX system, X-window and Motif have greatly changed and improved these interfaces

Engineering a Functional Small RNA Negative Autoregulation Network with Model-Guided Design.

Science.gov (United States)

Hu, Chelsea Y; Takahashi, Melissa K; Zhang, Yan; Lucks, Julius B

2018-05-22

RNA regulators are powerful components of the synthetic biology toolbox. Here, we expand the repertoire of synthetic gene networks built from these regulators by constructing a transcriptional negative autoregulation (NAR) network out of small RNAs (sRNAs). NAR network motifs are core motifs of natural genetic networks, and are known for reducing network response time and steady state signal. Here we use cell-free transcription-translation (TX-TL) reactions and a computational model to design and prototype sRNA NAR constructs. Using parameter sensitivity analysis, we design a simple set of experiments that allow us to accurately predict NAR function in TX-TL. We transfer successful network designs into Escherichia coli and show that our sRNA transcriptional network reduces both network response time and steady-state gene expression. This work broadens our ability to construct increasingly sophisticated RNA genetic networks with predictable function.

An accelerator controls network designed for reliability and flexibility

International Nuclear Information System (INIS)

McDowell, W. P.; Sidorowicz, K. V.

1997-01-01

The APS accelerator control system is a typical modern system based on the standard control system model, which consists of operator interfaces to a network and computer-controlled interfaces to hardware. The network provides a generalized communication path between the host computers, operator workstations, input/output crates, and other hardware that comprise the control system. The network is an integral part of all modern control systems and network performance will determine many characteristics of a control system. This paper describes the methods used to provide redundancy for various network system components as well as methods used to provide comprehensive monitoring of this network. The effect of archiving tens of thousands of data points on a regular basis and the effect on the controls network will be discussed. Metrics are provided on the performance of the system under various conditions

Distributed medium access control in wireless networks

CERN Document Server

Wang, Ping

2013-01-01

This brief investigates distributed medium access control (MAC) with QoS provisioning for both single- and multi-hop wireless networks including wireless local area networks (WLANs), wireless ad hoc networks, and wireless mesh networks. For WLANs, an efficient MAC scheme and a call admission control algorithm are presented to provide guaranteed QoS for voice traffic and, at the same time, increase the voice capacity significantly compared with the current WLAN standard. In addition, a novel token-based scheduling scheme is proposed to provide great flexibility and facility to the network servi

An novel frequent probability pattern mining algorithm based on circuit simulation method in uncertain biological networks

Science.gov (United States)

2014-01-01

Background Motif mining has always been a hot research topic in bioinformatics. Most of current research on biological networks focuses on exact motif mining. However, due to the inevitable experimental error and noisy data, biological network data represented as the probability model could better reflect the authenticity and biological significance, therefore, it is more biological meaningful to discover probability motif in uncertain biological networks. One of the key steps in probability motif mining is frequent pattern discovery which is usually based on the possible world model having a relatively high computational complexity. Methods In this paper, we present a novel method for detecting frequent probability patterns based on circuit simulation in the uncertain biological networks. First, the partition based efficient search is applied to the non-tree like subgraph mining where the probability of occurrence in random networks is small. Then, an algorithm of probability isomorphic based on circuit simulation is proposed. The probability isomorphic combines the analysis of circuit topology structure with related physical properties of voltage in order to evaluate the probability isomorphism between probability subgraphs. The circuit simulation based probability isomorphic can avoid using traditional possible world model. Finally, based on the algorithm of probability subgraph isomorphism, two-step hierarchical clustering method is used to cluster subgraphs, and discover frequent probability patterns from the clusters. Results The experiment results on data sets of the Protein-Protein Interaction (PPI) networks and the transcriptional regulatory networks of E. coli and S. cerevisiae show that the proposed method can efficiently discover the frequent probability subgraphs. The discovered subgraphs in our study contain all probability motifs reported in the experiments published in other related papers. Conclusions The algorithm of probability graph isomorphism

Epidemic Propagation of Control Plane Failures in GMPLS Controlled Optical Transport Networks

DEFF Research Database (Denmark)

Ruepp, Sarah Renée; Fagertun, Anna Manolova

2013-01-01

In this paper, we investigate the behaviour of a dataplane-decoupled GMPLS control plane, when it is affected by failures that spread in the network in an epidemic manner. In particular, we consider network nodes to be either fully functional, or having a failed control plane, or having both...... a failed control and data plane. Through large-scale network simulation, we evaluate the effect of epidemically spreading control plane failures in terms of blocked connections requests and the amount of stranded capacity due to a dysfunctional control plane. Furthermore, we investigate the effect...... of the epidemic and the epidemic spreading intensity. In particular, networks with long epidemic durations do not necessarily result in worst performance in terms of blocked requests and capacity. Also epidemic scenarios, resulting in worst impact on the network availability does not necessarily result in worst...

Joint Design of Control and Power Efficiency in Wireless Networked Control System

Directory of Open Access Journals (Sweden)

Yan Wang

2014-01-01

Full Text Available This paper presents a joint design method for wireless networked control system (WNCS to balance both the demands of network service and the control performance. Since the problems of power consumption, communication reliability, and system stability exist simultaneously and interdependently in WNCS, most of the achieved results in the wireless network and wired networked control system cannot be used directly. To coordinate the three problems, sampling period is found to be the linking bridge. An adaptive sampling power efficiency algorithm is proposed to manage the power consumption such that it can meet the demands of network life span. The sampling period is designed to update periodically on the constraints of network schedulability and system stability. The convergence of the power efficiency algorithm is further proved. The sampling period is no longer a fixed value, however; thus, increasing the difficulty in modeling and controlling such a complicated time-varying system remains. In this work, a switched control system scheme is applied to model such a WNCS, and the effect of network-induced delay is considered. Switched feedback controllers are introduced to stabilize the WNCS, and some considerations on stability condition and the bounds of the update circle for renewing sampling period are discussed. A numerical example shows the effectiveness of the proposed method.

Positional bias of general and tissue-specific regulatory motifs in mouse gene promoters

Directory of Open Access Journals (Sweden)

Farré Domènec

2007-12-01

Full Text Available Abstract Background The arrangement of regulatory motifs in gene promoters, or promoter architecture, is the result of mutation and selection processes that have operated over many millions of years. In mammals, tissue-specific transcriptional regulation is related to the presence of specific protein-interacting DNA motifs in gene promoters. However, little is known about the relative location and spacing of these motifs. To fill this gap, we have performed a systematic search for motifs that show significant bias at specific promoter locations in a large collection of housekeeping and tissue-specific genes. Results We observe that promoters driving housekeeping gene expression are enriched in particular motifs with strong positional bias, such as YY1, which are of little relevance in promoters driving tissue-specific expression. We also identify a large number of motifs that show positional bias in genes expressed in a highly tissue-specific manner. They include well-known tissue-specific motifs, such as HNF1 and HNF4 motifs in liver, kidney and small intestine, or RFX motifs in testis, as well as many potentially novel regulatory motifs. Based on this analysis, we provide predictions for 559 tissue-specific motifs in mouse gene promoters. Conclusion The study shows that motif positional bias is an important feature of mammalian proximal promoters and that it affects both general and tissue-specific motifs. Motif positional constraints define very distinct promoter architectures depending on breadth of expression and type of tissue.

Phyloproteomic Analysis of 11780 Six-Residue-Long Motifs Occurrences

Directory of Open Access Journals (Sweden)

O. V. Galzitskaya

2015-01-01

Full Text Available How is it possible to find good traits for phylogenetic reconstructions? Here, we present a new phyloproteomic criterion that is an occurrence of simple motifs which can be imprints of evolution history. We studied the occurrences of 11780 six-residue-long motifs consisting of two randomly located amino acids in 97 eukaryotic and 25 bacterial proteomes. For all eukaryotic proteomes, with the exception of the Amoebozoa, Stramenopiles, and Diplomonadida kingdoms, the number of proteins containing the motifs from the first group (one of the two amino acids occurs once at the terminal position made about 20%; in the case of motifs from the second (one of two amino acids occurs one time within the pattern and third (the two amino acids occur randomly groups, 30% and 50%, respectively. For bacterial proteomes, this relationship was 10%, 27%, and 63%, respectively. The matrices of correlation coefficients between numbers of proteins where a motif from the set of 11780 motifs appears at least once in 9 kingdoms and 5 phyla of bacteria were calculated. Among the correlation coefficients for eukaryotic proteomes, the correlation between the animal and fungi kingdoms (0.62 is higher than between fungi and plants (0.54. Our study provides support that animals and fungi are sibling kingdoms. Comparison of the frequencies of six-residue-long motifs in different proteomes allows obtaining phylogenetic relationships based on similarities between these frequencies: the Diplomonadida kingdoms are more close to Bacteria than to Eukaryota; Stramenopiles and Amoebozoa are more close to each other than to other kingdoms of Eukaryota.

Complex systems and networks dynamics, controls and applications

CERN Document Server

Yu, Xinghuo; Chen, Guanrong; Yu, Wenwu

2016-01-01

This elementary book provides some state-of-the-art research results on broad disciplinary sciences on complex networks. It presents an in-depth study with detailed description of dynamics, controls and applications of complex networks. The contents of this book can be summarized as follows. First, the dynamics of complex networks, for example, the cluster dynamic analysis by using kernel spectral methods, community detection algorithms in bipartite networks, epidemiological modeling with demographics and epidemic spreading on multi-layer networks, are studied. Second, the controls of complex networks are investigated including topics like distributed finite-time cooperative control of multi-agent systems by applying homogenous-degree and Lyapunov methods, composite finite-time containment control for disturbed second-order multi-agent systems, fractional-order observer design of multi-agent systems, chaos control and anticontrol of complex systems via Parrondos game and many more. Third, the applications of ...

Accelerator and feedback control simulation using neural networks

International Nuclear Information System (INIS)

Nguyen, D.; Lee, M.; Sass, R.; Shoaee, H.

1991-05-01

Unlike present constant model feedback system, neural networks can adapt as the dynamics of the process changes with time. Using a process model, the ''Accelerator'' network is first trained to simulate the dynamics of the beam for a given beam line. This ''Accelerator'' network is then used to train a second ''Controller'' network which performs the control function. In simulation, the networks are used to adjust corrector magnetics to control the launch angle and position of the beam to keep it on the desired trajectory when the incoming beam is perturbed. 4 refs., 3 figs

Flexible Tube-Based Network Control, Phase I

Data.gov (United States)

National Aeronautics and Space Administration — The Innovation Laboratory, Inc. builds a control system which controls the topology of an air traffic flow network and the network flow properties which enables Air...

Pinning control of complex networked systems synchronization, consensus and flocking of networked systems via pinning

CERN Document Server

Su, Housheng

2013-01-01

Synchronization, consensus and flocking are ubiquitous requirements in networked systems. Pinning Control of Complex Networked Systems investigates these requirements by using the pinning control strategy, which aims to control the whole dynamical network with huge numbers of nodes by imposing controllers for only a fraction of the nodes. As the direct control of every node in a dynamical network with huge numbers of nodes might be impossible or unnecessary, it’s then very important to use the pinning control strategy for the synchronization of complex dynamical networks. The research on pinning control strategy in consensus and flocking of multi-agent systems can not only help us to better understand the mechanisms of natural collective phenomena, but also benefit applications in mobile sensor/robot networks. This book offers a valuable resource for researchers and engineers working in the fields of control theory and control engineering.   Housheng Su is an Associate Professor at the Department of Contro...

Analysis of Time Delay Simulation in Networked Control System

OpenAIRE

Nyan Phyo Aung; Zaw Min Naing; Hla Myo Tun

2016-01-01

The paper presents a PD controller for the Networked Control Systems (NCS) with delay. The major challenges in this networked control system (NCS) are the delay of the data transmission throughout the communication network. The comparative performance analysis is carried out for different delays network medium. In this paper, simulation is carried out on Ac servo motor control system using CAN Bus as communication network medium. The True Time toolbox of MATLAB is used for simulation to analy...

Spectral Barcoding of Quantum Dots: Deciphering Structural Motifs from the Excitonic Spectra

International Nuclear Information System (INIS)

Mlinar, V.; Zunger, A.

2009-01-01

Self-assembled semiconductor quantum dots (QDs) show in high-resolution single-dot spectra a multitude of sharp lines, resembling a barcode, due to various neutral and charged exciton complexes. Here we propose the 'spectral barcoding' method that deciphers structural motifs of dots by using such barcode as input to an artificial-intelligence learning system. Thus, we invert the common practice of deducing spectra from structure by deducing structure from spectra. This approach (i) lays the foundation for building a much needed structure-spectra understanding for large nanostructures and (ii) can guide future design of desired optical features of QDs by controlling during growth only those structural motifs that decide given optical features.

Methods and statistics for combining motif match scores.

Science.gov (United States)

Bailey, T L; Gribskov, M

1998-01-01

Position-specific scoring matrices are useful for representing and searching for protein sequence motifs. A sequence family can often be described by a group of one or more motifs, and an effective search must combine the scores for matching a sequence to each of the motifs in the group. We describe three methods for combining match scores and estimating the statistical significance of the combined scores and evaluate the search quality (classification accuracy) and the accuracy of the estimate of statistical significance of each. The three methods are: 1) sum of scores, 2) sum of reduced variates, 3) product of score p-values. We show that method 3) is superior to the other two methods in both regards, and that combining motif scores indeed gives better search accuracy. The MAST sequence homology search algorithm utilizing the product of p-values scoring method is available for interactive use and downloading at URL http:/(/)www.sdsc.edu/MEME.

Adaptive mechanism-based congestion control for networked systems

Science.gov (United States)

Liu, Zhi; Zhang, Yun; Chen, C. L. Philip

2013-03-01

In order to assure the communication quality in network systems with heavy traffic and limited bandwidth, a new ATRED (adaptive thresholds random early detection) congestion control algorithm is proposed for the congestion avoidance and resource management of network systems. Different to the traditional AQM (active queue management) algorithms, the control parameters of ATRED are not configured statically, but dynamically adjusted by the adaptive mechanism. By integrating with the adaptive strategy, ATRED alleviates the tuning difficulty of RED (random early detection) and shows a better control on the queue management, and achieve a more robust performance than RED under varying network conditions. Furthermore, a dynamic transmission control protocol-AQM control system using ATRED controller is introduced for the systematic analysis. It is proved that the stability of the network system can be guaranteed when the adaptive mechanism is finely designed. Simulation studies show the proposed ATRED algorithm achieves a good performance in varying network environments, which is superior to the RED and Gentle-RED algorithm, and providing more reliable service under varying network conditions.

An Improved Car-Following Model in Vehicle Networking Based on Network Control

Directory of Open Access Journals (Sweden)

D. Y. Kong

2014-01-01

Full Text Available Vehicle networking is a system to realize information interoperability between vehicles and people, vehicles and roads, vehicles and vehicles, and cars and transport facilities, through the network information exchange, in order to achieve the effective monitoring of the vehicle and traffic flow. Realizing information interoperability between vehicles and vehicles, which can affect the traffic flow, is an important application of network control system (NCS. In this paper, a car-following model using vehicle networking theory is established, based on network control principle. The car-following model, which is an improvement of the traditional traffic model, describes the traffic in vehicle networking condition. The impact that vehicle networking has on the traffic flow is quantitatively assessed in a particular scene of one-way, no lane changing highway. The examples show that the capacity of the road is effectively enhanced by using vehicle networking.

Application of reflective memory network in Tokamak fast controller

International Nuclear Information System (INIS)

Weng Chuqiao; Zhang Ming; Liu Rui; Zheng Wei; Zhuang Ge

2014-01-01

A specific application of reflective memory network in Tokamak fast controller was introduced in this paper. The PMC-5565 reflective memory card and ACC-5565 network hub were used to build a reflective memory real-time network to test its real- time function. The real-time, rapidity and determinacy of the time delay for fast controller controlling power device under the reflective memory network were tested in the LabVIEW RT real-time operation system. Depending on the reflective memory technology, the data in several fast controllers were synchronized, and multiple control tasks using a single control task were finished. The experiment results show that the reflective memory network can meet the real-time requirements for fast controller to perform the feedback control over devices. (authors)

Controlling centrality in complex networks

Science.gov (United States)

Nicosia, V.; Criado, R.; Romance, M.; Russo, G.; Latora, V.

2012-01-01

Spectral centrality measures allow to identify influential individuals in social groups, to rank Web pages by popularity, and even to determine the impact of scientific researches. The centrality score of a node within a network crucially depends on the entire pattern of connections, so that the usual approach is to compute node centralities once the network structure is assigned. We face here with the inverse problem, that is, we study how to modify the centrality scores of the nodes by acting on the structure of a given network. We show that there exist particular subsets of nodes, called controlling sets, which can assign any prescribed set of centrality values to all the nodes of a graph, by cooperatively tuning the weights of their out-going links. We found that many large networks from the real world have surprisingly small controlling sets, containing even less than 5 – 10% of the nodes. PMID:22355732

Direct adaptive control using feedforward neural networks

OpenAIRE

Cajueiro, Daniel Oliveira; Hemerly, Elder Moreira

2003-01-01

ABSTRACT: This paper proposes a new scheme for direct neural adaptive control that works efficiently employing only one neural network, used for simultaneously identifying and controlling the plant. The idea behind this structure of adaptive control is to compensate the control input obtained by a conventional feedback controller. The neural network training process is carried out by using two different techniques: backpropagation and extended Kalman filter algorithm. Additionally, the conver...

Cloud-based Networked Visual Servo Control

OpenAIRE

Wu, Haiyan; Lu, Lei; Chen, Chih-Chung; Hirche, Sandra; Kühnlenz, Kolja

2013-01-01

The performance of vision-based control systems, in particular of highly dynamic vision-based motion control systems, is often limited by the low sampling rate of the visual feedback caused by the long image processing time. In order to overcome this problem, the networked visual servo control, which integrates networked computational resources for cloud image processing, is considered in this article. The main contributions of this article are i) a real-time transport protocol for transmitti...

A source-controlled data center network model.

Science.gov (United States)

Yu, Yang; Liang, Mangui; Wang, Zhe

2017-01-01

The construction of data center network by applying SDN technology has become a hot research topic. The SDN architecture has innovatively separated the control plane from the data plane which makes the network more software-oriented and agile. Moreover, it provides virtual multi-tenancy, effective scheduling resources and centralized control strategies to meet the demand for cloud computing data center. However, the explosion of network information is facing severe challenges for SDN controller. The flow storage and lookup mechanisms based on TCAM device have led to the restriction of scalability, high cost and energy consumption. In view of this, a source-controlled data center network (SCDCN) model is proposed herein. The SCDCN model applies a new type of source routing address named the vector address (VA) as the packet-switching label. The VA completely defines the communication path and the data forwarding process can be finished solely relying on VA. There are four advantages in the SCDCN architecture. 1) The model adopts hierarchical multi-controllers and abstracts large-scale data center network into some small network domains that has solved the restriction for the processing ability of single controller and reduced the computational complexity. 2) Vector switches (VS) developed in the core network no longer apply TCAM for table storage and lookup that has significantly cut down the cost and complexity for switches. Meanwhile, the problem of scalability can be solved effectively. 3) The SCDCN model simplifies the establishment process for new flows and there is no need to download flow tables to VS. The amount of control signaling consumed when establishing new flows can be significantly decreased. 4) We design the VS on the NetFPGA platform. The statistical results show that the hardware resource consumption in a VS is about 27% of that in an OFS.

A source-controlled data center network model

Science.gov (United States)

Yu, Yang; Liang, Mangui; Wang, Zhe

2017-01-01

The construction of data center network by applying SDN technology has become a hot research topic. The SDN architecture has innovatively separated the control plane from the data plane which makes the network more software-oriented and agile. Moreover, it provides virtual multi-tenancy, effective scheduling resources and centralized control strategies to meet the demand for cloud computing data center. However, the explosion of network information is facing severe challenges for SDN controller. The flow storage and lookup mechanisms based on TCAM device have led to the restriction of scalability, high cost and energy consumption. In view of this, a source-controlled data center network (SCDCN) model is proposed herein. The SCDCN model applies a new type of source routing address named the vector address (VA) as the packet-switching label. The VA completely defines the communication path and the data forwarding process can be finished solely relying on VA. There are four advantages in the SCDCN architecture. 1) The model adopts hierarchical multi-controllers and abstracts large-scale data center network into some small network domains that has solved the restriction for the processing ability of single controller and reduced the computational complexity. 2) Vector switches (VS) developed in the core network no longer apply TCAM for table storage and lookup that has significantly cut down the cost and complexity for switches. Meanwhile, the problem of scalability can be solved effectively. 3) The SCDCN model simplifies the establishment process for new flows and there is no need to download flow tables to VS. The amount of control signaling consumed when establishing new flows can be significantly decreased. 4) We design the VS on the NetFPGA platform. The statistical results show that the hardware resource consumption in a VS is about 27% of that in an OFS. PMID:28328925

Flexible brain network reconfiguration supporting inhibitory control.

Science.gov (United States)

Spielberg, Jeffrey M; Miller, Gregory A; Heller, Wendy; Banich, Marie T

2015-08-11

The ability to inhibit distracting stimuli from interfering with goal-directed behavior is crucial for success in most spheres of life. Despite an abundance of studies examining regional brain activation, knowledge of the brain networks involved in inhibitory control remains quite limited. To address this critical gap, we applied graph theory tools to functional magnetic resonance imaging data collected while a large sample of adults (n = 101) performed a color-word Stroop task. Higher demand for inhibitory control was associated with restructuring of the global network into a configuration that was more optimized for specialized processing (functional segregation), more efficient at communicating the output of such processing across the network (functional integration), and more resilient to potential interruption (resilience). In addition, there were regional changes with right inferior frontal sulcus and right anterior insula occupying more central positions as network hubs, and dorsal anterior cingulate cortex becoming more tightly coupled with its regional subnetwork. Given the crucial role of inhibitory control in goal-directed behavior, present findings identifying functional network organization supporting inhibitory control have the potential to provide additional insights into how inhibitory control may break down in a wide variety of individuals with neurological or psychiatric difficulties.

Memetic algorithms for de novo motif-finding in biomedical sequences.

Science.gov (United States)

Bi, Chengpeng

2012-09-01

The objectives of this study are to design and implement a new memetic algorithm for de novo motif discovery, which is then applied to detect important signals hidden in various biomedical molecular sequences. In this paper, memetic algorithms are developed and tested in de novo motif-finding problems. Several strategies in the algorithm design are employed that are to not only efficiently explore the multiple sequence local alignment space, but also effectively uncover the molecular signals. As a result, there are a number of key features in the implementation of the memetic motif-finding algorithm (MaMotif), including a chromosome replacement operator, a chromosome alteration-aware local search operator, a truncated local search strategy, and a stochastic operation of local search imposed on individual learning. To test the new algorithm, we compare MaMotif with a few of other similar algorithms using simulated and experimental data including genomic DNA, primary microRNA sequences (let-7 family), and transmembrane protein sequences. The new memetic motif-finding algorithm is successfully implemented in C++, and exhaustively tested with various simulated and real biological sequences. In the simulation, it shows that MaMotif is the most time-efficient algorithm compared with others, that is, it runs 2 times faster than the expectation maximization (EM) method and 16 times faster than the genetic algorithm-based EM hybrid. In both simulated and experimental testing, results show that the new algorithm is compared favorably or superior to other algorithms. Notably, MaMotif is able to successfully discover the transcription factors' binding sites in the chromatin immunoprecipitation followed by massively parallel sequencing (ChIP-Seq) data, correctly uncover the RNA splicing signals in gene expression, and precisely find the highly conserved helix motif in the transmembrane protein sequences, as well as rightly detect the palindromic segments in the primary micro

Controllability and observability of Boolean networks arising from biology

Science.gov (United States)

Li, Rui; Yang, Meng; Chu, Tianguang

2015-02-01

Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.

Network motif-based identification of transcription factor-target gene relationships by integrating multi-source biological data

Directory of Open Access Journals (Sweden)

de los Reyes Benildo G

2008-04-01

Full Text Available Abstract Background Integrating data from multiple global assays and curated databases is essential to understand the spatio-temporal interactions within cells. Different experiments measure cellular processes at various widths and depths, while databases contain biological information based on established facts or published data. Integrating these complementary datasets helps infer a mutually consistent transcriptional regulatory network (TRN with strong similarity to the structure of the underlying genetic regulatory modules. Decomposing the TRN into a small set of recurring regulatory patterns, called network motifs (NM, facilitates the inference. Identifying NMs defined by specific transcription factors (TF establishes the framework structure of a TRN and allows the inference of TF-target gene relationship. This paper introduces a computational framework for utilizing data from multiple sources to infer TF-target gene relationships on the basis of NMs. The data include time course gene expression profiles, genome-wide location analysis data, binding sequence data, and gene ontology (GO information. Results The proposed computational framework was tested using gene expression data associated with cell cycle progression in yeast. Among 800 cell cycle related genes, 85 were identified as candidate TFs and classified into four previously defined NMs. The NMs for a subset of TFs are obtained from literature. Support vector machine (SVM classifiers were used to estimate NMs for the remaining TFs. The potential downstream target genes for the TFs were clustered into 34 biologically significant groups. The relationships between TFs and potential target gene clusters were examined by training recurrent neural networks whose topologies mimic the NMs to which the TFs are classified. The identified relationships between TFs and gene clusters were evaluated using the following biological validation and statistical analyses: (1 Gene set enrichment

Practical synchronization on complex dynamical networks via optimal pinning control

Science.gov (United States)

Li, Kezan; Sun, Weigang; Small, Michael; Fu, Xinchu

2015-07-01

We consider practical synchronization on complex dynamical networks under linear feedback control designed by optimal control theory. The control goal is to minimize global synchronization error and control strength over a given finite time interval, and synchronization error at terminal time. By utilizing the Pontryagin's minimum principle, and based on a general complex dynamical network, we obtain an optimal system to achieve the control goal. The result is verified by performing some numerical simulations on Star networks, Watts-Strogatz networks, and Barabási-Albert networks. Moreover, by combining optimal control and traditional pinning control, we propose an optimal pinning control strategy which depends on the network's topological structure. Obtained results show that optimal pinning control is very effective for synchronization control in real applications.

Discovering Motifs in Biological Sequences Using the Micron Automata Processor.

Science.gov (United States)

Roy, Indranil; Aluru, Srinivas

2016-01-01

Finding approximately conserved sequences, called motifs, across multiple DNA or protein sequences is an important problem in computational biology. In this paper, we consider the (l, d) motif search problem of identifying one or more motifs of length l present in at least q of the n given sequences, with each occurrence differing from the motif in at most d substitutions. The problem is known to be NP-complete, and the largest solved instance reported to date is (26,11). We propose a novel algorithm for the (l,d) motif search problem using streaming execution over a large set of non-deterministic finite automata (NFA). This solution is designed to take advantage of the micron automata processor, a new technology close to deployment that can simultaneously execute multiple NFA in parallel. We demonstrate the capability for solving much larger instances of the (l, d) motif search problem using the resources available within a single automata processor board, by estimating run-times for problem instances (39,18) and (40,17). The paper serves as a useful guide to solving problems using this new accelerator technology.

PISMA: A Visual Representation of Motif Distribution in DNA Sequences

Directory of Open Access Journals (Sweden)

Rogelio Alcántara-Silva

2017-03-01

Full Text Available Background: Because the graphical presentation and analysis of motif distribution can provide insights for experimental hypothesis, PISMA aims at identifying motifs on DNA sequences, counting and showing them graphically. The motif length ranges from 2 to 10 bases, and the DNA sequences range up to 10 kb. The motif distribution is shown as a bar-code–like, as a gene-map–like, and as a transcript scheme. Results: We obtained graphical schemes of the CpG site distribution from 91 human papillomavirus genomes. Also, we present 2 analyses: one of DNA motifs associated with either methylation-resistant or methylation-sensitive CpG islands and another analysis of motifs associated with exosome RNA secretion. Availability and Implementation: PISMA is developed in Java; it is executable in any type of hardware and in diverse operating systems. PISMA is freely available to noncommercial users. The English version and the User Manual are provided in Supplementary Files 1 and 2, and a Spanish version is available at www.biomedicas.unam.mx/wp-content/software/pisma.zip and www.biomedicas.unam.mx/wp-content/pdf/manual/pisma.pdf .

Feed Forward Neural Network and Optimal Control Problem with Control and State Constraints

Science.gov (United States)

Kmet', Tibor; Kmet'ová, Mária

2009-09-01

A feed forward neural network based optimal control synthesis is presented for solving optimal control problems with control and state constraints. The paper extends adaptive critic neural network architecture proposed by [5] to the optimal control problems with control and state constraints. The optimal control problem is transcribed into a nonlinear programming problem which is implemented with adaptive critic neural network. The proposed simulation method is illustrated by the optimal control problem of nitrogen transformation cycle model. Results show that adaptive critic based systematic approach holds promise for obtaining the optimal control with control and state constraints.

Fusion Control of Flexible Logic Control and Neural Network

Directory of Open Access Journals (Sweden)

Lihua Fu

2014-01-01

Full Text Available Based on the basic physical meaning of error E and error variety EC, this paper analyzes the logical relationship between them and uses Universal Combinatorial Operation Model in Universal Logic to describe it. Accordingly, a flexible logic control method is put forward to realize effective control on multivariable nonlinear system. In order to implement fusion control with artificial neural network, this paper proposes a new neuron model of Zero-level Universal Combinatorial Operation in Universal Logic. And the artificial neural network of flexible logic control model is implemented based on the proposed neuron model. Finally, stability control, anti-interference control of double inverted-pendulum system, and free walking of cart pendulum system on a level track are realized, showing experimentally the feasibility and validity of this method.

Parallel motif extraction from very long sequences

KAUST Repository

Sahli, Majed

2013-01-01

Motifs are frequent patterns used to identify biological functionality in genomic sequences, periodicity in time series, or user trends in web logs. In contrast to a lot of existing work that focuses on collections of many short sequences, modern applications require mining of motifs in one very long sequence (i.e., in the order of several gigabytes). For this case, there exist statistical approaches that are fast but inaccurate; or combinatorial methods that are sound and complete. Unfortunately, existing combinatorial methods are serial and very slow. Consequently, they are limited to very short sequences (i.e., a few megabytes), small alphabets (typically 4 symbols for DNA sequences), and restricted types of motifs. This paper presents ACME, a combinatorial method for extracting motifs from a single very long sequence. ACME arranges the search space in contiguous blocks that take advantage of the cache hierarchy in modern architectures, and achieves almost an order of magnitude performance gain in serial execution. It also decomposes the search space in a smart way that allows scalability to thousands of processors with more than 90% speedup. ACME is the only method that: (i) scales to gigabyte-long sequences; (ii) handles large alphabets; (iii) supports interesting types of motifs with minimal additional cost; and (iv) is optimized for a variety of architectures such as multi-core systems, clusters in the cloud, and supercomputers. ACME reduces the extraction time for an exact-length query from 4 hours to 7 minutes on a typical workstation; handles 3 orders of magnitude longer sequences; and scales up to 16, 384 cores on a supercomputer. Copyright is held by the owner/author(s).

Optimal control of epidemic information dissemination over networks.

Science.gov (United States)

Chen, Pin-Yu; Cheng, Shin-Ming; Chen, Kwang-Cheng

2014-12-01

Information dissemination control is of crucial importance to facilitate reliable and efficient data delivery, especially in networks consisting of time-varying links or heterogeneous links. Since the abstraction of information dissemination much resembles the spread of epidemics, epidemic models are utilized to characterize the collective dynamics of information dissemination over networks. From a systematic point of view, we aim to explore the optimal control policy for information dissemination given that the control capability is a function of its distribution time, which is a more realistic model in many applications. The main contributions of this paper are to provide an analytically tractable model for information dissemination over networks, to solve the optimal control signal distribution time for minimizing the accumulated network cost via dynamic programming, and to establish a parametric plug-in model for information dissemination control. In particular, we evaluate its performance in mobile and generalized social networks as typical examples.

Bio-inspired spiking neural network for nonlinear systems control.

Science.gov (United States)

Pérez, Javier; Cabrera, Juan A; Castillo, Juan J; Velasco, Juan M

2018-08-01

Spiking neural networks (SNN) are the third generation of artificial neural networks. SNN are the closest approximation to biological neural networks. SNNs make use of temporal spike trains to command inputs and outputs, allowing a faster and more complex computation. As demonstrated by biological organisms, they are a potentially good approach to designing controllers for highly nonlinear dynamic systems in which the performance of controllers developed by conventional techniques is not satisfactory or difficult to implement. SNN-based controllers exploit their ability for online learning and self-adaptation to evolve when transferred from simulations to the real world. SNN's inherent binary and temporary way of information codification facilitates their hardware implementation compared to analog neurons. Biological neural networks often require a lower number of neurons compared to other controllers based on artificial neural networks. In this work, these neuronal systems are imitated to perform the control of non-linear dynamic systems. For this purpose, a control structure based on spiking neural networks has been designed. Particular attention has been paid to optimizing the structure and size of the neural network. The proposed structure is able to control dynamic systems with a reduced number of neurons and connections. A supervised learning process using evolutionary algorithms has been carried out to perform controller training. The efficiency of the proposed network has been verified in two examples of dynamic systems control. Simulations show that the proposed control based on SNN exhibits superior performance compared to other approaches based on Neural Networks and SNNs. Copyright © 2018 Elsevier Ltd. All rights reserved.

Asymmetric positive feedback loops reliably control biological responses.

Science.gov (United States)

Ratushny, Alexander V; Saleem, Ramsey A; Sitko, Katherine; Ramsey, Stephen A; Aitchison, John D

2012-04-24

Positive feedback is a common mechanism enabling biological systems to respond to stimuli in a switch-like manner. Such systems are often characterized by the requisite formation of a heterodimer where only one of the pair is subject to feedback. This ASymmetric Self-UpREgulation (ASSURE) motif is central to many biological systems, including cholesterol homeostasis (LXRα/RXRα), adipocyte differentiation (PPARγ/RXRα), development and differentiation (RAR/RXR), myogenesis (MyoD/E12) and cellular antiviral defense (IRF3/IRF7). To understand why this motif is so prevalent, we examined its properties in an evolutionarily conserved transcriptional regulatory network in yeast (Oaf1p/Pip2p). We demonstrate that the asymmetry in positive feedback confers a competitive advantage and allows the system to robustly increase its responsiveness while precisely tuning the response to a consistent level in the presence of varying stimuli. This study reveals evolutionary advantages for the ASSURE motif, and mechanisms for control, that are relevant to pharmacologic intervention and synthetic biology applications.

Software Defined Networking (SDN) controlled all optical switching networks with multi-dimensional switching architecture

Science.gov (United States)

Zhao, Yongli; Ji, Yuefeng; Zhang, Jie; Li, Hui; Xiong, Qianjin; Qiu, Shaofeng

2014-08-01

Ultrahigh throughout capacity requirement is challenging the current optical switching nodes with the fast development of data center networks. Pbit/s level all optical switching networks need to be deployed soon, which will cause the high complexity of node architecture. How to control the future network and node equipment together will become a new problem. An enhanced Software Defined Networking (eSDN) control architecture is proposed in the paper, which consists of Provider NOX (P-NOX) and Node NOX (N-NOX). With the cooperation of P-NOX and N-NOX, the flexible control of the entire network can be achieved. All optical switching network testbed has been experimentally demonstrated with efficient control of enhanced Software Defined Networking (eSDN). Pbit/s level all optical switching nodes in the testbed are implemented based on multi-dimensional switching architecture, i.e. multi-level and multi-planar. Due to the space and cost limitation, each optical switching node is only equipped with four input line boxes and four output line boxes respectively. Experimental results are given to verify the performance of our proposed control and switching architecture.

Multi-layered control of Galectin-8 mediated autophagy during adenovirus cell entry through a conserved PPxY motif in the viral capsid.

Directory of Open Access Journals (Sweden)

Charlotte Montespan

2017-02-01

Full Text Available Cells employ active measures to restrict infection by pathogens, even prior to responses from the innate and humoral immune defenses. In this context selective autophagy is activated upon pathogen induced membrane rupture to sequester and deliver membrane fragments and their pathogen contents for lysosomal degradation. Adenoviruses, which breach the endosome upon entry, escape this fate by penetrating into the cytosol prior to autophagosome sequestration of the ruptured endosome. We show that virus induced membrane damage is recognized through Galectin-8 and sequesters the autophagy receptors NDP52 and p62. We further show that a conserved PPxY motif in the viral membrane lytic protein VI is critical for efficient viral evasion of autophagic sequestration after endosomal lysis. Comparing the wildtype with a PPxY-mutant virus we show that depletion of Galectin-8 or suppression of autophagy in ATG5-/- MEFs rescues infectivity of the PPxY-mutant virus while depletion of the autophagy receptors NDP52, p62 has only minor effects. Furthermore we show that wildtype viruses exploit the autophagic machinery for efficient nuclear genome delivery and control autophagosome formation via the cellular ubiquitin ligase Nedd4.2 resulting in reduced antigenic presentation. Our data thus demonstrate that a short PPxY-peptide motif in the adenoviral capsid permits multi-layered viral control of autophagic processes during entry.

Role of the ERC motif in the proximal part of the second intracellular loop and the C-terminal domain of the human prostaglandin F2alpha receptor (hFP-R) in G-protein coupling control.

Science.gov (United States)

Pathe-Neuschäfer-Rube, Andrea; Neuschäfer-Rube, Frank; Püschel, Gerhard P

2005-05-15

The human FP-R (F2alpha prostaglandin receptor) is a Gq-coupled heptahelical ectoreceptor, which is of significant medical interest, since it is a potential target for the treatment of glaucoma and preterm labour. On agonist exposure, it mediates an increase in intracellular inositol phosphate formation. Little is known about the structures that govern the agonist-dependent receptor activation. In other prostanoid receptors, the C-terminal domain has been inferred in the control of agonist-dependent receptor activation. A DRY motif at the beginning of the second intracellular loop is highly conserved throughout the G-protein-coupled receptor family and appears to be crucial for controlling agonist-dependent receptor activation. It is replaced by an ERC motif in the FP-R and no evidence for the relevance of this motif in ligand-dependent activation of prostanoid receptors has been provided so far. The aim of the present study was to elucidate the potential role of the C-terminal domain and the ERC motif in agonist-controlled intracellular signalling in FP-R mutants generated by site-directed mutagenesis. It was found that substitution of the acidic Glu(132) in the ERC motif by a threonine residue led to full constitutive activation, whereas truncation of the receptor's C-terminal domain led to partial constitutive activation of all three intracellular signal pathways that had previously been shown to be activated by the FP-R, i.e. inositol trisphosphate formation, focal adhesion kinase activation and T-cell factor signalling. Inositol trisphosphate formation and focal adhesion kinase phosphorylation were further enhanced by ligand binding in cells expressing the truncation mutant but not the E132T (Glu132-->Thr) mutant. Thus C-terminal truncation appeared to result in a receptor with partial constitutive activation, whereas substitution of Glu132 by threonine apparently resulted in a receptor with full constitutive activity.

Generalized Mutual Synchronization between Two Controlled Interdependent Networks

OpenAIRE

Xu, Quan; Zhuang, Shengxian; Hu, Dan; Zeng, Yingfeng; Xiao, Jian

2014-01-01

This paper mainly focuses on the generalized mutual synchronization between two controlled interdependent networks. First, we propose the general model of controlled interdependent networks $A$ and $B$ with time-varying internetwork delays coupling. Then, by constructing Lyapunov functions and utilizing adaptive control technique, some sufficient conditions are established to ensure that the mutual synchronization errors between the state variables of networks $A$ and $B$ can asymptotically c...

Connectivity in the yeast cell cycle transcription network: inferences from neural networks.

Directory of Open Access Journals (Sweden)

Christopher E Hart

2006-12-01

Full Text Available A current challenge is to develop computational approaches to infer gene network regulatory relationships based on multiple types of large-scale functional genomic data. We find that single-layer feed-forward artificial neural network (ANN models can effectively discover gene network structure by integrating global in vivo protein:DNA interaction data (ChIP/Array with genome-wide microarray RNA data. We test this on the yeast cell cycle transcription network, which is composed of several hundred genes with phase-specific RNA outputs. These ANNs were robust to noise in data and to a variety of perturbations. They reliably identified and ranked 10 of 12 known major cell cycle factors at the top of a set of 204, based on a sum-of-squared weights metric. Comparative analysis of motif occurrences among multiple yeast species independently confirmed relationships inferred from ANN weights analysis. ANN models can capitalize on properties of biological gene networks that other kinds of models do not. ANNs naturally take advantage of patterns of absence, as well as presence, of factor binding associated with specific expression output; they are easily subjected to in silico "mutation" to uncover biological redundancies; and they can use the full range of factor binding values. A prominent feature of cell cycle ANNs suggested an analogous property might exist in the biological network. This postulated that "network-local discrimination" occurs when regulatory connections (here between MBF and target genes are explicitly disfavored in one network module (G2, relative to others and to the class of genes outside the mitotic network. If correct, this predicts that MBF motifs will be significantly depleted from the discriminated class and that the discrimination will persist through evolution. Analysis of distantly related Schizosaccharomyces pombe confirmed this, suggesting that network-local discrimination is real and complements well-known enrichment of

Local and global control of ecological and biological networks

OpenAIRE

Alessandro Ferrarini

2014-01-01

Recently, I introduced a methodological framework so that ecological and biological networks can be controlled both from inside and outside by coupling network dynamics and evolutionary modelling. The endogenous control requires the network to be optimized at the beginning of its dynamics (by acting upon nodes, edges or both) so that it will then go inertially to the desired state. Instead, the exogenous control requires that exogenous controllers act upon the network at each time step. By th...

Cell fate reprogramming by control of intracellular network dynamics

Science.gov (United States)

Zanudo, Jorge G. T.; Albert, Reka

Identifying control strategies for biological networks is paramount for practical applications that involve reprogramming a cell's fate, such as disease therapeutics and stem cell reprogramming. Although the topic of controlling the dynamics of a system has a long history in control theory, most of this work is not directly applicable to intracellular networks. Here we present a network control method that integrates the structural and functional information available for intracellular networks to predict control targets. Formulated in a logical dynamic scheme, our control method takes advantage of certain function-dependent network components and their relation to steady states in order to identify control targets, which are guaranteed to drive any initial state to the target state with 100% effectiveness and need to be applied only transiently for the system to reach and stay in the desired state. We illustrate our method's potential to find intervention targets for cancer treatment and cell differentiation by applying it to a leukemia signaling network and to the network controlling the differentiation of T cells. We find that the predicted control targets are effective in a broad dynamic framework. Moreover, several of the predicted interventions are supported by experiments. This work was supported by NSF Grant PHY 1205840.

Composite Structural Motifs of Binding Sites for Delineating Biological Functions of Proteins

Science.gov (United States)

Kinjo, Akira R.; Nakamura, Haruki

2012-01-01

Most biological processes are described as a series of interactions between proteins and other molecules, and interactions are in turn described in terms of atomic structures. To annotate protein functions as sets of interaction states at atomic resolution, and thereby to better understand the relation between protein interactions and biological functions, we conducted exhaustive all-against-all atomic structure comparisons of all known binding sites for ligands including small molecules, proteins and nucleic acids, and identified recurring elementary motifs. By integrating the elementary motifs associated with each subunit, we defined composite motifs that represent context-dependent combinations of elementary motifs. It is demonstrated that function similarity can be better inferred from composite motif similarity compared to the similarity of protein sequences or of individual binding sites. By integrating the composite motifs associated with each protein function, we define meta-composite motifs each of which is regarded as a time-independent diagrammatic representation of a biological process. It is shown that meta-composite motifs provide richer annotations of biological processes than sequence clusters. The present results serve as a basis for bridging atomic structures to higher-order biological phenomena by classification and integration of binding site structures. PMID:22347478

Probing structural changes of self assembled i-motif DNA

KAUST Repository

Lee, Iljoon; Patil, Sachin; Fhayli, Karim; Alsaiari, Shahad K.; Khashab, Niveen M.

2015-01-01

We report an i-motif structural probing system based on Thioflavin T (ThT) as a fluorescent sensor. This probe can discriminate the structural changes of RET and Rb i-motif sequences according to pH change. This journal is

Adaptive nonlinear control using input normalized neural networks

International Nuclear Information System (INIS)

Leeghim, Henzeh; Seo, In Ho; Bang, Hyo Choong

2008-01-01

An adaptive feedback linearization technique combined with the neural network is addressed to control uncertain nonlinear systems. The neural network-based adaptive control theory has been widely studied. However, the stability analysis of the closed-loop system with the neural network is rather complicated and difficult to understand, and sometimes unnecessary assumptions are involved. As a result, unnecessary assumptions for stability analysis are avoided by using the neural network with input normalization technique. The ultimate boundedness of the tracking error is simply proved by the Lyapunov stability theory. A new simple update law as an adaptive nonlinear control is derived by the simplification of the input normalized neural network assuming the variation of the uncertain term is sufficiently small

Organization of Multi-controller Interaction in Software Defined Networks

Directory of Open Access Journals (Sweden)

Sergey V. Morzhov

2018-01-01

Full Text Available Software Defined Networking (SDN is a promising paradigm for network management. It is a centralized network intelligence on a dedicated server, which runs network operating system, and is called SDN controller. It was assumed that such an architecture should have an improved network performance and monitoring. However, the centralized control architecture of the SDNs brings novel challenges to reliability, scalability, fault tolerance and interoperability. These problems are especially acute for large data center networks and can be solved by combining SDN controllers into clusters, called multi-controllers. Multi-controller architecture became very important for SDN-enabled networks nowadays. This paper gives a comprehensive overview of SDN multi-controller architectures. The authors review several most popular distributed controllers in order to indicate their strengths and weaknesses. They also investigate and classify approaches used. This paper explains in details the difference among various types of multi-controller architectures, the distribution method and the communication system. Furthermore, it provides already implemented architectures and some examples of architectures under consideration by describing their design, communication process, and performance results. In this paper, the authors show their own classification of multi-controllers and claim that, despite the existence of undeniable advantages, all reviewed controllers have serious drawbacks, which must be eliminated. These drawbacks hamper the development of multi-controllers and their widespread adoption in corporate networks. In the end, the authors conclude that now it is impossible to find a solution capable to solve all the tasks assigned to it adequately and fully. The article is published in the authors’ wording.

Neural Networks for Modeling and Control of Particle Accelerators

CERN Document Server

Edelen, A.L.; Chase, B.E.; Edstrom, D.; Milton, S.V.; Stabile, P.

2016-01-01

We describe some of the challenges of particle accelerator control, highlight recent advances in neural network techniques, discuss some promising avenues for incorporating neural networks into particle accelerator control systems, and describe a neural network-based control system that is being developed for resonance control of an RF electron gun at the Fermilab Accelerator Science and Technology (FAST) facility, including initial experimental results from a benchmark controller.

Measuring symmetry, asymmetry and randomness in neural network connectivity.

Directory of Open Access Journals (Sweden)

Umberto Esposito

Full Text Available Cognitive functions are stored in the connectome, the wiring diagram of the brain, which exhibits non-random features, so-called motifs. In this work, we focus on bidirectional, symmetric motifs, i.e. two neurons that project to each other via connections of equal strength, and unidirectional, non-symmetric motifs, i.e. within a pair of neurons only one neuron projects to the other. We hypothesise that such motifs have been shaped via activity dependent synaptic plasticity processes. As a consequence, learning moves the distribution of the synaptic connections away from randomness. Our aim is to provide a global, macroscopic, single parameter characterisation of the statistical occurrence of bidirectional and unidirectional motifs. To this end we define a symmetry measure that does not require any a priori thresholding of the weights or knowledge of their maximal value. We calculate its mean and variance for random uniform or Gaussian distributions, which allows us to introduce a confidence measure of how significantly symmetric or asymmetric a specific configuration is, i.e. how likely it is that the configuration is the result of chance. We demonstrate the discriminatory power of our symmetry measure by inspecting the eigenvalues of different types of connectivity matrices. We show that a Gaussian weight distribution biases the connectivity motifs to more symmetric configurations than a uniform distribution and that introducing a random synaptic pruning, mimicking developmental regulation in synaptogenesis, biases the connectivity motifs to more asymmetric configurations, regardless of the distribution. We expect that our work will benefit the computational modelling community, by providing a systematic way to characterise symmetry and asymmetry in network structures. Further, our symmetry measure will be of use to electrophysiologists that investigate symmetry of network connectivity.

Measuring symmetry, asymmetry and randomness in neural network connectivity.

Science.gov (United States)

Esposito, Umberto; Giugliano, Michele; van Rossum, Mark; Vasilaki, Eleni

2014-01-01

Cognitive functions are stored in the connectome, the wiring diagram of the brain, which exhibits non-random features, so-called motifs. In this work, we focus on bidirectional, symmetric motifs, i.e. two neurons that project to each other via connections of equal strength, and unidirectional, non-symmetric motifs, i.e. within a pair of neurons only one neuron projects to the other. We hypothesise that such motifs have been shaped via activity dependent synaptic plasticity processes. As a consequence, learning moves the distribution of the synaptic connections away from randomness. Our aim is to provide a global, macroscopic, single parameter characterisation of the statistical occurrence of bidirectional and unidirectional motifs. To this end we define a symmetry measure that does not require any a priori thresholding of the weights or knowledge of their maximal value. We calculate its mean and variance for random uniform or Gaussian distributions, which allows us to introduce a confidence measure of how significantly symmetric or asymmetric a specific configuration is, i.e. how likely it is that the configuration is the result of chance. We demonstrate the discriminatory power of our symmetry measure by inspecting the eigenvalues of different types of connectivity matrices. We show that a Gaussian weight distribution biases the connectivity motifs to more symmetric configurations than a uniform distribution and that introducing a random synaptic pruning, mimicking developmental regulation in synaptogenesis, biases the connectivity motifs to more asymmetric configurations, regardless of the distribution. We expect that our work will benefit the computational modelling community, by providing a systematic way to characterise symmetry and asymmetry in network structures. Further, our symmetry measure will be of use to electrophysiologists that investigate symmetry of network connectivity.

Neural Network for Optimization of Existing Control Systems

DEFF Research Database (Denmark)

Madsen, Per Printz

1995-01-01

The purpose of this paper is to develop methods to use Neural Network based Controllers (NNC) as an optimization tool for existing control systems.......The purpose of this paper is to develop methods to use Neural Network based Controllers (NNC) as an optimization tool for existing control systems....

Optimization of robustness of interdependent network controllability by redundant design.

Directory of Open Access Journals (Sweden)

Zenghu Zhang

Full Text Available Controllability of complex networks has been a hot topic in recent years. Real networks regarded as interdependent networks are always coupled together by multiple networks. The cascading process of interdependent networks including interdependent failure and overload failure will destroy the robustness of controllability for the whole network. Therefore, the optimization of the robustness of interdependent network controllability is of great importance in the research area of complex networks. In this paper, based on the model of interdependent networks constructed first, we determine the cascading process under different proportions of node attacks. Then, the structural controllability of interdependent networks is measured by the minimum driver nodes. Furthermore, we propose a parameter which can be obtained by the structure and minimum driver set of interdependent networks under different proportions of node attacks and analyze the robustness for interdependent network controllability. Finally, we optimize the robustness of interdependent network controllability by redundant design including node backup and redundancy edge backup and improve the redundant design by proposing different strategies according to their cost. Comparative strategies of redundant design are conducted to find the best strategy. Results shows that node backup and redundancy edge backup can indeed decrease those nodes suffering from failure and improve the robustness of controllability. Considering the cost of redundant design, we should choose BBS (betweenness-based strategy or DBS (degree based strategy for node backup and HDF(high degree first for redundancy edge backup. Above all, our proposed strategies are feasible and effective at improving the robustness of interdependent network controllability.

Submodularity in dynamics and control of networked systems

CERN Document Server

Clark, Andrew; Bushnell, Linda; Poovendran, Radha

2016-01-01

This book presents a framework for the control of networked systems utilizing submodular optimization techniques. The main focus is on selecting input nodes for the control of networked systems, an inherently discrete optimization problem with applications in power system stability, social influence dynamics, and the control of vehicle formations. The first part of the book is devoted to background information on submodular functions, matroids, and submodular optimization, and presents algorithms for distributed submodular optimization that are scalable to large networked systems. In turn, the second part develops a unifying submodular optimization approach to controlling networked systems based on multiple performance and controllability criteria. Techniques are introduced for selecting input nodes to ensure smooth convergence, synchronization, and robustness to environmental and adversarial noise. Submodular optimization is the first unifying approach towards guaranteeing both performance and controllabilit...

Control of fluxes in metabolic networks

Science.gov (United States)

Basler, Georg; Nikoloski, Zoran; Larhlimi, Abdelhalim; Barabási, Albert-László; Liu, Yang-Yu

2016-01-01

Understanding the control of large-scale metabolic networks is central to biology and medicine. However, existing approaches either require specifying a cellular objective or can only be used for small networks. We introduce new coupling types describing the relations between reaction activities, and develop an efficient computational framework, which does not require any cellular objective for systematic studies of large-scale metabolism. We identify the driver reactions facilitating control of 23 metabolic networks from all kingdoms of life. We find that unicellular organisms require a smaller degree of control than multicellular organisms. Driver reactions are under complex cellular regulation in Escherichia coli, indicating their preeminent role in facilitating cellular control. In human cancer cells, driver reactions play pivotal roles in malignancy and represent potential therapeutic targets. The developed framework helps us gain insights into regulatory principles of diseases and facilitates design of engineering strategies at the interface of gene regulation, signaling, and metabolism. PMID:27197218

BlockLogo: Visualization of peptide and sequence motif conservation

DEFF Research Database (Denmark)

Olsen, Lars Rønn; Kudahl, Ulrich Johan; Simon, Christian

2013-01-01

BlockLogo is a web-server application for the visualization of protein and nucleotide fragments, continuous protein sequence motifs, and discontinuous sequence motifs using calculation of block entropy from multiple sequence alignments. The user input consists of a multiple sequence alignment, se...

Minimizing communication cost among distributed controllers in software defined networks

Science.gov (United States)

Arlimatti, Shivaleela; Elbreiki, Walid; Hassan, Suhaidi; Habbal, Adib; Elshaikh, Mohamed

2016-08-01

Software Defined Networking (SDN) is a new paradigm to increase the flexibility of today's network by promising for a programmable network. The fundamental idea behind this new architecture is to simplify network complexity by decoupling control plane and data plane of the network devices, and by making the control plane centralized. Recently controllers have distributed to solve the problem of single point of failure, and to increase scalability and flexibility during workload distribution. Even though, controllers are flexible and scalable to accommodate more number of network switches, yet the problem of intercommunication cost between distributed controllers is still challenging issue in the Software Defined Network environment. This paper, aims to fill the gap by proposing a new mechanism, which minimizes intercommunication cost with graph partitioning algorithm, an NP hard problem. The methodology proposed in this paper is, swapping of network elements between controller domains to minimize communication cost by calculating communication gain. The swapping of elements minimizes inter and intra communication cost among network domains. We validate our work with the OMNeT++ simulation environment tool. Simulation results show that the proposed mechanism minimizes the inter domain communication cost among controllers compared to traditional distributed controllers.

Active Engine Mounting Control Algorithm Using Neural Network

Directory of Open Access Journals (Sweden)

Fadly Jashi Darsivan

2009-01-01

Full Text Available This paper proposes the application of neural network as a controller to isolate engine vibration in an active engine mounting system. It has been shown that the NARMA-L2 neurocontroller has the ability to reject disturbances from a plant. The disturbance is assumed to be both impulse and sinusoidal disturbances that are induced by the engine. The performance of the neural network controller is compared with conventional PD and PID controllers tuned using Ziegler-Nichols. From the result simulated the neural network controller has shown better ability to isolate the engine vibration than the conventional controllers.

Optimization-Based Approaches to Control of Probabilistic Boolean Networks

Directory of Open Access Journals (Sweden)

Koichi Kobayashi

2017-02-01

Full Text Available Control of gene regulatory networks is one of the fundamental topics in systems biology. In the last decade, control theory of Boolean networks (BNs, which is well known as a model of gene regulatory networks, has been widely studied. In this review paper, our previously proposed methods on optimal control of probabilistic Boolean networks (PBNs are introduced. First, the outline of PBNs is explained. Next, an optimal control method using polynomial optimization is explained. The finite-time optimal control problem is reduced to a polynomial optimization problem. Furthermore, another finite-time optimal control problem, which can be reduced to an integer programming problem, is also explained.

Predictive Control of Networked Multiagent Systems via Cloud Computing.

Science.gov (United States)

Liu, Guo-Ping

2017-01-18

This paper studies the design and analysis of networked multiagent predictive control systems via cloud computing. A cloud predictive control scheme for networked multiagent systems (NMASs) is proposed to achieve consensus and stability simultaneously and to compensate for network delays actively. The design of the cloud predictive controller for NMASs is detailed. The analysis of the cloud predictive control scheme gives the necessary and sufficient conditions of stability and consensus of closed-loop networked multiagent control systems. The proposed scheme is verified to characterize the dynamical behavior and control performance of NMASs through simulations. The outcome provides a foundation for the development of cooperative and coordinative control of NMASs and its applications.

Controlling extreme events on complex networks

Science.gov (United States)

Chen, Yu-Zhong; Huang, Zi-Gang; Lai, Ying-Cheng

2014-08-01

Extreme events, a type of collective behavior in complex networked dynamical systems, often can have catastrophic consequences. To develop effective strategies to control extreme events is of fundamental importance and practical interest. Utilizing transportation dynamics on complex networks as a prototypical setting, we find that making the network ``mobile'' can effectively suppress extreme events. A striking, resonance-like phenomenon is uncovered, where an optimal degree of mobility exists for which the probability of extreme events is minimized. We derive an analytic theory to understand the mechanism of control at a detailed and quantitative level, and validate the theory numerically. Implications of our finding to current areas such as cybersecurity are discussed.

Logistic control in automated transportation networks

NARCIS (Netherlands)

Ebben, Mark

2001-01-01

Increasing congestion problems lead to a search for alternative transportation systems. Automated transportation networks, possibly underground, are an option. Logistic control systems are essential for future implementations of such automated transportation networks. This book contributes to the

Genome Analysis of Conserved Dehydrin Motifs in Vascular Plants

Directory of Open Access Journals (Sweden)

Ahmad A. Malik

2017-05-01

Full Text Available Dehydrins, a large family of abiotic stress proteins, are defined by the presence of a mostly conserved motif known as the K-segment, and may also contain two other conserved motifs known as the Y-segment and S-segment. Using the dehydrin literature, we developed a sequence motif definition of the K-segment, which we used to create a large dataset of dehydrin sequences by searching the Pfam00257 dehydrin dataset and the Phytozome 10 sequences of vascular plants. A comprehensive analysis of these sequences reveals that lysine residues are highly conserved in the K-segment, while the amino acid type is often conserved at other positions. Despite the Y-segment name, the central tyrosine is somewhat conserved, but can be substituted with two other small aromatic amino acids (phenylalanine or histidine. The S-segment contains a series of serine residues, but in some proteins is also preceded by a conserved LHR sequence. In many dehydrins containing all three of these motifs the S-segment is linked to the K-segment by a GXGGRRKK motif (where X can be any amino acid, suggesting a functional linkage between these two motifs. An analysis of the sequences shows that the dehydrin architecture and several biochemical properties (isoelectric point, molecular mass, and hydrophobicity score are dependent on each other, and that some dehydrin architectures are overexpressed during certain abiotic stress, suggesting that they may be optimized for a specific abiotic stress while others are involved in all forms of dehydration stress (drought, cold, and salinity.

RegRNA: an integrated web server for identifying regulatory RNA motifs and elements

OpenAIRE

Huang, Hsi-Yuan; Chien, Chia-Hung; Jen, Kuan-Hua; Huang, Hsien-Da

2006-01-01

Numerous regulatory structural motifs have been identified as playing essential roles in transcriptional and post-transcriptional regulation of gene expression. RegRNA is an integrated web server for identifying the homologs of regulatory RNA motifs and elements against an input mRNA sequence. Both sequence homologs and structural homologs of regulatory RNA motifs can be recognized. The regulatory RNA motifs supported in RegRNA are categorized into several classes: (i) motifs in mRNA 5′-untra...

Enrichment of Circular Code Motifs in the Genes of the Yeast Saccharomyces cerevisiae

Directory of Open Access Journals (Sweden)

Christian J. Michel

2017-12-01

Full Text Available A set X of 20 trinucleotides has been found to have the highest average occurrence in the reading frame, compared to the two shifted frames, of genes of bacteria, archaea, eukaryotes, plasmids and viruses. This set X has an interesting mathematical property, since X is a maximal C 3 self-complementary trinucleotide circular code. Furthermore, any motif obtained from this circular code X has the capacity to retrieve, maintain and synchronize the original (reading frame. Since 1996, the theory of circular codes in genes has mainly been developed by analysing the properties of the 20 trinucleotides of X , using combinatorics and statistical approaches. For the first time, we test this theory by analysing the X motifs, i.e., motifs from the circular code X , in the complete genome of the yeast Saccharomyces cerevisiae. Several properties of X motifs are identified by basic statistics (at the frequency level, and evaluated by comparison to R motifs, i.e., random motifs generated from 30 different random codes R . We first show that the frequency of X motifs is significantly greater than that of R motifs in the genome of S. cerevisiae. We then verify that no significant difference is observed between the frequencies of X and R motifs in the non-coding regions of S. cerevisiae, but that the occurrence number of X motifs is significantly higher than R motifs in the genes (protein-coding regions. This property is true for all cardinalities of X motifs (from 4 to 20 and for all 16 chromosomes. We further investigate the distribution of X motifs in the three frames of S. cerevisiae genes and show that they occur more frequently in the reading frame, regardless of their cardinality or their length. Finally, the ratio of X genes, i.e., genes with at least one X motif, to non- X genes, in the set of verified genes is significantly different to that observed in the set of putative or dubious genes with no experimental evidence. These results, taken together

Enrichment of Circular Code Motifs in the Genes of the Yeast Saccharomyces cerevisiae.

Science.gov (United States)

Michel, Christian J; Ngoune, Viviane Nguefack; Poch, Olivier; Ripp, Raymond; Thompson, Julie D

2017-12-03

A set X of 20 trinucleotides has been found to have the highest average occurrence in the reading frame, compared to the two shifted frames, of genes of bacteria, archaea, eukaryotes, plasmids and viruses. This set X has an interesting mathematical property, since X is a maximal C3 self-complementary trinucleotide circular code. Furthermore, any motif obtained from this circular code X has the capacity to retrieve, maintain and synchronize the original (reading) frame. Since 1996, the theory of circular codes in genes has mainly been developed by analysing the properties of the 20 trinucleotides of X, using combinatorics and statistical approaches. For the first time, we test this theory by analysing the X motifs, i.e., motifs from the circular code X, in the complete genome of the yeast Saccharomyces cerevisiae . Several properties of X motifs are identified by basic statistics (at the frequency level), and evaluated by comparison to R motifs, i.e., random motifs generated from 30 different random codes R. We first show that the frequency of X motifs is significantly greater than that of R motifs in the genome of S. cerevisiae . We then verify that no significant difference is observed between the frequencies of X and R motifs in the non-coding regions of S. cerevisiae , but that the occurrence number of X motifs is significantly higher than R motifs in the genes (protein-coding regions). This property is true for all cardinalities of X motifs (from 4 to 20) and for all 16 chromosomes. We further investigate the distribution of X motifs in the three frames of S. cerevisiae genes and show that they occur more frequently in the reading frame, regardless of their cardinality or their length. Finally, the ratio of X genes, i.e., genes with at least one X motif, to non-X genes, in the set of verified genes is significantly different to that observed in the set of putative or dubious genes with no experimental evidence. These results, taken together, represent the first

Controls from remote through Social networks

Directory of Open Access Journals (Sweden)

Alessandra Ingrao

2016-03-01

Full Text Available The Author focuses on the recently reformed provisions regulating the employer’s power to control from remote the employees’ activities (art. 4 of the Workers Statute, with particular regard to controls performed by means of Social networks.Such controls are in fact extremely powerful due to the versatile and multi-purpose character of Social networks, which may also be used as a working device. A widespread case law shows indeed that employer’s controls may cost a worker his job.Therefore, after the reform, all employees will have to read carefully the employer’s Privacy policies, before accessing socials during the worktime to express opinions and/or frustrations.

The network of global corporate control.

Science.gov (United States)

Vitali, Stefania; Glattfelder, James B; Battiston, Stefano

2011-01-01

The structure of the control network of transnational corporations affects global market competition and financial stability. So far, only small national samples were studied and there was no appropriate methodology to assess control globally. We present the first investigation of the architecture of the international ownership network, along with the computation of the control held by each global player. We find that transnational corporations form a giant bow-tie structure and that a large portion of control flows to a small tightly-knit core of financial institutions. This core can be seen as an economic "super-entity" that raises new important issues both for researchers and policy makers.

On the Control of Consensus Networks: Theory and Applications

Science.gov (United States)

Hudoba de Badyn, Mathias

Signed networks allow the study of positive and negative interactions between agents. In this thesis, three papers are presented that address controllability of networked dynamics. First, controllability of signed consensus networks is approached from a symmetry perspective, for both linear and nonlinear consensus protocols. It is shown that the graph-theoretic property of signed networks known as structural balance renders the consensus protocol uncontrollable when coupled with a certain type of symmetry. Stabilizability and output controllability of signed linear consensus is also examined, as well as a data-driven approach to finding bipartite consensus stemming from structural balance for signed nonlinear consensus. Second, an algorithm is constructed that allows one to grow a network while preserving controllability, and some generalizations of this algorithm are presented. Submodular optimization is used to analyze a second algorithm that adds nodes to a network to maximize the network connectivity.

Optimization of controllability and robustness of complex networks by edge directionality

Science.gov (United States)

Liang, Man; Jin, Suoqin; Wang, Dingjie; Zou, Xiufen

2016-09-01

Recently, controllability of complex networks has attracted enormous attention in various fields of science and engineering. How to optimize structural controllability has also become a significant issue. Previous studies have shown that an appropriate directional assignment can improve structural controllability; however, the evolution of the structural controllability of complex networks under attacks and cascading has always been ignored. To address this problem, this study proposes a new edge orientation method (NEOM) based on residual degree that changes the link direction while conserving topology and directionality. By comparing the results with those of previous methods in two random graph models and several realistic networks, our proposed approach is demonstrated to be an effective and competitive method for improving the structural controllability of complex networks. Moreover, numerical simulations show that our method is near-optimal in optimizing structural controllability. Strikingly, compared to the original network, our method maintains the structural controllability of the network under attacks and cascading, indicating that the NEOM can also enhance the robustness of controllability of networks. These results alter the view of the nature of controllability in complex networks, change the understanding of structural controllability and affect the design of network models to control such networks.

A normalized PID controller in networked control systems with varying time delays.

Science.gov (United States)

Tran, Hoang-Dung; Guan, Zhi-Hong; Dang, Xuan-Kien; Cheng, Xin-Ming; Yuan, Fu-Shun

2013-09-01

It requires not only simplicity and flexibility but also high specified stability and robustness of system to design a PI/PID controller in such complicated networked control systems (NCSs) with delays. By gain and phase margins approach, this paper proposes a novel normalized PI/PID controller for NCSs based on analyzing the stability and robustness of system under the effect of network-induced delays. Specifically, We take into account the total measured network delays to formulate the gain and phase margins of the closed-loop system in the form of a set of equations. With pre-specified values of gain and phase margins, this set of equations is then solved for calculating the closed forms of control parameters which enable us to propose the normalized PI/PID controller simultaneously satisfying the following two requirements: (1) simplicity without re-solving the optimization problem for a new process, (2) high flexibility to cope with large scale of random delays and deal with many different processes in different conditions of network. Furthermore, in our method, the upper bound of random delay can be estimated to indicate the operating domain of proposed PI/PID controller. Finally, simulation results are shown to demonstrate the advantages of our proposed controller in many situations of network-induced delays. Copyright © 2013 ISA. Published by Elsevier Ltd. All rights reserved.

RNA recognition motif (RRM)-containing proteins in Bombyx mori

African Journals Online (AJOL)

STORAGESEVER

2009-03-20

Mar 20, 2009 ... Recognition Motif (RRM), sometimes referred to as. RNP1, is one of the first identified domains for RNA interaction. RRM is very common ..... Apart from the RRM motif, eIF3-S9 has a Trp-Asp. (WD) repeat domain, Poly (A) ...

Neural Networks for Modeling and Control of Particle Accelerators

Science.gov (United States)

Edelen, A. L.; Biedron, S. G.; Chase, B. E.; Edstrom, D.; Milton, S. V.; Stabile, P.

2016-04-01

Particle accelerators are host to myriad nonlinear and complex physical phenomena. They often involve a multitude of interacting systems, are subject to tight performance demands, and should be able to run for extended periods of time with minimal interruptions. Often times, traditional control techniques cannot fully meet these requirements. One promising avenue is to introduce machine learning and sophisticated control techniques inspired by artificial intelligence, particularly in light of recent theoretical and practical advances in these fields. Within machine learning and artificial intelligence, neural networks are particularly well-suited to modeling, control, and diagnostic analysis of complex, nonlinear, and time-varying systems, as well as systems with large parameter spaces. Consequently, the use of neural network-based modeling and control techniques could be of significant benefit to particle accelerators. For the same reasons, particle accelerators are also ideal test-beds for these techniques. Many early attempts to apply neural networks to particle accelerators yielded mixed results due to the relative immaturity of the technology for such tasks. The purpose of this paper is to re-introduce neural networks to the particle accelerator community and report on some work in neural network control that is being conducted as part of a dedicated collaboration between Fermilab and Colorado State University (CSU). We describe some of the challenges of particle accelerator control, highlight recent advances in neural network techniques, discuss some promising avenues for incorporating neural networks into particle accelerator control systems, and describe a neural network-based control system that is being developed for resonance control of an RF electron gun at the Fermilab Accelerator Science and Technology (FAST) facility, including initial experimental results from a benchmark controller.

Prediction and characterization of protein-protein interaction networks in swine

Directory of Open Access Journals (Sweden)

Wang Fen

2012-01-01

Full Text Available Abstract Background Studying the large-scale protein-protein interaction (PPI network is important in understanding biological processes. The current research presents the first PPI map of swine, which aims to give new insights into understanding their biological processes. Results We used three methods, Interolog-based prediction of porcine PPI network, domain-motif interactions from structural topology-based prediction of porcine PPI network and motif-motif interactions from structural topology-based prediction of porcine PPI network, to predict porcine protein interactions among 25,767 porcine proteins. We predicted 20,213, 331,484, and 218,705 porcine PPIs respectively, merged the three results into 567,441 PPIs, constructed four PPI networks, and analyzed the topological properties of the porcine PPI networks. Our predictions were validated with Pfam domain annotations and GO annotations. Averages of 70, 10,495, and 863 interactions were related to the Pfam domain-interacting pairs in iPfam database. For comparison, randomized networks were generated, and averages of only 4.24, 66.79, and 44.26 interactions were associated with Pfam domain-interacting pairs in iPfam database. In GO annotations, we found 52.68%, 75.54%, 27.20% of the predicted PPIs sharing GO terms respectively. However, the number of PPI pairs sharing GO terms in the 10,000 randomized networks reached 52.68%, 75.54%, 27.20% is 0. Finally, we determined the accuracy and precision of the methods. The methods yielded accuracies of 0.92, 0.53, and 0.50 at precisions of about 0.93, 0.74, and 0.75, respectively. Conclusion The results reveal that the predicted PPI networks are considerably reliable. The present research is an important pioneering work on protein function research. The porcine PPI data set, the confidence score of each interaction and a list of related data are available at (http://pppid.biositemap.com/.

One motif to bind them: A small-XXX-small motif affects transmembrane domain 1 oligomerization, function, localization, and cross-talk between two yeast GPCRs.

Science.gov (United States)

Lock, Antonia; Forfar, Rachel; Weston, Cathryn; Bowsher, Leo; Upton, Graham J G; Reynolds, Christopher A; Ladds, Graham; Dixon, Ann M

2014-12-01

G protein-coupled receptors (GPCRs) are the largest family of cell-surface receptors in mammals and facilitate a range of physiological responses triggered by a variety of ligands. GPCRs were thought to function as monomers, however it is now accepted that GPCR homo- and hetero-oligomers also exist and influence receptor properties. The Schizosaccharomyces pombe GPCR Mam2 is a pheromone-sensing receptor involved in mating and has previously been shown to form oligomers in vivo. The first transmembrane domain (TMD) of Mam2 contains a small-XXX-small motif, overrepresented in membrane proteins and well-known for promoting helix-helix interactions. An ortholog of Mam2 in Saccharomyces cerevisiae, Ste2, contains an analogous small-XXX-small motif which has been shown to contribute to receptor homo-oligomerization, localization and function. Here we have used experimental and computational techniques to characterize the role of the small-XXX-small motif in function and assembly of Mam2 for the first time. We find that disruption of the motif via mutagenesis leads to reduction of Mam2 TMD1 homo-oligomerization and pheromone-responsive cellular signaling of the full-length protein. It also impairs correct targeting to the plasma membrane. Mutation of the analogous motif in Ste2 yielded similar results, suggesting a conserved mechanism for assembly. Using co-expression of the two fungal receptors in conjunction with computational models, we demonstrate a functional change in G protein specificity and propose that this is brought about through hetero-dimeric interactions of Mam2 with Ste2 via the complementary small-XXX-small motifs. This highlights the potential of these motifs to affect a range of properties that can be investigated in other GPCRs. Copyright © 2014. Published by Elsevier B.V.

Wavelet neural network load frequency controller

International Nuclear Information System (INIS)

Hemeida, Ashraf Mohamed

2005-01-01

This paper presents the feasibility of applying a wavelet neural network (WNN) approach for the load frequency controller (LFC) to damp the frequency oscillations of two area power systems due to load disturbances. The present intelligent control system trained the wavelet neural network (WNN) controller on line with adaptive learning rates, which are derived in the sense of a discrete type Lyapunov stability theorem. The present WNN controller is designed individually for each area. The proposed technique is applied successfully for a wide range of operating conditions. The time simulation results indicate its superiority and effectiveness over the conventional approach. The effects of consideration of the governor dead zone on the system performance are studied using the proposed controller and the conventional one

Spike Pattern Structure Influences Synaptic Efficacy Variability Under STDP and Synaptic Homeostasis. I: Spike Generating Models on Converging Motifs

Directory of Open Access Journals (Sweden)

Zedong eBi

2016-02-01

Full Text Available In neural systems, synaptic plasticity is usually driven by spike trains. Due to the inherent noises of neurons and synapses as well as the randomness of connection details, spike trains typically exhibit variability such as spatial randomness and temporal stochasticity, resulting in variability of synaptic changes under plasticity, which we call efficacy variability. How the variability of spike trains influences the efficacy variability of synapses remains unclear. In this paper, we try to understand this influence under pair-wise additive spike-timing dependent plasticity (STDP when the mean strength of plastic synapses into a neuron is bounded (synaptic homeostasis. Specifically, we systematically study, analytically and numerically, how four aspects of statistical features, i.e. synchronous firing, burstiness/regularity, heterogeneity of rates and heterogeneity of cross-correlations, as well as their interactions influence the efficacy variability in converging motifs (simple networks in which one neuron receives from many other neurons. Neurons (including the post-synaptic neuron in a converging motif generate spikes according to statistical models with tunable parameters. In this way, we can explicitly control the statistics of the spike patterns, and investigate their influence onto the efficacy variability, without worrying about the feedback from synaptic changes onto the dynamics of the post-synaptic neuron. We separate efficacy variability into two parts: the drift part (DriftV induced by the heterogeneity of change rates of different synapses, and the diffusion part (DiffV induced by weight diffusion caused by stochasticity of spike trains. Our main findings are: (1 synchronous firing and burstiness tend to increase DiffV, (2 heterogeneity of rates induces DriftV when potentiation and depression in STDP are not balanced, and (3 heterogeneity of cross-correlations induces DriftV together with heterogeneity of rates. We anticipate our

Network device interface for digitally interfacing data channels to a controller via a network

Science.gov (United States)

Ellerbrock, Philip J. (Inventor); Grant, Robert L. (Inventor); Konz, Daniel W. (Inventor); Winkelmann, Joseph P. (Inventor)

2009-01-01

A communications system and method are provided for digitally connecting a plurality of data channels, such as sensors, actuators, and subsystems, to a controller using a network bus. The network device interface interprets commands and data received from the controller and polls the data channels in accordance with these commands. Specifically, the network device interface receives digital commands and data from the controller, and based on these commands and data, communicates with the data channels to either retrieve data in the case of a sensor or send data to activate an actuator. Data retrieved from the sensor is converted into digital signals and transmitted to the controller. Network device interfaces associated with different data channels can coordinate communications with the other interfaces based on either a transition in a command message sent by the bus controller or a synchronous clock signal.

Evolutionarily conserved bias of amino-acid usage refines the definition of PDZ-binding motif

Directory of Open Access Journals (Sweden)

Launey Thomas

2011-06-01

Full Text Available Abstract Background The interactions between PDZ (PSD-95, Dlg, ZO-1 domains and PDZ-binding motifs play central roles in signal transductions within cells. Proteins with PDZ domains bind to PDZ-binding motifs almost exclusively when the motifs are located at the carboxyl (C- terminal ends of their binding partners. However, it remains little explored whether PDZ-binding motifs show any preferential location at the C-terminal ends of proteins, at genome-level. Results Here, we examined the distribution of the type-I (x-x-S/T-x-I/L/V or type-II (x-x-V-x-I/V PDZ-binding motifs in proteins encoded in the genomes of five different species (human, mouse, zebrafish, fruit fly and nematode. We first established that these PDZ-binding motifs are indeed preferentially present at their C-terminal ends. Moreover, we found specific amino acid (AA bias for the 'x' positions in the motifs at the C-terminal ends. In general, hydrophilic AAs were favored. Our genomics-based findings confirm and largely extend the results of previous interaction-based studies, allowing us to propose refined consensus sequences for all of the examined PDZ-binding motifs. An ontological analysis revealed that the refined motifs are functionally relevant since a large fraction of the proteins bearing the motif appear to be involved in signal transduction. Furthermore, co-precipitation experiments confirmed two new protein interactions predicted by our genomics-based approach. Finally, we show that influenza virus pathogenicity can be correlated with PDZ-binding motif, with high-virulence viral proteins bearing a refined PDZ-binding motif. Conclusions Our refined definition of PDZ-binding motifs should provide important clues for identifying functional PDZ-binding motifs and proteins involved in signal transduction.

Goal-congruent default network activity facilitates cognitive control.

Science.gov (United States)

Spreng, R Nathan; DuPre, Elizabeth; Selarka, Dhawal; Garcia, Juliana; Gojkovic, Stefan; Mildner, Judith; Luh, Wen-Ming; Turner, Gary R

2014-10-15

Substantial neuroimaging evidence suggests that spontaneous engagement of the default network impairs performance on tasks requiring executive control. We investigated whether this impairment depends on the congruence between executive control demands and internal mentation. We hypothesized that activation of the default network might enhance performance on an executive control task if control processes engage long-term memory representations that are supported by the default network. Using fMRI, we scanned 36 healthy young adult humans on a novel two-back task requiring working memory for famous and anonymous faces. In this task, participants (1) matched anonymous faces interleaved with anonymous face, (2) matched anonymous faces interleaved with a famous face, or (3) matched a famous faces interleaved with an anonymous face. As predicted, we observed a facilitation effect when matching famous faces, compared with anonymous faces. We also observed greater activation of the default network during these famous face-matching trials. The results suggest that activation of the default network can contribute to task performance during an externally directed executive control task. Our findings provide evidence that successful activation of the default network in a contextually relevant manner facilitates goal-directed cognition. Copyright © 2014 the authors 0270-6474/14/3414108-07$15.00/0.

Fingerprint motifs of phytases | Fan | African Journal of Biotechnology

African Journals Online (AJOL)

Among the total of potential 173 phytases gained in 11 plant genomes through MAST, PAPhys are the major phytases, and HAPhys are the minor, and other phytase groups are not found in planta. Keywords: Phytase, fingerprint motif, multiple EM for motif elicitation (MEME), MAST African Journal of Biotechnology Vol.

Signatures of pleiotropy, economy and convergent evolution in a domain-resolved map of human-virus protein-protein interaction networks.

Science.gov (United States)

Garamszegi, Sara; Franzosa, Eric A; Xia, Yu

2013-01-01

A central challenge in host-pathogen systems biology is the elucidation of general, systems-level principles that distinguish host-pathogen interactions from within-host interactions. Current analyses of host-pathogen and within-host protein-protein interaction networks are largely limited by their resolution, treating proteins as nodes and interactions as edges. Here, we construct a domain-resolved map of human-virus and within-human protein-protein interaction networks by annotating protein interactions with high-coverage, high-accuracy, domain-centric interaction mechanisms: (1) domain-domain interactions, in which a domain in one protein binds to a domain in a second protein, and (2) domain-motif interactions, in which a domain in one protein binds to a short, linear peptide motif in a second protein. Analysis of these domain-resolved networks reveals, for the first time, significant mechanistic differences between virus-human and within-human interactions at the resolution of single domains. While human proteins tend to compete with each other for domain binding sites by means of sequence similarity, viral proteins tend to compete with human proteins for domain binding sites in the absence of sequence similarity. Independent of their previously established preference for targeting human protein hubs, viral proteins also preferentially target human proteins containing linear motif-binding domains. Compared to human proteins, viral proteins participate in more domain-motif interactions, target more unique linear motif-binding domains per residue, and contain more unique linear motifs per residue. Together, these results suggest that viruses surmount genome size constraints by convergently evolving multiple short linear motifs in order to effectively mimic, hijack, and manipulate complex host processes for their survival. Our domain-resolved analyses reveal unique signatures of pleiotropy, economy, and convergent evolution in viral-host interactions that are

Output-feedback control of combined sewer networks through receding horizon control with moving horizon estimation

OpenAIRE

Joseph-Duran, Bernat; Ocampo-Martinez, Carlos; Cembrano, Gabriela

2015-01-01

An output-feedback control strategy for pollution mitigation in combined sewer networks is presented. The proposed strategy provides means to apply model-based predictive control to large-scale sewer networks, in-spite of the lack of measurements at most of the network sewers. In previous works, the authors presented a hybrid linear control-oriented model for sewer networks together with the formulation of Optimal Control Problems (OCP) and State Estimation Problems (SEP). By iteratively solv...

Predictive regulatory models in Drosophila melanogaster by integrative inference of transcriptional networks

Science.gov (United States)

Marbach, Daniel; Roy, Sushmita; Ay, Ferhat; Meyer, Patrick E.; Candeias, Rogerio; Kahveci, Tamer; Bristow, Christopher A.; Kellis, Manolis

2012-01-01

Gaining insights on gene regulation from large-scale functional data sets is a grand challenge in systems biology. In this article, we develop and apply methods for transcriptional regulatory network inference from diverse functional genomics data sets and demonstrate their value for gene function and gene expression prediction. We formulate the network inference problem in a machine-learning framework and use both supervised and unsupervised methods to predict regulatory edges by integrating transcription factor (TF) binding, evolutionarily conserved sequence motifs, gene expression, and chromatin modification data sets as input features. Applying these methods to Drosophila melanogaster, we predict ∼300,000 regulatory edges in a network of ∼600 TFs and 12,000 target genes. We validate our predictions using known regulatory interactions, gene functional annotations, tissue-specific expression, protein–protein interactions, and three-dimensional maps of chromosome conformation. We use the inferred network to identify putative functions for hundreds of previously uncharacterized genes, including many in nervous system development, which are independently confirmed based on their tissue-specific expression patterns. Last, we use the regulatory network to predict target gene expression levels as a function of TF expression, and find significantly higher predictive power for integrative networks than for motif or ChIP-based networks. Our work reveals the complementarity between physical evidence of regulatory interactions (TF binding, motif conservation) and functional evidence (coordinated expression or chromatin patterns) and demonstrates the power of data integration for network inference and studies of gene regulation at the systems level. PMID:22456606

Predictive regulatory models in Drosophila melanogaster by integrative inference of transcriptional networks.

Science.gov (United States)

Marbach, Daniel; Roy, Sushmita; Ay, Ferhat; Meyer, Patrick E; Candeias, Rogerio; Kahveci, Tamer; Bristow, Christopher A; Kellis, Manolis

2012-07-01

Gaining insights on gene regulation from large-scale functional data sets is a grand challenge in systems biology. In this article, we develop and apply methods for transcriptional regulatory network inference from diverse functional genomics data sets and demonstrate their value for gene function and gene expression prediction. We formulate the network inference problem in a machine-learning framework and use both supervised and unsupervised methods to predict regulatory edges by integrating transcription factor (TF) binding, evolutionarily conserved sequence motifs, gene expression, and chromatin modification data sets as input features. Applying these methods to Drosophila melanogaster, we predict ∼300,000 regulatory edges in a network of ∼600 TFs and 12,000 target genes. We validate our predictions using known regulatory interactions, gene functional annotations, tissue-specific expression, protein-protein interactions, and three-dimensional maps of chromosome conformation. We use the inferred network to identify putative functions for hundreds of previously uncharacterized genes, including many in nervous system development, which are independently confirmed based on their tissue-specific expression patterns. Last, we use the regulatory network to predict target gene expression levels as a function of TF expression, and find significantly higher predictive power for integrative networks than for motif or ChIP-based networks. Our work reveals the complementarity between physical evidence of regulatory interactions (TF binding, motif conservation) and functional evidence (coordinated expression or chromatin patterns) and demonstrates the power of data integration for network inference and studies of gene regulation at the systems level.

Dynamic Intelligent Feedback Scheduling in Networked Control Systems

Directory of Open Access Journals (Sweden)

Hui-ying Chen

2013-01-01

Full Text Available For the networked control system with limited bandwidth and flexible workload, a dynamic intelligent feedback scheduling strategy is proposed. Firstly, a monitor is used to acquire the current available network bandwidth. Then, the new available bandwidth in the next interval is predicted by using LS_SVM approach. At the same time, the dynamic performance indices of all control loops are obtained with a two-dimensional fuzzy logic modulator. Finally, the predicted network bandwidth is dynamically allocated by the bandwidth manager and the priority allocator in terms of the loops' dynamic performance indices. Simulation results show that the sampling periods and priorities of control loops are adjusted timely according to the network workload condition and the dynamic performance of control loops, which make the system running in the optimal state all the time.

Short Arginine Motifs Drive Protein Stickiness in the Escherichia coli Cytoplasm.

Science.gov (United States)

Kyne, Ciara; Crowley, Peter B

2017-09-19

Although essential to numerous biotech applications, knowledge of molecular recognition by arginine-rich motifs in live cells remains limited. 1 H, 15 N HSQC and 19 F NMR spectroscopies were used to investigate the effects of C-terminal -GR n (n = 1-5) motifs on GB1 interactions in Escherichia coli cells and cell extracts. While the "biologically inert" GB1 yields high-quality in-cell spectra, the -GR n fusions with n = 4 or 5 were undetectable. This result suggests that a tetra-arginine motif is sufficient to drive interactions between a test protein and macromolecules in the E. coli cytoplasm. The inclusion of a 12 residue flexible linker between GB1 and the -GR 5 motif did not improve detection of the "inert" domain. In contrast, all of the constructs were detectable in cell lysates and extracts, suggesting that the arginine-mediated complexes were weak. Together these data reveal the significance of weak interactions between short arginine-rich motifs and the E. coli cytoplasm and demonstrate the potential of such motifs to modify protein interactions in living cells. These interactions must be considered in the design of (in vivo) nanoscale assemblies that rely on arginine-rich sequences.

Topology Control in Aerial Multi-Beam Directional Networks

Science.gov (United States)

2017-04-24

Topology Control in Aerial Multi-Beam Directional Networks Brian Proulx, Nathaniel M. Jones, Jennifer Madiedo, Greg Kuperman {brian.proulx, njones...significant interference. Topology control (i.e., selecting a subset of neighbors to communicate with) is vital to reduce the interference. Good topology ...underlying challenges to topology control in multi-beam direction networks. Two topology control algorithms are developed: a centralized algorithm

Anion induced conformational preference of Cα NN motif residues in functional proteins.

Science.gov (United States)

Patra, Piya; Ghosh, Mahua; Banerjee, Raja; Chakrabarti, Jaydeb

2017-12-01

Among different ligand binding motifs, anion binding C α NN motif consisting of peptide backbone atoms of three consecutive residues are observed to be important for recognition of free anions, like sulphate or biphosphate and participate in different key functions. Here we study the interaction of sulphate and biphosphate with C α NN motif present in different proteins. Instead of total protein, a peptide fragment has been studied keeping C α NN motif flanked in between other residues. We use classical force field based molecular dynamics simulations to understand the stability of this motif. Our data indicate fluctuations in conformational preferences of the motif residues in absence of the anion. The anion gives stability to one of these conformations. However, the anion induced conformational preferences are highly sequence dependent and specific to the type of anion. In particular, the polar residues are more favourable compared to the other residues for recognising the anion. © 2017 Wiley Periodicals, Inc.

Finding a Leucine in a Haystack: Searching the Proteome for ambigous Leucine-Aspartic Acid motifs

KAUST Repository

Arold, Stefan T.

2016-01-25

Leucine-aspartic acid (LD) motifs are short helical protein-protein interaction motifs involved in cell motility, survival and communication. LD motif interactions are also implicated in cancer metastasis and are targeted by several viruses. LD motifs are notoriously difficult to detect because sequence pattern searches lead to an excessively high number of false positives. Hence, despite 20 years of research, only six LD motif–containing proteins are known in humans, three of which are close homologues of the paxillin family. To enable the proteome-wide discovery of LD motifs, we developed LD Motif Finder (LDMF), a web tool based on machine learning that combines sequence information with structural predictions to detect LD motifs with high accuracy. LDMF predicted 13 new LD motifs in humans. Using biophysical assays, we experimentally confirmed in vitro interactions for four novel LD motif proteins. Thus, LDMF allows proteome-wide discovery of LD motifs, despite a highly ambiguous sequence pattern. Functional implications will be discussed.

Energy efficient topology control algorithm for wireless mesh networks

CSIR Research Space (South Africa)

Aron, FO

2008-08-01

Full Text Available The control of the topology of a network makes it possible for the network nodes to reduce their power of transmission while ensuring that network connectivity is preserved. This paper explains the need for energy consumption control in Wireless...

Observability and Controllability of Networks: Symmetry in Representations of Brains and Controllers for Epidemics

Science.gov (United States)

Schiff, Steven

Observability and controllability are essential concepts to the design of predictive observer models and feedback controllers of networked systems. We present a numerical and group representational framework, to quantify the observability and controllability of nonlinear networks with explicit symmetries that shows the connection between symmetries and nonlinear measures of observability and controllability. In addition to the topology of brain networks, we have advanced our ability to represent network nodes within the brain using conservation principles and more accurate biophysics that unifies the dynamics of spikes, seizures, and spreading depression. Lastly, we show how symmetries in controller design can be applied to infectious disease epidemics. NIH Grants 1R01EB014641, 1DP1HD086071.

A proposed vestigial translation initiation motif in VP1 of hepatitis A virus.

Science.gov (United States)

Kang, Jeong-Ah; Funkhouser, Ann W

2002-07-01

The internal ribosome entry site (IRES) of picornaviruses has a 3' polypyrimidine tract (PPT) 16-24 bases upstream of an AUG triplet (PPT/AUG motif). This motif is critical in determining the efficiency of cap-independent translation. HAV has a conserved PPT/AUG motif consisting of a nine base sequence (AGGUUUUUC) 23 bases upstream of the preferred AUG start codon. This HAV-specific PPT/AUG motif is repeated and conserved in VP1 of HAV, but not of other picornaviruses. We proposed that the PPT/AUG motif in the open reading frame initiated translation and/or had an impact on the life cycle of the virus. In vitro translation of mutant bicistronic mRNAs and growth in cell culture of mutant viruses provided no evidence that the VP1 PPT/AUG motif had any impact on either translation or growth. HAV differs from other picornaviruses in its inefficient growth in cell culture. Since the HAV-specific PPT/AUG motif is found in only 1 in 300,000 reported viral sequences outside the hepatovirus genus, this motif may be a vestigial translation initiation element and may have played a role in determining the unusual phenotype of HAV.

High intensity proton accelerator controls network upgrade

International Nuclear Information System (INIS)

Krempaska, R.; Bertrand, A.; Lendzian, F.; Lutz, H.

2012-01-01

The High Intensity Proton Accelerator (HIPA) control system network is spread through a vast area in PSI and it was grown historically in an unorganized way. The miscellaneous network hardware infrastructure and the lack of the documentation and components overview could no longer guarantee the reliability of the control system and the facility operation. Therefore, a new network, based on modern network topology, PSI standard hardware with monitoring and detailed documentation and overview was needed. The number of active components has been reduced from 25 to 9 Cisco Catalyst 24- or 48-port switches. They are the same type as other PSI switches, thus a replacement emergency stock is not an issue anymore. We would like to present how we successfully achieved this goal and the advantages of the clean and well documented network infrastructure. (authors)

CMD: A Database to Store the Bonding States of Cysteine Motifs with Secondary Structures

Directory of Open Access Journals (Sweden)

Hamed Bostan

2012-01-01

Full Text Available Computational approaches to the disulphide bonding state and its connectivity pattern prediction are based on various descriptors. One descriptor is the amino acid sequence motifs flanking the cysteine residue motifs. Despite the existence of disulphide bonding information in many databases and applications, there is no complete reference and motif query available at the moment. Cysteine motif database (CMD is the first online resource that stores all cysteine residues, their flanking motifs with their secondary structure, and propensity values assignment derived from the laboratory data. We extracted more than 3 million cysteine motifs from PDB and UniProt data, annotated with secondary structure assignment, propensity value assignment, and frequency of occurrence and coefficiency of their bonding status. Removal of redundancies generated 15875 unique flanking motifs that are always bonded and 41577 unique patterns that are always nonbonded. Queries are based on the protein ID, FASTA sequence, sequence motif, and secondary structure individually or in batch format using the provided APIs that allow remote users to query our database via third party software and/or high throughput screening/querying. The CMD offers extensive information about the bonded, free cysteine residues, and their motifs that allows in-depth characterization of the sequence motif composition.

BEAM web server: a tool for structural RNA motif discovery.

Science.gov (United States)

Pietrosanto, Marco; Adinolfi, Marta; Casula, Riccardo; Ausiello, Gabriele; Ferrè, Fabrizio; Helmer-Citterich, Manuela

2018-03-15

RNA structural motif finding is a relevant problem that becomes computationally hard when working on high-throughput data (e.g. eCLIP, PAR-CLIP), often represented by thousands of RNA molecules. Currently, the BEAM server is the only web tool capable to handle tens of thousands of RNA in input with a motif discovery procedure that is only limited by the current secondary structure prediction accuracies. The recently developed method BEAM (BEAr Motifs finder) can analyze tens of thousands of RNA molecules and identify RNA secondary structure motifs associated to a measure of their statistical significance. BEAM is extremely fast thanks to the BEAR encoding that transforms each RNA secondary structure in a string of characters. BEAM also exploits the evolutionary knowledge contained in a substitution matrix of secondary structure elements, extracted from the RFAM database of families of homologous RNAs. The BEAM web server has been designed to streamline data pre-processing by automatically handling folding and encoding of RNA sequences, giving users a choice for the preferred folding program. The server provides an intuitive and informative results page with the list of secondary structure motifs identified, the logo of each motif, its significance, graphic representation and information about its position in the RNA molecules sharing it. The web server is freely available at http://beam.uniroma2.it/ and it is implemented in NodeJS and Python with all major browsers supported. marco.pietrosanto@uniroma2.it. Supplementary data are available at Bioinformatics online.

Optimization of stochastic discrete systems and control on complex networks computational networks

CERN Document Server

Lozovanu, Dmitrii

2014-01-01

This book presents the latest findings on stochastic dynamic programming models and on solving optimal control problems in networks. It includes the authors' new findings on determining the optimal solution of discrete optimal control problems in networks and on solving game variants of Markov decision problems in the context of computational networks. First, the book studies the finite state space of Markov processes and reviews the existing methods and algorithms for determining the main characteristics in Markov chains, before proposing new approaches based on dynamic programming and combinatorial methods. Chapter two is dedicated to infinite horizon stochastic discrete optimal control models and Markov decision problems with average and expected total discounted optimization criteria, while Chapter three develops a special game-theoretical approach to Markov decision processes and stochastic discrete optimal control problems. In closing, the book's final chapter is devoted to finite horizon stochastic con...

Review article: The mountain motif in the plot of Matthew

Directory of Open Access Journals (Sweden)

Gert J. Volschenk

2010-09-01

Full Text Available This article reviewed T.L. Donaldson’s book, Jesus on the mountain: A study in Matthean theology, published in 1985 by JSOT Press, Sheffield, and focused on the mountain motif in the structure and plot of the Gospel of Matthew, in addition to the work of Donaldson on the mountain motif as a literary motif and as theological symbol. The mountain is a primary theological setting for Jesus’ ministry and thus is an important setting, serving as one of the literary devices by which Matthew structured and progressed his narrative. The Zion theological and eschatological significance and Second Temple Judaism serve as the historical and theological background for the mountain motif. The last mountain setting (Mt 28:16–20 is the culmination of the three theological themes in the plot of Matthew, namely Christology, ecclesiology and salvation history.

The heptanucleotide motif GAGACGC is a key component of a cis-acting promoter element that is critical for SnSAG1 expression in Sarcocystis neurona.

Science.gov (United States)

Gaji, Rajshekhar Y; Howe, Daniel K

2009-07-01

The apicomplexan parasite Sarcocystis neurona undergoes a complex process of intracellular development, during which many genes are temporally regulated. The described study was undertaken to begin identifying the basic promoter elements that control gene expression in S. neurona. Sequence analysis of the 5'-flanking region of five S. neurona genes revealed a conserved heptanucleotide motif GAGACGC that is similar to the WGAGACG motif described upstream of multiple genes in Toxoplasma gondii. The promoter region for the major surface antigen gene SnSAG1, which contains three heptanucleotide motifs within 135 bases of the transcription start site, was dissected by functional analysis using a dual luciferase reporter assay. These analyses revealed that a minimal promoter fragment containing all three motifs was sufficient to drive reporter molecule expression, with the presence and orientation of the 5'-most heptanucleotide motif being absolutely critical for promoter function. Further studies should help to identify additional sequence elements important for promoter function and for controlling gene expression during intracellular development by this apicomplexan pathogen.

Seed storage protein gene promoters contain conserved DNA motifs in Brassicaceae, Fabaceae and Poaceae

Science.gov (United States)

Fauteux, François; Strömvik, Martina V

2009-01-01

Background Accurate computational identification of cis-regulatory motifs is difficult, particularly in eukaryotic promoters, which typically contain multiple short and degenerate DNA sequences bound by several interacting factors. Enrichment in combinations of rare motifs in the promoter sequence of functionally or evolutionarily related genes among several species is an indicator of conserved transcriptional regulatory mechanisms. This provides a basis for the computational identification of cis-regulatory motifs. Results We have used a discriminative seeding DNA motif discovery algorithm for an in-depth analysis of 54 seed storage protein (SSP) gene promoters from three plant families, namely Brassicaceae (mustards), Fabaceae (legumes) and Poaceae (grasses) using backgrounds based on complete sets of promoters from a representative species in each family, namely Arabidopsis (Arabidopsis thaliana (L.) Heynh.), soybean (Glycine max (L.) Merr.) and rice (Oryza sativa L.) respectively. We have identified three conserved motifs (two RY-like and one ACGT-like) in Brassicaceae and Fabaceae SSP gene promoters that are similar to experimentally characterized seed-specific cis-regulatory elements. Fabaceae SSP gene promoter sequences are also enriched in a novel, seed-specific E2Fb-like motif. Conserved motifs identified in Poaceae SSP gene promoters include a GCN4-like motif, two prolamin-box-like motifs and an Skn-1-like motif. Evidence of the presence of a variant of the TATA-box is found in the SSP gene promoters from the three plant families. Motifs discovered in SSP gene promoters were used to score whole-genome sets of promoters from Arabidopsis, soybean and rice. The highest-scoring promoters are associated with genes coding for different subunits or precursors of seed storage proteins. Conclusion Seed storage protein gene promoter motifs are conserved in diverse species, and different plant families are characterized by a distinct combination of conserved motifs

Seed storage protein gene promoters contain conserved DNA motifs in Brassicaceae, Fabaceae and Poaceae

Directory of Open Access Journals (Sweden)

Fauteux François

2009-10-01

Full Text Available Abstract Background Accurate computational identification of cis-regulatory motifs is difficult, particularly in eukaryotic promoters, which typically contain multiple short and degenerate DNA sequences bound by several interacting factors. Enrichment in combinations of rare motifs in the promoter sequence of functionally or evolutionarily related genes among several species is an indicator of conserved transcriptional regulatory mechanisms. This provides a basis for the computational identification of cis-regulatory motifs. Results We have used a discriminative seeding DNA motif discovery algorithm for an in-depth analysis of 54 seed storage protein (SSP gene promoters from three plant families, namely Brassicaceae (mustards, Fabaceae (legumes and Poaceae (grasses using backgrounds based on complete sets of promoters from a representative species in each family, namely Arabidopsis (Arabidopsis thaliana (L. Heynh., soybean (Glycine max (L. Merr. and rice (Oryza sativa L. respectively. We have identified three conserved motifs (two RY-like and one ACGT-like in Brassicaceae and Fabaceae SSP gene promoters that are similar to experimentally characterized seed-specific cis-regulatory elements. Fabaceae SSP gene promoter sequences are also enriched in a novel, seed-specific E2Fb-like motif. Conserved motifs identified in Poaceae SSP gene promoters include a GCN4-like motif, two prolamin-box-like motifs and an Skn-1-like motif. Evidence of the presence of a variant of the TATA-box is found in the SSP gene promoters from the three plant families. Motifs discovered in SSP gene promoters were used to score whole-genome sets of promoters from Arabidopsis, soybean and rice. The highest-scoring promoters are associated with genes coding for different subunits or precursors of seed storage proteins. Conclusion Seed storage protein gene promoter motifs are conserved in diverse species, and different plant families are characterized by a distinct combination

Controllability of Weighted and Directed Networks with Nonidentical Node Dynamics

Directory of Open Access Journals (Sweden)

Linying Xiang

2013-01-01

Full Text Available The concept of controllability from control theory is applied to weighted and directed networks with heterogenous linear or linearized node dynamics subject to exogenous inputs, where the nodes are grouped into leaders and followers. Under this framework, the controllability of the controlled network can be decomposed into two independent problems: the controllability of the isolated leader subsystem and the controllability of the extended follower subsystem. Some necessary and/or sufficient conditions for the controllability of the leader-follower network are derived based on matrix theory and graph theory. In particular, it is shown that a single-leader network is controllable if it is a directed path or cycle, but it is uncontrollable for a complete digraph or a star digraph in general. Furthermore, some approaches to improving the controllability of a heterogenous network are presented. Some simulation examples are given for illustration and verification.

A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks.

Science.gov (United States)

Li, Yuhong; Gong, Guanghong; Li, Ni

2018-01-01

In this paper, we propose a novel algorithm-parallel adaptive quantum genetic algorithm-which can rapidly determine the minimum control nodes of arbitrary networks with both control nodes and state nodes. The corresponding network can be fully controlled with the obtained control scheme. We transformed the network controllability issue into a combinational optimization problem based on the Popov-Belevitch-Hautus rank condition. A set of canonical networks and a list of real-world networks were experimented. Comparison results demonstrated that the algorithm was more ideal to optimize the controllability of networks, especially those larger-size networks. We demonstrated subsequently that there were links between the optimal control nodes and some network statistical characteristics. The proposed algorithm provides an effective approach to improve the controllability optimization of large networks or even extra-large networks with hundreds of thousands nodes.

A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks

Science.gov (United States)

Li, Yuhong

2018-01-01

In this paper, we propose a novel algorithm—parallel adaptive quantum genetic algorithm—which can rapidly determine the minimum control nodes of arbitrary networks with both control nodes and state nodes. The corresponding network can be fully controlled with the obtained control scheme. We transformed the network controllability issue into a combinational optimization problem based on the Popov-Belevitch-Hautus rank condition. A set of canonical networks and a list of real-world networks were experimented. Comparison results demonstrated that the algorithm was more ideal to optimize the controllability of networks, especially those larger-size networks. We demonstrated subsequently that there were links between the optimal control nodes and some network statistical characteristics. The proposed algorithm provides an effective approach to improve the controllability optimization of large networks or even extra-large networks with hundreds of thousands nodes. PMID:29554140

Active queue management controller design for TCP communication networks: Variable structure control approach

International Nuclear Information System (INIS)

Chen, C.-K.; Liao, T.-L.; Yan, J.-J.

2009-01-01

On the basis of variable structure control (VSC), an active queue management (AQM) controller is presented for a class of TCP communication networks. In the TCP/IP networks, the packet drop probability is limited between 0 and 1. Therefore, we modeled TCP/AQM as a rate-based non-linear system with a saturated input. The objective of the VSC-based AQM controller is to achieve the desired queue size and to guarantee the asymptotic stability of the closed-loop TCP non-linear system with saturated input. The performance and effectiveness of the proposed control law are then validated for different network scenarios through numerical simulations in both MATLAB and Network Simulator-2 (NS-2). Both sets of simulation results have confirmed that the proposed scheme outperforms other AQM schemes.

Active queue management controller design for TCP communication networks: Variable structure control approach

Energy Technology Data Exchange (ETDEWEB)

Chen, C.-K. [Department of Engineering Science, National Cheng Kung University, Tainan 701, Taiwan (China); Liao, T.-L. [Department of Engineering Science, National Cheng Kung University, Tainan 701, Taiwan (China)], E-mail: tlliao@mail.ncku.edu; Yan, J.-J. [Department of Computer and Communication, Shu-Te University, Kaohsiung 824, Taiwan (China)

2009-04-15

On the basis of variable structure control (VSC), an active queue management (AQM) controller is presented for a class of TCP communication networks. In the TCP/IP networks, the packet drop probability is limited between 0 and 1. Therefore, we modeled TCP/AQM as a rate-based non-linear system with a saturated input. The objective of the VSC-based AQM controller is to achieve the desired queue size and to guarantee the asymptotic stability of the closed-loop TCP non-linear system with saturated input. The performance and effectiveness of the proposed control law are then validated for different network scenarios through numerical simulations in both MATLAB and Network Simulator-2 (NS-2). Both sets of simulation results have confirmed that the proposed scheme outperforms other AQM schemes.

Distance-dependent duplex DNA destabilization proximal to G-quadruplex/i-motif sequences

Science.gov (United States)

König, Sebastian L. B.; Huppert, Julian L.; Sigel, Roland K. O.; Evans, Amanda C.

2013-01-01

G-quadruplexes and i-motifs are complementary examples of non-canonical nucleic acid substructure conformations. G-quadruplex thermodynamic stability has been extensively studied for a variety of base sequences, but the degree of duplex destabilization that adjacent quadruplex structure formation can cause has yet to be fully addressed. Stable in vivo formation of these alternative nucleic acid structures is likely to be highly dependent on whether sufficient spacing exists between neighbouring duplex- and quadruplex-/i-motif-forming regions to accommodate quadruplexes or i-motifs without disrupting duplex stability. Prediction of putative G-quadruplex-forming regions is likely to be assisted by further understanding of what distance (number of base pairs) is required for duplexes to remain stable as quadruplexes or i-motifs form. Using oligonucleotide constructs derived from precedented G-quadruplexes and i-motif-forming bcl-2 P1 promoter region, initial biophysical stability studies indicate that the formation of G-quadruplex and i-motif conformations do destabilize proximal duplex regions. The undermining effect that quadruplex formation can have on duplex stability is mitigated with increased distance from the duplex region: a spacing of five base pairs or more is sufficient to maintain duplex stability proximal to predicted quadruplex/i-motif-forming regions. PMID:23771141

Feedback Gating Control for Network Based on Macroscopic Fundamental Diagram

Directory of Open Access Journals (Sweden)

YangBeibei Ji

2016-01-01

Full Text Available Empirical data from Yokohama, Japan, showed that a macroscopic fundamental diagram (MFD of urban traffic provides for different network regions a unimodal low-scatter relationship between network vehicle density and network space-mean flow. This provides new tools for network congestion control. Based on MFD, this paper proposed a feedback gating control policy which can be used to mitigate network congestion by adjusting signal timings of gating intersections. The objective of the feedback gating control model is to maximize the outflow and distribute the allowed inflows properly according to external demand and capacity of each gating intersection. An example network is used to test the performance of proposed feedback gating control model. Two types of background signalization types for the intersections within the test network, fixed-time and actuated control, are considered. The results of extensive simulation validate that the proposed feedback gating control model can get a Pareto improvement since the performance of both gating intersections and the whole network can be improved significantly especially under heavy demand situations. The inflows and outflows can be improved to a higher level, and the delay and queue length at all gating intersections are decreased dramatically.

REAL TIME ANALYSIS OF WIRELESS CONTROLLER AREA NETWORK

Directory of Open Access Journals (Sweden)

Gerardine Immaculate Mary

2014-09-01

Full Text Available It is widely known that Control Area Networks (CAN are used in real-time, distributed and parallel processing which cover manufacture plants, humanoid robots, networking fields, etc., In applications where wireless conditions are encountered it is convenient to continue the exchange of CAN frames within the Wireless CAN (WCAN. The WCAN considered in this research is based on wireless token ring protocol (WTRP; a MAC protocol for wireless networks to reduce the number of retransmissions due to collision and the wired counterpart CAN attribute on message based communication. WCAN uses token frame method to provide channel access to the nodes in the system. This method allow all the nodes to share common broadcast channel by taken turns in transmitting upon receiving the token frame which is circulating within the network for specified amount of time. This method provides high throughput in bounded latency environment, consistent and predictable delays and good packet delivery ratio. The most important factor to consider when evaluating a control network is the end-to-end time delay between sensors, controllers, and actuators. The correct operation of a control system depends on the timeliness of the data coming over the network, and thus, a control network should be able to guarantee message delivery within a bounded transmission time. The proposed WCAN is modeled and simulated using QualNet, and its average end to end delay and packet delivery ratio (PDR are calculated. The parameters boundaries of WCAN are evaluated to guarantee a maximum throughput and a minimum latency time, in the case of wireless communications, precisely WCAN.

Generalized Mutual Synchronization between Two Controlled Interdependent Networks

Directory of Open Access Journals (Sweden)

Quan Xu

2014-01-01

Full Text Available This paper mainly focuses on the generalized mutual synchronization between two controlled interdependent networks. First, we propose the general model of controlled interdependent networks A and B with time-varying internetwork delays coupling. Then, by constructing Lyapunov functions and utilizing adaptive control technique, some sufficient conditions are established to ensure that the mutual synchronization errors between the state variables of networks A and B can asymptotically converge to zero. Finally, two numerical examples are given to illustrate the effectiveness of the theoretical results and to explore potential application in future smart grid. The simulation results also show how interdependent topologies and internetwork coupling delays influence the mutual synchronizability, which help to design interdependent networks with optimal mutual synchronizability.

Controlling the dynamics of multi-state neural networks

International Nuclear Information System (INIS)

Jin, Tao; Zhao, Hong

2008-01-01

In this paper, we first analyze the distribution of local fields (DLF) which is induced by the memory patterns in the Q-Ising model. It is found that the structure of the DLF is closely correlated with the network dynamics and the system performance. However, the design rule adopted in the Q-Ising model, like the other rules adopted for multi-state neural networks with associative memories, cannot be applied to directly control the DLF for a given set of memory patterns, and thus cannot be applied to further study the relationships between the structure of the DLF and the dynamics of the network. We then extend a design rule, which was presented recently for designing binary-state neural networks, to make it suitable for designing general multi-state neural networks. This rule is able to control the structure of the DLF as expected. We show that controlling the DLF not only can affect the dynamic behaviors of the multi-state neural networks for a given set of memory patterns, but also can improve the storage capacity. With the change of the DLF, the network shows very rich dynamic behaviors, such as the 'chaos phase', the 'memory phase', and the 'mixture phase'. These dynamic behaviors are also observed in the binary-state neural networks; therefore, our results imply that they may be the universal behaviors of feedback neural networks

Annotating RNA motifs in sequences and alignments.

Science.gov (United States)

Gardner, Paul P; Eldai, Hisham

2015-01-01

RNA performs a diverse array of important functions across all cellular life. These functions include important roles in translation, building translational machinery and maturing messenger RNA. More recent discoveries include the miRNAs and bacterial sRNAs that regulate gene expression, the thermosensors, riboswitches and other cis-regulatory elements that help prokaryotes sense their environment and eukaryotic piRNAs that suppress transposition. However, there can be a long period between the initial discovery of a RNA and determining its function. We present a bioinformatic approach to characterize RNA motifs, which are critical components of many RNA structure-function relationships. These motifs can, in some instances, provide researchers with functional hypotheses for uncharacterized RNAs. Moreover, we introduce a new profile-based database of RNA motifs--RMfam--and illustrate some applications for investigating the evolution and functional characterization of RNA. All the data and scripts associated with this work are available from: https://github.com/ppgardne/RMfam. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.

Thermal Stability of Modified i-Motif Oligonucleotides with Naphthalimide Intercalating Nucleic Acids

DEFF Research Database (Denmark)

El-Sayed, Ahmed Ali; Pedersen, Erik B.; Khaireldin, Nahid Y.

2016-01-01

In continuation of our investigation of characteristics and thermodynamic properties of the i-motif 5′-d[(CCCTAA)3CCCT)] upon insertion of intercalating nucleotides into the cytosine-rich oligonucleotide, this article evaluates the stabilities of i-motif oligonucleotides upon insertion of naphtha......In continuation of our investigation of characteristics and thermodynamic properties of the i-motif 5′-d[(CCCTAA)3CCCT)] upon insertion of intercalating nucleotides into the cytosine-rich oligonucleotide, this article evaluates the stabilities of i-motif oligonucleotides upon insertion...... of naphthalimide (1H-benzo[de]isoquinoline-1,3(2H)-dione) as the intercalating nucleic acid. The stabilities of i-motif structures with inserted naphthalimide intercalating nucleotides were studied using UV melting temperatures (Tm) and circular dichroism spectra at different pH values and conditions (crowding...

Development of Active External Network Topology Module for Floodlight SDN Controller

Directory of Open Access Journals (Sweden)

A. A. Noskov

2015-01-01

Full Text Available Traditional network architecture is inflexible and complicated. This observation has led to a paradigm shift towards software-defined networking (SDN, where network management level is separated from data forwarding level. This change was made possible by control plane transfer from the switching equipment to software modules that run on a dedicated server, called the controller (or network operating system, or network applications, that work with this controller. Methods of representation, storage and communication interfaces with network topology elements are the most important aspects of network operating systems available to SDN user because performance of some key controller modules is heavily dependent on internal representation of the network topology. Notably, firewall and routing modules are examples of such modules. This article describes the methods used for presentation and storage of network topologies, as well as interface to the corresponding Floodlight modules. An alternative algorithm has been suggested and developed for message exchange conveying network topology alterations between the controller and network applications. Proposed algorithm makes implementation of module alerting based on subscription to the relevant events. API for interaction between controller and network applications has been developed. This algorithm and API formed the base for Topology Tracker module capable to inform network applications about the changes that had occurred in the network topology and also stores compact representation of the network to speed up the interaction process.

Modern computer networks and distributed intelligence in accelerator controls

International Nuclear Information System (INIS)

Briegel, C.

1991-01-01

Appropriate hardware and software network protocols are surveyed for accelerator control environments. Accelerator controls network topologies are discussed with respect to the following criteria: vertical versus horizontal and distributed versus centralized. Decision-making considerations are provided for accelerator network architecture specification. Current trends and implementations at Fermilab are discussed

WildSpan: mining structured motifs from protein sequences

Directory of Open Access Journals (Sweden)

Chen Chien-Yu

2011-03-01

Full Text Available Abstract Background Automatic extraction of motifs from biological sequences is an important research problem in study of molecular biology. For proteins, it is desired to discover sequence motifs containing a large number of wildcard symbols, as the residues associated with functional sites are usually largely separated in sequences. Discovering such patterns is time-consuming because abundant combinations exist when long gaps (a gap consists of one or more successive wildcards are considered. Mining algorithms often employ constraints to narrow down the search space in order to increase efficiency. However, improper constraint models might degrade the sensitivity and specificity of the motifs discovered by computational methods. We previously proposed a new constraint model to handle large wildcard regions for discovering functional motifs of proteins. The patterns that satisfy the proposed constraint model are called W-patterns. A W-pattern is a structured motif that groups motif symbols into pattern blocks interleaved with large irregular gaps. Considering large gaps reflects the fact that functional residues are not always from a single region of protein sequences, and restricting motif symbols into clusters corresponds to the observation that short motifs are frequently present within protein families. To efficiently discover W-patterns for large-scale sequence annotation and function prediction, this paper first formally introduces the problem to solve and proposes an algorithm named WildSpan (sequential pattern mining across large wildcard regions that incorporates several pruning strategies to largely reduce the mining cost. Results WildSpan is shown to efficiently find W-patterns containing conserved residues that are far separated in sequences. We conducted experiments with two mining strategies, protein-based and family-based mining, to evaluate the usefulness of W-patterns and performance of WildSpan. The protein-based mining mode

Passivity-based control and estimation in networked robotics

CERN Document Server

Hatanaka, Takeshi; Fujita, Masayuki; Spong, Mark W

2015-01-01

Highlighting the control of networked robotic systems, this book synthesizes a unified passivity-based approach to an emerging cross-disciplinary subject. Thanks to this unified approach, readers can access various state-of-the-art research fields by studying only the background foundations associated with passivity. In addition to the theoretical results and techniques,  the authors provide experimental case studies on testbeds of robotic systems  including networked haptic devices, visual robotic systems,  robotic network systems and visual sensor network systems. The text begins with an introduction to passivity and passivity-based control together with the other foundations needed in this book. The main body of the book consists of three parts. The first examines how passivity can be utilized for bilateral teleoperation and demonstrates the inherent robustness of the passivity-based controller against communication delays. The second part emphasizes passivity’s usefulness for visual feedback control ...

Thermoelastic steam turbine rotor control based on neural network

Science.gov (United States)

Rzadkowski, Romuald; Dominiczak, Krzysztof; Radulski, Wojciech; Szczepanik, R.

2015-12-01

Considered here are Nonlinear Auto-Regressive neural networks with eXogenous inputs (NARX) as a mathematical model of a steam turbine rotor for controlling steam turbine stress on-line. In order to obtain neural networks that locate critical stress and temperature points in the steam turbine during transient states, an FE rotor model was built. This model was used to train the neural networks on the basis of steam turbine transient operating data. The training included nonlinearity related to steam turbine expansion, heat exchange and rotor material properties during transients. Simultaneous neural networks are algorithms which can be implemented on PLC controllers. This allows for the application neural networks to control steam turbine stress in industrial power plants.

Sparse cliques trump scale-free networks in coordination and competition

Science.gov (United States)

Gianetto, David A.; Heydari, Babak

2016-02-01

Cooperative behavior, a natural, pervasive and yet puzzling phenomenon, can be significantly enhanced by networks. Many studies have shown how global network characteristics affect cooperation; however, it is difficult to understand how this occurs based on global factors alone, low-level network building blocks, or motifs are necessary. In this work, we systematically alter the structure of scale-free and clique networks and show, through a stochastic evolutionary game theory model, that cooperation on cliques increases linearly with community motif count. We further show that, for reactive stochastic strategies, network modularity improves cooperation in the anti-coordination Snowdrift game and the Prisoner’s Dilemma game but not in the Stag Hunt coordination game. We also confirm the negative effect of the scale-free graph on cooperation when effective payoffs are used. On the flip side, clique graphs are highly cooperative across social environments. Adding cycles to the acyclic scale-free graph increases cooperation when multiple games are considered; however, cycles have the opposite effect on how forgiving agents are when playing the Prisoner’s Dilemma game.

Binding properties of SUMO-interacting motifs (SIMs) in yeast.

Science.gov (United States)

Jardin, Christophe; Horn, Anselm H C; Sticht, Heinrich

2015-03-01

Small ubiquitin-like modifier (SUMO) conjugation and interaction play an essential role in many cellular processes. A large number of yeast proteins is known to interact non-covalently with SUMO via short SUMO-interacting motifs (SIMs), but the structural details of this interaction are yet poorly characterized. In the present work, sequence analysis of a large dataset of 148 yeast SIMs revealed the existence of a hydrophobic core binding motif and a preference for acidic residues either within or adjacent to the core motif. Thus the sequence properties of yeast SIMs are highly similar to those described for human. Molecular dynamics simulations were performed to investigate the binding preferences for four representative SIM peptides differing in the number and distribution of acidic residues. Furthermore, the relative stability of two previously observed alternative binding orientations (parallel, antiparallel) was assessed. For all SIMs investigated, the antiparallel binding mode remained stable in the simulations and the SIMs were tightly bound via their hydrophobic core residues supplemented by polar interactions of the acidic residues. In contrary, the stability of the parallel binding mode is more dependent on the sequence features of the SIM motif like the number and position of acidic residues or the presence of additional adjacent interaction motifs. This information should be helpful to enhance the prediction of SIMs and their binding properties in different organisms to facilitate the reconstruction of the SUMO interactome.

Multi-agent model predictive control for transportation networks : Serial versus parallel schemes

NARCIS (Netherlands)

Negenborn, R.R.; De Schutter, B.; Hellendoorn, J.

2006-01-01

We consider the control of large-scale transportation networks, like road traffic networks, power distribution networks, water distribution networks, etc. Control of these networks is often not possible from a single point by a single intelligent control agent; instead control has to be performed

Covariance upperbound controllers for networked control systems

International Nuclear Information System (INIS)

Ko, Sang Ho

2012-01-01

This paper deals with designing covariance upperbound controllers for a linear system that can be used in a networked control environment in which control laws are calculated in a remote controller and transmitted through a shared communication link to the plant. In order to compensate for possible packet losses during the transmission, two different techniques are often employed: the zero-input and the hold-input strategy. These use zero input and the latest control input, respectively, when a packet is lost. For each strategy, we synthesize a class of output covariance upperbound controllers for a given covariance upperbound and a packet loss probability. Existence conditions of the covariance upperbound controller are also provided for each strategy. Through numerical examples, performance of the two strategies is compared in terms of feasibility of implementing the controllers

Controlling noise-induced behavior of excitable networks

International Nuclear Information System (INIS)

Patidar, S; Pototsky, A; Janson, N B

2009-01-01

The paper demonstrates the possibility to control the collective behavior of a large network of excitable stochastic units, in which oscillations are induced merely by external random input. Each network element is represented by the FitzHugh-Nagumo system under the influence of noise, and the elements are coupled through the mean field. As known previously, the collective behavior of units in such a network can range from synchronous to non-synchronous spiking with a variety of states in between. We apply the Pyragas delayed feedback to the mean field of the network and demonstrate that this technique is capable of suppressing or weakening the collective synchrony, or of inducing the synchrony where it was absent. On the plane of control parameters we indicate the areas where suppression of synchrony is achieved. To explain the numerical observations on a qualitative level, we use the semi-analytic approach based on the cumulant expansion of the distribution density within Gaussian approximation. We perform bifurcation analysis of the obtained cumulant equations with delay and demonstrate that the regions of stability of its steady state have qualitatively the same structure as the regions of synchrony suppression of the original stochastic equations. We also demonstrate the delay-induced multistability in the stochastic network. These results are relevant to the control of unwanted behavior in neural networks.

Decentralized Networked Control of Building Structures

Czech Academy of Sciences Publication Activity Database

Bakule, Lubomír; Rehák, Branislav; Papík, Martin

2016-01-01

Roč. 31, č. 11 (2016), s. 871-886 ISSN 1093-9687 R&D Projects: GA ČR GA13-02149S Institutional support: RVO:67985556 Keywords : decentralized control * networked control * building structures Subject RIV: BC - Control Systems Theory Impact factor: 5.786, year: 2016

Identification of coupling DNA motif pairs on long-range chromatin interactions in human K562 cells

KAUST Repository

Wong, Ka-Chun; Li, Yue; Peng, Chengbin

2015-01-01

Motivation: The protein-DNA interactions between transcription factors (TFs) and transcription factor binding sites (TFBSs, also known as DNA motifs) are critical activities in gene transcription. The identification of the DNA motifs is a vital task for downstream analysis. Unfortunately, the long-range coupling information between different DNA motifs is still lacking. To fill the void, as the first-of-its-kind study, we have identified the coupling DNA motif pairs on long-range chromatin interactions in human. Results: The coupling DNA motif pairs exhibit substantially higher DNase accessibility than the background sequences. Half of the DNA motifs involved are matched to the existing motif databases, although nearly all of them are enriched with at least one gene ontology term. Their motif instances are also found statistically enriched on the promoter and enhancer regions. Especially, we introduce a novel measurement called motif pairing multiplicity which is defined as the number of motifs that are paired with a given motif on chromatin interactions. Interestingly, we observe that motif pairing multiplicity is linked to several characteristics such as regulatory region type, motif sequence degeneracy, DNase accessibility and pairing genomic distance. Taken into account together, we believe the coupling DNA motif pairs identified in this study can shed lights on the gene transcription mechanism under long-range chromatin interactions. © The Author 2015. Published by Oxford University Press.