WorldWideScience

Sample records for network structural features

  1. Deep Convolutional Neural Networks: Structure, Feature Extraction and Training

    Directory of Open Access Journals (Sweden)

    Namatēvs Ivars

    2017-12-01

    Full Text Available Deep convolutional neural networks (CNNs are aimed at processing data that have a known network like topology. They are widely used to recognise objects in images and diagnose patterns in time series data as well as in sensor data classification. The aim of the paper is to present theoretical and practical aspects of deep CNNs in terms of convolution operation, typical layers and basic methods to be used for training and learning. Some practical applications are included for signal and image classification. Finally, the present paper describes the proposed block structure of CNN for classifying crucial features from 3D sensor data.

  2. Categorical Structure among Shared Features in Networks of Early-Learned Nouns

    Science.gov (United States)

    Hills, Thomas T.; Maouene, Mounir; Maouene, Josita; Sheya, Adam; Smith, Linda

    2009-01-01

    The shared features that characterize the noun categories that young children learn first are a formative basis of the human category system. To investigate the potential categorical information contained in the features of early-learned nouns, we examine the graph-theoretic properties of noun-feature networks. The networks are built from the…

  3. Investigation of road network features and safety performance.

    Science.gov (United States)

    Wang, Xuesong; Wu, Xingwei; Abdel-Aty, Mohamed; Tremont, Paul J

    2013-07-01

    The analysis of road network designs can provide useful information to transportation planners as they seek to improve the safety of road networks. The objectives of this study were to compare and define the effective road network indices and to analyze the relationship between road network structure and traffic safety at the level of the Traffic Analysis Zone (TAZ). One problem in comparing different road networks is establishing criteria that can be used to scale networks in terms of their structures. Based on data from Orange and Hillsborough Counties in Florida, road network structural properties within TAZs were scaled using 3 indices: Closeness Centrality, Betweenness Centrality, and Meshedness Coefficient. The Meshedness Coefficient performed best in capturing the structural features of the road network. Bayesian Conditional Autoregressive (CAR) models were developed to assess the safety of various network configurations as measured by total crashes, crashes on state roads, and crashes on local roads. The models' results showed that crash frequencies on local roads were closely related to factors within the TAZs (e.g., zonal network structure, TAZ population), while crash frequencies on state roads were closely related to the road and traffic features of state roads. For the safety effects of different networks, the Grid type was associated with the highest frequency of crashes, followed by the Mixed type, the Loops & Lollipops type, and the Sparse type. This study shows that it is possible to develop a quantitative scale for structural properties of a road network, and to use that scale to calculate the relationships between network structural properties and safety. Copyright © 2013 Elsevier Ltd. All rights reserved.

  4. Bayesian latent feature modeling for modeling bipartite networks with overlapping groups

    DEFF Research Database (Denmark)

    Jørgensen, Philip H.; Mørup, Morten; Schmidt, Mikkel Nørgaard

    2016-01-01

    Bi-partite networks are commonly modelled using latent class or latent feature models. Whereas the existing latent class models admit marginalization of parameters specifying the strength of interaction between groups, existing latent feature models do not admit analytical marginalization...... by the notion of community structure such that the edge density within groups is higher than between groups. Our model further assumes that entities can have different propensities of generating links in one of the modes. The proposed framework is contrasted on both synthetic and real bi-partite networks...... feature representations in bipartite networks provides a new framework for accounting for structure in bi-partite networks using binary latent feature representations providing interpretable representations that well characterize structure as quantified by link prediction....

  5. An automated approach to network features of protein structure ensembles

    Science.gov (United States)

    Bhattacharyya, Moitrayee; Bhat, Chanda R; Vishveshwara, Saraswathi

    2013-01-01

    Network theory applied to protein structures provides insights into numerous problems of biological relevance. The explosion in structural data available from PDB and simulations establishes a need to introduce a standalone-efficient program that assembles network concepts/parameters under one hood in an automated manner. Herein, we discuss the development/application of an exhaustive, user-friendly, standalone program package named PSN-Ensemble, which can handle structural ensembles generated through molecular dynamics (MD) simulation/NMR studies or from multiple X-ray structures. The novelty in network construction lies in the explicit consideration of side-chain interactions among amino acids. The program evaluates network parameters dealing with topological organization and long-range allosteric communication. The introduction of a flexible weighing scheme in terms of residue pairwise cross-correlation/interaction energy in PSN-Ensemble brings in dynamical/chemical knowledge into the network representation. Also, the results are mapped on a graphical display of the structure, allowing an easy access of network analysis to a general biological community. The potential of PSN-Ensemble toward examining structural ensemble is exemplified using MD trajectories of an ubiquitin-conjugating enzyme (UbcH5b). Furthermore, insights derived from network parameters evaluated using PSN-Ensemble for single-static structures of active/inactive states of β2-adrenergic receptor and the ternary tRNA complexes of tyrosyl tRNA synthetases (from organisms across kingdoms) are discussed. PSN-Ensemble is freely available from http://vishgraph.mbu.iisc.ernet.in/PSN-Ensemble/psn_index.html. PMID:23934896

  6. Feature network models for proximity data : statistical inference, model selection, network representations and links with related models

    NARCIS (Netherlands)

    Frank, Laurence Emmanuelle

    2006-01-01

    Feature Network Models (FNM) are graphical structures that represent proximity data in a discrete space with the use of features. A statistical inference theory is introduced, based on the additivity properties of networks and the linear regression framework. Considering features as predictor

  7. vhv supply networks, problems of network structure

    Energy Technology Data Exchange (ETDEWEB)

    Raimbault, J

    1966-04-01

    The present and future power requirements of the Paris area and the structure of the existing networks are discussed. The various limitations that will have to be allowed for to lay down the structure of a regional transmission network leading in the power of the large national transmission network to within the Paris built up area are described. The theoretical solution that has been adopted, and the features of its final achievement, which is planned for about the year 2000, and the intermediate stages are given. The problem of the structure of the National Power Transmission network which is to supply the regional network was studied. To solve this problem, a 730 kV voltage network will have to be introduced.

  8. Effects of contact network structure on epidemic transmission trees: implications for data required to estimate network structure.

    Science.gov (United States)

    Carnegie, Nicole Bohme

    2018-01-30

    Understanding the dynamics of disease spread is key to developing effective interventions to control or prevent an epidemic. The structure of the network of contacts over which the disease spreads has been shown to have a strong influence on the outcome of the epidemic, but an open question remains as to whether it is possible to estimate contact network features from data collected in an epidemic. The approach taken in this paper is to examine the distributions of epidemic outcomes arising from epidemics on networks with particular structural features to assess whether that structure could be measured from epidemic data and what other constraints might be needed to make the problem identifiable. To this end, we vary the network size, mean degree, and transmissibility of the pathogen, as well as the network feature of interest: clustering, degree assortativity, or attribute-based preferential mixing. We record several standard measures of the size and spread of the epidemic, as well as measures that describe the shape of the transmission tree in order to ascertain whether there are detectable signals in the final data from the outbreak. The results suggest that there is potential to estimate contact network features from transmission trees or pure epidemic data, particularly for diseases with high transmissibility or for which the relevant contact network is of low mean degree. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

  9. Structure Crack Identification Based on Surface-mounted Active Sensor Network with Time-Domain Feature Extraction and Neural Network

    Directory of Open Access Journals (Sweden)

    Chunling DU

    2012-03-01

    Full Text Available In this work the condition of metallic structures are classified based on the acquired sensor data from a surface-mounted piezoelectric sensor/actuator network. The structures are aluminum plates with riveted holes and possible crack damage at these holes. A 400 kHz sine wave burst is used as diagnostic signals. The combination of time-domain S0 waves from received sensor signals is directly used as features and preprocessing is not needed for the dam age detection. Since the time sequence of the extracted S0 has a high dimension, principal component estimation is applied to reduce its dimension before entering NN (neural network training for classification. An LVQ (learning vector quantization NN is used to classify the conditions as healthy or damaged. A number of FEM (finite element modeling results are taken as inputs to the NN for training, since the simulated S0 waves agree well with the experimental results on real plates. The performance of the classification is then validated by using these testing results.

  10. Network Ecology and Adolescent Social Structure.

    Science.gov (United States)

    McFarland, Daniel A; Moody, James; Diehl, David; Smith, Jeffrey A; Thomas, Reuben J

    2014-12-01

    Adolescent societies-whether arising from weak, short-term classroom friendships or from close, long-term friendships-exhibit various levels of network clustering, segregation, and hierarchy. Some are rank-ordered caste systems and others are flat, cliquish worlds. Explaining the source of such structural variation remains a challenge, however, because global network features are generally treated as the agglomeration of micro-level tie-formation mechanisms, namely balance, homophily, and dominance. How do the same micro-mechanisms generate significant variation in global network structures? To answer this question we propose and test a network ecological theory that specifies the ways features of organizational environments moderate the expression of tie-formation processes, thereby generating variability in global network structures across settings. We develop this argument using longitudinal friendship data on schools (Add Health study) and classrooms (Classroom Engagement study), and by extending exponential random graph models to the study of multiple societies over time.

  11. Fundamental statistical features and self-similar properties of tagged networks

    International Nuclear Information System (INIS)

    Palla, Gergely; Farkas, Illes J; Pollner, Peter; Vicsek, Tamas; Derenyi, Imre

    2008-01-01

    We investigate the fundamental statistical features of tagged (or annotated) networks having a rich variety of attributes associated with their nodes. Tags (attributes, annotations, properties, features, etc) provide essential information about the entity represented by a given node, thus, taking them into account represents a significant step towards a more complete description of the structure of large complex systems. Our main goal here is to uncover the relations between the statistical properties of the node tags and those of the graph topology. In order to better characterize the networks with tagged nodes, we introduce a number of new notions, including tag-assortativity (relating link probability to node similarity), and new quantities, such as node uniqueness (measuring how rarely the tags of a node occur in the network) and tag-assortativity exponent. We apply our approach to three large networks representing very different domains of complex systems. A number of the tag related quantities display analogous behaviour (e.g. the networks we studied are tag-assortative, indicating possible universal aspects of tags versus topology), while some other features, such as the distribution of the node uniqueness, show variability from network to network allowing for pin-pointing large scale specific features of real-world complex networks. We also find that for each network the topology and the tag distribution are scale invariant, and this self-similar property of the networks can be well characterized by the tag-assortativity exponent, which is specific to each system.

  12. Distance metric learning for complex networks: Towards size-independent comparison of network structures

    Science.gov (United States)

    Aliakbary, Sadegh; Motallebi, Sadegh; Rashidian, Sina; Habibi, Jafar; Movaghar, Ali

    2015-02-01

    Real networks show nontrivial topological properties such as community structure and long-tail degree distribution. Moreover, many network analysis applications are based on topological comparison of complex networks. Classification and clustering of networks, model selection, and anomaly detection are just some applications of network comparison. In these applications, an effective similarity metric is needed which, given two complex networks of possibly different sizes, evaluates the amount of similarity between the structural features of the two networks. Traditional graph comparison approaches, such as isomorphism-based methods, are not only too time consuming but also inappropriate to compare networks with different sizes. In this paper, we propose an intelligent method based on the genetic algorithms for integrating, selecting, and weighting the network features in order to develop an effective similarity measure for complex networks. The proposed similarity metric outperforms state of the art methods with respect to different evaluation criteria.

  13. Schizophrenia classification using functional network features

    Science.gov (United States)

    Rish, Irina; Cecchi, Guillermo A.; Heuton, Kyle

    2012-03-01

    This paper focuses on discovering statistical biomarkers (features) that are predictive of schizophrenia, with a particular focus on topological properties of fMRI functional networks. We consider several network properties, such as node (voxel) strength, clustering coefficients, local efficiency, as well as just a subset of pairwise correlations. While all types of features demonstrate highly significant statistical differences in several brain areas, and close to 80% classification accuracy, the most remarkable results of 93% accuracy are achieved by using a small subset of only a dozen of most-informative (lowest p-value) correlation features. Our results suggest that voxel-level correlations and functional network features derived from them are highly informative about schizophrenia and can be used as statistical biomarkers for the disease.

  14. Predictive brain networks for major depression in a semi-multimodal fusion hierarchical feature reduction framework.

    Science.gov (United States)

    Yang, Jie; Yin, Yingying; Zhang, Zuping; Long, Jun; Dong, Jian; Zhang, Yuqun; Xu, Zhi; Li, Lei; Liu, Jie; Yuan, Yonggui

    2018-02-05

    Major depressive disorder (MDD) is characterized by dysregulation of distributed structural and functional networks. It is now recognized that structural and functional networks are related at multiple temporal scales. The recent emergence of multimodal fusion methods has made it possible to comprehensively and systematically investigate brain networks and thereby provide essential information for influencing disease diagnosis and prognosis. However, such investigations are hampered by the inconsistent dimensionality features between structural and functional networks. Thus, a semi-multimodal fusion hierarchical feature reduction framework is proposed. Feature reduction is a vital procedure in classification that can be used to eliminate irrelevant and redundant information and thereby improve the accuracy of disease diagnosis. Our proposed framework primarily consists of two steps. The first step considers the connection distances in both structural and functional networks between MDD and healthy control (HC) groups. By adding a constraint based on sparsity regularization, the second step fully utilizes the inter-relationship between the two modalities. However, in contrast to conventional multi-modality multi-task methods, the structural networks were considered to play only a subsidiary role in feature reduction and were not included in the following classification. The proposed method achieved a classification accuracy, specificity, sensitivity, and area under the curve of 84.91%, 88.6%, 81.29%, and 0.91, respectively. Moreover, the frontal-limbic system contributed the most to disease diagnosis. Importantly, by taking full advantage of the complementary information from multimodal neuroimaging data, the selected consensus connections may be highly reliable biomarkers of MDD. Copyright © 2017 Elsevier B.V. All rights reserved.

  15. Prediction of interface residue based on the features of residue interaction network.

    Science.gov (United States)

    Jiao, Xiong; Ranganathan, Shoba

    2017-11-07

    Protein-protein interaction plays a crucial role in the cellular biological processes. Interface prediction can improve our understanding of the molecular mechanisms of the related processes and functions. In this work, we propose a classification method to recognize the interface residue based on the features of a weighted residue interaction network. The random forest algorithm is used for the prediction and 16 network parameters and the B-factor are acting as the element of the input feature vector. Compared with other similar work, the method is feasible and effective. The relative importance of these features also be analyzed to identify the key feature for the prediction. Some biological meaning of the important feature is explained. The results of this work can be used for the related work about the structure-function relationship analysis via a residue interaction network model. Copyright © 2017 Elsevier Ltd. All rights reserved.

  16. Construction of Individual Morphological Brain Networks with Multiple Morphometric Features

    Directory of Open Access Journals (Sweden)

    Chunlan Yang

    2017-04-01

    Full Text Available In recent years, researchers have increased attentions to the morphological brain network, which is generally constructed by measuring the mathematical correlation across regions using a certain morphometric feature, such as regional cortical thickness and voxel intensity. However, cerebral structure can be characterized by various factors, such as regional volume, surface area, and curvature. Moreover, most of the morphological brain networks are population-based, which has limitations in the investigations of individual difference and clinical applications. Hence, we have extended previous studies by proposing a novel method for realizing the construction of an individual-based morphological brain network through a combination of multiple morphometric features. In particular, interregional connections are estimated using our newly introduced feature vectors, namely, the Pearson correlation coefficient of the concatenation of seven morphometric features. Experiments were performed on a healthy cohort of 55 subjects (24 males aged from 20 to 29 and 31 females aged from 20 to 28 each scanned twice, and reproducibility was evaluated through test–retest reliability. The robustness of morphometric features was measured firstly to select the more reproducible features to form the connectomes. Then the topological properties were analyzed and compared with previous reports of different modalities. Small-worldness was observed in all the subjects at the range of the entire network sparsity (20–40%, and configurations were comparable with previous findings at the sparsity of 23%. The spatial distributions of the hub were found to be significantly influenced by the individual variances, and the hubs obtained by averaging across subjects and sparsities showed correspondence with previous reports. The intraclass coefficient of graphic properties (clustering coefficient = 0.83, characteristic path length = 0.81, betweenness centrality = 0.78 indicates

  17. Structural Behavioral Study on the General Aviation Network Based on Complex Network

    Science.gov (United States)

    Zhang, Liang; Lu, Na

    2017-12-01

    The general aviation system is an open and dissipative system with complex structures and behavioral features. This paper has established the system model and network model for general aviation. We have analyzed integral attributes and individual attributes by applying the complex network theory and concluded that the general aviation network has influential enterprise factors and node relations. We have checked whether the network has small world effect, scale-free property and network centrality property which a complex network should have by applying degree distribution of functions and proved that the general aviation network system is a complex network. Therefore, we propose to achieve the evolution process of the general aviation industrial chain to collaborative innovation cluster of advanced-form industries by strengthening network multiplication effect, stimulating innovation performance and spanning the structural hole path.

  18. Deterministic bound for avionics switched networks according to networking features using network calculus

    Directory of Open Access Journals (Sweden)

    Feng HE

    2017-12-01

    Full Text Available The state of the art avionics system adopts switched networks for airborne communications. A major concern in the design of the networks is the end-to-end guarantee ability. Analytic methods have been developed to compute the worst-case delays according to the detailed configurations of flows and networks within avionics context, such as network calculus and trajectory approach. It still lacks a relevant method to make a rapid performance estimation according to some typically switched networking features, such as networking scale, bandwidth utilization and average flow rate. The goal of this paper is to establish a deterministic upper bound analysis method by using these networking features instead of the complete network configurations. Two deterministic upper bounds are proposed from network calculus perspective: one is for a basic estimation, and another just shows the benefits from grouping strategy. Besides, a mathematic expression for grouping ability is established based on the concept of network connecting degree, which illustrates the possibly minimal grouping benefit. For a fully connected network with 4 switches and 12 end systems, the grouping ability coming from grouping strategy is 15–20%, which just coincides with the statistical data (18–22% from the actual grouping advantage. Compared with the complete network calculus analysis method for individual flows, the effectiveness of the two deterministic upper bounds is no less than 38% even with remarkably varied packet lengths. Finally, the paper illustrates the design process for an industrial Avionics Full DupleX switched Ethernet (AFDX networking case according to the two deterministic upper bounds and shows that a better control for network connecting, when designing a switched network, can improve the worst-case delays dramatically. Keywords: Deterministic bound, Grouping ability, Network calculus, Networking features, Switched networks

  19. Structural analysis of behavioral networks from the Internet

    International Nuclear Information System (INIS)

    Meiss, M R; Menczer, F; Vespignani, A

    2008-01-01

    In spite of the Internet's phenomenal growth and social impact, many aspects of the collective communication behavior of its users are largely unknown. Understanding the structure and dynamics of the behavioral networks that connect users with each other and with services across the Internet is key to modeling the network and designing future applications. We present a characterization of the properties of the behavioral networks generated by several million users of the Abilene (Internet2) network. Structural features of these networks offer new insights into scaling properties of network activity and ways of distinguishing particular patterns of traffic. For example, we find that the structure of the behavioral network associated with Web activity is characterized by such extreme heterogeneity as to challenge any simple attempt to model Web server traffic

  20. Structural analysis of behavioral networks from the Internet

    Energy Technology Data Exchange (ETDEWEB)

    Meiss, M R; Menczer, F [Department of Computer Science, Indiana University, Bloomington, IN 47405 (United States); Vespignani, A [Department of Informatics, Indiana University, Bloomington, IN 47408 (United States)], E-mail: mmeiss@indiana.edu

    2008-06-06

    In spite of the Internet's phenomenal growth and social impact, many aspects of the collective communication behavior of its users are largely unknown. Understanding the structure and dynamics of the behavioral networks that connect users with each other and with services across the Internet is key to modeling the network and designing future applications. We present a characterization of the properties of the behavioral networks generated by several million users of the Abilene (Internet2) network. Structural features of these networks offer new insights into scaling properties of network activity and ways of distinguishing particular patterns of traffic. For example, we find that the structure of the behavioral network associated with Web activity is characterized by such extreme heterogeneity as to challenge any simple attempt to model Web server traffic.

  1. Learning Transferable Features with Deep Adaptation Networks

    OpenAIRE

    Long, Mingsheng; Cao, Yue; Wang, Jianmin; Jordan, Michael I.

    2015-01-01

    Recent studies reveal that a deep neural network can learn transferable features which generalize well to novel tasks for domain adaptation. However, as deep features eventually transition from general to specific along the network, the feature transferability drops significantly in higher layers with increasing domain discrepancy. Hence, it is important to formally reduce the dataset bias and enhance the transferability in task-specific layers. In this paper, we propose a new Deep Adaptation...

  2. The evolving network structure of US airline system during 1990-2010

    Science.gov (United States)

    Lin, Jingyi; Ban, Yifang

    2014-09-01

    This paper analyzes the growth and evolution of topological features of the US airline network over a 20-year period. It captures the change in the network system from different dimensions of complex networks such as centrality distribution and various structural properties of the network over time. We first illustrate the results of a set of measures, including degree, strength, betweenness centrality, and clustering structure. The geographic features of airport systems, spatial distance and network efficiency are also discussed in this section. In order to further capture the dynamics of the system, this paper also explores the correlation between different measures, and investigates various interactions inside the network. Overall this study offers a novel approach to understanding the growth and evolution of real physical networks.

  3. Structural features that predict real-value fluctuations of globular proteins.

    Science.gov (United States)

    Jamroz, Michal; Kolinski, Andrzej; Kihara, Daisuke

    2012-05-01

    It is crucial to consider dynamics for understanding the biological function of proteins. We used a large number of molecular dynamics (MD) trajectories of nonhomologous proteins as references and examined static structural features of proteins that are most relevant to fluctuations. We examined correlation of individual structural features with fluctuations and further investigated effective combinations of features for predicting the real value of residue fluctuations using the support vector regression (SVR). It was found that some structural features have higher correlation than crystallographic B-factors with fluctuations observed in MD trajectories. Moreover, SVR that uses combinations of static structural features showed accurate prediction of fluctuations with an average Pearson's correlation coefficient of 0.669 and a root mean square error of 1.04 Å. This correlation coefficient is higher than the one observed in predictions by the Gaussian network model (GNM). An advantage of the developed method over the GNMs is that the former predicts the real value of fluctuation. The results help improve our understanding of relationships between protein structure and fluctuation. Furthermore, the developed method provides a convienient practial way to predict fluctuations of proteins using easily computed static structural features of proteins. Copyright © 2012 Wiley Periodicals, Inc.

  4. Discriminative topological features reveal biological network mechanisms

    Directory of Open Access Journals (Sweden)

    Levovitz Chaya

    2004-11-01

    Full Text Available Abstract Background Recent genomic and bioinformatic advances have motivated the development of numerous network models intending to describe graphs of biological, technological, and sociological origin. In most cases the success of a model has been evaluated by how well it reproduces a few key features of the real-world data, such as degree distributions, mean geodesic lengths, and clustering coefficients. Often pairs of models can reproduce these features with indistinguishable fidelity despite being generated by vastly different mechanisms. In such cases, these few target features are insufficient to distinguish which of the different models best describes real world networks of interest; moreover, it is not clear a priori that any of the presently-existing algorithms for network generation offers a predictive description of the networks inspiring them. Results We present a method to assess systematically which of a set of proposed network generation algorithms gives the most accurate description of a given biological network. To derive discriminative classifiers, we construct a mapping from the set of all graphs to a high-dimensional (in principle infinite-dimensional "word space". This map defines an input space for classification schemes which allow us to state unambiguously which models are most descriptive of a given network of interest. Our training sets include networks generated from 17 models either drawn from the literature or introduced in this work. We show that different duplication-mutation schemes best describe the E. coli genetic network, the S. cerevisiae protein interaction network, and the C. elegans neuronal network, out of a set of network models including a linear preferential attachment model and a small-world model. Conclusions Our method is a first step towards systematizing network models and assessing their predictability, and we anticipate its usefulness for a number of communities.

  5. Exploring biological network structure with clustered random networks

    Directory of Open Access Journals (Sweden)

    Bansal Shweta

    2009-12-01

    Full Text Available Abstract Background Complex biological systems are often modeled as networks of interacting units. Networks of biochemical interactions among proteins, epidemiological contacts among hosts, and trophic interactions in ecosystems, to name a few, have provided useful insights into the dynamical processes that shape and traverse these systems. The degrees of nodes (numbers of interactions and the extent of clustering (the tendency for a set of three nodes to be interconnected are two of many well-studied network properties that can fundamentally shape a system. Disentangling the interdependent effects of the various network properties, however, can be difficult. Simple network models can help us quantify the structure of empirical networked systems and understand the impact of various topological properties on dynamics. Results Here we develop and implement a new Markov chain simulation algorithm to generate simple, connected random graphs that have a specified degree sequence and level of clustering, but are random in all other respects. The implementation of the algorithm (ClustRNet: Clustered Random Networks provides the generation of random graphs optimized according to a local or global, and relative or absolute measure of clustering. We compare our algorithm to other similar methods and show that ours more successfully produces desired network characteristics. Finding appropriate null models is crucial in bioinformatics research, and is often difficult, particularly for biological networks. As we demonstrate, the networks generated by ClustRNet can serve as random controls when investigating the impacts of complex network features beyond the byproduct of degree and clustering in empirical networks. Conclusion ClustRNet generates ensembles of graphs of specified edge structure and clustering. These graphs allow for systematic study of the impacts of connectivity and redundancies on network function and dynamics. This process is a key step in

  6. Metastable Features of Economic Networks and Responses to Exogenous Shocks.

    Directory of Open Access Journals (Sweden)

    Ali Hosseiny

    Full Text Available It is well known that a network structure plays an important role in addressing a collective behavior. In this paper we study a network of firms and corporations for addressing metastable features in an Ising based model. In our model we observe that if in a recession the government imposes a demand shock to stimulate the network, metastable features shape its response. Actually we find that there exists a minimum bound where any demand shock with a size below it is unable to trigger the market out of recession. We then investigate the impact of network characteristics on this minimum bound. We surprisingly observe that in a Watts-Strogatz network, although the minimum bound depends on the average of the degrees, when translated into the language of economics, such a bound is independent of the average degrees. This bound is about 0.44ΔGDP, where ΔGDP is the gap of GDP between recession and expansion. We examine our suggestions for the cases of the United States and the European Union in the recent recession, and compare them with the imposed stimulations. While the stimulation in the US has been above our threshold, in the EU it has been far below our threshold. Beside providing a minimum bound for a successful stimulation, our study on the metastable features suggests that in the time of crisis there is a "golden time passage" in which the minimum bound for successful stimulation can be much lower. Hence, our study strongly suggests stimulations to arise within this time passage.

  7. Epidemic outbreaks in growing scale-free networks with local structure

    Science.gov (United States)

    Ni, Shunjiang; Weng, Wenguo; Shen, Shifei; Fan, Weicheng

    2008-09-01

    The class of generative models has already attracted considerable interest from researchers in recent years and much expanded the original ideas described in BA model. Most of these models assume that only one node per time step joins the network. In this paper, we grow the network by adding n interconnected nodes as a local structure into the network at each time step with each new node emanating m new edges linking the node to the preexisting network by preferential attachment. This successfully generates key features observed in social networks. These include power-law degree distribution pk∼k, where μ=(n-1)/m is a tuning parameter defined as the modularity strength of the network, nontrivial clustering, assortative mixing, and modular structure. Moreover, all these features are dependent in a similar way on the parameter μ. We then study the susceptible-infected epidemics on this network with identical infectivity, and find that the initial epidemic behavior is governed by both of the infection scheme and the network structure, especially the modularity strength. The modularity of the network makes the spreading velocity much lower than that of the BA model. On the other hand, increasing the modularity strength will accelerate the propagation velocity.

  8. Extracting intrinsic functional networks with feature-based group independent component analysis.

    Science.gov (United States)

    Calhoun, Vince D; Allen, Elena

    2013-04-01

    There is increasing use of functional imaging data to understand the macro-connectome of the human brain. Of particular interest is the structure and function of intrinsic networks (regions exhibiting temporally coherent activity both at rest and while a task is being performed), which account for a significant portion of the variance in functional MRI data. While networks are typically estimated based on the temporal similarity between regions (based on temporal correlation, clustering methods, or independent component analysis [ICA]), some recent work has suggested that these intrinsic networks can be extracted from the inter-subject covariation among highly distilled features, such as amplitude maps reflecting regions modulated by a task or even coordinates extracted from large meta analytic studies. In this paper our goal was to explicitly compare the networks obtained from a first-level ICA (ICA on the spatio-temporal functional magnetic resonance imaging (fMRI) data) to those from a second-level ICA (i.e., ICA on computed features rather than on the first-level fMRI data). Convergent results from simulations, task-fMRI data, and rest-fMRI data show that the second-level analysis is slightly noisier than the first-level analysis but yields strikingly similar patterns of intrinsic networks (spatial correlations as high as 0.85 for task data and 0.65 for rest data, well above the empirical null) and also preserves the relationship of these networks with other variables such as age (for example, default mode network regions tended to show decreased low frequency power for first-level analyses and decreased loading parameters for second-level analyses). In addition, the best-estimated second-level results are those which are the most strongly reflected in the input feature. In summary, the use of feature-based ICA appears to be a valid tool for extracting intrinsic networks. We believe it will become a useful and important approach in the study of the macro

  9. Investigation of efficient features for image recognition by neural networks.

    Science.gov (United States)

    Goltsev, Alexander; Gritsenko, Vladimir

    2012-04-01

    In the paper, effective and simple features for image recognition (named LiRA-features) are investigated in the task of handwritten digit recognition. Two neural network classifiers are considered-a modified 3-layer perceptron LiRA and a modular assembly neural network. A method of feature selection is proposed that analyses connection weights formed in the preliminary learning process of a neural network classifier. In the experiments using the MNIST database of handwritten digits, the feature selection procedure allows reduction of feature number (from 60 000 to 7000) preserving comparable recognition capability while accelerating computations. Experimental comparison between the LiRA perceptron and the modular assembly neural network is accomplished, which shows that recognition capability of the modular assembly neural network is somewhat better. Copyright © 2011 Elsevier Ltd. All rights reserved.

  10. The overlapping community structure of structural brain network in young healthy individuals.

    Directory of Open Access Journals (Sweden)

    Kai Wu

    2011-05-01

    Full Text Available Community structure is a universal and significant feature of many complex networks in biology, society, and economics. Community structure has also been revealed in human brain structural and functional networks in previous studies. However, communities overlap and share many edges and nodes. Uncovering the overlapping community structure of complex networks remains largely unknown in human brain networks. Here, using regional gray matter volume, we investigated the structural brain network among 90 brain regions (according to a predefined anatomical atlas in 462 young, healthy individuals. Overlapped nodes between communities were defined by assuming that nodes (brain regions can belong to more than one community. We demonstrated that 90 brain regions were organized into 5 overlapping communities associated with several well-known brain systems, such as the auditory/language, visuospatial, emotion, decision-making, social, control of action, memory/learning, and visual systems. The overlapped nodes were mostly involved in an inferior-posterior pattern and were primarily related to auditory and visual perception. The overlapped nodes were mainly attributed to brain regions with higher node degrees and nodal efficiency and played a pivotal role in the flow of information through the structural brain network. Our results revealed fuzzy boundaries between communities by identifying overlapped nodes and provided new insights into the understanding of the relationship between the structure and function of the human brain. This study provides the first report of the overlapping community structure of the structural network of the human brain.

  11. Detecting overlapping community structure of networks based on vertex–vertex correlations

    International Nuclear Information System (INIS)

    Zarei, Mina; Izadi, Dena; Samani, Keivan Aghababaei

    2009-01-01

    Using the NMF (non-negative matrix factorization) method, the structure of overlapping communities in complex networks is investigated. For the feature matrix of the NMF method we introduce a vertex–vertex correlation matrix. The method is applied to some computer-generated and real-world networks. Simulations show that this feature matrix gives more reasonable results

  12. Structure and growth of weighted networks

    Energy Technology Data Exchange (ETDEWEB)

    Riccaboni, Massimo [Department of Computer and Management Sciences, University of Trento, Trento (Italy); Schiavo, Stefano [Department of Economics, University of Trento, Trento (Italy)], E-mail: massimo.riccaboni@unitn.it, E-mail: stefano.schiavo@unitn.it

    2010-02-15

    We develop a simple theoretical framework for the evolution of weighted networks that is consistent with a number of stylized features of real-world data. In our framework, the Barabasi-Albert model of network evolution is extended by assuming that link weights evolve according to a geometric Brownian motion. Our model is verified by means of simulations and real-world trade data. We show that the model correctly predicts the intensity and growth distribution of links, the size-variance relationship of the growth of link weights, the relationship between the degree and strength of nodes, and the scale-free structure of the network.

  13. NAPS: Network Analysis of Protein Structures

    Science.gov (United States)

    Chakrabarty, Broto; Parekh, Nita

    2016-01-01

    Traditionally, protein structures have been analysed by the secondary structure architecture and fold arrangement. An alternative approach that has shown promise is modelling proteins as a network of non-covalent interactions between amino acid residues. The network representation of proteins provide a systems approach to topological analysis of complex three-dimensional structures irrespective of secondary structure and fold type and provide insights into structure-function relationship. We have developed a web server for network based analysis of protein structures, NAPS, that facilitates quantitative and qualitative (visual) analysis of residue–residue interactions in: single chains, protein complex, modelled protein structures and trajectories (e.g. from molecular dynamics simulations). The user can specify atom type for network construction, distance range (in Å) and minimal amino acid separation along the sequence. NAPS provides users selection of node(s) and its neighbourhood based on centrality measures, physicochemical properties of amino acids or cluster of well-connected residues (k-cliques) for further analysis. Visual analysis of interacting domains and protein chains, and shortest path lengths between pair of residues are additional features that aid in functional analysis. NAPS support various analyses and visualization views for identifying functional residues, provide insight into mechanisms of protein folding, domain-domain and protein–protein interactions for understanding communication within and between proteins. URL:http://bioinf.iiit.ac.in/NAPS/. PMID:27151201

  14. Community structures and role detection in music networks

    Science.gov (United States)

    Teitelbaum, T.; Balenzuela, P.; Cano, P.; Buldú, Javier M.

    2008-12-01

    We analyze the existence of community structures in two different social networks using data obtained from similarity and collaborative features between musical artists. Our analysis reveals some characteristic organizational patterns and provides information about the driving forces behind the growth of the networks. In the similarity network, we find a strong correlation between clusters of artists and musical genres. On the other hand, the collaboration network shows two different kinds of communities: rather small structures related to music bands and geographic zones, and much bigger communities built upon collaborative clusters with a high number of participants related through the period the artists were active. Finally, we detect the leading artists inside their corresponding communities and analyze their roles in the network by looking at a few topological properties of the nodes.

  15. Understanding Protein-Protein Interactions Using Local Structural Features

    DEFF Research Database (Denmark)

    Planas-Iglesias, Joan; Bonet, Jaume; García-García, Javier

    2013-01-01

    Protein-protein interactions (PPIs) play a relevant role among the different functions of a cell. Identifying the PPI network of a given organism (interactome) is useful to shed light on the key molecular mechanisms within a biological system. In this work, we show the role of structural features...... interacting and non-interacting protein pairs to classify the structural features that sustain the binding (or non-binding) behavior. Our study indicates that not only the interacting region but also the rest of the protein surface are important for the interaction fate. The interpretation...... to score the likelihood of the interaction between two proteins and to develop a method for the prediction of PPIs. We have tested our method on several sets with unbalanced ratios of interactions and non-interactions to simulate real conditions, obtaining accuracies higher than 25% in the most unfavorable...

  16. Implications of network structure on public health collaboratives.

    Science.gov (United States)

    Retrum, Jessica H; Chapman, Carrie L; Varda, Danielle M

    2013-10-01

    Interorganizational collaboration is an essential function of public health agencies. These partnerships form social networks that involve diverse types of partners and varying levels of interaction. Such collaborations are widely accepted and encouraged, yet very little comparative research exists on how public health partnerships develop and evolve, specifically in terms of how subsequent network structures are linked to outcomes. A systems science approach, that is, one that considers the interdependencies and nested features of networks, provides the appropriate methods to examine the complex nature of these networks. Applying Mays and Scutchfields's categorization of "structural signatures" (breadth, density, and centralization), this research examines how network structure influences the outcomes of public health collaboratives. Secondary data from the Program to Analyze, Record, and Track Networks to Enhance Relationships (www.partnertool.net) data set are analyzed. This data set consists of dyadic (N = 12,355), organizational (N = 2,486), and whole network (N = 99) data from public health collaborations around the United States. Network data are used to calculate structural signatures and weighted least squares regression is used to examine how network structures can predict selected intermediary outcomes (resource contributions, overall value and trust rankings, and outcomes) in public health collaboratives. Our findings suggest that network structure may have an influence on collaborative-related outcomes. The structural signature that had the most significant relationship to outcomes was density, with higher density indicating more positive outcomes. Also significant was the finding that more breadth creates new challenges such as difficulty in reaching consensus and creating ties with other members. However, assumptions that these structural components lead to improved outcomes for public health collaboratives may be slightly premature. Implications of

  17. A diagnosis model for early Tourette syndrome children based on brain structural network characteristics

    Science.gov (United States)

    Wen, Hongwei; Liu, Yue; Wang, Jieqiong; Zhang, Jishui; Peng, Yun; He, Huiguang

    2016-03-01

    Tourette syndrome (TS) is a childhood-onset neurobehavioral disorder characterized by the presence of multiple motor and vocal tics. Tic generation has been linked to disturbed networks of brain areas involved in planning, controlling and execution of action. The aim of our work is to select topological characteristics of structural network which were most efficient for estimating the classification models to identify early TS children. Here we employed the diffusion tensor imaging (DTI) and deterministic tractography to construct the structural networks of 44 TS children and 48 age and gender matched healthy children. We calculated four different connection matrices (fiber number, mean FA, averaged fiber length weighted and binary matrices) and then applied graph theoretical methods to extract the regional nodal characteristics of structural network. For each weighted or binary network, nodal degree, nodal efficiency and nodal betweenness were selected as features. Support Vector Machine Recursive Feature Extraction (SVM-RFE) algorithm was used to estimate the best feature subset for classification. The accuracy of 88.26% evaluated by a nested cross validation was achieved on combing best feature subset of each network characteristic. The identified discriminative brain nodes mostly located in the basal ganglia and frontal cortico-cortical networks involved in TS children which was associated with tic severity. Our study holds promise for early identification and predicting prognosis of TS children.

  18. Validation of network communicability metrics for the analysis of brain structural networks.

    Directory of Open Access Journals (Sweden)

    Jennifer Andreotti

    Full Text Available Computational network analysis provides new methods to analyze the brain's structural organization based on diffusion imaging tractography data. Networks are characterized by global and local metrics that have recently given promising insights into diagnosis and the further understanding of psychiatric and neurologic disorders. Most of these metrics are based on the idea that information in a network flows along the shortest paths. In contrast to this notion, communicability is a broader measure of connectivity which assumes that information could flow along all possible paths between two nodes. In our work, the features of network metrics related to communicability were explored for the first time in the healthy structural brain network. In addition, the sensitivity of such metrics was analysed using simulated lesions to specific nodes and network connections. Results showed advantages of communicability over conventional metrics in detecting densely connected nodes as well as subsets of nodes vulnerable to lesions. In addition, communicability centrality was shown to be widely affected by the lesions and the changes were negatively correlated with the distance from lesion site. In summary, our analysis suggests that communicability metrics that may provide an insight into the integrative properties of the structural brain network and that these metrics may be useful for the analysis of brain networks in the presence of lesions. Nevertheless, the interpretation of communicability is not straightforward; hence these metrics should be used as a supplement to the more standard connectivity network metrics.

  19. Distribution of genotype network sizes in sequence-to-structure genotype-phenotype maps.

    Science.gov (United States)

    Manrubia, Susanna; Cuesta, José A

    2017-04-01

    An essential quantity to ensure evolvability of populations is the navigability of the genotype space. Navigability, understood as the ease with which alternative phenotypes are reached, relies on the existence of sufficiently large and mutually attainable genotype networks. The size of genotype networks (e.g. the number of RNA sequences folding into a particular secondary structure or the number of DNA sequences coding for the same protein structure) is astronomically large in all functional molecules investigated: an exhaustive experimental or computational study of all RNA folds or all protein structures becomes impossible even for moderately long sequences. Here, we analytically derive the distribution of genotype network sizes for a hierarchy of models which successively incorporate features of increasingly realistic sequence-to-structure genotype-phenotype maps. The main feature of these models relies on the characterization of each phenotype through a prototypical sequence whose sites admit a variable fraction of letters of the alphabet. Our models interpolate between two limit distributions: a power-law distribution, when the ordering of sites in the prototypical sequence is strongly constrained, and a lognormal distribution, as suggested for RNA, when different orderings of the same set of sites yield different phenotypes. Our main result is the qualitative and quantitative identification of those features of sequence-to-structure maps that lead to different distributions of genotype network sizes. © 2017 The Author(s).

  20. Multi-threshold white matter structural networks fusion for accurate diagnosis of Tourette syndrome children

    Science.gov (United States)

    Wen, Hongwei; Liu, Yue; Wang, Shengpei; Li, Zuoyong; Zhang, Jishui; Peng, Yun; He, Huiguang

    2017-03-01

    Tourette syndrome (TS) is a childhood-onset neurobehavioral disorder. To date, TS is still misdiagnosed due to its varied presentation and lacking of obvious clinical symptoms. Therefore, studies of objective imaging biomarkers are of great importance for early TS diagnosis. As tic generation has been linked to disturbed structural networks, and many efforts have been made recently to investigate brain functional or structural networks using machine learning methods, for the purpose of disease diagnosis. However, few studies were related to TS and some drawbacks still existed in them. Therefore, we propose a novel classification framework integrating a multi-threshold strategy and a network fusion scheme to address the preexisting drawbacks. Here we used diffusion MRI probabilistic tractography to construct the structural networks of 44 TS children and 48 healthy children. We ameliorated the similarity network fusion algorithm specially to fuse the multi-threshold structural networks. Graph theoretical analysis was then implemented, and nodal degree, nodal efficiency and nodal betweenness centrality were selected as features. Finally, support vector machine recursive feature extraction (SVM-RFE) algorithm was used for feature selection, and then optimal features are fed into SVM to automatically discriminate TS children from controls. We achieved a high accuracy of 89.13% evaluated by a nested cross validation, demonstrated the superior performance of our framework over other comparison methods. The involved discriminative regions for classification primarily located in the basal ganglia and frontal cortico-cortical networks, all highly related to the pathology of TS. Together, our study may provide potential neuroimaging biomarkers for early-stage TS diagnosis.

  1. Self-organizing networks for extracting jet features

    International Nuclear Information System (INIS)

    Loennblad, L.; Peterson, C.; Pi, H.; Roegnvaldsson, T.

    1991-01-01

    Self-organizing neural networks are briefly reviewed and compared with supervised learning algorithms like back-propagation. The power of self-organization networks is in their capability of displaying typical features in a transparent manner. This is successfully demonstrated with two applications from hadronic jet physics; hadronization model discrimination and separation of b.c. and light quarks. (orig.)

  2. Linking structural features of protein complexes and biological function.

    Science.gov (United States)

    Sowmya, Gopichandran; Breen, Edmond J; Ranganathan, Shoba

    2015-09-01

    Protein-protein interaction (PPI) establishes the central basis for complex cellular networks in a biological cell. Association of proteins with other proteins occurs at varying affinities, yet with a high degree of specificity. PPIs lead to diverse functionality such as catalysis, regulation, signaling, immunity, and inhibition, playing a crucial role in functional genomics. The molecular principle of such interactions is often elusive in nature. Therefore, a comprehensive analysis of known protein complexes from the Protein Data Bank (PDB) is essential for the characterization of structural interface features to determine structure-function relationship. Thus, we analyzed a nonredundant dataset of 278 heterodimer protein complexes, categorized into major functional classes, for distinguishing features. Interestingly, our analysis has identified five key features (interface area, interface polar residue abundance, hydrogen bonds, solvation free energy gain from interface formation, and binding energy) that are discriminatory among the functional classes using Kruskal-Wallis rank sum test. Significant correlations between these PPI interface features amongst functional categories are also documented. Salt bridges correlate with interface area in regulator-inhibitors (r = 0.75). These representative features have implications for the prediction of potential function of novel protein complexes. The results provide molecular insights for better understanding of PPIs and their relation to biological functions. © 2015 The Protein Society.

  3. Breast image feature learning with adaptive deconvolutional networks

    Science.gov (United States)

    Jamieson, Andrew R.; Drukker, Karen; Giger, Maryellen L.

    2012-03-01

    Feature extraction is a critical component of medical image analysis. Many computer-aided diagnosis approaches employ hand-designed, heuristic lesion extracted features. An alternative approach is to learn features directly from images. In this preliminary study, we explored the use of Adaptive Deconvolutional Networks (ADN) for learning high-level features in diagnostic breast mass lesion images with potential application to computer-aided diagnosis (CADx) and content-based image retrieval (CBIR). ADNs (Zeiler, et. al., 2011), are recently-proposed unsupervised, generative hierarchical models that decompose images via convolution sparse coding and max pooling. We trained the ADNs to learn multiple layers of representation for two breast image data sets on two different modalities (739 full field digital mammography (FFDM) and 2393 ultrasound images). Feature map calculations were accelerated by use of GPUs. Following Zeiler et. al., we applied the Spatial Pyramid Matching (SPM) kernel (Lazebnik, et. al., 2006) on the inferred feature maps and combined this with a linear support vector machine (SVM) classifier for the task of binary classification between cancer and non-cancer breast mass lesions. Non-linear, local structure preserving dimension reduction, Elastic Embedding (Carreira-Perpiñán, 2010), was then used to visualize the SPM kernel output in 2D and qualitatively inspect image relationships learned. Performance was found to be competitive with current CADx schemes that use human-designed features, e.g., achieving a 0.632+ bootstrap AUC (by case) of 0.83 [0.78, 0.89] for an ultrasound image set (1125 cases).

  4. Chinese wine classification system based on micrograph using combination of shape and structure features

    Science.gov (United States)

    Wan, Yi

    2011-06-01

    Chinese wines can be classification or graded by the micrographs. Micrographs of Chinese wines show floccules, stick and granule of variant shape and size. Different wines have variant microstructure and micrographs, we study the classification of Chinese wines based on the micrographs. Shape and structure of wines' particles in microstructure is the most important feature for recognition and classification of wines. So we introduce a feature extraction method which can describe the structure and region shape of micrograph efficiently. First, the micrographs are enhanced using total variation denoising, and segmented using a modified Otsu's method based on the Rayleigh Distribution. Then features are extracted using proposed method in the paper based on area, perimeter and traditional shape feature. Eight kinds total 26 features are selected. Finally, Chinese wine classification system based on micrograph using combination of shape and structure features and BP neural network have been presented. We compare the recognition results for different choices of features (traditional shape features or proposed features). The experimental results show that the better classification rate have been achieved using the combinational features proposed in this paper.

  5. Multiple Resting-State Networks Are Associated With Tremors and Cognitive Features in Essential Tremor.

    Science.gov (United States)

    Fang, Weidong; Chen, Huiyue; Wang, Hansheng; Zhang, Han; Liu, Mengqi; Puneet, Munankami; Lv, Fajin; Cheng, Oumei; Wang, Xuefeng; Lu, Xiurong; Luo, Tianyou

    2015-12-01

    The heterogeneous clinical features of essential tremor indicate that the dysfunctions of this syndrome are not confined to motor networks, but extend to nonmotor networks. Currently, these neural network dysfunctions in essential tremor remain unclear. In this study, independent component analysis of resting-state functional MRI was used to study these neural network mechanisms. Thirty-five essential tremor patients and 35 matched healthy controls with clinical and neuropsychological tests were included, and eight resting-state networks were identified. After considering the structure and head-motion factors and testing the reliability of the selected resting-state networks, we assessed the functional connectivity changes within or between resting-state networks. Finally, image-behavior correlation analysis was performed. Compared to healthy controls, essential tremor patients displayed increased functional connectivity in the sensorimotor and salience networks and decreased functional connectivity in the cerebellum network. Additionally, increased functional network connectivity was observed between anterior and posterior default mode networks, and a decreased functional network connectivity was noted between the cerebellum network and the sensorimotor and posterior default mode networks. Importantly, the functional connectivity changes within and between these resting-state networks were correlated with the tremor severity and total cognitive scores of essential tremor patients. The findings of this study provide the first evidence that functional connectivity changes within and between multiple resting-state networks are associated with tremors and cognitive features of essential tremor, and this work demonstrates a potential approach for identifying the underlying neural network mechanisms of this syndrome. © 2015 International Parkinson and Movement Disorder Society.

  6. Exponential random graph models for networks with community structure.

    Science.gov (United States)

    Fronczak, Piotr; Fronczak, Agata; Bujok, Maksymilian

    2013-09-01

    Although the community structure organization is an important characteristic of real-world networks, most of the traditional network models fail to reproduce the feature. Therefore, the models are useless as benchmark graphs for testing community detection algorithms. They are also inadequate to predict various properties of real networks. With this paper we intend to fill the gap. We develop an exponential random graph approach to networks with community structure. To this end we mainly built upon the idea of blockmodels. We consider both the classical blockmodel and its degree-corrected counterpart and study many of their properties analytically. We show that in the degree-corrected blockmodel, node degrees display an interesting scaling property, which is reminiscent of what is observed in real-world fractal networks. A short description of Monte Carlo simulations of the models is also given in the hope of being useful to others working in the field.

  7. Modeling structure and resilience of the dark network.

    Science.gov (United States)

    De Domenico, Manlio; Arenas, Alex

    2017-02-01

    While the statistical and resilience properties of the Internet are no longer changing significantly across time, the Darknet, a network devoted to keep anonymous its traffic, still experiences rapid changes to improve the security of its users. Here we study the structure of the Darknet and find that its topology is rather peculiar, being characterized by a nonhomogeneous distribution of connections, typical of scale-free networks; very short path lengths and high clustering, typical of small-world networks; and lack of a core of highly connected nodes. We propose a model to reproduce such features, demonstrating that the mechanisms used to improve cybersecurity are responsible for the observed topology. Unexpectedly, we reveal that its peculiar structure makes the Darknet much more resilient than the Internet (used as a benchmark for comparison at a descriptive level) to random failures, targeted attacks, and cascade failures, as a result of adaptive changes in response to the attempts of dismantling the network across time.

  8. Multi-frequency complex network from time series for uncovering oil-water flow structure.

    Science.gov (United States)

    Gao, Zhong-Ke; Yang, Yu-Xuan; Fang, Peng-Cheng; Jin, Ning-De; Xia, Cheng-Yi; Hu, Li-Dan

    2015-02-04

    Uncovering complex oil-water flow structure represents a challenge in diverse scientific disciplines. This challenge stimulates us to develop a new distributed conductance sensor for measuring local flow signals at different positions and then propose a novel approach based on multi-frequency complex network to uncover the flow structures from experimental multivariate measurements. In particular, based on the Fast Fourier transform, we demonstrate how to derive multi-frequency complex network from multivariate time series. We construct complex networks at different frequencies and then detect community structures. Our results indicate that the community structures faithfully represent the structural features of oil-water flow patterns. Furthermore, we investigate the network statistic at different frequencies for each derived network and find that the frequency clustering coefficient enables to uncover the evolution of flow patterns and yield deep insights into the formation of flow structures. Current results present a first step towards a network visualization of complex flow patterns from a community structure perspective.

  9. Network structure exploration in networks with node attributes

    Science.gov (United States)

    Chen, Yi; Wang, Xiaolong; Bu, Junzhao; Tang, Buzhou; Xiang, Xin

    2016-05-01

    Complex networks provide a powerful way to represent complex systems and have been widely studied during the past several years. One of the most important tasks of network analysis is to detect structures (also called structural regularities) embedded in networks by determining group number and group partition. Most of network structure exploration models only consider network links. However, in real world networks, nodes may have attributes that are useful for network structure exploration. In this paper, we propose a novel Bayesian nonparametric (BNP) model to explore structural regularities in networks with node attributes, called Bayesian nonparametric attribute (BNPA) model. This model does not only take full advantage of both links between nodes and node attributes for group partition via shared hidden variables, but also determine group number automatically via the Bayesian nonparametric theory. Experiments conducted on a number of real and synthetic networks show that our BNPA model is able to automatically explore structural regularities in networks with node attributes and is competitive with other state-of-the-art models.

  10. Maximum entropy methods for extracting the learned features of deep neural networks.

    Science.gov (United States)

    Finnegan, Alex; Song, Jun S

    2017-10-01

    New architectures of multilayer artificial neural networks and new methods for training them are rapidly revolutionizing the application of machine learning in diverse fields, including business, social science, physical sciences, and biology. Interpreting deep neural networks, however, currently remains elusive, and a critical challenge lies in understanding which meaningful features a network is actually learning. We present a general method for interpreting deep neural networks and extracting network-learned features from input data. We describe our algorithm in the context of biological sequence analysis. Our approach, based on ideas from statistical physics, samples from the maximum entropy distribution over possible sequences, anchored at an input sequence and subject to constraints implied by the empirical function learned by a network. Using our framework, we demonstrate that local transcription factor binding motifs can be identified from a network trained on ChIP-seq data and that nucleosome positioning signals are indeed learned by a network trained on chemical cleavage nucleosome maps. Imposing a further constraint on the maximum entropy distribution also allows us to probe whether a network is learning global sequence features, such as the high GC content in nucleosome-rich regions. This work thus provides valuable mathematical tools for interpreting and extracting learned features from feed-forward neural networks.

  11. Loss of integrity and atrophy in cingulate structural covariance networks in Parkinson's disease.

    Science.gov (United States)

    de Schipper, Laura J; van der Grond, Jeroen; Marinus, Johan; Henselmans, Johanna M L; van Hilten, Jacobus J

    2017-01-01

    In Parkinson's disease (PD), the relation between cortical brain atrophy on MRI and clinical progression is not straightforward. Determination of changes in structural covariance networks - patterns of covariance in grey matter density - has shown to be a valuable technique to detect subtle grey matter variations. We evaluated how structural network integrity in PD is related to clinical data. 3 Tesla MRI was performed in 159 PD patients. We used nine standardized structural covariance networks identified in 370 healthy subjects as a template in the analysis of the PD data. Clinical assessment comprised motor features (Movement Disorder Society-Unified Parkinson's Disease Rating Scale; MDS-UPDRS motor scale) and predominantly non-dopaminergic features (SEverity of Non-dopaminergic Symptoms in Parkinson's Disease; SENS-PD scale: postural instability and gait difficulty, psychotic symptoms, excessive daytime sleepiness, autonomic dysfunction, cognitive impairment and depressive symptoms). Voxel-based analyses were performed within networks significantly associated with PD. The anterior and posterior cingulate network showed decreased integrity, associated with the SENS-PD score, p = 0.001 (β = - 0.265, η p 2  = 0.070) and p = 0.001 (β = - 0.264, η p 2  = 0.074), respectively. Of the components of the SENS-PD score, cognitive impairment and excessive daytime sleepiness were associated with atrophy within both networks. We identified loss of integrity and atrophy in the anterior and posterior cingulate networks in PD patients. Abnormalities of both networks were associated with predominantly non-dopaminergic features, specifically cognition and excessive daytime sleepiness. Our findings suggest that (components of) the cingulate networks display a specific vulnerability to the pathobiology of PD and may operate as interfaces between networks involved in cognition and alertness.

  12. NIMEFI: gene regulatory network inference using multiple ensemble feature importance algorithms.

    Directory of Open Access Journals (Sweden)

    Joeri Ruyssinck

    Full Text Available One of the long-standing open challenges in computational systems biology is the topology inference of gene regulatory networks from high-throughput omics data. Recently, two community-wide efforts, DREAM4 and DREAM5, have been established to benchmark network inference techniques using gene expression measurements. In these challenges the overall top performer was the GENIE3 algorithm. This method decomposes the network inference task into separate regression problems for each gene in the network in which the expression values of a particular target gene are predicted using all other genes as possible predictors. Next, using tree-based ensemble methods, an importance measure for each predictor gene is calculated with respect to the target gene and a high feature importance is considered as putative evidence of a regulatory link existing between both genes. The contribution of this work is twofold. First, we generalize the regression decomposition strategy of GENIE3 to other feature importance methods. We compare the performance of support vector regression, the elastic net, random forest regression, symbolic regression and their ensemble variants in this setting to the original GENIE3 algorithm. To create the ensemble variants, we propose a subsampling approach which allows us to cast any feature selection algorithm that produces a feature ranking into an ensemble feature importance algorithm. We demonstrate that the ensemble setting is key to the network inference task, as only ensemble variants achieve top performance. As second contribution, we explore the effect of using rankwise averaged predictions of multiple ensemble algorithms as opposed to only one. We name this approach NIMEFI (Network Inference using Multiple Ensemble Feature Importance algorithms and show that this approach outperforms all individual methods in general, although on a specific network a single method can perform better. An implementation of NIMEFI has been made

  13. The effect of destination linked feature selection in real-time network intrusion detection

    CSIR Research Space (South Africa)

    Mzila, P

    2013-07-01

    Full Text Available techniques in the network intrusion detection system (NIDS) is the feature selection technique. The ability of NIDS to accurately identify intrusion from the network traffic relies heavily on feature selection, which describes the pattern of the network...

  14. Morphological self-organizing feature map neural network with applications to automatic target recognition

    Science.gov (United States)

    Zhang, Shijun; Jing, Zhongliang; Li, Jianxun

    2005-01-01

    The rotation invariant feature of the target is obtained using the multi-direction feature extraction property of the steerable filter. Combining the morphological operation top-hat transform with the self-organizing feature map neural network, the adaptive topological region is selected. Using the erosion operation, the topological region shrinkage is achieved. The steerable filter based morphological self-organizing feature map neural network is applied to automatic target recognition of binary standard patterns and real-world infrared sequence images. Compared with Hamming network and morphological shared-weight networks respectively, the higher recognition correct rate, robust adaptability, quick training, and better generalization of the proposed method are achieved.

  15. [Network structures in biological systems].

    Science.gov (United States)

    Oleskin, A V

    2013-01-01

    Network structures (networks) that have been extensively studied in the humanities are characterized by cohesion, a lack of a central control unit, and predominantly fractal properties. They are contrasted with structures that contain a single centre (hierarchies) as well as with those whose elements predominantly compete with one another (market-type structures). As far as biological systems are concerned, their network structures can be subdivided into a number of types involving different organizational mechanisms. Network organization is characteristic of various structural levels of biological systems ranging from single cells to integrated societies. These networks can be classified into two main subgroups: (i) flat (leaderless) network structures typical of systems that are composed of uniform elements and represent modular organisms or at least possess manifest integral properties and (ii) three-dimensional, partly hierarchical structures characterized by significant individual and/or intergroup (intercaste) differences between their elements. All network structures include an element that performs structural, protective, and communication-promoting functions. By analogy to cell structures, this element is denoted as the matrix of a network structure. The matrix includes a material and an immaterial component. The material component comprises various structures that belong to the whole structure and not to any of its elements per se. The immaterial (ideal) component of the matrix includes social norms and rules regulating network elements' behavior. These behavioral rules can be described in terms of algorithms. Algorithmization enables modeling the behavior of various network structures, particularly of neuron networks and their artificial analogs.

  16. 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.

  17. PREvaIL, an integrative approach for inferring catalytic residues using sequence, structural, and network features in a machine-learning framework.

    Science.gov (United States)

    Song, Jiangning; Li, Fuyi; Takemoto, Kazuhiro; Haffari, Gholamreza; Akutsu, Tatsuya; Chou, Kuo-Chen; Webb, Geoffrey I

    2018-04-14

    Determining the catalytic residues in an enzyme is critical to our understanding the relationship between protein sequence, structure, function, and enhancing our ability to design novel enzymes and their inhibitors. Although many enzymes have been sequenced, and their primary and tertiary structures determined, experimental methods for enzyme functional characterization lag behind. Because experimental methods used for identifying catalytic residues are resource- and labor-intensive, computational approaches have considerable value and are highly desirable for their ability to complement experimental studies in identifying catalytic residues and helping to bridge the sequence-structure-function gap. In this study, we describe a new computational method called PREvaIL for predicting enzyme catalytic residues. This method was developed by leveraging a comprehensive set of informative features extracted from multiple levels, including sequence, structure, and residue-contact network, in a random forest machine-learning framework. Extensive benchmarking experiments on eight different datasets based on 10-fold cross-validation and independent tests, as well as side-by-side performance comparisons with seven modern sequence- and structure-based methods, showed that PREvaIL achieved competitive predictive performance, with an area under the receiver operating characteristic curve and area under the precision-recall curve ranging from 0.896 to 0.973 and from 0.294 to 0.523, respectively. We demonstrated that this method was able to capture useful signals arising from different levels, leveraging such differential but useful types of features and allowing us to significantly improve the performance of catalytic residue prediction. We believe that this new method can be utilized as a valuable tool for both understanding the complex sequence-structure-function relationships of proteins and facilitating the characterization of novel enzymes lacking functional annotations

  18. Efficient identification of critical residues based only on protein structure by network analysis.

    Directory of Open Access Journals (Sweden)

    Michael P Cusack

    2007-05-01

    Full Text Available Despite the increasing number of published protein structures, and the fact that each protein's function relies on its three-dimensional structure, there is limited access to automatic programs used for the identification of critical residues from the protein structure, compared with those based on protein sequence. Here we present a new algorithm based on network analysis applied exclusively on protein structures to identify critical residues. Our results show that this method identifies critical residues for protein function with high reliability and improves automatic sequence-based approaches and previous network-based approaches. The reliability of the method depends on the conformational diversity screened for the protein of interest. We have designed a web site to give access to this software at http://bis.ifc.unam.mx/jamming/. In summary, a new method is presented that relates critical residues for protein function with the most traversed residues in networks derived from protein structures. A unique feature of the method is the inclusion of the conformational diversity of proteins in the prediction, thus reproducing a basic feature of the structure/function relationship of proteins.

  19. Automated analysis of Physarum network structure and dynamics

    Science.gov (United States)

    Fricker, Mark D.; Akita, Dai; Heaton, Luke LM; Jones, Nick; Obara, Boguslaw; Nakagaki, Toshiyuki

    2017-06-01

    We evaluate different ridge-enhancement and segmentation methods to automatically extract the network architecture from time-series of Physarum plasmodia withdrawing from an arena via a single exit. Whilst all methods gave reasonable results, judged by precision-recall analysis against a ground-truth skeleton, the mean phase angle (Feature Type) from intensity-independent, phase-congruency edge enhancement and watershed segmentation was the most robust to variation in threshold parameters. The resultant single pixel-wide segmented skeleton was converted to a graph representation as a set of weighted adjacency matrices containing the physical dimensions of each vein, and the inter-vein regions. We encapsulate the complete image processing and network analysis pipeline in a downloadable software package, and provide an extensive set of metrics that characterise the network structure, including hierarchical loop decomposition to analyse the nested structure of the developing network. In addition, the change in volume for each vein and intervening plasmodial sheet was used to predict the net flow across the network. The scaling relationships between predicted current, speed and shear force with vein radius were consistent with predictions from Murray’s law. This work was presented at PhysNet 2015.

  20. Automated analysis of Physarum network structure and dynamics

    International Nuclear Information System (INIS)

    Fricker, Mark D; Heaton, Luke LM; Akita, Dai; Jones, Nick; Obara, Boguslaw; Nakagaki, Toshiyuki

    2017-01-01

    We evaluate different ridge-enhancement and segmentation methods to automatically extract the network architecture from time-series of Physarum plasmodia withdrawing from an arena via a single exit. Whilst all methods gave reasonable results, judged by precision-recall analysis against a ground-truth skeleton, the mean phase angle (Feature Type) from intensity-independent, phase-congruency edge enhancement and watershed segmentation was the most robust to variation in threshold parameters. The resultant single pixel-wide segmented skeleton was converted to a graph representation as a set of weighted adjacency matrices containing the physical dimensions of each vein, and the inter-vein regions. We encapsulate the complete image processing and network analysis pipeline in a downloadable software package, and provide an extensive set of metrics that characterise the network structure, including hierarchical loop decomposition to analyse the nested structure of the developing network. In addition, the change in volume for each vein and intervening plasmodial sheet was used to predict the net flow across the network. The scaling relationships between predicted current, speed and shear force with vein radius were consistent with predictions from Murray’s law. This work was presented at PhysNet 2015. (paper)

  1. The structure of political elite networks in the Republic of Poland in 1993—2013

    Directory of Open Access Journals (Sweden)

    Fidrya Efim

    2013-12-01

    Full Text Available To identify the structure of network ties within Polish political elites; to study the features of network ties formation and the impact that both primary and labour socialisation periods and diaspora characteristics have on this process; to describe the structural features of the resultant network structures over different periods of time and analyse the structural dynamics of political elites for the purpose of forecasting major trends in the structural transformation of Polish political elites. In the course of the study, biographical data on the presidents, ministers, advisors, and party leaders of the Republic of Poland was collected and processed. The work follows the network analysis paradigm and identifies the dynamics of the key network parameters: distance, density, transitivity, and compactness. The author analyses the dynamics of representation in the structure of political territorial diaspora elites, business community members, and ‘moral politicians’. The article identifies two periods of formation of political party networks in Poland: the first period (1993—2007 saw a transition from rather weakly integrated systems to high density and cohesion networks as early as the second electoral cycle, after which a gradual decrease in the key indices of network integration was registered. A new peak of network cohesion and integration was reached in 2007—2011; however, the death of some key members of political elites in a plane crash resulted in a decrease in the network integration indices to the level of 2001—2005. On the whole, the network structure of Polish political elite is characterised by unstable dynamics relating to the crisis events of the past. However, it is established that the elites have a pronounced diaspora core and an unstable periphery; the share of businesspeople directly participating in political processes is decreasing, whereas ‘moral politicians’ usually take an active part in the formation of

  2. Deep Neural Network for Structural Prediction and Lane Detection in Traffic Scene.

    Science.gov (United States)

    Li, Jun; Mei, Xue; Prokhorov, Danil; Tao, Dacheng

    2017-03-01

    Hierarchical neural networks have been shown to be effective in learning representative image features and recognizing object classes. However, most existing networks combine the low/middle level cues for classification without accounting for any spatial structures. For applications such as understanding a scene, how the visual cues are spatially distributed in an image becomes essential for successful analysis. This paper extends the framework of deep neural networks by accounting for the structural cues in the visual signals. In particular, two kinds of neural networks have been proposed. First, we develop a multitask deep convolutional network, which simultaneously detects the presence of the target and the geometric attributes (location and orientation) of the target with respect to the region of interest. Second, a recurrent neuron layer is adopted for structured visual detection. The recurrent neurons can deal with the spatial distribution of visible cues belonging to an object whose shape or structure is difficult to explicitly define. Both the networks are demonstrated by the practical task of detecting lane boundaries in traffic scenes. The multitask convolutional neural network provides auxiliary geometric information to help the subsequent modeling of the given lane structures. The recurrent neural network automatically detects lane boundaries, including those areas containing no marks, without any explicit prior knowledge or secondary modeling.

  3. Predicting adverse drug reaction profiles by integrating protein interaction networks with drug structures.

    Science.gov (United States)

    Huang, Liang-Chin; Wu, Xiaogang; Chen, Jake Y

    2013-01-01

    The prediction of adverse drug reactions (ADRs) has become increasingly important, due to the rising concern on serious ADRs that can cause drugs to fail to reach or stay in the market. We proposed a framework for predicting ADR profiles by integrating protein-protein interaction (PPI) networks with drug structures. We compared ADR prediction performances over 18 ADR categories through four feature groups-only drug targets, drug targets with PPI networks, drug structures, and drug targets with PPI networks plus drug structures. The results showed that the integration of PPI networks and drug structures can significantly improve the ADR prediction performance. The median AUC values for the four groups were 0.59, 0.61, 0.65, and 0.70. We used the protein features in the best two models, "Cardiac disorders" (median-AUC: 0.82) and "Psychiatric disorders" (median-AUC: 0.76), to build ADR-specific PPI networks with literature supports. For validation, we examined 30 drugs withdrawn from the U.S. market to see if our approach can predict their ADR profiles and explain why they were withdrawn. Except for three drugs having ADRs in the categories we did not predict, 25 out of 27 withdrawn drugs (92.6%) having severe ADRs were successfully predicted by our approach. © 2012 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  4. IMPLEMENTATION OF ARTIFICIAL NEURAL NETWORK FOR FACE RECOGNITION USING GABOR FEATURE EXTRACTION

    Directory of Open Access Journals (Sweden)

    Muthukannan K

    2013-11-01

    Full Text Available Face detection and recognition is the first step for many applications in various fields such as identification and is used as a key to enter into the various electronic devices, video surveillance, and human computer interface and image database management. This paper focuses on feature extraction in an image using Gabor filter and the extracted image feature vector is then given as an input to the neural network. The neural network is trained with the input data. The Gabor wavelet concentrates on the important components of the face including eye, mouth, nose, cheeks. The main requirement of this technique is the threshold, which gives privileged sensitivity. The threshold values are the feature vectors taken from the faces. These feature vectors are given into the feed forward neural network to train the network. Using the feed forward neural network as a classifier, the recognized and unrecognized faces are classified. This classifier attains a higher face deduction rate. By training more input vectors the system proves to be effective. The effectiveness of the proposed method is demonstrated by the experimental results.

  5. Seismic signal auto-detecing from different features by using Convolutional Neural Network

    Science.gov (United States)

    Huang, Y.; Zhou, Y.; Yue, H.; Zhou, S.

    2017-12-01

    We try Convolutional Neural Network to detect some features of seismic data and compare their efficience. The features include whether a signal is seismic signal or noise and the arrival time of P and S phase and each feature correspond to a Convolutional Neural Network. We first use traditional STA/LTA to recongnize some events and then use templete matching to find more events as training set for the Neural Network. To make the training set more various, we add some noise to the seismic data and make some synthetic seismic data and noise. The 3-component raw signal and time-frequancy ananlyze are used as the input data for our neural network. Our Training is performed on GPUs to achieve efficient convergence. Our method improved the precision in comparison with STA/LTA and template matching. We will move to recurrent neural network to see if this kind network is better in detect P and S phase.

  6. How structure determines correlations in neuronal networks.

    Directory of Open Access Journals (Sweden)

    Volker Pernice

    2011-05-01

    Full Text Available Networks are becoming a ubiquitous metaphor for the understanding of complex biological systems, spanning the range between molecular signalling pathways, neural networks in the brain, and interacting species in a food web. In many models, we face an intricate interplay between the topology of the network and the dynamics of the system, which is generally very hard to disentangle. A dynamical feature that has been subject of intense research in various fields are correlations between the noisy activity of nodes in a network. We consider a class of systems, where discrete signals are sent along the links of the network. Such systems are of particular relevance in neuroscience, because they provide models for networks of neurons that use action potentials for communication. We study correlations in dynamic networks with arbitrary topology, assuming linear pulse coupling. With our novel approach, we are able to understand in detail how specific structural motifs affect pairwise correlations. Based on a power series decomposition of the covariance matrix, we describe the conditions under which very indirect interactions will have a pronounced effect on correlations and population dynamics. In random networks, we find that indirect interactions may lead to a broad distribution of activation levels with low average but highly variable correlations. This phenomenon is even more pronounced in networks with distance dependent connectivity. In contrast, networks with highly connected hubs or patchy connections often exhibit strong average correlations. Our results are particularly relevant in view of new experimental techniques that enable the parallel recording of spiking activity from a large number of neurons, an appropriate interpretation of which is hampered by the currently limited understanding of structure-dynamics relations in complex networks.

  7. Automatic feature learning using multichannel ROI based on deep structured algorithms for computerized lung cancer diagnosis.

    Science.gov (United States)

    Sun, Wenqing; Zheng, Bin; Qian, Wei

    2017-10-01

    This study aimed to analyze the ability of extracting automatically generated features using deep structured algorithms in lung nodule CT image diagnosis, and compare its performance with traditional computer aided diagnosis (CADx) systems using hand-crafted features. All of the 1018 cases were acquired from Lung Image Database Consortium (LIDC) public lung cancer database. The nodules were segmented according to four radiologists' markings, and 13,668 samples were generated by rotating every slice of nodule images. Three multichannel ROI based deep structured algorithms were designed and implemented in this study: convolutional neural network (CNN), deep belief network (DBN), and stacked denoising autoencoder (SDAE). For the comparison purpose, we also implemented a CADx system using hand-crafted features including density features, texture features and morphological features. The performance of every scheme was evaluated by using a 10-fold cross-validation method and an assessment index of the area under the receiver operating characteristic curve (AUC). The observed highest area under the curve (AUC) was 0.899±0.018 achieved by CNN, which was significantly higher than traditional CADx with the AUC=0.848±0.026. The results from DBN was also slightly higher than CADx, while SDAE was slightly lower. By visualizing the automatic generated features, we found some meaningful detectors like curvy stroke detectors from deep structured schemes. The study results showed the deep structured algorithms with automatically generated features can achieve desirable performance in lung nodule diagnosis. With well-tuned parameters and large enough dataset, the deep learning algorithms can have better performance than current popular CADx. We believe the deep learning algorithms with similar data preprocessing procedure can be used in other medical image analysis areas as well. Copyright © 2017. Published by Elsevier Ltd.

  8. Robust Learning of High-dimensional Biological Networks with Bayesian Networks

    Science.gov (United States)

    Nägele, Andreas; Dejori, Mathäus; Stetter, Martin

    Structure learning of Bayesian networks applied to gene expression data has become a potentially useful method to estimate interactions between genes. However, the NP-hardness of Bayesian network structure learning renders the reconstruction of the full genetic network with thousands of genes unfeasible. Consequently, the maximal network size is usually restricted dramatically to a small set of genes (corresponding with variables in the Bayesian network). Although this feature reduction step makes structure learning computationally tractable, on the downside, the learned structure might be adversely affected due to the introduction of missing genes. Additionally, gene expression data are usually very sparse with respect to the number of samples, i.e., the number of genes is much greater than the number of different observations. Given these problems, learning robust network features from microarray data is a challenging task. This chapter presents several approaches tackling the robustness issue in order to obtain a more reliable estimation of learned network features.

  9. Deep Salient Feature Based Anti-Noise Transfer Network for Scene Classification of Remote Sensing Imagery

    Directory of Open Access Journals (Sweden)

    Xi Gong

    2018-03-01

    Full Text Available Remote sensing (RS scene classification is important for RS imagery semantic interpretation. Although tremendous strides have been made in RS scene classification, one of the remaining open challenges is recognizing RS scenes in low quality variance (e.g., various scales and noises. This paper proposes a deep salient feature based anti-noise transfer network (DSFATN method that effectively enhances and explores the high-level features for RS scene classification in different scales and noise conditions. In DSFATN, a novel discriminative deep salient feature (DSF is introduced by saliency-guided DSF extraction, which conducts a patch-based visual saliency (PBVS algorithm using “visual attention” mechanisms to guide pre-trained CNNs for producing the discriminative high-level features. Then, an anti-noise network is proposed to learn and enhance the robust and anti-noise structure information of RS scene by directly propagating the label information to fully-connected layers. A joint loss is used to minimize the anti-noise network by integrating anti-noise constraint and a softmax classification loss. The proposed network architecture can be easily trained with a limited amount of training data. The experiments conducted on three different scale RS scene datasets show that the DSFATN method has achieved excellent performance and great robustness in different scales and noise conditions. It obtains classification accuracy of 98.25%, 98.46%, and 98.80%, respectively, on the UC Merced Land Use Dataset (UCM, the Google image dataset of SIRI-WHU, and the SAT-6 dataset, advancing the state-of-the-art substantially.

  10. Emergence of structural patterns out of synchronization in networks with competitive interactions

    Science.gov (United States)

    Assenza, Salvatore; Gutiérrez, Ricardo; Gómez-Gardeñes, Jesús; Latora, Vito; Boccaletti, Stefano

    2011-09-01

    Synchronization is a collective phenomenon occurring in systems of interacting units, and is ubiquitous in nature, society and technology. Recent studies have enlightened the important role played by the interaction topology on the emergence of synchronized states. However, most of these studies neglect that real world systems change their interaction patterns in time. Here, we analyze synchronization features in networks in which structural and dynamical features co-evolve. The feedback of the node dynamics on the interaction pattern is ruled by the competition of two mechanisms: homophily (reinforcing those interactions with other correlated units in the graph) and homeostasis (preserving the value of the input strength received by each unit). The competition between these two adaptive principles leads to the emergence of key structural properties observed in real world networks, such as modular and scale-free structures, together with a striking enhancement of local synchronization in systems with no global order.

  11. Comparison and validation of community structures in complex networks

    Science.gov (United States)

    Gustafsson, Mika; Hörnquist, Michael; Lombardi, Anna

    2006-07-01

    The issue of partitioning a network into communities has attracted a great deal of attention recently. Most authors seem to equate this issue with the one of finding the maximum value of the modularity, as defined by Newman. Since the problem formulated this way is believed to be NP-hard, most effort has gone into the construction of search algorithms, and less to the question of other measures of community structures, similarities between various partitionings and the validation with respect to external information. Here we concentrate on a class of computer generated networks and on three well-studied real networks which constitute a bench-mark for network studies; the karate club, the US college football teams and a gene network of yeast. We utilize some standard ways of clustering data (originally not designed for finding community structures in networks) and show that these classical methods sometimes outperform the newer ones. We discuss various measures of the strength of the modular structure, and show by examples features and drawbacks. Further, we compare different partitions by applying some graph-theoretic concepts of distance, which indicate that one of the quality measures of the degree of modularity corresponds quite well with the distance from the true partition. Finally, we introduce a way to validate the partitionings with respect to external data when the nodes are classified but the network structure is unknown. This is here possible since we know everything of the computer generated networks, as well as the historical answer to how the karate club and the football teams are partitioned in reality. The partitioning of the gene network is validated by use of the Gene Ontology database, where we show that a community in general corresponds to a biological process.

  12. Complex network approach to characterize the statistical features of the sunspot series

    International Nuclear Information System (INIS)

    Zou, Yong; Liu, Zonghua; Small, Michael; Kurths, Jürgen

    2014-01-01

    Complex network approaches have been recently developed as an alternative framework to study the statistical features of time-series data. We perform a visibility-graph analysis on both the daily and monthly sunspot series. Based on the data, we propose two ways to construct the network: one is from the original observable measurements and the other is from a negative-inverse-transformed series. The degree distribution of the derived networks for the strong maxima has clear non-Gaussian properties, while the degree distribution for minima is bimodal. The long-term variation of the cycles is reflected by hubs in the network that span relatively large time intervals. Based on standard network structural measures, we propose to characterize the long-term correlations by waiting times between two subsequent events. The persistence range of the solar cycles has been identified over 15–1000 days by a power-law regime with scaling exponent γ = 2.04 of the occurrence time of two subsequent strong minima. In contrast, a persistent trend is not present in the maximal numbers, although maxima do have significant deviations from an exponential form. Our results suggest some new insights for evaluating existing models. (paper)

  13. Regular Network Class Features Enhancement Using an Evolutionary Synthesis Algorithm

    Directory of Open Access Journals (Sweden)

    O. G. Monahov

    2014-01-01

    Full Text Available This paper investigates a solution of the optimization problem concerning the construction of diameter-optimal regular networks (graphs. Regular networks are of practical interest as the graph-theoretical models of reliable communication networks of parallel supercomputer systems, as a basis of the structure in a model of small world in optical and neural networks. It presents a new class of parametrically described regular networks - hypercirculant networks (graphs. An approach that uses evolutionary algorithms for the automatic generation of parametric descriptions of optimal hypercirculant networks is developed. Synthesis of optimal hypercirculant networks is based on the optimal circulant networks with smaller degree of nodes. To construct optimal hypercirculant networks is used a template of circulant network from the known optimal families of circulant networks with desired number of nodes and with smaller degree of nodes. Thus, a generating set of the circulant network is used as a generating subset of the hypercirculant network, and the missing generators are synthesized by means of the evolutionary algorithm, which is carrying out minimization of diameter (average diameter of networks. A comparative analysis of the structural characteristics of hypercirculant, toroidal, and circulant networks is conducted. The advantage hypercirculant networks under such structural characteristics, as diameter, average diameter, and the width of bisection, with comparable costs of the number of nodes and the number of connections is demonstrated. It should be noted the advantage of hypercirculant networks of dimension three over four higher-dimensional tori. Thus, the optimization of hypercirculant networks of dimension three is more efficient than the introduction of an additional dimension for the corresponding toroidal structures. The paper also notes the best structural parameters of hypercirculant networks in comparison with iBT-networks previously

  14. A Multiobjective Sparse Feature Learning Model for Deep Neural Networks.

    Science.gov (United States)

    Gong, Maoguo; Liu, Jia; Li, Hao; Cai, Qing; Su, Linzhi

    2015-12-01

    Hierarchical deep neural networks are currently popular learning models for imitating the hierarchical architecture of human brain. Single-layer feature extractors are the bricks to build deep networks. Sparse feature learning models are popular models that can learn useful representations. But most of those models need a user-defined constant to control the sparsity of representations. In this paper, we propose a multiobjective sparse feature learning model based on the autoencoder. The parameters of the model are learnt by optimizing two objectives, reconstruction error and the sparsity of hidden units simultaneously to find a reasonable compromise between them automatically. We design a multiobjective induced learning procedure for this model based on a multiobjective evolutionary algorithm. In the experiments, we demonstrate that the learning procedure is effective, and the proposed multiobjective model can learn useful sparse features.

  15. Managing Network Partitions in Structured P2P Networks

    Science.gov (United States)

    Shafaat, Tallat M.; Ghodsi, Ali; Haridi, Seif

    Structured overlay networks form a major class of peer-to-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-scale distributed system is destined to face network partitions. Consequently, the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems. This makes it a crucial requirement for building any structured peer-to-peer systems to be resilient to network partitions. Although the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems, it has hardly been studied in the context of structured peer-to-peer systems. Structured overlays have mainly been studied under churn (frequent joins/failures), which as a side effect solves the problem of network partitions, as it is similar to massive node failures. Yet, the crucial aspect of network mergers has been ignored. In fact, it has been claimed that ring-based structured overlay networks, which constitute the majority of the structured overlays, are intrinsically ill-suited for merging rings. In this chapter, we motivate the problem of network partitions and mergers in structured overlays. We discuss how a structured overlay can automatically detect a network partition and merger. We present an algorithm for merging multiple similar ring-based overlays when the underlying network merges. We examine the solution in dynamic conditions, showing how our solution is resilient to churn during the merger, something widely believed to be difficult or impossible. We evaluate the algorithm for various scenarios and show that even when falsely detecting a merger, the algorithm quickly terminates and does not clutter the network with many messages. The algorithm is flexible as the tradeoff between message complexity and time complexity can be adjusted by a parameter.

  16. A Bayesian Network Based Adaptability Design of Product Structures for Function Evolution

    Directory of Open Access Journals (Sweden)

    Shaobo Li

    2018-03-01

    Full Text Available Structure adaptability design is critical for function evolution in product families, in which many structural and functional design factors are intertwined together with manufacturing cost, customer satisfaction, and final market sales. How to achieve a delicate balance among all of these factors to maximize the market performance of the product is too complicated to address based on traditional domain experts’ knowledge or some ad hoc heuristics. Here, we propose a quantitative product evolution design model that is based on Bayesian networks to model the dynamic relationship between customer needs and product structure design. In our model, all of the structural or functional features along with customer satisfaction, manufacturing cost, sale price, market sales, and indirect factors are modeled as random variables denoted as nodes in the Bayesian networks. The structure of the Bayesian model is then determined based on the historical data, which captures the dynamic sophisticated relationship of customer demands of a product, structural design, and market performance. Application of our approach to an electric toothbrush product family evolution design problem shows that our model allows for designers to interrogate with the model and obtain theoretical and decision support for dynamic product feature design process.

  17. Dynamical Structure of a Traditional Amazonian Social Network

    Directory of Open Access Journals (Sweden)

    Paul L. Hooper

    2013-11-01

    Full Text Available Reciprocity is a vital feature of social networks, but relatively little is known about its temporal structure or the mechanisms underlying its persistence in real world behavior. In pursuit of these two questions, we study the stationary and dynamical signals of reciprocity in a network of manioc beer (Spanish: chicha; Tsimane’: shocdye’ drinking events in a Tsimane’ village in lowland Bolivia. At the stationary level, our analysis reveals that social exchange within the community is heterogeneously patterned according to kinship and spatial proximity. A positive relationship between the frequencies at which two families host each other, controlling for kinship and proximity, provides evidence for stationary reciprocity. Our analysis of the dynamical structure of this network presents a novel method for the study of conditional, or non-stationary, reciprocity effects. We find evidence that short-timescale reciprocity (within three days is present among non- and distant-kin pairs; conversely, we find that levels of cooperation among close kin can be accounted for on the stationary hypothesis alone.

  18. Topology of the Italian airport network: A scale-free small-world network with a fractal structure?

    International Nuclear Information System (INIS)

    Guida, Michele; Maria, Funaro

    2007-01-01

    In this paper, for the first time we analyze the structure of the Italian Airport Network (IAN) looking at it as a mathematical graph and investigate its topological properties. We find that it has very remarkable features, being like a scale-free network, since both the degree and the 'betweenness centrality' distributions follow a typical power-law known in literature as a Double Pareto Law. From a careful analysis of the data, the Italian Airport Network turns out to have a self-similar structure. In short, it is characterized by a fractal nature, whose typical dimensions can be easily determined from the values of the power-law scaling exponents. Moreover, we show that, according to the period examined, these distributions exhibit a number of interesting features, such as the existence of some 'hubs', i.e. in the graph theory's jargon, nodes with a very large number of links, and others most probably associated with geographical constraints. Also, we find that the IAN can be classified as a small-world network because the average distance between reachable pairs of airports grows at most as the logarithm of the number of airports. The IAN does not show evidence of 'communities' and this result could be the underlying reason behind the smallness of the value of the clustering coefficient, which is related to the probability that two nearest neighbors of a randomly chosen airport are connected

  19. Unraveling the disease consequences and mechanisms of modular structure in animal social networks

    Science.gov (United States)

    Sah, Pratha; Leu, Stephan T.; Cross, Paul C.; Hudson, Peter J.; Bansal, Shweta

    2017-01-01

    Disease risk is a potential cost of group living. Although modular organization is thought to reduce this cost in animal societies, empirical evidence toward this hypothesis has been conflicting. We analyzed empirical social networks from 43 animal species to motivate our study of the epidemiological consequences of modular structure in animal societies. From these empirical studies, we identified the features of interaction patterns associated with network modularity and developed a theoretical network model to investigate when and how subdivisions in social networks influence disease dynamics. Contrary to prior work, we found that disease risk is largely unaffected by modular structure, although social networks beyond a modular threshold experience smaller disease burden and longer disease duration. Our results illustrate that the lowering of disease burden in highly modular social networks is driven by two mechanisms of modular organization: network fragmentation and subgroup cohesion. Highly fragmented social networks with cohesive subgroups are able to structurally trap infections within a few subgroups and also cause a structural delay to the spread of disease outbreaks. Finally, we show that network models incorporating modular structure are necessary only when prior knowledge suggests that interactions within the population are highly subdivided. Otherwise, null networks based on basic knowledge about group size and local contact heterogeneity may be sufficient when data-limited estimates of epidemic consequences are necessary. Overall, our work does not support the hypothesis that modular structure universally mitigates the disease impact of group living.

  20. Evaluation of Persian Professional Web Social Networks\\\\\\' Features, to Provide a Suitable Solution for Optimization of These Networks in Iran

    Directory of Open Access Journals (Sweden)

    Nadjla Hariri

    2013-03-01

    Full Text Available This study aimed to determine the status of Persian professional web social networks' features and provide a suitable solution for optimization of these networks in Iran. The research methods were library research and evaluative method, and study population consisted of 10 Persian professional web social networks. In this study, for data collection, a check list of social networks important tools and features was used. According to the results, “Cloob”, “IR Experts” and “Doreh” were the most compatible networks with the criteria of social networks. Finally, some solutions were presented for optimization of capabilities of Persian professional web social networks.

  1. Heuristic algorithms for feature selection under Bayesian models with block-diagonal covariance structure.

    Science.gov (United States)

    Foroughi Pour, Ali; Dalton, Lori A

    2018-03-21

    Many bioinformatics studies aim to identify markers, or features, that can be used to discriminate between distinct groups. In problems where strong individual markers are not available, or where interactions between gene products are of primary interest, it may be necessary to consider combinations of features as a marker family. To this end, recent work proposes a hierarchical Bayesian framework for feature selection that places a prior on the set of features we wish to select and on the label-conditioned feature distribution. While an analytical posterior under Gaussian models with block covariance structures is available, the optimal feature selection algorithm for this model remains intractable since it requires evaluating the posterior over the space of all possible covariance block structures and feature-block assignments. To address this computational barrier, in prior work we proposed a simple suboptimal algorithm, 2MNC-Robust, with robust performance across the space of block structures. Here, we present three new heuristic feature selection algorithms. The proposed algorithms outperform 2MNC-Robust and many other popular feature selection algorithms on synthetic data. In addition, enrichment analysis on real breast cancer, colon cancer, and Leukemia data indicates they also output many of the genes and pathways linked to the cancers under study. Bayesian feature selection is a promising framework for small-sample high-dimensional data, in particular biomarker discovery applications. When applied to cancer data these algorithms outputted many genes already shown to be involved in cancer as well as potentially new biomarkers. Furthermore, one of the proposed algorithms, SPM, outputs blocks of heavily correlated genes, particularly useful for studying gene interactions and gene networks.

  2. From network structure to network reorganization: implications for adult neurogenesis

    International Nuclear Information System (INIS)

    Schneider-Mizell, Casey M; Zochowski, Michal R; Sander, Leonard M; Parent, Jack M; Ben-Jacob, Eshel

    2010-01-01

    Networks can be dynamical systems that undergo functional and structural reorganization. One example of such a process is adult hippocampal neurogenesis, in which new cells are continuously born and incorporate into the existing network of the dentate gyrus region of the hippocampus. Many of these introduced cells mature and become indistinguishable from established neurons, joining the existing network. Activity in the network environment is known to promote birth, survival and incorporation of new cells. However, after epileptogenic injury, changes to the connectivity structure around the neurogenic niche are known to correlate with aberrant neurogenesis. The possible role of network-level changes in the development of epilepsy is not well understood. In this paper, we use a computational model to investigate how the structural and functional outcomes of network reorganization, driven by addition of new cells during neurogenesis, depend on the original network structure. We find that there is a stable network topology that allows the network to incorporate new neurons in a manner that enhances activity of the persistently active region, but maintains global network properties. In networks having other connectivity structures, new cells can greatly alter the distribution of firing activity and destroy the initial activity patterns. We thus find that new cells are able to provide focused enhancement of network only for small-world networks with sufficient inhibition. Network-level deviations from this topology, such as those caused by epileptogenic injury, can set the network down a path that develops toward pathological dynamics and aberrant structural integration of new cells

  3. Evolutionary features of academic articles co-keyword network and keywords co-occurrence network: Based on two-mode affiliation network

    Science.gov (United States)

    Li, Huajiao; An, Haizhong; Wang, Yue; Huang, Jiachen; Gao, Xiangyun

    2016-05-01

    Keeping abreast of trends in the articles and rapidly grasping a body of article's key points and relationship from a holistic perspective is a new challenge in both literature research and text mining. As the important component, keywords can present the core idea of the academic article. Usually, articles on a single theme or area could share one or some same keywords, and we can analyze topological features and evolution of the articles co-keyword networks and keywords co-occurrence networks to realize the in-depth analysis of the articles. This paper seeks to integrate statistics, text mining, complex networks and visualization to analyze all of the academic articles on one given theme, complex network(s). All 5944 ;complex networks; articles that were published between 1990 and 2013 and are available on the Web of Science are extracted. Based on the two-mode affiliation network theory, a new frontier of complex networks, we constructed two different networks, one taking the articles as nodes, the co-keyword relationships as edges and the quantity of co-keywords as the weight to construct articles co-keyword network, and another taking the articles' keywords as nodes, the co-occurrence relationships as edges and the quantity of simultaneous co-occurrences as the weight to construct keyword co-occurrence network. An integrated method for analyzing the topological features and evolution of the articles co-keyword network and keywords co-occurrence networks is proposed, and we also defined a new function to measure the innovation coefficient of the articles in annual level. This paper provides a useful tool and process for successfully achieving in-depth analysis and rapid understanding of the trends and relationships of articles in a holistic perspective.

  4. Disrupted topological organization of structural networks revealed by probabilistic diffusion tractography in Tourette syndrome children.

    Science.gov (United States)

    Wen, Hongwei; Liu, Yue; Rekik, Islem; Wang, Shengpei; Zhang, Jishui; Zhang, Yue; Peng, Yun; He, Huiguang

    2017-08-01

    Tourette syndrome (TS) is a childhood-onset neurobehavioral disorder. Although previous TS studies revealed structural abnormalities in distinct corticobasal ganglia circuits, the topological alterations of the whole-brain white matter (WM) structural networks remain poorly understood. Here, we used diffusion MRI probabilistic tractography and graph theoretical analysis to investigate the topological organization of WM networks in 44 drug-naive TS children and 41 age- and gender-matched healthy children. The WM networks were constructed by estimating inter-regional connectivity probability and the topological properties were characterized using graph theory. We found that both TS and control groups showed an efficient small-world organization in WM networks. However, compared to controls, TS children exhibited decreased global and local efficiency, increased shortest path length and small worldness, indicating a disrupted balance between local specialization and global integration in structural networks. Although both TS and control groups showed highly similar hub distributions, TS children exhibited significant decreased nodal efficiency, mainly distributed in the default mode, language, visual, and sensorimotor systems. Furthermore, two separate networks showing significantly decreased connectivity in TS group were identified using network-based statistical (NBS) analysis, primarily composed of the parieto-occipital cortex, precuneus, and paracentral lobule. Importantly, we combined support vector machine and multiple kernel learning frameworks to fuse multiple levels of network topological features for classification of individuals, achieving high accuracy of 86.47%. Together, our study revealed the disrupted topological organization of structural networks related to pathophysiology of TS, and the discriminative topological features for classification are potential quantitative neuroimaging biomarkers for clinical TS diagnosis. Hum Brain Mapp 38:3988-4008, 2017

  5. MUFOLD-SS: New deep inception-inside-inception networks for protein secondary structure prediction.

    Science.gov (United States)

    Fang, Chao; Shang, Yi; Xu, Dong

    2018-05-01

    Protein secondary structure prediction can provide important information for protein 3D structure prediction and protein functions. Deep learning offers a new opportunity to significantly improve prediction accuracy. In this article, a new deep neural network architecture, named the Deep inception-inside-inception (Deep3I) network, is proposed for protein secondary structure prediction and implemented as a software tool MUFOLD-SS. The input to MUFOLD-SS is a carefully designed feature matrix corresponding to the primary amino acid sequence of a protein, which consists of a rich set of information derived from individual amino acid, as well as the context of the protein sequence. Specifically, the feature matrix is a composition of physio-chemical properties of amino acids, PSI-BLAST profile, and HHBlits profile. MUFOLD-SS is composed of a sequence of nested inception modules and maps the input matrix to either eight states or three states of secondary structures. The architecture of MUFOLD-SS enables effective processing of local and global interactions between amino acids in making accurate prediction. In extensive experiments on multiple datasets, MUFOLD-SS outperformed the best existing methods and other deep neural networks significantly. MUFold-SS can be downloaded from http://dslsrv8.cs.missouri.edu/~cf797/MUFoldSS/download.html. © 2018 Wiley Periodicals, Inc.

  6. The Energy Coding of a Structural Neural Network Based on the Hodgkin-Huxley Model.

    Science.gov (United States)

    Zhu, Zhenyu; Wang, Rubin; Zhu, Fengyun

    2018-01-01

    Based on the Hodgkin-Huxley model, the present study established a fully connected structural neural network to simulate the neural activity and energy consumption of the network by neural energy coding theory. The numerical simulation result showed that the periodicity of the network energy distribution was positively correlated to the number of neurons and coupling strength, but negatively correlated to signal transmitting delay. Moreover, a relationship was established between the energy distribution feature and the synchronous oscillation of the neural network, which showed that when the proportion of negative energy in power consumption curve was high, the synchronous oscillation of the neural network was apparent. In addition, comparison with the simulation result of structural neural network based on the Wang-Zhang biophysical model of neurons showed that both models were essentially consistent.

  7. Paradoxes of Social Networking in a Structured Web 2.0 Language Learning Community

    Science.gov (United States)

    Loiseau, Mathieu; Zourou, Katerina

    2012-01-01

    This paper critically inquires into social networking as a set of mechanisms and associated practices developed in a structured Web 2.0 language learning community. This type of community can be roughly described as learning spaces featuring (more or less) structured language learning resources displaying at least some notions of language learning…

  8. Discrete particle swarm optimization for identifying community structures in signed social networks.

    Science.gov (United States)

    Cai, Qing; Gong, Maoguo; Shen, Bo; Ma, Lijia; Jiao, Licheng

    2014-10-01

    Modern science of networks has facilitated us with enormous convenience to the understanding of complex systems. Community structure is believed to be one of the notable features of complex networks representing real complicated systems. Very often, uncovering community structures in networks can be regarded as an optimization problem, thus, many evolutionary algorithms based approaches have been put forward. Particle swarm optimization (PSO) is an artificial intelligent algorithm originated from social behavior such as birds flocking and fish schooling. PSO has been proved to be an effective optimization technique. However, PSO was originally designed for continuous optimization which confounds its applications to discrete contexts. In this paper, a novel discrete PSO algorithm is suggested for identifying community structures in signed networks. In the suggested method, particles' status has been redesigned in discrete form so as to make PSO proper for discrete scenarios, and particles' updating rules have been reformulated by making use of the topology of the signed network. Extensive experiments compared with three state-of-the-art approaches on both synthetic and real-world signed networks demonstrate that the proposed method is effective and promising. Copyright © 2014 Elsevier Ltd. All rights reserved.

  9. An examination of a reciprocal relationship between network governance and network structure

    DEFF Research Database (Denmark)

    Bergenholtz, Carsten; Goduscheit, René Chester

    The present article examines the network structure and governance of inter-organisational innovation networks. Network governance refers to the issue of how to manage and coordinate the relational activities and processes in the network while research on network structure deals with the overall...... structural relations between the actors in the network. These streams of research do contain references to each other but mostly rely on a static conception of the relationship between network structure and the applied network governance. The paper is based on a primarily qualitative case study of a loosely...... coupled Danish inter-organisational innovation network. The proposition is that a reciprocal relation between network governance and network structure can be identified....

  10. Automatic target recognition using a feature-based optical neural network

    Science.gov (United States)

    Chao, Tien-Hsin

    1992-01-01

    An optical neural network based upon the Neocognitron paradigm (K. Fukushima et al. 1983) is introduced. A novel aspect of the architectural design is shift-invariant multichannel Fourier optical correlation within each processing layer. Multilayer processing is achieved by iteratively feeding back the output of the feature correlator to the input spatial light modulator and updating the Fourier filters. By training the neural net with characteristic features extracted from the target images, successful pattern recognition with intra-class fault tolerance and inter-class discrimination is achieved. A detailed system description is provided. Experimental demonstration of a two-layer neural network for space objects discrimination is also presented.

  11. Patch layout generation by detecting feature networks

    KAUST Repository

    Cao, Yuanhao

    2015-02-01

    The patch layout of 3D surfaces reveals the high-level geometric and topological structures. In this paper, we study the patch layout computation by detecting and enclosing feature loops on surfaces. We present a hybrid framework which combines several key ingredients, including feature detection, feature filtering, feature curve extension, patch subdivision and boundary smoothing. Our framework is able to compute patch layouts through concave features as previous approaches, but also able to generate nice layouts through smoothing regions. We demonstrate the effectiveness of our framework by comparing with the state-of-the-art methods.

  12. Rapidly exploring structural and dynamic properties of signaling networks using PathwayOracle

    Directory of Open Access Journals (Sweden)

    Ram Prahlad T

    2008-08-01

    Full Text Available Abstract Background In systems biology the experimentalist is presented with a selection of software for analyzing dynamic properties of signaling networks. These tools either assume that the network is in steady-state or require highly parameterized models of the network of interest. For biologists interested in assessing how signal propagates through a network under specific conditions, the first class of methods does not provide sufficiently detailed results and the second class requires models which may not be easily and accurately constructed. A tool that is able to characterize the dynamics of a signaling network using an unparameterized model of the network would allow biologists to quickly obtain insights into a signaling network's behavior. Results We introduce PathwayOracle, an integrated suite of software tools for computationally inferring and analyzing structural and dynamic properties of a signaling network. The feature which differentiates PathwayOracle from other tools is a method that can predict the response of a signaling network to various experimental conditions and stimuli using only the connectivity of the signaling network. Thus signaling models are relatively easy to build. The method allows for tracking signal flow in a network and comparison of signal flows under different experimental conditions. In addition, PathwayOracle includes tools for the enumeration and visualization of coherent and incoherent signaling paths between proteins, and for experimental analysis – loading and superimposing experimental data, such as microarray intensities, on the network model. Conclusion PathwayOracle provides an integrated environment in which both structural and dynamic analysis of a signaling network can be quickly conducted and visualized along side experimental results. By using the signaling network connectivity, analyses and predictions can be performed quickly using relatively easily constructed signaling network models

  13. Inferring the interplay between network structure and market effects in Bitcoin

    International Nuclear Information System (INIS)

    Kondor, Dániel; Csabai, István; Szüle, János; Pósfai, Márton; Vattay, Gábor

    2014-01-01

    A main focus in economics research is understanding the time series of prices of goods and assets. While statistical models using only the properties of the time series itself have been successful in many aspects, we expect to gain a better understanding of the phenomena involved if we can model the underlying system of interacting agents. In this article, we consider the history of Bitcoin, a novel digital currency system, for which the complete list of transactions is available for analysis. Using this dataset, we reconstruct the transaction network between users and analyze changes in the structure of the subgraph induced by the most active users. Our approach is based on the unsupervised identification of important features of the time variation of the network. Applying the widely used method of Principal Component Analysis to the matrix constructed from snapshots of the network at different times, we are able to show how structural changes in the network accompany significant changes in the exchange price of bitcoins. (paper)

  14. Inferring the interplay between network structure and market effects in Bitcoin

    Science.gov (United States)

    Kondor, Dániel; Csabai, István; Szüle, János; Pósfai, Márton; Vattay, Gábor

    2014-12-01

    A main focus in economics research is understanding the time series of prices of goods and assets. While statistical models using only the properties of the time series itself have been successful in many aspects, we expect to gain a better understanding of the phenomena involved if we can model the underlying system of interacting agents. In this article, we consider the history of Bitcoin, a novel digital currency system, for which the complete list of transactions is available for analysis. Using this dataset, we reconstruct the transaction network between users and analyze changes in the structure of the subgraph induced by the most active users. Our approach is based on the unsupervised identification of important features of the time variation of the network. Applying the widely used method of Principal Component Analysis to the matrix constructed from snapshots of the network at different times, we are able to show how structural changes in the network accompany significant changes in the exchange price of bitcoins.

  15. Image Classification Using Biomimetic Pattern Recognition with Convolutional Neural Networks Features

    Science.gov (United States)

    Huo, Guanying

    2017-01-01

    As a typical deep-learning model, Convolutional Neural Networks (CNNs) can be exploited to automatically extract features from images using the hierarchical structure inspired by mammalian visual system. For image classification tasks, traditional CNN models employ the softmax function for classification. However, owing to the limited capacity of the softmax function, there are some shortcomings of traditional CNN models in image classification. To deal with this problem, a new method combining Biomimetic Pattern Recognition (BPR) with CNNs is proposed for image classification. BPR performs class recognition by a union of geometrical cover sets in a high-dimensional feature space and therefore can overcome some disadvantages of traditional pattern recognition. The proposed method is evaluated on three famous image classification benchmarks, that is, MNIST, AR, and CIFAR-10. The classification accuracies of the proposed method for the three datasets are 99.01%, 98.40%, and 87.11%, respectively, which are much higher in comparison with the other four methods in most cases. PMID:28316614

  16. Network structure exploration via Bayesian nonparametric models

    International Nuclear Information System (INIS)

    Chen, Y; Wang, X L; Xiang, X; Tang, B Z; Bu, J Z

    2015-01-01

    Complex networks provide a powerful mathematical representation of complex systems in nature and society. To understand complex networks, it is crucial to explore their internal structures, also called structural regularities. The task of network structure exploration is to determine how many groups there are in a complex network and how to group the nodes of the network. Most existing structure exploration methods need to specify either a group number or a certain type of structure when they are applied to a network. In the real world, however, the group number and also the certain type of structure that a network has are usually unknown in advance. To explore structural regularities in complex networks automatically, without any prior knowledge of the group number or the certain type of structure, we extend a probabilistic mixture model that can handle networks with any type of structure but needs to specify a group number using Bayesian nonparametric theory. We also propose a novel Bayesian nonparametric model, called the Bayesian nonparametric mixture (BNPM) model. Experiments conducted on a large number of networks with different structures show that the BNPM model is able to explore structural regularities in networks automatically with a stable, state-of-the-art performance. (paper)

  17. GalaxyGAN: Generative Adversarial Networks for recovery of galaxy features

    Science.gov (United States)

    Schawinski, Kevin; Zhang, Ce; Zhang, Hantian; Fowler, Lucas; Krishnan Santhanam, Gokula

    2017-02-01

    GalaxyGAN uses Generative Adversarial Networks to reliably recover features in images of galaxies. The package uses machine learning to train on higher quality data and learns to recover detailed features such as galaxy morphology by effectively building priors. This method opens up the possibility of recovering more information from existing and future imaging data.

  18. Structural and functional properties of a probabilistic model of neuronal connectivity in a simple locomotor network

    Science.gov (United States)

    Merrison-Hort, Robert; Soffe, Stephen R; Borisyuk, Roman

    2018-01-01

    Although, in most animals, brain connectivity varies between individuals, behaviour is often similar across a species. What fundamental structural properties are shared across individual networks that define this behaviour? We describe a probabilistic model of connectivity in the hatchling Xenopus tadpole spinal cord which, when combined with a spiking model, reliably produces rhythmic activity corresponding to swimming. The probabilistic model allows calculation of structural characteristics that reflect common network properties, independent of individual network realisations. We use the structural characteristics to study examples of neuronal dynamics, in the complete network and various sub-networks, and this allows us to explain the basis for key experimental findings, and make predictions for experiments. We also study how structural and functional features differ between detailed anatomical connectomes and those generated by our new, simpler, model (meta-model). PMID:29589828

  19. Networks: structure and action : steering in and steering by policy networks

    NARCIS (Netherlands)

    Dassen, A.

    2010-01-01

    This thesis explores the opportunities to build a structural policy network model that is rooted in social network theories. By making a distinction between a process of steering in networks, and a process of steering by networks, it addresses the effects of network structures on network dynamics as

  20. Feature to prototype transition in neural networks

    Science.gov (United States)

    Krotov, Dmitry; Hopfield, John

    Models of associative memory with higher order (higher than quadratic) interactions, and their relationship to neural networks used in deep learning are discussed. Associative memory is conventionally described by recurrent neural networks with dynamical convergence to stable points. Deep learning typically uses feedforward neural nets without dynamics. However, a simple duality relates these two different views when applied to problems of pattern classification. From the perspective of associative memory such models deserve attention because they make it possible to store a much larger number of memories, compared to the quadratic case. In the dual description, these models correspond to feedforward neural networks with one hidden layer and unusual activation functions transmitting the activities of the visible neurons to the hidden layer. These activation functions are rectified polynomials of a higher degree rather than the rectified linear functions used in deep learning. The network learns representations of the data in terms of features for rectified linear functions, but as the power in the activation function is increased there is a gradual shift to a prototype-based representation, the two extreme regimes of pattern recognition known in cognitive psychology. Simons Center for Systems Biology.

  1. Features of complex networks in a free-software operating system

    International Nuclear Information System (INIS)

    Nair, Rajiv; Nagarjuna, G; Ray, Arnab K

    2012-01-01

    We propose a mathematical model to fit the degree distribution of directed dependency networks in free and open-source software. In this complex system, the intermediate scales of both the in-directed and out-directed dependency networks follow a power-law trend (specifically Zipf's law). Deviations from this feature are found both for the highly linked nodes, and the poorly linked nodes. This is due to finite-size effects in the networks, and the parameters needed to model finite-size behaviour make a quantitative distinction between the in-directed and out-directed networks. We also provide a model to describe the dynamic evolution of the network, and account for its saturation in the long-time limit.

  2. How does network structure affect partnerships for promoting physical activity? Evidence from Brazil and Colombia.

    Science.gov (United States)

    Parra, Diana C; Dauti, Marsela; Harris, Jenine K; Reyes, Lissette; Malta, Deborah C; Brownson, Ross C; Quintero, Mario A; Pratt, Michael

    2011-11-01

    The objective of this study was to describe the network structure and factors associated with collaboration in two networks that promote physical activity (PA) in Brazil and Colombia. Organizations that focus on studying and promoting PA in Brazil (35) and Colombia (53) were identified using a modified one-step reputational snowball sampling process. Participants completed an on-line survey between December 2008 and March 2009 for the Brazil network, and between April and June 2009 for the Colombia network. Network stochastic modeling was used to investigate the likelihood of reported inter-organizational collaboration. While structural features of networks were significant predictors of collaboration within each network, the coefficients and other network characteristics differed. Brazil's PA network was decentralized with a larger number of shared partnerships. Colombia's PA network was centralized and collaboration was influenced by perceived importance of peer organizations. On average, organizations in the PA network of Colombia reported facing more barriers (1.5 vs. 2.5 barriers) for collaboration. Future studies should focus on how these different network structures affect the implementation and uptake of evidence-based PA interventions. Copyright © 2011 Elsevier Ltd. All rights reserved.

  3. Exploiting The Brain’s Network Structure in Identifying ADHD

    Directory of Open Access Journals (Sweden)

    Soumyabrata eDey

    2012-11-01

    Full Text Available Attention Deficit Hyperactive Disorder (ADHD is a common behavioral problem affecting children. In this work, we investigate the automatic classification of ADHD subjects using the resting state Functional Magnetic Resonance Imaging (fMRI sequences of the brain. We show that brain can be modeled as a functional network, and certain properties of the networks differ in ADHD subjects from control subjects. We compute the pairwise correlation of brain voxels' activity over the time frame of the experimental protocol which helps to model the function of a brain as a network. Different network features are computed for each of the voxels constructing the network. The concatenation of the network features of all the voxels in a brain serves as the feature vector. Feature vectors from a set of subjects are then used to train a PCA-LDA (principal component analysis-linear discriminant analysis based classifier. We hypothesized that ADHD related differences lie in some specific regions of brain and using features only from those regions are sufficient to discriminate ADHD and control subjects. We propose a method to create a brain mask which includes the useful regions only and demonstrate that using the feature from the masked regions improves classification accuracy on the test data set. We train our classifier with 776 subjects, and test on 171 subjects provided by The Neuro Bureau for the ADHD-200 challenge. We demonstrate the utility of graph-motif features, specifically the maps that represent the frequency of participation of voxels in network cycles of length 3. The best classification performance (69.59% is achieved using 3-cycle map features with masking. Our proposed approach holds promise in being able to diagnose and understand the disorder.

  4. Detecting Hierarchical Structure in Networks

    DEFF Research Database (Denmark)

    Herlau, Tue; Mørup, Morten; Schmidt, Mikkel Nørgaard

    2012-01-01

    Many real-world networks exhibit hierarchical organization. Previous models of hierarchies within relational data has focused on binary trees; however, for many networks it is unknown whether there is hierarchical structure, and if there is, a binary tree might not account well for it. We propose...... a generative Bayesian model that is able to infer whether hierarchies are present or not from a hypothesis space encompassing all types of hierarchical tree structures. For efficient inference we propose a collapsed Gibbs sampling procedure that jointly infers a partition and its hierarchical structure....... On synthetic and real data we demonstrate that our model can detect hierarchical structure leading to better link-prediction than competing models. Our model can be used to detect if a network exhibits hierarchical structure, thereby leading to a better comprehension and statistical account the network....

  5. European networks in structural integrity

    International Nuclear Information System (INIS)

    Crutzen, S.; Davies, M.; Hemsworth, B.; Hurst, R.; Kussmaul, K.

    1994-01-01

    Several institutions and electrical utilities in Europe, including the Joint Research Centre (JRC) have the capability to deal problems posed by the operation and ageing of structural components and with their structural integrity assessment. These institutions and the JRC have developed cooperative programmes now organised in networks. They include utilities, engineering companies, R and D laboratories and Regulatory Bodies. Networks are organised and managed like the successful PISC programme: The Institute for Advanced Materials of JRC plays the role of Operating Agent and Manager of these networks: ENIQ, AMES, NESC, each of them dealing with a specific aspect of fitness for purpose of materials in structural components. There exist strong links between the networks and EC Working Groups on Structural Integrity Codes and Standards. (orig.)

  6. Composition and structure of a large online social network in The Netherlands.

    Directory of Open Access Journals (Sweden)

    Rense Corten

    Full Text Available Limitations in data collection have long been an obstacle in research on friendship networks. Most earlier studies use either a sample of ego-networks, or complete network data on a relatively small group (e.g., a single organization. The rise of online social networking services such as Friendster and Facebook, however, provides researchers with opportunities to study friendship networks on a much larger scale. This study uses complete network data from Hyves, a popular online social networking service in The Netherlands, comprising over eight million members and over 400 million online friendship relations. In the first study of its kind for The Netherlands, I examine the structure of this network in terms of the degree distribution, characteristic path length, clustering, and degree assortativity. Results indicate that this network shares features of other large complex networks, but also deviates in other respects. In addition, a comparison with other online social networks shows that these networks show remarkable similarities.

  7. Composition and structure of a large online social network in The Netherlands.

    Science.gov (United States)

    Corten, Rense

    2012-01-01

    Limitations in data collection have long been an obstacle in research on friendship networks. Most earlier studies use either a sample of ego-networks, or complete network data on a relatively small group (e.g., a single organization). The rise of online social networking services such as Friendster and Facebook, however, provides researchers with opportunities to study friendship networks on a much larger scale. This study uses complete network data from Hyves, a popular online social networking service in The Netherlands, comprising over eight million members and over 400 million online friendship relations. In the first study of its kind for The Netherlands, I examine the structure of this network in terms of the degree distribution, characteristic path length, clustering, and degree assortativity. Results indicate that this network shares features of other large complex networks, but also deviates in other respects. In addition, a comparison with other online social networks shows that these networks show remarkable similarities.

  8. Collective network for computer structures

    Science.gov (United States)

    Blumrich, Matthias A [Ridgefield, CT; Coteus, Paul W [Yorktown Heights, NY; Chen, Dong [Croton On Hudson, NY; Gara, Alan [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Hoenicke, Dirk [Ossining, NY; Takken, Todd E [Brewster, NY; Steinmacher-Burow, Burkhard D [Wernau, DE; Vranas, Pavlos M [Bedford Hills, NY

    2011-08-16

    A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices ate included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network and class structures. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to needs of a processing algorithm.

  9. Network structure and institutional complexity in an ecology of water management games

    Directory of Open Access Journals (Sweden)

    Mark Lubell

    2014-12-01

    Full Text Available Social-ecological systems are governed by a complex of ecology of games featuring multiple actors, policy institutions, and issues, and not just single institutions operating in isolation. We update Long's (1958 ecology of games to analyze the coordinating roles of actors and institutions in the context of the ecology of water management games in San Francisco Bay, California. The ecology of games is operationalized as a bipartite network with actors participating in institutions, and exponential random graph models are used to test hypotheses about the structural features of the network. We found that policy coordination is facilitated mostly by federal and state agencies and collaborative institutions that span geographic boundaries. Network configurations associated with closure show the most significant departures from the predicted model values, consistent with the Berardo and Scholz (2010 "risk hypothesis" that closure is important for solving cooperation problems.

  10. Cross-linked structure of network evolution

    International Nuclear Information System (INIS)

    Bassett, Danielle S.; Wymbs, Nicholas F.; Grafton, Scott T.; Porter, Mason A.; Mucha, Peter J.

    2014-01-01

    We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In the human brain, networks that represent temporal changes in brain activity during learning exhibit early co-evolution that then settles down with practice. Subsequent decreases in hyperedge size are consistent with emergence of an autonomous subgraph whose dynamics no longer depends on other parts of the network. Our results on real and synthetic networks give a poignant demonstration of the ability of cross-link structure to uncover unexpected co-evolution attributes in both real and synthetic dynamical systems. This, in turn, illustrates the utility of analyzing cross-links for investigating the structure of temporal networks

  11. Cross-linked structure of network evolution

    Energy Technology Data Exchange (ETDEWEB)

    Bassett, Danielle S., E-mail: dsb@seas.upenn.edu [Department of Bioengineering, University of Pennsylvania, Philadelphia, Pennsylvania 19104 (United States); Department of Physics, University of California, Santa Barbara, California 93106 (United States); Sage Center for the Study of the Mind, University of California, Santa Barbara, California 93106 (United States); Wymbs, Nicholas F.; Grafton, Scott T. [Department of Psychology and UCSB Brain Imaging Center, University of California, Santa Barbara, California 93106 (United States); Porter, Mason A. [Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, Oxford OX2 6GG (United Kingdom); CABDyN Complexity Centre, University of Oxford, Oxford, OX1 1HP (United Kingdom); Mucha, Peter J. [Carolina Center for Interdisciplinary Applied Mathematics, Department of Mathematics, University of North Carolina, Chapel Hill, North Carolina 27599 (United States); Department of Applied Physical Sciences, University of North Carolina, Chapel Hill, North Carolina 27599 (United States)

    2014-03-15

    We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In the human brain, networks that represent temporal changes in brain activity during learning exhibit early co-evolution that then settles down with practice. Subsequent decreases in hyperedge size are consistent with emergence of an autonomous subgraph whose dynamics no longer depends on other parts of the network. Our results on real and synthetic networks give a poignant demonstration of the ability of cross-link structure to uncover unexpected co-evolution attributes in both real and synthetic dynamical systems. This, in turn, illustrates the utility of analyzing cross-links for investigating the structure of temporal networks.

  12. Feature selection for Bayesian network classifiers using the MDL-FS score

    NARCIS (Netherlands)

    Drugan, Madalina M.; Wiering, Marco A.

    When constructing a Bayesian network classifier from data, the more or less redundant features included in a dataset may bias the classifier and as a consequence may result in a relatively poor classification accuracy. In this paper, we study the problem of selecting appropriate subsets of features

  13. Topological Embedding Feature Based Resource Allocation in Network Virtualization

    Directory of Open Access Journals (Sweden)

    Hongyan Cui

    2014-01-01

    Full Text Available Virtualization provides a powerful way to run multiple virtual networks on a shared substrate network, which needs accurate and efficient mathematical models. Virtual network embedding is a challenge in network virtualization. In this paper, considering the degree of convergence when mapping a virtual network onto substrate network, we propose a new embedding algorithm based on topology mapping convergence-degree. Convergence-degree means the adjacent degree of virtual network’s nodes when they are mapped onto a substrate network. The contributions of our method are as below. Firstly, we map virtual nodes onto the substrate nodes with the maximum convergence-degree. The simulation results show that our proposed algorithm largely enhances the network utilization efficiency and decreases the complexity of the embedding problem. Secondly, we define the load balance rate to reflect the load balance of substrate links. The simulation results show our proposed algorithm achieves better load balance. Finally, based on the feature of star topology, we further improve our embedding algorithm and make it suitable for application in the star topology. The test result shows it gets better performance than previous works.

  14. Effects of bursting dynamic features on the generation of multi-clustered structure of neural network with symmetric spike-timing-dependent plasticity learning rule

    International Nuclear Information System (INIS)

    Liu, Hui; Song, Yongduan; Xue, Fangzheng; Li, Xiumin

    2015-01-01

    In this paper, the generation of multi-clustered structure of self-organized neural network with different neuronal firing patterns, i.e., bursting or spiking, has been investigated. The initially all-to-all-connected spiking neural network or bursting neural network can be self-organized into clustered structure through the symmetric spike-timing-dependent plasticity learning for both bursting and spiking neurons. However, the time consumption of this clustering procedure of the burst-based self-organized neural network (BSON) is much shorter than the spike-based self-organized neural network (SSON). Our results show that the BSON network has more obvious small-world properties, i.e., higher clustering coefficient and smaller shortest path length than the SSON network. Also, the results of larger structure entropy and activity entropy of the BSON network demonstrate that this network has higher topological complexity and dynamical diversity, which benefits for enhancing information transmission of neural circuits. Hence, we conclude that the burst firing can significantly enhance the efficiency of clustering procedure and the emergent clustered structure renders the whole network more synchronous and therefore more sensitive to weak input. This result is further confirmed from its improved performance on stochastic resonance. Therefore, we believe that the multi-clustered neural network which self-organized from the bursting dynamics has high efficiency in information processing

  15. Effects of bursting dynamic features on the generation of multi-clustered structure of neural network with symmetric spike-timing-dependent plasticity learning rule

    Energy Technology Data Exchange (ETDEWEB)

    Liu, Hui; Song, Yongduan; Xue, Fangzheng; Li, Xiumin, E-mail: xmli@cqu.edu.cn [Key Laboratory of Dependable Service Computing in Cyber Physical Society of Ministry of Education, Chongqing University, Chongqing 400044 (China); College of Automation, Chongqing University, Chongqing 400044 (China)

    2015-11-15

    In this paper, the generation of multi-clustered structure of self-organized neural network with different neuronal firing patterns, i.e., bursting or spiking, has been investigated. The initially all-to-all-connected spiking neural network or bursting neural network can be self-organized into clustered structure through the symmetric spike-timing-dependent plasticity learning for both bursting and spiking neurons. However, the time consumption of this clustering procedure of the burst-based self-organized neural network (BSON) is much shorter than the spike-based self-organized neural network (SSON). Our results show that the BSON network has more obvious small-world properties, i.e., higher clustering coefficient and smaller shortest path length than the SSON network. Also, the results of larger structure entropy and activity entropy of the BSON network demonstrate that this network has higher topological complexity and dynamical diversity, which benefits for enhancing information transmission of neural circuits. Hence, we conclude that the burst firing can significantly enhance the efficiency of clustering procedure and the emergent clustered structure renders the whole network more synchronous and therefore more sensitive to weak input. This result is further confirmed from its improved performance on stochastic resonance. Therefore, we believe that the multi-clustered neural network which self-organized from the bursting dynamics has high efficiency in information processing.

  16. An input feature selection method applied to fuzzy neural networks for signal esitmation

    International Nuclear Information System (INIS)

    Na, Man Gyun; Sim, Young Rok

    2001-01-01

    It is well known that the performance of a fuzzy neural networks strongly depends on the input features selected for its training. In its applications to sensor signal estimation, there are a large number of input variables related with an output. As the number of input variables increases, the training time of fuzzy neural networks required increases exponentially. Thus, it is essential to reduce the number of inputs to a fuzzy neural networks and to select the optimum number of mutually independent inputs that are able to clearly define the input-output mapping. In this work, principal component analysis (PAC), genetic algorithms (GA) and probability theory are combined to select new important input features. A proposed feature selection method is applied to the signal estimation of the steam generator water level, the hot-leg flowrate, the pressurizer water level and the pressurizer pressure sensors in pressurized water reactors and compared with other input feature selection methods

  17. 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.

  18. Combining morphometric features and convolutional networks fusion for glaucoma diagnosis

    Science.gov (United States)

    Perdomo, Oscar; Arevalo, John; González, Fabio A.

    2017-11-01

    Glaucoma is an eye condition that leads to loss of vision and blindness. Ophthalmoscopy exam evaluates the shape, color and proportion between the optic disc and physiologic cup, but the lack of agreement among experts is still the main diagnosis problem. The application of deep convolutional neural networks combined with automatic extraction of features such as: the cup-to-disc distance in the four quadrants, the perimeter, area, eccentricity, the major radio, the minor radio in optic disc and cup, in addition to all the ratios among the previous parameters may help with a better automatic grading of glaucoma. This paper presents a strategy to merge morphological features and deep convolutional neural networks as a novel methodology to support the glaucoma diagnosis in eye fundus images.

  19. True Nature of Supply Network Communication Structure

    Directory of Open Access Journals (Sweden)

    Lokhman Hakim bin Osman

    2016-04-01

    Full Text Available Globalization of world economy has altered the definition of organizational structure. Global supply chain can no longer be viewed as an arm-length structure. It has become more complex. The complexity demands deeper research and understanding. This research analyzed a structure of supply network in an attempt to elucidate the true structure of the supply network. Using the quantitative Social Network Analysis methodology, findings of this study indicated that, the structure of the supply network differs depending on the types of network relations. An important implication of these findings would be a more focus resource management upon network relationship development that is based on firms’ positions in the different network structure. This research also contributes to the various strategies of effective and efficient supply chain management.

  20. Airline network structure in competitive market

    Directory of Open Access Journals (Sweden)

    Babić Danica D.

    2014-01-01

    Full Text Available Airline's network is the key element of its business strategy and selected network structure will not have influence only on the airline's costs but could gain some advantage in revenues, too. Network designing implies that an airline has to make decisions about markets that it will serve and how to serve those markets. Network choice raises the following questions for an airline: a what markets to serve, b how to serve selected markets, c what level of service to offer, d what are the benefits/cost of the that decisions and e what is the influence of the competition. We analyzed the existing airline business models and corresponding network structure. The paper highlights the relationship between the network structures and the airline business strategies. Using a simple model we examine the relationship between the network structure and service quality in deregulated market.

  1. 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.

  2. 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.

  3. On a digital wireless impact-monitoring network for large-scale composite structures

    International Nuclear Information System (INIS)

    Yuan, Shenfang; Mei, Hanfei; Qiu, Lei; Ren, Yuanqiang

    2014-01-01

    Impact, which may occur during manufacture, service or maintenance, is one of the major concerns to be monitored throughout the lifetime of aircraft composite structures. Aiming at monitoring impacts online while minimizing the weight added to the aircraft to meet the strict limitations of aerospace engineering, this paper puts forward a new digital wireless network based on miniaturized wireless digital impact-monitoring nodes developed for large-scale composite structures. In addition to investigations on the design methods of the network architecture, time synchronization and implementation method, a conflict resolution method based on the feature parameters of digital sequences is first presented to address impact localization conflicts when several nodes are arranged close together. To verify the feasibility and stability of the wireless network, experiments are performed on a complex aircraft composite wing box and an unmanned aerial vehicle (UAV) composite wing. Experimental results show the successful design of the presented network. (paper)

  4. Short-Term Solar Irradiance Forecasting Model Based on Artificial Neural Network Using Statistical Feature Parameters

    Directory of Open Access Journals (Sweden)

    Hongshan Zhao

    2012-05-01

    Full Text Available Short-term solar irradiance forecasting (STSIF is of great significance for the optimal operation and power predication of grid-connected photovoltaic (PV plants. However, STSIF is very complex to handle due to the random and nonlinear characteristics of solar irradiance under changeable weather conditions. Artificial Neural Network (ANN is suitable for STSIF modeling and many research works on this topic are presented, but the conciseness and robustness of the existing models still need to be improved. After discussing the relation between weather variations and irradiance, the characteristics of the statistical feature parameters of irradiance under different weather conditions are figured out. A novel ANN model using statistical feature parameters (ANN-SFP for STSIF is proposed in this paper. The input vector is reconstructed with several statistical feature parameters of irradiance and ambient temperature. Thus sufficient information can be effectively extracted from relatively few inputs and the model complexity is reduced. The model structure is determined by cross-validation (CV, and the Levenberg-Marquardt algorithm (LMA is used for the network training. Simulations are carried out to validate and compare the proposed model with the conventional ANN model using historical data series (ANN-HDS, and the results indicated that the forecast accuracy is obviously improved under variable weather conditions.

  5. Feature selection for anomaly–based network intrusion detection using cluster validity indices

    CSIR Research Space (South Africa)

    Naidoo, Tyrone

    2015-09-01

    Full Text Available data, which is rarely available in operational networks. It uses normalized cluster validity indices as an objective function that is optimized over the search space of candidate feature subsets via a genetic algorithm. Feature sets produced...

  6. Designing Structure-Dependent MPC-Based AGC Schemes Considering Network Topology

    Directory of Open Access Journals (Sweden)

    Young-Sik Jang

    2015-04-01

    Full Text Available This paper presents the important features of structure-dependent model predictive control (MPC-based approaches for automatic generation control (AGC considering network topology. Since power systems have various generators under different topologies, it is necessary to reflect the characteristics of generators in power networks and the control system structures in order to improve the dynamic performance of AGC. Specifically, considering control system structures is very important because not only can the topological problems be reduced, but also a computing system for AGC in a bulk-power system can be realized. Based on these considerations, we propose new schemes in the proposed controller for minimizing inadvertent line flows and computational burden, which strengthen the advantages of MPC-based approach for AGC. Analysis and simulation results in the IEEE 39-bus model system show different dynamic behaviors among structure-dependent control schemes and possible improvements in computational burden via the proposed control scheme while system operators in each balancing area consider physical load reference ramp constraints among generators.

  7. D3.5 Report on ECO social network integration features

    NARCIS (Netherlands)

    Viñuales, Javier; Driesner, Jorge; Tejera, Sara; Tomasini, Alessandra; Loozen, Kjeld; Rocio, Vítor; Bohuschke, Felix; Ternier, Stefaan

    2016-01-01

    This document describes how integrations with social networks are being developed in ECO platforms. With these new features, participants will be able to share results and other contents through Facebook, Twitter, Google plus.

  8. A model of physical factors in the structural adaptation of microvascular networks in normotension and hypertension

    DEFF Research Database (Denmark)

    Jacobsen, Jens Christian Brings; Gustafsson, Finn; Holstein-Rathlou, N.-H.

    2003-01-01

    Adequate function of the microcirculation is vital to any tissue. To maintain an optimal function, microvascular networks must be able to adapt structurally to changes in the physical environment. Here we present a mathematical network model based on vessel wall mechanics. We assume based...... diameter, until equilibrium is restored. The model explains several of the key features observed experimentally in the microcirculation in normotension and hypertension. Most importantly, it suggests a scenario where overall network structure and network hemodynamics depend on adaptation to local...... hemodynamic stimuli in the individual vessel. Simulated results show emanating microvascular networks with properties similar to those observed in vivo. The model points to an altered endothelial function as a key factor in the development of vascular changes characteristic of hypertension....

  9. An examination of a reciprocal relationship between network governance and network structure

    DEFF Research Database (Denmark)

    Bergenholtz, Carsten; Goduscheit, René Chester

    2011-01-01

    In the present article, we examine the network structure and governance of inter-organisational innovation networks over time. Network governance refers to the issue of how to manage and coordinate the relational activities and processes in the network while research on network structure deals...

  10. The Hidden Flow Structure and Metric Space of Network Embedding Algorithms Based on Random Walks.

    Science.gov (United States)

    Gu, Weiwei; Gong, Li; Lou, Xiaodan; Zhang, Jiang

    2017-10-13

    Network embedding which encodes all vertices in a network as a set of numerical vectors in accordance with it's local and global structures, has drawn widespread attention. Network embedding not only learns significant features of a network, such as the clustering and linking prediction but also learns the latent vector representation of the nodes which provides theoretical support for a variety of applications, such as visualization, link prediction, node classification, and recommendation. As the latest progress of the research, several algorithms based on random walks have been devised. Although those algorithms have drawn much attention for their high scores in learning efficiency and accuracy, there is still a lack of theoretical explanation, and the transparency of those algorithms has been doubted. Here, we propose an approach based on the open-flow network model to reveal the underlying flow structure and its hidden metric space of different random walk strategies on networks. We show that the essence of embedding based on random walks is the latent metric structure defined on the open-flow network. This not only deepens our understanding of random- walk-based embedding algorithms but also helps in finding new potential applications in network embedding.

  11. Altered brain structural networks in attention deficit/hyperactivity disorder children revealed by cortical thickness.

    Science.gov (United States)

    Liu, Tian; Chen, Yanni; Li, Chenxi; Li, Youjun; Wang, Jue

    2017-07-04

    This study investigated the cortical thickness and topological features of human brain anatomical networks related to attention deficit/hyperactivity disorder. Data were collected from 40 attention deficit/hyperactivity disorder children and 40 normal control children. Interregional correlation matrices were established by calculating the correlations of cortical thickness between all pairs of cortical regions (68 regions) of the whole brain. Further thresholds were applied to create binary matrices to construct a series of undirected and unweighted graphs, and global, local, and nodal efficiencies were computed as a function of the network cost. These experimental results revealed abnormal cortical thickness and correlations in attention deficit/hyperactivity disorder, and showed that the brain structural networks of attention deficit/hyperactivity disorder subjects had inefficient small-world topological features. Furthermore, their topological properties were altered abnormally. In particular, decreased global efficiency combined with increased local efficiency in attention deficit/hyperactivity disorder children led to a disorder-related shift of the network topological structure toward regular networks. In addition, nodal efficiency, cortical thickness, and correlation analyses revealed that several brain regions were altered in attention deficit/hyperactivity disorder patients. These findings are in accordance with a hypothesis of dysfunctional integration and segregation of the brain in patients with attention deficit/hyperactivity disorder and provide further evidence of brain dysfunction in attention deficit/hyperactivity disorder patients by observing cortical thickness on magnetic resonance imaging.

  12. Road Network Extraction from VHR Satellite Images Using Context Aware Object Feature Integration and Tensor Voting

    Directory of Open Access Journals (Sweden)

    Mehdi Maboudi

    2016-08-01

    Full Text Available Road networks are very important features in geospatial databases. Even though high-resolution optical satellite images have already been acquired for more than a decade, tools for automated extraction of road networks from these images are still rare. One consequence of this is the need for manual interaction which, in turn, is time and cost intensive. In this paper, a multi-stage approach is proposed which integrates structural, spectral, textural, as well as contextual information of objects to extract road networks from very high resolution satellite images. Highlights of the approach are a novel linearity index employed for the discrimination of elongated road segments from other objects and customized tensor voting which is utilized to fill missing parts of the network. Experiments are carried out with different datasets. Comparison of the achieved results with the results of seven state-of-the-art methods demonstrated the efficiency of the proposed approach.

  13. A Feature Selection Method for Large-Scale Network Traffic Classification Based on Spark

    Directory of Open Access Journals (Sweden)

    Yong Wang

    2016-02-01

    Full Text Available Currently, with the rapid increasing of data scales in network traffic classifications, how to select traffic features efficiently is becoming a big challenge. Although a number of traditional feature selection methods using the Hadoop-MapReduce framework have been proposed, the execution time was still unsatisfactory with numeral iterative computations during the processing. To address this issue, an efficient feature selection method for network traffic based on a new parallel computing framework called Spark is proposed in this paper. In our approach, the complete feature set is firstly preprocessed based on Fisher score, and a sequential forward search strategy is employed for subsets. The optimal feature subset is then selected using the continuous iterations of the Spark computing framework. The implementation demonstrates that, on the precondition of keeping the classification accuracy, our method reduces the time cost of modeling and classification, and improves the execution efficiency of feature selection significantly.

  14. Feature Selection of Network Intrusion Data using Genetic Algorithm and Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Iwan Syarif

    2016-12-01

    Full Text Available This paper describes the advantages of using Evolutionary Algorithms (EA for feature selection on network intrusion dataset. Most current Network Intrusion Detection Systems (NIDS are unable to detect intrusions in real time because of high dimensional data produced during daily operation. Extracting knowledge from huge data such as intrusion data requires new approach. The more complex the datasets, the higher computation time and the harder they are to be interpreted and analyzed. This paper investigates the performance of feature selection algoritms in network intrusiona data. We used Genetic Algorithms (GA and Particle Swarm Optimizations (PSO as feature selection algorithms. When applied to network intrusion datasets, both GA and PSO have significantly reduces the number of features. Our experiments show that GA successfully reduces the number of attributes from 41 to 15 while PSO reduces the number of attributes from 41 to 9. Using k Nearest Neighbour (k-NN as a classifier,the GA-reduced dataset which consists of 37% of original attributes, has accuracy improvement from 99.28% to 99.70% and its execution time is also 4.8 faster than the execution time of original dataset. Using the same classifier, PSO-reduced dataset which consists of 22% of original attributes, has the fastest execution time (7.2 times faster than the execution time of original datasets. However, its accuracy is slightly reduced 0.02% from 99.28% to 99.26%. Overall, both GA and PSO are good solution as feature selection techniques because theyhave shown very good performance in reducing the number of features significantly while still maintaining and sometimes improving the classification accuracy as well as reducing the computation time.

  15. Real-time vibration-based structural damage detection using one-dimensional convolutional neural networks

    Science.gov (United States)

    Abdeljaber, Osama; Avci, Onur; Kiranyaz, Serkan; Gabbouj, Moncef; Inman, Daniel J.

    2017-02-01

    Structural health monitoring (SHM) and vibration-based structural damage detection have been a continuous interest for civil, mechanical and aerospace engineers over the decades. Early and meticulous damage detection has always been one of the principal objectives of SHM applications. The performance of a classical damage detection system predominantly depends on the choice of the features and the classifier. While the fixed and hand-crafted features may either be a sub-optimal choice for a particular structure or fail to achieve the same level of performance on another structure, they usually require a large computation power which may hinder their usage for real-time structural damage detection. This paper presents a novel, fast and accurate structural damage detection system using 1D Convolutional Neural Networks (CNNs) that has an inherent adaptive design to fuse both feature extraction and classification blocks into a single and compact learning body. The proposed method performs vibration-based damage detection and localization of the damage in real-time. The advantage of this approach is its ability to extract optimal damage-sensitive features automatically from the raw acceleration signals. Large-scale experiments conducted on a grandstand simulator revealed an outstanding performance and verified the computational efficiency of the proposed real-time damage detection method.

  16. The relations between network-operation and topological-property in a scale-free and small-world network with community structure

    Science.gov (United States)

    Ma, Fei; Yao, Bing

    2017-10-01

    It is always an open, demanding and difficult task for generating available model to simulate dynamical functions and reveal inner principles from complex systems and networks. In this article, due to lots of real-life and artificial networks are built from series of simple and small groups (components), we discuss some interesting and helpful network-operation to generate more realistic network models. In view of community structure (modular topology), we present a class of sparse network models N(t , m) . At the moment, we capture the fact the N(t , 4) has not only scale-free feature, which means that the probability that a randomly selected vertex with degree k decays as a power-law, following P(k) ∼k-γ, where γ is the degree exponent, but also small-world property, which indicates that the typical distance between two uniform randomly chosen vertices grows proportionally to logarithm of the order of N(t , 4) , namely, relatively shorter diameter and lower average path length, simultaneously displays higher clustering coefficient. Next, as a new topological parameter correlating to reliability, synchronization capability and diffusion properties of networks, the number of spanning trees over a network is studied in more detail, an exact analytical solution for the number of spanning trees of the N(t , 4) is obtained. Based on the network-operation, part hub-vertex linking with each other will be helpful for structuring various network models and investigating the rules related with real-life networks.

  17. Optimal neural networks for protein-structure prediction

    International Nuclear Information System (INIS)

    Head-Gordon, T.; Stillinger, F.H.

    1993-01-01

    The successful application of neural-network algorithms for prediction of protein structure is stymied by three problem areas: the sparsity of the database of known protein structures, poorly devised network architectures which make the input-output mapping opaque, and a global optimization problem in the multiple-minima space of the network variables. We present a simplified polypeptide model residing in two dimensions with only two amino-acid types, A and B, which allows the determination of the global energy structure for all possible sequences of pentamer, hexamer, and heptamer lengths. This model simplicity allows us to compile a complete structural database and to devise neural networks that reproduce the tertiary structure of all sequences with absolute accuracy and with the smallest number of network variables. These optimal networks reveal that the three problem areas are convoluted, but that thoughtful network designs can actually deconvolute these detrimental traits to provide network algorithms that genuinely impact on the ability of the network to generalize or learn the desired mappings. Furthermore, the two-dimensional polypeptide model shows sufficient chemical complexity so that transfer of neural-network technology to more realistic three-dimensional proteins is evident

  18. The Influence of Ethnic Diversity on Social Network Structure in a Common-Pool Resource System: Implications for Collaborative Management

    Directory of Open Access Journals (Sweden)

    Michele Barnes-Mauthe

    2013-03-01

    Full Text Available Social networks have recently been identified as key features in facilitating or constraining collaborative arrangements that can enhance resource governance and adaptability in complex social-ecological systems. Nonetheless, the effect of ethnicity on social network structure in an ethnically diverse common-pool resource system is virtually unknown. We characterize the entire social network of Hawaii's longline fishery, an ethnically diverse competitive pelagic fishery, and investigate network homophily, network structure, and cross-scale linkages. Results show that ethnicity significantly influences social network structure and is responsible for a homophily effect, which can create challenges for stakeholder collaboration across groups. Our analysis also suggests that ethnicity influences the formation of diverse network structures, and can affect the level of linkages to outside industry leaders, government or management officials, and members of the scientific community. This study provides the first empirical examination of the impact of ethnic diversity on resource user's social networks in the common-pool resource literature, having important implications for collaborative resource management.

  19. Epidemic spreading on dual-structure networks with mobile agents

    Science.gov (United States)

    Yao, Yiyang; Zhou, Yinzuo

    2017-02-01

    The rapid development of modern society continually transforms the social structure which leads to an increasingly distinct dual structure of higher population density in urban areas and lower density in rural areas. Such structure may induce distinctive spreading behavior of epidemics which does not happen in a single type structure. In this paper, we study the epidemic spreading of mobile agents on dual structure networks based on SIRS model. First, beyond the well known epidemic threshold for generic epidemic model that when the infection rate is below the threshold a pertinent infectious disease will die out, we find the other epidemic threshold which appears when the infection rate of a disease is relatively high. This feature of two thresholds for the SIRS model may lead to the elimination of infectious disease when social network has either high population density or low population density. Interestingly, however, we find that when a high density area is connected to a low density may cause persistent spreading of the infectious disease, even though the same disease will die out when it spreads in each single area. This phenomenon indicates the critical role of the connection between the two areas which could radically change the behavior of spreading dynamics. Our findings, therefore, provide new understanding of epidemiology pertinent to the characteristic modern social structure and have potential to develop controlling strategies accordingly.

  20. Learning Latent Structure in Complex Networks

    DEFF Research Database (Denmark)

    Mørup, Morten; Hansen, Lars Kai

    such as the Modularity, it has recently been shown that latent structure in complex networks is learnable by Bayesian generative link distribution models (Airoldi et al., 2008, Hofman and Wiggins, 2008). In this paper we propose a new generative model that allows representation of latent community structure......Latent structure in complex networks, e.g., in the form of community structure, can help understand network dynamics, identify heterogeneities in network properties, and predict ‘missing’ links. While most community detection algorithms are based on optimizing heuristic clustering objectives...... as in the previous Bayesian approaches and in addition allows learning of node specific link properties similar to that in the modularity objective. We employ a new relaxation method for efficient inference in these generative models that allows us to learn the behavior of very large networks. We compare the link...

  1. Robustness and structure of complex networks

    Science.gov (United States)

    Shao, Shuai

    This dissertation covers the two major parts of my PhD research on statistical physics and complex networks: i) modeling a new type of attack -- localized attack, and investigating robustness of complex networks under this type of attack; ii) discovering the clustering structure in complex networks and its influence on the robustness of coupled networks. Complex networks appear in every aspect of our daily life and are widely studied in Physics, Mathematics, Biology, and Computer Science. One important property of complex networks is their robustness under attacks, which depends crucially on the nature of attacks and the structure of the networks themselves. Previous studies have focused on two types of attack: random attack and targeted attack, which, however, are insufficient to describe many real-world damages. Here we propose a new type of attack -- localized attack, and study the robustness of complex networks under this type of attack, both analytically and via simulation. On the other hand, we also study the clustering structure in the network, and its influence on the robustness of a complex network system. In the first part, we propose a theoretical framework to study the robustness of complex networks under localized attack based on percolation theory and generating function method. We investigate the percolation properties, including the critical threshold of the phase transition pc and the size of the giant component Pinfinity. We compare localized attack with random attack and find that while random regular (RR) networks are more robust against localized attack, Erdoḧs-Renyi (ER) networks are equally robust under both types of attacks. As for scale-free (SF) networks, their robustness depends crucially on the degree exponent lambda. The simulation results show perfect agreement with theoretical predictions. We also test our model on two real-world networks: a peer-to-peer computer network and an airline network, and find that the real-world networks

  2. Fractured reservoir discrete feature network technologies. Final report, March 7, 1996 to September 30, 1998

    Energy Technology Data Exchange (ETDEWEB)

    Dershowitz, William S.; Einstein, Herbert H.; LaPoint, Paul R.; Eiben, Thorsten; Wadleigh, Eugene; Ivanova, Violeta

    1998-12-01

    This report summarizes research conducted for the Fractured Reservoir Discrete Feature Network Technologies Project. The five areas studied are development of hierarchical fracture models; fractured reservoir compartmentalization, block size, and tributary volume analysis; development and demonstration of fractured reservoir discrete feature data analysis tools; development of tools for data integration and reservoir simulation through application of discrete feature network technologies for tertiary oil production; quantitative evaluation of the economic value of this analysis approach.

  3. Development and validation of a survey to measure features of clinical networks.

    Science.gov (United States)

    Brown, Bernadette Bea; Haines, Mary; Middleton, Sandy; Paul, Christine; D'Este, Catherine; Klineberg, Emily; Elliott, Elizabeth

    2016-09-30

    Networks of clinical experts are increasingly being implemented as a strategy to improve health care processes and outcomes and achieve change in the health system. Few are ever formally evaluated and, when this is done, not all networks are equally successful in their efforts. There is a need to formatively assess the strategic and operational management and leadership of networks to identify where functioning could be improved to maximise impact. This paper outlines the development and psychometric evaluation of an Internet survey to measure features of clinical networks and provides descriptive results from a sample of members of 19 diverse clinical networks responsible for evidence-based quality improvement across a large geographical region. Instrument development was based on: a review of published and grey literature; a qualitative study of clinical network members; a program logic framework; and consultation with stakeholders. The resulting domain structure was validated for a sample of 592 clinical network members using confirmatory factor analysis. Scale reliability was assessed using Cronbach's alpha. A summary score was calculated for each domain and aggregate level means and ranges are reported. The instrument was shown to have good construct validity across seven domains as demonstrated by a high level of internal consistency, and all Cronbach's α coefficients were equal to or above 0.75. In the survey sample of network members there was strong reported commitment and belief in network-led quality improvement initiatives, which were perceived to have improved quality of care (72.8 %) and patient outcomes (63.2 %). Network managers were perceived to be effective leaders and clinical co-chairs were perceived as champions for change. Perceived external support had the lowest summary score across the seven domains. This survey, which has good construct validity and internal reliability, provides a valid instrument to use in future research related to

  4. Wire Finishing Mill Rolling Bearing Fault Diagnosis Based on Feature Extraction and BP Neural Network

    Directory of Open Access Journals (Sweden)

    Hong-Yu LIU

    2014-10-01

    Full Text Available Rolling bearing is main part of rotary machine. It is frail section of rotary machine. Its running status affects entire mechanical equipment system performance directly. Vibration acceleration signals of the third finishing mill of Anshan Steel and Iron Group wire plant were collected in this paper. Fourier analysis, power spectrum analysis and wavelet transform were made on collected signals. Frequency domain feature extraction and wavelet transform feature extraction were made on collected signals. BP neural network fault diagnosis model was adopted. Frequency domain feature values and wavelet transform feature values were treated as neural network input values. Various typical fault models were treated as neural network output values. Corresponding relations between feature vector and fault omen were utilized. BP neural network model of typical wire plant finishing mill rolling bearing fault was constructed by training many groups sample data. After inputting sample needed to be diagnosed, wire plant finishing mill rolling bearing fault can be diagnosed. This research has important practical significance on enhancing rolling bearing fault diagnosis precision, repairing rolling bearing duly, decreasing stop time, enhancing equipment running efficiency and enhancing economic benefits.

  5. STRUCTURE AND COOPTATION IN ORGANIZATION NETWORK

    Directory of Open Access Journals (Sweden)

    Valéria Riscarolli

    2007-10-01

    Full Text Available Business executive are rethinking business concept, based on horizontalization principles. As so, most organizational functions are outsourced, leading the enterprise to build business through a network of organizations. Here we study the case of Cia Hering’s network of organizations, a leader in knit apparel segment in Latin America (IEMI, 2004, looking at the network’s structure and levels of cooptation. A theoretical model was used using Quinn et al. (2001 “sun ray” network structure as basis to analyze the case study. Main results indicate higher degree of structural conformity, but incipient degree of coopetation in the network.

  6. CNNdel: Calling Structural Variations on Low Coverage Data Based on Convolutional Neural Networks

    Directory of Open Access Journals (Sweden)

    Jing Wang

    2017-01-01

    Full Text Available Many structural variations (SVs detection methods have been proposed due to the popularization of next-generation sequencing (NGS. These SV calling methods use different SV-property-dependent features; however, they all suffer from poor accuracy when running on low coverage sequences. The union of results from these tools achieves fairly high sensitivity but still produces low accuracy on low coverage sequence data. That is, these methods contain many false positives. In this paper, we present CNNdel, an approach for calling deletions from paired-end reads. CNNdel gathers SV candidates reported by multiple tools and then extracts features from aligned BAM files at the positions of candidates. With labeled feature-expressed candidates as a training set, CNNdel trains convolutional neural networks (CNNs to distinguish true unlabeled candidates from false ones. Results show that CNNdel works well with NGS reads from 26 low coverage genomes of the 1000 Genomes Project. The paper demonstrates that convolutional neural networks can automatically assign the priority of SV features and reduce the false positives efficaciously.

  7. An evolving network model with community structure

    International Nuclear Information System (INIS)

    Li Chunguang; Maini, Philip K

    2005-01-01

    Many social and biological networks consist of communities-groups of nodes within which connections are dense, but between which connections are sparser. Recently, there has been considerable interest in designing algorithms for detecting community structures in real-world complex networks. In this paper, we propose an evolving network model which exhibits community structure. The network model is based on the inner-community preferential attachment and inter-community preferential attachment mechanisms. The degree distributions of this network model are analysed based on a mean-field method. Theoretical results and numerical simulations indicate that this network model has community structure and scale-free properties

  8. A semi-automatic method for extracting thin line structures in images as rooted tree network

    Energy Technology Data Exchange (ETDEWEB)

    Brazzini, Jacopo [Los Alamos National Laboratory; Dillard, Scott [Los Alamos National Laboratory; Soille, Pierre [EC - JRC

    2010-01-01

    This paper addresses the problem of semi-automatic extraction of line networks in digital images - e.g., road or hydrographic networks in satellite images, blood vessels in medical images, robust. For that purpose, we improve a generic method derived from morphological and hydrological concepts and consisting in minimum cost path estimation and flow simulation. While this approach fully exploits the local contrast and shape of the network, as well as its arborescent nature, we further incorporate local directional information about the structures in the image. Namely, an appropriate anisotropic metric is designed by using both the characteristic features of the target network and the eigen-decomposition of the gradient structure tensor of the image. Following, the geodesic propagation from a given seed with this metric is combined with hydrological operators for overland flow simulation to extract the line network. The algorithm is demonstrated for the extraction of blood vessels in a retina image and of a river network in a satellite image.

  9. Immunization of networks with community structure

    International Nuclear Information System (INIS)

    Masuda, Naoki

    2009-01-01

    In this study, an efficient method to immunize modular networks (i.e. networks with community structure) is proposed. The immunization of networks aims at fragmenting networks into small parts with a small number of removed nodes. Its applications include prevention of epidemic spreading, protection against intentional attacks on networks, and conservation of ecosystems. Although preferential immunization of hubs is efficient, good immunization strategies for modular networks have not been established. On the basis of an immunization strategy based on eigenvector centrality, we develop an analytical framework for immunizing modular networks. To this end, we quantify the contribution of each node to the connectivity in a coarse-grained network among modules. We verify the effectiveness of the proposed method by applying it to model and real networks with modular structure.

  10. The network structure of human personality according to the NEO-PI-R: matching network community structure to factor structure.

    Directory of Open Access Journals (Sweden)

    Rutger Goekoop

    Full Text Available INTRODUCTION: Human personality is described preferentially in terms of factors (dimensions found using factor analysis. An alternative and highly related method is network analysis, which may have several advantages over factor analytic methods. AIM: To directly compare the ability of network community detection (NCD and principal component factor analysis (PCA to examine modularity in multidimensional datasets such as the neuroticism-extraversion-openness personality inventory revised (NEO-PI-R. METHODS: 434 healthy subjects were tested on the NEO-PI-R. PCA was performed to extract factor structures (FS of the current dataset using both item scores and facet scores. Correlational network graphs were constructed from univariate correlation matrices of interactions between both items and facets. These networks were pruned in a link-by-link fashion while calculating the network community structure (NCS of each resulting network using the Wakita Tsurumi clustering algorithm. NCSs were matched against FS and networks of best matches were kept for further analysis. RESULTS: At facet level, NCS showed a best match (96.2% with a 'confirmatory' 5-FS. At item level, NCS showed a best match (80% with the standard 5-FS and involved a total of 6 network clusters. Lesser matches were found with 'confirmatory' 5-FS and 'exploratory' 6-FS of the current dataset. Network analysis did not identify facets as a separate level of organization in between items and clusters. A small-world network structure was found in both item- and facet level networks. CONCLUSION: We present the first optimized network graph of personality traits according to the NEO-PI-R: a 'Personality Web'. Such a web may represent the possible routes that subjects can take during personality development. NCD outperforms PCA by producing plausible modularity at item level in non-standard datasets, and can identify the key roles of individual items and clusters in the network.

  11. Structural Covariance Networks in Children with Autism or ADHD.

    Science.gov (United States)

    Bethlehem, R A I; Romero-Garcia, R; Mak, E; Bullmore, E T; Baron-Cohen, S

    2017-08-01

    While autism and attention-deficit/hyperactivity disorder (ADHD) are considered distinct conditions from a diagnostic perspective, clinically they share some phenotypic features and have high comorbidity. Regardless, most studies have focused on only one condition, with considerable heterogeneity in their results. Taking a dual-condition approach might help elucidate shared and distinct neural characteristics. Graph theory was used to analyse topological properties of structural covariance networks across both conditions and relative to a neurotypical (NT; n = 87) group using data from the ABIDE (autism; n = 62) and ADHD-200 datasets (ADHD; n = 69). Regional cortical thickness was used to construct the structural covariance networks. This was analysed in a theoretical framework examining potential differences in long and short-range connectivity, with a specific focus on relation between central graph measures and cortical thickness. We found convergence between autism and ADHD, where both conditions show an overall decrease in CT covariance with increased Euclidean distance between centroids compared with a NT population. The 2 conditions also show divergence. Namely, there is less modular overlap between the 2 conditions than there is between each condition and the NT group. The ADHD group also showed reduced cortical thickness and lower degree in hub regions than the autism group. Lastly, the ADHD group also showed reduced wiring costs compared with the autism groups. Our results indicate a need for taking an integrated approach when considering highly comorbid conditions such as autism and ADHD. Furthermore, autism and ADHD both showed alterations in the relation between inter-regional covariance and centroid distance, where both groups show a steeper decline in covariance as a function of distance. The 2 groups also diverge on modular organization, cortical thickness of hub regions and wiring cost of the covariance network. Thus, on some network features the

  12. Feature-based motion control for near-repetitive structures

    NARCIS (Netherlands)

    Best, de J.J.T.H.

    2011-01-01

    In many manufacturing processes, production steps are carried out on repetitive structures which consist of identical features placed in a repetitive pattern. In the production of these repetitive structures one or more consecutive steps are carried out on the features to create the final product.

  13. Patchworking Network Structures

    DEFF Research Database (Denmark)

    Norus, Jesper

    2004-01-01

    analyzes fourdifferent managerial strategies of how to create network structures to deal with theinterfaces between industry, university and public institutions. The research-orientedstrategy, the incubator strategy, the industrial-partnering strategy, and the policyorientedstrategy. The research...... groups has been treated as a contingent factor.However, little attention has been given to the managerial efforts that entrepreneurshave make to establish the fit between small firms, university research, and publicpolicies such as regulatory policies and R&D policies through network-type structures.......New biotechnology organizations are perfect objects to study these relationshipsbecause new biotechnologies and techniques predominantly come from the universitysector (Kenney, 1986; Yoxen; 1984; Zucker & Darby, 1997; Robbins-Roth, 2001).From the perspective of the small biotechnology firms (SBFs,) this paper...

  14. Network structure and travel time perception.

    Science.gov (United States)

    Parthasarathi, Pavithra; Levinson, David; Hochmair, Hartwig

    2013-01-01

    The purpose of this research is to test the systematic variation in the perception of travel time among travelers and relate the variation to the underlying street network structure. Travel survey data from the Twin Cities metropolitan area (which includes the cities of Minneapolis and St. Paul) is used for the analysis. Travelers are classified into two groups based on the ratio of perceived and estimated commute travel time. The measures of network structure are estimated using the street network along the identified commute route. T-test comparisons are conducted to identify statistically significant differences in estimated network measures between the two traveler groups. The combined effect of these estimated network measures on travel time is then analyzed using regression models. The results from the t-test and regression analyses confirm the influence of the underlying network structure on the perception of travel time.

  15. The functional and structural characteristics of the emotion network in alexithymia

    Directory of Open Access Journals (Sweden)

    Han D

    2018-04-01

    Full Text Available Dai Han,1–3 Mei Li,4 Minjun Mei,4 Xiaofei Sun4 1Institutes of Psychological Sciences, Hangzhou Normal University, Hangzhou, Zhejiang, China; 2Children and Adolescents Mental Health Joint Clinic, The Affiliated Hospital of Hangzhou Normal University, Hangzhou, Zhejiang, China; 3Zhejiang Key Laboratory for Research in Assessment of Cognitive Impairments, Hangzhou, Zhejiang, China; 4Mental Health Education and Counseling Center, Hangzhou Normal University, Hangzhou, Zhejiang, China Background: Alexithymia is a multifaceted personality trait characterized by emotional dysfunction.Methods: In this study, the functional and structural features of the emotion network in alexithymia were investigated using resting-state functional MRI (rsfMRI, voxel-based morphometry (VBM, functional connectivity (FC analysis, and diffusion tensor imaging (DTI. Alexithymic and non-alexithymic students were recruited from the local university. The intrinsic neural activity and gray matter density of the brain regions in the emotion network were measured using rsfMRI and VBM; the FC and structural connectivity of the brain regions in the emotion network were measured using FC analysis and DTI.Results: The altered intrinsic neural activity in V1, rostral dorsal anterior cingulate cortex, and left amygdala, and the weak FC between V1 and left superior temporal gyrus and V1 and left paracentral lobule in alexithymia subjects were identified. However, no alteration of the structure and structural connectivity of the emotion network was identified.Conclusion: The results indicated that the development of alexithymia might have been caused only by slight alteration of the neural activity. Furthermore, the results suggest that noninvasive treatment technologies for improving the brain activity are suitable for alexithymic individuals. Keywords: emotion network, rsfMRI, VBM, functional connectivity, structural connectivity

  16. Information transfer in community structured multiplex networks

    Science.gov (United States)

    Solé Ribalta, Albert; Granell, Clara; Gómez, Sergio; Arenas, Alex

    2015-08-01

    The study of complex networks that account for different types of interactions has become a subject of interest in the last few years, specially because its representational power in the description of users interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.). The mathematical description of these interacting networks has been coined under the name of multilayer networks, where each layer accounts for a type of interaction. It has been shown that diffusive processes on top of these networks present a phenomenology that cannot be explained by the naive superposition of single layer diffusive phenomena but require the whole structure of interconnected layers. Nevertheless, the description of diffusive phenomena on multilayer networks has obviated the fact that social networks have strong mesoscopic structure represented by different communities of individuals driven by common interests, or any other social aspect. In this work, we study the transfer of information in multilayer networks with community structure. The final goal is to understand and quantify, if the existence of well-defined community structure at the level of individual layers, together with the multilayer structure of the whole network, enhances or deteriorates the diffusion of packets of information.

  17. Information transfer in community structured multiplex networks

    Directory of Open Access Journals (Sweden)

    Albert eSolé Ribalta

    2015-08-01

    Full Text Available The study of complex networks that account for different types of interactions has become a subject of interest in the last few years, specially because its representational power in the description of users interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.. The mathematical description of these interacting networks has been coined under the name of multilayer networks, where each layer accounts for a type of interaction. It has been shown that diffusive processes on top of these networks present a phenomenology that cannot be explained by the naive superposition of single layer diffusive phenomena but require the whole structure of interconnected layers. Nevertheless, the description of diffusive phenomena on multilayer networks has obviated the fact that social networks have strong mesoscopic structure represented by different communities of individuals driven by common interests, or any other social aspect. In this work, we study the transfer of information in multilayer networks with community structure. The final goal is to understand and quantify, if the existence of well-defined community structure at the level of individual layers, together with the multilayer structure of the whole network, enhances or deteriorates the diffusion of packets of information.

  18. Altered temporal features of intrinsic connectivity networks in boys with combined type of attention deficit hyperactivity disorder

    International Nuclear Information System (INIS)

    Wang, Xun-Heng; Li, Lihua

    2015-01-01

    Highlights: • Temporal patterns within ICNs provide new way to investigate ADHD brains. • ADHD exhibits enhanced temporal activities within and between ICNs. • Network-wise ALFF influences functional connectivity between ICNs. • Univariate patterns within ICNs are correlated to behavior scores. - Abstract: Purpose: Investigating the altered temporal features within and between intrinsic connectivity networks (ICNs) for boys with attention-deficit/hyperactivity disorder (ADHD); and analyzing the relationships between altered temporal features within ICNs and behavior scores. Materials and methods: A cohort of boys with combined type of ADHD and a cohort of age-matched healthy boys were recruited from ADHD-200 Consortium. All resting-state fMRI datasets were preprocessed and normalized into standard brain space. Using general linear regression, 20 ICNs were taken as spatial templates to analyze the time-courses of ICNs for each subject. Amplitude of low frequency fluctuations (ALFFs) were computed as univariate temporal features within ICNs. Pearson correlation coefficients and node strengths were computed as bivariate temporal features between ICNs. Additional correlation analysis was performed between temporal features of ICNs and behavior scores. Results: ADHD exhibited more activated network-wise ALFF than normal controls in attention and default mode-related network. Enhanced functional connectivities between ICNs were found in ADHD. The network-wise ALFF within ICNs might influence the functional connectivity between ICNs. The temporal pattern within posterior default mode network (pDMN) was positively correlated to inattentive scores. The subcortical network, fusiform-related DMN and attention-related networks were negatively correlated to Intelligence Quotient (IQ) scores. Conclusion: The temporal low frequency oscillations of ICNs in boys with ADHD were more activated than normal controls during resting state; the temporal features within ICNs could

  19. Altered temporal features of intrinsic connectivity networks in boys with combined type of attention deficit hyperactivity disorder

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Xun-Heng, E-mail: xhwang@hdu.edu.cn [College of Life Information Science and Instrument Engineering, Hangzhou Dianzi University, Hangzhou 310018 (China); School of Biological Science and Medical Engineering, Southeast University, Nanjing 210096 (China); Li, Lihua [College of Life Information Science and Instrument Engineering, Hangzhou Dianzi University, Hangzhou 310018 (China)

    2015-05-15

    Highlights: • Temporal patterns within ICNs provide new way to investigate ADHD brains. • ADHD exhibits enhanced temporal activities within and between ICNs. • Network-wise ALFF influences functional connectivity between ICNs. • Univariate patterns within ICNs are correlated to behavior scores. - Abstract: Purpose: Investigating the altered temporal features within and between intrinsic connectivity networks (ICNs) for boys with attention-deficit/hyperactivity disorder (ADHD); and analyzing the relationships between altered temporal features within ICNs and behavior scores. Materials and methods: A cohort of boys with combined type of ADHD and a cohort of age-matched healthy boys were recruited from ADHD-200 Consortium. All resting-state fMRI datasets were preprocessed and normalized into standard brain space. Using general linear regression, 20 ICNs were taken as spatial templates to analyze the time-courses of ICNs for each subject. Amplitude of low frequency fluctuations (ALFFs) were computed as univariate temporal features within ICNs. Pearson correlation coefficients and node strengths were computed as bivariate temporal features between ICNs. Additional correlation analysis was performed between temporal features of ICNs and behavior scores. Results: ADHD exhibited more activated network-wise ALFF than normal controls in attention and default mode-related network. Enhanced functional connectivities between ICNs were found in ADHD. The network-wise ALFF within ICNs might influence the functional connectivity between ICNs. The temporal pattern within posterior default mode network (pDMN) was positively correlated to inattentive scores. The subcortical network, fusiform-related DMN and attention-related networks were negatively correlated to Intelligence Quotient (IQ) scores. Conclusion: The temporal low frequency oscillations of ICNs in boys with ADHD were more activated than normal controls during resting state; the temporal features within ICNs could

  20. Network motif frequency vectors reveal evolving metabolic network organisation.

    Science.gov (United States)

    Pearcy, Nicole; Crofts, Jonathan J; Chuzhanova, Nadia

    2015-01-01

    At the systems level many organisms of interest may be described by their patterns of interaction, and as such, are perhaps best characterised via network or graph models. Metabolic networks, in particular, are fundamental to the proper functioning of many important biological processes, and thus, have been widely studied over the past decade or so. Such investigations have revealed a number of shared topological features, such as a short characteristic path-length, large clustering coefficient and hierarchical modular structure. However, the extent to which evolutionary and functional properties of metabolism manifest via this underlying network architecture remains unclear. In this paper, we employ a novel graph embedding technique, based upon low-order network motifs, to compare metabolic network structure for 383 bacterial species categorised according to a number of biological features. In particular, we introduce a new global significance score which enables us to quantify important evolutionary relationships that exist between organisms and their physical environments. Using this new approach, we demonstrate a number of significant correlations between environmental factors, such as growth conditions and habitat variability, and network motif structure, providing evidence that organism adaptability leads to increased complexities in the resultant metabolic networks.

  1. Advanced Polymer Network Structures

    Science.gov (United States)

    2016-02-01

    attractive interaction (n = 2.0) and a neutral interaction (n = 1.0); n is equal to unity for self-interactions among the monomers of first network and...... Network Structures by Robert Lambeth, Joseph Lenhart, and Tim Sirk Weapons and Materials Research Directorate, ARL Yelena Sliozberg TKC Global

  2. Epidemic spreading on complex networks with community structures

    NARCIS (Netherlands)

    Stegehuis, C.; van der Hofstad, R.W.; van Leeuwaarden, J.S.H.

    2016-01-01

    Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network, while the other model only preserves the set of communities

  3. Global Electricity Trade Network: Structures and Implications

    Science.gov (United States)

    Ji, Ling; Jia, Xiaoping; Chiu, Anthony S. F.; Xu, Ming

    2016-01-01

    Nations increasingly trade electricity, and understanding the structure of the global power grid can help identify nations that are critical for its reliability. This study examines the global grid as a network with nations as nodes and international electricity trade as links. We analyze the structure of the global electricity trade network and find that the network consists of four sub-networks, and provide a detailed analysis of the largest network, Eurasia. Russia, China, Ukraine, and Azerbaijan have high betweenness measures in the Eurasian sub-network, indicating the degrees of centrality of the positions they hold. The analysis reveals that the Eurasian sub-network consists of seven communities based on the network structure. We find that the communities do not fully align with geographical proximity, and that the present international electricity trade in the Eurasian sub-network causes an approximately 11 million additional tons of CO2 emissions. PMID:27504825

  4. Feature Extraction Method for High Impedance Ground Fault Localization in Radial Power Distribution Networks

    DEFF Research Database (Denmark)

    Jensen, Kåre Jean; Munk, Steen M.; Sørensen, John Aasted

    1998-01-01

    A new approach to the localization of high impedance ground faults in compensated radial power distribution networks is presented. The total size of such networks is often very large and a major part of the monitoring of these is carried out manually. The increasing complexity of industrial...... of three phase voltages and currents. The method consists of a feature extractor, based on a grid description of the feeder by impulse responses, and a neural network for ground fault localization. The emphasis of this paper is the feature extractor, and the detection of the time instance of a ground fault...... processes and communication systems lead to demands for improved monitoring of power distribution networks so that the quality of power delivery can be kept at a controlled level. The ground fault localization method for each feeder in a network is based on the centralized frequency broadband measurement...

  5. Spatial and Time Domain Feature of ERP Speller System Extracted via Convolutional Neural Network.

    Science.gov (United States)

    Yoon, Jaehong; Lee, Jungnyun; Whang, Mincheol

    2018-01-01

    Feature of event-related potential (ERP) has not been completely understood and illiteracy problem remains unsolved. To this end, P300 peak has been used as the feature of ERP in most brain-computer interface applications, but subjects who do not show such peak are common. Recent development of convolutional neural network provides a way to analyze spatial and temporal features of ERP. Here, we train the convolutional neural network with 2 convolutional layers whose feature maps represented spatial and temporal features of event-related potential. We have found that nonilliterate subjects' ERP show high correlation between occipital lobe and parietal lobe, whereas illiterate subjects only show correlation between neural activities from frontal lobe and central lobe. The nonilliterates showed peaks in P300, P500, and P700, whereas illiterates mostly showed peaks in around P700. P700 was strong in both subjects. We found that P700 peak may be the key feature of ERP as it appears in both illiterate and nonilliterate subjects.

  6. On the structure of Bayesian network for Indonesian text document paraphrase identification

    Science.gov (United States)

    Prayogo, Ario Harry; Syahrul Mubarok, Mohamad; Adiwijaya

    2018-03-01

    Paraphrase identification is an important process within natural language processing. The idea is to automatically recognize phrases that have different forms but contain same meanings. For examples if we input query “causing fire hazard”, then the computer has to recognize this query that this query has same meaning as “the cause of fire hazard. Paraphrasing is an activity that reveals the meaning of an expression, writing, or speech using different words or forms, especially to achieve greater clarity. In this research we will focus on classifying two Indonesian sentences whether it is a paraphrase to each other or not. There are four steps in this research, first is preprocessing, second is feature extraction, third is classifier building, and the last is performance evaluation. Preprocessing consists of tokenization, non-alphanumerical removal, and stemming. After preprocessing we will conduct feature extraction in order to build new features from given dataset. There are two kinds of features in the research, syntactic features and semantic features. Syntactic features consist of normalized levenshtein distance feature, term-frequency based cosine similarity feature, and LCS (Longest Common Subsequence) feature. Semantic features consist of Wu and Palmer feature and Shortest Path Feature. We use Bayesian Networks as the method of training the classifier. Parameter estimation that we use is called MAP (Maximum A Posteriori). For structure learning of Bayesian Networks DAG (Directed Acyclic Graph), we use BDeu (Bayesian Dirichlet equivalent uniform) scoring function and for finding DAG with the best BDeu score, we use K2 algorithm. In evaluation step we perform cross-validation. The average result that we get from testing the classifier as follows: Precision 75.2%, Recall 76.5%, F1-Measure 75.8% and Accuracy 75.6%.

  7. Structure and weights optimisation of a modified Elman network emotion classifier using hybrid computational intelligence algorithms: a comparative study

    Science.gov (United States)

    Sheikhan, Mansour; Abbasnezhad Arabi, Mahdi; Gharavian, Davood

    2015-10-01

    Artificial neural networks are efficient models in pattern recognition applications, but their performance is dependent on employing suitable structure and connection weights. This study used a hybrid method for obtaining the optimal weight set and architecture of a recurrent neural emotion classifier based on gravitational search algorithm (GSA) and its binary version (BGSA), respectively. By considering the features of speech signal that were related to prosody, voice quality, and spectrum, a rich feature set was constructed. To select more efficient features, a fast feature selection method was employed. The performance of the proposed hybrid GSA-BGSA method was compared with similar hybrid methods based on particle swarm optimisation (PSO) algorithm and its binary version, PSO and discrete firefly algorithm, and hybrid of error back-propagation and genetic algorithm that were used for optimisation. Experimental tests on Berlin emotional database demonstrated the superior performance of the proposed method using a lighter network structure.

  8. Gene expression network reconstruction by convex feature selection when incorporating genetic perturbations.

    Directory of Open Access Journals (Sweden)

    Benjamin A Logsdon

    Full Text Available Cellular gene expression measurements contain regulatory information that can be used to discover novel network relationships. Here, we present a new algorithm for network reconstruction powered by the adaptive lasso, a theoretically and empirically well-behaved method for selecting the regulatory features of a network. Any algorithms designed for network discovery that make use of directed probabilistic graphs require perturbations, produced by either experiments or naturally occurring genetic variation, to successfully infer unique regulatory relationships from gene expression data. Our approach makes use of appropriately selected cis-expression Quantitative Trait Loci (cis-eQTL, which provide a sufficient set of independent perturbations for maximum network resolution. We compare the performance of our network reconstruction algorithm to four other approaches: the PC-algorithm, QTLnet, the QDG algorithm, and the NEO algorithm, all of which have been used to reconstruct directed networks among phenotypes leveraging QTL. We show that the adaptive lasso can outperform these algorithms for networks of ten genes and ten cis-eQTL, and is competitive with the QDG algorithm for networks with thirty genes and thirty cis-eQTL, with rich topologies and hundreds of samples. Using this novel approach, we identify unique sets of directed relationships in Saccharomyces cerevisiae when analyzing genome-wide gene expression data for an intercross between a wild strain and a lab strain. We recover novel putative network relationships between a tyrosine biosynthesis gene (TYR1, and genes involved in endocytosis (RCY1, the spindle checkpoint (BUB2, sulfonate catabolism (JLP1, and cell-cell communication (PRM7. Our algorithm provides a synthesis of feature selection methods and graphical model theory that has the potential to reveal new directed regulatory relationships from the analysis of population level genetic and gene expression data.

  9. CHIMERA: Top-down model for hierarchical, overlapping and directed cluster structures in directed and weighted complex networks

    Science.gov (United States)

    Franke, R.

    2016-11-01

    In many networks discovered in biology, medicine, neuroscience and other disciplines special properties like a certain degree distribution and hierarchical cluster structure (also called communities) can be observed as general organizing principles. Detecting the cluster structure of an unknown network promises to identify functional subdivisions, hierarchy and interactions on a mesoscale. It is not trivial choosing an appropriate detection algorithm because there are multiple network, cluster and algorithmic properties to be considered. Edges can be weighted and/or directed, clusters overlap or build a hierarchy in several ways. Algorithms differ not only in runtime, memory requirements but also in allowed network and cluster properties. They are based on a specific definition of what a cluster is, too. On the one hand, a comprehensive network creation model is needed to build a large variety of benchmark networks with different reasonable structures to compare algorithms. On the other hand, if a cluster structure is already known, it is desirable to separate effects of this structure from other network properties. This can be done with null model networks that mimic an observed cluster structure to improve statistics on other network features. A third important application is the general study of properties in networks with different cluster structures, possibly evolving over time. Currently there are good benchmark and creation models available. But what is left is a precise sandbox model to build hierarchical, overlapping and directed clusters for undirected or directed, binary or weighted complex random networks on basis of a sophisticated blueprint. This gap shall be closed by the model CHIMERA (Cluster Hierarchy Interconnection Model for Evaluation, Research and Analysis) which will be introduced and described here for the first time.

  10. Digital mammography: Mixed feature neural network with spectral entropy decision for detection of microcalcifications

    Energy Technology Data Exchange (ETDEWEB)

    Zheng, B. [Univ. of South Florida, Tampa, FL (United States)]|[Nanjing Univ. of Posts and Telecommunications (China). Dept. of Telecommunication Engineering; Qian, W.; Clarke, L.P. [Univ. of South Florida, Tampa, FL (United States)

    1996-10-01

    A computationally efficient mixed feature based neural network (MFNN) is proposed for the detection of microcalcification clusters (MCC`s) in digitized mammograms. The MFNN employs features computed in both the spatial and spectral domain and uses spectral entropy as a decision parameter. Backpropagation with Kalman Filtering (KF) is employed to allow more efficient network training as required for evaluation of different features, input images, and related error analysis. A previously reported, wavelet-based image-enhancement method is also employed to enhance microcalcification clusters for improved detection. The relative performance of the MFNN for both the raw and enhanced images is evaluated using a common image database of 30 digitized mammograms, with 20 images containing 21 biopsy proven MCC`s and ten normal cases. The computed sensitivity (true positive (TP) detection rate) was 90.1% with an average low false positive (FP) detection of 0.71 MCCs/image for the enhanced images using a modified k-fold validation error estimation technique. The corresponding computed sensitivity for the raw images was reduced to 81.4% and with 0.59 FP`s MCCs/image. A relative comparison to an earlier neural network (NN) design, using only spatially related features, suggests the importance of the addition of spectral domain features when the raw image data are analyzed.

  11. Digital mammography: Mixed feature neural network with spectral entropy decision for detection of microcalcifications

    International Nuclear Information System (INIS)

    Zheng, B.

    1996-01-01

    A computationally efficient mixed feature based neural network (MFNN) is proposed for the detection of microcalcification clusters (MCC's) in digitized mammograms. The MFNN employs features computed in both the spatial and spectral domain and uses spectral entropy as a decision parameter. Backpropagation with Kalman Filtering (KF) is employed to allow more efficient network training as required for evaluation of different features, input images, and related error analysis. A previously reported, wavelet-based image-enhancement method is also employed to enhance microcalcification clusters for improved detection. The relative performance of the MFNN for both the raw and enhanced images is evaluated using a common image database of 30 digitized mammograms, with 20 images containing 21 biopsy proven MCC's and ten normal cases. The computed sensitivity (true positive (TP) detection rate) was 90.1% with an average low false positive (FP) detection of 0.71 MCCs/image for the enhanced images using a modified k-fold validation error estimation technique. The corresponding computed sensitivity for the raw images was reduced to 81.4% and with 0.59 FP's MCCs/image. A relative comparison to an earlier neural network (NN) design, using only spatially related features, suggests the importance of the addition of spectral domain features when the raw image data are analyzed

  12. Topological structure of the space of phenotypes: the case of RNA neutral networks.

    Directory of Open Access Journals (Sweden)

    Jacobo Aguirre

    Full Text Available The evolution and adaptation of molecular populations is constrained by the diversity accessible through mutational processes. RNA is a paradigmatic example of biopolymer where genotype (sequence and phenotype (approximated by the secondary structure fold are identified in a single molecule. The extreme redundancy of the genotype-phenotype map leads to large ensembles of RNA sequences that fold into the same secondary structure and can be connected through single-point mutations. These ensembles define neutral networks of phenotypes in sequence space. Here we analyze the topological properties of neutral networks formed by 12-nucleotides RNA sequences, obtained through the exhaustive folding of sequence space. A total of 4(12 sequences fragments into 645 subnetworks that correspond to 57 different secondary structures. The topological analysis reveals that each subnetwork is far from being random: it has a degree distribution with a well-defined average and a small dispersion, a high clustering coefficient, and an average shortest path between nodes close to its minimum possible value, i.e. the Hamming distance between sequences. RNA neutral networks are assortative due to the correlation in the composition of neighboring sequences, a feature that together with the symmetries inherent to the folding process explains the existence of communities. Several topological relationships can be analytically derived attending to structural restrictions and generic properties of the folding process. The average degree of these phenotypic networks grows logarithmically with their size, such that abundant phenotypes have the additional advantage of being more robust to mutations. This property prevents fragmentation of neutral networks and thus enhances the navigability of sequence space. In summary, RNA neutral networks show unique topological properties, unknown to other networks previously described.

  13. Considerations on command and response language features for a network of heterogeneous autonomous computers

    Science.gov (United States)

    Engelberg, N.; Shaw, C., III

    1984-01-01

    The design of a uniform command language to be used in a local area network of heterogeneous, autonomous nodes is considered. After examining the major characteristics of such a network, and after considering the profile of a scientist using the computers on the net as an investigative aid, a set of reasonable requirements for the command language are derived. Taking into account the possible inefficiencies in implementing a guest-layered network operating system and command language on a heterogeneous net, the authors examine command language naming, process/procedure invocation, parameter acquisition, help and response facilities, and other features found in single-node command languages, and conclude that some features may extend simply to the network case, others extend after some restrictions are imposed, and still others require modifications. In addition, it is noted that some requirements considered reasonable (user accounting reports, for example) demand further study before they can be efficiently implemented on a network of the sort described.

  14. Structure and evolution of a European Parliament via a network and correlation analysis

    Science.gov (United States)

    Puccio, Elena; Pajala, Antti; Piilo, Jyrki; Tumminello, Michele

    2016-11-01

    We present a study of the network of relationships among elected members of the Finnish parliament, based on a quantitative analysis of initiative co-signatures, and its evolution over 16 years. To understand the structure of the parliament, we constructed a statistically validated network of members, based on the similarity between the patterns of initiatives they signed. We looked for communities within the network and characterized them in terms of members' attributes, such as electoral district and party. To gain insight on the nested structure of communities, we constructed a hierarchical tree of members from the correlation matrix. Afterwards, we studied parliament dynamics yearly, with a focus on correlations within and between parties, by also distinguishing between government and opposition. Finally, we investigated the role played by specific individuals, at a local level. In particular, whether they act as proponents who gather consensus, or as signers. Our results provide a quantitative background to current theories in political science. From a methodological point of view, our network approach has proven able to highlight both local and global features of a complex social system.

  15. Communication on the structure of biological networks

    Indian Academy of Sciences (India)

    Networks are widely used to represent interaction pattern among the components in complex systems. Structures of real networks from different domains may vary quite significantly. As there is an interplay between network architecture and dynamics, structure plays an important role in communication and spreading of ...

  16. Structural health monitoring feature design by genetic programming

    International Nuclear Information System (INIS)

    Harvey, Dustin Y; Todd, Michael D

    2014-01-01

    Structural health monitoring (SHM) systems provide real-time damage and performance information for civil, aerospace, and other high-capital or life-safety critical structures. Conventional data processing involves pre-processing and extraction of low-dimensional features from in situ time series measurements. The features are then input to a statistical pattern recognition algorithm to perform the relevant classification or regression task necessary to facilitate decisions by the SHM system. Traditional design of signal processing and feature extraction algorithms can be an expensive and time-consuming process requiring extensive system knowledge and domain expertise. Genetic programming, a heuristic program search method from evolutionary computation, was recently adapted by the authors to perform automated, data-driven design of signal processing and feature extraction algorithms for statistical pattern recognition applications. The proposed method, called Autofead, is particularly suitable to handle the challenges inherent in algorithm design for SHM problems where the manifestation of damage in structural response measurements is often unclear or unknown. Autofead mines a training database of response measurements to discover information-rich features specific to the problem at hand. This study provides experimental validation on three SHM applications including ultrasonic damage detection, bearing damage classification for rotating machinery, and vibration-based structural health monitoring. Performance comparisons with common feature choices for each problem area are provided demonstrating the versatility of Autofead to produce significant algorithm improvements on a wide range of problems. (paper)

  17. Resistance and Security Index of Networks: Structural Information Perspective of Network Security.

    Science.gov (United States)

    Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

    2016-06-03

    Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks.

  18. Resistance and Security Index of Networks: Structural Information Perspective of Network Security

    Science.gov (United States)

    Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

    2016-01-01

    Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks. PMID:27255783

  19. Resistance and Security Index of Networks: Structural Information Perspective of Network Security

    Science.gov (United States)

    Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

    2016-06-01

    Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks.

  20. Patch layout generation by detecting feature networks

    KAUST Repository

    Cao, Yuanhao; Yan, Dongming; Wonka, Peter

    2015-01-01

    The patch layout of 3D surfaces reveals the high-level geometric and topological structures. In this paper, we study the patch layout computation by detecting and enclosing feature loops on surfaces. We present a hybrid framework which combines

  1. Evolving production network structures

    DEFF Research Database (Denmark)

    Grunow, Martin; Gunther, H.O.; Burdenik, H.

    2007-01-01

    When deciding about future production network configurations, the current structures have to be taken into account. Further, core issues such as the maturity of the products and the capacity requirements for test runs and ramp-ups must be incorporated. Our approach is based on optimization...... modelling and assigns products and capacity expansions to production sites under the above constraints. It also considers the production complexity at the individual sites and the flexibility of the network. Our implementation results for a large manufacturing network reveal substantial possible cost...

  2. Spatial and Time Domain Feature of ERP Speller System Extracted via Convolutional Neural Network

    Directory of Open Access Journals (Sweden)

    Jaehong Yoon

    2018-01-01

    Full Text Available Feature of event-related potential (ERP has not been completely understood and illiteracy problem remains unsolved. To this end, P300 peak has been used as the feature of ERP in most brain–computer interface applications, but subjects who do not show such peak are common. Recent development of convolutional neural network provides a way to analyze spatial and temporal features of ERP. Here, we train the convolutional neural network with 2 convolutional layers whose feature maps represented spatial and temporal features of event-related potential. We have found that nonilliterate subjects’ ERP show high correlation between occipital lobe and parietal lobe, whereas illiterate subjects only show correlation between neural activities from frontal lobe and central lobe. The nonilliterates showed peaks in P300, P500, and P700, whereas illiterates mostly showed peaks in around P700. P700 was strong in both subjects. We found that P700 peak may be the key feature of ERP as it appears in both illiterate and nonilliterate subjects.

  3. Convolutional neural network features based change detection in satellite images

    Science.gov (United States)

    Mohammed El Amin, Arabi; Liu, Qingjie; Wang, Yunhong

    2016-07-01

    With the popular use of high resolution remote sensing (HRRS) satellite images, a huge research efforts have been placed on change detection (CD) problem. An effective feature selection method can significantly boost the final result. While hand-designed features have proven difficulties to design features that effectively capture high and mid-level representations, the recent developments in machine learning (Deep Learning) omit this problem by learning hierarchical representation in an unsupervised manner directly from data without human intervention. In this letter, we propose approaching the change detection problem from a feature learning perspective. A novel deep Convolutional Neural Networks (CNN) features based HR satellite images change detection method is proposed. The main guideline is to produce a change detection map directly from two images using a pretrained CNN. This method can omit the limited performance of hand-crafted features. Firstly, CNN features are extracted through different convolutional layers. Then, a concatenation step is evaluated after an normalization step, resulting in a unique higher dimensional feature map. Finally, a change map was computed using pixel-wise Euclidean distance. Our method has been validated on real bitemporal HRRS satellite images according to qualitative and quantitative analyses. The results obtained confirm the interest of the proposed method.

  4. The prisoner's dilemma in structured scale-free networks

    International Nuclear Information System (INIS)

    Li Xing; Wu Yonghui; Zhang Zhongzhi; Zhou Shuigeng; Rong Zhihai

    2009-01-01

    The conventional wisdom is that scale-free networks are prone to cooperation spreading. In this paper we investigate the cooperative behavior on the structured scale-free network. In contrast to the conventional wisdom that scale-free networks are prone to cooperation spreading, the evolution of cooperation is inhibited on the structured scale-free network when the prisoner's dilemma (PD) game is modeled. First, we demonstrate that neither the scale-free property nor the high clustering coefficient is responsible for the inhibition of cooperation spreading on the structured scale-free network. Then we provide one heuristic method to argue that the lack of age correlations and its associated 'large-world' behavior in the structured scale-free network inhibit the spread of cooperation. These findings may help enlighten further studies on the evolutionary dynamics of the PD game in scale-free networks

  5. nRC: non-coding RNA Classifier based on structural features.

    Science.gov (United States)

    Fiannaca, Antonino; La Rosa, Massimo; La Paglia, Laura; Rizzo, Riccardo; Urso, Alfonso

    2017-01-01

    Non-coding RNA (ncRNA) are small non-coding sequences involved in gene expression regulation of many biological processes and diseases. The recent discovery of a large set of different ncRNAs with biologically relevant roles has opened the way to develop methods able to discriminate between the different ncRNA classes. Moreover, the lack of knowledge about the complete mechanisms in regulative processes, together with the development of high-throughput technologies, has required the help of bioinformatics tools in addressing biologists and clinicians with a deeper comprehension of the functional roles of ncRNAs. In this work, we introduce a new ncRNA classification tool, nRC (non-coding RNA Classifier). Our approach is based on features extraction from the ncRNA secondary structure together with a supervised classification algorithm implementing a deep learning architecture based on convolutional neural networks. We tested our approach for the classification of 13 different ncRNA classes. We obtained classification scores, using the most common statistical measures. In particular, we reach an accuracy and sensitivity score of about 74%. The proposed method outperforms other similar classification methods based on secondary structure features and machine learning algorithms, including the RNAcon tool that, to date, is the reference classifier. nRC tool is freely available as a docker image at https://hub.docker.com/r/tblab/nrc/. The source code of nRC tool is also available at https://github.com/IcarPA-TBlab/nrc.

  6. Clustering coefficient and community structure of bipartite networks

    Science.gov (United States)

    Zhang, Peng; Wang, Jinliang; Li, Xiaojia; Li, Menghui; Di, Zengru; Fan, Ying

    2008-12-01

    Many real-world networks display natural bipartite structure, where the basic cycle is a square. In this paper, with the similar consideration of standard clustering coefficient in binary networks, a definition of the clustering coefficient for bipartite networks based on the fraction of squares is proposed. In order to detect community structures in bipartite networks, two different edge clustering coefficients LC4 and LC3 of bipartite networks are defined, which are based on squares and triples respectively. With the algorithm of cutting the edge with the least clustering coefficient, communities in artificial and real world networks are identified. The results reveal that investigating bipartite networks based on the original structure can show the detailed properties that is helpful to get deep understanding about the networks.

  7. Feature extraction using convolutional neural network for classifying breast density in mammographic images

    Science.gov (United States)

    Thomaz, Ricardo L.; Carneiro, Pedro C.; Patrocinio, Ana C.

    2017-03-01

    Breast cancer is the leading cause of death for women in most countries. The high levels of mortality relate mostly to late diagnosis and to the direct proportionally relationship between breast density and breast cancer development. Therefore, the correct assessment of breast density is important to provide better screening for higher risk patients. However, in modern digital mammography the discrimination among breast densities is highly complex due to increased contrast and visual information for all densities. Thus, a computational system for classifying breast density might be a useful tool for aiding medical staff. Several machine-learning algorithms are already capable of classifying small number of classes with good accuracy. However, machinelearning algorithms main constraint relates to the set of features extracted and used for classification. Although well-known feature extraction techniques might provide a good set of features, it is a complex task to select an initial set during design of a classifier. Thus, we propose feature extraction using a Convolutional Neural Network (CNN) for classifying breast density by a usual machine-learning classifier. We used 307 mammographic images downsampled to 260x200 pixels to train a CNN and extract features from a deep layer. After training, the activation of 8 neurons from a deep fully connected layer are extracted and used as features. Then, these features are feedforward to a single hidden layer neural network that is cross-validated using 10-folds to classify among four classes of breast density. The global accuracy of this method is 98.4%, presenting only 1.6% of misclassification. However, the small set of samples and memory constraints required the reuse of data in both CNN and MLP-NN, therefore overfitting might have influenced the results even though we cross-validated the network. Thus, although we presented a promising method for extracting features and classifying breast density, a greater database is

  8. Structural principles in network glasses

    International Nuclear Information System (INIS)

    Boolchand, P.

    1986-01-01

    Substantial progress in decoding the structure of network glasses has taken place in the past few years. Crucial insights into the molecular structure of glasses have emerged by application of Raman bond and Moessbauer site spectroscopy. In this context, the complimentary role of each spectroscopy as a check on the interpretation of the other, is perhaps one of the more significant developments in the field. New advances in the theory of the subject have also taken place. It is thus appropriate to inquire what general principles if any, have emerged on the structure of real glasses. The author reviews some of the principal ideas on the structure of inorganic network glasses with the aid of specific examples. (Auth.)

  9. Combining neural networks for protein secondary structure prediction

    DEFF Research Database (Denmark)

    Riis, Søren Kamaric

    1995-01-01

    In this paper structured neural networks are applied to the problem of predicting the secondary structure of proteins. A hierarchical approach is used where specialized neural networks are designed for each structural class and then combined using another neural network. The submodels are designed...... by using a priori knowledge of the mapping between protein building blocks and the secondary structure and by using weight sharing. Since none of the individual networks have more than 600 adjustable weights over-fitting is avoided. When ensembles of specialized experts are combined the performance...

  10. Network structure of subway passenger flows

    Science.gov (United States)

    Xu, Q.; Mao, B. H.; Bai, Y.

    2016-03-01

    The results of transportation infrastructure network analyses have been used to analyze complex networks in a topological context. However, most modeling approaches, including those based on complex network theory, do not fully account for real-life traffic patterns and may provide an incomplete view of network functions. This study utilizes trip data obtained from the Beijing Subway System to characterize individual passenger movement patterns. A directed weighted passenger flow network was constructed from the subway infrastructure network topology by incorporating trip data. The passenger flow networks exhibit several properties that can be characterized by power-law distributions based on flow size, and log-logistic distributions based on the fraction of boarding and departing passengers. The study also characterizes the temporal patterns of in-transit and waiting passengers and provides a hierarchical clustering structure for passenger flows. This hierarchical flow organization varies in the spatial domain. Ten cluster groups were identified, indicating a hierarchical urban polycentric structure composed of large concentrated flows at urban activity centers. These empirical findings provide insights regarding urban human mobility patterns within a large subway network.

  11. Epidemics in adaptive networks with community structure

    Science.gov (United States)

    Shaw, Leah; Tunc, Ilker

    2010-03-01

    Models for epidemic spread on static social networks do not account for changes in individuals' social interactions. Recent studies of adaptive networks have modeled avoidance behavior, as non-infected individuals try to avoid contact with infectives. Such models have not generally included realistic social structure. Here we study epidemic spread on an adaptive network with community structure. We model the effect of heterogeneous communities on infection levels and epidemic extinction. We also show how an epidemic can alter the community structure.

  12. Metagovernance, network structure, and legitimacy

    DEFF Research Database (Denmark)

    Daugbjerg, Carsten; Fawcett, Paul

    2017-01-01

    This article develops a heuristic for comparative governance analysis. The heuristic depicts four network types by combining network structure with the state’s capacity to metagovern. It suggests that each network type produces a particular combination of input and output legitimacy. We illustrate...... the heuristic and its utility using a comparative study of agri-food networks (organic farming and land use) in four countries, which each exhibit different combinations of input and output legitimacy respectively. The article concludes by using a fifth case study to illustrate what a network type that produces...... high levels of input and output legitimacy might look like....

  13. Fracture network topology and characterization of structural permeability

    Science.gov (United States)

    Hansberry, Rowan; King, Rosalind; Holford, Simon

    2017-04-01

    other permeability indicators such as drilling fluid losses, and pore pressure measurements. Initial work with these techniques has led to new developments in our ability to image subsurface faults and fractures at a variety of scales from independent datasets. We establish a strong relationship between features identified using seismic attribute analysis and interpreted natural fractures. However, care must be taken to use these methods in a case-by-case basis, as controls on fracture distribution and orientation can vary significantly with both regional and local influences. These results outline and effective method by which structural permeability can be assessed with existing petroleum datasets. However, unlike the broad stress field, mapping fracture orientation and characteristics within the Australian Continent is complicated as the distribution, geometry, areal extent and connectivity of fracture networks can vary significantly.

  14. Network Structure, Collaborative Context, and Individual Creativity

    DEFF Research Database (Denmark)

    Stea, Diego; Soda, Giuseppe; Pedersen, Torben

    2016-01-01

    Network research has yet to determine whether bonding ties or bridging ties are more beneficial for individual creativity, but the debate has mostly overlooked the organizational context in which such ties are formed. In particular, the causal chain connecting network structures and individual...... with the network’s organizational context. Thus, actors in dense network structures acquire more knowledge and eventually become more creative in organizational contexts where collaboration is high. Conversely, brokers who arbitrage information across disconnected network contacts acquire more valuable knowledge...

  15. Unveiling network-based functional features through integration of gene expression into protein networks.

    Science.gov (United States)

    Jalili, Mahdi; Gebhardt, Tom; Wolkenhauer, Olaf; Salehzadeh-Yazdi, Ali

    2018-06-01

    Decoding health and disease phenotypes is one of the fundamental objectives in biomedicine. Whereas high-throughput omics approaches are available, it is evident that any single omics approach might not be adequate to capture the complexity of phenotypes. Therefore, integrated multi-omics approaches have been used to unravel genotype-phenotype relationships such as global regulatory mechanisms and complex metabolic networks in different eukaryotic organisms. Some of the progress and challenges associated with integrated omics studies have been reviewed previously in comprehensive studies. In this work, we highlight and review the progress, challenges and advantages associated with emerging approaches, integrating gene expression and protein-protein interaction networks to unravel network-based functional features. This includes identifying disease related genes, gene prioritization, clustering protein interactions, developing the modules, extract active subnetworks and static protein complexes or dynamic/temporal protein complexes. We also discuss how these approaches contribute to our understanding of the biology of complex traits and diseases. This article is part of a Special Issue entitled: Cardiac adaptations to obesity, diabetes and insulin resistance, edited by Professors Jan F.C. Glatz, Jason R.B. Dyck and Christine Des Rosiers. Copyright © 2018 Elsevier B.V. All rights reserved.

  16. Memory functions reveal structural properties of gene regulatory networks

    Science.gov (United States)

    Perez-Carrasco, Ruben

    2018-01-01

    Gene regulatory networks (GRNs) control cellular function and decision making during tissue development and homeostasis. Mathematical tools based on dynamical systems theory are often used to model these networks, but the size and complexity of these models mean that their behaviour is not always intuitive and the underlying mechanisms can be difficult to decipher. For this reason, methods that simplify and aid exploration of complex networks are necessary. To this end we develop a broadly applicable form of the Zwanzig-Mori projection. By first converting a thermodynamic state ensemble model of gene regulation into mass action reactions we derive a general method that produces a set of time evolution equations for a subset of components of a network. The influence of the rest of the network, the bulk, is captured by memory functions that describe how the subnetwork reacts to its own past state via components in the bulk. These memory functions provide probes of near-steady state dynamics, revealing information not easily accessible otherwise. We illustrate the method on a simple cross-repressive transcriptional motif to show that memory functions not only simplify the analysis of the subnetwork but also have a natural interpretation. We then apply the approach to a GRN from the vertebrate neural tube, a well characterised developmental transcriptional network composed of four interacting transcription factors. The memory functions reveal the function of specific links within the neural tube network and identify features of the regulatory structure that specifically increase the robustness of the network to initial conditions. Taken together, the study provides evidence that Zwanzig-Mori projections offer powerful and effective tools for simplifying and exploring the behaviour of GRNs. PMID:29470492

  17. Local Area Network Material Accounting System (LANMAS) Functions and Features Overview

    International Nuclear Information System (INIS)

    Robichaux, J.J.

    1998-07-01

    The Local Area Network Material Accounting System (LANMAS) application is a standardized approach to comply with the DOE Order 5633.3B, control and Accountability of Nuclear Material, material accounting requirements. This paper provides a general overview of the functions and features included in the LANMAS application

  18. ECG Identification System Using Neural Network with Global and Local Features

    Science.gov (United States)

    Tseng, Kuo-Kun; Lee, Dachao; Chen, Charles

    2016-01-01

    This paper proposes a human identification system via extracted electrocardiogram (ECG) signals. Two hierarchical classification structures based on global shape feature and local statistical feature is used to extract ECG signals. Global shape feature represents the outline information of ECG signals and local statistical feature extracts the…

  19. Optical implementation of a feature-based neural network with application to automatic target recognition

    Science.gov (United States)

    Chao, Tien-Hsin; Stoner, William W.

    1993-01-01

    An optical neural network based on the neocognitron paradigm is introduced. A novel aspect of the architecture design is shift-invariant multichannel Fourier optical correlation within each processing layer. Multilayer processing is achieved by feeding back the ouput of the feature correlator interatively to the input spatial light modulator and by updating the Fourier filters. By training the neural net with characteristic features extracted from the target images, successful pattern recognition with intraclass fault tolerance and interclass discrimination is achieved. A detailed system description is provided. Experimental demonstrations of a two-layer neural network for space-object discrimination is also presented.

  20. Neural networks and particle physics

    CERN Document Server

    Peterson, Carsten

    1993-01-01

    1. Introduction : Structure of the Central Nervous System Generics2. Feed-forward networks, Perceptions, Function approximators3. Self-organisation, Feature Maps4. Feed-back Networks, The Hopfield model, Optimization problems, Feed-back, Networks, Deformable templates, Graph bisection

  1. Exploring network structure, dynamics, and function using networkx

    Energy Technology Data Exchange (ETDEWEB)

    Hagberg, Aric [Los Alamos National Laboratory; Swart, Pieter [Los Alamos National Laboratory; S Chult, Daniel [COLGATE UNIV

    2008-01-01

    NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides data structures for representing many types of networks, or graphs, including simple graphs, directed graphs, and graphs with parallel edges and self loops. The nodes in NetworkX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibility mades NetworkX ideal for representing networks found in many different scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network properties and structure measures: shortest paths, betweenness centrality, clustering, and degree distribution and many more. NetworkX can read and write various graph formats for eash exchange with existing data, and provides generators for many classic graphs and popular graph models, such as the Erdoes-Renyi, Small World, and Barabasi-Albert models, are included. The ease-of-use and flexibility of the Python programming language together with connection to the SciPy tools make NetworkX a powerful tool for scientific computations. We discuss some of our recent work studying synchronization of coupled oscillators to demonstrate how NetworkX enables research in the field of computational networks.

  2. Multi-Level and Multi-Scale Feature Aggregation Using Pretrained Convolutional Neural Networks for Music Auto-Tagging

    Science.gov (United States)

    Lee, Jongpil; Nam, Juhan

    2017-08-01

    Music auto-tagging is often handled in a similar manner to image classification by regarding the 2D audio spectrogram as image data. However, music auto-tagging is distinguished from image classification in that the tags are highly diverse and have different levels of abstractions. Considering this issue, we propose a convolutional neural networks (CNN)-based architecture that embraces multi-level and multi-scaled features. The architecture is trained in three steps. First, we conduct supervised feature learning to capture local audio features using a set of CNNs with different input sizes. Second, we extract audio features from each layer of the pre-trained convolutional networks separately and aggregate them altogether given a long audio clip. Finally, we put them into fully-connected networks and make final predictions of the tags. Our experiments show that using the combination of multi-level and multi-scale features is highly effective in music auto-tagging and the proposed method outperforms previous state-of-the-arts on the MagnaTagATune dataset and the Million Song Dataset. We further show that the proposed architecture is useful in transfer learning.

  3. Density-based and transport-based core-periphery structures in networks.

    Science.gov (United States)

    Lee, Sang Hoon; Cucuringu, Mihai; Porter, Mason A

    2014-03-01

    Networks often possess mesoscale structures, and studying them can yield insights into both structure and function. It is most common to study community structure, but numerous other types of mesoscale structures also exist. In this paper, we examine core-periphery structures based on both density and transport. In such structures, core network components are well-connected both among themselves and to peripheral components, which are not well-connected to anything. We examine core-periphery structures in a wide range of examples of transportation, social, and financial networks-including road networks in large urban areas, a rabbit warren, a dolphin social network, a European interbank network, and a migration network between counties in the United States. We illustrate that a recently developed transport-based notion of node coreness is very useful for characterizing transportation networks. We also generalize this notion to examine core versus peripheral edges, and we show that the resulting diagnostic is also useful for transportation networks. To examine the properties of transportation networks further, we develop a family of generative models of roadlike networks. We illustrate the effect of the dimensionality of the embedding space on transportation networks, and we demonstrate that the correlations between different measures of coreness can be very different for different types of networks.

  4. FeatureMap3D - a tool to map protein features and sequence conservation onto homologous structures in the PDB

    DEFF Research Database (Denmark)

    Wernersson, Rasmus; Rapacki, Krzysztof; Stærfeldt, Hans Henrik

    2006-01-01

    FeatureMap3D is a web-based tool that maps protein features onto 3D structures. The user provides sequences annotated with any feature of interest, such as post-translational modifications, protease cleavage sites or exonic structure and FeatureMap3D will then search the Protein Data Bank (PDB) f...

  5. Learning and structure of neuronal networks

    Indian Academy of Sciences (India)

    structures, protein–protein interaction networks, social interactions, the Internet, and so on can be described by complex networks [1–5]. Recent developments in the understanding of complex networks has led to deeper insights about their origin and other properties [1–5]. One common realization that emerges from these ...

  6. A Mapping Between Structural and Functional Brain Networks.

    Science.gov (United States)

    Meier, Jil; Tewarie, Prejaas; Hillebrand, Arjan; Douw, Linda; van Dijk, Bob W; Stufflebeam, Steven M; Van Mieghem, Piet

    2016-05-01

    The relationship between structural and functional brain networks is still highly debated. Most previous studies have used a single functional imaging modality to analyze this relationship. In this work, we use multimodal data, from functional MRI, magnetoencephalography, and diffusion tensor imaging, and assume that there exists a mapping between the connectivity matrices of the resting-state functional and structural networks. We investigate this mapping employing group averaged as well as individual data. We indeed find a significantly high goodness of fit level for this structure-function mapping. Our analysis suggests that a functional connection is shaped by all walks up to the diameter in the structural network in both modality cases. When analyzing the inverse mapping, from function to structure, longer walks in the functional network also seem to possess minor influence on the structural connection strengths. Even though similar overall properties for the structure-function mapping are found for different functional modalities, our results indicate that the structure-function relationship is modality dependent.

  7. Electrochemically Smart Bimetallic Materials Featuring Group 11 Metals: In-situ Conductive Network Generation and Its Impact on Cell Capacity

    Energy Technology Data Exchange (ETDEWEB)

    Takeuchi, Esther [Stony Brook Univ., NY (United States)

    2016-11-30

    Our results for this program “Electrochemically smart bimetallic materials featuring Group 11 metals: in-situ conductive matrix generation and its impact on battery capacity, power and reversibility” have been highly successful: 1) we demonstrated material structures which generated in-situ conductive networks through electrochemical activation with increases in conductivity up to 10,000 fold, 2) we pioneered in situ analytical methodology to map the cathodes at several stages of discharge through the use of Energy Dispersive X-ray Diffraction (EDXRD) to elucidate the kinetic dependence of the conductive network formation, and 3) we successfully designed synthetic methodology for direct control of material properties including crystallite size and surface area which showed significant impact on electrochemical behavior.

  8. Nonparametric inference of network structure and dynamics

    Science.gov (United States)

    Peixoto, Tiago P.

    The network structure of complex systems determine their function and serve as evidence for the evolutionary mechanisms that lie behind them. Despite considerable effort in recent years, it remains an open challenge to formulate general descriptions of the large-scale structure of network systems, and how to reliably extract such information from data. Although many approaches have been proposed, few methods attempt to gauge the statistical significance of the uncovered structures, and hence the majority cannot reliably separate actual structure from stochastic fluctuations. Due to the sheer size and high-dimensionality of many networks, this represents a major limitation that prevents meaningful interpretations of the results obtained with such nonstatistical methods. In this talk, I will show how these issues can be tackled in a principled and efficient fashion by formulating appropriate generative models of network structure that can have their parameters inferred from data. By employing a Bayesian description of such models, the inference can be performed in a nonparametric fashion, that does not require any a priori knowledge or ad hoc assumptions about the data. I will show how this approach can be used to perform model comparison, and how hierarchical models yield the most appropriate trade-off between model complexity and quality of fit based on the statistical evidence present in the data. I will also show how this general approach can be elegantly extended to networks with edge attributes, that are embedded in latent spaces, and that change in time. The latter is obtained via a fully dynamic generative network model, based on arbitrary-order Markov chains, that can also be inferred in a nonparametric fashion. Throughout the talk I will illustrate the application of the methods with many empirical networks such as the internet at the autonomous systems level, the global airport network, the network of actors and films, social networks, citations among

  9. 3DProIN: Protein-Protein Interaction Networks and Structure Visualization.

    Science.gov (United States)

    Li, Hui; Liu, Chunmei

    2014-06-14

    3DProIN is a computational tool to visualize protein-protein interaction networks in both two dimensional (2D) and three dimensional (3D) view. It models protein-protein interactions in a graph and explores the biologically relevant features of the tertiary structures of each protein in the network. Properties such as color, shape and name of each node (protein) of the network can be edited in either 2D or 3D views. 3DProIN is implemented using 3D Java and C programming languages. The internet crawl technique is also used to parse dynamically grasped protein interactions from protein data bank (PDB). It is a java applet component that is embedded in the web page and it can be used on different platforms including Linux, Mac and Window using web browsers such as Firefox, Internet Explorer, Chrome and Safari. It also was converted into a mac app and submitted to the App store as a free app. Mac users can also download the app from our website. 3DProIN is available for academic research at http://bicompute.appspot.com.

  10. Feature Extraction and Fusion Using Deep Convolutional Neural Networks for Face Detection

    Directory of Open Access Journals (Sweden)

    Xiaojun Lu

    2017-01-01

    Full Text Available This paper proposes a method that uses feature fusion to represent images better for face detection after feature extraction by deep convolutional neural network (DCNN. First, with Clarifai net and VGG Net-D (16 layers, we learn features from data, respectively; then we fuse features extracted from the two nets. To obtain more compact feature representation and mitigate computation complexity, we reduce the dimension of the fused features by PCA. Finally, we conduct face classification by SVM classifier for binary classification. In particular, we exploit offset max-pooling to extract features with sliding window densely, which leads to better matches of faces and detection windows; thus the detection result is more accurate. Experimental results show that our method can detect faces with severe occlusion and large variations in pose and scale. In particular, our method achieves 89.24% recall rate on FDDB and 97.19% average precision on AFW.

  11. True Nature of Supply Network Communication Structure (P.1-14

    Directory of Open Access Journals (Sweden)

    Lokhman Hakim bin Osman

    2017-02-01

    Full Text Available Globalization of world economy has altered the definition of organizational structure. Global supply chain can no longer be viewed as an arm-length structure. It has become more complex. The complexity demands deeper research and understanding. This research analyzed a structure of supply network in an attempt to elucidate the true structure of the supply network. Using the quantitative Social Network Analysis methodology, findings of this study indicated that, the structure of the supply network differs depending on the types of network relations. An important implication of these findings would be a more focus resource management upon network relationship development that is based on firms’ positions in the different network structure. This research also contributes to the various strategies of effective and efficient supply chain management.Keywords: Supply Chain Management, Network Studies, Inter-Organizational Relations, Social Capital

  12. Inferring network structure from cascades

    Science.gov (United States)

    Ghonge, Sushrut; Vural, Dervis Can

    2017-07-01

    Many physical, biological, and social phenomena can be described by cascades taking place on a network. Often, the activity can be empirically observed, but not the underlying network of interactions. In this paper we offer three topological methods to infer the structure of any directed network given a set of cascade arrival times. Our formulas hold for a very general class of models where the activation probability of a node is a generic function of its degree and the number of its active neighbors. We report high success rates for synthetic and real networks, for several different cascade models.

  13. Industrial entrepreneurial network: Structural and functional analysis

    Science.gov (United States)

    Medvedeva, M. A.; Davletbaev, R. H.; Berg, D. B.; Nazarova, J. J.; Parusheva, S. S.

    2016-12-01

    Structure and functioning of two model industrial entrepreneurial networks are investigated in the present paper. One of these networks is forming when implementing an integrated project and consists of eight agents, which interact with each other and external environment. The other one is obtained from the municipal economy and is based on the set of the 12 real business entities. Analysis of the networks is carried out on the basis of the matrix of mutual payments aggregated over the certain time period. The matrix is created by the methods of experimental economics. Social Network Analysis (SNA) methods and instruments were used in the present research. The set of basic structural characteristics was investigated: set of quantitative parameters such as density, diameter, clustering coefficient, different kinds of centrality, and etc. They were compared with the random Bernoulli graphs of the corresponding size and density. Discovered variations of random and entrepreneurial networks structure are explained by the peculiarities of agents functioning in production network. Separately, were identified the closed exchange circuits (cyclically closed contours of graph) forming an autopoietic (self-replicating) network pattern. The purpose of the functional analysis was to identify the contribution of the autopoietic network pattern in its gross product. It was found that the magnitude of this contribution is more than 20%. Such value allows using of the complementary currency in order to stimulate economic activity of network agents.

  14. Dynamical community structure of populations evolving on genotype networks

    International Nuclear Information System (INIS)

    Capitán, José A.; Aguirre, Jacobo; Manrubia, Susanna

    2015-01-01

    Neutral evolutionary dynamics of replicators occurs on large and heterogeneous networks of genotypes. These networks, formed by all genotypes that yield the same phenotype, have a complex architecture that conditions the molecular composition of populations and their movements on genome spaces. Here we consider as an example the case of populations evolving on RNA secondary structure neutral networks and study the community structure of the network revealed through dynamical properties of the population at equilibrium and during adaptive transients. We unveil a rich hierarchical community structure that, eventually, can be traced back to the non-trivial relationship between RNA secondary structure and sequence composition. We demonstrate that usual measures of modularity that only take into account the static, topological structure of networks, cannot identify the community structure disclosed by population dynamics

  15. Structural design principles of complex bird songs: a network-based approach.

    Directory of Open Access Journals (Sweden)

    Kazutoshi Sasahara

    Full Text Available Bird songs are acoustic communication signals primarily used in male-male aggression and in male-female attraction. These are often monotonous patterns composed of a few phrases, yet some birds have extremely complex songs with a large phrase repertoire, organized in non-random fashion with discernible patterns. Since structure is typically associated with function, the structures of complex bird songs provide important clues to the evolution of animal communication systems. Here we propose an efficient network-based approach to explore structural design principles of complex bird songs, in which the song networks--transition relationships among different phrases and the related structural measures--are employed. We demonstrate how this approach works with an example using California Thrasher songs, which are sequences of highly varied phrases delivered in succession over several minutes. These songs display two distinct features: a large phrase repertoire with a 'small-world' architecture, in which subsets of phrases are highly grouped and linked with a short average path length; and a balanced transition diversity amongst phrases, in which deterministic and non-deterministic transition patterns are moderately mixed. We explore the robustness of this approach with variations in sample size and the amount of noise. Our approach enables a more quantitative study of global and local structural properties of complex bird songs than has been possible to date.

  16. Comparing success levels of different neural network structures in extracting discriminative information from the response patterns of a temperature-modulated resistive gas sensor

    Science.gov (United States)

    Hosseini-Golgoo, S. M.; Bozorgi, H.; Saberkari, A.

    2015-06-01

    Performances of three neural networks, consisting of a multi-layer perceptron, a radial basis function, and a neuro-fuzzy network with local linear model tree training algorithm, in modeling and extracting discriminative features from the response patterns of a temperature-modulated resistive gas sensor are quantitatively compared. For response pattern recording, a voltage staircase containing five steps each with a 20 s plateau is applied to the micro-heater of the sensor, when 12 different target gases, each at 11 concentration levels, are present. In each test, the hidden layer neuron weights are taken as the discriminatory feature vector of the target gas. These vectors are then mapped to a 3D feature space using linear discriminant analysis. The discriminative information content of the feature vectors are determined by the calculation of the Fisher’s discriminant ratio, affording quantitative comparison among the success rates achieved by the different neural network structures. The results demonstrate a superior discrimination ratio for features extracted from local linear neuro-fuzzy and radial-basis-function networks with recognition rates of 96.27% and 90.74%, respectively.

  17. Comparing success levels of different neural network structures in extracting discriminative information from the response patterns of a temperature-modulated resistive gas sensor

    International Nuclear Information System (INIS)

    Hosseini-Golgoo, S M; Bozorgi, H; Saberkari, A

    2015-01-01

    Performances of three neural networks, consisting of a multi-layer perceptron, a radial basis function, and a neuro-fuzzy network with local linear model tree training algorithm, in modeling and extracting discriminative features from the response patterns of a temperature-modulated resistive gas sensor are quantitatively compared. For response pattern recording, a voltage staircase containing five steps each with a 20 s plateau is applied to the micro-heater of the sensor, when 12 different target gases, each at 11 concentration levels, are present. In each test, the hidden layer neuron weights are taken as the discriminatory feature vector of the target gas. These vectors are then mapped to a 3D feature space using linear discriminant analysis. The discriminative information content of the feature vectors are determined by the calculation of the Fisher’s discriminant ratio, affording quantitative comparison among the success rates achieved by the different neural network structures. The results demonstrate a superior discrimination ratio for features extracted from local linear neuro-fuzzy and radial-basis-function networks with recognition rates of 96.27% and 90.74%, respectively. (paper)

  18. Critical features of coupling parameter in synchronization of small world neural networks

    International Nuclear Information System (INIS)

    Li Yanlong; Ma Jun; Xu Wenke; Li Hongbo; Wu Min

    2008-01-01

    The critical features of a coupling parameter in the synchronization of small world neural networks are investigated. A power law decay form is observed in this spatially extended system, the larger linked degree becomes, the larger critical coupling intensity. There exists maximal and minimal critical coupling intensity for synchronization in the extended system. An approximate synchronization diagram has been constructed. In the case of partial coupling, a primary result is presented about the critical coupling fraction for various linked degree of networks

  19. Communication on the structure of biological networks

    Indian Academy of Sciences (India)

    Introduction. Over the past few years, network science has drawn attention from a large number of ... The qualitative properties of biological networks cannot ... Here, we study the underlying undirected structure of empirical biological networks.

  20. Developing a network-level structural capacity index for structural evaluation of pavements.

    Science.gov (United States)

    2013-03-01

    The objective of this project was to develop a structural index for use in network-level pavement evaluation to facilitate : the inclusion of the pavements structural condition in pavement management applications. The primary goal of network-level...

  1. Neural Networks for protein Structure Prediction

    DEFF Research Database (Denmark)

    Bohr, Henrik

    1998-01-01

    This is a review about neural network applications in bioinformatics. Especially the applications to protein structure prediction, e.g. prediction of secondary structures, prediction of surface structure, fold class recognition and prediction of the 3-dimensional structure of protein backbones...

  2. Hierarchy Measure for Complex Networks

    Science.gov (United States)

    Mones, Enys; Vicsek, Lilla; Vicsek, Tamás

    2012-01-01

    Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges). Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy. Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network. We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. Results for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure. PMID:22470477

  3. Community structure in networks of functional connectivity: resolving functional organization in the rat brain with pharmacological MRI.

    Science.gov (United States)

    Schwarz, Adam J; Gozzi, Alessandro; Bifone, Angelo

    2009-08-01

    In the study of functional connectivity, fMRI data can be represented mathematically as a network of nodes and links, where image voxels represent the nodes and the connections between them reflect a degree of correlation or similarity in their response. Here we show that, within this framework, functional imaging data can be partitioned into 'communities' of tightly interconnected voxels corresponding to maximum modularity within the overall network. We evaluated this approach systematically in application to networks constructed from pharmacological MRI (phMRI) of the rat brain in response to acute challenge with three different compounds with distinct mechanisms of action (d-amphetamine, fluoxetine, and nicotine) as well as vehicle (physiological saline). This approach resulted in bilaterally symmetric sub-networks corresponding to meaningful anatomical and functional connectivity pathways consistent with the purported mechanism of action of each drug. Interestingly, common features across all three networks revealed two groups of tightly coupled brain structures that responded as functional units independent of the specific neurotransmitter systems stimulated by the drug challenge, including a network involving the prefrontal cortex and sub-cortical regions extending from the striatum to the amygdala. This finding suggests that each of these networks includes general underlying features of the functional organization of the rat brain.

  4. Abnormalities in the structural covariance of emotion regulation networks in major depressive disorder.

    Science.gov (United States)

    Wu, Huawang; Sun, Hui; Wang, Chao; Yu, Lin; Li, Yilan; Peng, Hongjun; Lu, Xiaobing; Hu, Qingmao; Ning, Yuping; Jiang, Tianzi; Xu, Jinping; Wang, Jiaojian

    2017-01-01

    Major depressive disorder (MDD) is a common psychiatric disorder that is characterized by cognitive deficits and affective symptoms. To date, an increasing number of neuroimaging studies have focused on emotion regulation and have consistently shown that emotion dysregulation is one of the central features and underlying mechanisms of MDD. Although gray matter morphological abnormalities in regions within emotion regulation networks have been identified in MDD, the interactions and relationships between these gray matter structures remain largely unknown. Thus, in this study, we adopted a structural covariance method based on gray matter volume to investigate the brain morphological abnormalities within the emotion regulation networks in a large cohort of 65 MDD patients and 65 age- and gender-matched healthy controls. A permutation test with p covariance connectivity strengths between MDD patients and healthy controls. The structural covariance analysis revealed an increased correlation strength of gray matter volume between the left angular gyrus and the left amygdala and between the right angular gyrus and the right amygdala, as well as a decreased correlation strength of the gray matter volume between the right angular gyrus and the posterior cingulate cortex in MDD. Our findings support the notion that emotion dysregulation is an underlying mechanism of MDD by revealing disrupted structural covariance patterns in the emotion regulation network. Copyright © 2016 Elsevier Ltd. All rights reserved.

  5. Phase synchronization on small-world networks with community structure

    International Nuclear Information System (INIS)

    Xiao-Hua, Wang; Li-Cheng, Jiao; Jian-She, Wu

    2010-01-01

    In this paper, we propose a simple model that can generate small-world network with community structure. The network is introduced as a tunable community organization with parameter r, which is directly measured by the ratio of inter- to intra-community connectivity, and a smaller r corresponds to a stronger community structure. The structure properties, including the degree distribution, clustering, the communication efficiency and modularity are also analysed for the network. In addition, by using the Kuramoto model, we investigated the phase synchronization on this network, and found that increasing the fuzziness of community structure will markedly enhance the network synchronizability; however, in an abnormal region (r ≤ 0.001), the network has even worse synchronizability than the case of isolated communities (r = 0). Furthermore, this network exhibits a remarkable synchronization behaviour in topological scales: the oscillators of high densely interconnected communities synchronize more easily, and more rapidly than the whole network. (general)

  6. Towards an Efficient Artificial Neural Network Pruning and Feature Ranking Tool

    KAUST Repository

    AlShahrani, Mona

    2015-01-01

    Artificial Neural Networks (ANNs) are known to be among the most effective and expressive machine learning models. Their impressive abilities to learn have been reflected in many broad application domains such as image recognition, medical diagnosis, online banking, robotics, dynamic systems, and many others. ANNs with multiple layers of complex non-linear transformations (a.k.a Deep ANNs) have shown recently successful results in the area of computer vision and speech recognition. ANNs are parametric models that approximate unknown functions in which parameter values (weights) are adapted during training. ANN’s weights can be large in number and thus render the trained model more complex with chances for “overfitting” training data. In this study, we explore the effects of network pruning on performance of ANNs and ranking of features that describe the data. Simplified ANN model results in fewer parameters, less computation and faster training. We investigate the use of Hessian-based pruning algorithms as well as simpler ones (i.e. non Hessian-based) on nine datasets with varying number of input features and ANN parameters. The Hessian-based Optimal Brain Surgeon algorithm (OBS) is robust but slow. Therefore a faster parallel Hessian- approximation is provided. An additional speedup is provided using a variant we name ‘Simple n Optimal Brain Surgeon’ (SNOBS), which represents a good compromise between robustness and time efficiency. For some of the datasets, the ANN pruning experiments show on average 91% reduction in the number of ANN parameters and about 60% - 90% in the number of ANN input features, while maintaining comparable or better accuracy to the case when no pruning is applied. Finally, we show through a comprehensive comparison with seven state-of-the art feature filtering methods that the feature selection and ranking obtained as a byproduct of the ANN pruning is comparable in accuracy to these methods.

  7. Towards an Efficient Artificial Neural Network Pruning and Feature Ranking Tool

    KAUST Repository

    AlShahrani, Mona

    2015-05-24

    Artificial Neural Networks (ANNs) are known to be among the most effective and expressive machine learning models. Their impressive abilities to learn have been reflected in many broad application domains such as image recognition, medical diagnosis, online banking, robotics, dynamic systems, and many others. ANNs with multiple layers of complex non-linear transformations (a.k.a Deep ANNs) have shown recently successful results in the area of computer vision and speech recognition. ANNs are parametric models that approximate unknown functions in which parameter values (weights) are adapted during training. ANN’s weights can be large in number and thus render the trained model more complex with chances for “overfitting” training data. In this study, we explore the effects of network pruning on performance of ANNs and ranking of features that describe the data. Simplified ANN model results in fewer parameters, less computation and faster training. We investigate the use of Hessian-based pruning algorithms as well as simpler ones (i.e. non Hessian-based) on nine datasets with varying number of input features and ANN parameters. The Hessian-based Optimal Brain Surgeon algorithm (OBS) is robust but slow. Therefore a faster parallel Hessian- approximation is provided. An additional speedup is provided using a variant we name ‘Simple n Optimal Brain Surgeon’ (SNOBS), which represents a good compromise between robustness and time efficiency. For some of the datasets, the ANN pruning experiments show on average 91% reduction in the number of ANN parameters and about 60% - 90% in the number of ANN input features, while maintaining comparable or better accuracy to the case when no pruning is applied. Finally, we show through a comprehensive comparison with seven state-of-the art feature filtering methods that the feature selection and ranking obtained as a byproduct of the ANN pruning is comparable in accuracy to these methods.

  8. Probabilistic diffusion tractography reveals improvement of structural network in musicians.

    Directory of Open Access Journals (Sweden)

    Jianfu Li

    Full Text Available PURPOSE: Musicians experience a large amount of information transfer and integration of complex sensory, motor, and auditory processes when training and playing musical instruments. Therefore, musicians are a useful model in which to investigate neural adaptations in the brain. METHODS: Here, based on diffusion-weighted imaging, probabilistic tractography was used to determine the architecture of white matter anatomical networks in musicians and non-musicians. Furthermore, the features of the white matter networks were analyzed using graph theory. RESULTS: Small-world properties of the white matter network were observed in both groups. Compared with non-musicians, the musicians exhibited significantly increased connectivity strength in the left and right supplementary motor areas, the left calcarine fissure and surrounding cortex and the right caudate nucleus, as well as a significantly larger weighted clustering coefficient in the right olfactory cortex, the left medial superior frontal gyrus, the right gyrus rectus, the left lingual gyrus, the left supramarginal gyrus, and the right pallidum. Furthermore, there were differences in the node betweenness centrality in several regions. However, no significant differences in topological properties were observed at a global level. CONCLUSIONS: We illustrated preliminary findings to extend the network level understanding of white matter plasticity in musicians who have had long-term musical training. These structural, network-based findings may indicate that musicians have enhanced information transmission efficiencies in local white matter networks that are related to musical training.

  9. The structural and functional brain networks that support human social networks.

    Science.gov (United States)

    Noonan, M P; Mars, R B; Sallet, J; Dunbar, R I M; Fellows, L K

    2018-02-20

    Social skills rely on a specific set of cognitive processes, raising the possibility that individual differences in social networks are related to differences in specific brain structural and functional networks. Here, we tested this hypothesis with multimodality neuroimaging. With diffusion MRI (DMRI), we showed that differences in structural integrity of particular white matter (WM) tracts, including cingulum bundle, extreme capsule and arcuate fasciculus were associated with an individual's social network size (SNS). A voxel-based morphology analysis demonstrated correlations between gray matter (GM) volume and SNS in limbic and temporal lobe regions. These structural changes co-occured with functional network differences. As a function of SNS, dorsomedial and dorsolateral prefrontal cortex showed altered resting-state functional connectivity with the default mode network (DMN). Finally, we integrated these three complementary methods, interrogating the relationship between social GM clusters and specific WM and resting-state networks (RSNs). Probabilistic tractography seeded in these GM nodes utilized the SNS-related WM pathways. Further, the spatial and functional overlap between the social GM clusters and the DMN was significantly closer than other control RSNs. These integrative analyses provide convergent evidence of the role of specific circuits in SNS, likely supporting the adaptive behavior necessary for success in extensive social environments. Crown Copyright © 2018. Published by Elsevier B.V. All rights reserved.

  10. Reconstructing consensus Bayesian network structures with application to learning molecular interaction networks

    NARCIS (Netherlands)

    Fröhlich, H.; Klau, G.W.

    2013-01-01

    Bayesian Networks are an established computational approach for data driven network inference. However, experimental data is limited in its availability and corrupted by noise. This leads to an unavoidable uncertainty about the correct network structure. Thus sampling or bootstrap based strategies

  11. Structural Properties of the Brazilian Air Transportation Network.

    Science.gov (United States)

    Couto, Guilherme S; da Silva, Ana Paula Couto; Ruiz, Linnyer B; Benevenuto, Fabrício

    2015-09-01

    The air transportation network in a country has a great impact on the local, national and global economy. In this paper, we analyze the air transportation network in Brazil with complex network features to better understand its characteristics. In our analysis, we built networks composed either by national or by international flights. We also consider the network when both types of flights are put together. Interesting conclusions emerge from our analysis. For instance, Viracopos Airport (Campinas City) is the most central and connected airport on the national flights network. Any operational problem in this airport separates the Brazilian national network into six distinct subnetworks. Moreover, the Brazilian air transportation network exhibits small world characteristics and national connections network follows a power law distribution. Therefore, our analysis sheds light on the current Brazilian air transportation infrastructure, bringing a novel understanding that may help face the recent fast growth in the usage of the Brazilian transport network.

  12. Structural Properties of the Brazilian Air Transportation Network

    Directory of Open Access Journals (Sweden)

    GUILHERME S. COUTO

    2015-09-01

    Full Text Available The air transportation network in a country has a great impact on the local, national and global economy. In this paper, we analyze the air transportation network in Brazil with complex network features to better understand its characteristics. In our analysis, we built networks composed either by national or by international flights. We also consider the network when both types of flights are put together. Interesting conclusions emerge from our analysis. For instance, Viracopos Airport (Campinas City is the most central and connected airport on the national flights network. Any operational problem in this airport separates the Brazilian national network into six distinct subnetworks. Moreover, the Brazilian air transportation network exhibits small world characteristics and national connections network follows a power law distribution. Therefore, our analysis sheds light on the current Brazilian air transportation infrastructure, bringing a novel understanding that may help face the recent fast growth in the usage of the Brazilian transport network.

  13. NeuroCharter: A Neural Networks Software to Visually Discover the Effects and Contributions between Interrelated Features

    Directory of Open Access Journals (Sweden)

    Mohammad N. Elnesr

    2017-09-01

    Full Text Available NeuroCharter is an open-source software that helps in prediction problems in scientific research through artificial neural networks. The program is designed mainly for researchers who focus on details of the neural-network’s parameters, in addition to easy reuse of the trained network. The program outputs almost all the necessary graphs regarding the network and features contributions and relative outputs for both numeric and categorical features. The program was implemented in Python 2.7.11 and is open sourced for reuse and future development. The program consists of four main classes, one for the neural networks calculation, one for data manipulation, one for plotting the neural network, and the main class that manages and links the other classes. The source code and some experimental data are freely available at the GitHub code repository http://j.mp/NeuroCharter.   Funding Statement: The project was financially supported by King Saud University, Vice Deanship of Research Chairs.

  14. Error and attack tolerance of synchronization in Hindmarsh–Rose neural networks with community structure

    International Nuclear Information System (INIS)

    Li, Chun-Hsien; Yang, Suh-Yuh

    2014-01-01

    Synchronization is one of the most important features observed in large-scale complex networks of interacting dynamical systems. As is well known, there is a close relation between the network topology and the network synchronizability. Using the coupled Hindmarsh–Rose neurons with community structure as a model network, in this paper we explore how failures of the nodes due to random errors or intentional attacks affect the synchronizability of community networks. The intentional attacks are realized by removing a fraction of the nodes with high values in some centrality measure such as the centralities of degree, eigenvector, betweenness and closeness. According to the master stability function method, we employ the algebraic connectivity of the considered community network as an indicator to examine the network synchronizability. Numerical evidences show that the node failure strategy based on the betweenness centrality has the most influence on the synchronizability of community networks. With this node failure strategy for a given network with a fixed number of communities, we find that the larger the degree of communities, the worse the network synchronizability; however, for a given network with a fixed degree of communities, we observe that the more the number of communities, the better the network synchronizability.

  15. Bayesian Network Webserver: a comprehensive tool for biological network modeling.

    Science.gov (United States)

    Ziebarth, Jesse D; Bhattacharya, Anindya; Cui, Yan

    2013-11-01

    The Bayesian Network Webserver (BNW) is a platform for comprehensive network modeling of systems genetics and other biological datasets. It allows users to quickly and seamlessly upload a dataset, learn the structure of the network model that best explains the data and use the model to understand relationships between network variables. Many datasets, including those used to create genetic network models, contain both discrete (e.g. genotype) and continuous (e.g. gene expression traits) variables, and BNW allows for modeling hybrid datasets. Users of BNW can incorporate prior knowledge during structure learning through an easy-to-use structural constraint interface. After structure learning, users are immediately presented with an interactive network model, which can be used to make testable hypotheses about network relationships. BNW, including a downloadable structure learning package, is available at http://compbio.uthsc.edu/BNW. (The BNW interface for adding structural constraints uses HTML5 features that are not supported by current version of Internet Explorer. We suggest using other browsers (e.g. Google Chrome or Mozilla Firefox) when accessing BNW). ycui2@uthsc.edu. Supplementary data are available at Bioinformatics online.

  16. Disentangling bipartite and core-periphery structure in financial networks

    International Nuclear Information System (INIS)

    Barucca, Paolo; Lillo, Fabrizio

    2016-01-01

    A growing number of systems are represented as networks whose architecture conveys significant information and determines many of their properties. Examples of network architecture include modular, bipartite, and core-periphery structures. However inferring the network structure is a non trivial task and can depend sometimes on the chosen null model. Here we propose a method for classifying network structures and ranking its nodes in a statistically well-grounded fashion. The method is based on the use of Belief Propagation for learning through Entropy Maximization on both the Stochastic Block Model (SBM) and the degree-corrected Stochastic Block Model (dcSBM). As a specific application we show how the combined use of the two ensembles—SBM and dcSBM—allows to disentangle the bipartite and the core-periphery structure in the case of the e-MID interbank network. Specifically we find that, taking into account the degree, this interbank network is better described by a bipartite structure, while using the SBM the core-periphery structure emerges only when data are aggregated for more than a week.

  17. Structural stability of interaction networks against negative external fields

    Science.gov (United States)

    Yoon, S.; Goltsev, A. V.; Mendes, J. F. F.

    2018-04-01

    We explore structural stability of weighted and unweighted networks of positively interacting agents against a negative external field. We study how the agents support the activity of each other to confront the negative field, which suppresses the activity of agents and can lead to collapse of the whole network. The competition between the interactions and the field shape the structure of stable states of the system. In unweighted networks (uniform interactions) the stable states have the structure of k -cores of the interaction network. The interplay between the topology and the distribution of weights (heterogeneous interactions) impacts strongly the structural stability against a negative field, especially in the case of fat-tailed distributions of weights. We show that apart from critical slowing down there is also a critical change in the system structure that precedes the network collapse. The change can serve as an early warning of the critical transition. To characterize changes of network structure we develop a method based on statistical analysis of the k -core organization and so-called "corona" clusters belonging to the k -cores.

  18. The Global Network of Biofuel Sustainability Standards-setters

    DEFF Research Database (Denmark)

    Henriksen, Lasse Folke

    2015-01-01

    the relevance of incorporating in the current attributional conception of hybridity a network element, taking seriously the role of network structure in shaping regulatory fields. Social Network Analysis as an analytical tool holds great potential for further research into the structural features of hybrid...

  19. Feature extraction with deep neural networks by a generalized discriminant analysis.

    Science.gov (United States)

    Stuhlsatz, André; Lippel, Jens; Zielke, Thomas

    2012-04-01

    We present an approach to feature extraction that is a generalization of the classical linear discriminant analysis (LDA) on the basis of deep neural networks (DNNs). As for LDA, discriminative features generated from independent Gaussian class conditionals are assumed. This modeling has the advantages that the intrinsic dimensionality of the feature space is bounded by the number of classes and that the optimal discriminant function is linear. Unfortunately, linear transformations are insufficient to extract optimal discriminative features from arbitrarily distributed raw measurements. The generalized discriminant analysis (GerDA) proposed in this paper uses nonlinear transformations that are learnt by DNNs in a semisupervised fashion. We show that the feature extraction based on our approach displays excellent performance on real-world recognition and detection tasks, such as handwritten digit recognition and face detection. In a series of experiments, we evaluate GerDA features with respect to dimensionality reduction, visualization, classification, and detection. Moreover, we show that GerDA DNNs can preprocess truly high-dimensional input data to low-dimensional representations that facilitate accurate predictions even if simple linear predictors or measures of similarity are used.

  20. Influence of choice of null network on small-world parameters of structural correlation networks.

    Directory of Open Access Journals (Sweden)

    S M Hadi Hosseini

    Full Text Available In recent years, coordinated variations in brain morphology (e.g., volume, thickness have been employed as a measure of structural association between brain regions to infer large-scale structural correlation networks. Recent evidence suggests that brain networks constructed in this manner are inherently more clustered than random networks of the same size and degree. Thus, null networks constructed by randomizing topology are not a good choice for benchmarking small-world parameters of these networks. In the present report, we investigated the influence of choice of null networks on small-world parameters of gray matter correlation networks in healthy individuals and survivors of acute lymphoblastic leukemia. Three types of null networks were studied: 1 networks constructed by topology randomization (TOP, 2 networks matched to the distributional properties of the observed covariance matrix (HQS, and 3 networks generated from correlation of randomized input data (COR. The results revealed that the choice of null network not only influences the estimated small-world parameters, it also influences the results of between-group differences in small-world parameters. In addition, at higher network densities, the choice of null network influences the direction of group differences in network measures. Our data suggest that the choice of null network is quite crucial for interpretation of group differences in small-world parameters of structural correlation networks. We argue that none of the available null models is perfect for estimation of small-world parameters for correlation networks and the relative strengths and weaknesses of the selected model should be carefully considered with respect to obtained network measures.

  1. Influence of Choice of Null Network on Small-World Parameters of Structural Correlation Networks

    Science.gov (United States)

    Hosseini, S. M. Hadi; Kesler, Shelli R.

    2013-01-01

    In recent years, coordinated variations in brain morphology (e.g., volume, thickness) have been employed as a measure of structural association between brain regions to infer large-scale structural correlation networks. Recent evidence suggests that brain networks constructed in this manner are inherently more clustered than random networks of the same size and degree. Thus, null networks constructed by randomizing topology are not a good choice for benchmarking small-world parameters of these networks. In the present report, we investigated the influence of choice of null networks on small-world parameters of gray matter correlation networks in healthy individuals and survivors of acute lymphoblastic leukemia. Three types of null networks were studied: 1) networks constructed by topology randomization (TOP), 2) networks matched to the distributional properties of the observed covariance matrix (HQS), and 3) networks generated from correlation of randomized input data (COR). The results revealed that the choice of null network not only influences the estimated small-world parameters, it also influences the results of between-group differences in small-world parameters. In addition, at higher network densities, the choice of null network influences the direction of group differences in network measures. Our data suggest that the choice of null network is quite crucial for interpretation of group differences in small-world parameters of structural correlation networks. We argue that none of the available null models is perfect for estimation of small-world parameters for correlation networks and the relative strengths and weaknesses of the selected model should be carefully considered with respect to obtained network measures. PMID:23840672

  2. Association between MRI structural features and cognitive measures in pediatric multiple sclerosis

    Science.gov (United States)

    Amoroso, N.; Bellotti, R.; Fanizzi, A.; Lombardi, A.; Monaco, A.; Liguori, M.; Margari, L.; Simone, M.; Viterbo, R. G.; Tangaro, S.

    2017-09-01

    Multiple sclerosis (MS) is an inflammatory and demyelinating disease associated with neurodegenerative processes that lead to brain structural changes. The disease affects mostly young adults, but 3-5% of cases has a pediatric onset (POMS). Magnetic Resonance Imaging (MRI) is generally used for diagnosis and follow-up in MS patients, however the most common MRI measures (e.g. new or enlarging T2-weighted lesions, T1-weighted gadolinium- enhancing lesions) have often failed as surrogate markers of MS disability and progression. MS is clinically heterogenous with symptoms that can include both physical changes (such as visual loss or walking difficulties) and cognitive impairment. 30-50% of POMS experience prominent cognitive dysfunction. In order to investigate the association between cognitive measures and brain morphometry, in this work we present a fully automated pipeline for processing and analyzing MRI brain scans. Relevant anatomical structures are segmented with FreeSurfer; besides, statistical features are computed. Thus, we describe the data referred to 12 patients with early POMS (mean age at MRI: 15.5 +/- 2.7 years) with a set of 181 structural features. The major cognitive abilities measured are verbal and visuo-spatial learning, expressive language and complex attention. Data was collected at the Department of Basic Sciences, Neurosciences and Sense Organs, University of Bari, and exploring different abilities like the verbal and visuo-spatial learning, expressive language and complex attention. Different regression models and parameter configurations are explored to assess the robustness of the results, in particular Generalized Linear Models, Bayes Regression, Random Forests, Support Vector Regression and Artificial Neural Networks are discussed.

  3. The effects of topology on the structural, dynamic and mechanical properties of network-forming materials

    International Nuclear Information System (INIS)

    Wilson, Mark

    2012-01-01

    The effects of network topology on the static structural, mechanical and dynamic properties of MX 2 network-forming liquids (with tetrahedral short-range order) are discussed. The network topology is controlled via a single model parameter (the anion polarizability) which effectively constrains the inter-tetrahedral linkages in a physically transparent manner. Critically, it is found to control the balance between the stability of corner- and edge-sharing tetrahedra. A potential rigidity transformation is investigated. The vibrational density of states is investigated, using an instantaneous normal model analysis, as a function of both anion polarizability and temperature. A low frequency peak is seen to appear and is shown to be correlated with the fraction of cations which are linked through solely edge-sharing structural motifs. A modified effective mean atom coordination number is proposed which allows the appearance of the low frequency feature to be understood in terms of a mean field rigidity percolation threshold. (paper)

  4. Multilabel user classification using the community structure of online networks.

    Science.gov (United States)

    Rizos, Georgios; Papadopoulos, Symeon; Kompatsiaris, Yiannis

    2017-01-01

    We study the problem of semi-supervised, multi-label user classification of networked data in the online social platform setting. We propose a framework that combines unsupervised community extraction and supervised, community-based feature weighting before training a classifier. We introduce Approximate Regularized Commute-Time Embedding (ARCTE), an algorithm that projects the users of a social graph onto a latent space, but instead of packing the global structure into a matrix of predefined rank, as many spectral and neural representation learning methods do, it extracts local communities for all users in the graph in order to learn a sparse embedding. To this end, we employ an improvement of personalized PageRank algorithms for searching locally in each user's graph structure. Then, we perform supervised community feature weighting in order to boost the importance of highly predictive communities. We assess our method performance on the problem of user classification by performing an extensive comparative study among various recent methods based on graph embeddings. The comparison shows that ARCTE significantly outperforms the competition in almost all cases, achieving up to 35% relative improvement compared to the second best competing method in terms of F1-score.

  5. Multilabel user classification using the community structure of online networks.

    Directory of Open Access Journals (Sweden)

    Georgios Rizos

    Full Text Available We study the problem of semi-supervised, multi-label user classification of networked data in the online social platform setting. We propose a framework that combines unsupervised community extraction and supervised, community-based feature weighting before training a classifier. We introduce Approximate Regularized Commute-Time Embedding (ARCTE, an algorithm that projects the users of a social graph onto a latent space, but instead of packing the global structure into a matrix of predefined rank, as many spectral and neural representation learning methods do, it extracts local communities for all users in the graph in order to learn a sparse embedding. To this end, we employ an improvement of personalized PageRank algorithms for searching locally in each user's graph structure. Then, we perform supervised community feature weighting in order to boost the importance of highly predictive communities. We assess our method performance on the problem of user classification by performing an extensive comparative study among various recent methods based on graph embeddings. The comparison shows that ARCTE significantly outperforms the competition in almost all cases, achieving up to 35% relative improvement compared to the second best competing method in terms of F1-score.

  6. The macroecology of phylogenetically structured hummingbird-plant networks

    DEFF Research Database (Denmark)

    González, Ana M. Martín; Dalsgaard, Bo; Nogues, David Bravo

    2015-01-01

    Aim To investigate the association between hummingbird–plant network structure and species richness, phylogenetic signal on species' interaction pattern, insularity and historical and current climate. Location Fifty-four communities along a c. 10,000 km latitudinal gradient across the Americas (39...... approach, we examined the influence of species richness, phylogenetic signal, insularity and current and historical climate conditions on network structure (null-model-corrected specialization and modularity). Results Phylogenetically related species, especially plants, showed a tendency to interact...... with a similar array of mutualistic partners. The spatial variation in network structure exhibited a constant association with species phylogeny (R2 = 0.18–0.19); however, network structure showed the strongest association with species richness and environmental factors (R2 = 0.20–0.44 and R2 = 0...

  7. Acoustic Event Detection in Multichannel Audio Using Gated Recurrent Neural Networks with High‐Resolution Spectral Features

    Directory of Open Access Journals (Sweden)

    Hyoung‐Gook Kim

    2017-12-01

    Full Text Available Recently, deep recurrent neural networks have achieved great success in various machine learning tasks, and have also been applied for sound event detection. The detection of temporally overlapping sound events in realistic environments is much more challenging than in monophonic detection problems. In this paper, we present an approach to improve the accuracy of polyphonic sound event detection in multichannel audio based on gated recurrent neural networks in combination with auditory spectral features. In the proposed method, human hearing perception‐based spatial and spectral‐domain noise‐reduced harmonic features are extracted from multichannel audio and used as high‐resolution spectral inputs to train gated recurrent neural networks. This provides a fast and stable convergence rate compared to long short‐term memory recurrent neural networks. Our evaluation reveals that the proposed method outperforms the conventional approaches.

  8. Controlling infectious disease through the targeted manipulation of contact network structure

    Directory of Open Access Journals (Sweden)

    M. Carolyn Gates

    2015-09-01

    Full Text Available Individuals in human and animal populations are linked through dynamic contact networks with characteristic structural features that drive the epidemiology of directly transmissible infectious diseases. Using animal movement data from the British cattle industry as an example, this analysis explores whether disease dynamics can be altered by placing targeted restrictions on contact formation to reconfigure network topology. This was accomplished using a simple network generation algorithm that combined configuration wiring with stochastic block modelling techniques to preserve the weighted in- and out-degree of individual nodes (farms as well as key demographic characteristics of the individual network connections (movement date, livestock market, and animal production type. We then tested a control strategy based on introducing additional constraints into the network generation algorithm to prevent farms with a high in-degree from selling cattle to farms with a high out-degree as these particular network connections are predicted to have a disproportionately strong role in spreading disease. Results from simple dynamic disease simulation models predicted significantly lower endemic disease prevalences on the trade restricted networks compared to the baseline generated networks. As expected, the relative magnitude of the predicted changes in endemic prevalence was greater for diseases with short infectious periods and low transmission probabilities. Overall, our study findings demonstrate that there is significant potential for controlling multiple infectious diseases simultaneously by manipulating networks to have more epidemiologically favourable topological configurations. Further research is needed to determine whether the economic and social benefits of controlling disease can justify the costs of restricting contact formation.

  9. Controlling infectious disease through the targeted manipulation of contact network structure

    Science.gov (United States)

    Gates, M. Carolyn; Woolhouse, Mark E.J.

    2015-01-01

    Individuals in human and animal populations are linked through dynamic contact networks with characteristic structural features that drive the epidemiology of directly transmissible infectious diseases. Using animal movement data from the British cattle industry as an example, this analysis explores whether disease dynamics can be altered by placing targeted restrictions on contact formation to reconfigure network topology. This was accomplished using a simple network generation algorithm that combined configuration wiring with stochastic block modelling techniques to preserve the weighted in- and out-degree of individual nodes (farms) as well as key demographic characteristics of the individual network connections (movement date, livestock market, and animal production type). We then tested a control strategy based on introducing additional constraints into the network generation algorithm to prevent farms with a high in-degree from selling cattle to farms with a high out-degree as these particular network connections are predicted to have a disproportionately strong role in spreading disease. Results from simple dynamic disease simulation models predicted significantly lower endemic disease prevalences on the trade restricted networks compared to the baseline generated networks. As expected, the relative magnitude of the predicted changes in endemic prevalence was greater for diseases with short infectious periods and low transmission probabilities. Overall, our study findings demonstrate that there is significant potential for controlling multiple infectious diseases simultaneously by manipulating networks to have more epidemiologically favourable topological configurations. Further research is needed to determine whether the economic and social benefits of controlling disease can justify the costs of restricting contact formation. PMID:26342238

  10. Research on Degeneration Model of Neural Network for Deep Groove Ball Bearing Based on Feature Fusion

    Directory of Open Access Journals (Sweden)

    Lijun Zhang

    2018-02-01

    Full Text Available Aiming at the pitting fault of deep groove ball bearing during service, this paper uses the vibration signal of five different states of deep groove ball bearing and extracts the relevant features, then uses a neural network to model the degradation for identifying and classifying the fault type. By comparing the effects of training samples with different capacities through performance indexes such as the accuracy and convergence speed, it is proven that an increase in the sample size can improve the performance of the model. Based on the polynomial fitting principle and Pearson correlation coefficient, fusion features based on the skewness index are proposed, and the performance improvement of the model after incorporating the fusion features is also validated. A comparison of the performance of the support vector machine (SVM model and the neural network model on this dataset is given. The research shows that neural networks have more potential for complex and high-volume datasets.

  11. Learning about the internal structure of categories through classification and feature inference.

    Science.gov (United States)

    Jee, Benjamin D; Wiley, Jennifer

    2014-01-01

    Previous research on category learning has found that classification tasks produce representations that are skewed toward diagnostic feature dimensions, whereas feature inference tasks lead to richer representations of within-category structure. Yet, prior studies often measure category knowledge through tasks that involve identifying only the typical features of a category. This neglects an important aspect of a category's internal structure: how typical and atypical features are distributed within a category. The present experiments tested the hypothesis that inference learning results in richer knowledge of internal category structure than classification learning. We introduced several new measures to probe learners' representations of within-category structure. Experiment 1 found that participants in the inference condition learned and used a wider range of feature dimensions than classification learners. Classification learners, however, were more sensitive to the presence of atypical features within categories. Experiment 2 provided converging evidence that classification learners were more likely to incorporate atypical features into their representations. Inference learners were less likely to encode atypical category features, even in a "partial inference" condition that focused learners' attention on the feature dimensions relevant to classification. Overall, these results are contrary to the hypothesis that inference learning produces superior knowledge of within-category structure. Although inference learning promoted representations that included a broad range of category-typical features, classification learning promoted greater sensitivity to the distribution of typical and atypical features within categories.

  12. Bearing performance degradation assessment based on time-frequency code features and SOM network

    International Nuclear Information System (INIS)

    Zhang, Yan; Tang, Baoping; Han, Yan; Deng, Lei

    2017-01-01

    Bearing performance degradation assessment and prognostics are extremely important in supporting maintenance decision and guaranteeing the system’s reliability. To achieve this goal, this paper proposes a novel feature extraction method for the degradation assessment and prognostics of bearings. Features of time-frequency codes (TFCs) are extracted from the time-frequency distribution using a hybrid procedure based on short-time Fourier transform (STFT) and non-negative matrix factorization (NMF) theory. An alternative way to design the health indicator is investigated by quantifying the similarity between feature vectors using a self-organizing map (SOM) network. On the basis of this idea, a new health indicator called time-frequency code quantification error (TFCQE) is proposed to assess the performance degradation of the bearing. This indicator is constructed based on the bearing real-time behavior and the SOM model that is previously trained with only the TFC vectors under the normal condition. Vibration signals collected from the bearing run-to-failure tests are used to validate the developed method. The comparison results demonstrate the superiority of the proposed TFCQE indicator over many other traditional features in terms of feature quality metrics, incipient degradation identification and achieving accurate prediction. Highlights • Time-frequency codes are extracted to reflect the signals’ characteristics. • SOM network served as a tool to quantify the similarity between feature vectors. • A new health indicator is proposed to demonstrate the whole stage of degradation development. • The method is useful for extracting the degradation features and detecting the incipient degradation. • The superiority of the proposed method is verified using experimental data. (paper)

  13. Unifying Inference of Meso-Scale Structures in Networks.

    Science.gov (United States)

    Tunç, Birkan; Verma, Ragini

    2015-01-01

    Networks are among the most prevalent formal representations in scientific studies, employed to depict interactions between objects such as molecules, neuronal clusters, or social groups. Studies performed at meso-scale that involve grouping of objects based on their distinctive interaction patterns form one of the main lines of investigation in network science. In a social network, for instance, meso-scale structures can correspond to isolated social groupings or groups of individuals that serve as a communication core. Currently, the research on different meso-scale structures such as community and core-periphery structures has been conducted via independent approaches, which precludes the possibility of an algorithmic design that can handle multiple meso-scale structures and deciding which structure explains the observed data better. In this study, we propose a unified formulation for the algorithmic detection and analysis of different meso-scale structures. This facilitates the investigation of hybrid structures that capture the interplay between multiple meso-scale structures and statistical comparison of competing structures, all of which have been hitherto unavailable. We demonstrate the applicability of the methodology in analyzing the human brain network, by determining the dominant organizational structure (communities) of the brain, as well as its auxiliary characteristics (core-periphery).

  14. Unifying Inference of Meso-Scale Structures in Networks.

    Directory of Open Access Journals (Sweden)

    Birkan Tunç

    Full Text Available Networks are among the most prevalent formal representations in scientific studies, employed to depict interactions between objects such as molecules, neuronal clusters, or social groups. Studies performed at meso-scale that involve grouping of objects based on their distinctive interaction patterns form one of the main lines of investigation in network science. In a social network, for instance, meso-scale structures can correspond to isolated social groupings or groups of individuals that serve as a communication core. Currently, the research on different meso-scale structures such as community and core-periphery structures has been conducted via independent approaches, which precludes the possibility of an algorithmic design that can handle multiple meso-scale structures and deciding which structure explains the observed data better. In this study, we propose a unified formulation for the algorithmic detection and analysis of different meso-scale structures. This facilitates the investigation of hybrid structures that capture the interplay between multiple meso-scale structures and statistical comparison of competing structures, all of which have been hitherto unavailable. We demonstrate the applicability of the methodology in analyzing the human brain network, by determining the dominant organizational structure (communities of the brain, as well as its auxiliary characteristics (core-periphery.

  15. Subsidence feature discrimination using deep convolutional neral networks in synthetic aperture radar imagery

    CSIR Research Space (South Africa)

    Schwegmann, Colin P

    2017-07-01

    Full Text Available International Geoscience and Remote Sensing Symposium (IGARSS), 23-28 July 2017, Fort Worth, TX, USA SUBSIDENCE FEATURE DISCRIMINATION USING DEEP CONVOLUTIONAL NEURAL NETWORKS IN SYNTHETIC APERTURE RADAR IMAGERY Schwegmann, Colin P Kleynhans, Waldo...

  16. Network structure of multivariate time series.

    Science.gov (United States)

    Lacasa, Lucas; Nicosia, Vincenzo; Latora, Vito

    2015-10-21

    Our understanding of a variety of phenomena in physics, biology and economics crucially depends on the analysis of multivariate time series. While a wide range tools and techniques for time series analysis already exist, the increasing availability of massive data structures calls for new approaches for multidimensional signal processing. We present here a non-parametric method to analyse multivariate time series, based on the mapping of a multidimensional time series into a multilayer network, which allows to extract information on a high dimensional dynamical system through the analysis of the structure of the associated multiplex network. The method is simple to implement, general, scalable, does not require ad hoc phase space partitioning, and is thus suitable for the analysis of large, heterogeneous and non-stationary time series. We show that simple structural descriptors of the associated multiplex networks allow to extract and quantify nontrivial properties of coupled chaotic maps, including the transition between different dynamical phases and the onset of various types of synchronization. As a concrete example we then study financial time series, showing that a multiplex network analysis can efficiently discriminate crises from periods of financial stability, where standard methods based on time-series symbolization often fail.

  17. Modeling and Detecting Feature Interactions among Integrated Services of Home Network Systems

    Science.gov (United States)

    Igaki, Hiroshi; Nakamura, Masahide

    This paper presents a framework for formalizing and detecting feature interactions (FIs) in the emerging smart home domain. We first establish a model of home network system (HNS), where every networked appliance (or the HNS environment) is characterized as an object consisting of properties and methods. Then, every HNS service is defined as a sequence of method invocations of the appliances. Within the model, we next formalize two kinds of FIs: (a) appliance interactions and (b) environment interactions. An appliance interaction occurs when two method invocations conflict on the same appliance, whereas an environment interaction arises when two method invocations conflict indirectly via the environment. Finally, we propose offline and online methods that detect FIs before service deployment and during execution, respectively. Through a case study with seven practical services, it is shown that the proposed framework is generic enough to capture feature interactions in HNS integrated services. We also discuss several FI resolution schemes within the proposed framework.

  18. Modeling Insurgent Network Structure and Dynamics

    Science.gov (United States)

    Gabbay, Michael; Thirkill-Mackelprang, Ashley

    2010-03-01

    We present a methodology for mapping insurgent network structure based on their public rhetoric. Indicators of cooperative links between insurgent groups at both the leadership and rank-and-file levels are used, such as joint policy statements or joint operations claims. In addition, a targeting policy measure is constructed on the basis of insurgent targeting claims. Network diagrams which integrate these measures of insurgent cooperation and ideology are generated for different periods of the Iraqi and Afghan insurgencies. The network diagrams exhibit meaningful changes which track the evolution of the strategic environment faced by insurgent groups. Correlations between targeting policy and network structure indicate that insurgent targeting claims are aimed at establishing a group identity among the spectrum of rank-and-file insurgency supporters. A dynamical systems model of insurgent alliance formation and factionalism is presented which evolves the relationship between insurgent group dyads as a function of their ideological differences and their current relationships. The ability of the model to qualitatively and quantitatively capture insurgent network dynamics observed in the data is discussed.

  19. Oxide-ion and proton conducting electrolyte materials for clean energy applications: structural and mechanistic features.

    Science.gov (United States)

    Malavasi, Lorenzo; Fisher, Craig A J; Islam, M Saiful

    2010-11-01

    This critical review presents an overview of the various classes of oxide materials exhibiting fast oxide-ion or proton conductivity for use as solid electrolytes in clean energy applications such as solid oxide fuel cells. Emphasis is placed on the relationship between structural and mechanistic features of the crystalline materials and their ion conduction properties. After describing well-established classes such as fluorite- and perovskite-based oxides, new materials and structure-types are presented. These include a variety of molybdate, gallate, apatite silicate/germanate and niobate systems, many of which contain flexible structural networks, and exhibit different defect properties and transport mechanisms to the conventional materials. It is concluded that the rich chemistry of these important systems provides diverse possibilities for developing superior ionic conductors for use as solid electrolytes in fuel cells and related applications. In most cases, a greater atomic-level understanding of the structures, defects and conduction mechanisms is achieved through a combination of experimental and computational techniques (217 references).

  20. Network Properties of the Ensemble of RNA Structures

    Science.gov (United States)

    Clote, Peter; Bayegan, Amir

    2015-01-01

    We describe the first dynamic programming algorithm that computes the expected degree for the network, or graph G = (V, E) of all secondary structures of a given RNA sequence a = a 1, …, a n. Here, the nodes V correspond to all secondary structures of a, while an edge exists between nodes s, t if the secondary structure t can be obtained from s by adding, removing or shifting a base pair. Since secondary structure kinetics programs implement the Gillespie algorithm, which simulates a random walk on the network of secondary structures, the expected network degree may provide a better understanding of kinetics of RNA folding when allowing defect diffusion, helix zippering, and related conformation transformations. We determine the correlation between expected network degree, contact order, conformational entropy, and expected number of native contacts for a benchmarking dataset of RNAs. Source code is available at http://bioinformatics.bc.edu/clotelab/RNAexpNumNbors. PMID:26488894

  1. ADHD classification using bag of words approach on network features

    Science.gov (United States)

    Solmaz, Berkan; Dey, Soumyabrata; Rao, A. Ravishankar; Shah, Mubarak

    2012-02-01

    Attention Deficit Hyperactivity Disorder (ADHD) is receiving lots of attention nowadays mainly because it is one of the common brain disorders among children and not much information is known about the cause of this disorder. In this study, we propose to use a novel approach for automatic classification of ADHD conditioned subjects and control subjects using functional Magnetic Resonance Imaging (fMRI) data of resting state brains. For this purpose, we compute the correlation between every possible voxel pairs within a subject and over the time frame of the experimental protocol. A network of voxels is constructed by representing a high correlation value between any two voxels as an edge. A Bag-of-Words (BoW) approach is used to represent each subject as a histogram of network features; such as the number of degrees per voxel. The classification is done using a Support Vector Machine (SVM). We also investigate the use of raw intensity values in the time series for each voxel. Here, every subject is represented as a combined histogram of network and raw intensity features. Experimental results verified that the classification accuracy improves when the combined histogram is used. We tested our approach on a highly challenging dataset released by NITRC for ADHD-200 competition and obtained promising results. The dataset not only has a large size but also includes subjects from different demography and edge groups. To the best of our knowledge, this is the first paper to propose BoW approach in any functional brain disorder classification and we believe that this approach will be useful in analysis of many brain related conditions.

  2. Neural network-based feature point descriptors for registration of optical and SAR images

    Science.gov (United States)

    Abulkhanov, Dmitry; Konovalenko, Ivan; Nikolaev, Dmitry; Savchik, Alexey; Shvets, Evgeny; Sidorchuk, Dmitry

    2018-04-01

    Registration of images of different nature is an important technique used in image fusion, change detection, efficient information representation and other problems of computer vision. Solving this task using feature-based approaches is usually more complex than registration of several optical images because traditional feature descriptors (SIFT, SURF, etc.) perform poorly when images have different nature. In this paper we consider the problem of registration of SAR and optical images. We train neural network to build feature point descriptors and use RANSAC algorithm to align found matches. Experimental results are presented that confirm the method's effectiveness.

  3. Neutral theory of chemical reaction networks

    International Nuclear Information System (INIS)

    Lee, Sang Hoon; Holme, Petter; Minnhagen, Petter; Bernhardsson, Sebastian; Kim, Beom Jun

    2012-01-01

    To what extent do the characteristic features of a chemical reaction network reflect its purpose and function? In general, one argues that correlations between specific features and specific functions are key to understanding a complex structure. However, specific features may sometimes be neutral and uncorrelated with any system-specific purpose, function or causal chain. Such neutral features are caused by chance and randomness. Here we compare two classes of chemical networks: one that has been subjected to biological evolution (the chemical reaction network of metabolism in living cells) and one that has not (the atmospheric planetary chemical reaction networks). Their degree distributions are shown to share the very same neutral system-independent features. The shape of the broad distributions is to a large extent controlled by a single parameter, the network size. From this perspective, there is little difference between atmospheric and metabolic networks; they are just different sizes of the same random assembling network. In other words, the shape of the degree distribution is a neutral characteristic feature and has no functional or evolutionary implications in itself; it is not a matter of life and death. (paper)

  4. Inferring general relations between network characteristics from specific network ensembles.

    Science.gov (United States)

    Cardanobile, Stefano; Pernice, Volker; Deger, Moritz; Rotter, Stefan

    2012-01-01

    Different network models have been suggested for the topology underlying complex interactions in natural systems. These models are aimed at replicating specific statistical features encountered in real-world networks. However, it is rarely considered to which degree the results obtained for one particular network class can be extrapolated to real-world networks. We address this issue by comparing different classical and more recently developed network models with respect to their ability to generate networks with large structural variability. In particular, we consider the statistical constraints which the respective construction scheme imposes on the generated networks. After having identified the most variable networks, we address the issue of which constraints are common to all network classes and are thus suitable candidates for being generic statistical laws of complex networks. In fact, we find that generic, not model-related dependencies between different network characteristics do exist. This makes it possible to infer global features from local ones using regression models trained on networks with high generalization power. Our results confirm and extend previous findings regarding the synchronization properties of neural networks. Our method seems especially relevant for large networks, which are difficult to map completely, like the neural networks in the brain. The structure of such large networks cannot be fully sampled with the present technology. Our approach provides a method to estimate global properties of under-sampled networks in good approximation. Finally, we demonstrate on three different data sets (C. elegans neuronal network, R. prowazekii metabolic network, and a network of synonyms extracted from Roget's Thesaurus) that real-world networks have statistical relations compatible with those obtained using regression models.

  5. Offspring social network structure predicts fitness in families.

    Science.gov (United States)

    Royle, Nick J; Pike, Thomas W; Heeb, Philipp; Richner, Heinz; Kölliker, Mathias

    2012-12-22

    Social structures such as families emerge as outcomes of behavioural interactions among individuals, and can evolve over time if families with particular types of social structures tend to leave more individuals in subsequent generations. The social behaviour of interacting individuals is typically analysed as a series of multiple dyadic (pair-wise) interactions, rather than a network of interactions among multiple individuals. However, in species where parents feed dependant young, interactions within families nearly always involve more than two individuals simultaneously. Such social networks of interactions at least partly reflect conflicts of interest over the provision of costly parental investment. Consequently, variation in family network structure reflects variation in how conflicts of interest are resolved among family members. Despite its importance in understanding the evolution of emergent properties of social organization such as family life and cooperation, nothing is currently known about how selection acts on the structure of social networks. Here, we show that the social network structure of broods of begging nestling great tits Parus major predicts fitness in families. Although selection at the level of the individual favours large nestlings, selection at the level of the kin-group primarily favours families that resolve conflicts most effectively.

  6. Evolving phenotypic networks in silico.

    Science.gov (United States)

    François, Paul

    2014-11-01

    Evolved gene networks are constrained by natural selection. Their structures and functions are consequently far from being random, as exemplified by the multiple instances of parallel/convergent evolution. One can thus ask if features of actual gene networks can be recovered from evolutionary first principles. I review a method for in silico evolution of small models of gene networks aiming at performing predefined biological functions. I summarize the current implementation of the algorithm, insisting on the construction of a proper "fitness" function. I illustrate the approach on three examples: biochemical adaptation, ligand discrimination and vertebrate segmentation (somitogenesis). While the structure of the evolved networks is variable, dynamics of our evolved networks are usually constrained and present many similar features to actual gene networks, including properties that were not explicitly selected for. In silico evolution can thus be used to predict biological behaviours without a detailed knowledge of the mapping between genotype and phenotype. Copyright © 2014 The Author. Published by Elsevier Ltd.. All rights reserved.

  7. Feature selection for neural network based defect classification of ceramic components using high frequency ultrasound.

    Science.gov (United States)

    Kesharaju, Manasa; Nagarajah, Romesh

    2015-09-01

    The motivation for this research stems from a need for providing a non-destructive testing method capable of detecting and locating any defects and microstructural variations within armour ceramic components before issuing them to the soldiers who rely on them for their survival. The development of an automated ultrasonic inspection based classification system would make possible the checking of each ceramic component and immediately alert the operator about the presence of defects. Generally, in many classification problems a choice of features or dimensionality reduction is significant and simultaneously very difficult, as a substantial computational effort is required to evaluate possible feature subsets. In this research, a combination of artificial neural networks and genetic algorithms are used to optimize the feature subset used in classification of various defects in reaction-sintered silicon carbide ceramic components. Initially wavelet based feature extraction is implemented from the region of interest. An Artificial Neural Network classifier is employed to evaluate the performance of these features. Genetic Algorithm based feature selection is performed. Principal Component Analysis is a popular technique used for feature selection and is compared with the genetic algorithm based technique in terms of classification accuracy and selection of optimal number of features. The experimental results confirm that features identified by Principal Component Analysis lead to improved performance in terms of classification percentage with 96% than Genetic algorithm with 94%. Copyright © 2015 Elsevier B.V. All rights reserved.

  8. Subsurface structures of buried features in the lunar Procellarum region

    Science.gov (United States)

    Wang, Wenrui; Heki, Kosuke

    2017-07-01

    The Gravity Recovery and Interior Laboratory (GRAIL) mission unraveled numbers of features showing strong gravity anomalies without prominent topographic signatures in the lunar Procellarum region. These features, located in different geologic units, are considered to have complex subsurface structures reflecting different evolution processes. By using the GRAIL level-1 data, we estimated the free-air and Bouguer gravity anomalies in several selected regions including such intriguing features. With the three-dimensional inversion technique, we recovered subsurface density structures in these regions.

  9. Road Network Selection Based on Road Hierarchical Structure Control

    Directory of Open Access Journals (Sweden)

    HE Haiwei

    2015-04-01

    Full Text Available A new road network selection method based on hierarchical structure is studied. Firstly, road network is built as strokes which are then classified into hierarchical collections according to the criteria of betweenness centrality value (BC value. Secondly, the hierarchical structure of the strokes is enhanced using structural characteristic identification technique. Thirdly, the importance calculation model was established according to the relationships among the hierarchical structure of the strokes. Finally, the importance values of strokes are got supported with the model's hierarchical calculation, and with which the road network is selected. Tests are done to verify the advantage of this method by comparing it with other common stroke-oriented methods using three kinds of typical road network data. Comparision of the results show that this method had few need to semantic data, and could eliminate the negative influence of edge strokes caused by the criteria of BC value well. So, it is better to maintain the global hierarchical structure of road network, and suitable to meet with the selection of various kinds of road network at the same time.

  10. Uncovering the community structure associated with the diffusion dynamics on networks

    International Nuclear Information System (INIS)

    Cheng, Xue-Qi; Shen, Hua-Wei

    2010-01-01

    As two main focuses of the study of complex networks, the community structure and the dynamics on networks have both attracted much attention in various scientific fields. However, it is still an open question how the community structure is associated with the dynamics on complex networks. In this paper, through investigating the diffusion process taking place on networks, we demonstrate that the intrinsic community structure of networks can be revealed by the stable local equilibrium states of the diffusion process. Furthermore, we show that such community structure can be directly identified through the optimization of the conductance of the network, which measures how easily the diffusion among different communities occurs. Tests on benchmark networks indicate that the conductance optimization method significantly outperforms the modularity optimization methods in identifying the community structure of networks. Applications to real world networks also demonstrate the effectiveness of the conductance optimization method. This work provides insights into the multiple topological scales of complex networks, and the community structure obtained can naturally reflect the diffusion capability of the underlying network

  11. Influence of degree correlations on network structure and stability in protein-protein interaction networks

    Directory of Open Access Journals (Sweden)

    Zimmer Ralf

    2007-08-01

    Full Text Available Abstract Background The existence of negative correlations between degrees of interacting proteins is being discussed since such negative degree correlations were found for the large-scale yeast protein-protein interaction (PPI network of Ito et al. More recent studies observed no such negative correlations for high-confidence interaction sets. In this article, we analyzed a range of experimentally derived interaction networks to understand the role and prevalence of degree correlations in PPI networks. We investigated how degree correlations influence the structure of networks and their tolerance against perturbations such as the targeted deletion of hubs. Results For each PPI network, we simulated uncorrelated, positively and negatively correlated reference networks. Here, a simple model was developed which can create different types of degree correlations in a network without changing the degree distribution. Differences in static properties associated with degree correlations were compared by analyzing the network characteristics of the original PPI and reference networks. Dynamics were compared by simulating the effect of a selective deletion of hubs in all networks. Conclusion Considerable differences between the network types were found for the number of components in the original networks. Negatively correlated networks are fragmented into significantly less components than observed for positively correlated networks. On the other hand, the selective deletion of hubs showed an increased structural tolerance to these deletions for the positively correlated networks. This results in a lower rate of interaction loss in these networks compared to the negatively correlated networks and a decreased disintegration rate. Interestingly, real PPI networks are most similar to the randomly correlated references with respect to all properties analyzed. Thus, although structural properties of networks can be modified considerably by degree

  12. Identification of Non-Linear Structures using Recurrent Neural Networks

    DEFF Research Database (Denmark)

    Kirkegaard, Poul Henning; Nielsen, Søren R. K.; Hansen, H. I.

    Two different partially recurrent neural networks structured as Multi Layer Perceptrons (MLP) are investigated for time domain identification of a non-linear structure.......Two different partially recurrent neural networks structured as Multi Layer Perceptrons (MLP) are investigated for time domain identification of a non-linear structure....

  13. Identification of Non-Linear Structures using Recurrent Neural Networks

    DEFF Research Database (Denmark)

    Kirkegaard, Poul Henning; Nielsen, Søren R. K.; Hansen, H. I.

    1995-01-01

    Two different partially recurrent neural networks structured as Multi Layer Perceptrons (MLP) are investigated for time domain identification of a non-linear structure.......Two different partially recurrent neural networks structured as Multi Layer Perceptrons (MLP) are investigated for time domain identification of a non-linear structure....

  14. On Adding Structure to Unstructured Overlay Networks

    Science.gov (United States)

    Leitão, João; Carvalho, Nuno A.; Pereira, José; Oliveira, Rui; Rodrigues, Luís

    Unstructured peer-to-peer overlay networks are very resilient to churn and topology changes, while requiring little maintenance cost. Therefore, they are an infrastructure to build highly scalable large-scale services in dynamic networks. Typically, the overlay topology is defined by a peer sampling service that aims at maintaining, in each process, a random partial view of peers in the system. The resulting random unstructured topology is suboptimal when a specific performance metric is considered. On the other hand, structured approaches (for instance, a spanning tree) may optimize a given target performance metric but are highly fragile. In fact, the cost for maintaining structures with strong constraints may easily become prohibitive in highly dynamic networks. This chapter discusses different techniques that aim at combining the advantages of unstructured and structured networks. Namely we focus on two distinct approaches, one based on optimizing the overlay and another based on optimizing the gossip mechanism itself.

  15. Internet of Things: Structure, Features and Management

    Directory of Open Access Journals (Sweden)

    Aleksandrovičs Vladislavs

    2016-12-01

    Full Text Available Internet of Things (IoT - a rapidly developing technology today and most likely everyday thing in the future. Numerous devices, computing machines and build-in sensors connected in a single dynamic network continuously receive and exchange information from the outer environment. Huge data clusters are collected and put to use in handmade applications that scrupulously manage and control given objectives. In this way, an interactive technical infrastructure is created, which can oversee and infiltrate any person’s vital processes. Though separately every device and technological solution in the IoT can be known for many years, each architecture is unique and provides new challenges for the network owner. This research aims to investigate IoT general structure and management aspects with the knowledge of which the authors will try to answer a trivial question whether it is possible to comprehensively control such a tremendous structure with the current level of technology.

  16. Modelling the structure of complex networks

    DEFF Research Database (Denmark)

    Herlau, Tue

    networks has been independently studied as mathematical objects in their own right. As such, there has been both an increased demand for statistical methods for complex networks as well as a quickly growing mathematical literature on the subject. In this dissertation we explore aspects of modelling complex....... The next chapters will treat some of the various symmetries, representer theorems and probabilistic structures often deployed in the modelling complex networks, the construction of sampling methods and various network models. The introductory chapters will serve to provide context for the included written...

  17. The global structure of knowledge network

    NARCIS (Netherlands)

    Angelopoulos, Spyros; Lomi, Alessandro

    2017-01-01

    In this paper, we treat patent citations as knowledge networks connecting pieces of formalized knowledge and people, and focus on how ideas are connected, rather than how they are protected. We focus on the global structural properties of formalized knowledge network, and more specifically on the

  18. Identification of input variables for feature based artificial neural networks-saccade detection in EOG recordings.

    Science.gov (United States)

    Tigges, P; Kathmann, N; Engel, R R

    1997-07-01

    Though artificial neural networks (ANN) are excellent tools for pattern recognition problems when signal to noise ratio is low, the identification of decision relevant features for ANN input data is still a crucial issue. The experience of the ANN designer and the existing knowledge and understanding of the problem seem to be the only links for a specific construction. In the present study a backpropagation ANN based on modified raw data inputs showed encouraging results. Investigating the specific influences of prototypical input patterns on a specially designed ANN led to a new sparse and efficient input data presentation. This data coding obtained by a semiautomatic procedure combining existing expert knowledge and the internal representation structures of the raw data based ANN yielded a list of feature vectors, each representing the relevant information for saccade identification. The feature based ANN produced a reduction of the error rate of nearly 40% compared with the raw data ANN. An overall correct classification of 92% of so far unknown data was realized. The proposed method of extracting internal ANN knowledge for the production of a better input data representation is not restricted to EOG recordings, and could be used in various fields of signal analysis.

  19. Network-induced oscillatory behavior in material flow networks and irregular business cycles

    Science.gov (United States)

    Helbing, Dirk; Lämmer, Stefen; Witt, Ulrich; Brenner, Thomas

    2004-11-01

    Network theory is rapidly changing our understanding of complex systems, but the relevance of topological features for the dynamic behavior of metabolic networks, food webs, production systems, information networks, or cascade failures of power grids remains to be explored. Based on a simple model of supply networks, we offer an interpretation of instabilities and oscillations observed in biological, ecological, economic, and engineering systems. We find that most supply networks display damped oscillations, even when their units—and linear chains of these units—behave in a nonoscillatory way. Moreover, networks of damped oscillators tend to produce growing oscillations. This surprising behavior offers, for example, a different interpretation of business cycles and of oscillating or pulsating processes. The network structure of material flows itself turns out to be a source of instability, and cyclical variations are an inherent feature of decentralized adjustments.

  20. Synthesis temperature effect on the structural features and optical absorption of Zn(1-x)Co(x)Al2O4 oxides.

    Science.gov (United States)

    Gaudon, M; Apheceixborde, A; Ménétrier, M; Le Nestour, A; Demourgues, A

    2009-10-05

    Zinc/cobalt aluminates with spinel-type structure were prepared by a polymeric route, leading to a pure phase with controlled grain size. The prepared pigments were characterized by powder X-ray diffraction Rietveld analyses in order to determine structural features, scanning electron microscopy for morphological investigation, helium pycnometry and (27)Al MAS NMR in order to highlight the occurrence of defects inside the structure, and UV-visible-near-IR spectroscopy to identify electronic transitions responsible for the compounds' color. The green-blue coloration of these pigments is known to be dependent on the sample thermal history. Here, for the first time, the Zn(1-x)Co(x)Al(2)O(4) color is newly interpreted. The pigment is green once synthesized at low temperature (i.e., with diminution of the pigment grain size); this variation was attributed to the appearance of a new absorption band located at about 500 nm, linked to a complex network feature involving Co ions in octahedral sites as well as oxygen and cationic vacancies. Hence, this work shows the possibility of easily getting a nonstoichiometric network with an abnormal cationic distribution from "chimie douce" processes with moderate synthesis temperature, and so various colorations for the same composition.

  1. Structure of a randomly grown 2-d network

    DEFF Research Database (Denmark)

    Ajazi, Fioralba; Napolitano, George M.; Turova, Tatyana

    2015-01-01

    We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the parameters of the model the system undergoes in...... in time different phases of the structure. We conclude with a possible explanation of some empirical data on the connections between neurons.......We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the parameters of the model the system undergoes...

  2. Automatic brain MR image denoising based on texture feature-based artificial neural networks.

    Science.gov (United States)

    Chang, Yu-Ning; Chang, Herng-Hua

    2015-01-01

    Noise is one of the main sources of quality deterioration not only for visual inspection but also in computerized processing in brain magnetic resonance (MR) image analysis such as tissue classification, segmentation and registration. Accordingly, noise removal in brain MR images is important for a wide variety of subsequent processing applications. However, most existing denoising algorithms require laborious tuning of parameters that are often sensitive to specific image features and textures. Automation of these parameters through artificial intelligence techniques will be highly beneficial. In the present study, an artificial neural network associated with image texture feature analysis is proposed to establish a predictable parameter model and automate the denoising procedure. In the proposed approach, a total of 83 image attributes were extracted based on four categories: 1) Basic image statistics. 2) Gray-level co-occurrence matrix (GLCM). 3) Gray-level run-length matrix (GLRLM) and 4) Tamura texture features. To obtain the ranking of discrimination in these texture features, a paired-samples t-test was applied to each individual image feature computed in every image. Subsequently, the sequential forward selection (SFS) method was used to select the best texture features according to the ranking of discrimination. The selected optimal features were further incorporated into a back propagation neural network to establish a predictable parameter model. A wide variety of MR images with various scenarios were adopted to evaluate the performance of the proposed framework. Experimental results indicated that this new automation system accurately predicted the bilateral filtering parameters and effectively removed the noise in a number of MR images. Comparing to the manually tuned filtering process, our approach not only produced better denoised results but also saved significant processing time.

  3. Social inheritance can explain the structure of animal social networks

    Science.gov (United States)

    Ilany, Amiyaal; Akçay, Erol

    2016-01-01

    The social network structure of animal populations has major implications for survival, reproductive success, sexual selection and pathogen transmission of individuals. But as of yet, no general theory of social network structure exists that can explain the diversity of social networks observed in nature, and serve as a null model for detecting species and population-specific factors. Here we propose a simple and generally applicable model of social network structure. We consider the emergence of network structure as a result of social inheritance, in which newborns are likely to bond with maternal contacts, and via forming bonds randomly. We compare model output with data from several species, showing that it can generate networks with properties such as those observed in real social systems. Our model demonstrates that important observed properties of social networks, including heritability of network position or assortative associations, can be understood as consequences of social inheritance. PMID:27352101

  4. Advanced network programming principles and techniques : network application programming with Java

    CERN Document Server

    Ciubotaru, Bogdan

    2013-01-01

    Answering the need for an accessible overview of the field, this text/reference presents a manageable introduction to both the theoretical and practical aspects of computer networks and network programming. Clearly structured and easy to follow, the book describes cutting-edge developments in network architectures, communication protocols, and programming techniques and models, supported by code examples for hands-on practice with creating network-based applications. Features: presents detailed coverage of network architectures; gently introduces the reader to the basic ideas underpinning comp

  5. An Evaluation of optional timing/synchronization features to support selection of an optimum design for the DCS digital communication network

    Science.gov (United States)

    Bradley, D. B.; Cain, J. B., III; Williard, M. W.

    1978-01-01

    The task was to evaluate the ability of a set of timing/synchronization subsystem features to provide a set of desirable characteristics for the evolving Defense Communications System digital communications network. The set of features related to the approaches by which timing/synchronization information could be disseminated throughout the network and the manner in which this information could be utilized to provide a synchronized network. These features, which could be utilized in a large number of different combinations, included mutual control, directed control, double ended reference links, independence of clock error measurement and correction, phase reference combining, and self organizing.

  6. Insights into the fold organization of TIM barrel from interaction energy based structure networks.

    Science.gov (United States)

    Vijayabaskar, M S; Vishveshwara, Saraswathi

    2012-01-01

    There are many well-known examples of proteins with low sequence similarity, adopting the same structural fold. This aspect of sequence-structure relationship has been extensively studied both experimentally and theoretically, however with limited success. Most of the studies consider remote homology or "sequence conservation" as the basis for their understanding. Recently "interaction energy" based network formalism (Protein Energy Networks (PENs)) was developed to understand the determinants of protein structures. In this paper we have used these PENs to investigate the common non-covalent interactions and their collective features which stabilize the TIM barrel fold. We have also developed a method of aligning PENs in order to understand the spatial conservation of interactions in the fold. We have identified key common interactions responsible for the conservation of the TIM fold, despite high sequence dissimilarity. For instance, the central beta barrel of the TIM fold is stabilized by long-range high energy electrostatic interactions and low-energy contiguous vdW interactions in certain families. The other interfaces like the helix-sheet or the helix-helix seem to be devoid of any high energy conserved interactions. Conserved interactions in the loop regions around the catalytic site of the TIM fold have also been identified, pointing out their significance in both structural and functional evolution. Based on these investigations, we have developed a novel network based phylogenetic analysis for remote homologues, which can perform better than sequence based phylogeny. Such an analysis is more meaningful from both structural and functional evolutionary perspective. We believe that the information obtained through the "interaction conservation" viewpoint and the subsequently developed method of structure network alignment, can shed new light in the fields of fold organization and de novo computational protein design.

  7. Controlling infectious disease through the targeted manipulation of contact network structure.

    Science.gov (United States)

    Gates, M Carolyn; Woolhouse, Mark E J

    2015-09-01

    Individuals in human and animal populations are linked through dynamic contact networks with characteristic structural features that drive the epidemiology of directly transmissible infectious diseases. Using animal movement data from the British cattle industry as an example, this analysis explores whether disease dynamics can be altered by placing targeted restrictions on contact formation to reconfigure network topology. This was accomplished using a simple network generation algorithm that combined configuration wiring with stochastic block modelling techniques to preserve the weighted in- and out-degree of individual nodes (farms) as well as key demographic characteristics of the individual network connections (movement date, livestock market, and animal production type). We then tested a control strategy based on introducing additional constraints into the network generation algorithm to prevent farms with a high in-degree from selling cattle to farms with a high out-degree as these particular network connections are predicted to have a disproportionately strong role in spreading disease. Results from simple dynamic disease simulation models predicted significantly lower endemic disease prevalences on the trade restricted networks compared to the baseline generated networks. As expected, the relative magnitude of the predicted changes in endemic prevalence was greater for diseases with short infectious periods and low transmission probabilities. Overall, our study findings demonstrate that there is significant potential for controlling multiple infectious diseases simultaneously by manipulating networks to have more epidemiologically favourable topological configurations. Further research is needed to determine whether the economic and social benefits of controlling disease can justify the costs of restricting contact formation. Copyright © 2015 The Authors. Published by Elsevier B.V. All rights reserved.

  8. Synchronization in complex networks with a modular structure.

    Science.gov (United States)

    Park, Kwangho; Lai, Ying-Cheng; Gupte, Saurabh; Kim, Jong-Won

    2006-03-01

    Networks with a community (or modular) structure arise in social and biological sciences. In such a network individuals tend to form local communities, each having dense internal connections. The linkage among the communities is, however, much more sparse. The dynamics on modular networks, for instance synchronization, may be of great social or biological interest. (Here by synchronization we mean some synchronous behavior among the nodes in the network, not, for example, partially synchronous behavior in the network or the synchronizability of the network with some external dynamics.) By using a recent theoretical framework, the master-stability approach originally introduced by Pecora and Carroll in the context of synchronization in coupled nonlinear oscillators, we address synchronization in complex modular networks. We use a prototype model and develop scaling relations for the network synchronizability with respect to variations of some key network structural parameters. Our results indicate that random, long-range links among distant modules is the key to synchronization. As an application we suggest a viable strategy to achieve synchronous behavior in social networks.

  9. A key heterogeneous structure of fractal networks based on inverse renormalization scheme

    Science.gov (United States)

    Bai, Yanan; Huang, Ning; Sun, Lina

    2018-06-01

    Self-similarity property of complex networks was found by the application of renormalization group theory. Based on this theory, network topologies can be classified into universality classes in the space of configurations. In return, through inverse renormalization scheme, a given primitive structure can grow into a pure fractal network, then adding different types of shortcuts, it exhibits different characteristics of complex networks. However, the effect of primitive structure on networks structural property has received less attention. In this paper, we introduce a degree variance index to measure the dispersion of nodes degree in the primitive structure, and investigate the effect of the primitive structure on network structural property quantified by network efficiency. Numerical simulations and theoretical analysis show a primitive structure is a key heterogeneous structure of generated networks based on inverse renormalization scheme, whether or not adding shortcuts, and the network efficiency is positively correlated with degree variance of the primitive structure.

  10. Disentangling the co-structure of multilayer interaction networks: degree distribution and module composition in two-layer bipartite networks.

    Science.gov (United States)

    Astegiano, Julia; Altermatt, Florian; Massol, François

    2017-11-13

    Species establish different interactions (e.g. antagonistic, mutualistic) with multiple species, forming multilayer ecological networks. Disentangling network co-structure in multilayer networks is crucial to predict how biodiversity loss may affect the persistence of multispecies assemblages. Existing methods to analyse multilayer networks often fail to consider network co-structure. We present a new method to evaluate the modular co-structure of multilayer networks through the assessment of species degree co-distribution and network module composition. We focus on modular structure because of its high prevalence among ecological networks. We apply our method to two Lepidoptera-plant networks, one describing caterpillar-plant herbivory interactions and one representing adult Lepidoptera nectaring on flowers, thereby possibly pollinating them. More than 50% of the species established either herbivory or visitation interactions, but not both. These species were over-represented among plants and lepidopterans, and were present in most modules in both networks. Similarity in module composition between networks was high but not different from random expectations. Our method clearly delineates the importance of interpreting multilayer module composition similarity in the light of the constraints imposed by network structure to predict the potential indirect effects of species loss through interconnected modular networks.

  11. Coevolutionary modeling in network formation

    KAUST Repository

    Al-Shyoukh, Ibrahim

    2014-12-03

    Network coevolution, the process of network topology evolution in feedback with dynamical processes over the network nodes, is a common feature of many engineered and natural networks. In such settings, the change in network topology occurs at a comparable time scale to nodal dynamics. Coevolutionary modeling offers the possibility to better understand how and why network structures emerge. For example, social networks can exhibit a variety of structures, ranging from almost uniform to scale-free degree distributions. While current models of network formation can reproduce these structures, coevolutionary modeling can offer a better understanding of the underlying dynamics. This paper presents an overview of recent work on coevolutionary models of network formation, with an emphasis on the following three settings: (i) dynamic flow of benefits and costs, (ii) transient link establishment costs, and (iii) latent preferential attachment.

  12. Coevolutionary modeling in network formation

    KAUST Repository

    Al-Shyoukh, Ibrahim; Chasparis, Georgios; Shamma, Jeff S.

    2014-01-01

    Network coevolution, the process of network topology evolution in feedback with dynamical processes over the network nodes, is a common feature of many engineered and natural networks. In such settings, the change in network topology occurs at a comparable time scale to nodal dynamics. Coevolutionary modeling offers the possibility to better understand how and why network structures emerge. For example, social networks can exhibit a variety of structures, ranging from almost uniform to scale-free degree distributions. While current models of network formation can reproduce these structures, coevolutionary modeling can offer a better understanding of the underlying dynamics. This paper presents an overview of recent work on coevolutionary models of network formation, with an emphasis on the following three settings: (i) dynamic flow of benefits and costs, (ii) transient link establishment costs, and (iii) latent preferential attachment.

  13. Structural Quality of Service in Large-Scale Networks

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup

    , telephony and data. To meet the requirements of the different applications, and to handle the increased vulnerability to failures, the ability to design robust networks providing good Quality of Service is crucial. However, most planning of large-scale networks today is ad-hoc based, leading to highly...... complex networks lacking predictability and global structural properties. The thesis applies the concept of Structural Quality of Service to formulate desirable global properties, and it shows how regular graph structures can be used to obtain such properties.......Digitalization has created the base for co-existence and convergence in communications, leading to an increasing use of multi service networks. This is for example seen in the Fiber To The Home implementations, where a single fiber is used for virtually all means of communication, including TV...

  14. Forged Signature Distinction Using Convolutional Neural Network for Feature Extraction

    Directory of Open Access Journals (Sweden)

    Seungsoo Nam

    2018-01-01

    Full Text Available This paper proposes a dynamic verification scheme for finger-drawn signatures in smartphones. As a dynamic feature, the movement of a smartphone is recorded with accelerometer sensors in the smartphone, in addition to the moving coordinates of the signature. To extract high-level longitudinal and topological features, the proposed scheme uses a convolution neural network (CNN for feature extraction, and not as a conventional classifier. We assume that a CNN trained with forged signatures can extract effective features (called S-vector, which are common in forging activities such as hesitation and delay before drawing the complicated part. The proposed scheme also exploits an autoencoder (AE as a classifier, and the S-vector is used as the input vector to the AE. An AE has high accuracy for the one-class distinction problem such as signature verification, and is also greatly dependent on the accuracy of input data. S-vector is valuable as the input of AE, and, consequently, could lead to improved verification accuracy especially for distinguishing forged signatures. Compared to the previous work, i.e., the MLP-based finger-drawn signature verification scheme, the proposed scheme decreases the equal error rate by 13.7%, specifically, from 18.1% to 4.4%, for discriminating forged signatures.

  15. Structural parameter identifiability analysis for dynamic reaction networks

    DEFF Research Database (Denmark)

    Davidescu, Florin Paul; Jørgensen, Sten Bay

    2008-01-01

    method based on Lie derivatives. The proposed systematic two phase methodology is illustrated on a mass action based model for an enzymatically catalyzed reaction pathway network where only a limited set of variables is measured. The methodology clearly pinpoints the structurally identifiable parameters...... where for a given set of measured variables it is desirable to investigate which parameters may be estimated prior to spending computational effort on the actual estimation. This contribution addresses the structural parameter identifiability problem for the typical case of reaction network models....... The proposed analysis is performed in two phases. The first phase determines the structurally identifiable reaction rates based on reaction network stoichiometry. The second phase assesses the structural parameter identifiability of the specific kinetic rate expressions using a generating series expansion...

  16. Feedback topology and XOR-dynamics in Boolean networks with varying input structure.

    Science.gov (United States)

    Ciandrini, L; Maffi, C; Motta, A; Bassetti, B; Cosentino Lagomarsino, M

    2009-08-01

    We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying gamma , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

  17. Feedback topology and XOR-dynamics in Boolean networks with varying input structure

    Science.gov (United States)

    Ciandrini, L.; Maffi, C.; Motta, A.; Bassetti, B.; Cosentino Lagomarsino, M.

    2009-08-01

    We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter γ . We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying γ , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

  18. HIGH QUALITY FACADE SEGMENTATION BASED ON STRUCTURED RANDOM FOREST, REGION PROPOSAL NETWORK AND RECTANGULAR FITTING

    Directory of Open Access Journals (Sweden)

    K. Rahmani

    2018-05-01

    Full Text Available In this paper we present a pipeline for high quality semantic segmentation of building facades using Structured Random Forest (SRF, Region Proposal Network (RPN based on a Convolutional Neural Network (CNN as well as rectangular fitting optimization. Our main contribution is that we employ features created by the RPN as channels in the SRF.We empirically show that this is very effective especially for doors and windows. Our pipeline is evaluated on two datasets where we outperform current state-of-the-art methods. Additionally, we quantify the contribution of the RPN and the rectangular fitting optimization on the accuracy of the result.

  19. Nuclear Structure and Decay Data (NSDD) network

    International Nuclear Information System (INIS)

    Pronyaev, V.G.

    2001-02-01

    This report provides a brief description of the Nuclear Structure and Decay Data (NSDD) Network in response to a request from the Advisory Group Meeting on ''Co-ordination of the International Network of Nuclear Structure and Decay Data Evaluators'' (IAEA, Vienna, 14-17 December 1998, report IAEA(NDS)-399 (1999)). This report supersedes the special issue of the Nuclear Data Newsletter No. 20 published in November 1994. (author)

  20. Wireless sensor networks for structural health monitoring

    CERN Document Server

    Cao, Jiannong

    2016-01-01

    This brief covers the emerging area of wireless sensor network (WSN)-based structural health monitoring (SHM) systems, and introduces the authors’ WSN-based platform called SenetSHM. It helps the reader differentiate specific requirements of SHM applications from other traditional WSN applications, and demonstrates how these requirements are addressed by using a series of systematic approaches. The brief serves as a practical guide, explaining both the state-of-the-art technologies in domain-specific applications of WSNs, as well as the methodologies used to address the specific requirements for a WSN application. In particular, the brief offers instruction for problem formulation and problem solving based on the authors’ own experiences implementing SenetSHM. Seven concise chapters cover the development of hardware and software design of SenetSHM, as well as in-field experiments conducted while testing the platform. The brief’s exploration of the SenetSHM platform is a valuable feature for civil engine...

  1. Understanding Structural Features of Microbial Lipases–-An Overview

    Directory of Open Access Journals (Sweden)

    John Geraldine Sandana Mala

    2008-01-01

    Full Text Available The structural elucidations of microbial lipases have been of prime interest since the 1980s. Knowledge of structural features plays an important role in designing and engineering lipases for specific purposes. Significant structural data have been presented for few microbial lipases, while, there is still a structure-deficit, that is, most lipase structures are yet to be resolved. A search for ‘lipase structure’ in the RCSB Protein Data Bank ( http://www.rcsb.org/pdb/ returns only 93 hits (as of September 2007 and, the NCBI database ( http://www.ncbi.nlm.nih.gov reports 89 lipase structures as compared to 14719 core nucleotide records. It is therefore worthwhile to consider investigations on the structural analysis of microbial lipases. This review is intended to provide a collection of resources on the instrumental, chemical and bioinformatics approaches for structure analyses. X-ray crystallography is a versatile tool for the structural biochemists and is been exploited till today. The chemical methods of recent interests include molecular modeling and combinatorial designs. Bioinformatics has surged striking interests in protein structural analysis with the advent of innumerable tools. Furthermore, a literature platform of the structural elucidations so far investigated has been presented with detailed descriptions as applicable to microbial lipases. A case study of Candida rugosa lipase (CRL has also been discussed which highlights important structural features also common to most lipases. A general profile of lipase has been vividly described with an overview of lipase research reviewed in the past.

  2. Functional clustering in hippocampal cultures: relating network structure and dynamics

    International Nuclear Information System (INIS)

    Feldt, S; Dzakpasu, R; Olariu, E; Żochowski, M; Wang, J X; Shtrahman, E

    2010-01-01

    In this work we investigate the relationship between gross anatomic structural network properties, neuronal dynamics and the resultant functional structure in dissociated rat hippocampal cultures. Specifically, we studied cultures as they developed under two conditions: the first supporting glial cell growth (high glial group), and the second one inhibiting it (low glial group). We then compared structural network properties and the spatio-temporal activity patterns of the neurons. Differences in dynamics between the two groups could be linked to the impact of the glial network on the neuronal network as the cultures developed. We also implemented a recently developed algorithm called the functional clustering algorithm (FCA) to obtain the resulting functional network structure. We show that this new algorithm is useful for capturing changes in functional network structure as the networks evolve over time. The FCA detects changes in functional structure that are consistent with expected dynamical differences due to the impact of the glial network. Cultures in the high glial group show an increase in global synchronization as the cultures age, while those in the low glial group remain locally synchronized. We additionally use the FCA to quantify the amount of synchronization present in the cultures and show that the total level of synchronization in the high glial group is stronger than in the low glial group. These results indicate an interdependence between the glial and neuronal networks present in dissociated cultures

  3. Structural network heterogeneities and network dynamics: a possible dynamical mechanism for hippocampal memory reactivation.

    Science.gov (United States)

    Jablonski, Piotr; Poe, Gina; Zochowski, Michal

    2007-03-01

    The hippocampus has the capacity for reactivating recently acquired memories and it is hypothesized that one of the functions of sleep reactivation is the facilitation of consolidation of novel memory traces. The dynamic and network processes underlying such a reactivation remain, however, unknown. We show that such a reactivation characterized by local, self-sustained activity of a network region may be an inherent property of the recurrent excitatory-inhibitory network with a heterogeneous structure. The entry into the reactivation phase is mediated through a physiologically feasible regulation of global excitability and external input sources, while the reactivated component of the network is formed through induced network heterogeneities during learning. We show that structural changes needed for robust reactivation of a given network region are well within known physiological parameters.

  4. Impact of environmental inputs on reverse-engineering approach to network structures.

    Science.gov (United States)

    Wu, Jianhua; Sinfield, James L; Buchanan-Wollaston, Vicky; Feng, Jianfeng

    2009-12-04

    Uncovering complex network structures from a biological system is one of the main topic in system biology. The network structures can be inferred by the dynamical Bayesian network or Granger causality, but neither techniques have seriously taken into account the impact of environmental inputs. With considerations of natural rhythmic dynamics of biological data, we propose a system biology approach to reveal the impact of environmental inputs on network structures. We first represent the environmental inputs by a harmonic oscillator and combine them with Granger causality to identify environmental inputs and then uncover the causal network structures. We also generalize it to multiple harmonic oscillators to represent various exogenous influences. This system approach is extensively tested with toy models and successfully applied to a real biological network of microarray data of the flowering genes of the model plant Arabidopsis Thaliana. The aim is to identify those genes that are directly affected by the presence of the sunlight and uncover the interactive network structures associating with flowering metabolism. We demonstrate that environmental inputs are crucial for correctly inferring network structures. Harmonic causal method is proved to be a powerful technique to detect environment inputs and uncover network structures, especially when the biological data exhibit periodic oscillations.

  5. Covariance, correlation matrix, and the multiscale community structure of networks.

    Science.gov (United States)

    Shen, Hua-Wei; Cheng, Xue-Qi; Fang, Bin-Xing

    2010-07-01

    Empirical studies show that real world networks often exhibit multiple scales of topological descriptions. However, it is still an open problem how to identify the intrinsic multiple scales of networks. In this paper, we consider detecting the multiscale community structure of network from the perspective of dimension reduction. According to this perspective, a covariance matrix of network is defined to uncover the multiscale community structure through the translation and rotation transformations. It is proved that the covariance matrix is the unbiased version of the well-known modularity matrix. We then point out that the translation and rotation transformations fail to deal with the heterogeneous network, which is very common in nature and society. To address this problem, a correlation matrix is proposed through introducing the rescaling transformation into the covariance matrix. Extensive tests on real world and artificial networks demonstrate that the correlation matrix significantly outperforms the covariance matrix, identically the modularity matrix, as regards identifying the multiscale community structure of network. This work provides a novel perspective to the identification of community structure and thus various dimension reduction methods might be used for the identification of community structure. Through introducing the correlation matrix, we further conclude that the rescaling transformation is crucial to identify the multiscale community structure of network, as well as the translation and rotation transformations.

  6. Formation Features of the Customer Segments for the Network Organizations in the Smart Era

    Directory of Open Access Journals (Sweden)

    Elena V. Yaroshenko

    2017-01-01

    Full Text Available Modern network society is based on the advances of information era of Smart, connecting information and communication technologies, intellectual resources and new forms of managing in the global electronic space. It leads to domination of network forms of the organization of economic activity. Many experts prove the importance of segmentation process of consumers when developing competitive strategy of the organization. Every company needs a competent segmentation of the customer base, allowing to concentrate the attention on satisfaction of requirements of the most perspective client segments. The network organizations have specific characteristics; therefore, it is important to understand how they can influence on the formation of client profiles. It causes the necessity of the network organizations’ research in terms of management of high-profitable client segments.The aim of this study is to determine the characteristics of the market segmentation and to choose the key customers for the network organizations. This purpose has defined the statement and the solution of the following tasks: to explore characteristic features of the network forms of the organization of economic activity of the companies, their prospects, Smart technologies’ influence on them; to reveal the work importance with different client profiles; to explore the existing methods and tools of formation of key customer segments; to define criteria for selection of key groups; to reveal the characteristics of customer segments’ formation for the network organizations.In the research process, methods of the system analysis, a method of analogies, methods of generalizations, a method of the expert evaluations, methods of classification and clustering were applied.This paper explores the characteristics and principles of functioning of network organizations, the appearance of which is directly linked with the development of Smart society. It shows the influence on the

  7. A neural network model of semantic memory linking feature-based object representation and words.

    Science.gov (United States)

    Cuppini, C; Magosso, E; Ursino, M

    2009-06-01

    Recent theories in cognitive neuroscience suggest that semantic memory is a distributed process, which involves many cortical areas and is based on a multimodal representation of objects. The aim of this work is to extend a previous model of object representation to realize a semantic memory, in which sensory-motor representations of objects are linked with words. The model assumes that each object is described as a collection of features, coded in different cortical areas via a topological organization. Features in different objects are segmented via gamma-band synchronization of neural oscillators. The feature areas are further connected with a lexical area, devoted to the representation of words. Synapses among the feature areas, and among the lexical area and the feature areas are trained via a time-dependent Hebbian rule, during a period in which individual objects are presented together with the corresponding words. Simulation results demonstrate that, during the retrieval phase, the network can deal with the simultaneous presence of objects (from sensory-motor inputs) and words (from acoustic inputs), can correctly associate objects with words and segment objects even in the presence of incomplete information. Moreover, the network can realize some semantic links among words representing objects with shared features. These results support the idea that semantic memory can be described as an integrated process, whose content is retrieved by the co-activation of different multimodal regions. In perspective, extended versions of this model may be used to test conceptual theories, and to provide a quantitative assessment of existing data (for instance concerning patients with neural deficits).

  8. Effect of dominant features on neural network performance in the classification of mammographic lesions

    International Nuclear Information System (INIS)

    Zhimin Huo; Giger, M.L.; Metz, C.E.

    1999-01-01

    Two different classifiers, an artificial neural network (Ann) and a hybrid system (one step rule-based method followed by an artificial neural network) have been investigated to merge computer-extracted features in the task of differentiating between malignant and benign masses. A database consisting of 65 cases (38 malignant and 26 benign) was used in the study. A total of four computer-extracted features - spiculation, margin sharpness and two density-related measures - was used to characterize these masses. Results from our previous study showed that the hybrid system performed better than the ANN classifier. In our current study, to understand the difference between the two classifiers, we investigated their learning and decision-making processes by studying the relationships between the input features and the outputs. A correlation study showed that the outputs from the ANN-alone method correlated strongly with one of the input features (spiculation), yielding a correlation coefficient of 0.91, whereas the correlation coefficients (absolute value) for the other features ranged from 0.19 to 0.40. This strong correlation between the ANN output and spiculation measure indicates that the learning and decision-making processes of the ANN-alone method were dominated by the spiculation measure. Three-dimensional plots of the computer output as functions of the input features demonstrate that the ANN-alone method did not learn as effectively as the hybrid system in differentiating non-spiculated malignant masses from benign masses, thus resulting in an inferior performance at the high sensitivity levels. We found that with a limited database it is detrimental for an ANN to learn the significance of other features in the presence of a dominant feature. The hybrid system, which initially applied a rule concerning the value of the spiculation measure prior to employing an ANN, prevents over-learning from the dominant feature and performed better than the ANN-alone method

  9. Beyond E-business : towards networked structures

    NARCIS (Netherlands)

    Grefen, P.W.P.J.

    2015-01-01

    In Beyond E-Business: Towards Networked Structures Paul Grefen returns with his tried and tested BOAT framework for e-business, now fully expanded and updated with the very latest overview of digitally connected business; from business models, organization structures and architecture, to information

  10. Distill: a suite of web servers for the prediction of one-, two- and three-dimensional structural features of proteins

    Directory of Open Access Journals (Sweden)

    Walsh Ian

    2006-09-01

    Full Text Available Abstract Background We describe Distill, a suite of servers for the prediction of protein structural features: secondary structure; relative solvent accessibility; contact density; backbone structural motifs; residue contact maps at 6, 8 and 12 Angstrom; coarse protein topology. The servers are based on large-scale ensembles of recursive neural networks and trained on large, up-to-date, non-redundant subsets of the Protein Data Bank. Together with structural feature predictions, Distill includes a server for prediction of Cα traces for short proteins (up to 200 amino acids. Results The servers are state-of-the-art, with secondary structure predicted correctly for nearly 80% of residues (currently the top performance on EVA, 2-class solvent accessibility nearly 80% correct, and contact maps exceeding 50% precision on the top non-diagonal contacts. A preliminary implementation of the predictor of protein Cα traces featured among the top 20 Novel Fold predictors at the last CASP6 experiment as group Distill (ID 0348. The majority of the servers, including the Cα trace predictor, now take into account homology information from the PDB, when available, resulting in greatly improved reliability. Conclusion All predictions are freely available through a simple joint web interface and the results are returned by email. In a single submission the user can send protein sequences for a total of up to 32k residues to all or a selection of the servers. Distill is accessible at the address: http://distill.ucd.ie/distill/.

  11. Mesoscopic structure conditions the emergence of cooperation on social networks.

    Directory of Open Access Journals (Sweden)

    Sergi Lozano

    Full Text Available BACKGROUND: We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. METHODOLOGY/PRINCIPAL FINDINGS: We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement with the observations in both real substrates. CONCLUSION: Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.

  12. Mesoscopic structure conditions the emergence of cooperation on social networks

    Energy Technology Data Exchange (ETDEWEB)

    Lozano, S.; Arenas, A.; Sanchez, A.

    2008-12-01

    We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement with the observations in both real substrates. Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.

  13. Does landscape connectivity shape local and global social network structure in white-tailed deer?

    Directory of Open Access Journals (Sweden)

    Erin L Koen

    Full Text Available Intraspecific social behavior can be influenced by both intrinsic and extrinsic factors. While much research has focused on how characteristics of individuals influence their roles in social networks, we were interested in the role that landscape structure plays in animal sociality at both individual (local and population (global levels. We used female white-tailed deer (Odocoileus virginianus in Illinois, USA, to investigate the potential effect of landscape on social network structure by weighting the edges of seasonal social networks with association rate (based on proximity inferred from GPS collar data. At the local level, we found that sociality among female deer in neighboring social groups (n = 36 was mainly explained by their home range overlap, with two exceptions: 1 during fawning in an area of mixed forest and grassland, deer whose home ranges had low forest connectivity were more social than expected; and 2 during the rut in an area of intensive agriculture, deer inhabiting home ranges with high amount and connectedness of agriculture were more social than expected. At the global scale, we found that deer populations (n = 7 in areas with highly connected forest-agriculture edge, a high proportion of agriculture, and a low proportion of forest tended to have higher weighted network closeness, although low sample size precluded statistical significance. This result implies that infectious disease could spread faster in deer populations inhabiting such landscapes. Our work advances the general understanding of animal social networks, demonstrating how landscape features can underlie differences in social behavior both within and among wildlife social networks.

  14. DeDaL: Cytoscape 3 app for producing and morphing data-driven and structure-driven network layouts.

    Science.gov (United States)

    Czerwinska, Urszula; Calzone, Laurence; Barillot, Emmanuel; Zinovyev, Andrei

    2015-08-14

    Visualization and analysis of molecular profiling data together with biological networks are able to provide new mechanistic insights into biological functions. Currently, it is possible to visualize high-throughput data on top of pre-defined network layouts, but they are not always adapted to a given data analysis task. A network layout based simultaneously on the network structure and the associated multidimensional data might be advantageous for data visualization and analysis in some cases. We developed a Cytoscape app, which allows constructing biological network layouts based on the data from molecular profiles imported as values of node attributes. DeDaL is a Cytoscape 3 app, which uses linear and non-linear algorithms of dimension reduction to produce data-driven network layouts based on multidimensional data (typically gene expression). DeDaL implements several data pre-processing and layout post-processing steps such as continuous morphing between two arbitrary network layouts and aligning one network layout with respect to another one by rotating and mirroring. The combination of all these functionalities facilitates the creation of insightful network layouts representing both structural network features and correlation patterns in multivariate data. We demonstrate the added value of applying DeDaL in several practical applications, including an example of a large protein-protein interaction network. DeDaL is a convenient tool for applying data dimensionality reduction methods and for designing insightful data displays based on data-driven layouts of biological networks, built within Cytoscape environment. DeDaL is freely available for downloading at http://bioinfo-out.curie.fr/projects/dedal/.

  15. Complex modular structure of large-scale brain networks

    Science.gov (United States)

    Valencia, M.; Pastor, M. A.; Fernández-Seara, M. A.; Artieda, J.; Martinerie, J.; Chavez, M.

    2009-06-01

    Modular structure is ubiquitous among real-world networks from related proteins to social groups. Here we analyze the modular organization of brain networks at a large scale (voxel level) extracted from functional magnetic resonance imaging signals. By using a random-walk-based method, we unveil the modularity of brain webs and show modules with a spatial distribution that matches anatomical structures with functional significance. The functional role of each node in the network is studied by analyzing its patterns of inter- and intramodular connections. Results suggest that the modular architecture constitutes the structural basis for the coexistence of functional integration of distant and specialized brain areas during normal brain activities at rest.

  16. Topological properties of complex networks in protein structures

    Science.gov (United States)

    Kim, Kyungsik; Jung, Jae-Won; Min, Seungsik

    2014-03-01

    We study topological properties of networks in structural classification of proteins. We model the native-state protein structure as a network made of its constituent amino-acids and their interactions. We treat four structural classes of proteins composed predominantly of α helices and β sheets and consider several proteins from each of these classes whose sizes range from amino acids of the Protein Data Bank. Particularly, we simulate and analyze the network metrics such as the mean degree, the probability distribution of degree, the clustering coefficient, the characteristic path length, the local efficiency, and the cost. This work was supported by the KMAR and DP under Grant WISE project (153-3100-3133-302-350).

  17. Link prediction in weighted networks

    DEFF Research Database (Denmark)

    Wind, David Kofoed; Mørup, Morten

    2012-01-01

    Many complex networks feature relations with weight information. Some models utilize this information while other ignore the weight information when inferring the structure. In this paper we investigate if edge-weights when modeling real networks, carry important information about the network...... is to infer presence of edges, but that simpler models are better at inferring the actual weights....

  18. Gift-giving and network structure in rural China: utilizing long-term spontaneous gift records.

    Science.gov (United States)

    Chen, Xi

    2014-01-01

    The tradition of keeping written records of gift received during household ceremonies in many countries offers researchers an underutilized means of data collection for social network analysis. This paper first summarizes unique features of the gift record data that circumvent five prevailing sampling and measurement issues in the literature, and we discuss their advantages over existing studies at both the individual level and the dyadic link level using previous data sources. We then document our research project in rural China that implements a multiple wave census-type household survey and a long-term gift record collection. The pattern of gift-giving in major household social events and its recent escalation is analyzed. There are significantly positive correlations between gift network centrality and various forms of informal insurance. Finally, economic inequality and competitive marriage market are among the main demographic and socioeconomic determinants of the observed gift network structure.

  19. Structure of Retail Services in the Brazilian Hosting Network

    Directory of Open Access Journals (Sweden)

    Claudio Zancan

    2015-08-01

    Full Text Available this research has identified Brazilian hosting networks through infrastructure services indicators that it was sold to tourists in organizations that form these networks. The theory consulted the discussion of structural techniques present in Social Network Analysis. The study has three stages: documental research, creation of Tourism database and interviews. The results identified three networks with the highest expression in Brazil formed by hotels, lodges, and resorts. Different char-acteristics of infrastructure and services were observed between hosting networks. Future studies suggest a comparative analysis of structural indicators present in other segments of tourism services, as well as the existing international influ-ence on the development of the Brazilian hosting networks.

  20. Structured chaos shapes spike-response noise entropy in balanced neural networks

    Directory of Open Access Journals (Sweden)

    Guillaume eLajoie

    2014-10-01

    Full Text Available Large networks of sparsely coupled, excitatory and inhibitory cells occur throughout the brain. For many models of these networks, a striking feature is that their dynamics are chaotic and thus, are sensitive to small perturbations. How does this chaos manifest in the neural code? Specifically, how variable are the spike patterns that such a network produces in response to an input signal? To answer this, we derive a bound for a general measure of variability -- spike-train entropy. This leads to important insights on the variability of multi-cell spike pattern distributions in large recurrent networks of spiking neurons responding to fluctuating inputs. The analysis is based on results from random dynamical systems theory and is complemented by detailed numerical simulations. We find that the spike pattern entropy is an order of magnitude lower than what would be extrapolated from single cells. This holds despite the fact that network coupling becomes vanishingly sparse as network size grows -- a phenomenon that depends on ``extensive chaos, as previously discovered for balanced networks without stimulus drive. Moreover, we show how spike pattern entropy is controlled by temporal features of the inputs. Our findings provide insight into how neural networks may encode stimuli in the presence of inherently chaotic dynamics.

  1. Structural Connectivity Networks of Transgender People

    NARCIS (Netherlands)

    Hahn, Andreas; Kranz, Georg S.; Küblböck, Martin; Kaufmann, Ulrike; Ganger, Sebastian; Hummer, Allan; Seiger, Rene; Spies, Marie; Winkler, Dietmar; Kasper, Siegfried; Windischberger, Christian; Swaab, Dick F.; Lanzenberger, Rupert

    2015-01-01

    Although previous investigations of transsexual people have focused on regional brain alterations, evaluations on a network level, especially those structural in nature, are largely missing. Therefore, we investigated the structural connectome of 23 female-to-male (FtM) and 21 male-to-female (MtF)

  2. Building a sense of virtual community: the role of the features of social networking sites.

    Science.gov (United States)

    Chen, Chi-Wen; Lin, Chiun-Sin

    2014-07-01

    In recent years, social networking sites have received increased attention because of the potential of this medium to transform business by building virtual communities. However, theoretical and empirical studies investigating how specific features of social networking sites contribute to building a sense of virtual community (SOVC)-an important dimension of a successful virtual community-are rare. Furthermore, SOVC scales have been developed, and research on this issue has been called for, but few studies have heeded this call. On the basis of prior literature, this study proposes that perceptions of the three most salient features of social networking sites-system quality (SQ), information quality (IQ), and social information exchange (SIE)-play a key role in fostering SOVC. In particular, SQ is proposed to increase IQ and SIE, and SIE is proposed to enhance IQ, both of which thereafter build SOVC. The research model was examined in the context of Facebook, one of the most popular social networking sites in the world. We adopted Blanchard's scales to measure SOVC. Data gathered using a Web-based questionnaire, and analyzed with partial least squares, were utilized to test the model. The results demonstrate that SIE, SQ, and IQ are the factors that form SOVC. The findings also suggest that SQ plays a fundamental role in supporting SIE and IQ in social networking sites. Implications for theory, practice, and future research directions are discussed.

  3. Resolution of Singularities Introduced by Hierarchical Structure in Deep Neural Networks.

    Science.gov (United States)

    Nitta, Tohru

    2017-10-01

    We present a theoretical analysis of singular points of artificial deep neural networks, resulting in providing deep neural network models having no critical points introduced by a hierarchical structure. It is considered that such deep neural network models have good nature for gradient-based optimization. First, we show that there exist a large number of critical points introduced by a hierarchical structure in deep neural networks as straight lines, depending on the number of hidden layers and the number of hidden neurons. Second, we derive a sufficient condition for deep neural networks having no critical points introduced by a hierarchical structure, which can be applied to general deep neural networks. It is also shown that the existence of critical points introduced by a hierarchical structure is determined by the rank and the regularity of weight matrices for a specific class of deep neural networks. Finally, two kinds of implementation methods of the sufficient conditions to have no critical points are provided. One is a learning algorithm that can avoid critical points introduced by the hierarchical structure during learning (called avoidant learning algorithm). The other is a neural network that does not have some critical points introduced by the hierarchical structure as an inherent property (called avoidant neural network).

  4. Disruption of structural covariance networks for language in autism is modulated by verbal ability.

    Science.gov (United States)

    Sharda, Megha; Khundrakpam, Budhachandra S; Evans, Alan C; Singh, Nandini C

    2016-03-01

    The presence of widespread speech and language deficits is a core feature of autism spectrum disorders (ASD). These impairments have often been attributed to altered connections between brain regions. Recent developments in anatomical correlation-based approaches to map structural covariance offer an effective way of studying such connections in vivo. In this study, we employed such a structural covariance network (SCN)-based approach to investigate the integrity of anatomical networks in fronto-temporal brain regions of twenty children with ASD compared to an age and gender-matched control group of twenty-two children. Our findings reflected large-scale disruption of inter and intrahemispheric covariance in left frontal SCNs in the ASD group compared to controls, but no differences in right fronto-temporal SCNs. Interhemispheric covariance in left-seeded networks was further found to be modulated by verbal ability of the participants irrespective of autism diagnosis, suggesting that language function might be related to the strength of interhemispheric structural covariance between frontal regions. Additionally, regional cortical thickening was observed in right frontal and left posterior regions, which was predicted by decreasing symptom severity and increasing verbal ability in ASD. These findings unify reports of regional differences in cortical morphology in ASD. They also suggest that reduced left hemisphere asymmetry and increased frontal growth may not only reflect neurodevelopmental aberrations but also compensatory mechanisms.

  5. A new hierarchical method to find community structure in networks

    Science.gov (United States)

    Saoud, Bilal; Moussaoui, Abdelouahab

    2018-04-01

    Community structure is very important to understand a network which represents a context. Many community detection methods have been proposed like hierarchical methods. In our study, we propose a new hierarchical method for community detection in networks based on genetic algorithm. In this method we use genetic algorithm to split a network into two networks which maximize the modularity. Each new network represents a cluster (community). Then we repeat the splitting process until we get one node at each cluster. We use the modularity function to measure the strength of the community structure found by our method, which gives us an objective metric for choosing the number of communities into which a network should be divided. We demonstrate that our method are highly effective at discovering community structure in both computer-generated and real-world network data.

  6. The Structure of Online Consumer Communication Networks

    NARCIS (Netherlands)

    B.G.C. Dellaert (Benedict); M.J.W. Harmsen-van Hout (Marjolein); P.J.J. Herings (Jean-Jacques)

    2006-01-01

    textabstractIn this paper we study the structure of the bilateral communication links within Online Consumer Communication Networks (OCCNs), such as virtual communities. Compared to the offline world, consumers in online networks are highly flexible to choose their communication partners and little

  7. Modeling Temporal Evolution and Multiscale Structure in Networks

    DEFF Research Database (Denmark)

    Herlau, Tue; Mørup, Morten; Schmidt, Mikkel Nørgaard

    2013-01-01

    Many real-world networks exhibit both temporal evolution and multiscale structure. We propose a model for temporally correlated multifurcating hierarchies in complex networks which jointly capture both effects. We use the Gibbs fragmentation tree as prior over multifurcating trees and a change......-point model to account for the temporal evolution of each vertex. We demonstrate that our model is able to infer time-varying multiscale structure in synthetic as well as three real world time-evolving complex networks. Our modeling of the temporal evolution of hierarchies brings new insights...

  8. The structure of complex networks theory and applications

    CERN Document Server

    Estrada, Ernesto

    2012-01-01

    This book deals with the analysis of the structure of complex networks by combining results from graph theory, physics, and pattern recognition. The book is divided into two parts. 11 chapters are dedicated to the development of theoretical tools for the structural analysis of networks, and 7 chapters are illustrating, in a critical way, applications of these tools to real-world scenarios. The first chapters provide detailed coverage of adjacency and metric and topologicalproperties of networks, followed by chapters devoted to the analysis of individual fragments and fragment-based global inva

  9. On structure-exploiting trust-region regularized nonlinear least squares algorithms for neural-network learning.

    Science.gov (United States)

    Mizutani, Eiji; Demmel, James W

    2003-01-01

    This paper briefly introduces our numerical linear algebra approaches for solving structured nonlinear least squares problems arising from 'multiple-output' neural-network (NN) models. Our algorithms feature trust-region regularization, and exploit sparsity of either the 'block-angular' residual Jacobian matrix or the 'block-arrow' Gauss-Newton Hessian (or Fisher information matrix in statistical sense) depending on problem scale so as to render a large class of NN-learning algorithms 'efficient' in both memory and operation costs. Using a relatively large real-world nonlinear regression application, we shall explain algorithmic strengths and weaknesses, analyzing simulation results obtained by both direct and iterative trust-region algorithms with two distinct NN models: 'multilayer perceptrons' (MLP) and 'complementary mixtures of MLP-experts' (or neuro-fuzzy modular networks).

  10. Multiplex congruence network of natural numbers.

    Science.gov (United States)

    Yan, Xiao-Yong; Wang, Wen-Xu; Chen, Guan-Rong; Shi, Ding-Hua

    2016-03-31

    Congruence theory has many applications in physical, social, biological and technological systems. Congruence arithmetic has been a fundamental tool for data security and computer algebra. However, much less attention was devoted to the topological features of congruence relations among natural numbers. Here, we explore the congruence relations in the setting of a multiplex network and unveil some unique and outstanding properties of the multiplex congruence network. Analytical results show that every layer therein is a sparse and heterogeneous subnetwork with a scale-free topology. Counterintuitively, every layer has an extremely strong controllability in spite of its scale-free structure that is usually difficult to control. Another amazing feature is that the controllability is robust against targeted attacks to critical nodes but vulnerable to random failures, which also differs from ordinary scale-free networks. The multi-chain structure with a small number of chain roots arising from each layer accounts for the strong controllability and the abnormal feature. The multiplex congruence network offers a graphical solution to the simultaneous congruences problem, which may have implication in cryptography based on simultaneous congruences. Our work also gains insight into the design of networks integrating advantages of both heterogeneous and homogeneous networks without inheriting their limitations.

  11. Multi-dimension feature fusion for action recognition

    Science.gov (United States)

    Dong, Pei; Li, Jie; Dong, Junyu; Qi, Lin

    2018-04-01

    Typical human actions last several seconds and exhibit characteristic spatio-temporal structure. The challenge for action recognition is to capture and fuse the multi-dimension information in video data. In order to take into account these characteristics simultaneously, we present a novel method that fuses multiple dimensional features, such as chromatic images, depth and optical flow fields. We built our model based on the multi-stream deep convolutional networks with the help of temporal segment networks and extract discriminative spatial and temporal features by fusing ConvNets towers multi-dimension, in which different feature weights are assigned in order to take full advantage of this multi-dimension information. Our architecture is trained and evaluated on the currently largest and most challenging benchmark NTU RGB-D dataset. The experiments demonstrate that the performance of our method outperforms the state-of-the-art methods.

  12. Structural constraints in complex networks

    International Nuclear Information System (INIS)

    Zhou, S; Mondragon, R J

    2007-01-01

    We present a link rewiring mechanism to produce surrogates of a network where both the degree distribution and the rich-club connectivity are preserved. We consider three real networks, the autonomous system (AS)-Internet, protein interaction and scientific collaboration. We show that for a given degree distribution, the rich-club connectivity is sensitive to the degree-degree correlation, and on the other hand the degree-degree correlation is constrained by the rich-club connectivity. In particular, in the case of the Internet, the assortative coefficient is always negative and a minor change in its value can reverse the network's rich-club structure completely; while fixing the degree distribution and the rich-club connectivity restricts the assortative coefficient to such a narrow range, that a reasonable model of the Internet can be produced by considering mainly the degree distribution and the rich-club connectivity. We also comment on the suitability of using the maximal random network as a null model to assess the rich-club connectivity in real networks

  13. Coevolution of network structure and cooperation in the public goods game

    International Nuclear Information System (INIS)

    Wang Lei; Xia Chengyi; Wang Juan

    2013-01-01

    Recently, the emergence of cooperation has become a central topic in the evolutionary game field, and coevolution of game dynamics and network topology structure can give us a fresh viewpoint of how the network evolves and cooperation arises. In this paper, we show in detail a picture of the co-evolutionary behaviors between the microscopic structure of the network and cooperation promotion in the public goods game (PGG). Based on a mechanism named after evolutionary preferential attachment (EPA), in which the growth of the network depends on the outcome of PGG dynamics, we explore the structural properties of networks and cooperative behaviors taking place on the networks created by EPA rules. Extensive simulation results indicate that the structure of the resulting networks displays a transition from homogeneous to heterogeneous properties as the selection strength ϵ increases, and the cooperative behaviors have a non-trivial state in which cooperators and defectors can simultaneously occupy the hub nodes in the network. Current results are of interest for us to further understand the cooperation persistence and structure evolution in many natural, social and economical systems. (paper)

  14. Degree of contribution (DoC) feature selection algorithm for structural brain MRI volumetric features in depression detection.

    Science.gov (United States)

    Kipli, Kuryati; Kouzani, Abbas Z

    2015-07-01

    Accurate detection of depression at an individual level using structural magnetic resonance imaging (sMRI) remains a challenge. Brain volumetric changes at a structural level appear to have importance in depression biomarkers studies. An automated algorithm is developed to select brain sMRI volumetric features for the detection of depression. A feature selection (FS) algorithm called degree of contribution (DoC) is developed for selection of sMRI volumetric features. This algorithm uses an ensemble approach to determine the degree of contribution in detection of major depressive disorder. The DoC is the score of feature importance used for feature ranking. The algorithm involves four stages: feature ranking, subset generation, subset evaluation, and DoC analysis. The performance of DoC is evaluated on the Duke University Multi-site Imaging Research in the Analysis of Depression sMRI dataset. The dataset consists of 115 brain sMRI scans of 88 healthy controls and 27 depressed subjects. Forty-four sMRI volumetric features are used in the evaluation. The DoC score of forty-four features was determined as the accuracy threshold (Acc_Thresh) was varied. The DoC performance was compared with that of four existing FS algorithms. At all defined Acc_Threshs, DoC outperformed the four examined FS algorithms for the average classification score and the maximum classification score. DoC has a good ability to generate reduced-size subsets of important features that could yield high classification accuracy. Based on the DoC score, the most discriminant volumetric features are those from the left-brain region.

  15. Artificial neural network as the tool in prediction rheological features of raw minced meat.

    Science.gov (United States)

    Balejko, Jerzy A; Nowak, Zbigniew; Balejko, Edyta

    2012-01-01

    The aim of the study was to elaborate a method of modelling and forecasting rheological features which could be applied to raw minced meat at the stage of mixture preparation with a given ingredient composition. The investigated material contained pork and beef meat, pork fat, fat substitutes, ice and curing mixture in various proportions. Seven texture parameters were measured for each sample of raw minced meat. The data obtained were processed using the artificial neural network module in Statistica 9.0 software. The model that reached the lowest training error was a multi-layer perceptron MLP with three neural layers and architecture 7:7-11-7:7. Correlation coefficients between the experimental and calculated values in training, verification and testing subsets were similar and rather high (around 0.65) which indicated good network performance. High percentage of the total variance explained in PCA analysis (73.5%) indicated that the percentage composition of raw minced meat can be successfully used in the prediction of its rheological features. Statistical analysis of the results revealed, that artificial neural network model is able to predict rheological parameters and thus a complete texture profile of raw minced meat.

  16. Robustness and modular structure in networks

    DEFF Research Database (Denmark)

    Bagrow, James P.; Lehmann, Sune; Ahn, Yong-Yeol

    2015-01-01

    -12]. Many complex systems, from power grids and the Internet to the brain and society [13-15], can be modeled using modular networks comprised of small, densely connected groups of nodes [16, 17]. These modules often overlap, with network elements belonging to multiple modules [18, 19]. Yet existing work...... on robustness has not considered the role of overlapping, modular structure. Here we study the robustness of these systems to the failure of elements. We show analytically and empirically that it is possible for the modules themselves to become uncoupled or non-overlapping well before the network disintegrates....... If overlapping modular organization plays a role in overall functionality, networks may be far more vulnerable than predicted by conventional percolation theory....

  17. Cognitive and Social Structure of the Elite Collaboration Network of Astrophysics: A Case Study on Shifting Network Structures

    Science.gov (United States)

    Heidler, Richard

    2011-01-01

    Scientific collaboration can only be understood along the epistemic and cognitive grounding of scientific disciplines. New scientific discoveries in astrophysics led to a major restructuring of the elite network of astrophysics. To study the interplay of the epistemic grounding and the social network structure of a discipline, a mixed-methods…

  18. 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.

  19. Wireless and real-time structural damage detection: A novel decentralized method for wireless sensor networks

    Science.gov (United States)

    Avci, Onur; Abdeljaber, Osama; Kiranyaz, Serkan; Hussein, Mohammed; Inman, Daniel J.

    2018-06-01

    Being an alternative to conventional wired sensors, wireless sensor networks (WSNs) are extensively used in Structural Health Monitoring (SHM) applications. Most of the Structural Damage Detection (SDD) approaches available in the SHM literature are centralized as they require transferring data from all sensors within the network to a single processing unit to evaluate the structural condition. These methods are found predominantly feasible for wired SHM systems; however, transmission and synchronization of huge data sets in WSNs has been found to be arduous. As such, the application of centralized methods with WSNs has been a challenge for engineers. In this paper, the authors are presenting a novel application of 1D Convolutional Neural Networks (1D CNNs) on WSNs for SDD purposes. The SDD is successfully performed completely wireless and real-time under ambient conditions. As a result of this, a decentralized damage detection method suitable for wireless SHM systems is proposed. The proposed method is based on 1D CNNs and it involves training an individual 1D CNN for each wireless sensor in the network in a format where each CNN is assigned to process the locally-available data only, eliminating the need for data transmission and synchronization. The proposed damage detection method operates directly on the raw ambient vibration condition signals without any filtering or preprocessing. Moreover, the proposed approach requires minimal computational time and power since 1D CNNs merge both feature extraction and classification tasks into a single learning block. This ability is prevailingly cost-effective and evidently practical in WSNs considering the hardware systems have been occasionally reported to suffer from limited power supply in these networks. To display the capability and verify the success of the proposed method, large-scale experiments conducted on a laboratory structure equipped with a state-of-the-art WSN are reported.

  20. Structural and Infrastructural Underpinnings of International R&D Networks

    DEFF Research Database (Denmark)

    Niang, Mohamed; Sørensen, Brian Vejrum

    2009-01-01

    This paper explores the process of globally distributing R&D activities with an emphasis on the effects of network maturity. It discusses emerging configurations by asking how the structure and infrastructure of international R&D networks evolve along with the move from a strong R&D center...... to dispersed development. Drawing from case studies of two international R&D networks, it presents a capability maturity model and argues that understanding the interaction between new structures and infrastructures of the dispersed networks has become a key requirement for developing organizational...

  1. Complex network perspective on structure and function of ...

    Indian Academy of Sciences (India)

    of community social networks, which are dense node–node links within modules, but have sparser links between ... 3.2 Bow tie structure. The whole metabolic network of S. aureus is then decomposed into four parts based on the 'bow tie' structure (figure 2, table 2). It should be noted that most nodes in S, P and IS parts are ...

  2. Entropy of network ensembles

    Science.gov (United States)

    Bianconi, Ginestra

    2009-03-01

    In this paper we generalize the concept of random networks to describe network ensembles with nontrivial features by a statistical mechanics approach. This framework is able to describe undirected and directed network ensembles as well as weighted network ensembles. These networks might have nontrivial community structure or, in the case of networks embedded in a given space, they might have a link probability with a nontrivial dependence on the distance between the nodes. These ensembles are characterized by their entropy, which evaluates the cardinality of networks in the ensemble. In particular, in this paper we define and evaluate the structural entropy, i.e., the entropy of the ensembles of undirected uncorrelated simple networks with given degree sequence. We stress the apparent paradox that scale-free degree distributions are characterized by having small structural entropy while they are so widely encountered in natural, social, and technological complex systems. We propose a solution to the paradox by proving that scale-free degree distributions are the most likely degree distribution with the corresponding value of the structural entropy. Finally, the general framework we present in this paper is able to describe microcanonical ensembles of networks as well as canonical or hidden-variable network ensembles with significant implications for the formulation of network-constructing algorithms.

  3. Structural architecture supports functional organization in the human aging brain at a regionwise and network level.

    Science.gov (United States)

    Zimmermann, Joelle; Ritter, Petra; Shen, Kelly; Rothmeier, Simon; Schirner, Michael; McIntosh, Anthony R

    2016-07-01

    Functional interactions in the brain are constrained by the underlying anatomical architecture, and structural and functional networks share network features such as modularity. Accordingly, age-related changes of structural connectivity (SC) may be paralleled by changes in functional connectivity (FC). We provide a detailed qualitative and quantitative characterization of the SC-FC coupling in human aging as inferred from resting-state blood oxygen-level dependent functional magnetic resonance imaging and diffusion-weighted imaging in a sample of 47 adults with an age range of 18-82. We revealed that SC and FC decrease with age across most parts of the brain and there is a distinct age-dependency of regionwise SC-FC coupling and network-level SC-FC relations. A specific pattern of SC-FC coupling predicts age more reliably than does regionwise SC or FC alone (r = 0.73, 95% CI = [0.7093, 0.8522]). Hence, our data propose that regionwise SC-FC coupling can be used to characterize brain changes in aging. Hum Brain Mapp 37:2645-2661, 2016. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

  4. A Hierarchical Dispatch Structure for Distribution Network Pricing

    OpenAIRE

    Yuan, Zhao; Hesamzadeh, Mohammad Reza

    2015-01-01

    This paper presents a hierarchical dispatch structure for efficient distribution network pricing. The dispatch coordination problem in the context of hierarchical network operators are addressed. We formulate decentralized generation dispatch into a bilevel optimization problem in which main network operator and the connected distribution network operator optimize their costs in two levels. By using Karush-Kuhn-Tucker conditions and Fortuny-Amat McCarl linearization, the bilevel optimization ...

  5. Structure-Function Network Mapping and Its Assessment via Persistent Homology

    Science.gov (United States)

    2017-01-01

    Understanding the relationship between brain structure and function is a fundamental problem in network neuroscience. This work deals with the general method of structure-function mapping at the whole-brain level. We formulate the problem as a topological mapping of structure-function connectivity via matrix function, and find a stable solution by exploiting a regularization procedure to cope with large matrices. We introduce a novel measure of network similarity based on persistent homology for assessing the quality of the network mapping, which enables a detailed comparison of network topological changes across all possible thresholds, rather than just at a single, arbitrary threshold that may not be optimal. We demonstrate that our approach can uncover the direct and indirect structural paths for predicting functional connectivity, and our network similarity measure outperforms other currently available methods. We systematically validate our approach with (1) a comparison of regularized vs. non-regularized procedures, (2) a null model of the degree-preserving random rewired structural matrix, (3) different network types (binary vs. weighted matrices), and (4) different brain parcellation schemes (low vs. high resolutions). Finally, we evaluate the scalability of our method with relatively large matrices (2514x2514) of structural and functional connectivity obtained from 12 healthy human subjects measured non-invasively while at rest. Our results reveal a nonlinear structure-function relationship, suggesting that the resting-state functional connectivity depends on direct structural connections, as well as relatively parsimonious indirect connections via polysynaptic pathways. PMID:28046127

  6. Changing organizational structures of jihadist networks in the Netherlands

    NARCIS (Netherlands)

    de Bie, Jasper L.; de Poot, Christianne J.; Freilich, Joshua D.; Chermak, Steven M.

    2017-01-01

    This paper uses Social Network Analysis to study and compare the organizational structures and division of roles of three jihadist networks in the Netherlands. It uses unique longitudinal Dutch police data covering the 2000–2013 period. This study demonstrates how the organizational structures

  7. Individual Search and Social Networks

    OpenAIRE

    Sanjeev Goyal; Stephanie Rosenkranz; Utz Weitzel; Vincent Buskens

    2014-01-01

    The explosion in online social networks motivates an enquiry into their structure and their welfare effects. A central feature of these networks is information sharing: online social networks lower the cost of getting information from others. These lower costs affect the attractiveness of individual search vis-a-vis a reliance on social networks. The paper reports the findings of an experiment on these effects. Our experiment shows that online networks can have large effects. Information acqu...

  8. Structure of the human chromosome interaction network.

    Directory of Open Access Journals (Sweden)

    Sergio Sarnataro

    Full Text Available New Hi-C technologies have revealed that chromosomes have a complex network of spatial contacts in the cell nucleus of higher organisms, whose organisation is only partially understood. Here, we investigate the structure of such a network in human GM12878 cells, to derive a large scale picture of nuclear architecture. We find that the intensity of intra-chromosomal interactions is power-law distributed. Inter-chromosomal interactions are two orders of magnitude weaker and exponentially distributed, yet they are not randomly arranged along the genomic sequence. Intra-chromosomal contacts broadly occur between epigenomically homologous regions, whereas inter-chromosomal contacts are especially associated with regions rich in highly expressed genes. Overall, genomic contacts in the nucleus appear to be structured as a network of networks where a set of strongly individual chromosomal units, as envisaged in the 'chromosomal territory' scenario derived from microscopy, interact with each other via on average weaker, yet far from random and functionally important interactions.

  9. Network features and pathway analyses of a signal transduction cascade

    Directory of Open Access Journals (Sweden)

    Ryoji Yanashima

    2009-05-01

    Full Text Available The scale-free and small-world network models reflect the functional units of networks. However, when we investigated the network properties of a signaling pathway using these models, no significant differences were found between the original undirected graphs and the graphs in which inactive proteins were eliminated from the gene expression data. We analyzed signaling networks by focusing on those pathways that best reflected cellular function. Therefore, our analysis of pathways started from the ligands and progressed to transcription factors and cytoskeletal proteins. We employed the Python module to assess the target network. This involved comparing the original and restricted signaling cascades as a directed graph using microarray gene expression profiles of late onset Alzheimer's disease. The most commonly used method of shortest-path analysis neglects to consider the influences of alternative pathways that can affect the activation of transcription factors or cytoskeletal proteins. We therefore introduced included k-shortest paths and k-cycles in our network analysis using the Python modules, which allowed us to attain a reasonable computational time and identify k-shortest paths. This technique reflected results found in vivo and identified pathways not found when shortest path or degree analysis was applied. Our module enabled us to comprehensively analyse the characteristics of biomolecular networks and also enabled analysis of the effects of diseases considering the feedback loop and feedforward loop control structures as an alternative path.

  10. Improving the Reliability of Network Metrics in Structural Brain Networks by Integrating Different Network Weighting Strategies into a Single Graph

    Directory of Open Access Journals (Sweden)

    Stavros I. Dimitriadis

    2017-12-01

    Full Text Available Structural brain networks estimated from diffusion MRI (dMRI via tractography have been widely studied in healthy controls and patients with neurological and psychiatric diseases. However, few studies have addressed the reliability of derived network metrics both node-specific and network-wide. Different network weighting strategies (NWS can be adopted to weight the strength of connection between two nodes yielding structural brain networks that are almost fully-weighted. Here, we scanned five healthy participants five times each, using a diffusion-weighted MRI protocol and computed edges between 90 regions of interest (ROI from the Automated Anatomical Labeling (AAL template. The edges were weighted according to nine different methods. We propose a linear combination of these nine NWS into a single graph using an appropriate diffusion distance metric. We refer to the resulting weighted graph as an Integrated Weighted Structural Brain Network (ISWBN. Additionally, we consider a topological filtering scheme that maximizes the information flow in the brain network under the constraint of the overall cost of the surviving connections. We compared each of the nine NWS and the ISWBN based on the improvement of: (a intra-class correlation coefficient (ICC of well-known network metrics, both node-wise and per network level; and (b the recognition accuracy of each subject compared to the remainder of the cohort, as an attempt to access the uniqueness of the structural brain network for each subject, after first applying our proposed topological filtering scheme. Based on a threshold where the network level ICC should be >0.90, our findings revealed that six out of nine NWS lead to unreliable results at the network level, while all nine NWS were unreliable at the node level. In comparison, our proposed ISWBN performed as well as the best performing individual NWS at the network level, and the ICC was higher compared to all individual NWS at the node

  11. STRUCTURAL FEATURES OF PLANT CHITINASES AND CHITIN-BINDING PROTEINS

    NARCIS (Netherlands)

    BEINTEMA, JJ

    1994-01-01

    Structural features of plant chitinases and chitin-binding proteins are discussed. Many of these proteins consist of multiple domains,of which the chitin-binding hevein domain is a predominant one. X-ray and NMR structures of representatives of the major classes of these proteins are available now,

  12. Structural Covariance Network of Cortical Gyrification in Benign Childhood Epilepsy with Centrotemporal Spikes

    Directory of Open Access Journals (Sweden)

    Lin Jiang

    2018-02-01

    Full Text Available Benign childhood epilepsy with centrotemporal spikes (BECTS is associated with cognitive and language problems. According to recent studies, disruptions in brain structure and function in children with BECTS are beyond a Rolandic focus, suggesting atypical cortical development. However, previous studies utilizing surface-based metrics (e.g., cortical gyrification and their structural covariance networks at high resolution in children with BECTS are limited. Twenty-six children with BECTS (15 males/11 females; 10.35 ± 2.91 years and 26 demographically matched controls (15 males/11 females; 11.35 ± 2.51 years were included in this study and subjected to high-resolution structural brain MRI scans. The gyrification index was calculated, and structural brain networks were reconstructed based on the covariance of the cortical folding. In the BECTS group, significantly increased gyrification was observed in the bilateral Sylvain fissures and the left pars triangularis, temporal, rostral middle frontal, lateral orbitofrontal, and supramarginal areas (cluster-corrected p < 0.05. Global brain network measures were not significantly different between the groups; however, the nodal alterations were most pronounced in the insular, frontal, temporal, and occipital lobes (FDR corrected, p < 0.05. In children with BECTS, brain hubs increased in number and tended to shift to sensorimotor and temporal areas. Furthermore, we observed significantly positive relationships between the gyrification index and age (vertex p < 0.001, cluster-level correction as well as duration of epilepsy (vertex p < 0.001, cluster-level correction. Our results suggest that BECTS may be a condition that features abnormal over-folding of the Sylvian fissures and uncoordinated development of structural wiring, disrupted nodal profiles of centrality, and shifted hub distribution, which potentially represents a neuroanatomical hallmark of BECTS in the

  13. Multilayer Brain Networks

    Science.gov (United States)

    Vaiana, Michael; Muldoon, Sarah Feldt

    2018-01-01

    The field of neuroscience is facing an unprecedented expanse in the volume and diversity of available data. Traditionally, network models have provided key insights into the structure and function of the brain. With the advent of big data in neuroscience, both more sophisticated models capable of characterizing the increasing complexity of the data and novel methods of quantitative analysis are needed. Recently, multilayer networks, a mathematical extension of traditional networks, have gained increasing popularity in neuroscience due to their ability to capture the full information of multi-model, multi-scale, spatiotemporal data sets. Here, we review multilayer networks and their applications in neuroscience, showing how incorporating the multilayer framework into network neuroscience analysis has uncovered previously hidden features of brain networks. We specifically highlight the use of multilayer networks to model disease, structure-function relationships, network evolution, and link multi-scale data. Finally, we close with a discussion of promising new directions of multilayer network neuroscience research and propose a modified definition of multilayer networks designed to unite and clarify the use of the multilayer formalism in describing real-world systems.

  14. The International Trade Network: weighted network analysis and modelling

    International Nuclear Information System (INIS)

    Bhattacharya, K; Mukherjee, G; Manna, S S; Saramäki, J; Kaski, K

    2008-01-01

    Tools of the theory of critical phenomena, namely the scaling analysis and universality, are argued to be applicable to large complex web-like network structures. Using a detailed analysis of the real data of the International Trade Network we argue that the scaled link weight distribution has an approximate log-normal distribution which remains robust over a period of 53 years. Another universal feature is observed in the power-law growth of the trade strength with gross domestic product, the exponent being similar for all countries. Using the 'rich-club' coefficient measure of the weighted networks it has been shown that the size of the rich-club controlling half of the world's trade is actually shrinking. While the gravity law is known to describe well the social interactions in the static networks of population migration, international trade, etc, here for the first time we studied a non-conservative dynamical model based on the gravity law which excellently reproduced many empirical features of the ITN

  15. Online Social Networks: Essays on Membership, Privacy, and Structure

    NARCIS (Netherlands)

    Hofstra, B.

    2017-01-01

    The structure of social networks is crucial for obtaining social support, for meaningful connections to unknown social groups, and to overcome prejudice. Yet, we know little about the structure of social networks beyond those contacts that stand closest to us. This lack of knowledge results from a

  16. Joint Modelling of Structural and Functional Brain Networks

    DEFF Research Database (Denmark)

    Andersen, Kasper Winther; Herlau, Tue; Mørup, Morten

    -parametric Bayesian network model which allows for joint modelling and integration of multiple networks. We demonstrate the model’s ability to detect vertices that share structure across networks jointly in functional MRI (fMRI) and diffusion MRI (dMRI) data. Using two fMRI and dMRI scans per subject, we establish...

  17. Spatial structure of an individual-based plant–pollinator network

    DEFF Research Database (Denmark)

    Dupont, Yoko Luise; Nielsen, Kristian Trøjelsgaard; Hagen, Melanie

    2014-01-01

    The influence of space on the structure (e.g. modularity) of complex ecological networks remains largely unknown. Here, we sampled an individual-based plant–pollinator network by following the movements and flower visits of marked bumblebee individuals within a population of thistle plants...... for which the identities and spatial locations of stems were mapped in a 50  50 m study plot. The plant–pollinator network was dominated by parasitic male bumblebees and had a significantly modular structure, with four identified modules being clearly separated in space. This indicated that individual....... This demonstrated that individual-based plant–pollinator networks are influenced by both the spatial structure of plant populations and individual-specific plant traits. Additionally, bumblebee individuals with long observation times were important for both the connectivity between and within modules. The latter...

  18. Pre-trained convolutional neural networks as feature extractors for tuberculosis detection.

    Science.gov (United States)

    Lopes, U K; Valiati, J F

    2017-10-01

    It is estimated that in 2015, approximately 1.8 million people infected by tuberculosis died, most of them in developing countries. Many of those deaths could have been prevented if the disease had been detected at an earlier stage, but the most advanced diagnosis methods are still cost prohibitive for mass adoption. One of the most popular tuberculosis diagnosis methods is the analysis of frontal thoracic radiographs; however, the impact of this method is diminished by the need for individual analysis of each radiography by properly trained radiologists. Significant research can be found on automating diagnosis by applying computational techniques to medical images, thereby eliminating the need for individual image analysis and greatly diminishing overall costs. In addition, recent improvements on deep learning accomplished excellent results classifying images on diverse domains, but its application for tuberculosis diagnosis remains limited. Thus, the focus of this work is to produce an investigation that will advance the research in the area, presenting three proposals to the application of pre-trained convolutional neural networks as feature extractors to detect the disease. The proposals presented in this work are implemented and compared to the current literature. The obtained results are competitive with published works demonstrating the potential of pre-trained convolutional networks as medical image feature extractors. Copyright © 2017 Elsevier Ltd. All rights reserved.

  19. Coordination Analysis Using Global Structural Constraints and Alignment-based Local Features

    Science.gov (United States)

    Hara, Kazuo; Shimbo, Masashi; Matsumoto, Yuji

    We propose a hybrid approach to coordinate structure analysis that combines a simple grammar to ensure consistent global structure of coordinations in a sentence, and features based on sequence alignment to capture local symmetry of conjuncts. The weight of the alignment-based features, which in turn determines the score of coordinate structures, is optimized by perceptron training on a given corpus. A bottom-up chart parsing algorithm efficiently finds the best scoring structure, taking both nested or non-overlapping flat coordinations into account. We demonstrate that our approach outperforms existing parsers in coordination scope detection on the Genia corpus.

  20. Adaptive competitive learning neural networks

    Directory of Open Access Journals (Sweden)

    Ahmed R. Abas

    2013-11-01

    Full Text Available In this paper, the adaptive competitive learning (ACL neural network algorithm is proposed. This neural network not only groups similar input feature vectors together but also determines the appropriate number of groups of these vectors. This algorithm uses a new proposed criterion referred to as the ACL criterion. This criterion evaluates different clustering structures produced by the ACL neural network for an input data set. Then, it selects the best clustering structure and the corresponding network architecture for this data set. The selected structure is composed of the minimum number of clusters that are compact and balanced in their sizes. The selected network architecture is efficient, in terms of its complexity, as it contains the minimum number of neurons. Synaptic weight vectors of these neurons represent well-separated, compact and balanced clusters in the input data set. The performance of the ACL algorithm is evaluated and compared with the performance of a recently proposed algorithm in the literature in clustering an input data set and determining its number of clusters. Results show that the ACL algorithm is more accurate and robust in both determining the number of clusters and allocating input feature vectors into these clusters than the other algorithm especially with data sets that are sparsely distributed.

  1. Aespoe Hard Rock Laboratory. Analysis of fracture networks based on the integration of structural and hydrogeological observations on different scales

    Energy Technology Data Exchange (ETDEWEB)

    Bossart, P. [Geotechnical Inst. Ltd., Bern (Switzerland); Hermanson, Jan [Golder Associates, Stockholm (Sweden); Mazurek, M. [Univ. of Bern (Switzerland)

    2001-05-01

    Fracture networks at Aespoe have been studied for several rock types exhibiting different degrees of ductile and brittle deformation, as well as on different scales. Mesoscopic fault systems have been characterised and classified in an earlier report, this report focuses mainly on fracture networks derived on smaller scales, but also includes mesoscopic and larger scales. The TRUE-1 block has been selected for detailed structural analysis on a small scale due to the high density of relevant information. In addition to the data obtained from core materials, structural maps, BIP data and the results of hydro tests were synthesised to derive a conceptual structural model. The approach used to derive this conceptual model is based on the integration of deterministic structural evidence, probabilistic information and both upscaling and downscaling of observations and concepts derived on different scales. Twelve fracture networks mapped at different sites and scales and exhibiting various styles of tectonic deformation were analysed for fractal properties and structural and hydraulic interconnectedness. It was shown that these analysed fracture networks are not self-similar. An important result is the structural and hydraulic interconnectedness of fracture networks on all scales in the Aespoe rocks, which is further corroborated by geochemical evidence. Due to the structural and hydraulic interconnectedness of fracture systems on all scales at Aespoe, contaminants from waste canisters placed in tectonically low deformation environments would be transported - after having passed through the engineered barriers -from low-permeability fractures towards higher permeability fractures and may thus eventually reach high-permeability features.

  2. Aespoe Hard Rock Laboratory. Analysis of fracture networks based on the integration of structural and hydrogeological observations on different scales

    International Nuclear Information System (INIS)

    Bossart, P.; Hermanson, Jan; Mazurek, M.

    2001-05-01

    Fracture networks at Aespoe have been studied for several rock types exhibiting different degrees of ductile and brittle deformation, as well as on different scales. Mesoscopic fault systems have been characterised and classified in an earlier report, this report focuses mainly on fracture networks derived on smaller scales, but also includes mesoscopic and larger scales. The TRUE-1 block has been selected for detailed structural analysis on a small scale due to the high density of relevant information. In addition to the data obtained from core materials, structural maps, BIP data and the results of hydro tests were synthesised to derive a conceptual structural model. The approach used to derive this conceptual model is based on the integration of deterministic structural evidence, probabilistic information and both upscaling and downscaling of observations and concepts derived on different scales. Twelve fracture networks mapped at different sites and scales and exhibiting various styles of tectonic deformation were analysed for fractal properties and structural and hydraulic interconnectedness. It was shown that these analysed fracture networks are not self-similar. An important result is the structural and hydraulic interconnectedness of fracture networks on all scales in the Aespoe rocks, which is further corroborated by geochemical evidence. Due to the structural and hydraulic interconnectedness of fracture systems on all scales at Aespoe, contaminants from waste canisters placed in tectonically low deformation environments would be transported - after having passed through the engineered barriers -from low-permeability fractures towards higher permeability fractures and may thus eventually reach high-permeability features

  3. Accurate protein structure annotation through competitive diffusion of enzymatic functions over a network of local evolutionary similarities.

    Directory of Open Access Journals (Sweden)

    Eric Venner

    Full Text Available High-throughput Structural Genomics yields many new protein structures without known molecular function. This study aims to uncover these missing annotations by globally comparing select functional residues across the structural proteome. First, Evolutionary Trace Annotation, or ETA, identifies which proteins have local evolutionary and structural features in common; next, these proteins are linked together into a proteomic network of ETA similarities; then, starting from proteins with known functions, competing functional labels diffuse link-by-link over the entire network. Every node is thus assigned a likelihood z-score for every function, and the most significant one at each node wins and defines its annotation. In high-throughput controls, this competitive diffusion process recovered enzyme activity annotations with 99% and 97% accuracy at half-coverage for the third and fourth Enzyme Commission (EC levels, respectively. This corresponds to false positive rates 4-fold lower than nearest-neighbor and 5-fold lower than sequence-based annotations. In practice, experimental validation of the predicted carboxylesterase activity in a protein from Staphylococcus aureus illustrated the effectiveness of this approach in the context of an increasingly drug-resistant microbe. This study further links molecular function to a small number of evolutionarily important residues recognizable by Evolutionary Tracing and it points to the specificity and sensitivity of functional annotation by competitive global network diffusion. A web server is at http://mammoth.bcm.tmc.edu/networks.

  4. Structural covariance networks in the mouse brain.

    Science.gov (United States)

    Pagani, Marco; Bifone, Angelo; Gozzi, Alessandro

    2016-04-01

    The presence of networks of correlation between regional gray matter volume as measured across subjects in a group of individuals has been consistently described in several human studies, an approach termed structural covariance MRI (scMRI). Complementary to prevalent brain mapping modalities like functional and diffusion-weighted imaging, the approach can provide precious insights into the mutual influence of trophic and plastic processes in health and pathological states. To investigate whether analogous scMRI networks are present in lower mammal species amenable to genetic and experimental manipulation such as the laboratory mouse, we employed high resolution morphoanatomical MRI in a large cohort of genetically-homogeneous wild-type mice (C57Bl6/J) and mapped scMRI networks using a seed-based approach. We show that the mouse brain exhibits robust homotopic scMRI networks in both primary and associative cortices, a finding corroborated by independent component analyses of cortical volumes. Subcortical structures also showed highly symmetric inter-hemispheric correlations, with evidence of distributed antero-posterior networks in diencephalic regions of the thalamus and hypothalamus. Hierarchical cluster analysis revealed six identifiable clusters of cortical and sub-cortical regions corresponding to previously described neuroanatomical systems. Our work documents the presence of homotopic cortical and subcortical scMRI networks in the mouse brain, thus supporting the use of this species to investigate the elusive biological and neuroanatomical underpinnings of scMRI network development and its derangement in neuropathological states. The identification of scMRI networks in genetically homogeneous inbred mice is consistent with the emerging view of a key role of environmental factors in shaping these correlational networks. Copyright © 2016 Elsevier Inc. All rights reserved.

  5. Socio-Cognitive Phenotypes Differentially Modulate Large-Scale Structural Covariance Networks.

    Science.gov (United States)

    Valk, Sofie L; Bernhardt, Boris C; Böckler, Anne; Trautwein, Fynn-Mathis; Kanske, Philipp; Singer, Tania

    2017-02-01

    Functional neuroimaging studies have suggested the existence of 2 largely distinct social cognition networks, one for theory of mind (taking others' cognitive perspective) and another for empathy (sharing others' affective states). To address whether these networks can also be dissociated at the level of brain structure, we combined behavioral phenotyping across multiple socio-cognitive tasks with 3-Tesla MRI cortical thickness and structural covariance analysis in 270 healthy adults, recruited across 2 sites. Regional thickness mapping only provided partial support for divergent substrates, highlighting that individual differences in empathy relate to left insular-opercular thickness while no correlation between thickness and mentalizing scores was found. Conversely, structural covariance analysis showed clearly divergent network modulations by socio-cognitive and -affective phenotypes. Specifically, individual differences in theory of mind related to structural integration between temporo-parietal and dorsomedial prefrontal regions while empathy modulated the strength of dorsal anterior insula networks. Findings were robust across both recruitment sites, suggesting generalizability. At the level of structural network embedding, our study provides a double dissociation between empathy and mentalizing. Moreover, our findings suggest that structural substrates of higher-order social cognition are reflected rather in interregional networks than in the the local anatomical markup of specific regions per se. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

  6. Implementation of a FPGA-Based Feature Detection and Networking System for Real-time Traffic Monitoring

    OpenAIRE

    Chen, Jieshi; Schafer, Benjamin Carrion; Ho, Ivan Wang-Hei

    2016-01-01

    With the growing demand of real-time traffic monitoring nowadays, software-based image processing can hardly meet the real-time data processing requirement due to the serial data processing nature. In this paper, the implementation of a hardware-based feature detection and networking system prototype for real-time traffic monitoring as well as data transmission is presented. The hardware architecture of the proposed system is mainly composed of three parts: data collection, feature detection,...

  7. Linking structure and activity in nonlinear spiking networks.

    Directory of Open Access Journals (Sweden)

    Gabriel Koch Ocker

    2017-06-01

    Full Text Available Recent experimental advances are producing an avalanche of data on both neural connectivity and neural activity. To take full advantage of these two emerging datasets we need a framework that links them, revealing how collective neural activity arises from the structure of neural connectivity and intrinsic neural dynamics. This problem of structure-driven activity has drawn major interest in computational neuroscience. Existing methods for relating activity and architecture in spiking networks rely on linearizing activity around a central operating point and thus fail to capture the nonlinear responses of individual neurons that are the hallmark of neural information processing. Here, we overcome this limitation and present a new relationship between connectivity and activity in networks of nonlinear spiking neurons by developing a diagrammatic fluctuation expansion based on statistical field theory. We explicitly show how recurrent network structure produces pairwise and higher-order correlated activity, and how nonlinearities impact the networks' spiking activity. Our findings open new avenues to investigating how single-neuron nonlinearities-including those of different cell types-combine with connectivity to shape population activity and function.

  8. Linking structure and activity in nonlinear spiking networks.

    Science.gov (United States)

    Ocker, Gabriel Koch; Josić, Krešimir; Shea-Brown, Eric; Buice, Michael A

    2017-06-01

    Recent experimental advances are producing an avalanche of data on both neural connectivity and neural activity. To take full advantage of these two emerging datasets we need a framework that links them, revealing how collective neural activity arises from the structure of neural connectivity and intrinsic neural dynamics. This problem of structure-driven activity has drawn major interest in computational neuroscience. Existing methods for relating activity and architecture in spiking networks rely on linearizing activity around a central operating point and thus fail to capture the nonlinear responses of individual neurons that are the hallmark of neural information processing. Here, we overcome this limitation and present a new relationship between connectivity and activity in networks of nonlinear spiking neurons by developing a diagrammatic fluctuation expansion based on statistical field theory. We explicitly show how recurrent network structure produces pairwise and higher-order correlated activity, and how nonlinearities impact the networks' spiking activity. Our findings open new avenues to investigating how single-neuron nonlinearities-including those of different cell types-combine with connectivity to shape population activity and function.

  9. Model of community emergence in weighted social networks

    Science.gov (United States)

    Kumpula, J. M.; Onnela, J.-P.; Saramäki, J.; Kertész, J.; Kaski, K.

    2009-04-01

    Over the years network theory has proven to be rapidly expanding methodology to investigate various complex systems and it has turned out to give quite unparalleled insight to their structure, function, and response through data analysis, modeling, and simulation. For social systems in particular the network approach has empirically revealed a modular structure due to interplay between the network topology and link weights between network nodes or individuals. This inspired us to develop a simple network model that could catch some salient features of mesoscopic community and macroscopic topology formation during network evolution. Our model is based on two fundamental mechanisms of network sociology for individuals to find new friends, namely cyclic closure and focal closure, which are mimicked by local search-link-reinforcement and random global attachment mechanisms, respectively. In addition we included to the model a node deletion mechanism by removing all its links simultaneously, which corresponds for an individual to depart from the network. Here we describe in detail the implementation of our model algorithm, which was found to be computationally efficient and produce many empirically observed features of large-scale social networks. Thus this model opens a new perspective for studying such collective social phenomena as spreading, structure formation, and evolutionary processes.

  10. Community detection for networks with unipartite and bipartite structure

    Science.gov (United States)

    Chang, Chang; Tang, Chao

    2014-09-01

    Finding community structures in networks is important in network science, technology, and applications. To date, most algorithms that aim to find community structures only focus either on unipartite or bipartite networks. A unipartite network consists of one set of nodes and a bipartite network consists of two nonoverlapping sets of nodes with only links joining the nodes in different sets. However, a third type of network exists, defined here as the mixture network. Just like a bipartite network, a mixture network also consists of two sets of nodes, but some nodes may simultaneously belong to two sets, which breaks the nonoverlapping restriction of a bipartite network. The mixture network can be considered as a general case, with unipartite and bipartite networks viewed as its limiting cases. A mixture network can represent not only all the unipartite and bipartite networks, but also a wide range of real-world networks that cannot be properly represented as either unipartite or bipartite networks in fields such as biology and social science. Based on this observation, we first propose a probabilistic model that can find modules in unipartite, bipartite, and mixture networks in a unified framework based on the link community model for a unipartite undirected network [B Ball et al (2011 Phys. Rev. E 84 036103)]. We test our algorithm on synthetic networks (both overlapping and nonoverlapping communities) and apply it to two real-world networks: a southern women bipartite network and a human transcriptional regulatory mixture network. The results suggest that our model performs well for all three types of networks, is competitive with other algorithms for unipartite or bipartite networks, and is applicable to real-world networks.

  11. Neural Network-Based Coronary Heart Disease Risk Prediction Using Feature Correlation Analysis

    Directory of Open Access Journals (Sweden)

    Jae Kwon Kim

    2017-01-01

    Full Text Available Background. Of the machine learning techniques used in predicting coronary heart disease (CHD, neural network (NN is popularly used to improve performance accuracy. Objective. Even though NN-based systems provide meaningful results based on clinical experiments, medical experts are not satisfied with their predictive performances because NN is trained in a “black-box” style. Method. We sought to devise an NN-based prediction of CHD risk using feature correlation analysis (NN-FCA using two stages. First, the feature selection stage, which makes features acceding to the importance in predicting CHD risk, is ranked, and second, the feature correlation analysis stage, during which one learns about the existence of correlations between feature relations and the data of each NN predictor output, is determined. Result. Of the 4146 individuals in the Korean dataset evaluated, 3031 had low CHD risk and 1115 had CHD high risk. The area under the receiver operating characteristic (ROC curve of the proposed model (0.749 ± 0.010 was larger than the Framingham risk score (FRS (0.393 ± 0.010. Conclusions. The proposed NN-FCA, which utilizes feature correlation analysis, was found to be better than FRS in terms of CHD risk prediction. Furthermore, the proposed model resulted in a larger ROC curve and more accurate predictions of CHD risk in the Korean population than the FRS.

  12. Intelligence is associated with the modular structure of intrinsic brain networks.

    Science.gov (United States)

    Hilger, Kirsten; Ekman, Matthias; Fiebach, Christian J; Basten, Ulrike

    2017-11-22

    General intelligence is a psychological construct that captures in a single metric the overall level of behavioural and cognitive performance in an individual. While previous research has attempted to localise intelligence in circumscribed brain regions, more recent work focuses on functional interactions between regions. However, even though brain networks are characterised by substantial modularity, it is unclear whether and how the brain's modular organisation is associated with general intelligence. Modelling subject-specific brain network graphs from functional MRI resting-state data (N = 309), we found that intelligence was not associated with global modularity features (e.g., number or size of modules) or the whole-brain proportions of different node types (e.g., connector hubs or provincial hubs). In contrast, we observed characteristic associations between intelligence and node-specific measures of within- and between-module connectivity, particularly in frontal and parietal brain regions that have previously been linked to intelligence. We propose that the connectivity profile of these regions may shape intelligence-relevant aspects of information processing. Our data demonstrate that not only region-specific differences in brain structure and function, but also the network-topological embedding of fronto-parietal as well as other cortical and subcortical brain regions is related to individual differences in higher cognitive abilities, i.e., intelligence.

  13. The Deep Structure of Organizational Online Networking

    DEFF Research Database (Denmark)

    Trier, Matthias; Richter, Alexander

    2015-01-01

    While research on organizational online networking recently increased significantly, most studies adopt quantitative research designs with a focus on the consequences of social network configurations. Very limited attention is paid to comprehensive theoretical conceptions of the complex phenomenon...... of organizational online networking. We address this gap by adopting a theoretical framework of the deep structure of organizational online networking with a focus on their emerging meaning for the employees. We apply and assess the framework in a qualitative case study of a large-scale implementation...... of a corporate social network site (SNS) in a global organization. We reveal organizational online networking as a multi-dimensional phenomenon with multiplex relationships that are unbalanced, primarily consist of weak ties and are subject to temporal change. Further, we identify discourse drivers...

  14. The future of primordial features with large-scale structure surveys

    International Nuclear Information System (INIS)

    Chen, Xingang; Namjoo, Mohammad Hossein; Dvorkin, Cora; Huang, Zhiqi; Verde, Licia

    2016-01-01

    Primordial features are one of the most important extensions of the Standard Model of cosmology, providing a wealth of information on the primordial Universe, ranging from discrimination between inflation and alternative scenarios, new particle detection, to fine structures in the inflationary potential. We study the prospects of future large-scale structure (LSS) surveys on the detection and constraints of these features. We classify primordial feature models into several classes, and for each class we present a simple template of power spectrum that encodes the essential physics. We study how well the most ambitious LSS surveys proposed to date, including both spectroscopic and photometric surveys, will be able to improve the constraints with respect to the current Planck data. We find that these LSS surveys will significantly improve the experimental sensitivity on features signals that are oscillatory in scales, due to the 3D information. For a broad range of models, these surveys will be able to reduce the errors of the amplitudes of the features by a factor of 5 or more, including several interesting candidates identified in the recent Planck data. Therefore, LSS surveys offer an impressive opportunity for primordial feature discovery in the next decade or two. We also compare the advantages of both types of surveys.

  15. The future of primordial features with large-scale structure surveys

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Xingang; Namjoo, Mohammad Hossein [Institute for Theory and Computation, Harvard-Smithsonian Center for Astrophysics, 60 Garden Street, Cambridge, MA 02138 (United States); Dvorkin, Cora [Department of Physics, Harvard University, Cambridge, MA 02138 (United States); Huang, Zhiqi [School of Physics and Astronomy, Sun Yat-Sen University, 135 Xingang Xi Road, Guangzhou, 510275 (China); Verde, Licia, E-mail: xingang.chen@cfa.harvard.edu, E-mail: dvorkin@physics.harvard.edu, E-mail: huangzhq25@sysu.edu.cn, E-mail: mohammad.namjoo@cfa.harvard.edu, E-mail: liciaverde@icc.ub.edu [ICREA and ICC-UB, University of Barcelona (IEEC-UB), Marti i Franques, 1, Barcelona 08028 (Spain)

    2016-11-01

    Primordial features are one of the most important extensions of the Standard Model of cosmology, providing a wealth of information on the primordial Universe, ranging from discrimination between inflation and alternative scenarios, new particle detection, to fine structures in the inflationary potential. We study the prospects of future large-scale structure (LSS) surveys on the detection and constraints of these features. We classify primordial feature models into several classes, and for each class we present a simple template of power spectrum that encodes the essential physics. We study how well the most ambitious LSS surveys proposed to date, including both spectroscopic and photometric surveys, will be able to improve the constraints with respect to the current Planck data. We find that these LSS surveys will significantly improve the experimental sensitivity on features signals that are oscillatory in scales, due to the 3D information. For a broad range of models, these surveys will be able to reduce the errors of the amplitudes of the features by a factor of 5 or more, including several interesting candidates identified in the recent Planck data. Therefore, LSS surveys offer an impressive opportunity for primordial feature discovery in the next decade or two. We also compare the advantages of both types of surveys.

  16. A Neutral-Network-Fusion Architecture for Automatic Extraction of Oceanographic Features from Satellite Remote Sensing Imagery

    National Research Council Canada - National Science Library

    Askari, Farid

    1999-01-01

    This report describes an approach for automatic feature detection from fusion of remote sensing imagery using a combination of neural network architecture and the Dempster-Shafer (DS) theory of evidence...

  17. Network structure detection and analysis of Shanghai stock market

    Directory of Open Access Journals (Sweden)

    Sen Wu

    2015-04-01

    Full Text Available Purpose: In order to investigate community structure of the component stocks of SSE (Shanghai Stock Exchange 180-index, a stock correlation network is built to find the intra-community and inter-community relationship. Design/methodology/approach: The stock correlation network is built taking the vertices as stocks and edges as correlation coefficients of logarithm returns of stock price. It is built as undirected weighted at first. GN algorithm is selected to detect community structure after transferring the network into un-weighted with different thresholds. Findings: The result of the network community structure analysis shows that the stock market has obvious industrial characteristics. Most of the stocks in the same industry or in the same supply chain are assigned to the same community. The correlation of the internal stock prices’ fluctuation is closer than in different communities. The result of community structure detection also reflects correlations among different industries. Originality/value: Based on the analysis of the community structure in Shanghai stock market, the result reflects some industrial characteristics, which has reference value to relationship among industries or sub-sectors of listed companies.

  18. Metallacyclopentadienes: structural features and coordination in transition metal complexes

    International Nuclear Information System (INIS)

    Dolgushin, Fedor M; Yanovsky, Aleksandr I; Antipin, Mikhail Yu

    2004-01-01

    Results of structural studies of polynuclear transition metal complexes containing the metallacyclopentadiene fragment are overviewed. The structural features of the complexes in relation to the nature of the substituents in the organic moiety of the metallacycles, the nature of the transition metals and their ligand environment are analysed. The main structural characteristics corresponding to different modes of coordination of metallacyclopentadienes to one or two additional metal centres are revealed.

  19. A Decomposition Algorithm for Learning Bayesian Network Structures from Data

    DEFF Research Database (Denmark)

    Zeng, Yifeng; Cordero Hernandez, Jorge

    2008-01-01

    It is a challenging task of learning a large Bayesian network from a small data set. Most conventional structural learning approaches run into the computational as well as the statistical problems. We propose a decomposition algorithm for the structure construction without having to learn...... the complete network. The new learning algorithm firstly finds local components from the data, and then recover the complete network by joining the learned components. We show the empirical performance of the decomposition algorithm in several benchmark networks....

  20. Structural health monitoring using wireless sensor networks

    Science.gov (United States)

    Sreevallabhan, K.; Nikhil Chand, B.; Ramasamy, Sudha

    2017-11-01

    Monitoring and analysing health of large structures like bridges, dams, buildings and heavy machinery is important for safety, economical, operational, making prior protective measures, and repair and maintenance point of view. In recent years there is growing demand for such larger structures which in turn make people focus more on safety. By using Microelectromechanical Systems (MEMS) Accelerometer we can perform Structural Health Monitoring by studying the dynamic response through measure of ambient vibrations and strong motion of such structures. By using Wireless Sensor Networks (WSN) we can embed these sensors in wireless networks which helps us to transmit data wirelessly thus we can measure the data wirelessly at any remote location. This in turn reduces heavy wiring which is a cost effective as well as time consuming process to lay those wires. In this paper we developed WSN based MEMS-accelerometer for Structural to test the results in the railway bridge near VIT University, Vellore campus.

  1. Convolutional deep belief network with feature encoding for classification of neuroblastoma histological images

    Directory of Open Access Journals (Sweden)

    Soheila Gheisari

    2018-01-01

    Full Text Available Background: Neuroblastoma is the most common extracranial solid tumor in children younger than 5 years old. Optimal management of neuroblastic tumors depends on many factors including histopathological classification. The gold standard for classification of neuroblastoma histological images is visual microscopic assessment. In this study, we propose and evaluate a deep learning approach to classify high-resolution digital images of neuroblastoma histology into five different classes determined by the Shimada classification. Subjects and Methods: We apply a combination of convolutional deep belief network (CDBN with feature encoding algorithm that automatically classifies digital images of neuroblastoma histology into five different classes. We design a three-layer CDBN to extract high-level features from neuroblastoma histological images and combine with a feature encoding model to extract features that are highly discriminative in the classification task. The extracted features are classified into five different classes using a support vector machine classifier. Data: We constructed a dataset of 1043 neuroblastoma histological images derived from Aperio scanner from 125 patients representing different classes of neuroblastoma tumors. Results: The weighted average F-measure of 86.01% was obtained from the selected high-level features, outperforming state-of-the-art methods. Conclusion: The proposed computer-aided classification system, which uses the combination of deep architecture and feature encoding to learn high-level features, is highly effective in the classification of neuroblastoma histological images.

  2. Impact of constrained rewiring on network structure and node dynamics

    Science.gov (United States)

    Rattana, P.; Berthouze, L.; Kiss, I. Z.

    2014-11-01

    In this paper, we study an adaptive spatial network. We consider a susceptible-infected-susceptible (SIS) epidemic on the network, with a link or contact rewiring process constrained by spatial proximity. In particular, we assume that susceptible nodes break links with infected nodes independently of distance and reconnect at random to susceptible nodes available within a given radius. By systematically manipulating this radius we investigate the impact of rewiring on the structure of the network and characteristics of the epidemic. We adopt a step-by-step approach whereby we first study the impact of rewiring on the network structure in the absence of an epidemic, then with nodes assigned a disease status but without disease dynamics, and finally running network and epidemic dynamics simultaneously. In the case of no labeling and no epidemic dynamics, we provide both analytic and semianalytic formulas for the value of clustering achieved in the network. Our results also show that the rewiring radius and the network's initial structure have a pronounced effect on the endemic equilibrium, with increasingly large rewiring radiuses yielding smaller disease prevalence.

  3. An Extended HITS Algorithm on Bipartite Network for Features Extraction of Online Customer Reviews

    Directory of Open Access Journals (Sweden)

    Chen Liu

    2018-05-01

    Full Text Available How to acquire useful information intelligently in the age of information explosion has become an important issue. In this context, sentiment analysis emerges with the growth of the need of information extraction. One of the most important tasks of sentiment analysis is feature extraction of entities in consumer reviews. This paper first constitutes a directed bipartite feature-sentiment relation network with a set of candidate features-sentiment pairs that is extracted by dependency syntax analysis from consumer reviews. Then, a novel method called MHITS which combines PMI with weighted HITS algorithm is proposed to rank these candidate product features to find out real product features. Empirical experiments indicate the effectiveness of our approach across different kinds and various data sizes of product. In addition, the effect of the proposed algorithm is not the same for the corpus with different proportions of the word pair that includes the “bad”, “good”, “poor”, “pretty good”, “not bad” these general collocation words.

  4. Optimal topologies for maximizing network transmission capacity

    Science.gov (United States)

    Chen, Zhenhao; Wu, Jiajing; Rong, Zhihai; Tse, Chi K.

    2018-04-01

    It has been widely demonstrated that the structure of a network is a major factor that affects its traffic dynamics. In this work, we try to identify the optimal topologies for maximizing the network transmission capacity, as well as to build a clear relationship between structural features of a network and the transmission performance in terms of traffic delivery. We propose an approach for designing optimal network topologies against traffic congestion by link rewiring and apply them on the Barabási-Albert scale-free, static scale-free and Internet Autonomous System-level networks. Furthermore, we analyze the optimized networks using complex network parameters that characterize the structure of networks, and our simulation results suggest that an optimal network for traffic transmission is more likely to have a core-periphery structure. However, assortative mixing and the rich-club phenomenon may have negative impacts on network performance. Based on the observations of the optimized networks, we propose an efficient method to improve the transmission capacity of large-scale networks.

  5. The formation of a core-periphery structure in heterogeneous financial networks

    NARCIS (Netherlands)

    van der Leij, M.; in 't Veld, D.; Hommes, C.

    2016-01-01

    Recent empirical evidence suggests that financial networks exhibit a core-periphery network structure. This paper aims at giving an explanation for the emergence of such a structure using network formation theory. We propose a simple model of the overnight interbank lending market, in which banks

  6. Effects of Neuromodulation on Excitatory-Inhibitory Neural Network Dynamics Depend on Network Connectivity Structure

    Science.gov (United States)

    Rich, Scott; Zochowski, Michal; Booth, Victoria

    2018-01-01

    Acetylcholine (ACh), one of the brain's most potent neuromodulators, can affect intrinsic neuron properties through blockade of an M-type potassium current. The effect of ACh on excitatory and inhibitory cells with this potassium channel modulates their membrane excitability, which in turn affects their tendency to synchronize in networks. Here, we study the resulting changes in dynamics in networks with inter-connected excitatory and inhibitory populations (E-I networks), which are ubiquitous in the brain. Utilizing biophysical models of E-I networks, we analyze how the network connectivity structure in terms of synaptic connectivity alters the influence of ACh on the generation of synchronous excitatory bursting. We investigate networks containing all combinations of excitatory and inhibitory cells with high (Type I properties) or low (Type II properties) modulatory tone. To vary network connectivity structure, we focus on the effects of the strengths of inter-connections between excitatory and inhibitory cells (E-I synapses and I-E synapses), and the strengths of intra-connections among excitatory cells (E-E synapses) and among inhibitory cells (I-I synapses). We show that the presence of ACh may or may not affect the generation of network synchrony depending on the network connectivity. Specifically, strong network inter-connectivity induces synchronous excitatory bursting regardless of the cellular propensity for synchronization, which aligns with predictions of the PING model. However, when a network's intra-connectivity dominates its inter-connectivity, the propensity for synchrony of either inhibitory or excitatory cells can determine the generation of network-wide bursting.

  7. Towards benchmarking citizen observatories: Features and functioning of online amateur weather networks.

    Science.gov (United States)

    Gharesifard, Mohammad; Wehn, Uta; van der Zaag, Pieter

    2017-05-15

    Crowd-sourced environmental observations are increasingly being considered as having the potential to enhance the spatial and temporal resolution of current data streams from terrestrial and areal sensors. The rapid diffusion of ICTs during the past decades has facilitated the process of data collection and sharing by the general public and has resulted in the formation of various online environmental citizen observatory networks. Online amateur weather networks are a particular example of such ICT-mediated observatories that are rooted in one of the oldest and most widely practiced citizen science activities, namely amateur weather observation. The objective of this paper is to introduce a conceptual framework that enables a systematic review of the features and functioning of these expanding networks. This is done by considering distinct dimensions, namely the geographic scope and types of participants, the network's establishment mechanism, revenue stream(s), existing communication paradigm, efforts required by data sharers, support offered by platform providers, and issues such as data accessibility, availability and quality. An in-depth understanding of these dimensions helps to analyze various dynamics such as interactions between different stakeholders, motivations to run the networks, and their sustainability. This framework is then utilized to perform a critical review of six existing online amateur weather networks based on publicly available data. The main findings of this analysis suggest that: (1) there are several key stakeholders such as emergency services and local authorities that are not (yet) engaged in these networks; (2) the revenue stream(s) of online amateur weather networks is one of the least discussed but arguably most important dimensions that is crucial for the sustainability of these networks; and (3) all of the networks included in this study have one or more explicit modes of bi-directional communication, however, this is limited to

  8. Fascin- and α-Actinin-Bundled Networks Contain Intrinsic Structural Features that Drive Protein Sorting.

    Science.gov (United States)

    Winkelman, Jonathan D; Suarez, Cristian; Hocky, Glen M; Harker, Alyssa J; Morganthaler, Alisha N; Christensen, Jenna R; Voth, Gregory A; Bartles, James R; Kovar, David R

    2016-10-24

    Cells assemble and maintain functionally distinct actin cytoskeleton networks with various actin filament organizations and dynamics through the coordinated action of different sets of actin-binding proteins. The biochemical and functional properties of diverse actin-binding proteins, both alone and in combination, have been increasingly well studied. Conversely, how different sets of actin-binding proteins properly sort to distinct actin filament networks in the first place is not nearly as well understood. Actin-binding protein sorting is critical for the self-organization of diverse dynamic actin cytoskeleton networks within a common cytoplasm. Using in vitro reconstitution techniques including biomimetic assays and single-molecule multi-color total internal reflection fluorescence microscopy, we discovered that sorting of the prominent actin-bundling proteins fascin and α-actinin to distinct networks is an intrinsic behavior, free of complicated cellular signaling cascades. When mixed, fascin and α-actinin mutually exclude each other by promoting their own recruitment and inhibiting recruitment of the other, resulting in the formation of distinct fascin- or α-actinin-bundled domains. Subdiffraction-resolution light microscopy and negative-staining electron microscopy revealed that fascin domains are densely packed, whereas α-actinin domains consist of widely spaced parallel actin filaments. Importantly, other actin-binding proteins such as fimbrin and espin show high specificity between these two bundle types within the same reaction. Here we directly observe that fascin and α-actinin intrinsically segregate to discrete bundled domains that are specifically recognized by other actin-binding proteins. Copyright © 2016 Elsevier Ltd. All rights reserved.

  9. Community Structure Analysis of Gene Interaction Networks in Duchenne Muscular Dystrophy.

    Directory of Open Access Journals (Sweden)

    Tejaswini Narayanan

    Full Text Available Duchenne Muscular Dystrophy (DMD is an important pathology associated with the human skeletal muscle and has been studied extensively. Gene expression measurements on skeletal muscle of patients afflicted with DMD provides the opportunity to understand the underlying mechanisms that lead to the pathology. Community structure analysis is a useful computational technique for understanding and modeling genetic interaction networks. In this paper, we leverage this technique in combination with gene expression measurements from normal and DMD patient skeletal muscle tissue to study the structure of genetic interactions in the context of DMD. We define a novel framework for transforming a raw dataset of gene expression measurements into an interaction network, and subsequently apply algorithms for community structure analysis for the extraction of topological communities. The emergent communities are analyzed from a biological standpoint in terms of their constituent biological pathways, and an interpretation that draws correlations between functional and structural organization of the genetic interactions is presented. We also compare these communities and associated functions in pathology against those in normal human skeletal muscle. In particular, differential enhancements are observed in the following pathways between pathological and normal cases: Metabolic, Focal adhesion, Regulation of actin cytoskeleton and Cell adhesion, and implication of these mechanisms are supported by prior work. Furthermore, our study also includes a gene-level analysis to identify genes that are involved in the coupling between the pathways of interest. We believe that our results serve to highlight important distinguishing features in the structural/functional organization of constituent biological pathways, as it relates to normal and DMD cases, and provide the mechanistic basis for further biological investigations into specific pathways differently regulated

  10. A Spectrum Sensing Method Based on Signal Feature and Clustering Algorithm in Cognitive Wireless Multimedia Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yongwei Zhang

    2017-01-01

    Full Text Available In order to solve the problem of difficulty in determining the threshold in spectrum sensing technologies based on the random matrix theory, a spectrum sensing method based on clustering algorithm and signal feature is proposed for Cognitive Wireless Multimedia Sensor Networks. Firstly, the wireless communication signal features are obtained according to the sampling signal covariance matrix. Then, the clustering algorithm is used to classify and test the signal features. Different signal features and clustering algorithms are compared in this paper. The experimental results show that the proposed method has better sensing performance.

  11. Day-ahead deregulated electricity market price forecasting using neural network input featured by DCT

    International Nuclear Information System (INIS)

    Anbazhagan, S.; Kumarappan, N.

    2014-01-01

    Highlights: • We presented DCT input featured FFNN model for forecasting in Spain market. • The key factors impacting electricity price forecasting are historical prices. • Past 42 days were trained and the next 7 days were forecasted. • The proposed approach has a simple and better NN structure. • The DCT-FFNN mode is effective and less computation time than the recent models. - Abstract: In a deregulated market, a number of factors determined the outcome of electricity price and displays a perplexed and maverick fluctuation. Both power producers and consumers needs single compact and robust price forecasting tool in order to maximize their profits and utilities. In order to achieve the helter–skelter kind of electricity price, one dimensional discrete cosine transforms (DCT) input featured feed-forward neural network (FFNN) is modeled (DCT-FFNN). The proposed FFNN is a single compact and robust architecture (without hybridizing the various hard and soft computing models). It has been predicted that the DCT-FFNN model is close to the state of the art can be achieved with less computation time. The proposed DCT-FFNN approach is compared with 17 other recent approaches to estimate the market clearing prices of mainland Spain. Finally, the accuracy of the price forecasting is also applied to the electricity market of New York in year 2010 that shows the effectiveness of the proposed DCT-FFNN approach

  12. Structural Analysis of Complex Networks

    CERN Document Server

    Dehmer, Matthias

    2011-01-01

    Filling a gap in literature, this self-contained book presents theoretical and application-oriented results that allow for a structural exploration of complex networks. The work focuses not only on classical graph-theoretic methods, but also demonstrates the usefulness of structural graph theory as a tool for solving interdisciplinary problems. Applications to biology, chemistry, linguistics, and data analysis are emphasized. The book is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics, computer science,

  13. A Closer Look at Deep Learning Neural Networks with Low-level Spectral Periodicity Features

    DEFF Research Database (Denmark)

    Sturm, Bob L.; Kereliuk, Corey; Pikrakis, Aggelos

    2014-01-01

    Systems built using deep learning neural networks trained on low-level spectral periodicity features (DeSPerF) reproduced the most “ground truth” of the systems submitted to the MIREX 2013 task, “Audio Latin Genre Classification.” To answer why this was the case, we take a closer look...

  14. Common Features in Electronic Structure of the Oxypnictide Superconductors from Photoemission Spectroscopy

    International Nuclear Information System (INIS)

    Xiao-Wen, Jia; Hai-Yun, Liu; Wen-Tao, Zhang; Lin, Zhao; Jian-Qiao, Meng; Guo-Dong, Liu; Xiao-Li, Dong; Zhi-An, Ren; Wei, Yi; Guang-Can, Che; Zhong-Xian, Zhao; Gang, Wu; Rong-Hua, Liu; Xian-Hui, Chen; Gen-Fu, Chen; Nan-Lin, Wang; Yong, Zhu; Xiao-Yang, Wang; Gui-Ling, Wang; Yong, Zhou

    2008-01-01

    High resolution photoemission measurements are carried out on non-superconducting LaFeAsO parent compound and various superconducting RFeAs(O 1-x F x ) (R=La, Ce and Pr) compounds. It is found that the parent LaFeAsO compound shows a metallic character. By extensive measurements, several common features are identified in the electronic structure of these Fe-based compounds: (1) 0.2 eV feature in the valence band, (2) a universal 13-16 meV feature, (3) near Ef spectral weight suppression with decreasing temperature. These universal features can provide important information about band structure, superconducting gap and pseudogap in these Fe-based materials

  15. Analysis of the structure of complex networks at different resolution levels

    Energy Technology Data Exchange (ETDEWEB)

    Arenas, A.; Fernandez, A.; Gomez, S.

    2008-02-28

    Modular structure is ubiquitous in real-world complex networks, and its detection is important because it gives insights in the structure-functionality relationship. The standard approach is based on the optimization of a quality function, modularity, which is a relative quality measure for a partition of a network into modules. Recently some authors have pointed out that the optimization of modularity has a fundamental drawback: the existence of a resolution limit beyond which no modular structure can be detected even though these modules might have own entity. The reason is that several topological descriptions of the network coexist at different scales, which is, in general, a fingerprint of complex systems. Here we propose a method that allows for multiple resolution screening of the modular structure. The method has been validated using synthetic networks, discovering the predefined structures at all scales. Its application to two real social networks allows to find the exact splits reported in the literature, as well as the substructure beyond the actual split.

  16. Adapting Bayes Network Structures to Non-stationary Domains

    DEFF Research Database (Denmark)

    Nielsen, Søren Holbech; Nielsen, Thomas Dyhre

    2008-01-01

    When an incremental structural learning method gradually modifies a Bayesian network (BN) structure to fit a sequential stream of observations, we call the process structural adaptation. Structural adaptation is useful when the learner is set to work in an unknown environment, where a BN is gradu...

  17. Interconnected networks

    CERN Document Server

    2016-01-01

    This volume provides an introduction to and overview of the emerging field of interconnected networks which include multi layer or multiplex networks, as well as networks of networks. Such networks present structural and dynamical features quite different from those observed in isolated networks. The presence of links between different networks or layers of a network typically alters the way such interconnected networks behave – understanding the role of interconnecting links is therefore a crucial step towards a more accurate description of real-world systems. While examples of such dissimilar properties are becoming more abundant – for example regarding diffusion, robustness and competition – the root of such differences remains to be elucidated. Each chapter in this topical collection is self-contained and can be read on its own, thus making it also suitable as reference for experienced researchers wishing to focus on a particular topic.

  18. An Algorithm Based on the Self-Organized Maps for the Classification of Facial Features

    Directory of Open Access Journals (Sweden)

    Gheorghe Gîlcă

    2015-12-01

    Full Text Available This paper deals with an algorithm based on Self Organized Maps networks which classifies facial features. The proposed algorithm can categorize the facial features defined by the input variables: eyebrow, mouth, eyelids into a map of their grouping. The groups map is based on calculating the distance between each input vector and each output neuron layer , the neuron with the minimum distance being declared winner neuron. The network structure consists of two levels: the first level contains three input vectors, each having forty-one values, while the second level contains the SOM competitive network which consists of 100 neurons. The proposed system can classify facial features quickly and easily using the proposed algorithm based on SOMs.

  19. Features Extraction of Flotation Froth Images and BP Neural Network Soft-Sensor Model of Concentrate Grade Optimized by Shuffled Cuckoo Searching Algorithm

    Directory of Open Access Journals (Sweden)

    Jie-sheng Wang

    2014-01-01

    Full Text Available For meeting the forecasting target of key technology indicators in the flotation process, a BP neural network soft-sensor model based on features extraction of flotation froth images and optimized by shuffled cuckoo search algorithm is proposed. Based on the digital image processing technique, the color features in HSI color space, the visual features based on the gray level cooccurrence matrix, and the shape characteristics based on the geometric theory of flotation froth images are extracted, respectively, as the input variables of the proposed soft-sensor model. Then the isometric mapping method is used to reduce the input dimension, the network size, and learning time of BP neural network. Finally, a shuffled cuckoo search algorithm is adopted to optimize the BP neural network soft-sensor model. Simulation results show that the model has better generalization results and prediction accuracy.

  20. Association of structural global brain network properties with intelligence in normal aging.

    Directory of Open Access Journals (Sweden)

    Florian U Fischer

    Full Text Available Higher general intelligence attenuates age-associated cognitive decline and the risk of dementia. Thus, intelligence has been associated with cognitive reserve or resilience in normal aging. Neurophysiologically, intelligence is considered as a complex capacity that is dependent on a global cognitive network rather than isolated brain areas. An association of structural as well as functional brain network characteristics with intelligence has already been reported in young adults. We investigated the relationship between global structural brain network properties, general intelligence and age in a group of 43 cognitively healthy elderly, age 60-85 years. Individuals were assessed cross-sectionally using Wechsler Adult Intelligence Scale-Revised (WAIS-R and diffusion-tensor imaging. Structural brain networks were reconstructed individually using deterministic tractography, global network properties (global efficiency, mean shortest path length, and clustering coefficient were determined by graph theory and correlated to intelligence scores within both age groups. Network properties were significantly correlated to age, whereas no significant correlation to WAIS-R was observed. However, in a subgroup of 15 individuals aged 75 and above, the network properties were significantly correlated to WAIS-R. Our findings suggest that general intelligence and global properties of structural brain networks may not be generally associated in cognitively healthy elderly. However, we provide first evidence of an association between global structural brain network properties and general intelligence in advanced elderly. Intelligence might be affected by age-associated network deterioration only if a certain threshold of structural degeneration is exceeded. Thus, age-associated brain structural changes seem to be partially compensated by the network and the range of this compensation might be a surrogate of cognitive reserve or brain resilience.

  1. Association of Structural Global Brain Network Properties with Intelligence in Normal Aging

    Science.gov (United States)

    Fischer, Florian U.; Wolf, Dominik; Scheurich, Armin; Fellgiebel, Andreas

    2014-01-01

    Higher general intelligence attenuates age-associated cognitive decline and the risk of dementia. Thus, intelligence has been associated with cognitive reserve or resilience in normal aging. Neurophysiologically, intelligence is considered as a complex capacity that is dependent on a global cognitive network rather than isolated brain areas. An association of structural as well as functional brain network characteristics with intelligence has already been reported in young adults. We investigated the relationship between global structural brain network properties, general intelligence and age in a group of 43 cognitively healthy elderly, age 60–85 years. Individuals were assessed cross-sectionally using Wechsler Adult Intelligence Scale-Revised (WAIS-R) and diffusion-tensor imaging. Structural brain networks were reconstructed individually using deterministic tractography, global network properties (global efficiency, mean shortest path length, and clustering coefficient) were determined by graph theory and correlated to intelligence scores within both age groups. Network properties were significantly correlated to age, whereas no significant correlation to WAIS-R was observed. However, in a subgroup of 15 individuals aged 75 and above, the network properties were significantly correlated to WAIS-R. Our findings suggest that general intelligence and global properties of structural brain networks may not be generally associated in cognitively healthy elderly. However, we provide first evidence of an association between global structural brain network properties and general intelligence in advanced elderly. Intelligence might be affected by age-associated network deterioration only if a certain threshold of structural degeneration is exceeded. Thus, age-associated brain structural changes seem to be partially compensated by the network and the range of this compensation might be a surrogate of cognitive reserve or brain resilience. PMID:24465994

  2. A user exposure based approach for non-structural road network vulnerability analysis.

    Directory of Open Access Journals (Sweden)

    Lei Jin

    Full Text Available Aiming at the dense urban road network vulnerability without structural negative consequences, this paper proposes a novel non-structural road network vulnerability analysis framework. Three aspects of the framework are mainly described: (i the rationality of non-structural road network vulnerability, (ii the metrics for negative consequences accounting for variant road conditions, and (iii the introduction of a new vulnerability index based on user exposure. Based on the proposed methodology, a case study in the Sioux Falls network which was usually threatened by regular heavy snow during wintertime is detailedly discussed. The vulnerability ranking of links of Sioux Falls network with respect to heavy snow scenario is identified. As a result of non-structural consequences accompanied by conceivable degeneration of network, there are significant increases in generalized travel time costs which are measurements for "emotionally hurt" of topological road network.

  3. Predicting Genes Involved in Human Cancer Using Network Contextual Information

    Directory of Open Access Journals (Sweden)

    Rahmani Hossein

    2012-03-01

    Full Text Available Protein-Protein Interaction (PPI networks have been widely used for the task of predicting proteins involved in cancer. Previous research has shown that functional information about the protein for which a prediction is made, proximity to specific other proteins in the PPI network, as well as local network structure are informative features in this respect. In this work, we introduce two new types of input features, reflecting additional information: (1 Functional Context: the functions of proteins interacting with the target protein (rather than the protein itself; and (2 Structural Context: the relative position of the target protein with respect to specific other proteins selected according to a novel ANOVA (analysis of variance based measure. We also introduce a selection strategy to pinpoint the most informative features. Results show that the proposed feature types and feature selection strategy yield informative features. A standard machine learning method (Naive Bayes that uses the features proposed here outperforms the current state-of-the-art methods by more than 5% with respect to F-measure. In addition, manual inspection confirms the biological relevance of the top-ranked features.

  4. Analysis of structure-function network decoupling in the brain systems of spastic diplegic cerebral palsy.

    Science.gov (United States)

    Lee, Dongha; Pae, Chongwon; Lee, Jong Doo; Park, Eun Sook; Cho, Sung-Rae; Um, Min-Hee; Lee, Seung-Koo; Oh, Maeng-Keun; Park, Hae-Jeong

    2017-10-01

    Manifestation of the functionalities from the structural brain network is becoming increasingly important to understand a brain disease. With the aim of investigating the differential structure-function couplings according to network systems, we investigated the structural and functional brain networks of patients with spastic diplegic cerebral palsy with periventricular leukomalacia compared to healthy controls. The structural and functional networks of the whole brain and motor system, constructed using deterministic and probabilistic tractography of diffusion tensor magnetic resonance images and Pearson and partial correlation analyses of resting-state functional magnetic resonance images, showed differential embedding of functional networks in the structural networks in patients. In the whole-brain network of patients, significantly reduced global network efficiency compared to healthy controls were found in the structural networks but not in the functional networks, resulting in reduced structural-functional coupling. On the contrary, the motor network of patients had a significantly lower functional network efficiency over the intact structural network and a lower structure-function coupling than the control group. This reduced coupling but reverse directionality in the whole-brain and motor networks of patients was prominent particularly between the probabilistic structural and partial correlation-based functional networks. Intact (or less deficient) functional network over impaired structural networks of the whole brain and highly impaired functional network topology over the intact structural motor network might subserve relatively preserved cognitions and impaired motor functions in cerebral palsy. This study suggests that the structure-function relationship, evaluated specifically using sparse functional connectivity, may reveal important clues to functional reorganization in cerebral palsy. Hum Brain Mapp 38:5292-5306, 2017. © 2017 Wiley Periodicals

  5. Sensitivity analysis of human brain structural network construction

    Directory of Open Access Journals (Sweden)

    Kuang Wei

    2017-12-01

    Full Text Available Network neuroscience leverages diffusion-weighted magnetic resonance imaging and tractography to quantify structural connectivity of the human brain. However, scientists and practitioners lack a clear understanding of the effects of varying tractography parameters on the constructed structural networks. With diffusion images from the Human Connectome Project (HCP, we characterize how structural networks are impacted by the spatial resolution of brain atlases, total number of tractography streamlines, and grey matter dilation with various graph metrics. We demonstrate how injudicious combinations of highly refined brain parcellations and low numbers of streamlines may inadvertently lead to disconnected network models with isolated nodes. Furthermore, we provide solutions to significantly reduce the likelihood of generating disconnected networks. In addition, for different tractography parameters, we investigate the distributions of values taken by various graph metrics across the population of HCP subjects. Analyzing the ranks of individual subjects within the graph metric distributions, we find that the ranks of individuals are affected differently by atlas scale changes. Our work serves as a guideline for researchers to optimize the selection of tractography parameters and illustrates how biological characteristics of the brain derived in network neuroscience studies can be affected by the choice of atlas parcellation schemes. Diffusion tractography has been proven to be a promising noninvasive technique to study the network properties of the human brain. However, how various tractography and network construction parameters affect network properties has not been studied using a large cohort of high-quality data. We utilize data provided by the Human Connectome Project to characterize the changes to network properties induced by varying the brain parcellation atlas scales, the number of reconstructed tractography tracks, and the degree of grey

  6. Structuring evolution: biochemical networks and metabolic diversification in birds.

    Science.gov (United States)

    Morrison, Erin S; Badyaev, Alexander V

    2016-08-25

    Recurrence and predictability of evolution are thought to reflect the correspondence between genomic and phenotypic dimensions of organisms, and the connectivity in deterministic networks within these dimensions. Direct examination of the correspondence between opportunities for diversification imbedded in such networks and realized diversity is illuminating, but is empirically challenging because both the deterministic networks and phenotypic diversity are modified in the course of evolution. Here we overcome this problem by directly comparing the structure of a "global" carotenoid network - comprising of all known enzymatic reactions among naturally occurring carotenoids - with the patterns of evolutionary diversification in carotenoid-producing metabolic networks utilized by birds. We found that phenotypic diversification in carotenoid networks across 250 species was closely associated with enzymatic connectivity of the underlying biochemical network - compounds with greater connectivity occurred the most frequently across species and were the hotspots of metabolic pathway diversification. In contrast, we found no evidence for diversification along the metabolic pathways, corroborating findings that the utilization of the global carotenoid network was not strongly influenced by history in avian evolution. The finding that the diversification in species-specific carotenoid networks is qualitatively predictable from the connectivity of the underlying enzymatic network points to significant structural determinism in phenotypic evolution.

  7. Ames and other European networks in integrity of ageing structures

    International Nuclear Information System (INIS)

    Davies, L.M.; Von Estorff, U.; Crutzen, S.

    1996-01-01

    Several European institutions and organisations and the Joint Research Centre have developed co-operative programmes now organised into Networks for mutual benefit. They include utilities, engineering companies, Research and Development laboratories and regulatory bodies. Networks are organised and managed like the successful Programme for the Inspection of Steel Components (PISC). The JRC's Institute for Advanced Materials of the European Commission plays the role of Operating Agent and manager of these Networks: ENIQ. AMES, NESC, each of them dealing with specific aspect of fitness for purpose of materials in structural components. This paper describes the structure and the objectives of these networks. Particular emphasis is given to the network AMES

  8. Transitions from Trees to Cycles in Adaptive Flow Networks

    Directory of Open Access Journals (Sweden)

    Erik A. Martens

    2017-11-01

    Full Text Available 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 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. 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 distinct regions with cyclic and tree-like structures. The location of the boundary between these two regions is determined by the amplitude of the fluctuations. These findings may explain why natural transport networks display cyclic structures in the micro-vascular regions near terminal nodes, but tree-like features in the regions with larger veins.

  9. Global-local feature attention network with reranking strategy for image caption generation

    Science.gov (United States)

    Wu, Jie; Xie, Si-ya; Shi, Xin-bao; Chen, Yao-wen

    2017-11-01

    In this paper, a novel framework, named as global-local feature attention network with reranking strategy (GLAN-RS), is presented for image captioning task. Rather than only adopting unitary visual information in the classical models, GLAN-RS explores the attention mechanism to capture local convolutional salient image maps. Furthermore, we adopt reranking strategy to adjust the priority of the candidate captions and select the best one. The proposed model is verified using the Microsoft Common Objects in Context (MSCOCO) benchmark dataset across seven standard evaluation metrics. Experimental results show that GLAN-RS significantly outperforms the state-of-the-art approaches, such as multimodal recurrent neural network (MRNN) and Google NIC, which gets an improvement of 20% in terms of BLEU4 score and 13 points in terms of CIDER score.

  10. Structure-function relationship in complex brain networks expressed by hierarchical synchronization

    International Nuclear Information System (INIS)

    Zhou Changsong; Zemanova, Lucia; Zamora-Lopez, Gorka; Hilgetag, Claus C; Kurths, Juergen

    2007-01-01

    The brain is one of the most complex systems in nature, with a structured complex connectivity. Recently, large-scale corticocortical connectivities, both structural and functional, have received a great deal of research attention, especially using the approach of complex network analysis. Understanding the relationship between structural and functional connectivity is of crucial importance in neuroscience. Here we try to illuminate this relationship by studying synchronization dynamics in a realistic anatomical network of cat cortical connectivity. We model the nodes (cortical areas) by a neural mass model (population model) or by a subnetwork of interacting excitable neurons (multilevel model). We show that if the dynamics is characterized by well-defined oscillations (neural mass model and subnetworks with strong couplings), the synchronization patterns are mainly determined by the node intensity (total input strengths of a node) and the detailed network topology is rather irrelevant. On the other hand, the multilevel model with weak couplings displays more irregular, biologically plausible dynamics, and the synchronization patterns reveal a hierarchical cluster organization in the network structure. The relationship between structural and functional connectivity at different levels of synchronization is explored. Thus, the study of synchronization in a multilevel complex network model of cortex can provide insights into the relationship between network topology and functional organization of complex brain networks

  11. Structure-function relationship in complex brain networks expressed by hierarchical synchronization

    Energy Technology Data Exchange (ETDEWEB)

    Zhou Changsong [Institute of Physics, University of Potsdam, PF 601553, 14415 Potsdam (Germany); Zemanova, Lucia [Institute of Physics, University of Potsdam, PF 601553, 14415 Potsdam (Germany); Zamora-Lopez, Gorka [Institute of Physics, University of Potsdam, PF 601553, 14415 Potsdam (Germany); Hilgetag, Claus C [Jacobs University Bremen, Campus Ring 6, Rm 116, D-28759 Bremen (Germany); Kurths, Juergen [Institute of Physics, University of Potsdam, PF 601553, 14415 Potsdam (Germany)

    2007-06-15

    The brain is one of the most complex systems in nature, with a structured complex connectivity. Recently, large-scale corticocortical connectivities, both structural and functional, have received a great deal of research attention, especially using the approach of complex network analysis. Understanding the relationship between structural and functional connectivity is of crucial importance in neuroscience. Here we try to illuminate this relationship by studying synchronization dynamics in a realistic anatomical network of cat cortical connectivity. We model the nodes (cortical areas) by a neural mass model (population model) or by a subnetwork of interacting excitable neurons (multilevel model). We show that if the dynamics is characterized by well-defined oscillations (neural mass model and subnetworks with strong couplings), the synchronization patterns are mainly determined by the node intensity (total input strengths of a node) and the detailed network topology is rather irrelevant. On the other hand, the multilevel model with weak couplings displays more irregular, biologically plausible dynamics, and the synchronization patterns reveal a hierarchical cluster organization in the network structure. The relationship between structural and functional connectivity at different levels of synchronization is explored. Thus, the study of synchronization in a multilevel complex network model of cortex can provide insights into the relationship between network topology and functional organization of complex brain networks.

  12. Effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons

    International Nuclear Information System (INIS)

    Li, Chun-Hsien; Yang, Suh-Yuh

    2015-01-01

    This work is devoted to investigate the effects of network structure on the synchronizability of nonlinearly coupled dynamical network of Hindmarsh–Rose neurons with a sigmoidal coupling function. We mainly focus on the networks that exhibit the small-world character or scale-free property. By checking the first nonzero eigenvalue of the outer-coupling matrix, which is closely related to the synchronization threshold, the synchronizabilities of three specific network ensembles with prescribed network structures are compared. Interestingly, we find that networks with more connections will not necessarily result in better synchronizability. - Highlights: • We investigate the effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons. • We mainly consider the networks that exhibit the small-world character or scale-free property. • The synchronizability of three specific network ensembles with prescribed network structures are compared. • Networks with more connections will not necessarily result in better synchronizability

  13. Effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons

    Energy Technology Data Exchange (ETDEWEB)

    Li, Chun-Hsien, E-mail: chli@nknucc.nknu.edu.tw [Department of Mathematics, National Kaohsiung Normal University, Yanchao District, Kaohsiung City 82444, Taiwan (China); Yang, Suh-Yuh, E-mail: syyang@math.ncu.edu.tw [Department of Mathematics, National Central University, Jhongli District, Taoyuan City 32001, Taiwan (China)

    2015-10-23

    This work is devoted to investigate the effects of network structure on the synchronizability of nonlinearly coupled dynamical network of Hindmarsh–Rose neurons with a sigmoidal coupling function. We mainly focus on the networks that exhibit the small-world character or scale-free property. By checking the first nonzero eigenvalue of the outer-coupling matrix, which is closely related to the synchronization threshold, the synchronizabilities of three specific network ensembles with prescribed network structures are compared. Interestingly, we find that networks with more connections will not necessarily result in better synchronizability. - Highlights: • We investigate the effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh–Rose neurons. • We mainly consider the networks that exhibit the small-world character or scale-free property. • The synchronizability of three specific network ensembles with prescribed network structures are compared. • Networks with more connections will not necessarily result in better synchronizability.

  14. TreeNetViz: revealing patterns of networks over tree structures.

    Science.gov (United States)

    Gou, Liang; Zhang, Xiaolong Luke

    2011-12-01

    Network data often contain important attributes from various dimensions such as social affiliations and areas of expertise in a social network. If such attributes exhibit a tree structure, visualizing a compound graph consisting of tree and network structures becomes complicated. How to visually reveal patterns of a network over a tree has not been fully studied. In this paper, we propose a compound graph model, TreeNet, to support visualization and analysis of a network at multiple levels of aggregation over a tree. We also present a visualization design, TreeNetViz, to offer the multiscale and cross-scale exploration and interaction of a TreeNet graph. TreeNetViz uses a Radial, Space-Filling (RSF) visualization to represent the tree structure, a circle layout with novel optimization to show aggregated networks derived from TreeNet, and an edge bundling technique to reduce visual complexity. Our circular layout algorithm reduces both total edge-crossings and edge length and also considers hierarchical structure constraints and edge weight in a TreeNet graph. These experiments illustrate that the algorithm can reduce visual cluttering in TreeNet graphs. Our case study also shows that TreeNetViz has the potential to support the analysis of a compound graph by revealing multiscale and cross-scale network patterns. © 2011 IEEE

  15. Brain networks, structural realism, and local approaches to the scientific realism debate.

    Science.gov (United States)

    Yan, Karen; Hricko, Jonathon

    2017-08-01

    We examine recent work in cognitive neuroscience that investigates brain networks. Brain networks are characterized by the ways in which brain regions are functionally and anatomically connected to one another. Cognitive neuroscientists use various noninvasive techniques (e.g., fMRI) to investigate these networks. They represent them formally as graphs. And they use various graph theoretic techniques to analyze them further. We distinguish between knowledge of the graph theoretic structure of such networks (structural knowledge) and knowledge of what instantiates that structure (nonstructural knowledge). And we argue that this work provides structural knowledge of brain networks. We explore the significance of this conclusion for the scientific realism debate. We argue that our conclusion should not be understood as an instance of a global structural realist claim regarding the structure of the unobservable part of the world, but instead, as a local structural realist attitude towards brain networks in particular. And we argue that various local approaches to the realism debate, i.e., approaches that restrict realist commitments to particular theories and/or entities, are problematic insofar as they don't allow for the possibility of such a local structural realist attitude. Copyright © 2017 Elsevier Ltd. All rights reserved.

  16. Learning Orthographic Structure With Sequential Generative Neural Networks.

    Science.gov (United States)

    Testolin, Alberto; Stoianov, Ivilin; Sperduti, Alessandro; Zorzi, Marco

    2016-04-01

    Learning the structure of event sequences is a ubiquitous problem in cognition and particularly in language. One possible solution is to learn a probabilistic generative model of sequences that allows making predictions about upcoming events. Though appealing from a neurobiological standpoint, this approach is typically not pursued in connectionist modeling. Here, we investigated a sequential version of the restricted Boltzmann machine (RBM), a stochastic recurrent neural network that extracts high-order structure from sensory data through unsupervised generative learning and can encode contextual information in the form of internal, distributed representations. We assessed whether this type of network can extract the orthographic structure of English monosyllables by learning a generative model of the letter sequences forming a word training corpus. We show that the network learned an accurate probabilistic model of English graphotactics, which can be used to make predictions about the letter following a given context as well as to autonomously generate high-quality pseudowords. The model was compared to an extended version of simple recurrent networks, augmented with a stochastic process that allows autonomous generation of sequences, and to non-connectionist probabilistic models (n-grams and hidden Markov models). We conclude that sequential RBMs and stochastic simple recurrent networks are promising candidates for modeling cognition in the temporal domain. Copyright © 2015 Cognitive Science Society, Inc.

  17. Multimodal Hyper-connectivity Networks for MCI Classification.

    Science.gov (United States)

    Li, Yang; Gao, Xinqiang; Jie, Biao; Yap, Pew-Thian; Kim, Min-Jeong; Wee, Chong-Yaw; Shen, Dinggang

    2017-09-01

    Hyper-connectivity network is a network where every edge is connected to more than two nodes, and can be naturally denoted using a hyper-graph. Hyper-connectivity brain network, either based on structural or functional interactions among the brain regions, has been used for brain disease diagnosis. However, the conventional hyper-connectivity network is constructed solely based on single modality data, ignoring potential complementary information conveyed by other modalities. The integration of complementary information from multiple modalities has been shown to provide a more comprehensive representation about the brain disruptions. In this paper, a novel multimodal hyper-network modelling method was proposed for improving the diagnostic accuracy of mild cognitive impairment (MCI). Specifically, we first constructed a multimodal hyper-connectivity network by simultaneously considering information from diffusion tensor imaging and resting-state functional magnetic resonance imaging data. We then extracted different types of network features from the hyper-connectivity network, and further exploited a manifold regularized multi-task feature selection method to jointly select the most discriminative features. Our proposed multimodal hyper-connectivity network demonstrated a better MCI classification performance than the conventional single modality based hyper-connectivity networks.

  18. Classification of intelligence quotient via brainwave sub-band power ratio features and artificial neural network.

    Science.gov (United States)

    Jahidin, A H; Megat Ali, M S A; Taib, M N; Tahir, N Md; Yassin, I M; Lias, S

    2014-04-01

    This paper elaborates on the novel intelligence assessment method using the brainwave sub-band power ratio features. The study focuses only on the left hemisphere brainwave in its relaxed state. Distinct intelligence quotient groups have been established earlier from the score of the Raven Progressive Matrices. Sub-band power ratios are calculated from energy spectral density of theta, alpha and beta frequency bands. Synthetic data have been generated to increase dataset from 50 to 120. The features are used as input to the artificial neural network. Subsequently, the brain behaviour model has been developed using an artificial neural network that is trained with optimized learning rate, momentum constant and hidden nodes. Findings indicate that the distinct intelligence quotient groups can be classified from the brainwave sub-band power ratios with 100% training and 88.89% testing accuracies. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.

  19. Structural and functional networks in complex systems with delay.

    Science.gov (United States)

    Eguíluz, Víctor M; Pérez, Toni; Borge-Holthoefer, Javier; Arenas, Alex

    2011-05-01

    Functional networks of complex systems are obtained from the analysis of the temporal activity of their components, and are often used to infer their unknown underlying connectivity. We obtain the equations relating topology and function in a system of diffusively delay-coupled elements in complex networks. We solve exactly the resulting equations in motifs (directed structures of three nodes) and in directed networks. The mean-field solution for directed uncorrelated networks shows that the clusterization of the activity is dominated by the in-degree of the nodes, and that the locking frequency decreases with increasing average degree. We find that the exponent of a power law degree distribution of the structural topology γ is related to the exponent of the associated functional network as α=(2-γ)(-1) for γ<2. © 2011 American Physical Society

  20. Community Structure in Online Collegiate Social Networks

    Science.gov (United States)

    Traud, Amanda; Kelsic, Eric; Mucha, Peter; Porter, Mason

    2009-03-01

    Online social networking sites have become increasingly popular with college students. The networks we studied are defined through ``friendships'' indicated by Facebook users from UNC, Oklahoma, Caltech, Georgetown, and Princeton. We apply the tools of network science to study the Facebook networks from these five different universities at a single point in time. We investigate each single-institution network's community structure, which we obtain through partitioning the graph using an eigenvector method. We use both graphical and quantitative tools, including pair-counting methods, which we interpret through statistical analysis and permutation tests to measure the correlations between the network communities and a set of characteristics given by each user (residence, class year, major, and high school). We also analyze the single gender subsets of these networks, and the impact of missing demographical data. Our study allows us to compare the online social networks for the five schools as well as infer differences in offline social interactions. At the schools studied, we were able to define which characteristics of the Facebook users correlate best with friendships.

  1. Network Structure, Collaborative Context, and Individual Creativity

    DEFF Research Database (Denmark)

    Soda, Giuseppe; Stea, Diego; Pedersen, Torben

    2017-01-01

    The debate on whether bonding or bridging ties are more beneficial for acquiring knowledge that is conducive to individual creativity has mostly overlooked the context in which such ties are formed. We challenge the widespread assumption that closed, heavily bonded networks imply a collaborative...... attitude on the part of the embedded actors and propose that the level of collaboration in a network can be independent from that network’s structural characteristics, such that it moderates the effects of closed and brokering network positions on the acquisition of knowledge that supports creativity....... Individuals embedded in closed networks acquire more knowledge and become more creative when the level of collaboration in their network is high. Brokers who arbitrage information across disconnected contacts acquire more knowledge and become more creative when collaboration is low. An analysis of employee...

  2. Long-term reorganization of structural brain networks in a rabbit model of intrauterine growth restriction.

    Science.gov (United States)

    Batalle, Dafnis; Muñoz-Moreno, Emma; Arbat-Plana, Ariadna; Illa, Miriam; Figueras, Francesc; Eixarch, Elisenda; Gratacos, Eduard

    2014-10-15

    Characterization of brain changes produced by intrauterine growth restriction (IUGR) is among the main challenges of modern fetal medicine and pediatrics. This condition affects 5-10% of all pregnancies and is associated with a wide range of neurodevelopmental disorders. Better understanding of the brain reorganization produced by IUGR opens a window of opportunity to find potential imaging biomarkers in order to identify the infants with a high risk of having neurodevelopmental problems and apply therapies to improve their outcomes. Structural brain networks obtained from diffusion magnetic resonance imaging (MRI) is a promising tool to study brain reorganization and to be used as a biomarker of neurodevelopmental alterations. In the present study this technique is applied to a rabbit animal model of IUGR, which presents some advantages including a controlled environment and the possibility to obtain high quality MRI with long acquisition times. Using a Q-Ball diffusion model, and a previously published rabbit brain MRI atlas, structural brain networks of 15 IUGR and 14 control rabbits at 70 days of age (equivalent to pre-adolescence human age) were obtained. The analysis of graph theory features showed a decreased network infrastructure (degree and binary global efficiency) associated with IUGR condition and a set of generalized fractional anisotropy (GFA) weighted measures associated with abnormal neurobehavior. Interestingly, when assessing the brain network organization independently of network infrastructure by means of normalized networks, IUGR showed increased global and local efficiencies. We hypothesize that this effect could reflect a compensatory response to reduced infrastructure in IUGR. These results present new evidence on the long-term persistence of the brain reorganization produced by IUGR that could underlie behavioral and developmental alterations previously described. The described changes in network organization have the potential to be used

  3. A Feature-Based Structural Measure: An Image Similarity Measure for Face Recognition

    Directory of Open Access Journals (Sweden)

    Noor Abdalrazak Shnain

    2017-08-01

    Full Text Available Facial recognition is one of the most challenging and interesting problems within the field of computer vision and pattern recognition. During the last few years, it has gained special attention due to its importance in relation to current issues such as security, surveillance systems and forensics analysis. Despite this high level of attention to facial recognition, the success is still limited by certain conditions; there is no method which gives reliable results in all situations. In this paper, we propose an efficient similarity index that resolves the shortcomings of the existing measures of feature and structural similarity. This measure, called the Feature-Based Structural Measure (FSM, combines the best features of the well-known SSIM (structural similarity index measure and FSIM (feature similarity index measure approaches, striking a balance between performance for similar and dissimilar images of human faces. In addition to the statistical structural properties provided by SSIM, edge detection is incorporated in FSM as a distinctive structural feature. Its performance is tested for a wide range of PSNR (peak signal-to-noise ratio, using ORL (Olivetti Research Laboratory, now AT&T Laboratory Cambridge and FEI (Faculty of Industrial Engineering, São Bernardo do Campo, São Paulo, Brazil databases. The proposed measure is tested under conditions of Gaussian noise; simulation results show that the proposed FSM outperforms the well-known SSIM and FSIM approaches in its efficiency of similarity detection and recognition of human faces.

  4. GANN: Genetic algorithm neural networks for the detection of conserved combinations of features in DNA

    Directory of Open Access Journals (Sweden)

    Beiko Robert G

    2005-02-01

    Full Text Available Abstract Background The multitude of motif detection algorithms developed to date have largely focused on the detection of patterns in primary sequence. Since sequence-dependent DNA structure and flexibility may also play a role in protein-DNA interactions, the simultaneous exploration of sequence- and structure-based hypotheses about the composition of binding sites and the ordering of features in a regulatory region should be considered as well. The consideration of structural features requires the development of new detection tools that can deal with data types other than primary sequence. Results GANN (available at http://bioinformatics.org.au/gann is a machine learning tool for the detection of conserved features in DNA. The software suite contains programs to extract different regions of genomic DNA from flat files and convert these sequences to indices that reflect sequence and structural composition or the presence of specific protein binding sites. The machine learning component allows the classification of different types of sequences based on subsamples of these indices, and can identify the best combinations of indices and machine learning architecture for sequence discrimination. Another key feature of GANN is the replicated splitting of data into training and test sets, and the implementation of negative controls. In validation experiments, GANN successfully merged important sequence and structural features to yield good predictive models for synthetic and real regulatory regions. Conclusion GANN is a flexible tool that can search through large sets of sequence and structural feature combinations to identify those that best characterize a set of sequences.

  5. Effect of synapse dilution on the memory retrieval in structured attractor neural networks

    Science.gov (United States)

    Brunel, N.

    1993-08-01

    We investigate a simple model of structured attractor neural network (ANN). In this network a module codes for the category of the stored information, while another group of neurons codes for the remaining information. The probability distribution of stabilities of the patterns and the prototypes of the categories are calculated, for two different synaptic structures. The stability of the prototypes is shown to increase when the fraction of neurons coding for the category goes down. Then the effect of synapse destruction on the retrieval is studied in two opposite situations : first analytically in sparsely connected networks, then numerically in completely connected ones. In both cases the behaviour of the structured network and that of the usual homogeneous networks are compared. When lesions increase, two transitions are shown to appear in the behaviour of the structured network when one of the patterns is presented to the network. After the first transition the network recognizes the category of the pattern but not the individual pattern. After the second transition the network recognizes nothing. These effects are similar to syndromes caused by lesions in the central visual system, namely prosopagnosia and agnosia. In both types of networks (structured or homogeneous) the stability of the prototype is greater than the stability of individual patterns, however the first transition, for completely connected networks, occurs only when the network is structured.

  6. Oscillatory neuronal activity reflects lexical-semantic feature integration within and across sensory modalities in distributed cortical networks.

    Science.gov (United States)

    van Ackeren, Markus J; Schneider, Till R; Müsch, Kathrin; Rueschemeyer, Shirley-Ann

    2014-10-22

    Research from the previous decade suggests that word meaning is partially stored in distributed modality-specific cortical networks. However, little is known about the mechanisms by which semantic content from multiple modalities is integrated into a coherent multisensory representation. Therefore we aimed to characterize differences between integration of lexical-semantic information from a single modality compared with two sensory modalities. We used magnetoencephalography in humans to investigate changes in oscillatory neuronal activity while participants verified two features for a given target word (e.g., "bus"). Feature pairs consisted of either two features from the same modality (visual: "red," "big") or different modalities (auditory and visual: "red," "loud"). The results suggest that integrating modality-specific features of the target word is associated with enhanced high-frequency power (80-120 Hz), while integrating features from different modalities is associated with a sustained increase in low-frequency power (2-8 Hz). Source reconstruction revealed a peak in the anterior temporal lobe for low-frequency and high-frequency effects. These results suggest that integrating lexical-semantic knowledge at different cortical scales is reflected in frequency-specific oscillatory neuronal activity in unisensory and multisensory association networks. Copyright © 2014 the authors 0270-6474/14/3314318-06$15.00/0.

  7. Romanian network for structural integrity assessment of nuclear components

    International Nuclear Information System (INIS)

    Roth, Maria; Constantinescu, Dan Mihai; Brad, Sebastian; Ducu, Catalin

    2008-01-01

    Full text: Based of the Romanian option to develop and operate nuclear facilities, using as model the networks created at European level and taking into account the international importance of the structural integrity assessments for lifetime extension of the nuclear components, a national Project started since 2005 in the framework of the National Program 'Research of Excellence', Modulus I 2006-2008, managed by the Ministry of Education and Research. Entitled 'Integrated Network for Structural Integrity Monitoring of Critical Components in Nuclear Facilities', with the acronym RIMIS, the Project had two main objectives: - to elaborate a procedure applicable to the structural integrity assessment of the critical components used in Romanian nuclear facilities; - to integrate the national networking in a similar one, at European level, to enhance the scientific significance of Romanian R and D organizations as well as to increase the contribution to solving one of the major issue of the nuclear field. The paper aimed to present the activities performed in the Romanian institutes, involved in the Project, the final results obtained as part of the R and D activities, including experimental, theoretical and modeling ones regarding structural integrity assessment of nuclear components employed in CANDU type reactors. Also the activity carried out in the framework of the NULIFE network, created at European level of the FP6 Program and sustained by the RIMIS network will be described. (authors)

  8. NCI National Clinical Trials Network Structure

    Science.gov (United States)

    Learn about how the National Clinical Trials Network (NCTN) is structured. The NCTN is a program of the National Cancer Institute that gives funds and other support to cancer research organizations to conduct cancer clinical trials.

  9. Research on Community Structure in Bus Transport Networks

    International Nuclear Information System (INIS)

    Yang Xuhua; Wang Bo; Sun Youxian

    2009-01-01

    We abstract the bus transport networks (BTNs) to two kinds of complex networks with space L and space P methods respectively. Using improved community detecting algorithm (PKM agglomerative algorithm), we analyze the community property of two kinds of BTNs graphs. The results show that the BTNs graph described with space L method have obvious community property, but the other kind of BTNs graph described with space P method have not. The reason is that the BTNs graph described with space P method have the intense overlapping community property and general community division algorithms can not identify this kind of community structure. To overcome this problem, we propose a novel community structure called N-depth community and present a corresponding community detecting algorithm, which can detect overlapping community. Applying the novel community structure and detecting algorithm to a BTN evolution model described with space P, whose network property agrees well with real BTNs', we get obvious community property. (general)

  10. Face recognition via Gabor and convolutional neural network

    Science.gov (United States)

    Lu, Tongwei; Wu, Menglu; Lu, Tao

    2018-04-01

    In recent years, the powerful feature learning and classification ability of convolutional neural network have attracted widely attention. Compared with the deep learning, the traditional machine learning algorithm has a good explanatory which deep learning does not have. Thus, In this paper, we propose a method to extract the feature of the traditional algorithm as the input of convolution neural network. In order to reduce the complexity of the network, the kernel function of Gabor wavelet is used to extract the feature from different position, frequency and direction of target image. It is sensitive to edge of image which can provide good direction and scale selection. The extraction of the image from eight directions on a scale are as the input of network that we proposed. The network have the advantage of weight sharing and local connection and texture feature of the input image can reduce the influence of facial expression, gesture and illumination. At the same time, we introduced a layer which combined the results of the pooling and convolution can extract deeper features. The training network used the open source caffe framework which is beneficial to feature extraction. The experiment results of the proposed method proved that the network structure effectively overcame the barrier of illumination and had a good robustness as well as more accurate and rapid than the traditional algorithm.

  11. The influence of target structure on topographical features produced by ion beam sputtering

    International Nuclear Information System (INIS)

    Whitton, J.L.; Grant, W.A.

    1981-01-01

    Ion beam erosion of solid surfaces often results in the development of distinctive topographical features. The relationship between the type of features formed by ion erosion and target structure has been investigated. Single crystals of copper and nickel and the amorphous alloy Metglas have been bombarded to high doses (approx. >=10 19 ions cm -2 ) with 40 keV Ar + and P + . Topography changes were monitored using SEM and structural changes by TEM. Targets that retain their long range crystallinity show sharply defined, regular features that are related to the target structure. Targets that are highly disordered, either intrinsically or as a result of the ion bombardment, produce diffuse, smaller features. Those differences are observed at all stages in topographical evolution. (orig.)

  12. Active influence in dynamical models of structural balance in social networks

    Science.gov (United States)

    Summers, Tyler H.; Shames, Iman

    2013-07-01

    We consider a nonlinear dynamical system on a signed graph, which can be interpreted as a mathematical model of social networks in which the links can have both positive and negative connotations. In accordance with a concept from social psychology called structural balance, the negative links play a key role in both the structure and dynamics of the network. Recent research has shown that in a nonlinear dynamical system modeling the time evolution of “friendliness levels” in the network, two opposing factions emerge from almost any initial condition. Here we study active external influence in this dynamical model and show that any agent in the network can achieve any desired structurally balanced state from any initial condition by perturbing its own local friendliness levels. Based on this result, we also introduce a new network centrality measure for signed networks. The results are illustrated in an international-relations network using United Nations voting record data from 1946 to 2008 to estimate friendliness levels amongst various countries.

  13. Structure identification and adaptive synchronization of uncertain general complex dynamical networks

    International Nuclear Information System (INIS)

    Xu Yuhua; Zhou Wuneng; Fang Jian'an; Lu Hongqian

    2009-01-01

    This Letter proposes an approach to identify the topological structure and unknown parameters for uncertain general complex networks simultaneously. By designing effective adaptive controllers, we achieve synchronization between two complex networks. The unknown network topological structure and system parameters of uncertain general complex dynamical networks are identified simultaneously in the process of synchronization. Several useful criteria for synchronization are given. Finally, an illustrative example is presented to demonstrate the application of the theoretical results.

  14. Structure identification and adaptive synchronization of uncertain general complex dynamical networks

    Energy Technology Data Exchange (ETDEWEB)

    Xu Yuhua, E-mail: yuhuaxu2004@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China) and Department of Maths, Yunyang Teacher' s College, Hubei 442000 (China); Zhou Wuneng, E-mail: wnzhou@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Fang Jian' an [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Lu Hongqian [Shandong Institute of Light Industry, Shandong Jinan 250353 (China)

    2009-12-28

    This Letter proposes an approach to identify the topological structure and unknown parameters for uncertain general complex networks simultaneously. By designing effective adaptive controllers, we achieve synchronization between two complex networks. The unknown network topological structure and system parameters of uncertain general complex dynamical networks are identified simultaneously in the process of synchronization. Several useful criteria for synchronization are given. Finally, an illustrative example is presented to demonstrate the application of the theoretical results.

  15. Cascaded ensemble of convolutional neural networks and handcrafted features for mitosis detection

    Science.gov (United States)

    Wang, Haibo; Cruz-Roa, Angel; Basavanhally, Ajay; Gilmore, Hannah; Shih, Natalie; Feldman, Mike; Tomaszewski, John; Gonzalez, Fabio; Madabhushi, Anant

    2014-03-01

    Breast cancer (BCa) grading plays an important role in predicting disease aggressiveness and patient outcome. A key component of BCa grade is mitotic count, which involves quantifying the number of cells in the process of dividing (i.e. undergoing mitosis) at a specific point in time. Currently mitosis counting is done manually by a pathologist looking at multiple high power fields on a glass slide under a microscope, an extremely laborious and time consuming process. The development of computerized systems for automated detection of mitotic nuclei, while highly desirable, is confounded by the highly variable shape and appearance of mitoses. Existing methods use either handcrafted features that capture certain morphological, statistical or textural attributes of mitoses or features learned with convolutional neural networks (CNN). While handcrafted features are inspired by the domain and the particular application, the data-driven CNN models tend to be domain agnostic and attempt to learn additional feature bases that cannot be represented through any of the handcrafted features. On the other hand, CNN is computationally more complex and needs a large number of labeled training instances. Since handcrafted features attempt to model domain pertinent attributes and CNN approaches are largely unsupervised feature generation methods, there is an appeal to attempting to combine these two distinct classes of feature generation strategies to create an integrated set of attributes that can potentially outperform either class of feature extraction strategies individually. In this paper, we present a cascaded approach for mitosis detection that intelligently combines a CNN model and handcrafted features (morphology, color and texture features). By employing a light CNN model, the proposed approach is far less demanding computationally, and the cascaded strategy of combining handcrafted features and CNN-derived features enables the possibility of maximizing performance by

  16. Feature Set Evaluation for Offline Handwriting Recognition Systems: Application to the Recurrent Neural Network Model.

    Science.gov (United States)

    Chherawala, Youssouf; Roy, Partha Pratim; Cheriet, Mohamed

    2016-12-01

    The performance of handwriting recognition systems is dependent on the features extracted from the word image. A large body of features exists in the literature, but no method has yet been proposed to identify the most promising of these, other than a straightforward comparison based on the recognition rate. In this paper, we propose a framework for feature set evaluation based on a collaborative setting. We use a weighted vote combination of recurrent neural network (RNN) classifiers, each trained with a particular feature set. This combination is modeled in a probabilistic framework as a mixture model and two methods for weight estimation are described. The main contribution of this paper is to quantify the importance of feature sets through the combination weights, which reflect their strength and complementarity. We chose the RNN classifier because of its state-of-the-art performance. Also, we provide the first feature set benchmark for this classifier. We evaluated several feature sets on the IFN/ENIT and RIMES databases of Arabic and Latin script, respectively. The resulting combination model is competitive with state-of-the-art systems.

  17. Displacement and deformation measurement for large structures by camera network

    Science.gov (United States)

    Shang, Yang; Yu, Qifeng; Yang, Zhen; Xu, Zhiqiang; Zhang, Xiaohu

    2014-03-01

    A displacement and deformation measurement method for large structures by a series-parallel connection camera network is presented. By taking the dynamic monitoring of a large-scale crane in lifting operation as an example, a series-parallel connection camera network is designed, and the displacement and deformation measurement method by using this series-parallel connection camera network is studied. The movement range of the crane body is small, and that of the crane arm is large. The displacement of the crane body, the displacement of the crane arm relative to the body and the deformation of the arm are measured. Compared with a pure series or parallel connection camera network, the designed series-parallel connection camera network can be used to measure not only the movement and displacement of a large structure but also the relative movement and deformation of some interesting parts of the large structure by a relatively simple optical measurement system.

  18. Autonomous smart sensor network for full-scale structural health monitoring

    Science.gov (United States)

    Rice, Jennifer A.; Mechitov, Kirill A.; Spencer, B. F., Jr.; Agha, Gul A.

    2010-04-01

    The demands of aging infrastructure require effective methods for structural monitoring and maintenance. Wireless smart sensor networks offer the ability to enhance structural health monitoring (SHM) practices through the utilization of onboard computation to achieve distributed data management. Such an approach is scalable to the large number of sensor nodes required for high-fidelity modal analysis and damage detection. While smart sensor technology is not new, the number of full-scale SHM applications has been limited. This slow progress is due, in part, to the complex network management issues that arise when moving from a laboratory setting to a full-scale monitoring implementation. This paper presents flexible network management software that enables continuous and autonomous operation of wireless smart sensor networks for full-scale SHM applications. The software components combine sleep/wake cycling for enhanced power management with threshold detection for triggering network wide tasks, such as synchronized sensing or decentralized modal analysis, during periods of critical structural response.

  19. Structural dimensions of knowledge-action networks for sustainability

    Science.gov (United States)

    Tischa A. Munoz; B.B. Cutts

    2016-01-01

    Research on the influence of social network structure over flows of knowledge in support of sustainability governance and action has recently flourished. These studies highlight three challenges to evaluating knowledge-action networks: first, defining boundaries; second, characterizing power distributions; and third, identifying obstacles to knowledge sharing and...

  20. Epidemic spreading in weighted scale-free networks with community structure

    International Nuclear Information System (INIS)

    Chu, Xiangwei; Guan, Jihong; Zhang, Zhongzhi; Zhou, Shuigeng

    2009-01-01

    Many empirical studies reveal that the weights and community structure are ubiquitous in various natural and artificial networks. In this paper, based on the SI disease model, we investigate the epidemic spreading in weighted scale-free networks with community structure. Two exponents, α and β, are introduced to weight the internal edges and external edges, respectively; and a tunable probability parameter q is also introduced to adjust the strength of community structure. We find the external weighting exponent β plays a much more important role in slackening the epidemic spreading and reducing the danger brought by the epidemic than the internal weighting exponent α. Moreover, a novel result we find is that the strong community structure is no longer helpful for slackening the danger brought by the epidemic in the weighted cases. In addition, we show the hierarchical dynamics of the epidemic spreading in the weighted scale-free networks with communities which is also displayed in the famous BA scale-free networks

  1. Detecting the overlapping and hierarchical community structure in complex networks

    International Nuclear Information System (INIS)

    Lancichinetti, Andrea; Fortunato, Santo; Kertesz, Janos

    2009-01-01

    Many networks in nature, society and technology are characterized by a mesoscopic level of organization, with groups of nodes forming tightly connected units, called communities or modules, that are only weakly linked to each other. Uncovering this community structure is one of the most important problems in the field of complex networks. Networks often show a hierarchical organization, with communities embedded within other communities; moreover, nodes can be shared between different communities. Here, we present the first algorithm that finds both overlapping communities and the hierarchical structure. The method is based on the local optimization of a fitness function. Community structure is revealed by peaks in the fitness histogram. The resolution can be tuned by a parameter enabling different hierarchical levels of organization to be investigated. Tests on real and artificial networks give excellent results.

  2. The Meso-level Structure of F/OSS Collaboration Network

    DEFF Research Database (Denmark)

    Conald, Guido; Rullani, Francesco

    2010-01-01

    Social networks in Free/Open Source Software (F/OSS) have been usually analyzed at the level of the single project e.g., [6], or at the level of a whole ecology of projects, e.g., [33]. In this paper, we also investigate the social network generated by developers who collaborate to one or multiple...... F/OSS projects, but we focus on the less-studied meso-level structure emerging when applying to this network a community-detection technique. The network of ‘communities’ emerging from this analysis links sub-groups of densely connected developers, sub-groups that are smaller than the components...... of the network but larger than the teams working on single projects. Our results reveal the complexity of this meso-level structure, where several dense sub-groups of developers are connected by sparse collaboration among different sub-groups. We discuss the theoretical implications of our findings...

  3. Imaging structural and functional brain networks in temporal lobe epilepsy

    Science.gov (United States)

    Bernhardt, Boris C.; Hong, SeokJun; Bernasconi, Andrea; Bernasconi, Neda

    2013-01-01

    Early imaging studies in temporal lobe epilepsy (TLE) focused on the search for mesial temporal sclerosis, as its surgical removal results in clinically meaningful improvement in about 70% of patients. Nevertheless, a considerable subgroup of patients continues to suffer from post-operative seizures. Although the reasons for surgical failure are not fully understood, electrophysiological and imaging data suggest that anomalies extending beyond the temporal lobe may have negative impact on outcome. This hypothesis has revived the concept of human epilepsy as a disorder of distributed brain networks. Recent methodological advances in non-invasive neuroimaging have led to quantify structural and functional networks in vivo. While structural networks can be inferred from diffusion MRI tractography and inter-regional covariance patterns of structural measures such as cortical thickness, functional connectivity is generally computed based on statistical dependencies of neurophysiological time-series, measured through functional MRI or electroencephalographic techniques. This review considers the application of advanced analytical methods in structural and functional connectivity analyses in TLE. We will specifically highlight findings from graph-theoretical analysis that allow assessing the topological organization of brain networks. These studies have provided compelling evidence that TLE is a system disorder with profound alterations in local and distributed networks. In addition, there is emerging evidence for the utility of network properties as clinical diagnostic markers. Nowadays, a network perspective is considered to be essential to the understanding of the development, progression, and management of epilepsy. PMID:24098281

  4. Imaging structural and functional brain networks in temporal lobe epilepsy.

    Science.gov (United States)

    Bernhardt, Boris C; Hong, Seokjun; Bernasconi, Andrea; Bernasconi, Neda

    2013-10-01

    Early imaging studies in temporal lobe epilepsy (TLE) focused on the search for mesial temporal sclerosis, as its surgical removal results in clinically meaningful improvement in about 70% of patients. Nevertheless, a considerable subgroup of patients continues to suffer from post-operative seizures. Although the reasons for surgical failure are not fully understood, electrophysiological and imaging data suggest that anomalies extending beyond the temporal lobe may have negative impact on outcome. This hypothesis has revived the concept of human epilepsy as a disorder of distributed brain networks. Recent methodological advances in non-invasive neuroimaging have led to quantify structural and functional networks in vivo. While structural networks can be inferred from diffusion MRI tractography and inter-regional covariance patterns of structural measures such as cortical thickness, functional connectivity is generally computed based on statistical dependencies of neurophysiological time-series, measured through functional MRI or electroencephalographic techniques. This review considers the application of advanced analytical methods in structural and functional connectivity analyses in TLE. We will specifically highlight findings from graph-theoretical analysis that allow assessing the topological organization of brain networks. These studies have provided compelling evidence that TLE is a system disorder with profound alterations in local and distributed networks. In addition, there is emerging evidence for the utility of network properties as clinical diagnostic markers. Nowadays, a network perspective is considered to be essential to the understanding of the development, progression, and management of epilepsy.

  5. Imaging structural and functional brain networks in temporal lobe epilepsy

    Directory of Open Access Journals (Sweden)

    Boris eBernhardt

    2013-10-01

    Full Text Available Early imaging studies in temporal lobe epilepsy (TLE focused on the search for mesial temporal sclerosis, as its surgical removal results in clinically meaningful improvement in about 70% of patients. Nevertheless, a considerable subgroup of patients continues to suffer from post-operative seizures. Although the reasons for surgical failure are not fully understood, electrophysiological and imaging data suggest that anomalies extending beyond the temporal lobe may have negative impact on outcome. This hypothesis has revived the concept of human epilepsy as a disorder of distributed brain networks. Recent methodological advances in non-invasive neuroimaging have led to quantify structural and functional networks in vivo. While structural networks can be inferred from diffusion MRI tractography and inter-regional covariance patterns of structural measures such as cortical thickness, functional connectivity is generally computed based on statistical dependencies of neurophysiological time-series, measured through functional MRI or electroencephalographic techniques. This review considers the application of advanced analytical methods in structural and functional connectivity analyses in TLE. We will specifically highlight findings from graph-theoretical analysis that allow assessing topological organization of brain networks. These studies have provided compelling evidence that TLE is a system disorder with profound alterations in local and distributed networks. In addition, there is emerging evidence for the utility of network properties as clinical diagnostic markers. Nowadays, a network perspective is considered to be essential to the understanding of the development, progression, and management of epilepsy.

  6. Measuring structural similarity in large online networks.

    Science.gov (United States)

    Shi, Yongren; Macy, Michael

    2016-09-01

    Structural similarity based on bipartite graphs can be used to detect meaningful communities, but the networks have been tiny compared to massive online networks. Scalability is important in applications involving tens of millions of individuals with highly skewed degree distributions. Simulation analysis holding underlying similarity constant shows that two widely used measures - Jaccard index and cosine similarity - are biased by the distribution of out-degree in web-scale networks. However, an alternative measure, the Standardized Co-incident Ratio (SCR), is unbiased. We apply SCR to members of Congress, musical artists, and professional sports teams to show how massive co-following on Twitter can be used to map meaningful affiliations among cultural entities, even in the absence of direct connections to one another. Our results show how structural similarity can be used to map cultural alignments and demonstrate the potential usefulness of social media data in the study of culture, politics, and organizations across the social and behavioral sciences. Copyright © 2016 Elsevier Inc. All rights reserved.

  7. Ranking Features on Psychological Dynamics of Cooperative Team Work through Bayesian Networks

    Directory of Open Access Journals (Sweden)

    Pilar Fuster-Parra

    2016-05-01

    Full Text Available The aim of this study is to rank some features that characterize the psychological dynamics of cooperative team work in order to determine priorities for interventions and formation: leading positive feedback, cooperative manager and collaborative manager features. From a dataset of 20 cooperative sport teams (403 soccer players, the characteristics of the prototypical sports teams are studied using an average Bayesian network (BN and two special types of BNs, the Bayesian classifiers: naive Bayes (NB and tree augmented naive Bayes (TAN. BNs are selected as they are able to produce probability estimates rather than predictions. BN results show that the antecessors (the “top” features ranked are the team members’ expectations and their attraction to the social aspects of the task. The main node is formed by the cooperative behaviors, the consequences ranked at the BN bottom (ratified by the TAN trees and the instantiations made, the roles assigned to the members and their survival inside the same team. These results should help managers to determine contents and priorities when they have to face team-building actions.

  8. Scatter networks: a new approach for analysing information scatter

    International Nuclear Information System (INIS)

    Adamic, Lada A; Suresh, K; Shi Xiaolin

    2007-01-01

    Information on any given topic is often scattered across the Web. Previously this scatter has been characterized through the inequality of distribution of facts (i.e. pieces of information) across webpages. Such an approach conceals how specific facts (e.g. rare facts) occur in specific types of pages (e.g. fact-rich pages). To reveal such regularities, we construct bipartite networks, consisting of two types of vertices: the facts contained in webpages and the webpages themselves. Such a representation enables the application of a series of network analysis techniques, revealing structural features such as connectivity, robustness and clustering. Not only does network analysis yield new insights into information scatter, but we also illustrate the benefit of applying new and existing analysis techniques directly to a bipartite network as opposed to its one-mode projection. We discuss the implications of each network feature to the users' ability to find comprehensive information online. Finally, we compare the bipartite graph structure of webpages and facts with the hyperlink structure between the webpages

  9. Scale-invariant feature extraction of neural network and renormalization group flow

    Science.gov (United States)

    Iso, Satoshi; Shiba, Shotaro; Yokoo, Sumito

    2018-05-01

    Theoretical understanding of how a deep neural network (DNN) extracts features from input images is still unclear, but it is widely believed that the extraction is performed hierarchically through a process of coarse graining. It reminds us of the basic renormalization group (RG) concept in statistical physics. In order to explore possible relations between DNN and RG, we use the restricted Boltzmann machine (RBM) applied to an Ising model and construct a flow of model parameters (in particular, temperature) generated by the RBM. We show that the unsupervised RBM trained by spin configurations at various temperatures from T =0 to T =6 generates a flow along which the temperature approaches the critical value Tc=2.2 7 . This behavior is the opposite of the typical RG flow of the Ising model. By analyzing various properties of the weight matrices of the trained RBM, we discuss why it flows towards Tc and how the RBM learns to extract features of spin configurations.

  10. Coevolution of game and network structure with adjustable linking

    Science.gov (United States)

    Qin, Shao-Meng; Zhang, Guo-Yong; Chen, Yong

    2009-12-01

    Most papers about the evolutionary game on graph assume the statistic network structure. However, in the real world, social interaction could change the relationship among people. And the change of social structure will also affect people’s strategies. We build a coevolution model of prisoner’s dilemma game and network structure to study the dynamic interaction in the real world. Differing from other coevolution models, players rewire their network connections according to the density of cooperation and other players’ payoffs. We use a parameter α to control the effect of payoff in the process of rewiring. Based on the asynchronous update rule and Monte Carlo simulation, we find that, when players prefer to rewire their links to those who are richer, the temptation can increase the cooperation density.

  11. Evolution of students’ friendship networks: Examining the influence of group size

    Directory of Open Access Journals (Sweden)

    Valentina Sokolovska

    2017-01-01

    Full Text Available  The main aim of this study was to examine the effect of the network size on formation and evolution of students’ friendship relations. Data was collected from two groups of sociology freshmen: a group from the University of Belgrade, which represents a larger group, and a group from the University of Novi Sad, which represents a smaller group. The data was collected in three periods of one academic year. We analyzed the structural features of students’ networks and constructed a stochastic model of network evolution in order to explore how friendships form and change during one year. The results showed that structural features of the larger and the smaller group differ in each stage of friendship formation. At the beginning of group forming, small world structure was noticeable in the larger group, although full small world structure was not confirmed in both groups. Furthermore, transitivity of triads had effect on the evolution of the larger network, while balance or structural equivalence had effect on the evolution of the smaller network. Results of the structural analysis are in line with findings of the network evolution model and together they provide an insight into how friendship evolves in groups of different sizes.

  12. Information Propagation in Complex Networks : Structures and Dynamics

    NARCIS (Netherlands)

    Märtens, M.

    2018-01-01

    This thesis is a contribution to a deeper understanding of how information propagates and what this process entails. At its very core is the concept of the network: a collection of nodes and links, which describes the structure of the systems under investigation. The network is a mathematical model

  13. Polarized DIS Structure Functions from Neural Networks

    International Nuclear Information System (INIS)

    Del Debbio, L.; Guffanti, A.; Piccione, A.

    2007-01-01

    We present a parametrization of polarized Deep-Inelastic-Scattering (DIS) structure functions based on Neural Networks. The parametrization provides a bias-free determination of the probability measure in the space of structure functions, which retains information on experimental errors and correlations. As an example we discuss the application of this method to the study of the structure function g 1 p (x,Q 2 )

  14. Resolving anatomical and functional structure in human brain organization: identifying mesoscale organization in weighted network representations.

    Science.gov (United States)

    Lohse, Christian; Bassett, Danielle S; Lim, Kelvin O; Carlson, Jean M

    2014-10-01

    Human brain anatomy and function display a combination of modular and hierarchical organization, suggesting the importance of both cohesive structures and variable resolutions in the facilitation of healthy cognitive processes. However, tools to simultaneously probe these features of brain architecture require further development. We propose and apply a set of methods to extract cohesive structures in network representations of brain connectivity using multi-resolution techniques. We employ a combination of soft thresholding, windowed thresholding, and resolution in community detection, that enable us to identify and isolate structures associated with different weights. One such mesoscale structure is bipartivity, which quantifies the extent to which the brain is divided into two partitions with high connectivity between partitions and low connectivity within partitions. A second, complementary mesoscale structure is modularity, which quantifies the extent to which the brain is divided into multiple communities with strong connectivity within each community and weak connectivity between communities. Our methods lead to multi-resolution curves of these network diagnostics over a range of spatial, geometric, and structural scales. For statistical comparison, we contrast our results with those obtained for several benchmark null models. Our work demonstrates that multi-resolution diagnostic curves capture complex organizational profiles in weighted graphs. We apply these methods to the identification of resolution-specific characteristics of healthy weighted graph architecture and altered connectivity profiles in psychiatric disease.

  15. Numerical Leak Detection in a Pipeline Network of Complex Structure with Unsteady Flow

    Science.gov (United States)

    Aida-zade, K. R.; Ashrafova, E. R.

    2017-12-01

    An inverse problem for a pipeline network of complex loopback structure is solved numerically. The problem is to determine the locations and amounts of leaks from unsteady flow characteristics measured at some pipeline points. The features of the problem include impulse functions involved in a system of hyperbolic differential equations, the absence of classical initial conditions, and boundary conditions specified as nonseparated relations between the states at the endpoints of adjacent pipeline segments. The problem is reduced to a parametric optimal control problem without initial conditions, but with nonseparated boundary conditions. The latter problem is solved by applying first-order optimization methods. Results of numerical experiments are presented.

  16. Network structure shapes spontaneous functional connectivity dynamics.

    Science.gov (United States)

    Shen, Kelly; Hutchison, R Matthew; Bezgin, Gleb; Everling, Stefan; McIntosh, Anthony R

    2015-04-08

    The structural organization of the brain constrains the range of interactions between different regions and shapes ongoing information processing. Therefore, it is expected that large-scale dynamic functional connectivity (FC) patterns, a surrogate measure of coordination between brain regions, will be closely tied to the fiber pathways that form the underlying structural network. Here, we empirically examined the influence of network structure on FC dynamics by comparing resting-state FC (rsFC) obtained using BOLD-fMRI in macaques (Macaca fascicularis) to structural connectivity derived from macaque axonal tract tracing studies. Consistent with predictions from simulation studies, the correspondence between rsFC and structural connectivity increased as the sample duration increased. Regions with reciprocal structural connections showed the most stable rsFC across time. The data suggest that the transient nature of FC is in part dependent on direct underlying structural connections, but also that dynamic coordination can occur via polysynaptic pathways. Temporal stability was found to be dependent on structural topology, with functional connections within the rich-club core exhibiting the greatest stability over time. We discuss these findings in light of highly variable functional hubs. The results further elucidate how large-scale dynamic functional coordination exists within a fixed structural architecture. Copyright © 2015 the authors 0270-6474/15/355579-10$15.00/0.

  17. NetTurnP – Neural Network Prediction of Beta-turns by Use of Evolutionary Information and Predicted Protein Sequence Features

    DEFF Research Database (Denmark)

    Petersen, Bent; Lundegaard, Claus; Petersen, Thomas Nordahl

    2010-01-01

    is the highest reported performance on a two-class prediction of β-turn and not-β-turn. Furthermore NetTurnP shows improved performance on some of the specific β-turn types. In the present work, neural network methods have been trained to predict β-turn or not and individual β-turn types from the primary amino......β-turns are the most common type of non-repetitive structures, and constitute on average 25% of the amino acids in proteins. The formation of β-turns plays an important role in protein folding, protein stability and molecular recognition processes. In this work we present the neural network method...... NetTurnP, for prediction of two-class β-turns and prediction of the individual β-turn types, by use of evolutionary information and predicted protein sequence features. It has been evaluated against a commonly used dataset BT426, and achieves a Matthews correlation coefficient of 0.50, which...

  18. Multiplicative Attribute Graph Model of Real-World Networks

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Myunghwan [Stanford Univ., CA (United States); Leskovec, Jure [Stanford Univ., CA (United States)

    2010-10-20

    Large scale real-world network data, such as social networks, Internet andWeb graphs, is ubiquitous in a variety of scientific domains. The study of such social and information networks commonly finds patterns and explain their emergence through tractable models. In most networks, especially in social networks, nodes also have a rich set of attributes (e.g., age, gender) associatedwith them. However, most of the existing network models focus only on modeling the network structure while ignoring the features of nodes in the network. Here we present a class of network models that we refer to as the Multiplicative Attribute Graphs (MAG), which naturally captures the interactions between the network structure and node attributes. We consider a model where each node has a vector of categorical features associated with it. The probability of an edge between a pair of nodes then depends on the product of individual attributeattribute similarities. The model yields itself to mathematical analysis as well as fit to real data. We derive thresholds for the connectivity, the emergence of the giant connected component, and show that the model gives rise to graphs with a constant diameter. Moreover, we analyze the degree distribution to show that the model can produce networks with either lognormal or power-law degree distribution depending on certain conditions.

  19. A Comparison of Online Social Networks and Real-Life Social Networks: A Study of Sina Microblogging

    Directory of Open Access Journals (Sweden)

    Dayong Zhang

    2014-01-01

    Full Text Available Online social networks appear to enrich our social life, which raises the question whether they remove cognitive constraints on human communication and improve human social capabilities. In this paper, we analyze the users' following and followed relationships based on the data of Sina Microblogging and reveal several structural properties of Sina Microblogging. Compared with real-life social networks, our results confirm some similar features. However, Sina Microblogging also shows its own specialties, such as hierarchical structure and degree disassortativity, which all mark a deviation from real-life social networks. The low cost of the online network forms a broader perspective, and the one-way link relationships make it easy to spread information, but the online social network does not make too much difference in the creation of strong interpersonal relationships. Finally, we describe the mechanisms for the formation of these characteristics and discuss the implications of these structural properties for the real-life social networks.

  20. Structural Approaches to Sequence Evolution Molecules, Networks, Populations

    CERN Document Server

    Bastolla, Ugo; Roman, H. Eduardo; Vendruscolo, Michele

    2007-01-01

    Structural requirements constrain the evolution of biological entities at all levels, from macromolecules to their networks, right up to populations of biological organisms. Classical models of molecular evolution, however, are focused at the level of the symbols - the biological sequence - rather than that of their resulting structure. Now recent advances in understanding the thermodynamics of macromolecules, the topological properties of gene networks, the organization and mutation capabilities of genomes, and the structure of populations make it possible to incorporate these key elements into a broader and deeply interdisciplinary view of molecular evolution. This book gives an account of such a new approach, through clear tutorial contributions by leading scientists specializing in the different fields involved.

  1. Features analysis for identification of date and party hubs in protein interaction network of Saccharomyces Cerevisiae

    Directory of Open Access Journals (Sweden)

    Araabi Babak N

    2010-12-01

    Full Text Available Abstract Background It has been understood that biological networks have modular organizations which are the sources of their observed complexity. Analysis of networks and motifs has shown that two types of hubs, party hubs and date hubs, are responsible for this complexity. Party hubs are local coordinators because of their high co-expressions with their partners, whereas date hubs display low co-expressions and are assumed as global connectors. However there is no mutual agreement on these concepts in related literature with different studies reporting their results on different data sets. We investigated whether there is a relation between the biological features of Saccharomyces Cerevisiae's proteins and their roles as non-hubs, intermediately connected, party hubs, and date hubs. We propose a classifier that separates these four classes. Results We extracted different biological characteristics including amino acid sequences, domain contents, repeated domains, functional categories, biological processes, cellular compartments, disordered regions, and position specific scoring matrix from various sources. Several classifiers are examined and the best feature-sets based on average correct classification rate and correlation coefficients of the results are selected. We show that fusion of five feature-sets including domains, Position Specific Scoring Matrix-400, cellular compartments level one, and composition pairs with two and one gaps provide the best discrimination with an average correct classification rate of 77%. Conclusions We study a variety of known biological feature-sets of the proteins and show that there is a relation between domains, Position Specific Scoring Matrix-400, cellular compartments level one, composition pairs with two and one gaps of Saccharomyces Cerevisiae's proteins, and their roles in the protein interaction network as non-hubs, intermediately connected, party hubs and date hubs. This study also confirms the

  2. Structure of Small World Innovation Network and Learning Performance

    Directory of Open Access Journals (Sweden)

    Shuang Song

    2014-01-01

    Full Text Available This paper examines the differences of learning performance of 5 MNCs (multinational corporations that filed the largest number of patents in China. We establish the innovation network with the patent coauthorship data by these 5 MNCs and classify the networks by the tail of distribution curve of connections. To make a comparison of the learning performance of these 5 MNCs with differing network structures, we develop an organization learning model by regarding the reality as having m dimensions, which denotes the heterogeneous knowledge about the reality. We further set n innovative individuals that are mutually interactive and own unique knowledge about the reality. A longer (shorter distance between the knowledge of the individual and the reality denotes a lower (higher knowledge level of that individual. Individuals interact with and learn from each other within the small-world network. By making 1,000 numerical simulations and averaging the simulated results, we find that the differing structure of the small-world network leads to the differences of learning performance between these 5 MNCs. The network monopolization negatively impacts and network connectivity positively impacts learning performance. Policy implications in the conclusion section suggest that to improve firm learning performance, it is necessary to establish a flat and connective network.

  3. Resolving structural variability in network models and the brain.

    Directory of Open Access Journals (Sweden)

    Florian Klimm

    2014-03-01

    Full Text Available Large-scale white matter pathways crisscrossing the cortex create a complex pattern of connectivity that underlies human cognitive function. Generative mechanisms for this architecture have been difficult to identify in part because little is known in general about mechanistic drivers of structured networks. Here we contrast network properties derived from diffusion spectrum imaging data of the human brain with 13 synthetic network models chosen to probe the roles of physical network embedding and temporal network growth. We characterize both the empirical and synthetic networks using familiar graph metrics, but presented here in a more complete statistical form, as scatter plots and distributions, to reveal the full range of variability of each measure across scales in the network. We focus specifically on the degree distribution, degree assortativity, hierarchy, topological Rentian scaling, and topological fractal scaling--in addition to several summary statistics, including the mean clustering coefficient, the shortest path-length, and the network diameter. The models are investigated in a progressive, branching sequence, aimed at capturing different elements thought to be important in the brain, and range from simple random and regular networks, to models that incorporate specific growth rules and constraints. We find that synthetic models that constrain the network nodes to be physically embedded in anatomical brain regions tend to produce distributions that are most similar to the corresponding measurements for the brain. We also find that network models hardcoded to display one network property (e.g., assortativity do not in general simultaneously display a second (e.g., hierarchy. This relative independence of network properties suggests that multiple neurobiological mechanisms might be at play in the development of human brain network architecture. Together, the network models that we develop and employ provide a potentially useful

  4. Regulation of metabolic networks by small molecule metabolites

    Directory of Open Access Journals (Sweden)

    Kanehisa Minoru

    2007-03-01

    Full Text Available Abstract Background The ability to regulate metabolism is a fundamental process in living systems. We present an analysis of one of the mechanisms by which metabolic regulation occurs: enzyme inhibition and activation by small molecules. We look at the network properties of this regulatory system and the relationship between the chemical properties of regulatory molecules. Results We find that many features of the regulatory network, such as the degree and clustering coefficient, closely match those of the underlying metabolic network. While these global features are conserved across several organisms, we do find local differences between regulation in E. coli and H. sapiens which reflect their different lifestyles. Chemical structure appears to play an important role in determining a compounds suitability for use in regulation. Chemical structure also often determines how groups of similar compounds can regulate sets of enzymes. These groups of compounds and the enzymes they regulate form modules that mirror the modules and pathways of the underlying metabolic network. We also show how knowledge of chemical structure and regulation could be used to predict regulatory interactions for drugs. Conclusion The metabolic regulatory network shares many of the global properties of the metabolic network, but often varies at the level of individual compounds. Chemical structure is a key determinant in deciding how a compound is used in regulation and for defining modules within the regulatory system.

  5. Neuronal avalanches in complex networks

    Directory of Open Access Journals (Sweden)

    Victor Hernandez-Urbina

    2016-12-01

    Full Text Available Brain networks are neither regular nor random. Their structure allows for optimal information processing and transmission across the entire neural substrate of an organism. However, for topological features to be appropriately harnessed, brain networks should implement a dynamical regime which prevents phase-locked and chaotic behaviour. Critical neural dynamics refer to a dynamical regime in which the system is poised at the boundary between regularity and randomness. It has been reported that neural systems poised at this boundary achieve maximum computational power. In this paper, we review recent results regarding critical neural dynamics that emerge from systems whose underlying structure exhibits complex network properties.

  6. Structural and robustness properties of smart-city transportation networks

    International Nuclear Information System (INIS)

    Zhang Zhen-Gang; Ding Zhuo; Fan Jing-Fang; Chen Xiao-Song; Meng Jun; Ye Fang-Fu; Ding Yi-Min

    2015-01-01

    The concept of smart city gives an excellent resolution to construct and develop modern cities, and also demands infrastructure construction. How to build a safe, stable, and highly efficient public transportation system becomes an important topic in the process of city construction. In this work, we study the structural and robustness properties of transportation networks and their sub-networks. We introduce a complementary network model to study the relevance and complementarity between bus network and subway network. Our numerical results show that the mutual supplement of networks can improve the network robustness. This conclusion provides a theoretical basis for the construction of public traffic networks, and it also supports reasonable operation of managing smart cities. (rapid communication)

  7. Structure constrained by metadata in networks of chess players.

    Science.gov (United States)

    Almeira, Nahuel; Schaigorodsky, Ana L; Perotti, Juan I; Billoni, Orlando V

    2017-11-09

    Chess is an emblematic sport that stands out because of its age, popularity and complexity. It has served to study human behavior from the perspective of a wide number of disciplines, from cognitive skills such as memory and learning, to aspects like innovation and decision-making. Given that an extensive documentation of chess games played throughout history is available, it is possible to perform detailed and statistically significant studies about this sport. Here we use one of the most extensive chess databases in the world to construct two networks of chess players. One of the networks includes games that were played over-the-board and the other contains games played on the Internet. We study the main topological characteristics of the networks, such as degree distribution and correlations, transitivity and community structure. We complement the structural analysis by incorporating players' level of play as node metadata. Although both networks are topologically different, we show that in both cases players gather in communities according to their expertise and that an emergent rich-club structure, composed by the top-rated players, is also present.

  8. Approximating spectral impact of structural perturbations in large networks

    CERN Document Server

    Milanese, A; Nishikawa, Takashi; Sun, Jie

    2010-01-01

    Determining the effect of structural perturbations on the eigenvalue spectra of networks is an important problem because the spectra characterize not only their topological structures, but also their dynamical behavior, such as synchronization and cascading processes on networks. Here we develop a theory for estimating the change of the largest eigenvalue of the adjacency matrix or the extreme eigenvalues of the graph Laplacian when small but arbitrary set of links are added or removed from the network. We demonstrate the effectiveness of our approximation schemes using both real and artificial networks, showing in particular that we can accurately obtain the spectral ranking of small subgraphs. We also propose a local iterative scheme which computes the relative ranking of a subgraph using only the connectivity information of its neighbors within a few links. Our results may not only contribute to our theoretical understanding of dynamical processes on networks, but also lead to practical applications in ran...

  9. A wireless sensor network design and evaluation for large structural strain field monitoring

    International Nuclear Information System (INIS)

    Qiu, Zixue; Wu, Jian; Yuan, Shenfang

    2011-01-01

    Structural strain changes under external environmental or mechanical loads are the main monitoring parameters in structural health monitoring or mechanical property tests. This paper presents a wireless sensor network designed for monitoring large structural strain field variation. First of all, a precision strain sensor node is designed for multi-channel strain gauge signal conditioning and wireless monitoring. In order to establish a synchronous strain data acquisition network, the cluster-star network synchronization method is designed in detail. To verify the functionality of the designed wireless network for strain field monitoring capability, a multi-point network evaluation system is developed for an experimental aluminum plate structure for load variation monitoring. Based on the precision wireless strain nodes, the wireless data acquisition network is deployed to synchronously gather, process and transmit strain gauge signals and monitor results under concentrated loads. This paper shows the efficiency of the wireless sensor network for large structural strain field monitoring

  10. Biological transportation networks: Modeling and simulation

    KAUST Repository

    Albi, Giacomo

    2015-09-15

    We present a model for biological network formation originally introduced by Cai and Hu [Adaptation and optimization of biological transport networks, Phys. Rev. Lett. 111 (2013) 138701]. The modeling of fluid transportation (e.g., leaf venation and angiogenesis) and ion transportation networks (e.g., neural networks) is explained in detail and basic analytical features like the gradient flow structure of the fluid transportation network model and the impact of the model parameters on the geometry and topology of network formation are analyzed. We also present a numerical finite-element based discretization scheme and discuss sample cases of network formation simulations.

  11. Automatic Correction Algorithm of Hyfrology Feature Attribute in National Geographic Census

    Science.gov (United States)

    Li, C.; Guo, P.; Liu, X.

    2017-09-01

    A subset of the attributes of hydrologic features data in national geographic census are not clear, the current solution to this problem was through manual filling which is inefficient and liable to mistakes. So this paper proposes an automatic correction algorithm of hydrologic features attribute. Based on the analysis of the structure characteristics and topological relation, we put forward three basic principles of correction which include network proximity, structure robustness and topology ductility. Based on the WJ-III map workstation, we realize the automatic correction of hydrologic features. Finally, practical data is used to validate the method. The results show that our method is highly reasonable and efficient.

  12. Role of long- and short-range hydrophobic, hydrophilic and charged residues contact network in protein’s structural organization

    Directory of Open Access Journals (Sweden)

    Sengupta Dhriti

    2012-06-01

    higher interaction strength between amino acids, give extra stability to the tertiary structure of the thermophiles. All the subnetworks at different length scales (ARNs, LRNs and SRNs show assortativity mixing property of their participating amino acids. While there exists a significant higher percentage of hydrophobic subclusters over others in ARNs and LRNs; we do not find the assortative mixing behaviour of any the subclusters in SRNs. The clustering coefficient of hydrophobic subclusters in long-range network is the highest among types of subnetworks. There exist highly cliquish hydrophobic nodes followed by charged nodes in LRNs and ARNs; on the other hand, we observe the highest dominance of charged residues cliques in short-range networks. Studies on the perimeter of the cliques also show higher occurrences of hydrophobic and charged residues’ cliques. Conclusions The simple framework of protein contact networks and their subnetworks based on London van der Waals force is able to capture several known properties of protein structure as well as can unravel several new features. The thermophiles do not only have the higher number of long-range interactions; they also have larger cluster of connected residues at higher interaction strengths among amino acids, than their mesophilic counterparts. It can reestablish the significant role of long-range hydrophobic clusters in protein folding and stabilization; at the same time, it shed light on the higher communication ability of hydrophobic subnetworks over the others. The results give an indication of the controlling role of hydrophobic subclusters in determining protein’s folding rate. The occurrences of higher perimeters of hydrophobic and charged cliques imply the role of charged residues as well as hydrophobic residues in stabilizing the distant part of primary structure of a protein through London van der Waals interaction.

  13. Fragmented Romanian sociology: growth and structure of the collaboration network.

    Science.gov (United States)

    Hâncean, Marian-Gabriel; Perc, Matjaž; Vlăsceanu, Lazăr

    2014-01-01

    Structural patterns in collaboration networks are essential for understanding how new ideas, research practices, innovation or cooperation circulate and develop within academic communities and between and within university departments. In our research, we explore and investigate the structure of the collaboration network formed by the academics working full-time within all the 17 sociology departments across Romania. We show that the collaboration network is sparse and fragmented, and that it constitutes an environment that does not promote the circulation of new ideas and innovation within the field. Although recent years have witnessed an increase in the productivity of Romanian sociologists, there is still ample room for improvement in terms of the interaction infrastructure that ought to link individuals together so that they could maximize their potentials. We also fail to discern evidence in favor of the Matthew effect governing the growth of the network, which suggests scientific success and productivity are not rewarded. Instead, the structural properties of the collaboration network are partly those of a core-periphery network, where the spread of innovation and change can be explained by structural equivalence rather than by interpersonal influence models. We also provide support for the idea that, within the observed network, collaboration is the product of homophily rather than prestige effects. Further research on the subject based on data from other countries in the region is needed to place our results in a comparative framework, in particular to discern whether the behavior of the Romanian sociologist community is unique or rather common.

  14. Protein secondary structure prediction using modular reciprocal bidirectional recurrent neural networks.

    Science.gov (United States)

    Babaei, Sepideh; Geranmayeh, Amir; Seyyedsalehi, Seyyed Ali

    2010-12-01

    The supervised learning of recurrent neural networks well-suited for prediction of protein secondary structures from the underlying amino acids sequence is studied. Modular reciprocal recurrent neural networks (MRR-NN) are proposed to model the strong correlations between adjacent secondary structure elements. Besides, a multilayer bidirectional recurrent neural network (MBR-NN) is introduced to capture the long-range intramolecular interactions between amino acids in formation of the secondary structure. The final modular prediction system is devised based on the interactive integration of the MRR-NN and the MBR-NN structures to arbitrarily engage the neighboring effects of the secondary structure types concurrent with memorizing the sequential dependencies of amino acids along the protein chain. The advanced combined network augments the percentage accuracy (Q₃) to 79.36% and boosts the segment overlap (SOV) up to 70.09% when tested on the PSIPRED dataset in three-fold cross-validation. Copyright © 2010 Elsevier Ireland Ltd. All rights reserved.

  15. Structural covariance networks across the life span, from 6 to 94 years of age

    Directory of Open Access Journals (Sweden)

    Elizabeth DuPre

    2017-10-01

    Full Text Available Structural covariance examines covariation of gray matter morphology between brain regions and across individuals. Despite significant interest in the influence of age on structural covariance patterns, no study to date has provided a complete life span perspective—bridging childhood with early, middle, and late adulthood—on the development of structural covariance networks. Here, we investigate the life span trajectories of structural covariance in six canonical neurocognitive networks: default, dorsal attention, frontoparietal control, somatomotor, ventral attention, and visual. By combining data from five open-access data sources, we examine the structural covariance trajectories of these networks from 6 to 94 years of age in a sample of 1,580 participants. Using partial least squares, we show that structural covariance patterns across the life span exhibit two significant, age-dependent trends. The first trend is a stable pattern whose integrity declines over the life span. The second trend is an inverted-U that differentiates young adulthood from other age groups. Hub regions, including posterior cingulate cortex and anterior insula, appear particularly influential in the expression of this second age-dependent trend. Overall, our results suggest that structural covariance provides a reliable definition of neurocognitive networks across the life span and reveal both shared and network-specific trajectories. The importance of life span perspectives is increasingly apparent in understanding normative interactions of large-scale neurocognitive networks. Although recent work has made significant strides in understanding the functional and structural connectivity of these networks, there has been comparatively little attention to life span trajectories of structural covariance networks. In this study we examine patterns of structural covariance across the life span for six neurocognitive networks. Our results suggest that networks exhibit

  16. Analysis of the structure of complex networks at different resolution levels

    International Nuclear Information System (INIS)

    Arenas, A; Fernandez, A; Gomez, S

    2008-01-01

    Modular structure is ubiquitous in real-world complex networks, and its detection is important because it gives insights into the structure-functionality relationship. The standard approach is based on the optimization of a quality function, modularity, which is a relative quality measure for the partition of a network into modules. Recently, some authors (Fortunato and Barthelemy 2007 Proc. Natl Acad. Sci. USA 104 36 and Kumpula et al 2007 Eur. Phys. J. B 56 41) have pointed out that the optimization of modularity has a fundamental drawback: the existence of a resolution limit beyond which no modular structure can be detected even though these modules might have their own entity. The reason is that several topological descriptions of the network coexist at different scales, which is, in general, a fingerprint of complex systems. Here, we propose a method that allows for multiple resolution screening of the modular structure. The method has been validated using synthetic networks, discovering the predefined structures at all scales. Its application to two real social networks allows us to find the exact splits reported in the literature, as well as the substructure beyond the actual split

  17. Structure versus time in the evolutionary diversification of avian carotenoid metabolic networks.

    Science.gov (United States)

    Morrison, Erin S; Badyaev, Alexander V

    2018-05-01

    Historical associations of genes and proteins are thought to delineate pathways available to subsequent evolution; however, the effects of past functional involvements on contemporary evolution are rarely quantified. Here, we examined the extent to which the structure of a carotenoid enzymatic network persists in avian evolution. Specifically, we tested whether the evolution of carotenoid networks was most concordant with phylogenetically structured expansion from core reactions of common ancestors or with subsampling of biochemical pathway modules from an ancestral network. We compared structural and historical associations in 467 carotenoid networks of extant and ancestral species and uncovered the overwhelming effect of pre-existing metabolic network structure on carotenoid diversification over the last 50 million years of avian evolution. Over evolutionary time, birds repeatedly subsampled and recombined conserved biochemical modules, which likely maintained the overall structure of the carotenoid metabolic network during avian evolution. These findings explain the recurrent convergence of evolutionary distant species in carotenoid metabolism and weak phylogenetic signal in avian carotenoid evolution. Remarkable retention of an ancient metabolic structure throughout extensive and prolonged ecological diversification in avian carotenoid metabolism illustrates a fundamental requirement of organismal evolution - historical continuity of a deterministic network that links past and present functional associations of its components. © 2018 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2018 European Society For Evolutionary Biology.

  18. Maximum-entropy networks pattern detection, network reconstruction and graph combinatorics

    CERN Document Server

    Squartini, Tiziano

    2017-01-01

    This book is an introduction to maximum-entropy models of random graphs with given topological properties and their applications. Its original contribution is the reformulation of many seemingly different problems in the study of both real networks and graph theory within the unified framework of maximum entropy. Particular emphasis is put on the detection of structural patterns in real networks, on the reconstruction of the properties of networks from partial information, and on the enumeration and sampling of graphs with given properties.  After a first introductory chapter explaining the motivation, focus, aim and message of the book, chapter 2 introduces the formal construction of maximum-entropy ensembles of graphs with local topological constraints. Chapter 3 focuses on the problem of pattern detection in real networks and provides a powerful way to disentangle nontrivial higher-order structural features from those that can be traced back to simpler local constraints. Chapter 4 focuses on the problem o...

  19. Structural covariance networks across healthy young adults and their consistency.

    Science.gov (United States)

    Guo, Xiaojuan; Wang, Yan; Guo, Taomei; Chen, Kewei; Zhang, Jiacai; Li, Ke; Jin, Zhen; Yao, Li

    2015-08-01

    To investigate structural covariance networks (SCNs) as measured by regional gray matter volumes with structural magnetic resonance imaging (MRI) from healthy young adults, and to examine their consistency and stability. Two independent cohorts were included in this study: Group 1 (82 healthy subjects aged 18-28 years) and Group 2 (109 healthy subjects aged 20-28 years). Structural MRI data were acquired at 3.0T and 1.5T using a magnetization prepared rapid-acquisition gradient echo sequence for these two groups, respectively. We applied independent component analysis (ICA) to construct SCNs and further applied the spatial overlap ratio and correlation coefficient to evaluate the spatial consistency of the SCNs between these two datasets. Seven and six independent components were identified for Group 1 and Group 2, respectively. Moreover, six SCNs including the posterior default mode network, the visual and auditory networks consistently existed across the two datasets. The overlap ratios and correlation coefficients of the visual network reached the maximums of 72% and 0.71. This study demonstrates the existence of consistent SCNs corresponding to general functional networks. These structural covariance findings may provide insight into the underlying organizational principles of brain anatomy. © 2014 Wiley Periodicals, Inc.

  20. Development of Human Brain Structural Networks Through Infancy and Childhood

    Science.gov (United States)

    Huang, Hao; Shu, Ni; Mishra, Virendra; Jeon, Tina; Chalak, Lina; Wang, Zhiyue J.; Rollins, Nancy; Gong, Gaolang; Cheng, Hua; Peng, Yun; Dong, Qi; He, Yong

    2015-01-01

    During human brain development through infancy and childhood, microstructural and macrostructural changes take place to reshape the brain's structural networks and better adapt them to sophisticated functional and cognitive requirements. However, structural topological configuration of the human brain during this specific development period is not well understood. In this study, diffusion magnetic resonance image (dMRI) of 25 neonates, 13 toddlers, and 25 preadolescents were acquired to characterize network dynamics at these 3 landmark cross-sectional ages during early childhood. dMRI tractography was used to construct human brain structural networks, and the underlying topological properties were quantified by graph-theory approaches. Modular organization and small-world attributes are evident at birth with several important topological metrics increasing monotonically during development. Most significant increases of regional nodes occur in the posterior cingulate cortex, which plays a pivotal role in the functional default mode network. Positive correlations exist between nodal efficiencies and fractional anisotropy of the white matter traced from these nodes, while correlation slopes vary among the brain regions. These results reveal substantial topological reorganization of human brain structural networks through infancy and childhood, which is likely to be the outcome of both heterogeneous strengthening of the major white matter tracts and pruning of other axonal fibers. PMID:24335033

  1. Rolling bearing fault feature learning using improved convolutional deep belief network with compressed sensing

    Science.gov (United States)

    Shao, Haidong; Jiang, Hongkai; Zhang, Haizhou; Duan, Wenjing; Liang, Tianchen; Wu, Shuaipeng

    2018-02-01

    The vibration signals collected from rolling bearing are usually complex and non-stationary with heavy background noise. Therefore, it is a great challenge to efficiently learn the representative fault features of the collected vibration signals. In this paper, a novel method called improved convolutional deep belief network (CDBN) with compressed sensing (CS) is developed for feature learning and fault diagnosis of rolling bearing. Firstly, CS is adopted for reducing the vibration data amount to improve analysis efficiency. Secondly, a new CDBN model is constructed with Gaussian visible units to enhance the feature learning ability for the compressed data. Finally, exponential moving average (EMA) technique is employed to improve the generalization performance of the constructed deep model. The developed method is applied to analyze the experimental rolling bearing vibration signals. The results confirm that the developed method is more effective than the traditional methods.

  2. Robust Learning of Fixed-Structure Bayesian Networks

    OpenAIRE

    Diakonikolas, Ilias; Kane, Daniel; Stewart, Alistair

    2016-01-01

    We investigate the problem of learning Bayesian networks in an agnostic model where an $\\epsilon$-fraction of the samples are adversarially corrupted. Our agnostic learning model is similar to -- in fact, stronger than -- Huber's contamination model in robust statistics. In this work, we study the fully observable Bernoulli case where the structure of the network is given. Even in this basic setting, previous learning algorithms either run in exponential time or lose dimension-dependent facto...

  3. Structure-based control of complex networks with nonlinear dynamics.

    Science.gov (United States)

    Zañudo, Jorge Gomez Tejeda; Yang, Gang; Albert, Réka

    2017-07-11

    What can we learn about controlling a system solely from its underlying network structure? Here we adapt a recently developed framework for control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic models of biological, technological, and social processes. This feedback-based framework provides realizable node overrides that steer a system toward any of its natural long-term dynamic behaviors, regardless of the specific functional forms and system parameters. We use this framework on several real networks, identify the topological characteristics that underlie the predicted node overrides, and compare its predictions to those of structural controllability in control theory. Finally, we demonstrate this framework's applicability in dynamic models of gene regulatory networks and identify nodes whose override is necessary for control in the general case but not in specific model instances.

  4. Image Fusion Based on the Self-Organizing Feature Map Neural Networks

    Institute of Scientific and Technical Information of China (English)

    ZHANG Zhaoli; SUN Shenghe

    2001-01-01

    This paper presents a new image datafusion scheme based on the self-organizing featuremap (SOFM) neural networks.The scheme consists ofthree steps:(1) pre-processing of the images,whereweighted median filtering removes part of the noisecomponents corrupting the image,(2) pixel clusteringfor each image using two-dimensional self-organizingfeature map neural networks,and (3) fusion of the im-ages obtained in Step (2) utilizing fuzzy logic,whichsuppresses the residual noise components and thusfurther improves the image quality.It proves thatsuch a three-step combination offers an impressive ef-fectiveness and performance improvement,which isconfirmed by simulations involving three image sen-sors (each of which has a different noise structure).

  5. Stochastic resonance in feedforward acupuncture networks

    Science.gov (United States)

    Qin, Ying-Mei; Wang, Jiang; Men, Cong; Deng, Bin; Wei, Xi-Le; Yu, Hai-Tao; Chan, Wai-Lok

    2014-10-01

    Effects of noises and some other network properties on the weak signal propagation are studied systematically in feedforward acupuncture networks (FFN) based on FitzHugh-Nagumo neuron model. It is found that noises with medium intensity can enhance signal propagation and this effect can be further increased by the feedforward network structure. Resonant properties in the noisy network can also be altered by several network parameters, such as heterogeneity, synapse features, and feedback connections. These results may also provide a novel potential explanation for the propagation of acupuncture signal.

  6. Association between structural brain network efficiency and intelligence increases during adolescence

    NARCIS (Netherlands)

    Koenis, Marinka M G; Brouwer, Rachel M; Swagerman, Suzanne C; van Soelen, Inge L C; Boomsma, Dorret I; Hulshoff Pol, Hilleke E

    2018-01-01

    Adolescence represents an important period during which considerable changes in the brain take place, including increases in integrity of white matter bundles, and increasing efficiency of the structural brain network. A more efficient structural brain network has been associated with higher

  7. Temporal variation in bat-fruit interactions: Foraging strategies influence network structure over time

    Science.gov (United States)

    Zapata-Mesa, Natalya; Montoya-Bustamante, Sebastián; Murillo-García, Oscar E.

    2017-11-01

    Mutualistic interactions, such as seed dispersal, are important for the maintenance of structure and stability of tropical communities. However, there is a lack of information about spatial and temporal variation in plant-animal interaction networks. Thus, our goal was to assess the effect of bat's foraging strategies on temporal variation in the structure and robustness of bat-fruit networks in both a dry and a rain tropical forest. We evaluated monthly variation in bat-fruit networks by using seven structure metrics: network size, average path length, nestedness, modularity, complementary specialization, normalized degree and betweenness centrality. Seed dispersal networks showed variations in size, species composition and modularity; did not present nested structures and their complementary specialization was high compared to other studies. Both networks presented short path lengths, and a constantly high robustness, despite their monthly variations. Sedentary bat species were recorded during all the study periods and occupied more central positions than nomadic species. We conclude that foraging strategies are important structuring factors that affect the dynamic of networks by determining the functional roles of frugivorous bats over time; thus sedentary bats are more important than nomadic species for the maintenance of the network structure, and their conservation is a must.

  8. Compressive behavior of pervious concretes and a quantification of the influence of random pore structure features

    International Nuclear Information System (INIS)

    Deo, Omkar; Neithalath, Narayanan

    2010-01-01

    Research highlights: → Identified the relevant pore structure features of pervious concretes, provided methodologies to extract those, and quantified the influence of these features on compressive response. → A model for stress-strain relationship of pervious concretes, and relationship between model parameters and parameters of the stress-strain relationship developed. → Statistical model for compressive strength as a function of pore structure features; and a stochastic model for the sensitivity of pore structure features in strength prediction. - Abstract: Properties of a random porous material such as pervious concrete are strongly dependent on its pore structure features, porosity being an important one among them. This study deals with developing an understanding of the material structure-compressive response relationships in pervious concretes. Several pervious concrete mixtures with different pore structure features are proportioned and subjected to static compression tests. The pore structure features such as pore area fractions, pore sizes, mean free spacing of the pores, specific surface area, and the three-dimensional pore distribution density are extracted using image analysis methods. The compressive stress-strain response of pervious concretes, a model to predict the stress-strain response, and its relationship to several of the pore structure features are outlined. Larger aggregate sizes and increase in paste volume fractions are observed to result in increased compressive strengths. The compressive response is found to be influenced by the pore sizes, their distributions and spacing. A statistical model is used to relate the compressive strength to the relevant pore structure features, which is then used as a base model in a Monte-Carlo simulation to evaluate the sensitivity of the predicted compressive strength to the model terms.

  9. Network Transformations in Economy

    Directory of Open Access Journals (Sweden)

    Bolychev O.

    2014-09-01

    Full Text Available In the context of ever-increasing market competition, networked interactions play a special role in the economy. The network form of entrepreneurship is increasingly viewed as an effective organizational structure to create a market value embedded in innovative business solutions. The authors study the characteristics of a network as an economic category and emphasize certain similarities between Rus sian and international approaches to identifying interactions of economic systems based on the network principle. The paper focuses on the types of networks widely used in the economy. The authors analyze the transformation of business networks along two lines: from an intra- to an inter-firm network and from an inter-firm to an inter-organizational network. The possible forms of network formation are described depending on the strength of connections and the type of integration. The drivers and reasons behind process of transition from a hierarchical model of the organizational structure to a network type are identified. The authors analyze the advantages of creating inter-firm networks and discuss the features of inter-organizational networks as compares to inter-firm ones. The article summarizes the reasons for and advantages of participation in inter-rganizational networks and identifies the main barriers to the formation of inter-organizational network.

  10. Social Network Structures among Groundnut Farmers

    Science.gov (United States)

    Thuo, Mary; Bell, Alexandra A.; Bravo-Ureta, Boris E.; Okello, David K.; Okoko, Evelyn Nasambu; Kidula, Nelson L.; Deom, C. Michael; Puppala, Naveen

    2013-01-01

    Purpose: Groundnut farmers in East Africa have experienced declines in production despite research and extension efforts to increase productivity. This study examined how social network structures related to acquisition of information about new seed varieties and productivity among groundnut farmers in Uganda and Kenya.…

  11. 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

  12. Information diffusion in structured online social networks

    Science.gov (United States)

    Li, Pei; Zhang, Yini; Qiao, Fengcai; Wang, Hui

    2015-05-01

    Nowadays, due to the word-of-mouth effect, online social networks have been considered to be efficient approaches to conduct viral marketing, which makes it of great importance to understand the diffusion dynamics in online social networks. However, most research on diffusion dynamics in epidemiology and existing social networks cannot be applied directly to characterize online social networks. In this paper, we propose models to characterize the information diffusion in structured online social networks with push-based forwarding mechanism. We introduce the term user influence to characterize the average number of times that messages are browsed which is incurred by a given type user generating a message, and study the diffusion threshold, above which the user influence of generating a message will approach infinity. We conduct simulations and provide the simulation results, which are consistent with the theoretical analysis results perfectly. These results are of use in understanding the diffusion dynamics in online social networks and also critical for advertisers in viral marketing who want to estimate the user influence before posting an advertisement.

  13. A review of structural and functional brain networks: small world and atlas.

    Science.gov (United States)

    Yao, Zhijun; Hu, Bin; Xie, Yuanwei; Moore, Philip; Zheng, Jiaxiang

    2015-03-01

    Brain networks can be divided into two categories: structural and functional networks. Many studies of neuroscience have reported that the complex brain networks are characterized by small-world or scale-free properties. The identification of nodes is the key factor in studying the properties of networks on the macro-, micro- or mesoscale in both structural and functional networks. In the study of brain networks, nodes are always determined by atlases. Therefore, the selection of atlases is critical, and appropriate atlases are helpful to combine the analyses of structural and functional networks. Currently, some problems still exist in the establishment or usage of atlases, which are often caused by the segmentation or the parcellation of the brain. We suggest that quantification of brain networks might be affected by the selection of atlases to a large extent. In the process of building atlases, the influences of single subjects and groups should be balanced. In this article, we focused on the effects of atlases on the analysis of brain networks and the improved divisions based on the tractography or connectivity in the parcellation of atlases.

  14. Complex Network Structure Influences Processing in Long-Term and Short-Term Memory

    Science.gov (United States)

    Vitevitch, Michael S.; Chan, Kit Ying; Roodenrys, Steven

    2012-01-01

    Complex networks describe how entities in systems interact; the structure of such networks is argued to influence processing. One measure of network structure, clustering coefficient, C, measures the extent to which neighbors of a node are also neighbors of each other. Previous psycholinguistic experiments found that the C of phonological…

  15. Multimodal Feature Learning for Video Captioning

    Directory of Open Access Journals (Sweden)

    Sujin Lee

    2018-01-01

    Full Text Available Video captioning refers to the task of generating a natural language sentence that explains the content of the input video clips. This study proposes a deep neural network model for effective video captioning. Apart from visual features, the proposed model learns additionally semantic features that describe the video content effectively. In our model, visual features of the input video are extracted using convolutional neural networks such as C3D and ResNet, while semantic features are obtained using recurrent neural networks such as LSTM. In addition, our model includes an attention-based caption generation network to generate the correct natural language captions based on the multimodal video feature sequences. Various experiments, conducted with the two large benchmark datasets, Microsoft Video Description (MSVD and Microsoft Research Video-to-Text (MSR-VTT, demonstrate the performance of the proposed model.

  16. Genomic analysis of the hierarchical structure of regulatory networks

    Science.gov (United States)

    Yu, Haiyuan; Gerstein, Mark

    2006-01-01

    A fundamental question in biology is how the cell uses transcription factors (TFs) to coordinate the expression of thousands of genes in response to various stimuli. The relationships between TFs and their target genes can be modeled in terms of directed regulatory networks. These relationships, in turn, can be readily compared with commonplace “chain-of-command” structures in social networks, which have characteristic hierarchical layouts. Here, we develop algorithms for identifying generalized hierarchies (allowing for various loop structures) and use these approaches to illuminate extensive pyramid-shaped hierarchical structures existing in the regulatory networks of representative prokaryotes (Escherichia coli) and eukaryotes (Saccharomyces cerevisiae), with most TFs at the bottom levels and only a few master TFs on top. These masters are situated near the center of the protein–protein interaction network, a different type of network from the regulatory one, and they receive most of the input for the whole regulatory hierarchy through protein interactions. Moreover, they have maximal influence over other genes, in terms of affecting expression-level changes. Surprisingly, however, TFs at the bottom of the regulatory hierarchy are more essential to the viability of the cell. Finally, one might think master TFs achieve their wide influence through directly regulating many targets, but TFs with most direct targets are in the middle of the hierarchy. We find, in fact, that these midlevel TFs are “control bottlenecks” in the hierarchy, and this great degree of control for “middle managers” has parallels in efficient social structures in various corporate and governmental settings. PMID:17003135

  17. Feature Extraction for Structural Dynamics Model Validation

    Energy Technology Data Exchange (ETDEWEB)

    Farrar, Charles [Los Alamos National Laboratory; Nishio, Mayuko [Yokohama University; Hemez, Francois [Los Alamos National Laboratory; Stull, Chris [Los Alamos National Laboratory; Park, Gyuhae [Chonnam Univesity; Cornwell, Phil [Rose-Hulman Institute of Technology; Figueiredo, Eloi [Universidade Lusófona; Luscher, D. J. [Los Alamos National Laboratory; Worden, Keith [University of Sheffield

    2016-01-13

    As structural dynamics becomes increasingly non-modal, stochastic and nonlinear, finite element model-updating technology must adopt the broader notions of model validation and uncertainty quantification. For example, particular re-sampling procedures must be implemented to propagate uncertainty through a forward calculation, and non-modal features must be defined to analyze nonlinear data sets. The latter topic is the focus of this report, but first, some more general comments regarding the concept of model validation will be discussed.

  18. Extracting Intrinsic Functional Networks with Feature-Based Group Independent Component Analysis

    Science.gov (United States)

    Calhoun, Vince D.; Allen, Elena

    2013-01-01

    There is increasing use of functional imaging data to understand the macro-connectome of the human brain. Of particular interest is the structure and function of intrinsic networks (regions exhibiting temporally coherent activity both at rest and while a task is being performed), which account for a significant portion of the variance in…

  19. Network Centric Information Structure - Crisis Information Management

    National Research Council Canada - National Science Library

    Aarholt, Eldar; Berg, Olav

    2004-01-01

    This paper presents a generic Network Centric Information Structure (NCIS) that can be used by civilian, military and public sectors, and that supports information handling applied to crises management and emergency response...

  20. Structural-phenomenological features of the internal picture of doctors’ illnesses

    Directory of Open Access Journals (Sweden)

    Lazarenko, Victor A.

    2016-06-01

    Full Text Available The vocational activities of doctors and their social status do not ensure their health. And, falling ill, doctors don’t identify themselves with ordinary patients as they have a deep knowledge of medicine. Thus, the internal picture of a doctor’s illness is both a research and a practical problem: the problem of the psychoprevention of doctors’ illnesses at all stages of their professionalization. The purpose of the research was to study the phenomenological features of the internal picture of doctors’ illnesses using the structural approach. The total number of participants was 132. The experimental group consisted of 66 sick doctors, differentiated according to their stage of professionalization: vocational training (students, professional adaptation (interns, full professionalization (doctors. The control group consisted of 66 people who did not have any medical education. All the control subjects were hospitalized with chronic diseases during the study period. The organization of the research was carried out with the use of clinical-psychological and diagnostic methods, the methods of descriptive statistics, and comparative, multidimensional, and structural analysis. The research revealed the following phenomenological features of the internal picture of doctors’ illnesses: the prevalence of some anxiety in the doctors and high awareness of their health; the doctors’ altruistic orientation; their willingness to work despite difficulties; and their ability to achieve high results in different activities. The structural features of the doctors’ image of their own diseases on the cognitive level were the following: qualitative heterogeneity during in-service activities; a high degree of image integration during in-service activities; and stereotyped perceptions of the disease. The emotional level revealed the emotional distance between doctors and their patients, and the behavioral level revealed doctors’ disregard for the