s-core network decomposition: A generalization of k-core analysis to weighted networks

NASA Astrophysics Data System (ADS)

Eidsaa, Marius; Almaas, Eivind

2013-12-01

A broad range of systems spanning biology, technology, and social phenomena may be represented and analyzed as complex networks. Recent studies of such networks using k-core decomposition have uncovered groups of nodes that play important roles. Here, we present s-core analysis, a generalization of k-core (or k-shell) analysis to complex networks where the links have different strengths or weights. We demonstrate the s-core decomposition approach on two random networks (ER and configuration model with scale-free degree distribution) where the link weights are (i) random, (ii) correlated, and (iii) anticorrelated with the node degrees. Finally, we apply the s-core decomposition approach to the protein-interaction network of the yeast Saccharomyces cerevisiae in the context of two gene-expression experiments: oxidative stress in response to cumene hydroperoxide (CHP), and fermentation stress response (FSR). We find that the innermost s-cores are (i) different from innermost k-cores, (ii) different for the two stress conditions CHP and FSR, and (iii) enriched with proteins whose biological functions give insight into how yeast manages these specific stresses.

Randomizing world trade. II. A weighted network analysis

NASA Astrophysics Data System (ADS)

Squartini, Tiziano; Fagiolo, Giorgio; Garlaschelli, Diego

2011-10-01

Based on the misleading expectation that weighted network properties always offer a more complete description than purely topological ones, current economic models of the International Trade Network (ITN) generally aim at explaining local weighted properties, not local binary ones. Here we complement our analysis of the binary projections of the ITN by considering its weighted representations. We show that, unlike the binary case, all possible weighted representations of the ITN (directed and undirected, aggregated and disaggregated) cannot be traced back to local country-specific properties, which are therefore of limited informativeness. Our two papers show that traditional macroeconomic approaches systematically fail to capture the key properties of the ITN. In the binary case, they do not focus on the degree sequence and hence cannot characterize or replicate higher-order properties. In the weighted case, they generally focus on the strength sequence, but the knowledge of the latter is not enough in order to understand or reproduce indirect effects.

STOCK Market Differences in Correlation-Based Weighted Network

NASA Astrophysics Data System (ADS)

Youn, Janghyuk; Lee, Junghoon; Chang, Woojin

We examined the sector dynamics of Korean stock market in relation to the market volatility. The daily price data of 360 stocks for 5019 trading days (from January, 1990 to August, 2008) in Korean stock market are used. We performed the weighted network analysis and employed four measures: the average, the variance, the intensity, and the coherence of network weights (absolute values of stock return correlations) to investigate the network structure of Korean stock market. We performed regression analysis using the four measures in the seven major industry sectors and the market (seven sectors combined). We found that the average, the intensity, and the coherence of sector (subnetwork) weights increase as market becomes volatile. Except for the "Financials" sector, the variance of sector weights also grows as market volatility increases. Based on the four measures, we can categorize "Financials," "Information Technology" and "Industrials" sectors into one group, and "Materials" and "Consumer Discretionary" sectors into another group. We investigated the distributions of intrasector and intersector weights for each sector and found the differences in "Financials" sector are most distinct.

Boundedness and convergence of online gradient method with penalty for feedforward neural networks.

PubMed

Zhang, Huisheng; Wu, Wei; Liu, Fei; Yao, Mingchen

2009-06-01

In this brief, we consider an online gradient method with penalty for training feedforward neural networks. Specifically, the penalty is a term proportional to the norm of the weights. Its roles in the method are to control the magnitude of the weights and to improve the generalization performance of the network. By proving that the weights are automatically bounded in the network training with penalty, we simplify the conditions that are required for convergence of online gradient method in literature. A numerical example is given to support the theoretical analysis.

The Use of Weighted Graphs for Large-Scale Genome Analysis

PubMed Central

Zhou, Fang; Toivonen, Hannu; King, Ross D.

2014-01-01

There is an acute need for better tools to extract knowledge from the growing flood of sequence data. For example, thousands of complete genomes have been sequenced, and their metabolic networks inferred. Such data should enable a better understanding of evolution. However, most existing network analysis methods are based on pair-wise comparisons, and these do not scale to thousands of genomes. Here we propose the use of weighted graphs as a data structure to enable large-scale phylogenetic analysis of networks. We have developed three types of weighted graph for enzymes: taxonomic (these summarize phylogenetic importance), isoenzymatic (these summarize enzymatic variety/redundancy), and sequence-similarity (these summarize sequence conservation); and we applied these types of weighted graph to survey prokaryotic metabolism. To demonstrate the utility of this approach we have compared and contrasted the large-scale evolution of metabolism in Archaea and Eubacteria. Our results provide evidence for limits to the contingency of evolution. PMID:24619061

Capturing the Flatness of a peer-to-peer lending network through random and selected perturbations

NASA Astrophysics Data System (ADS)

Karampourniotis, Panagiotis D.; Singh, Pramesh; Uparna, Jayaram; Horvat, Emoke-Agnes; Szymanski, Boleslaw K.; Korniss, Gyorgy; Bakdash, Jonathan Z.; Uzzi, Brian

Null models are established tools that have been used in network analysis to uncover various structural patterns. They quantify the deviance of an observed network measure to that given by the null model. We construct a null model for weighted, directed networks to identify biased links (carrying significantly different weights than expected according to the null model) and thus quantify the flatness of the system. Using this model, we study the flatness of Kiva, a large international crownfinancing network of borrowers and lenders, aggregated to the country level. The dataset spans the years from 2006 to 2013. Our longitudinal analysis shows that flatness of the system is reducing over time, meaning the proportion of biased inter-country links is growing. We extend our analysis by testing the robustness of the flatness of the network in perturbations on the links' weights or the nodes themselves. Examples of such perturbations are event shocks (e.g. erecting walls) or regulatory shocks (e.g. Brexit). We find that flatness is unaffected by random shocks, but changes after shocks target links with a large weight or bias. The methods we use to capture the flatness are based on analytics, simulations, and numerical computations using Shannon's maximum entropy. Supported by ARL NS-CTA.

Passivity analysis for uncertain BAM neural networks with time delays and reaction-diffusions

NASA Astrophysics Data System (ADS)

Zhou, Jianping; Xu, Shengyuan; Shen, Hao; Zhang, Baoyong

2013-08-01

This article deals with the problem of passivity analysis for delayed reaction-diffusion bidirectional associative memory (BAM) neural networks with weight uncertainties. By using a new integral inequality, we first present a passivity condition for the nominal networks, and then extend the result to the case with linear fractional weight uncertainties. The proposed conditions are expressed in terms of linear matrix inequalities, and thus can be checked easily. Examples are provided to demonstrate the effectiveness of the proposed results.

Social patterns revealed through random matrix theory

NASA Astrophysics Data System (ADS)

Sarkar, Camellia; Jalan, Sarika

2014-11-01

Despite the tremendous advancements in the field of network theory, very few studies have taken weights in the interactions into consideration that emerge naturally in all real-world systems. Using random matrix analysis of a weighted social network, we demonstrate the profound impact of weights in interactions on emerging structural properties. The analysis reveals that randomness existing in particular time frame affects the decisions of individuals rendering them more freedom of choice in situations of financial security. While the structural organization of networks remains the same throughout all datasets, random matrix theory provides insight into the interaction pattern of individuals of the society in situations of crisis. It has also been contemplated that individual accountability in terms of weighted interactions remains as a key to success unless segregation of tasks comes into play.

Prioritizing chronic obstructive pulmonary disease (COPD) candidate genes in COPD-related networks

PubMed Central

Zhang, Yihua; Li, Wan; Feng, Yuyan; Guo, Shanshan; Zhao, Xilei; Wang, Yahui; He, Yuehan; He, Weiming; Chen, Lina

2017-01-01

Chronic obstructive pulmonary disease (COPD) is a multi-factor disease, which could be caused by many factors, including disturbances of metabolism and protein-protein interactions (PPIs). In this paper, a weighted COPD-related metabolic network and a weighted COPD-related PPI network were constructed base on COPD disease genes and functional information. Candidate genes in these weighted COPD-related networks were prioritized by making use of a gene prioritization method, respectively. Literature review and functional enrichment analysis of the top 100 genes in these two networks suggested the correlation of COPD and these genes. The performance of our gene prioritization method was superior to that of ToppGene and ToppNet for genes from the COPD-related metabolic network or the COPD-related PPI network after assessing using leave-one-out cross-validation, literature validation and functional enrichment analysis. The top-ranked genes prioritized from COPD-related metabolic and PPI networks could promote the better understanding about the molecular mechanism of this disease from different perspectives. The top 100 genes in COPD-related metabolic network or COPD-related PPI network might be potential markers for the diagnosis and treatment of COPD. PMID:29262568

Prioritizing chronic obstructive pulmonary disease (COPD) candidate genes in COPD-related networks.

PubMed

Zhang, Yihua; Li, Wan; Feng, Yuyan; Guo, Shanshan; Zhao, Xilei; Wang, Yahui; He, Yuehan; He, Weiming; Chen, Lina

2017-11-28

Chronic obstructive pulmonary disease (COPD) is a multi-factor disease, which could be caused by many factors, including disturbances of metabolism and protein-protein interactions (PPIs). In this paper, a weighted COPD-related metabolic network and a weighted COPD-related PPI network were constructed base on COPD disease genes and functional information. Candidate genes in these weighted COPD-related networks were prioritized by making use of a gene prioritization method, respectively. Literature review and functional enrichment analysis of the top 100 genes in these two networks suggested the correlation of COPD and these genes. The performance of our gene prioritization method was superior to that of ToppGene and ToppNet for genes from the COPD-related metabolic network or the COPD-related PPI network after assessing using leave-one-out cross-validation, literature validation and functional enrichment analysis. The top-ranked genes prioritized from COPD-related metabolic and PPI networks could promote the better understanding about the molecular mechanism of this disease from different perspectives. The top 100 genes in COPD-related metabolic network or COPD-related PPI network might be potential markers for the diagnosis and treatment of COPD.

How to become a superhero

NASA Astrophysics Data System (ADS)

Gleiser, Pablo M.

2007-09-01

We analyze a collaboration network based on the Marvel Universe comic books. First, we consider the system as a binary network, where two characters are connected if they appear in the same publication. The analysis of degree correlations reveals that, in contrast to most real social networks, the Marvel Universe presents a disassortative mixing on the degree. Then, we use a weight measure to study the system as a weighted network. This allows us to find and characterize well defined communities. Through the analysis of the community structure and the clustering as a function of the degree we show that the network presents a hierarchical structure. Finally, we comment on possible mechanisms responsible for the particular motifs observed.

Network meta-analysis of lorcaserin and oral hypoglycaemics for patients with type 2 diabetes mellitus and obesity.

PubMed

Neff, L M; Broder, M S; Beenhouwer, D; Chang, E; Papoyan, E; Wang, Z W

2017-12-01

In addition to weight loss, randomized controlled trials have shown improvement in glycaemic control in patients taking lorcaserin. The aim of this study aim was to compare adding lorcaserin or other glucose lowering medications to metformin on weight and glycaemic control. A systematic review and network meta-analysis of randomized controlled trials were conducted. Included studies (published 1990-2014) were of lorcaserin or glucose lowering medications in type 2 diabetic patients compared to placebo or different active treatments. Studies had to report ≥1 key outcome (change in weight or HbA1c, % HbA1c <7, hypoglycaemia). Direct meta-analysis was performed using DerSimonian and Laird random effects models, and network meta-analysis with Bayesian Markov-chain Monte Carlo random effects models; 6552 articles were screened and 41 included. Lorcaserin reduced weight significantly more than thiazolidinediones, glinides, sulphonylureas and dipeptidyl peptidase-4 inhibitors, some of which may have led to weight gain. There were no significant differences in weight change between lorcaserin and alpha-glucoside inhibitors, glucagon-like peptide-1 agonists and sodium/glucose cotransporter 2 inhibitors. Network meta-analysis showed lorcaserin was non-inferior to all other agents on HbA1c reduction and % achieving HbA1c of <7%. The risk of hypoglycaemia was not significantly different among studied agents except that sulphonylureas were associated with higher risk of hypoglycaemia than lorcaserin. Although additional studies are needed, this analysis suggests in a population of patients with a body mas index of ≥27 who do not achieve glycaemic control on a single agent, lorcaserin may be added as an alternative to an add-on glucose lowering medication. © 2017 World Obesity Federation.

Network analysis of translocated Takahe populations to identify disease surveillance targets.

PubMed

Grange, Zoë L; VAN Andel, Mary; French, Nigel P; Gartrell, Brett D

2014-04-01

Social network analysis is being increasingly used in epidemiology and disease modeling in humans, domestic animals, and wildlife. We investigated this tool in describing a translocation network (area that allows movement of animals between geographically isolated locations) used for the conservation of an endangered flightless rail, the Takahe (Porphyrio hochstetteri). We collated records of Takahe translocations within New Zealand and used social network principles to describe the connectivity of the translocation network. That is, networks were constructed and analyzed using adjacency matrices with values based on the tie weights between nodes. Five annual network matrices were created using the Takahe data set, each incremental year included records of previous years. Weights of movements between connected locations were assigned by the number of Takahe moved. We calculated the number of nodes (i(total)) and the number of ties (t(total)) between the nodes. To quantify the small-world character of the networks, we compared the real networks to random graphs of the equivalent size, weighting, and node strength. Descriptive analysis of cumulative annual Takahe movement networks involved determination of node-level characteristics, including centrality descriptors of relevance to disease modeling such as weighted measures of in degree (k(i)(in)), out degree (k(i)(out)), and betweenness (B(i)). Key players were assigned according to the highest node measure of k(i)(in), k(i)(out), and B(i) per network. Networks increased in size throughout the time frame considered. The network had some degree small-world characteristics. Nodes with the highest cumulative tie weights connecting them were the captive breeding center, the Murchison Mountains and 2 offshore islands. The key player fluctuated between the captive breeding center and the Murchison Mountains. The cumulative networks identified the captive breeding center every year as the hub of the network until the final network in 2011. Likewise, the wild Murchison Mountains population was consistently the sink of the network. Other nodes, such as the offshore islands and the wildlife hospital, varied in importance over time. Common network descriptors and measures of centrality identified key locations for targeting disease surveillance. The visual representation of movements of animals in a population that this technique provides can aid decision makers when they evaluate translocation proposals or attempt to control a disease outbreak. © 2014 Society for Conservation Biology.

Deriving percentage study weights in multi-parameter meta-analysis models: with application to meta-regression, network meta-analysis and one-stage individual participant data models.

PubMed

Riley, Richard D; Ensor, Joie; Jackson, Dan; Burke, Danielle L

2017-01-01

Many meta-analysis models contain multiple parameters, for example due to multiple outcomes, multiple treatments or multiple regression coefficients. In particular, meta-regression models may contain multiple study-level covariates, and one-stage individual participant data meta-analysis models may contain multiple patient-level covariates and interactions. Here, we propose how to derive percentage study weights for such situations, in order to reveal the (otherwise hidden) contribution of each study toward the parameter estimates of interest. We assume that studies are independent, and utilise a decomposition of Fisher's information matrix to decompose the total variance matrix of parameter estimates into study-specific contributions, from which percentage weights are derived. This approach generalises how percentage weights are calculated in a traditional, single parameter meta-analysis model. Application is made to one- and two-stage individual participant data meta-analyses, meta-regression and network (multivariate) meta-analysis of multiple treatments. These reveal percentage study weights toward clinically important estimates, such as summary treatment effects and treatment-covariate interactions, and are especially useful when some studies are potential outliers or at high risk of bias. We also derive percentage study weights toward methodologically interesting measures, such as the magnitude of ecological bias (difference between within-study and across-study associations) and the amount of inconsistency (difference between direct and indirect evidence in a network meta-analysis).

Features of the Correlation Structure of Price Indices

PubMed Central

Gao, Xiangyun; An, Haizhong; Zhong, Weiqiong

2013-01-01

What are the features of the correlation structure of price indices? To answer this question, 5 types of price indices, including 195 specific price indices from 2003 to 2011, were selected as sample data. To build a weighted network of price indices each price index is represented by a vertex, and a positive correlation between two price indices is represented by an edge. We studied the features of the weighted network structure by applying economic theory to the analysis of complex network parameters. We found that the frequency of the price indices follows a normal distribution by counting the weighted degrees of the nodes, and we identified the price indices which have an important impact on the network's structure. We found out small groups in the weighted network by the methods of k-core and k-plex. We discovered structure holes in the network by calculating the hierarchy of the nodes. Finally, we found that the price indices weighted network has a small-world effect by calculating the shortest path. These results provide a scientific basis for macroeconomic control policies. PMID:23593399

Dynamics of Intersubject Brain Networks during Anxious Anticipation

PubMed Central

Najafi, Mahshid; Kinnison, Joshua; Pessoa, Luiz

2017-01-01

How do large-scale brain networks reorganize during the waxing and waning of anxious anticipation? Here, threat was dynamically modulated during human functional MRI as two circles slowly meandered on the screen; if they touched, an unpleasant shock was delivered. We employed intersubject correlation analysis, which allowed the investigation of network-level functional connectivity across brains, and sought to determine how network connectivity changed during periods of approach (circles moving closer) and periods of retreat (circles moving apart). Analysis of positive connection weights revealed that dynamic threat altered connectivity within and between the salience, executive, and task-negative networks. For example, dynamic functional connectivity increased within the salience network during approach and decreased during retreat. The opposite pattern was found for the functional connectivity between the salience and task-negative networks: decreases during approach and increases during approach. Functional connections between subcortical regions and the salience network also changed dynamically during approach and retreat periods. Subcortical regions exhibiting such changes included the putative periaqueductal gray, putative habenula, and putative bed nucleus of the stria terminalis. Additional analysis of negative functional connections revealed dynamic changes, too. For example, negative weights within the salience network decreased during approach and increased during retreat, opposite what was found for positive weights. Together, our findings unraveled dynamic features of functional connectivity of large-scale networks and subcortical regions across participants while threat levels varied continuously, and demonstrate the potential of characterizing emotional processing at the level of dynamic networks. PMID:29209184

Borrowing of strength and study weights in multivariate and network meta-analysis.

PubMed

Jackson, Dan; White, Ian R; Price, Malcolm; Copas, John; Riley, Richard D

2017-12-01

Multivariate and network meta-analysis have the potential for the estimated mean of one effect to borrow strength from the data on other effects of interest. The extent of this borrowing of strength is usually assessed informally. We present new mathematical definitions of 'borrowing of strength'. Our main proposal is based on a decomposition of the score statistic, which we show can be interpreted as comparing the precision of estimates from the multivariate and univariate models. Our definition of borrowing of strength therefore emulates the usual informal assessment. We also derive a method for calculating study weights, which we embed into the same framework as our borrowing of strength statistics, so that percentage study weights can accompany the results from multivariate and network meta-analyses as they do in conventional univariate meta-analyses. Our proposals are illustrated using three meta-analyses involving correlated effects for multiple outcomes, multiple risk factor associations and multiple treatments (network meta-analysis).

Borrowing of strength and study weights in multivariate and network meta-analysis

PubMed Central

Jackson, Dan; White, Ian R; Price, Malcolm; Copas, John; Riley, Richard D

2016-01-01

Multivariate and network meta-analysis have the potential for the estimated mean of one effect to borrow strength from the data on other effects of interest. The extent of this borrowing of strength is usually assessed informally. We present new mathematical definitions of ‘borrowing of strength’. Our main proposal is based on a decomposition of the score statistic, which we show can be interpreted as comparing the precision of estimates from the multivariate and univariate models. Our definition of borrowing of strength therefore emulates the usual informal assessment. We also derive a method for calculating study weights, which we embed into the same framework as our borrowing of strength statistics, so that percentage study weights can accompany the results from multivariate and network meta-analyses as they do in conventional univariate meta-analyses. Our proposals are illustrated using three meta-analyses involving correlated effects for multiple outcomes, multiple risk factor associations and multiple treatments (network meta-analysis). PMID:26546254

A Method for Predicting Protein Complexes from Dynamic Weighted Protein-Protein Interaction Networks.

PubMed

Liu, Lizhen; Sun, Xiaowu; Song, Wei; Du, Chao

2018-06-01

Predicting protein complexes from protein-protein interaction (PPI) network is of great significance to recognize the structure and function of cells. A protein may interact with different proteins under different time or conditions. Existing approaches only utilize static PPI network data that may lose much temporal biological information. First, this article proposed a novel method that combines gene expression data at different time points with traditional static PPI network to construct different dynamic subnetworks. Second, to further filter out the data noise, the semantic similarity based on gene ontology is regarded as the network weight together with the principal component analysis, which is introduced to deal with the weight computing by three traditional methods. Third, after building a dynamic PPI network, a predicting protein complexes algorithm based on "core-attachment" structural feature is applied to detect complexes from each dynamic subnetworks. Finally, it is revealed from the experimental results that our method proposed in this article performs well on detecting protein complexes from dynamic weighted PPI networks.

Analysis of repeated network-level testing by the falling weight deflectometer on I-81 in the Virginia Department of Transportation's Bristol District.

DOT National Transportation Integrated Search

2016-11-01

This study was undertaken in an effort to determine the required time between subsequent rounds of network-level pavement deflection testing using a falling weight deflectometer (FWD) on the Virginia Department of Transportations (VDOTs) inters...

Coherence analysis of a class of weighted networks

NASA Astrophysics Data System (ADS)

Dai, Meifeng; He, Jiaojiao; Zong, Yue; Ju, Tingting; Sun, Yu; Su, Weiyi

2018-04-01

This paper investigates consensus dynamics in a dynamical system with additive stochastic disturbances that is characterized as network coherence by using the Laplacian spectrum. We introduce a class of weighted networks based on a complete graph and investigate the first- and second-order network coherence quantifying as the sum and square sum of reciprocals of all nonzero Laplacian eigenvalues. First, the recursive relationship of its eigenvalues at two successive generations of Laplacian matrix is deduced. Then, we compute the sum and square sum of reciprocal of all nonzero Laplacian eigenvalues. The obtained results show that the scalings of first- and second-order coherence with network size obey four and five laws, respectively, along with the range of the weight factor. Finally, it indicates that the scalings of our studied networks are smaller than other studied networks when 1/√{d }

Enhanced reconstruction of weighted networks from strengths and degrees

NASA Astrophysics Data System (ADS)

Mastrandrea, Rossana; Squartini, Tiziano; Fagiolo, Giorgio; Garlaschelli, Diego

2014-04-01

Network topology plays a key role in many phenomena, from the spreading of diseases to that of financial crises. Whenever the whole structure of a network is unknown, one must resort to reconstruction methods that identify the least biased ensemble of networks consistent with the partial information available. A challenging case, frequently encountered due to privacy issues in the analysis of interbank flows and Big Data, is when there is only local (node-specific) aggregate information available. For binary networks, the relevant ensemble is one where the degree (number of links) of each node is constrained to its observed value. However, for weighted networks the problem is much more complicated. While the naïve approach prescribes to constrain the strengths (total link weights) of all nodes, recent counter-intuitive results suggest that in weighted networks the degrees are often more informative than the strengths. This implies that the reconstruction of weighted networks would be significantly enhanced by the specification of both strengths and degrees, a computationally hard and bias-prone procedure. Here we solve this problem by introducing an analytical and unbiased maximum-entropy method that works in the shortest possible time and does not require the explicit generation of reconstructed samples. We consider several real-world examples and show that, while the strengths alone give poor results, the additional knowledge of the degrees yields accurately reconstructed networks. Information-theoretic criteria rigorously confirm that the degree sequence, as soon as it is non-trivial, is irreducible to the strength sequence. Our results have strong implications for the analysis of motifs and communities and whenever the reconstructed ensemble is required as a null model to detect higher-order patterns.

On the topological structure of multinationals network

NASA Astrophysics Data System (ADS)

Joyez, Charlie

2017-05-01

This paper uses a weighted network analysis to examine the structure of multinationals' implantation countries network. Based on French firm-level dataset of multinational enterprises (MNEs) the network analysis provides information on each country position in the network and in internationalization strategies of French MNEs through connectivity preferences among the nodes. The paper also details network-wide features and their recent evolution toward a more decentralized structure. While much has been said on international trade network, this paper shows that multinational firms' studies would also benefit from network analysis, notably by investigating the sensitivity of the network construction to firm heterogeneity.

Localization and Spreading of Diseases in Complex Networks

NASA Astrophysics Data System (ADS)

Goltsev, A. V.; Dorogovtsev, S. N.; Oliveira, J. G.; Mendes, J. F. F.

2012-09-01

Using the susceptible-infected-susceptible model on unweighted and weighted networks, we consider the disease localization phenomenon. In contrast to the well-recognized point of view that diseases infect a finite fraction of vertices right above the epidemic threshold, we show that diseases can be localized on a finite number of vertices, where hubs and edges with large weights are centers of localization. Our results follow from the analysis of standard models of networks and empirical data for real-world networks.

Visualizing weighted networks: a performance comparison of adjacency matrices versus node-link diagrams

NASA Astrophysics Data System (ADS)

McIntire, John P.; Osesina, O. Isaac; Bartley, Cecilia; Tudoreanu, M. Eduard; Havig, Paul R.; Geiselman, Eric E.

2012-06-01

Ensuring the proper and effective ways to visualize network data is important for many areas of academia, applied sciences, the military, and the public. Fields such as social network analysis, genetics, biochemistry, intelligence, cybersecurity, neural network modeling, transit systems, communications, etc. often deal with large, complex network datasets that can be difficult to interact with, study, and use. There have been surprisingly few human factors performance studies on the relative effectiveness of different graph drawings or network diagram techniques to convey information to a viewer. This is particularly true for weighted networks which include the strength of connections between nodes, not just information about which nodes are linked to other nodes. We describe a human factors study in which participants performed four separate network analysis tasks (finding a direct link between given nodes, finding an interconnected node between given nodes, estimating link strengths, and estimating the most densely interconnected nodes) on two different network visualizations: an adjacency matrix with a heat-map versus a node-link diagram. The results should help shed light on effective methods of visualizing network data for some representative analysis tasks, with the ultimate goal of improving usability and performance for viewers of network data displays.

Multiplex network analysis of employee performance and employee social relationships

NASA Astrophysics Data System (ADS)

Cai, Meng; Wang, Wei; Cui, Ying; Stanley, H. Eugene

2018-01-01

In human resource management, employee performance is strongly affected by both formal and informal employee networks. Most previous research on employee performance has focused on monolayer networks that can represent only single categories of employee social relationships. We study employee performance by taking into account the entire multiplex structure of underlying employee social networks. We collect three datasets consisting of five different employee relationship categories in three firms, and predict employee performance using degree centrality and eigenvector centrality in a superimposed multiplex network (SMN) and an unfolded multiplex network (UMN). We use a quadratic assignment procedure (QAP) analysis and a regression analysis to demonstrate that the different categories of relationship are mutually embedded and that the strength of their impact on employee performance differs. We also use weighted/unweighted SMN/UMN to measure the predictive accuracy of this approach and find that employees with high centrality in a weighted UMN are more likely to perform well. Our results shed new light on how social structures affect employee performance.

The General Evolving Model for Energy Supply-Demand Network with Local-World

NASA Astrophysics Data System (ADS)

Sun, Mei; Han, Dun; Li, Dandan; Fang, Cuicui

2013-10-01

In this paper, two general bipartite network evolving models for energy supply-demand network with local-world are proposed. The node weight distribution, the "shifting coefficient" and the scaling exponent of two different kinds of nodes are presented by the mean-field theory. The numerical results of the node weight distribution and the edge weight distribution are also investigated. The production's shifted power law (SPL) distribution of coal enterprises and the installed capacity's distribution of power plants in the US are obtained from the empirical analysis. Numerical simulations and empirical results are given to verify the theoretical results.

Dynamics of subway networks based on vehicles operation timetable

NASA Astrophysics Data System (ADS)

Xiao, Xue-mei; Jia, Li-min; Wang, Yan-hui

2017-05-01

In this paper, a subway network is represented as a dynamic, directed and weighted graph, in which vertices represent subway stations and weights of edges represent the number of vehicles passing through the edges by considering vehicles operation timetable. Meanwhile the definitions of static and dynamic metrics which can represent vertices' and edges' local and global attributes are proposed. Based on the model and metrics, standard deviation is further introduced to study the dynamic properties (heterogeneity and vulnerability) of subway networks. Through a detailed analysis of the Beijing subway network, we conclude that with the existing network structure, the heterogeneity and vulnerability of the Beijing subway network varies over time when the vehicle operation timetable is taken into consideration, and the distribution of edge weights affects the performance of the network. In other words, although the vehicles operation timetable is restrained by the physical structure of the network, it determines the performances and properties of the Beijing subway network.

Detecting Network Communities: An Application to Phylogenetic Analysis

PubMed Central

Andrade, Roberto F. S.; Rocha-Neto, Ivan C.; Santos, Leonardo B. L.; de Santana, Charles N.; Diniz, Marcelo V. C.; Lobão, Thierry Petit; Goés-Neto, Aristóteles; Pinho, Suani T. R.; El-Hani, Charbel N.

2011-01-01

This paper proposes a new method to identify communities in generally weighted complex networks and apply it to phylogenetic analysis. In this case, weights correspond to the similarity indexes among protein sequences, which can be used for network construction so that the network structure can be analyzed to recover phylogenetically useful information from its properties. The analyses discussed here are mainly based on the modular character of protein similarity networks, explored through the Newman-Girvan algorithm, with the help of the neighborhood matrix . The most relevant networks are found when the network topology changes abruptly revealing distinct modules related to the sets of organisms to which the proteins belong. Sound biological information can be retrieved by the computational routines used in the network approach, without using biological assumptions other than those incorporated by BLAST. Usually, all the main bacterial phyla and, in some cases, also some bacterial classes corresponded totally (100%) or to a great extent (>70%) to the modules. We checked for internal consistency in the obtained results, and we scored close to 84% of matches for community pertinence when comparisons between the results were performed. To illustrate how to use the network-based method, we employed data for enzymes involved in the chitin metabolic pathway that are present in more than 100 organisms from an original data set containing 1,695 organisms, downloaded from GenBank on May 19, 2007. A preliminary comparison between the outcomes of the network-based method and the results of methods based on Bayesian, distance, likelihood, and parsimony criteria suggests that the former is as reliable as these commonly used methods. We conclude that the network-based method can be used as a powerful tool for retrieving modularity information from weighted networks, which is useful for phylogenetic analysis. PMID:21573202

Functional Brain Networks: Does the Choice of Dependency Estimator and Binarization Method Matter?

NASA Astrophysics Data System (ADS)

Jalili, Mahdi

2016-07-01

The human brain can be modelled as a complex networked structure with brain regions as individual nodes and their anatomical/functional links as edges. Functional brain networks are constructed by first extracting weighted connectivity matrices, and then binarizing them to minimize the noise level. Different methods have been used to estimate the dependency values between the nodes and to obtain a binary network from a weighted connectivity matrix. In this work we study topological properties of EEG-based functional networks in Alzheimer’s Disease (AD). To estimate the connectivity strength between two time series, we use Pearson correlation, coherence, phase order parameter and synchronization likelihood. In order to binarize the weighted connectivity matrices, we use Minimum Spanning Tree (MST), Minimum Connected Component (MCC), uniform threshold and density-preserving methods. We find that the detected AD-related abnormalities highly depend on the methods used for dependency estimation and binarization. Topological properties of networks constructed using coherence method and MCC binarization show more significant differences between AD and healthy subjects than the other methods. These results might explain contradictory results reported in the literature for network properties specific to AD symptoms. The analysis method should be seriously taken into account in the interpretation of network-based analysis of brain signals.

Dimensionless, Scale Invariant, Edge Weight Metric for the Study of Complex Structural Networks

PubMed Central

Colon-Perez, Luis M.; Spindler, Caitlin; Goicochea, Shelby; Triplett, William; Parekh, Mansi; Montie, Eric; Carney, Paul R.; Price, Catherine; Mareci, Thomas H.

2015-01-01

High spatial and angular resolution diffusion weighted imaging (DWI) with network analysis provides a unique framework for the study of brain structure in vivo. DWI-derived brain connectivity patterns are best characterized with graph theory using an edge weight to quantify the strength of white matter connections between gray matter nodes. Here a dimensionless, scale-invariant edge weight is introduced to measure node connectivity. This edge weight metric provides reasonable and consistent values over any size scale (e.g. rodents to humans) used to quantify the strength of connection. Firstly, simulations were used to assess the effects of tractography seed point density and random errors in the estimated fiber orientations; with sufficient signal-to-noise ratio (SNR), edge weight estimates improve as the seed density increases. Secondly to evaluate the application of the edge weight in the human brain, ten repeated measures of DWI in the same healthy human subject were analyzed. Mean edge weight values within the cingulum and corpus callosum were consistent and showed low variability. Thirdly, using excised rat brains to study the effects of spatial resolution, the weight of edges connecting major structures in the temporal lobe were used to characterize connectivity in this local network. The results indicate that with adequate resolution and SNR, connections between network nodes are characterized well by this edge weight metric. Therefore this new dimensionless, scale-invariant edge weight metric provides a robust measure of network connectivity that can be applied in any size regime. PMID:26173147

Dimensionless, Scale Invariant, Edge Weight Metric for the Study of Complex Structural Networks.

PubMed

Colon-Perez, Luis M; Spindler, Caitlin; Goicochea, Shelby; Triplett, William; Parekh, Mansi; Montie, Eric; Carney, Paul R; Price, Catherine; Mareci, Thomas H

2015-01-01

High spatial and angular resolution diffusion weighted imaging (DWI) with network analysis provides a unique framework for the study of brain structure in vivo. DWI-derived brain connectivity patterns are best characterized with graph theory using an edge weight to quantify the strength of white matter connections between gray matter nodes. Here a dimensionless, scale-invariant edge weight is introduced to measure node connectivity. This edge weight metric provides reasonable and consistent values over any size scale (e.g. rodents to humans) used to quantify the strength of connection. Firstly, simulations were used to assess the effects of tractography seed point density and random errors in the estimated fiber orientations; with sufficient signal-to-noise ratio (SNR), edge weight estimates improve as the seed density increases. Secondly to evaluate the application of the edge weight in the human brain, ten repeated measures of DWI in the same healthy human subject were analyzed. Mean edge weight values within the cingulum and corpus callosum were consistent and showed low variability. Thirdly, using excised rat brains to study the effects of spatial resolution, the weight of edges connecting major structures in the temporal lobe were used to characterize connectivity in this local network. The results indicate that with adequate resolution and SNR, connections between network nodes are characterized well by this edge weight metric. Therefore this new dimensionless, scale-invariant edge weight metric provides a robust measure of network connectivity that can be applied in any size regime.

An AHP-Based Weighted Analysis of Network Knowledge Management Platforms for Elementary School Students

ERIC Educational Resources Information Center

Lee, Chung-Ping; Lou, Shi-Jer; Shih, Ru-Chu; Tseng, Kuo-Hung

2011-01-01

This study uses the analytical hierarchy process (AHP) to quantify important knowledge management behaviors and to analyze the weight scores of elementary school students' behaviors in knowledge transfer, sharing, and creation. Based on the analysis of Expert Choice and tests for validity and reliability, this study identified the weight scores of…

Effect of tumor resection on the characteristics of functional brain networks.

PubMed

Wang, H; Douw, L; Hernández, J M; Reijneveld, J C; Stam, C J; Van Mieghem, P

2010-08-01

Brain functioning such as cognitive performance depends on the functional interactions between brain areas, namely, the functional brain networks. The functional brain networks of a group of patients with brain tumors are measured before and after tumor resection. In this work, we perform a weighted network analysis to understand the effect of neurosurgery on the characteristics of functional brain networks. Statistically significant changes in network features have been discovered in the beta (13-30 Hz) band after neurosurgery: the link weight correlation around nodes and within triangles increases which implies improvement in local efficiency of information transfer and robustness; the clustering of high link weights in a subgraph becomes stronger, which enhances the global transport capability; and the decrease in the synchronization or virus spreading threshold, revealed by the increase in the largest eigenvalue of the adjacency matrix, which suggests again the improvement of information dissemination.

Weighted network analysis of high-frequency cross-correlation measures

NASA Astrophysics Data System (ADS)

Iori, Giulia; Precup, Ovidiu V.

2007-03-01

In this paper we implement a Fourier method to estimate high-frequency correlation matrices from small data sets. The Fourier estimates are shown to be considerably less noisy than the standard Pearson correlation measures and thus capable of detecting subtle changes in correlation matrices with just a month of data. The evolution of correlation at different time scales is analyzed from the full correlation matrix and its minimum spanning tree representation. The analysis is performed by implementing measures from the theory of random weighted networks.

Complex networks in the Euclidean space of communicability distances

NASA Astrophysics Data System (ADS)

Estrada, Ernesto

2012-06-01

We study the properties of complex networks embedded in a Euclidean space of communicability distances. The communicability distance between two nodes is defined as the difference between the weighted sum of walks self-returning to the nodes and the weighted sum of walks going from one node to the other. We give some indications that the communicability distance identifies the least crowded routes in networks where simultaneous submission of packages is taking place. We define an index Q based on communicability and shortest path distances, which allows reinterpreting the “small-world” phenomenon as the region of minimum Q in the Watts-Strogatz model. It also allows the classification and analysis of networks with different efficiency of spatial uses. Consequently, the communicability distance displays unique features for the analysis of complex networks in different scenarios.

Multiplex social ecological network analysis reveals how social changes affect community robustness more than resource depletion.

PubMed

Baggio, Jacopo A; BurnSilver, Shauna B; Arenas, Alex; Magdanz, James S; Kofinas, Gary P; De Domenico, Manlio

2016-11-29

Network analysis provides a powerful tool to analyze complex influences of social and ecological structures on community and household dynamics. Most network studies of social-ecological systems use simple, undirected, unweighted networks. We analyze multiplex, directed, and weighted networks of subsistence food flows collected in three small indigenous communities in Arctic Alaska potentially facing substantial economic and ecological changes. Our analysis of plausible future scenarios suggests that changes to social relations and key households have greater effects on community robustness than changes to specific wild food resources.

Dynamical behavior of susceptible-infected-recovered-susceptible epidemic model on weighted networks

NASA Astrophysics Data System (ADS)

Wu, Qingchu; Zhang, Fei

2018-02-01

We study susceptible-infected-recovered-susceptible epidemic model in weighted, regular, and random complex networks. We institute a pairwise-type mathematical model with a general transmission rate to evaluate the influence of the link-weight distribution on the spreading process. Furthermore, we develop a dimensionality reduction approach to derive the condition for the contagion outbreak. Finally, we analyze the influence of the heterogeneity of weight distribution on the outbreak condition for the scenario with a linear transmission rate. Our theoretical analysis is in agreement with stochastic simulations, showing that the heterogeneity of link-weight distribution can have a significant effect on the epidemic dynamics.

Fracture mechanics analysis of cracked structures using weight function and neural network method

NASA Astrophysics Data System (ADS)

Chen, J. G.; Zang, F. G.; Yang, Y.; Shi, K. K.; Fu, X. L.

2018-06-01

Stress intensity factors(SIFs) due to thermal-mechanical load has been established by using weight function method. Two reference stress states sere used to determine the coefficients in the weight function. Results were evaluated by using data from literature and show a good agreement between them. So, the SIFs can be determined quickly using the weight function obtained when cracks subjected to arbitrary loads, and presented method can be used for probabilistic fracture mechanics analysis. A probabilistic methodology considering Monte-Carlo with neural network (MCNN) has been developed. The results indicate that an accurate probabilistic characteristic of the KI can be obtained by using the developed method. The probability of failure increases with the increasing of loads, and the relationship between is nonlinear.

Analysis Resilient Algorithm on Artificial Neural Network Backpropagation

NASA Astrophysics Data System (ADS)

Saputra, Widodo; Tulus; Zarlis, Muhammad; Widia Sembiring, Rahmat; Hartama, Dedy

2017-12-01

Prediction required by decision makers to anticipate future planning. Artificial Neural Network (ANN) Backpropagation is one of method. This method however still has weakness, for long training time. This is a reason to improve a method to accelerate the training. One of Artificial Neural Network (ANN) Backpropagation method is a resilient method. Resilient method of changing weights and bias network with direct adaptation process of weighting based on local gradient information from every learning iteration. Predicting data result of Istanbul Stock Exchange training getting better. Mean Square Error (MSE) value is getting smaller and increasing accuracy.

[Weighted gene co-expression network analysis in biomedicine research].

PubMed

Liu, Wei; Li, Li; Ye, Hua; Tu, Wei

2017-11-25

High-throughput biological technologies are now widely applied in biology and medicine, allowing scientists to monitor thousands of parameters simultaneously in a specific sample. However, it is still an enormous challenge to mine useful information from high-throughput data. The emergence of network biology provides deeper insights into complex bio-system and reveals the modularity in tissue/cellular networks. Correlation networks are increasingly used in bioinformatics applications. Weighted gene co-expression network analysis (WGCNA) tool can detect clusters of highly correlated genes. Therefore, we systematically reviewed the application of WGCNA in the study of disease diagnosis, pathogenesis and other related fields. First, we introduced principle, workflow, advantages and disadvantages of WGCNA. Second, we presented the application of WGCNA in disease, physiology, drug, evolution and genome annotation. Then, we indicated the application of WGCNA in newly developed high-throughput methods. We hope this review will help to promote the application of WGCNA in biomedicine research.

Statistical Mechanical Analysis of Online Learning with Weight Normalization in Single Layer Perceptron

NASA Astrophysics Data System (ADS)

Yoshida, Yuki; Karakida, Ryo; Okada, Masato; Amari, Shun-ichi

2017-04-01

Weight normalization, a newly proposed optimization method for neural networks by Salimans and Kingma (2016), decomposes the weight vector of a neural network into a radial length and a direction vector, and the decomposed parameters follow their steepest descent update. They reported that learning with the weight normalization achieves better converging speed in several tasks including image recognition and reinforcement learning than learning with the conventional parameterization. However, it remains theoretically uncovered how the weight normalization improves the converging speed. In this study, we applied a statistical mechanical technique to analyze on-line learning in single layer linear and nonlinear perceptrons with weight normalization. By deriving order parameters of the learning dynamics, we confirmed quantitatively that weight normalization realizes fast converging speed by automatically tuning the effective learning rate, regardless of the nonlinearity of the neural network. This property is realized when the initial value of the radial length is near the global minimum; therefore, our theory suggests that it is important to choose the initial value of the radial length appropriately when using weight normalization.

Geographies of an Online Social Network.

PubMed

Lengyel, Balázs; Varga, Attila; Ságvári, Bence; Jakobi, Ákos; Kertész, János

2015-01-01

How is online social media activity structured in the geographical space? Recent studies have shown that in spite of earlier visions about the "death of distance", physical proximity is still a major factor in social tie formation and maintenance in virtual social networks. Yet, it is unclear, what are the characteristics of the distance dependence in online social networks. In order to explore this issue the complete network of the former major Hungarian online social network is analyzed. We find that the distance dependence is weaker for the online social network ties than what was found earlier for phone communication networks. For a further analysis we introduced a coarser granularity: We identified the settlements with the nodes of a network and assigned two kinds of weights to the links between them. When the weights are proportional to the number of contacts we observed weakly formed, but spatially based modules resemble to the borders of macro-regions, the highest level of regional administration in the country. If the weights are defined relative to an uncorrelated null model, the next level of administrative regions, counties are reflected.

Geographies of an Online Social Network

PubMed Central

Lengyel, Balázs; Varga, Attila; Ságvári, Bence; Jakobi, Ákos; Kertész, János

2015-01-01

How is online social media activity structured in the geographical space? Recent studies have shown that in spite of earlier visions about the “death of distance”, physical proximity is still a major factor in social tie formation and maintenance in virtual social networks. Yet, it is unclear, what are the characteristics of the distance dependence in online social networks. In order to explore this issue the complete network of the former major Hungarian online social network is analyzed. We find that the distance dependence is weaker for the online social network ties than what was found earlier for phone communication networks. For a further analysis we introduced a coarser granularity: We identified the settlements with the nodes of a network and assigned two kinds of weights to the links between them. When the weights are proportional to the number of contacts we observed weakly formed, but spatially based modules resemble to the borders of macro-regions, the highest level of regional administration in the country. If the weights are defined relative to an uncorrelated null model, the next level of administrative regions, counties are reflected. PMID:26359668

Impact analysis of two kinds of failure strategies in Beijing road transportation network

NASA Astrophysics Data System (ADS)

Zhang, Zundong; Xu, Xiaoyang; Zhang, Zhaoran; Zhou, Huijuan

The Beijing road transportation network (BRTN), as a large-scale technological network, exhibits very complex and complicate features during daily periods. And it has been widely highlighted that how statistical characteristics (i.e. average path length and global network efficiency) change while the network evolves. In this paper, by using different modeling concepts, three kinds of network models of BRTN namely the abstract network model, the static network model with road mileage as weights and the dynamic network model with travel time as weights — are constructed, respectively, according to the topological data and the real detected flow data. The degree distribution of the three kinds of network models are analyzed, which proves that the urban road infrastructure network and the dynamic network behavior like scale-free networks. By analyzing and comparing the important statistical characteristics of three models under random attacks and intentional attacks, it shows that the urban road infrastructure network and the dynamic network of BRTN are both robust and vulnerable.

[Semantic Network Analysis of Online News and Social Media Text Related to Comprehensive Nursing Care Service].

PubMed

Kim, Minji; Choi, Mona; Youm, Yoosik

2017-12-01

As comprehensive nursing care service has gradually expanded, it has become necessary to explore the various opinions about it. The purpose of this study is to explore the large amount of text data regarding comprehensive nursing care service extracted from online news and social media by applying a semantic network analysis. The web pages of the Korean Nurses Association (KNA) News, major daily newspapers, and Twitter were crawled by searching the keyword 'comprehensive nursing care service' using Python. A morphological analysis was performed using KoNLPy. Nodes on a 'comprehensive nursing care service' cluster were selected, and frequency, edge weight, and degree centrality were calculated and visualized with Gephi for the semantic network. A total of 536 news pages and 464 tweets were analyzed. In the KNA News and major daily newspapers, 'nursing workforce' and 'nursing service' were highly rated in frequency, edge weight, and degree centrality. On Twitter, the most frequent nodes were 'National Health Insurance Service' and 'comprehensive nursing care service hospital.' The nodes with the highest edge weight were 'national health insurance,' 'wards without caregiver presence,' and 'caregiving costs.' 'National Health Insurance Service' was highest in degree centrality. This study provides an example of how to use atypical big data for a nursing issue through semantic network analysis to explore diverse perspectives surrounding the nursing community through various media sources. Applying semantic network analysis to online big data to gather information regarding various nursing issues would help to explore opinions for formulating and implementing nursing policies. © 2017 Korean Society of Nursing Science

An A Priori Multiobjective Optimization Model of a Search and Rescue Network

DTIC Science & Technology

1992-03-01

sequences. Classical sensitivity analysis and tolerance analysis were used to analyze the frequency assignments generated by the different weight...function for excess coverage of a frequency. Sensitivity analysis is used to investigate the robustness of the frequency assignments produced by the...interest. The linear program solution is used to produce classical sensitivity analysis for the weight ranges. 17 III. Model Formulation This chapter

Brain Network Analysis: Separating Cost from Topology Using Cost-Integration

PubMed Central

Ginestet, Cedric E.; Nichols, Thomas E.; Bullmore, Ed T.; Simmons, Andrew

2011-01-01

A statistically principled way of conducting brain network analysis is still lacking. Comparison of different populations of brain networks is hard because topology is inherently dependent on wiring cost, where cost is defined as the number of edges in an unweighted graph. In this paper, we evaluate the benefits and limitations associated with using cost-integrated topological metrics. Our focus is on comparing populations of weighted undirected graphs that differ in mean association weight, using global efficiency. Our key result shows that integrating over cost is equivalent to controlling for any monotonic transformation of the weight set of a weighted graph. That is, when integrating over cost, we eliminate the differences in topology that may be due to a monotonic transformation of the weight set. Our result holds for any unweighted topological measure, and for any choice of distribution over cost levels. Cost-integration is therefore helpful in disentangling differences in cost from differences in topology. By contrast, we show that the use of the weighted version of a topological metric is generally not a valid approach to this problem. Indeed, we prove that, under weak conditions, the use of the weighted version of global efficiency is equivalent to simply comparing weighted costs. Thus, we recommend the reporting of (i) differences in weighted costs and (ii) differences in cost-integrated topological measures with respect to different distributions over the cost domain. We demonstrate the application of these techniques in a re-analysis of an fMRI working memory task. We also provide a Monte Carlo method for approximating cost-integrated topological measures. Finally, we discuss the limitations of integrating topology over cost, which may pose problems when some weights are zero, when multiplicities exist in the ranks of the weights, and when one expects subtle cost-dependent topological differences, which could be masked by cost-integration. PMID:21829437

Structural stability of interaction networks against negative external fields

NASA Astrophysics Data System (ADS)

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.

Patterns of brain structural connectivity differentiate normal weight from overweight subjects

PubMed Central

Gupta, Arpana; Mayer, Emeran A.; Sanmiguel, Claudia P.; Van Horn, John D.; Woodworth, Davis; Ellingson, Benjamin M.; Fling, Connor; Love, Aubrey; Tillisch, Kirsten; Labus, Jennifer S.

2015-01-01

Background Alterations in the hedonic component of ingestive behaviors have been implicated as a possible risk factor in the pathophysiology of overweight and obese individuals. Neuroimaging evidence from individuals with increasing body mass index suggests structural, functional, and neurochemical alterations in the extended reward network and associated networks. Aim To apply a multivariate pattern analysis to distinguish normal weight and overweight subjects based on gray and white-matter measurements. Methods Structural images (N = 120, overweight N = 63) and diffusion tensor images (DTI) (N = 60, overweight N = 30) were obtained from healthy control subjects. For the total sample the mean age for the overweight group (females = 32, males = 31) was 28.77 years (SD = 9.76) and for the normal weight group (females = 32, males = 25) was 27.13 years (SD = 9.62). Regional segmentation and parcellation of the brain images was performed using Freesurfer. Deterministic tractography was performed to measure the normalized fiber density between regions. A multivariate pattern analysis approach was used to examine whether brain measures can distinguish overweight from normal weight individuals. Results 1. White-matter classification: The classification algorithm, based on 2 signatures with 17 regional connections, achieved 97% accuracy in discriminating overweight individuals from normal weight individuals. For both brain signatures, greater connectivity as indexed by increased fiber density was observed in overweight compared to normal weight between the reward network regions and regions of the executive control, emotional arousal, and somatosensory networks. In contrast, the opposite pattern (decreased fiber density) was found between ventromedial prefrontal cortex and the anterior insula, and between thalamus and executive control network regions. 2. Gray-matter classification: The classification algorithm, based on 2 signatures with 42 morphological features, achieved 69% accuracy in discriminating overweight from normal weight. In both brain signatures regions of the reward, salience, executive control and emotional arousal networks were associated with lower morphological values in overweight individuals compared to normal weight individuals, while the opposite pattern was seen for regions of the somatosensory network. Conclusions 1. An increased BMI (i.e., overweight subjects) is associated with distinct changes in gray-matter and fiber density of the brain. 2. Classification algorithms based on white-matter connectivity involving regions of the reward and associated networks can identify specific targets for mechanistic studies and future drug development aimed at abnormal ingestive behavior and in overweight/obesity. PMID:25737959

Using Discrete Loss Functions and Weighted Kappa for Classification: An Illustration Based on Bayesian Network Analysis

ERIC Educational Resources Information Center

Zwick, Rebecca; Lenaburg, Lubella

2009-01-01

In certain data analyses (e.g., multiple discriminant analysis and multinomial log-linear modeling), classification decisions are made based on the estimated posterior probabilities that individuals belong to each of several distinct categories. In the Bayesian network literature, this type of classification is often accomplished by assigning…

Convergence and divergence across construction methods for human brain white matter networks: an assessment based on individual differences.

PubMed

Zhong, Suyu; He, Yong; Gong, Gaolang

2015-05-01

Using diffusion MRI, a number of studies have investigated the properties of whole-brain white matter (WM) networks with differing network construction methods (node/edge definition). However, how the construction methods affect individual differences of WM networks and, particularly, if distinct methods can provide convergent or divergent patterns of individual differences remain largely unknown. Here, we applied 10 frequently used methods to construct whole-brain WM networks in a healthy young adult population (57 subjects), which involves two node definitions (low-resolution and high-resolution) and five edge definitions (binary, FA weighted, fiber-density weighted, length-corrected fiber-density weighted, and connectivity-probability weighted). For these WM networks, individual differences were systematically analyzed in three network aspects: (1) a spatial pattern of WM connections, (2) a spatial pattern of nodal efficiency, and (3) network global and local efficiencies. Intriguingly, we found that some of the network construction methods converged in terms of individual difference patterns, but diverged with other methods. Furthermore, the convergence/divergence between methods differed among network properties that were adopted to assess individual differences. Particularly, high-resolution WM networks with differing edge definitions showed convergent individual differences in the spatial pattern of both WM connections and nodal efficiency. For the network global and local efficiencies, low-resolution and high-resolution WM networks for most edge definitions consistently exhibited a highly convergent pattern in individual differences. Finally, the test-retest analysis revealed a decent temporal reproducibility for the patterns of between-method convergence/divergence. Together, the results of the present study demonstrated a measure-dependent effect of network construction methods on the individual difference of WM network properties. © 2015 Wiley Periodicals, Inc.

Neuromorphic photonic networks using silicon photonic weight banks.

PubMed

Tait, Alexander N; de Lima, Thomas Ferreira; Zhou, Ellen; Wu, Allie X; Nahmias, Mitchell A; Shastri, Bhavin J; Prucnal, Paul R

2017-08-07

Photonic systems for high-performance information processing have attracted renewed interest. Neuromorphic silicon photonics has the potential to integrate processing functions that vastly exceed the capabilities of electronics. We report first observations of a recurrent silicon photonic neural network, in which connections are configured by microring weight banks. A mathematical isomorphism between the silicon photonic circuit and a continuous neural network model is demonstrated through dynamical bifurcation analysis. Exploiting this isomorphism, a simulated 24-node silicon photonic neural network is programmed using "neural compiler" to solve a differential system emulation task. A 294-fold acceleration against a conventional benchmark is predicted. We also propose and derive power consumption analysis for modulator-class neurons that, as opposed to laser-class neurons, are compatible with silicon photonic platforms. At increased scale, Neuromorphic silicon photonics could access new regimes of ultrafast information processing for radio, control, and scientific computing.

Distinguishing manipulated stocks via trading network analysis

NASA Astrophysics Data System (ADS)

Sun, Xiao-Qian; Cheng, Xue-Qi; Shen, Hua-Wei; Wang, Zhao-Yang

2011-10-01

Manipulation is an important issue for both developed and emerging stock markets. For the study of manipulation, it is critical to analyze investor behavior in the stock market. In this paper, an analysis of the full transaction records of over a hundred stocks in a one-year period is conducted. For each stock, a trading network is constructed to characterize the relations among its investors. In trading networks, nodes represent investors and a directed link connects a stock seller to a buyer with the total trade size as the weight of the link, and the node strength is the sum of all edge weights of a node. For all these trading networks, we find that the node degree and node strength both have tails following a power-law distribution. Compared with non-manipulated stocks, manipulated stocks have a high lower bound of the power-law tail, a high average degree of the trading network and a low correlation between the price return and the seller-buyer ratio. These findings may help us to detect manipulated stocks.

Multilayer network of language: A unified framework for structural analysis of linguistic subsystems

NASA Astrophysics Data System (ADS)

Martinčić-Ipšić, Sanda; Margan, Domagoj; Meštrović, Ana

2016-09-01

Recently, the focus of complex networks' research has shifted from the analysis of isolated properties of a system toward a more realistic modeling of multiple phenomena - multilayer networks. Motivated by the prosperity of multilayer approach in social, transport or trade systems, we introduce the multilayer networks for language. The multilayer network of language is a unified framework for modeling linguistic subsystems and their structural properties enabling the exploration of their mutual interactions. Various aspects of natural language systems can be represented as complex networks, whose vertices depict linguistic units, while links model their relations. The multilayer network of language is defined by three aspects: the network construction principle, the linguistic subsystem and the language of interest. More precisely, we construct a word-level (syntax and co-occurrence) and a subword-level (syllables and graphemes) network layers, from four variations of original text (in the modeled language). The analysis and comparison of layers at the word and subword-levels are employed in order to determine the mechanism of the structural influences between linguistic units and subsystems. The obtained results suggest that there are substantial differences between the networks' structures of different language subsystems, which are hidden during the exploration of an isolated layer. The word-level layers share structural properties regardless of the language (e.g. Croatian or English), while the syllabic subword-level expresses more language dependent structural properties. The preserved weighted overlap quantifies the similarity of word-level layers in weighted and directed networks. Moreover, the analysis of motifs reveals a close topological structure of the syntactic and syllabic layers for both languages. The findings corroborate that the multilayer network framework is a powerful, consistent and systematic approach to model several linguistic subsystems simultaneously and hence to provide a more unified view on language.

Balanced Centrality of Networks.

PubMed

Debono, Mark; Lauri, Josef; Sciriha, Irene

2014-01-01

There is an age-old question in all branches of network analysis. What makes an actor in a network important, courted, or sought? Both Crossley and Bonacich contend that rather than its intrinsic wealth or value, an actor's status lies in the structures of its interactions with other actors. Since pairwise relation data in a network can be stored in a two-dimensional array or matrix, graph theory and linear algebra lend themselves as great tools to gauge the centrality (interpreted as importance, power, or popularity, depending on the purpose of the network) of each actor. We express known and new centralities in terms of only two matrices associated with the network. We show that derivations of these expressions can be handled exclusively through the main eigenvectors (not orthogonal to the all-one vector) associated with the adjacency matrix. We also propose a centrality vector (SWIPD) which is a linear combination of the square, walk, power, and degree centrality vectors with weightings of the various centralities depending on the purpose of the network. By comparing actors' scores for various weightings, a clear understanding of which actors are most central is obtained. Moreover, for threshold networks, the (SWIPD) measure turns out to be independent of the weightings.

Graph Theoretical Analysis of Functional Brain Networks: Test-Retest Evaluation on Short- and Long-Term Resting-State Functional MRI Data

PubMed Central

Wang, Jin-Hui; Zuo, Xi-Nian; Gohel, Suril; Milham, Michael P.; Biswal, Bharat B.; He, Yong

2011-01-01

Graph-based computational network analysis has proven a powerful tool to quantitatively characterize functional architectures of the brain. However, the test-retest (TRT) reliability of graph metrics of functional networks has not been systematically examined. Here, we investigated TRT reliability of topological metrics of functional brain networks derived from resting-state functional magnetic resonance imaging data. Specifically, we evaluated both short-term (<1 hour apart) and long-term (>5 months apart) TRT reliability for 12 global and 6 local nodal network metrics. We found that reliability of global network metrics was overall low, threshold-sensitive and dependent on several factors of scanning time interval (TI, long-term>short-term), network membership (NM, networks excluding negative correlations>networks including negative correlations) and network type (NT, binarized networks>weighted networks). The dependence was modulated by another factor of node definition (ND) strategy. The local nodal reliability exhibited large variability across nodal metrics and a spatially heterogeneous distribution. Nodal degree was the most reliable metric and varied the least across the factors above. Hub regions in association and limbic/paralimbic cortices showed moderate TRT reliability. Importantly, nodal reliability was robust to above-mentioned four factors. Simulation analysis revealed that global network metrics were extremely sensitive (but varying degrees) to noise in functional connectivity and weighted networks generated numerically more reliable results in compared with binarized networks. For nodal network metrics, they showed high resistance to noise in functional connectivity and no NT related differences were found in the resistance. These findings provide important implications on how to choose reliable analytical schemes and network metrics of interest. PMID:21818285

Weighted projected networks: mapping hypergraphs to networks.

PubMed

López, Eduardo

2013-05-01

Many natural, technological, and social systems incorporate multiway interactions, yet are characterized and measured on the basis of weighted pairwise interactions. In this article, I propose a family of models in which pairwise interactions originate from multiway interactions, by starting from ensembles of hypergraphs and applying projections that generate ensembles of weighted projected networks. I calculate analytically the statistical properties of weighted projected networks, and suggest ways these could be used beyond theoretical studies. Weighted projected networks typically exhibit weight disorder along links even for very simple generating hypergraph ensembles. Also, as the size of a hypergraph changes, a signature of multiway interaction emerges on the link weights of weighted projected networks that distinguishes them from fundamentally weighted pairwise networks. This signature could be used to search for hidden multiway interactions in weighted network data. I find the percolation threshold and size of the largest component for hypergraphs of arbitrary uniform rank, translate the results into projected networks, and show that the transition is second order. This general approach to network formation has the potential to shed new light on our understanding of weighted networks.

Synchronization and spatiotemporal patterns in coupled phase oscillators on a weighted planar network

NASA Astrophysics Data System (ADS)

Kagawa, Yuki; Takamatsu, Atsuko

2009-04-01

To reveal the relation between network structures found in two-dimensional biological systems, such as protoplasmic tube networks in the plasmodium of true slime mold, and spatiotemporal oscillation patterns emerged on the networks, we constructed coupled phase oscillators on weighted planar networks and investigated their dynamics. Results showed that the distribution of edge weights in the networks strongly affects (i) the propensity for global synchronization and (ii) emerging ratios of oscillation patterns, such as traveling and concentric waves, even if the total weight is fixed. In-phase locking, traveling wave, and concentric wave patterns were, respectively, observed most frequently in uniformly weighted, center weighted treelike, and periphery weighted ring-shaped networks. Controlling the global spatiotemporal patterns with the weight distribution given by the local weighting (coupling) rules might be useful in biological network systems including the plasmodial networks and neural networks in the brain.

DTI-based connectome analysis of adolescents with major depressive disorder reveals hypoconnectivity of the right caudate.

PubMed

Tymofiyeva, Olga; Connolly, Colm G; Ho, Tiffany C; Sacchet, Matthew D; Henje Blom, Eva; LeWinn, Kaja Z; Xu, Duan; Yang, Tony T

2017-01-01

Adolescence is a vulnerable period for the onset of major depressive disorder (MDD). While some studies have shown white matter alterations in adolescent MDD, there is still a gap in understanding how the brain is affected at a network level. We compared diffusion tensor imaging (DTI)-based brain networks in a cohort of 57 adolescents with MDD and 41 well-matched healthy controls who completed self-reports of depression symptoms and stressful life events. Using atlas-based brain regions as network nodes and tractography streamline count or mean fractional anisotropy (FA) as edge weights, we examined weighted local and global network properties and performed Network-Based Statistic (NBS) analysis. While there were no significant group differences in the global network properties, the FA-weighted node strength of the right caudate was significantly lower in depressed adolescents and correlated positively with age across both groups. The NBS analysis revealed a cluster of lower FA-based connectivity in depressed subjects centered on the right caudate, including connections to frontal gyri, insula, and anterior cingulate. Within this cluster, the most robust difference between groups was the connection between the right caudate and middle frontal gyrus. This connection showed a significant diagnosis by stress interaction and a negative correlation with total stress in depressed adolescents. Use of DTI-based tractography, one atlas-based parcellation, and FA values to characterize brain networks represent this study's limitations. Our results allowed us to suggest caudate-centric models of dysfunctional processes underlying adolescent depression, which might guide future studies and help better understand and treat this disorder. Copyright © 2016 Elsevier B.V. All rights reserved.

Simple techniques for improving deep neural network outcomes on commodity hardware

NASA Astrophysics Data System (ADS)

Colina, Nicholas Christopher A.; Perez, Carlos E.; Paraan, Francis N. C.

2017-08-01

We benchmark improvements in the performance of deep neural networks (DNN) on the MNIST data test upon imple-menting two simple modifications to the algorithm that have little overhead computational cost. First is GPU parallelization on a commodity graphics card, and second is initializing the DNN with random orthogonal weight matrices prior to optimization. Eigenspectra analysis of the weight matrices reveal that the initially orthogonal matrices remain nearly orthogonal after training. The probability distributions from which these orthogonal matrices are drawn are also shown to significantly affect the performance of these deep neural networks.

Broiler weight estimation based on machine vision and artificial neural network.

PubMed

Amraei, S; Abdanan Mehdizadeh, S; Salari, S

2017-04-01

1. Machine vision and artificial neural network (ANN) procedures were used to estimate live body weight of broiler chickens in 30 1-d-old broiler chickens reared for 42 d. 2. Imaging was performed two times daily. To localise chickens within the pen, an ellipse fitting algorithm was used and the chickens' head and tail removed using the Chan-Vese method. 3. The correlations between the body weight and 6 physical extracted features indicated that there were strong correlations between body weight and the 5 features including area, perimeter, convex area, major and minor axis length. 5. According to statistical analysis there was no significant difference between morning and afternoon data over 42 d. 6. In an attempt to improve the accuracy of live weight approximation different ANN techniques, including Bayesian regulation, Levenberg-Marquardt, Scaled conjugate gradient and gradient descent were used. Bayesian regulation with R 2 value of 0.98 was the best network for prediction of broiler weight. 7. The accuracy of the machine vision technique was examined and most errors were less than 50 g.

Analysis of inter-country input-output table based on citation network: How to measure the competition and collaboration between industrial sectors on the global value chain

PubMed Central

2017-01-01

The input-output table is comprehensive and detailed in describing the national economic system with complex economic relationships, which embodies information of supply and demand among industrial sectors. This paper aims to scale the degree of competition/collaboration on the global value chain from the perspective of econophysics. Global Industrial Strongest Relevant Network models were established by extracting the strongest and most immediate industrial relevance in the global economic system with inter-country input-output tables and then transformed into Global Industrial Resource Competition Network/Global Industrial Production Collaboration Network models embodying the competitive/collaborative relationships based on bibliographic coupling/co-citation approach. Three indicators well suited for these two kinds of weighted and non-directed networks with self-loops were introduced, including unit weight for competitive/collaborative power, disparity in the weight for competitive/collaborative amplitude and weighted clustering coefficient for competitive/collaborative intensity. Finally, these models and indicators were further applied to empirically analyze the function of sectors in the latest World Input-Output Database, to reveal inter-sector competitive/collaborative status during the economic globalization. PMID:28873432

Analysis of inter-country input-output table based on citation network: How to measure the competition and collaboration between industrial sectors on the global value chain.

PubMed

Xing, Lizhi

2017-01-01

The input-output table is comprehensive and detailed in describing the national economic system with complex economic relationships, which embodies information of supply and demand among industrial sectors. This paper aims to scale the degree of competition/collaboration on the global value chain from the perspective of econophysics. Global Industrial Strongest Relevant Network models were established by extracting the strongest and most immediate industrial relevance in the global economic system with inter-country input-output tables and then transformed into Global Industrial Resource Competition Network/Global Industrial Production Collaboration Network models embodying the competitive/collaborative relationships based on bibliographic coupling/co-citation approach. Three indicators well suited for these two kinds of weighted and non-directed networks with self-loops were introduced, including unit weight for competitive/collaborative power, disparity in the weight for competitive/collaborative amplitude and weighted clustering coefficient for competitive/collaborative intensity. Finally, these models and indicators were further applied to empirically analyze the function of sectors in the latest World Input-Output Database, to reveal inter-sector competitive/collaborative status during the economic globalization.

Scaling of Average Weighted Receiving Time on Double-Weighted Koch Networks

NASA Astrophysics Data System (ADS)

Dai, Meifeng; Ye, Dandan; Hou, Jie; Li, Xingyi

2015-03-01

In this paper, we introduce a model of the double-weighted Koch networks based on actual road networks depending on the two weight factors w,r ∈ (0, 1]. The double weights represent the capacity-flowing weight and the cost-traveling weight, respectively. Denote by wFij the capacity-flowing weight connecting the nodes i and j, and denote by wCij the cost-traveling weight connecting the nodes i and j. Let wFij be related to the weight factor w, and let wCij be related to the weight factor r. This paper assumes that the walker, at each step, starting from its current node, moves to any of its neighbors with probability proportional to the capacity-flowing weight of edge linking them. The weighted time for two adjacency nodes is the cost-traveling weight connecting the two nodes. We define the average weighted receiving time (AWRT) on the double-weighted Koch networks. The obtained result displays that in the large network, the AWRT grows as power-law function of the network order with the exponent, represented by θ(w,r) = ½ log2(1 + 3wr). We show that the AWRT exhibits a sublinear or linear dependence on network order. Thus, the double-weighted Koch networks are more efficient than classic Koch networks in receiving information.

System Model Network for Adipose Tissue Signatures Related to Weight Changes in Response to Calorie Restriction and Subsequent Weight Maintenance

PubMed Central

Montastier, Emilie; Villa-Vialaneix, Nathalie; Caspar-Bauguil, Sylvie; Hlavaty, Petr; Tvrzicka, Eva; Gonzalez, Ignacio; Saris, Wim H. M.; Langin, Dominique; Kunesova, Marie; Viguerie, Nathalie

2015-01-01

Nutrigenomics investigates relationships between nutrients and all genome-encoded molecular entities. This holistic approach requires systems biology to scrutinize the effects of diet on tissue biology. To decipher the adipose tissue (AT) response to diet induced weight changes we focused on key molecular (lipids and transcripts) AT species during a longitudinal dietary intervention. To obtain a systems model, a network approach was used to combine all sets of variables (bio-clinical, fatty acids and mRNA levels) and get an overview of their interactions. AT fatty acids and mRNA levels were quantified in 135 obese women at baseline, after an 8-week low calorie diet (LCD) and after 6 months of ad libitum weight maintenance diet (WMD). After LCD, individuals were stratified a posteriori according to weight change during WMD. A 3 steps approach was used to infer a global model involving the 3 sets of variables. It consisted in inferring intra-omic networks with sparse partial correlations and inter-omic networks with regularized canonical correlation analysis and finally combining the obtained omic-specific network in a single global model. The resulting networks were analyzed using node clustering, systematic important node extraction and cluster comparisons. Overall, AT showed both constant and phase-specific biological signatures in response to dietary intervention. AT from women regaining weight displayed growth factors, angiogenesis and proliferation signaling signatures, suggesting unfavorable tissue hyperplasia. By contrast, after LCD a strong positive relationship between AT myristoleic acid (a fatty acid with low AT level) content and de novo lipogenesis mRNAs was found. This relationship was also observed, after WMD, in the group of women that continued to lose weight. This original system biology approach provides novel insight in the AT response to weight control by highlighting the central role of myristoleic acid that may account for the beneficial effects of weight loss. PMID:25590576

Unified functional network and nonlinear time series analysis for complex systems science: The pyunicorn package

NASA Astrophysics Data System (ADS)

Donges, Jonathan F.; Heitzig, Jobst; Beronov, Boyan; Wiedermann, Marc; Runge, Jakob; Feng, Qing Yi; Tupikina, Liubov; Stolbova, Veronika; Donner, Reik V.; Marwan, Norbert; Dijkstra, Henk A.; Kurths, Jürgen

2015-11-01

We introduce the pyunicorn (Pythonic unified complex network and recurrence analysis toolbox) open source software package for applying and combining modern methods of data analysis and modeling from complex network theory and nonlinear time series analysis. pyunicorn is a fully object-oriented and easily parallelizable package written in the language Python. It allows for the construction of functional networks such as climate networks in climatology or functional brain networks in neuroscience representing the structure of statistical interrelationships in large data sets of time series and, subsequently, investigating this structure using advanced methods of complex network theory such as measures and models for spatial networks, networks of interacting networks, node-weighted statistics, or network surrogates. Additionally, pyunicorn provides insights into the nonlinear dynamics of complex systems as recorded in uni- and multivariate time series from a non-traditional perspective by means of recurrence quantification analysis, recurrence networks, visibility graphs, and construction of surrogate time series. The range of possible applications of the library is outlined, drawing on several examples mainly from the field of climatology.

Spatial Distribution Characteristics of Healthcare Facilities in Nanjing: Network Point Pattern Analysis and Correlation Analysis.

PubMed

Ni, Jianhua; Qian, Tianlu; Xi, Changbai; Rui, Yikang; Wang, Jiechen

2016-08-18

The spatial distribution of urban service facilities is largely constrained by the road network. In this study, network point pattern analysis and correlation analysis were used to analyze the relationship between road network and healthcare facility distribution. The weighted network kernel density estimation method proposed in this study identifies significant differences between the outside and inside areas of the Ming city wall. The results of network K-function analysis show that private hospitals are more evenly distributed than public hospitals, and pharmacy stores tend to cluster around hospitals along the road network. After computing the correlation analysis between different categorized hospitals and street centrality, we find that the distribution of these hospitals correlates highly with the street centralities, and that the correlations are higher with private and small hospitals than with public and large hospitals. The comprehensive analysis results could help examine the reasonability of existing urban healthcare facility distribution and optimize the location of new healthcare facilities.

Robustness of weighted networks

NASA Astrophysics Data System (ADS)

Bellingeri, Michele; Cassi, Davide

2018-01-01

Complex network response to node loss is a central question in different fields of network science because node failure can cause the fragmentation of the network, thus compromising the system functioning. Previous studies considered binary networks where the intensity (weight) of the links is not accounted for, i.e. a link is either present or absent. However, in real-world networks the weights of connections, and thus their importance for network functioning, can be widely different. Here, we analyzed the response of real-world and model networks to node loss accounting for link intensity and the weighted structure of the network. We used both classic binary node properties and network functioning measure, introduced a weighted rank for node importance (node strength), and used a measure for network functioning that accounts for the weight of the links (weighted efficiency). We find that: (i) the efficiency of the attack strategies changed using binary or weighted network functioning measures, both for real-world or model networks; (ii) in some cases, removing nodes according to weighted rank produced the highest damage when functioning was measured by the weighted efficiency; (iii) adopting weighted measure for the network damage changed the efficacy of the attack strategy with respect the binary analyses. Our results show that if the weighted structure of complex networks is not taken into account, this may produce misleading models to forecast the system response to node failure, i.e. consider binary links may not unveil the real damage induced in the system. Last, once weighted measures are introduced, in order to discover the best attack strategy, it is important to analyze the network response to node loss using nodes rank accounting the intensity of the links to the node.

Statistical assessment on a combined analysis of GRYN-ROMN-UCBN upland vegetation vital signs

USGS Publications Warehouse

Irvine, Kathryn M.; Rodhouse, Thomas J.

2014-01-01

As of 2013, Rocky Mountain and Upper Columbia Basin Inventory and Monitoring Networks have multiple years of vegetation data and Greater Yellowstone Network has three years of vegetation data and monitoring is ongoing in all three networks. Our primary objective is to assess whether a combined analysis of these data aimed at exploring correlations with climate and weather data is feasible. We summarize the core survey design elements across protocols and point out the major statistical challenges for a combined analysis at present. The dissimilarity in response designs between ROMN and UCBN-GRYN network protocols presents a statistical challenge that has not been resolved yet. However, the UCBN and GRYN data are compatible as they implement a similar response design; therefore, a combined analysis is feasible and will be pursued in future. When data collected by different networks are combined, the survey design describing the merged dataset is (likely) a complex survey design. A complex survey design is the result of combining datasets from different sampling designs. A complex survey design is characterized by unequal probability sampling, varying stratification, and clustering (see Lohr 2010 Chapter 7 for general overview). Statistical analysis of complex survey data requires modifications to standard methods, one of which is to include survey design weights within a statistical model. We focus on this issue for a combined analysis of upland vegetation from these networks, leaving other topics for future research. We conduct a simulation study on the possible effects of equal versus unequal probability selection of points on parameter estimates of temporal trend using available packages within the R statistical computing package. We find that, as written, using lmer or lm for trend detection in a continuous response and clm and clmm for visually estimated cover classes with “raw” GRTS design weights specified for the weight argument leads to substantially different results and/or computational instability. However, when only fixed effects are of interest, the survey package (svyglm and svyolr) may be suitable for a model-assisted analysis for trend. We provide possible directions for future research into combined analysis for ordinal and continuous vital sign indictors.

Analysis of inter-country input-output table based on bibliographic coupling network: How industrial sectors on the GVC compete for production resources

NASA Astrophysics Data System (ADS)

Guan, Jun; Xu, Xiaoyu; Xing, Lizhi

2018-03-01

The input-output table is comprehensive and detailed in describing national economic systems with abundance of economic relationships depicting information of supply and demand among industrial sectors. This paper focuses on how to quantify the degree of competition on the global value chain (GVC) from the perspective of econophysics. Global Industrial Strongest Relevant Network models are established by extracting the strongest and most immediate industrial relevance in the global economic system with inter-country input-output (ICIO) tables and then have them transformed into Global Industrial Resource Competition Network models to analyze the competitive relationships based on bibliographic coupling approach. Three indicators well suited for the weighted and undirected networks with self-loops are introduced here, including unit weight for competitive power, disparity in the weight for competitive amplitude and weighted clustering coefficient for competitive intensity. Finally, these models and indicators were further applied empirically to analyze the function of industrial sectors on the basis of the latest World Input-Output Database (WIOD) in order to reveal inter-sector competitive status during the economic globalization.

Detecting complexes from edge-weighted PPI networks via genes expression analysis.

PubMed

Zhang, Zehua; Song, Jian; Tang, Jijun; Xu, Xinying; Guo, Fei

2018-04-24

Identifying complexes from PPI networks has become a key problem to elucidate protein functions and identify signal and biological processes in a cell. Proteins binding as complexes are important roles of life activity. Accurate determination of complexes in PPI networks is crucial for understanding principles of cellular organization. We propose a novel method to identify complexes on PPI networks, based on different co-expression information. First, we use Markov Cluster Algorithm with an edge-weighting scheme to calculate complexes on PPI networks. Then, we propose some significant features, such as graph information and gene expression analysis, to filter and modify complexes predicted by Markov Cluster Algorithm. To evaluate our method, we test on two experimental yeast PPI networks. On DIP network, our method has Precision and F-Measure values of 0.6004 and 0.5528. On MIPS network, our method has F-Measure and S n values of 0.3774 and 0.3453. Comparing to existing methods, our method improves Precision value by at least 0.1752, F-Measure value by at least 0.0448, S n value by at least 0.0771. Experiments show that our method achieves better results than some state-of-the-art methods for identifying complexes on PPI networks, with the prediction quality improved in terms of evaluation criteria.

Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk

NASA Astrophysics Data System (ADS)

Ye, Dandan; Dai, Meifeng; Sun, Yanqiu; Shao, Shuxiang; Xie, Qi

2016-09-01

Based on the weighted Koch networks and the self-similarity of fractals, we present a family of weighted polygon Koch networks with a weight factor r(0 < r ≤ 1) . We study the average receiving time (ART) on weight-dependent walk (i.e., the walker moves to any of its neighbors with probability proportional to the weight of edge linking them), whose key step is to calculate the sum of mean first-passage times (MFPTs) for all nodes absorpt at a hub node. We use a recursive division method to divide the weighted polygon Koch networks in order to calculate the ART scaling more conveniently. We show that the ART scaling exhibits a sublinear or linear dependence on network order. Thus, the weighted polygon Koch networks are more efficient than expended Koch networks in receiving information. Finally, compared with other previous studies' results (i.e., Koch networks, weighted Koch networks), we find out that our models are more general.

Abnormal brain white matter network in young smokers: a graph theory analysis study.

PubMed

Zhang, Yajuan; Li, Min; Wang, Ruonan; Bi, Yanzhi; Li, Yangding; Yi, Zhang; Liu, Jixin; Yu, Dahua; Yuan, Kai

2018-04-01

Previous diffusion tensor imaging (DTI) studies had investigated the white matter (WM) integrity abnormalities in some specific fiber bundles in smokers. However, little is known about the changes in topological organization of WM structural network in young smokers. In current study, we acquired DTI datasets from 58 male young smokers and 51 matched nonsmokers and constructed the WM networks by the deterministic fiber tracking approach. Graph theoretical analysis was used to compare the topological parameters of WM network (global and nodal) and the inter-regional fractional anisotropy (FA) weighted WM connections between groups. The results demonstrated that both young smokers and nonsmokers had small-world topology in WM network. Further analysis revealed that the young smokers exhibited the abnormal topological organization, i.e., increased network strength, global efficiency, and decreased shortest path length. In addition, the increased nodal efficiency predominately was located in frontal cortex, striatum and anterior cingulate gyrus (ACG) in smokers. Moreover, based on network-based statistic (NBS) approach, the significant increased FA-weighted WM connections were mainly found in the PFC, ACG and supplementary motor area (SMA) regions. Meanwhile, the network parameters were correlated with the nicotine dependence severity (FTND) scores, and the nodal efficiency of orbitofrontal cortex was positive correlation with the cigarette per day (CPD) in young smokers. We revealed the abnormal topological organization of WM network in young smokers, which may improve our understanding of the neural mechanism of young smokers form WM topological organization level.

Neural Network and Regression Methods Demonstrated in the Design Optimization of a Subsonic Aircraft

NASA Technical Reports Server (NTRS)

Hopkins, Dale A.; Lavelle, Thomas M.; Patnaik, Surya

2003-01-01

The neural network and regression methods of NASA Glenn Research Center s COMETBOARDS design optimization testbed were used to generate approximate analysis and design models for a subsonic aircraft operating at Mach 0.85 cruise speed. The analytical model is defined by nine design variables: wing aspect ratio, engine thrust, wing area, sweep angle, chord-thickness ratio, turbine temperature, pressure ratio, bypass ratio, fan pressure; and eight response parameters: weight, landing velocity, takeoff and landing field lengths, approach thrust, overall efficiency, and compressor pressure and temperature. The variables were adjusted to optimally balance the engines to the airframe. The solution strategy included a sensitivity model and the soft analysis model. Researchers generated the sensitivity model by training the approximators to predict an optimum design. The trained neural network predicted all response variables, within 5-percent error. This was reduced to 1 percent by the regression method. The soft analysis model was developed to replace aircraft analysis as the reanalyzer in design optimization. Soft models have been generated for a neural network method, a regression method, and a hybrid method obtained by combining the approximators. The performance of the models is graphed for aircraft weight versus thrust as well as for wing area and turbine temperature. The regression method followed the analytical solution with little error. The neural network exhibited 5-percent maximum error over all parameters. Performance of the hybrid method was intermediate in comparison to the individual approximators. Error in the response variable is smaller than that shown in the figure because of a distortion scale factor. The overall performance of the approximators was considered to be satisfactory because aircraft analysis with NASA Langley Research Center s FLOPS (Flight Optimization System) code is a synthesis of diverse disciplines: weight estimation, aerodynamic analysis, engine cycle analysis, propulsion data interpolation, mission performance, airfield length for landing and takeoff, noise footprint, and others.

Scaling of average weighted shortest path and average receiving time on weighted expanded Koch networks

NASA Astrophysics Data System (ADS)

Wu, Zikai; Hou, Baoyu; Zhang, Hongjuan; Jin, Feng

2014-04-01

Deterministic network models have been attractive media for discussing dynamical processes' dependence on network structural features. On the other hand, the heterogeneity of weights affect dynamical processes taking place on networks. In this paper, we present a family of weighted expanded Koch networks based on Koch networks. They originate from a r-polygon, and each node of current generation produces m r-polygons including the node and whose weighted edges are scaled by factor w in subsequent evolutionary step. We derive closed-form expressions for average weighted shortest path length (AWSP). In large network, AWSP stays bounded with network order growing (0 < w < 1). Then, we focus on a special random walks and trapping issue on the networks. In more detail, we calculate exactly the average receiving time (ART). ART exhibits a sub-linear dependence on network order (0 < w < 1), which implies that nontrivial weighted expanded Koch networks are more efficient than un-weighted expanded Koch networks in receiving information. Besides, efficiency of receiving information at hub nodes is also dependent on parameters m and r. These findings may pave the way for controlling information transportation on general weighted networks.

Summarisation of weighted networks

NASA Astrophysics Data System (ADS)

Zhou, Fang; Qu, Qiang; Toivonen, Hannu

2017-09-01

Networks often contain implicit structure. We introduce novel problems and methods that look for structure in networks, by grouping nodes into supernodes and edges to superedges, and then make this structure visible to the user in a smaller generalised network. This task of finding generalisations of nodes and edges is formulated as 'network Summarisation'. We propose models and algorithms for networks that have weights on edges, on nodes or on both, and study three new variants of the network summarisation problem. In edge-based weighted network summarisation, the summarised network should preserve edge weights as well as possible. A wider class of settings is considered in path-based weighted network summarisation, where the resulting summarised network should preserve longer range connectivities between nodes. Node-based weighted network summarisation in turn allows weights also on nodes and summarisation aims to preserve more information related to high weight nodes. We study theoretical properties of these problems and show them to be NP-hard. We propose a range of heuristic generalisation algorithms with different trade-offs between complexity and quality of the result. Comprehensive experiments on real data show that weighted networks can be summarised efficiently with relatively little error.

A further analysis of the role of heterogeneity in coevolutionary spatial games

NASA Astrophysics Data System (ADS)

Cardinot, Marcos; Griffith, Josephine; O'Riordan, Colm

2018-03-01

Heterogeneity has been studied as one of the most common explanations of the puzzle of cooperation in social dilemmas. A large number of papers have been published discussing the effects of increasing heterogeneity in structured populations of agents, where it has been established that heterogeneity may favour cooperative behaviour if it supports agents to locally coordinate their strategies. In this paper, assuming an existing model of a heterogeneous weighted network, we aim to further this analysis by exploring the relationship (if any) between heterogeneity and cooperation. We adopt a weighted network which is fully populated by agents playing both the Prisoner's Dilemma or the Optional Prisoner's Dilemma games with coevolutionary rules, i.e., not only the strategies but also the link weights evolve over time. Surprisingly, results show that the heterogeneity of link weights (states) on their own does not always promote cooperation; rather cooperation is actually favoured by the increase in the number of overlapping states and not by the heterogeneity itself. We believe that these results can guide further research towards a more accurate analysis of the role of heterogeneity in social dilemmas.

The Situation Awareness Weighted Network (SAWN) model and method: Theory and application.

PubMed

Kalloniatis, Alexander; Ali, Irena; Neville, Timothy; La, Phuong; Macleod, Iain; Zuparic, Mathew; Kohn, Elizabeth

2017-05-01

We introduce a novel model and associated data collection method to examine how a distributed organisation of military staff who feed a Common Operating Picture (COP) generates Situation Awareness (SA), a critical component in organisational performance. The proposed empirically derived Situation Awareness Weighted Network (SAWN) model draws on two scientific models of SA, by Endsley involving perception, comprehension and projection, and by Stanton et al. positing that SA exists across a social and semantic network of people and information objects in activities connected across a set of tasks. The output of SAWN is a representation as a weighted semi-bipartite network of the interaction between people ('human nodes') and information artefacts such as documents and system displays ('product nodes'); link weights represent the Endsley levels of SA that individuals acquire from or provide to information objects and other individuals. The SAWN method is illustrated with aggregated empirical data from a case study of Australian military staff undertaking their work during two very different scenarios, during steady-state operations and in a crisis threat context. A key outcome of analysis of the weighted networks is that we are able to quantify flow of SA through an organisation as staff seek to "value-add" in the conduct of their work. Crown Copyright © 2017. Published by Elsevier Ltd. All rights reserved.

Two-pole microring weight banks.

PubMed

Tait, Alexander N; Wu, Allie X; Ferreira de Lima, Thomas; Nahmias, Mitchell A; Shastri, Bhavin J; Prucnal, Paul R

2018-05-15

Weighted addition is an elemental multi-input to single-output operation that can be implemented with high-performance photonic devices. Microring (MRR) weight banks bring programmable weighted addition to silicon photonics. Prior work showed that their channel limits are affected by coherent inter-channel effects that occur uniquely in weight banks. We fabricate two-pole designs that exploit this inter-channel interference in a way that is robust to dynamic tuning and fabrication variation. Scaling analysis predicts a channel count improvement of 3.4-fold, which is substantially greater than predicted by incoherent analysis used in conventional MRR devices. Advances in weight bank design expand the potential of reconfigurable analog photonic networks and multivariate microwave photonics.

Identification of key candidate genes and pathways in hepatitis B virus-associated acute liver failure by bioinformatical analysis

PubMed Central

Lin, Huapeng; Zhang, Qian; Li, Xiaocheng; Wu, Yushen; Liu, Ye; Hu, Yingchun

2018-01-01

Abstract Hepatitis B virus-associated acute liver failure (HBV-ALF) is a rare but life-threatening syndrome that carried a high morbidity and mortality. Our study aimed to explore the possible molecular mechanisms of HBV-ALF by means of bioinformatics analysis. In this study, genes expression microarray datasets of HBV-ALF from Gene Expression Omnibus were collected, and then we identified differentially expressed genes (DEGs) by the limma package in R. After functional enrichment analysis, we constructed the protein–protein interaction (PPI) network by the Search Tool for the Retrieval of Interacting Genes online database and weighted genes coexpression network by the WGCNA package in R. Subsequently, we picked out the hub genes among the DEGs. A total of 423 DEGs with 198 upregulated genes and 225 downregulated genes were identified between HBV-ALF and normal samples. The upregulated genes were mainly enriched in immune response, and the downregulated genes were mainly enriched in complement and coagulation cascades. Orosomucoid 1 (ORM1), orosomucoid 2 (ORM2), plasminogen (PLG), and aldehyde oxidase 1 (AOX1) were picked out as the hub genes that with a high degree in both PPI network and weighted genes coexpression network. The weighted genes coexpression network analysis found out 3 of the 5 modules that upregulated genes enriched in were closely related to immune system. The downregulated genes enriched in only one module, and the genes in this module majorly enriched in the complement and coagulation cascades pathway. In conclusion, 4 genes (ORM1, ORM2, PLG, and AOX1) with immune response and the complement and coagulation cascades pathway may take part in the pathogenesis of HBV-ALF, and these candidate genes and pathways could be therapeutic targets for HBV-ALF. PMID:29384847

A neural network construction method for surrogate modeling of physics-based analysis

NASA Astrophysics Data System (ADS)

Sung, Woong Je

In this thesis existing methodologies related to the developmental methods of neural networks have been surveyed and their approaches to network sizing and structuring are carefully observed. This literature review covers the constructive methods, the pruning methods, and the evolutionary methods and questions about the basic assumption intrinsic to the conventional neural network learning paradigm, which is primarily devoted to optimization of connection weights (or synaptic strengths) for the pre-determined connection structure of the network. The main research hypothesis governing this thesis is that, without breaking a prevailing dichotomy between weights and connectivity of the network during learning phase, the efficient design of a task-specific neural network is hard to achieve because, as long as connectivity and weights are searched by separate means, a structural optimization of the neural network requires either repetitive re-training procedures or computationally expensive topological meta-search cycles. The main contribution of this thesis is designing and testing a novel learning mechanism which efficiently learns not only weight parameters but also connection structure from a given training data set, and positioning this learning mechanism within the surrogate modeling practice. In this work, a simple and straightforward extension to the conventional error Back-Propagation (BP) algorithm has been formulated to enable a simultaneous learning for both connectivity and weights of the Generalized Multilayer Perceptron (GMLP) in supervised learning tasks. A particular objective is to achieve a task-specific network having reasonable generalization performance with a minimal training time. The dichotomy between architectural design and weight optimization is reconciled by a mechanism establishing a new connection for a neuron pair which has potentially higher error-gradient than one of the existing connections. Interpreting an instance of the absence of connection as a zero-weight connection, the potential contribution to training error reduction of any present or absent connection can readily be evaluated using the BP algorithm. Instead of being broken, the connections that contribute less remain frozen with constant weight values optimized to that point but they are excluded from further weight optimization until reselected. In this way, a selective weight optimization is executed only for the dynamically maintained pool of high gradient connections. By searching the rapidly changing weights and concentrating optimization resources on them, the learning process is accelerated without either a significant increase in computational cost or a need for re-training. This results in a more task-adapted network connection structure. Combined with another important criterion for the division of a neuron which adds a new computational unit to a network, a highly fitted network can be grown out of the minimal random structure. This particular learning strategy can belong to a more broad class of the variable connectivity learning scheme and the devised algorithm has been named Optimal Brain Growth (OBG). The OBG algorithm has been tested on two canonical problems; a regression analysis using the Complicated Interaction Regression Function and a classification of the Two-Spiral Problem. A comparative study with conventional Multilayer Perceptrons (MLPs) consisting of single- and double-hidden layers shows that OBG is less sensitive to random initial conditions and generalizes better with only a minimal increase in computational time. This partially proves that a variable connectivity learning scheme has great potential to enhance computational efficiency and reduce efforts to select proper network architecture. To investigate the applicability of the OBG to more practical surrogate modeling tasks, the geometry-to-pressure mapping of a particular class of airfoils in the transonic flow regime has been sought using both the conventional MLP networks with pre-defined architecture and the OBG-developed networks started from the same initial MLP networks. Considering wide variety in airfoil geometry and diversity of flow conditions distributed over a range of flow Mach numbers and angles of attack, the new method shows a great potential to capture fundamentally nonlinear flow phenomena especially related to the occurrence of shock waves on airfoil surfaces in transonic flow regime. (Abstract shortened by UMI.).

Machine learning framework for analysis of transport through complex networks in porous, granular media: A focus on permeability

NASA Astrophysics Data System (ADS)

van der Linden, Joost H.; Narsilio, Guillermo A.; Tordesillas, Antoinette

2016-08-01

We present a data-driven framework to study the relationship between fluid flow at the macroscale and the internal pore structure, across the micro- and mesoscales, in porous, granular media. Sphere packings with varying particle size distribution and confining pressure are generated using the discrete element method. For each sample, a finite element analysis of the fluid flow is performed to compute the permeability. We construct a pore network and a particle contact network to quantify the connectivity of the pores and particles across the mesoscopic spatial scales. Machine learning techniques for feature selection are employed to identify sets of microstructural properties and multiscale complex network features that optimally characterize permeability. We find a linear correlation (in log-log scale) between permeability and the average closeness centrality of the weighted pore network. With the pore network links weighted by the local conductance, the average closeness centrality represents a multiscale measure of efficiency of flow through the pore network in terms of the mean geodesic distance (or shortest path) between all pore bodies in the pore network. Specifically, this study objectively quantifies a hypothesized link between high permeability and efficient shortest paths that thread through relatively large pore bodies connected to each other by high conductance pore throats, embodying connectivity and pore structure.

Reconstruction of network topology using status-time-series data

NASA Astrophysics Data System (ADS)

Pandey, Pradumn Kumar; Badarla, Venkataramana

2018-01-01

Uncovering the heterogeneous connection pattern of a networked system from the available status-time-series (STS) data of a dynamical process on the network is of great interest in network science and known as a reverse engineering problem. Dynamical processes on a network are affected by the structure of the network. The dependency between the diffusion dynamics and structure of the network can be utilized to retrieve the connection pattern from the diffusion data. Information of the network structure can help to devise the control of dynamics on the network. In this paper, we consider the problem of network reconstruction from the available status-time-series (STS) data using matrix analysis. The proposed method of network reconstruction from the STS data is tested successfully under susceptible-infected-susceptible (SIS) diffusion dynamics on real-world and computer-generated benchmark networks. High accuracy and efficiency of the proposed reconstruction procedure from the status-time-series data define the novelty of the method. Our proposed method outperforms compressed sensing theory (CST) based method of network reconstruction using STS data. Further, the same procedure of network reconstruction is applied to the weighted networks. The ordering of the edges in the weighted networks is identified with high accuracy.

The effects of various diets on glycemic outcomes during pregnancy: A systematic review and network meta-analysis.

PubMed

Ha, Vanessa; Bonner, Ashley J; Jadoo, Jaynendr K; Beyene, Joseph; Anand, Sonia S; de Souza, Russell J

2017-01-01

Evidence to support dietary modifications to improve glycemia during pregnancy is limited, and the benefits of diet beyond limiting gestational weight gain is unclear. Therefore, a systematic review and network meta-analysis of randomized trials was conducted to compare the effects of various common diets, stratified by the addition of gestational weight gain advice, on fasting glucose and insulin, hemoglobin A1c (HbA1c), and homeostatic model assessment for insulin resistance (HOMA-IR) in pregnant women. MEDLINE, EMBASE, Cochrane database, and reference lists of published studies were searched through April 2017. Randomized trials directly comparing two or more diets for ≥2-weeks were eligible. Bayesian network meta-analysis was performed for fasting glucose. Owing to a lack of similar dietary comparisons, a standard pairwise meta-analysis for the other glycemic outcomes was performed. The certainty of the pooled effect estimates was assessed using the GRADE tool. Twenty-one trials (1,865 participants) were included. In general, when given alongside gestational weight gain advice, fasting glucose improved in most diets compared to diets that gave gestational weight gain advice only. However, fasting glucose increased in high unsaturated or monounsaturated fatty acids diets. In the absence of gestational weight gain advice, fasting glucose improved in DASH-style diets compared to standard of care. Although most were non-significant, similar trends were observed for these same diets for the other glycemic outcomes. Dietary comparisons ranged from moderate to very low in quality of evidence. Alongside with gestational weight gain advice, most diets, with the exception of a high unsaturated or a high monounsaturated fatty acid diet, demonstrated a fasting glucose improvement compared with gestational weight gain advice only. When gestational weight gain advice was not given, the DASH-style diet appeared optimal on fasting glucose. However, a small number of trials were identified and most dietary comparisons were underpowered to detect differences in glycemic outcomes. Further studies that are high in quality and adequately powered are needed to confirm these findings. PROSPERO CRD42015026008.

The effects of various diets on glycemic outcomes during pregnancy: A systematic review and network meta-analysis

PubMed Central

Ha, Vanessa; Bonner, Ashley J.; Jadoo, Jaynendr K.; Beyene, Joseph; Anand, Sonia S.

2017-01-01

Aims Evidence to support dietary modifications to improve glycemia during pregnancy is limited, and the benefits of diet beyond limiting gestational weight gain is unclear. Therefore, a systematic review and network meta-analysis of randomized trials was conducted to compare the effects of various common diets, stratified by the addition of gestational weight gain advice, on fasting glucose and insulin, hemoglobin A1c (HbA1c), and homeostatic model assessment for insulin resistance (HOMA-IR) in pregnant women. Methods MEDLINE, EMBASE, Cochrane database, and reference lists of published studies were searched through April 2017. Randomized trials directly comparing two or more diets for ≥2-weeks were eligible. Bayesian network meta-analysis was performed for fasting glucose. Owing to a lack of similar dietary comparisons, a standard pairwise meta-analysis for the other glycemic outcomes was performed. The certainty of the pooled effect estimates was assessed using the GRADE tool. Results Twenty-one trials (1,865 participants) were included. In general, when given alongside gestational weight gain advice, fasting glucose improved in most diets compared to diets that gave gestational weight gain advice only. However, fasting glucose increased in high unsaturated or monounsaturated fatty acids diets. In the absence of gestational weight gain advice, fasting glucose improved in DASH-style diets compared to standard of care. Although most were non-significant, similar trends were observed for these same diets for the other glycemic outcomes. Dietary comparisons ranged from moderate to very low in quality of evidence. Conclusion/Interpretation Alongside with gestational weight gain advice, most diets, with the exception of a high unsaturated or a high monounsaturated fatty acid diet, demonstrated a fasting glucose improvement compared with gestational weight gain advice only. When gestational weight gain advice was not given, the DASH-style diet appeared optimal on fasting glucose. However, a small number of trials were identified and most dietary comparisons were underpowered to detect differences in glycemic outcomes. Further studies that are high in quality and adequately powered are needed to confirm these findings. Registration PROSPERO CRD42015026008 PMID:28771519

Weighted link graphs: a distributed IDS for secondary intrusion detection and defense

NASA Astrophysics Data System (ADS)

Zhou, Mian; Lang, Sheau-Dong

2005-03-01

While a firewall installed at the perimeter of a local network provides the first line of defense against the hackers, many intrusion incidents are the results of successful penetration of the firewalls. One computer"s compromise often put the entire network at risk. In this paper, we propose an IDS that provides a finer control over the internal network. The system focuses on the variations of connection-based behavior of each single computer, and uses a weighted link graph to visualize the overall traffic abnormalities. The functionality of our system is of a distributed personal IDS system that also provides a centralized traffic analysis by graphical visualization. We use a novel weight assignment schema for the local detection within each end agent. The local abnormalities are quantitatively carried out by the node weight and link weight and further sent to the central analyzer to build the weighted link graph. Thus, we distribute the burden of traffic processing and visualization to each agent and make it more efficient for the overall intrusion detection. As the LANs are more vulnerable to inside attacks, our system is designed as a reinforcement to prevent corruption from the inside.

Convergence analysis of stochastic hybrid bidirectional associative memory neural networks with delays

NASA Astrophysics Data System (ADS)

Wan, Li; Zhou, Qinghua

2007-10-01

The stability property of stochastic hybrid bidirectional associate memory (BAM) neural networks with discrete delays is considered. Without assuming the symmetry of synaptic connection weights and the monotonicity and differentiability of activation functions, the delay-independent sufficient conditions to guarantee the exponential stability of the equilibrium solution for such networks are given by using the nonnegative semimartingale convergence theorem.

Weighted Association Rule Mining for Item Groups with Different Properties and Risk Assessment for Networked Systems

NASA Astrophysics Data System (ADS)

Kim, Jungja; Ceong, Heetaek; Won, Yonggwan

In market-basket analysis, weighted association rule (WAR) discovery can mine the rules that include more beneficial information by reflecting item importance for special products. In the point-of-sale database, each transaction is composed of items with similar properties, and item weights are pre-defined and fixed by a factor such as the profit. However, when items are divided into more than one group and the item importance must be measured independently for each group, traditional weighted association rule discovery cannot be used. To solve this problem, we propose a new weighted association rule mining methodology. The items should be first divided into subgroups according to their properties, and the item importance, i.e. item weight, is defined or calculated only with the items included in the subgroup. Then, transaction weight is measured by appropriately summing the item weights from each subgroup, and the weighted support is computed as the fraction of the transaction weights that contains the candidate items relative to the weight of all transactions. As an example, our proposed methodology is applied to assess the vulnerability to threats of computer systems that provide networked services. Our algorithm provides both quantitative risk-level values and qualitative risk rules for the security assessment of networked computer systems using WAR discovery. Also, it can be widely used for new applications with many data sets in which the data items are distinctly separated.

Advanced functional network analysis in the geosciences: The pyunicorn package

NASA Astrophysics Data System (ADS)

Donges, Jonathan F.; Heitzig, Jobst; Runge, Jakob; Schultz, Hanna C. H.; Wiedermann, Marc; Zech, Alraune; Feldhoff, Jan; Rheinwalt, Aljoscha; Kutza, Hannes; Radebach, Alexander; Marwan, Norbert; Kurths, Jürgen

2013-04-01

Functional networks are a powerful tool for analyzing large geoscientific datasets such as global fields of climate time series originating from observations or model simulations. pyunicorn (pythonic unified complex network and recurrence analysis toolbox) is an open-source, fully object-oriented and easily parallelizable package written in the language Python. It allows for constructing functional networks (aka climate networks) representing the structure of statistical interrelationships in large datasets and, subsequently, investigating this structure using advanced methods of complex network theory such as measures for networks of interacting networks, node-weighted statistics or network surrogates. Additionally, pyunicorn allows to study the complex dynamics of geoscientific systems as recorded by time series by means of recurrence networks and visibility graphs. The range of possible applications of the package is outlined drawing on several examples from climatology.

Integration of ANFIS, NN and GA to determine core porosity and permeability from conventional well log data

NASA Astrophysics Data System (ADS)

Ja'fari, Ahmad; Hamidzadeh Moghadam, Rasoul

2012-10-01

Routine core analysis provides useful information for petrophysical study of the hydrocarbon reservoirs. Effective porosity and fluid conductivity (permeability) could be obtained from core analysis in laboratory. Coring hydrocarbon bearing intervals and analysis of obtained cores in laboratory is expensive and time consuming. In this study an improved method to make a quantitative correlation between porosity and permeability obtained from core and conventional well log data by integration of different artificial intelligent systems is proposed. The proposed method combines the results of adaptive neuro-fuzzy inference system (ANFIS) and neural network (NN) algorithms for overall estimation of core data from conventional well log data. These methods multiply the output of each algorithm with a weight factor. Simple averaging and weighted averaging were used for determining the weight factors. In the weighted averaging method the genetic algorithm (GA) is used to determine the weight factors. The overall algorithm was applied in one of SW Iran’s oil fields with two cored wells. One-third of all data were used as the test dataset and the rest of them were used for training the networks. Results show that the output of the GA averaging method provided the best mean square error and also the best correlation coefficient with real core data.

Multinetwork of international trade: A commodity-specific analysis

NASA Astrophysics Data System (ADS)

Barigozzi, Matteo; Fagiolo, Giorgio; Garlaschelli, Diego

2010-04-01

We study the topological properties of the multinetwork of commodity-specific trade relations among world countries over the 1992-2003 period, comparing them with those of the aggregate-trade network, known in the literature as the international-trade network (ITN). We show that link-weight distributions of commodity-specific networks are extremely heterogeneous and (quasi) log normality of aggregate link-weight distribution is generated as a sheer outcome of aggregation. Commodity-specific networks also display average connectivity, clustering, and centrality levels very different from their aggregate counterpart. We also find that ITN complete connectivity is mainly achieved through the presence of many weak links that keep commodity-specific networks together and that the correlation structure existing between topological statistics within each single network is fairly robust and mimics that of the aggregate network. Finally, we employ cross-commodity correlations between link weights to build hierarchies of commodities. Our results suggest that on the top of a relatively time-invariant “intrinsic” taxonomy (based on inherent between-commodity similarities), the roles played by different commodities in the ITN have become more and more dissimilar, possibly as the result of an increased trade specialization. Our approach is general and can be used to characterize any multinetwork emerging as a nontrivial aggregation of several interdependent layers.

Investigation of Spatial Data with Open Source Social Network Analysis and Geographic Information Systems Applications

NASA Astrophysics Data System (ADS)

Sabah, L.; Şimşek, M.

2017-11-01

Social networks are the real social experience of individuals in the online environment. In this environment, people use symbolic gestures and mimics, sharing thoughts and content. Social network analysis is the visualization of complex and large quantities of data to ensure that the overall picture appears. It is the understanding, development, quantitative and qualitative analysis of the relations in the social networks of Graph theory. Social networks are expressed in the form of nodes and edges. Nodes are people/organizations, and edges are relationships between nodes. Relations are directional, non-directional, weighted, and weightless. The purpose of this study is to examine the effects of social networks on the evaluation of person data with spatial coordinates. For this, the cluster size and the effect on the geographical area of the circle where the placements of the individual are influenced by the frequently used placeholder feature in the social networks have been studied.

Small-World Brain Networks Revisited

PubMed Central

Bassett, Danielle S.; Bullmore, Edward T.

2016-01-01

It is nearly 20 years since the concept of a small-world network was first quantitatively defined, by a combination of high clustering and short path length; and about 10 years since this metric of complex network topology began to be widely applied to analysis of neuroimaging and other neuroscience data as part of the rapid growth of the new field of connectomics. Here, we review briefly the foundational concepts of graph theoretical estimation and generation of small-world networks. We take stock of some of the key developments in the field in the past decade and we consider in some detail the implications of recent studies using high-resolution tract-tracing methods to map the anatomical networks of the macaque and the mouse. In doing so, we draw attention to the important methodological distinction between topological analysis of binary or unweighted graphs, which have provided a popular but simple approach to brain network analysis in the past, and the topology of weighted graphs, which retain more biologically relevant information and are more appropriate to the increasingly sophisticated data on brain connectivity emerging from contemporary tract-tracing and other imaging studies. We conclude by highlighting some possible future trends in the further development of weighted small-worldness as part of a deeper and broader understanding of the topology and the functional value of the strong and weak links between areas of mammalian cortex. PMID:27655008

Weighted gene co‑expression network analysis in identification of key genes and networks for ischemic‑reperfusion remodeling myocardium.

PubMed

Guo, Nan; Zhang, Nan; Yan, Liqiu; Lian, Zheng; Wang, Jiawang; Lv, Fengfeng; Wang, Yunfei; Cao, Xufen

2018-06-14

Acute myocardial infarction induces ventricular remodeling, which is implicated in dilated heart and heart failure. The pathogenical mechanism of myocardium remodeling remains to be elucidated. The aim of the present study was to identify key genes and networks for myocardium remodeling following ischemia‑reperfusion (IR). First, the mRNA expression data from the National Center for Biotechnology Information database were downloaded to identify differences in mRNA expression of the IR heart at days 2 and 7. Then, weighted gene co‑expression network analysis, hierarchical clustering, protein‑protein interaction (PPI) network, Gene Ontology (GO), Kyoto Encyclopedia of Genes and Genomes (KEGG) pathway were used to identify key genes and networks for the heart remodeling process following IR. A total of 3,321 differentially expressed genes were identified during the heart remodeling process. A total of 6 modules were identified through gene co‑expression network analysis. GO and KEGG analysis results suggested that each module represented a different biological function and was associated with different pathways. Finally, hub genes of each module were identified by PPI network construction. The present study revealed that heart remodeling following IR is a complicated process, involving extracellular matrix organization, neural development, apoptosis and energy metabolism. The dysregulated genes, including SRC proto‑oncogene, non‑receptor tyrosine kinase, discs large MAGUK scaffold protein 1, ATP citrate lyase, RAN, member RAS oncogene family, tumor protein p53, and polo like kinase 2, may be essential for heart remodeling following IR and may be used as potential targets for the inhibition of heart remodeling following acute myocardial infarction.

Complex-network description of thermal quantum states in the Ising spin chain

NASA Astrophysics Data System (ADS)

Sundar, Bhuvanesh; Valdez, Marc Andrew; Carr, Lincoln D.; Hazzard, Kaden R. A.

2018-05-01

We use network analysis to describe and characterize an archetypal quantum system—an Ising spin chain in a transverse magnetic field. We analyze weighted networks for this quantum system, with link weights given by various measures of spin-spin correlations such as the von Neumann and Rényi mutual information, concurrence, and negativity. We analytically calculate the spin-spin correlations in the system at an arbitrary temperature by mapping the Ising spin chain to fermions, as well as numerically calculate the correlations in the ground state using matrix product state methods, and then analyze the resulting networks using a variety of network measures. We demonstrate that the network measures show some traits of complex networks already in this spin chain, arguably the simplest quantum many-body system. The network measures give insight into the phase diagram not easily captured by more typical quantities, such as the order parameter or correlation length. For example, the network structure varies with transverse field and temperature, and the structure in the quantum critical fan is different from the ordered and disordered phases.

Understanding the implementation of evidence-based care: a structural network approach.

PubMed

Parchman, Michael L; Scoglio, Caterina M; Schumm, Phillip

2011-02-24

Recent study of complex networks has yielded many new insights into phenomenon such as social networks, the internet, and sexually transmitted infections. The purpose of this analysis is to examine the properties of a network created by the 'co-care' of patients within one region of the Veterans Health Affairs. Data were obtained for all outpatient visits from 1 October 2006 to 30 September 2008 within one large Veterans Integrated Service Network. Types of physician within each clinic were nodes connected by shared patients, with a weighted link representing the number of shared patients between each connected pair. Network metrics calculated included edge weights, node degree, node strength, node coreness, and node betweenness. Log-log plots were used to examine the distribution of these metrics. Sizes of k-core networks were also computed under multiple conditions of node removal. There were 4,310,465 encounters by 266,710 shared patients between 722 provider types (nodes) across 41 stations or clinics resulting in 34,390 edges. The number of other nodes to which primary care provider nodes have a connection (172.7) is 42% greater than that of general surgeons and two and one-half times as high as cardiology. The log-log plot of the edge weight distribution appears to be linear in nature, revealing a 'scale-free' characteristic of the network, while the distributions of node degree and node strength are less so. The analysis of the k-core network sizes under increasing removal of primary care nodes shows that about 10 most connected primary care nodes play a critical role in keeping the k-core networks connected, because their removal disintegrates the highest k-core network. Delivery of healthcare in a large healthcare system such as that of the US Department of Veterans Affairs (VA) can be represented as a complex network. This network consists of highly connected provider nodes that serve as 'hubs' within the network, and demonstrates some 'scale-free' properties. By using currently available tools to explore its topology, we can explore how the underlying connectivity of such a system affects the behavior of providers, and perhaps leverage that understanding to improve quality and outcomes of care.

Quantitative workflow based on NN for weighting criteria in landfill suitability mapping

NASA Astrophysics Data System (ADS)

Abujayyab, Sohaib K. M.; Ahamad, Mohd Sanusi S.; Yahya, Ahmad Shukri; Ahmad, Siti Zubaidah; Alkhasawneh, Mutasem Sh.; Aziz, Hamidi Abdul

2017-10-01

Our study aims to introduce a new quantitative workflow that integrates neural networks (NNs) and multi criteria decision analysis (MCDA). Existing MCDA workflows reveal a number of drawbacks, because of the reliance on human knowledge in the weighting stage. Thus, new workflow presented to form suitability maps at the regional scale for solid waste planning based on NNs. A feed-forward neural network employed in the workflow. A total of 34 criteria were pre-processed to establish the input dataset for NN modelling. The final learned network used to acquire the weights of the criteria. Accuracies of 95.2% and 93.2% achieved for the training dataset and testing dataset, respectively. The workflow was found to be capable of reducing human interference to generate highly reliable maps. The proposed workflow reveals the applicability of NN in generating landfill suitability maps and the feasibility of integrating them with existing MCDA workflows.

Track-weighted functional connectivity (TW-FC): a tool for characterizing the structural-functional connections in the brain.

PubMed

Calamante, Fernando; Masterton, Richard A J; Tournier, Jacques-Donald; Smith, Robert E; Willats, Lisa; Raffelt, David; Connelly, Alan

2013-04-15

MRI provides a powerful tool for studying the functional and structural connections in the brain non-invasively. The technique of functional connectivity (FC) exploits the intrinsic temporal correlations of slow spontaneous signal fluctuations to characterise brain functional networks. In addition, diffusion MRI fibre-tracking can be used to study the white matter structural connections. In recent years, there has been considerable interest in combining these two techniques to provide an overall structural-functional description of the brain. In this work we applied the recently proposed super-resolution track-weighted imaging (TWI) methodology to demonstrate how whole-brain fibre-tracking data can be combined with FC data to generate a track-weighted (TW) FC map of FC networks. The method was applied to data from 8 healthy volunteers, and illustrated with (i) FC networks obtained using a seeded connectivity-based analysis (seeding in the precuneus/posterior cingulate cortex, PCC, known to be part of the default mode network), and (ii) with FC networks generated using independent component analysis (in particular, the default mode, attention, visual, and sensory-motor networks). TW-FC maps showed high intensity in white matter structures connecting the nodes of the FC networks. For example, the cingulum bundles show the strongest TW-FC values in the PCC seeded-based analysis, due to their major role in the connection between medial frontal cortex and precuneus/posterior cingulate cortex; similarly the superior longitudinal fasciculus was well represented in the attention network, the optic radiations in the visual network, and the corticospinal tract and corpus callosum in the sensory-motor network. The TW-FC maps highlight the white matter connections associated with a given FC network, and their intensity in a given voxel reflects the functional connectivity of the part of the nodes of the network linked by the structural connections traversing that voxel. They therefore contain a different (and novel) image contrast from that of the images used to generate them. The results shown in this study illustrate the potential of the TW-FC approach for the fusion of structural and functional data into a single quantitative image. This technique could therefore have important applications in neuroscience and neurology, such as for voxel-based comparison studies. Copyright © 2012 Elsevier Inc. All rights reserved.

Modeling Dynamic Evolution of Online Friendship Network

NASA Astrophysics Data System (ADS)

Wu, Lian-Ren; Yan, Qiang

2012-10-01

In this paper, we study the dynamic evolution of friendship network in SNS (Social Networking Site). Our analysis suggests that an individual joining a community depends not only on the number of friends he or she has within the community, but also on the friendship network generated by those friends. In addition, we propose a model which is based on two processes: first, connecting nearest neighbors; second, strength driven attachment mechanism. The model reflects two facts: first, in the social network it is a universal phenomenon that two nodes are connected when they have at least one common neighbor; second, new nodes connect more likely to nodes which have larger weights and interactions, a phenomenon called strength driven attachment (also called weight driven attachment). From the simulation results, we find that degree distribution P(k), strength distribution P(s), and degree-strength correlation are all consistent with empirical data.

Analyses of the response of a complex weighted network to nodes removal strategies considering links weight: The case of the Beijing urban road system

NASA Astrophysics Data System (ADS)

Bellingeri, Michele; Lu, Zhe-Ming; Cassi, Davide; Scotognella, Francesco

2018-02-01

Complex network response to node loss is a central question in different fields of science ranging from physics, sociology, biology to ecology. Previous studies considered binary networks where the weight of the links is not accounted for. However, in real-world networks the weights of connections can be widely different. Here, we analyzed the response of real-world road traffic complex network of Beijing, the most prosperous city in China. We produced nodes removal attack simulations using classic binary node features and we introduced weighted ranks for node importance. We measured the network functioning during nodes removal with three different parameters: the size of the largest connected cluster (LCC), the binary network efficiency (Bin EFF) and the weighted network efficiency (Weg EFF). We find that removing nodes according to weighted rank, i.e. considering the weight of the links as a number of taxi flows along the roads, produced in general the highest damage in the system. Our results show that: (i) in order to model Beijing road complex networks response to nodes (intersections) failure, it is necessary to consider the weight of the links; (ii) to discover the best attack strategy, it is important to use nodes rank accounting links weight.

The influence of tie strength on evolutionary games on networks: An empirical investigation

NASA Astrophysics Data System (ADS)

Buesser, Pierre; Peña, Jorge; Pestelacci, Enea; Tomassini, Marco

2011-11-01

Extending previous work on unweighted networks, we present here a systematic numerical investigation of standard evolutionary games on weighted networks. In the absence of any reliable model for generating weighted social networks, we attribute weights to links in a few ways supported by empirical data ranging from totally uncorrelated to weighted bipartite networks. The results of the extensive simulation work on standard complex network models show that, except in a case that does not seem to be common in social networks, taking the tie strength into account does not change in a radical manner the long-run steady-state behavior of the studied games. Besides model networks, we also included a real-life case drawn from a coauthorship network. In this case also, taking the weights into account only changes the results slightly with respect to the raw unweighted graph, although to draw more reliable conclusions on real social networks many more cases should be studied as these weighted networks become available.

Network analysis of pediatric eating disorder symptoms in a treatment-seeking, transdiagnostic sample.

PubMed

Goldschmidt, Andrea B; Crosby, Ross D; Cao, Li; Moessner, Markus; Forbush, Kelsie T; Accurso, Erin C; Le Grange, Daniel

2018-02-01

Classifying eating disorders in youth is challenging in light of developmental considerations and high rates of diagnostic migration. Understanding the transactional relationships among eating disorder symptoms, both across the transdiagnostic spectrum and within specific diagnostic categories, may clarify which core eating disorder symptoms contribute to, and maintain, eating-related psychopathology in youth. We utilized network analysis to investigate interrelationships among eating disorder symptoms in 636 treatment-seeking children and adolescents (90.3% female) ages 6-18 years (M age = 15.4 ± 2.2). An undirected, weighted network of eating disorder symptoms was created using behavioral and attitudinal items from the Eating Disorder Examination. Across diagnostic groups, symptoms reflecting appearance-related concerns (e.g., dissatisfaction with shape and weight) and dietary restraint (e.g., a desire to have an empty stomach) were most strongly associated with other eating disorder symptoms in the network. Binge eating and compensatory behaviors (e.g., self-induced vomiting) were strongly connected to one another but not to other symptoms in the network. Network connectivity was similar across anorexia nervosa, bulimia nervosa, and otherwise specified feeding or eating disorder subgroups. Among treatment-seeking children and adolescents, dietary restraint and shape- and weight-related concerns appear to play key roles in the psychopathology of eating disorders, supporting cognitive-behavioral theories of onset and maintenance. Similarities across diagnostic categories provide support for a transdiagnostic classification scheme. Clinical interventions should seek to disrupt these symptoms early in treatment to achieve maximal outcomes. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

Reciprocity of weighted networks

PubMed Central

Squartini, Tiziano; Picciolo, Francesco; Ruzzenenti, Franco; Garlaschelli, Diego

2013-01-01

In directed networks, reciprocal links have dramatic effects on dynamical processes, network growth, and higher-order structures such as motifs and communities. While the reciprocity of binary networks has been extensively studied, that of weighted networks is still poorly understood, implying an ever-increasing gap between the availability of weighted network data and our understanding of their dyadic properties. Here we introduce a general approach to the reciprocity of weighted networks, and define quantities and null models that consistently capture empirical reciprocity patterns at different structural levels. We show that, counter-intuitively, previous reciprocity measures based on the similarity of mutual weights are uninformative. By contrast, our measures allow to consistently classify different weighted networks according to their reciprocity, track the evolution of a network's reciprocity over time, identify patterns at the level of dyads and vertices, and distinguish the effects of flux (im)balances or other (a)symmetries from a true tendency towards (anti-)reciprocation. PMID:24056721

Reciprocity of weighted networks.

PubMed

Squartini, Tiziano; Picciolo, Francesco; Ruzzenenti, Franco; Garlaschelli, Diego

2013-01-01

In directed networks, reciprocal links have dramatic effects on dynamical processes, network growth, and higher-order structures such as motifs and communities. While the reciprocity of binary networks has been extensively studied, that of weighted networks is still poorly understood, implying an ever-increasing gap between the availability of weighted network data and our understanding of their dyadic properties. Here we introduce a general approach to the reciprocity of weighted networks, and define quantities and null models that consistently capture empirical reciprocity patterns at different structural levels. We show that, counter-intuitively, previous reciprocity measures based on the similarity of mutual weights are uninformative. By contrast, our measures allow to consistently classify different weighted networks according to their reciprocity, track the evolution of a network's reciprocity over time, identify patterns at the level of dyads and vertices, and distinguish the effects of flux (im)balances or other (a)symmetries from a true tendency towards (anti-)reciprocation.

The Robustness Analysis of Wireless Sensor Networks under Uncertain Interference

PubMed Central

Deng, Changjian

2013-01-01

Based on the complex network theory, robustness analysis of condition monitoring wireless sensor network under uncertain interference is present. In the evolution of the topology of sensor networks, the density weighted algebraic connectivity is taken into account, and the phenomenon of removing and repairing the link and node in the network is discussed. Numerical simulation is conducted to explore algebraic connectivity characteristics and network robustness performance. It is found that nodes density has the effect on algebraic connectivity distribution in the random graph model; high density nodes carry more connections, use more throughputs, and may be more unreliable. Moreover, the results show that, when network should be more error tolerant or robust by repairing nodes or adding new nodes, the network should be better clustered in median and high scale wireless sensor networks and be meshing topology in small scale networks. PMID:24363613

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

NASA Astrophysics Data System (ADS)

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.

Weighted graph cuts without eigenvectors a multilevel approach.

PubMed

Dhillon, Inderjit S; Guan, Yuqiang; Kulis, Brian

2007-11-01

A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods. In this paper, we discuss an equivalence between the objective functions used in these seemingly different methods--in particular, a general weighted kernel k-means objective is mathematically equivalent to a weighted graph clustering objective. We exploit this equivalence to develop a fast, high-quality multilevel algorithm that directly optimizes various weighted graph clustering objectives, such as the popular ratio cut, normalized cut, and ratio association criteria. This eliminates the need for any eigenvector computation for graph clustering problems, which can be prohibitive for very large graphs. Previous multilevel graph partitioning methods, such as Metis, have suffered from the restriction of equal-sized clusters; our multilevel algorithm removes this restriction by using kernel k-means to optimize weighted graph cuts. Experimental results show that our multilevel algorithm outperforms a state-of-the-art spectral clustering algorithm in terms of speed, memory usage, and quality. We demonstrate that our algorithm is applicable to large-scale clustering tasks such as image segmentation, social network analysis and gene network analysis.

Evolutionary Games in Multi-Agent Systems of Weighted Social Networks

NASA Astrophysics Data System (ADS)

Du, Wen-Bo; Cao, Xian-Bin; Zheng, Hao-Ran; Zhou, Hong; Hu, Mao-Bin

Much empirical evidence has shown realistic networks are weighted. Compared with those on unweighted networks, the dynamics on weighted network often exhibit distinctly different phenomena. In this paper, we investigate the evolutionary game dynamics (prisoner's dilemma game and snowdrift game) on a weighted social network consisted of rational agents and focus on the evolution of cooperation in the system. Simulation results show that the cooperation level is strongly affected by the weighted nature of the network. Moreover, the variation of time series has also been investigated. Our work may be helpful in understanding the cooperative behavior in the social systems.

Weighted Scaling in Non-growth Random Networks

NASA Astrophysics Data System (ADS)

Chen, Guang; Yang, Xu-Hua; Xu, Xin-Li

2012-09-01

We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in non-growth random networks. In this model, we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it. The network evolves according to a vertex strength preferential selection mechanism. During the evolution process, the network always holds its total number of vertices and its total number of single-edges constantly. We show analytically and numerically that a network will form steady scale-free distributions with our model. The results show that a weighted non-growth random network can evolve into scale-free state. It is interesting that the network also obtains the character of an exponential edge weight distribution. Namely, coexistence of scale-free distribution and exponential distribution emerges.

Learning in Artificial Neural Systems

NASA Technical Reports Server (NTRS)

Matheus, Christopher J.; Hohensee, William E.

1987-01-01

This paper presents an overview and analysis of learning in Artificial Neural Systems (ANS's). It begins with a general introduction to neural networks and connectionist approaches to information processing. The basis for learning in ANS's is then described, and compared with classical Machine learning. While similar in some ways, ANS learning deviates from tradition in its dependence on the modification of individual weights to bring about changes in a knowledge representation distributed across connections in a network. This unique form of learning is analyzed from two aspects: the selection of an appropriate network architecture for representing the problem, and the choice of a suitable learning rule capable of reproducing the desired function within the given network. The various network architectures are classified, and then identified with explicit restrictions on the types of functions they are capable of representing. The learning rules, i.e., algorithms that specify how the network weights are modified, are similarly taxonomized, and where possible, the limitations inherent to specific classes of rules are outlined.

Node property of weighted networks considering connectability to nodes within two degrees of separation.

PubMed

Amano, Sun-Ichi; Ogawa, Ken-Ichiro; Miyake, Yoshihiro

2018-05-31

Weighted networks have been extensively studied because they can represent various phenomena in which the diversity of edges is essential. To investigate the properties of weighted networks, various centrality measures have been proposed, such as strength, weighted clustering coefficients, and weighted betweenness centrality. In such measures, only direct connections or entire network connectivity from arbitrary nodes have been used to calculate the connectivity of each node. However, in weighted networks composed of autonomous elements such as humans, middle ranges from each node are also considered to be meaningful for characterizing each node's connectability. In this study, we define a new node property in weighted networks to consider connectability to nodes within a range of two degrees of separation, then apply this new centrality to face-to-face human communication networks in corporate organizations. Our results show that the proposed centrality distinguishes inherent communities corresponding to the job types in each organization with a high degree of accuracy. This indicates the possibility that connectability to nodes within two degrees of separation reveals potential trends of weighted networks that are not apparent from conventional measures.

Research on public logistics centers of Zhenzhou city based on GIS

NASA Astrophysics Data System (ADS)

Zeng, Yuhuai; Chen, Shuisen; Tian, Zhihui; Miao, Quansheng

2008-10-01

The regional public logistics center (PLC) is the intermedium that transports goods or commodity from producer to wholesaler, retailer and end consumer through whole supply chains. According to the Central Place Theory, the PLC should be multi-centric and of more kinds of graded degrees. From the road network planning discipline, an unique index---Importance Degree, is presented to measure the capacity of a PLC. The Importance Degree selects three township criteria: total population, gross industry product and budget income as weights to calculate the weighted vectors by principle component analysis method. Finally, through the clustering analysis, we can get the graded degrees of PLCs. It proves that that this research method is very effective for the road network planning of Zhengzhou City.

Average weighted receiving time on the non-homogeneous double-weighted fractal networks

NASA Astrophysics Data System (ADS)

Ye, Dandan; Dai, Meifeng; Sun, Yu; Su, Weiyi

2017-05-01

In this paper, based on actual road networks, a model of the non-homogeneous double-weighted fractal networks is introduced depending on the number of copies s and two kinds of weight factors wi ,ri(i = 1 , 2 , … , s) . The double-weights represent the capacity-flowing weights and the cost-traveling weights, respectively. Denote by wijF the capacity-flowing weight connecting the nodes i and j, and denote by wijC the cost-traveling weight connecting the nodes i and j. Let wijF be related to the weight factors w1 ,w2 , … ,ws, and let wijC be related to the weight factors r1 ,r2 , … ,rs. Assuming that the walker, at each step, starting from its current node, moves to any of its neighbors with probability proportional to the capacity-flowing weight of edge linking them. The weighted time for two adjacency nodes is the cost-traveling weight connecting the two nodes. The average weighted receiving time (AWRT) is defined on the non-homogeneous double-weighted fractal networks. AWRT depends on the relationships of the number of copies s and two kinds of weight factors wi ,ri(i = 1 , 2 , … , s) . The obtained remarkable results display that in the large network, the AWRT grows as a power-law function of the network size Ng with the exponent, represented by θ =logs(w1r1 +w2r2 + ⋯ +wsrs) < 1 when w1r1 +w2r2 + ⋯ +wsrs ≠ 1, which means that the smaller the value of w1r1 +w2r2 + ⋯ +wsrs is, the more efficient the process of receiving information is. Especially when w1r1 +w2r2 + ⋯ +wsrs = 1, AWRT grows with increasing order Ng as logNg or (logNg) 2 . In the classic fractal networks, the average receiving time (ART) grows with linearly with the network size Ng. Thus, the non-homogeneous double-weighted fractal networks are more efficient than classic fractal networks in term of receiving information.

A Benefit Analysis of Infusing Wireless into Aircraft and Fleet Operations - Report to Seedling Project Efficient Reconfigurable Cockpit Design and Fleet Operations Using Software Intensive, Network Enabled, Wireless Architecture (ECON)

NASA Technical Reports Server (NTRS)

Alexandrov, Natalia; Holmes, Bruce J.; Hahn, Andrew S.

2016-01-01

We report on an examination of potential benefits of infusing wireless technologies into various areas of aircraft and airspace operations. The analysis is done in support of a NASA seedling project Efficient Reconfigurable Cockpit Design and Fleet Operations Using Software Intensive, Network Enabled Wireless Architecture (ECON). The study has two objectives. First, we investigate one of the main benefit hypotheses of the ECON proposal: that the replacement of wired technologies with wireless would lead to significant weight reductions on an aircraft, among other benefits. Second, we advance a list of wireless technology applications and discuss their system benefits. With regard to the primary hypothesis, we conclude that the promise of weight reduction is premature. Specificity of the system domain and aircraft, criticality of components, reliability of wireless technologies, the weight of replacement or augmentation equipment, and the cost of infusion must all be taken into account among other considerations, to produce a reliable estimate of weight savings or increase.

Evaluation model of distribution network development based on ANP and grey correlation analysis

NASA Astrophysics Data System (ADS)

Ma, Kaiqiang; Zhan, Zhihong; Zhou, Ming; Wu, Qiang; Yan, Jun; Chen, Genyong

2018-06-01

The existing distribution network evaluation system cannot scientifically and comprehensively reflect the distribution network development status. Furthermore, the evaluation model is monotonous and it is not suitable for horizontal analysis of many regional power grids. For these reason, this paper constructs a set of universal adaptability evaluation index system and model of distribution network development. Firstly, distribution network evaluation system is set up by power supply capability, power grid structure, technical equipment, intelligent level, efficiency of the power grid and development benefit of power grid. Then the comprehensive weight of indices is calculated by combining the AHP with the grey correlation analysis. Finally, the index scoring function can be obtained by fitting the index evaluation criterion to the curve, and then using the multiply plus operator to get the result of sample evaluation. The example analysis shows that the model can reflect the development of distribution network and find out the advantages and disadvantages of distribution network development. Besides, the model provides suggestions for the development and construction of distribution network.

Functional brain networks associated with eating behaviors in obesity.

PubMed

Park, Bo-Yong; Seo, Jongbum; Park, Hyunjin

2016-03-31

Obesity causes critical health problems including diabetes and hypertension that affect billions of people worldwide. Obesity and eating behaviors are believed to be closely linked but their relationship through brain networks has not been fully explored. We identified functional brain networks associated with obesity and examined how the networks were related to eating behaviors. Resting state functional magnetic resonance imaging (MRI) scans were obtained for 82 participants. Data were from an equal number of people of healthy weight (HW) and non-healthy weight (non-HW). Connectivity matrices were computed with spatial maps derived using a group independent component analysis approach. Brain networks and associated connectivity parameters with significant group-wise differences were identified and correlated with scores on a three-factor eating questionnaire (TFEQ) describing restraint, disinhibition, and hunger eating behaviors. Frontoparietal and cerebellum networks showed group-wise differences between HW and non-HW groups. Frontoparietal network showed a high correlation with TFEQ disinhibition scores. Both frontoparietal and cerebellum networks showed a high correlation with body mass index (BMI) scores. Brain networks with significant group-wise differences between HW and non-HW groups were identified. Parts of the identified networks showed a high correlation with eating behavior scores.

Model of community emergence in weighted social networks

NASA Astrophysics Data System (ADS)

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.

Gene Expression Correlated with Severe Asthma Characteristics Reveals Heterogeneous Mechanisms of Severe Disease.

PubMed

Modena, Brian D; Bleecker, Eugene R; Busse, William W; Erzurum, Serpil C; Gaston, Benjamin M; Jarjour, Nizar N; Meyers, Deborah A; Milosevic, Jadranka; Tedrow, John R; Wu, Wei; Kaminski, Naftali; Wenzel, Sally E

2017-06-01

Severe asthma (SA) is a heterogeneous disease with multiple molecular mechanisms. Gene expression studies of bronchial epithelial cells in individuals with asthma have provided biological insight and underscored possible mechanistic differences between individuals. Identify networks of genes reflective of underlying biological processes that define SA. Airway epithelial cell gene expression from 155 subjects with asthma and healthy control subjects in the Severe Asthma Research Program was analyzed by weighted gene coexpression network analysis to identify gene networks and profiles associated with SA and its specific characteristics (i.e., pulmonary function tests, quality of life scores, urgent healthcare use, and steroid use), which potentially identified underlying biological processes. A linear model analysis confirmed these findings while adjusting for potential confounders. Weighted gene coexpression network analysis constructed 64 gene network modules, including modules corresponding to T1 and T2 inflammation, neuronal function, cilia, epithelial growth, and repair mechanisms. Although no network selectively identified SA, genes in modules linked to epithelial growth and repair and neuronal function were markedly decreased in SA. Several hub genes of the epithelial growth and repair module were found located at the 17q12-21 locus, near a well-known asthma susceptibility locus. T2 genes increased with severity in those treated with corticosteroids but were also elevated in untreated, mild-to-moderate disease compared with healthy control subjects. T1 inflammation, especially when associated with increased T2 gene expression, was elevated in a subgroup of younger patients with SA. In this hypothesis-generating analysis, gene expression networks in relation to asthma severity provided potentially new insight into biological mechanisms associated with the development of SA and its phenotypes.

Gene Expression Correlated with Severe Asthma Characteristics Reveals Heterogeneous Mechanisms of Severe Disease

PubMed Central

Modena, Brian D.; Bleecker, Eugene R.; Busse, William W.; Erzurum, Serpil C.; Gaston, Benjamin M.; Jarjour, Nizar N.; Meyers, Deborah A.; Milosevic, Jadranka; Tedrow, John R.; Wu, Wei; Kaminski, Naftali

2017-01-01

Rationale: Severe asthma (SA) is a heterogeneous disease with multiple molecular mechanisms. Gene expression studies of bronchial epithelial cells in individuals with asthma have provided biological insight and underscored possible mechanistic differences between individuals. Objectives: Identify networks of genes reflective of underlying biological processes that define SA. Methods: Airway epithelial cell gene expression from 155 subjects with asthma and healthy control subjects in the Severe Asthma Research Program was analyzed by weighted gene coexpression network analysis to identify gene networks and profiles associated with SA and its specific characteristics (i.e., pulmonary function tests, quality of life scores, urgent healthcare use, and steroid use), which potentially identified underlying biological processes. A linear model analysis confirmed these findings while adjusting for potential confounders. Measurements and Main Results: Weighted gene coexpression network analysis constructed 64 gene network modules, including modules corresponding to T1 and T2 inflammation, neuronal function, cilia, epithelial growth, and repair mechanisms. Although no network selectively identified SA, genes in modules linked to epithelial growth and repair and neuronal function were markedly decreased in SA. Several hub genes of the epithelial growth and repair module were found located at the 17q12–21 locus, near a well-known asthma susceptibility locus. T2 genes increased with severity in those treated with corticosteroids but were also elevated in untreated, mild-to-moderate disease compared with healthy control subjects. T1 inflammation, especially when associated with increased T2 gene expression, was elevated in a subgroup of younger patients with SA. Conclusions: In this hypothesis-generating analysis, gene expression networks in relation to asthma severity provided potentially new insight into biological mechanisms associated with the development of SA and its phenotypes. PMID:27984699

Extracting grid cell characteristics from place cell inputs using non-negative principal component analysis

PubMed Central

Dordek, Yedidyah; Soudry, Daniel; Meir, Ron; Derdikman, Dori

2016-01-01

Many recent models study the downstream projection from grid cells to place cells, while recent data have pointed out the importance of the feedback projection. We thus asked how grid cells are affected by the nature of the input from the place cells. We propose a single-layer neural network with feedforward weights connecting place-like input cells to grid cell outputs. Place-to-grid weights are learned via a generalized Hebbian rule. The architecture of this network highly resembles neural networks used to perform Principal Component Analysis (PCA). Both numerical results and analytic considerations indicate that if the components of the feedforward neural network are non-negative, the output converges to a hexagonal lattice. Without the non-negativity constraint, the output converges to a square lattice. Consistent with experiments, grid spacing ratio between the first two consecutive modules is −1.4. Our results express a possible linkage between place cell to grid cell interactions and PCA. DOI: http://dx.doi.org/10.7554/eLife.10094.001 PMID:26952211

Fault Analysis of Space Station DC Power Systems-Using Neural Network Adaptive Wavelets to Detect Faults

NASA Technical Reports Server (NTRS)

Momoh, James A.; Wang, Yanchun; Dolce, James L.

1997-01-01

This paper describes the application of neural network adaptive wavelets for fault diagnosis of space station power system. The method combines wavelet transform with neural network by incorporating daughter wavelets into weights. Therefore, the wavelet transform and neural network training procedure become one stage, which avoids the complex computation of wavelet parameters and makes the procedure more straightforward. The simulation results show that the proposed method is very efficient for the identification of fault locations.

Estimating the Importance of Terrorists in a Terror Network

NASA Astrophysics Data System (ADS)

Elhajj, Ahmed; Elsheikh, Abdallah; Addam, Omar; Alzohbi, Mohamad; Zarour, Omar; Aksaç, Alper; Öztürk, Orkun; Özyer, Tansel; Ridley, Mick; Alhajj, Reda

While criminals may start their activities at individual level, the same is in general not true for terrorists who are mostly organized in well established networks. The effectiveness of a terror network could be realized by watching many factors, including the volume of activities accomplished by its members, the capabilities of its members to hide, and the ability of the network to grow and to maintain its influence even after the loss of some members, even leaders. Social network analysis, data mining and machine learning techniques could play important role in measuring the effectiveness of a network in general and in particular a terror network in support of the work presented in this chapter. We present a framework that employs clustering, frequent pattern mining and some social network analysis measures to determine the effectiveness of a network. The clustering and frequent pattern mining techniques start with the adjacency matrix of the network. For clustering, we utilize entries in the table by considering each row as an object and each column as a feature. Thus features of a network member are his/her direct neighbors. We maintain the weight of links in case of weighted network links. For frequent pattern mining, we consider each row of the adjacency matrix as a transaction and each column as an item. Further, we map entries into a 0/1 scale such that every entry whose value is greater than zero is assigned the value one; entries keep the value zero otherwise. This way we can apply frequent pattern mining algorithms to determine the most influential members in a network as well as the effect of removing some members or even links between members of a network. We also investigate the effect of adding some links between members. The target is to study how the various members in the network change role as the network evolves. This is measured by applying some social network analysis measures on the network at each stage during the development. We report some interesting results related to two benchmark networks: the first is 9/11 and the second is Madrid bombing.

The importance of delineating networks by activity type in bottlenose dolphins (Tursiops truncatus) in Cedar Key, Florida.

PubMed

Gazda, Stefanie; Iyer, Swami; Killingback, Timothy; Connor, Richard; Brault, Solange

2015-03-01

Network analysis has proved to be a valuable tool for studying the behavioural patterns of complex social animals. Often such studies either do not distinguish between different behavioural states of the organisms or simply focus attention on a single behavioural state to the exclusion of all others. In either of these approaches it is impossible to ascertain how the behavioural patterns of individuals depend on the type of activity they are engaged in. Here we report on a network-based analysis of the behavioural associations in a population of bottlenose dolphins (Tursiops truncatus) in Cedar Key, Florida. We consider three distinct behavioural states-socializing, travelling and foraging-and analyse the association networks corresponding to each activity. Moreover, in constructing the different activity networks we do not simply record a spatial association between two individuals as being either present or absent, but rather quantify the degree of any association, thus allowing us to construct weighted networks describing each activity. The results of these weighted activity networks indicate that networks can reveal detailed patterns of bottlenose dolphins at the population level; dolphins socialize in large groups with preferential associations; travel in small groups with preferential associates; and spread out to forage in very small, weakly connected groups. There is some overlap in the socialize and travel networks but little overlap between the forage and other networks. This indicates that the social bonds maintained in other activities are less important as they forage on dispersed, solitary prey. The overall network, not sorted by activity, does not accurately represent any of these patterns.

The importance of delineating networks by activity type in bottlenose dolphins (Tursiops truncatus) in Cedar Key, Florida

PubMed Central

Gazda, Stefanie; Iyer, Swami; Killingback, Timothy; Connor, Richard; Brault, Solange

2015-01-01

Network analysis has proved to be a valuable tool for studying the behavioural patterns of complex social animals. Often such studies either do not distinguish between different behavioural states of the organisms or simply focus attention on a single behavioural state to the exclusion of all others. In either of these approaches it is impossible to ascertain how the behavioural patterns of individuals depend on the type of activity they are engaged in. Here we report on a network-based analysis of the behavioural associations in a population of bottlenose dolphins (Tursiops truncatus) in Cedar Key, Florida. We consider three distinct behavioural states—socializing, travelling and foraging—and analyse the association networks corresponding to each activity. Moreover, in constructing the different activity networks we do not simply record a spatial association between two individuals as being either present or absent, but rather quantify the degree of any association, thus allowing us to construct weighted networks describing each activity. The results of these weighted activity networks indicate that networks can reveal detailed patterns of bottlenose dolphins at the population level; dolphins socialize in large groups with preferential associations; travel in small groups with preferential associates; and spread out to forage in very small, weakly connected groups. There is some overlap in the socialize and travel networks but little overlap between the forage and other networks. This indicates that the social bonds maintained in other activities are less important as they forage on dispersed, solitary prey. The overall network, not sorted by activity, does not accurately represent any of these patterns. PMID:26064611

Statistical Approaches to Adjusting Weights for Dependent Arms in Network Meta-analysis.

PubMed

Su, Yu-Xuan; Tu, Yu-Kang

2018-05-22

Network meta-analysis compares multiple treatments in terms of their efficacy and harm by including evidence from randomized controlled trials. Most clinical trials use parallel design, where patients are randomly allocated to different treatments and receive only one treatment. However, some trials use within person designs such as split-body, split-mouth and cross-over designs, where each patient may receive more than one treatment. Data from treatment arms within these trials are no longer independent, so the correlations between dependent arms need to be accounted for within the statistical analyses. Ignoring these correlations may result in incorrect conclusions. The main objective of this study is to develop statistical approaches to adjusting weights for dependent arms within special design trials. In this study, we demonstrate the following three approaches: the data augmentation approach, the adjusting variance approach, and the reducing weight approach. These three methods could be perfectly applied in current statistic tools such as R and STATA. An example of periodontal regeneration was used to demonstrate how these approaches could be undertaken and implemented within statistical software packages, and to compare results from different approaches. The adjusting variance approach can be implemented within the network package in STATA, while reducing weight approach requires computer software programming to set up the within-study variance-covariance matrix. This article is protected by copyright. All rights reserved.

Efficient weighting strategy for enhancing synchronizability of complex networks

NASA Astrophysics Data System (ADS)

Wang, Youquan; Yu, Feng; Huang, Shucheng; Tu, Juanjuan; Chen, Yan

2018-04-01

Networks with high propensity to synchronization are desired in many applications ranging from biology to engineering. In general, there are two ways to enhance the synchronizability of a network: link rewiring and/or link weighting. In this paper, we propose a new link weighting strategy based on the concept of the neighborhood subgroup. The neighborhood subgroup of a node i through node j in a network, i.e. Gi→j, means that node u belongs to Gi→j if node u belongs to the first-order neighbors of j (not include i). Our proposed weighting schema used the local and global structural properties of the networks such as the node degree, betweenness centrality and closeness centrality measures. We applied the method on scale-free and Watts-Strogatz networks of different structural properties and show the good performance of the proposed weighting scheme. Furthermore, as model networks cannot capture all essential features of real-world complex networks, we considered a number of undirected and unweighted real-world networks. To the best of our knowledge, the proposed weighting strategy outperformed the previously published weighting methods by enhancing the synchronizability of these real-world networks.

Small Worldness in Dense and Weighted Connectomes

NASA Astrophysics Data System (ADS)

Colon-Perez, Luis; Couret, Michelle; Triplett, William; Price, Catherine; Mareci, Thomas

2016-05-01

The human brain is a heterogeneous network of connected functional regions; however, most brain network studies assume that all brain connections can be described in a framework of binary connections. The brain is a complex structure of white matter tracts connected by a wide range of tract sizes, which suggests a broad range of connection strengths. Therefore, the assumption that the connections are binary yields an incomplete picture of the brain. Various thresholding methods have been used to remove spurious connections and reduce the graph density in binary networks. But these thresholds are arbitrary and make problematic the comparison of networks created at different thresholds. The heterogeneity of connection strengths can be represented in graph theory by applying weights to the network edges. Using our recently introduced edge weight parameter, we estimated the topological brain network organization using a complimentary weighted connectivity framework to the traditional framework of a binary network. To examine the reproducibility of brain networks in a controlled condition, we studied the topological network organization of a single healthy individual by acquiring 10 repeated diffusion-weighted magnetic resonance image datasets, over a one-month period on the same scanner, and analyzing these networks with deterministic tractography. We applied a threshold to both the binary and weighted networks and determined that the extra degree of freedom that comes with the framework of weighting network connectivity provides a robust result as any threshold level. The proposed weighted connectivity framework provides a stable result and is able to demonstrate the small world property of brain networks in situations where the binary framework is inadequate and unable to demonstrate this network property.

The Core Symptoms of Bulimia Nervosa, Anxiety, and Depression: A Network Analysis

PubMed Central

Levinson, Cheri A.; Zerwas, Stephanie; Calebs, Benjamin; Forbush, Kelsie; Kordy, Hans; Watson, Hunna; Hofmeier, Sara; Levine, Michele; Crosby, Ross D.; Peat, Christine; Runfola, Cristin D.; Zimmer, Benjamin; Moesner, Markus; Marcus, Marsha D.; Bulik, Cynthia M.

2017-01-01

Bulimia nervosa (BN) is characterized by symptoms of binge eating and compensatory behavior, and overevaluation of weight and shape, which often co-occur with symptoms of anxiety and depression. However, there is little research identifying which specific BN symptoms maintain BN psychopathology and how they are associated with symptoms of depression and anxiety. Network analyses represent an emerging method in psychopathology research to examine how symptoms interact and may become self-reinforcing. In the current study of adults with a DSM-IV diagnosis of BN (N = 196), we used network analysis to identify the central symptoms of BN, as well as symptoms that may bridge the association between BN symptoms and anxiety and depression symptoms. Results showed that fear of weight gain was central to BN psychopathology, whereas binge eating, purging, and restriction were less central in the symptom network. Symptoms related to sensitivity to physical sensations (e.g., changes in appetite, feeling dizzy, wobbly) were identified as bridge symptoms between BN, and anxiety and depressive symptoms. We discuss our findings with respect to cognitive-behavioral treatment approaches for BN. These findings suggest that treatments for BN should focus on fear of weight gain, perhaps through exposure therapies. Further, interventions focusing on exposure to physical sensations may also address BN psychopathology, as well as co-occurring anxiety and depressive symptoms. PMID:28277735

Motor modules in robot-aided walking

PubMed Central

2012-01-01

Background It is hypothesized that locomotion is achieved by means of rhythm generating networks (central pattern generators) and muscle activation generating networks. This modular organization can be partly identified from the analysis of the muscular activity by means of factorization algorithms. The activity of rhythm generating networks is described by activation signals whilst the muscle intervention generating network is represented by motor modules (muscle synergies). In this study, we extend the analysis of modular organization of walking to the case of robot-aided locomotion, at varying speed and body weight support level. Methods Non Negative Matrix Factorization was applied on surface electromyographic signals of 8 lower limb muscles of healthy subjects walking in gait robotic trainer at different walking velocities (1 to 3km/h) and levels of body weight support (0 to 30%). Results The muscular activity of volunteers could be described by low dimensionality (4 modules), as for overground walking. Moreover, the activation signals during robot-aided walking were bursts of activation timed at specific phases of the gait cycle, underlying an impulsive controller, as also observed in overground walking. This modular organization was consistent across the investigated speeds, body weight support level, and subjects. Conclusions These results indicate that walking in a Lokomat robotic trainer is achieved by similar motor modules and activation signals as overground walking and thus supports the use of robotic training for re-establishing natural walking patterns. PMID:23043818

Network meta-analysis, electrical networks and graph theory.

PubMed

Rücker, Gerta

2012-12-01

Network meta-analysis is an active field of research in clinical biostatistics. It aims to combine information from all randomized comparisons among a set of treatments for a given medical condition. We show how graph-theoretical methods can be applied to network meta-analysis. A meta-analytic graph consists of vertices (treatments) and edges (randomized comparisons). We illustrate the correspondence between meta-analytic networks and electrical networks, where variance corresponds to resistance, treatment effects to voltage, and weighted treatment effects to current flows. Based thereon, we then show that graph-theoretical methods that have been routinely applied to electrical networks also work well in network meta-analysis. In more detail, the resulting consistent treatment effects induced in the edges can be estimated via the Moore-Penrose pseudoinverse of the Laplacian matrix. Moreover, the variances of the treatment effects are estimated in analogy to electrical effective resistances. It is shown that this method, being computationally simple, leads to the usual fixed effect model estimate when applied to pairwise meta-analysis and is consistent with published results when applied to network meta-analysis examples from the literature. Moreover, problems of heterogeneity and inconsistency, random effects modeling and including multi-armed trials are addressed. Copyright © 2012 John Wiley & Sons, Ltd. Copyright © 2012 John Wiley & Sons, Ltd.

Network analysis of patient flow in two UK acute care hospitals identifies key sub-networks for A&E performance

PubMed Central

Stringer, Clive; Beeknoo, Neeraj

2017-01-01

The topology of the patient flow network in a hospital is complex, comprising hundreds of overlapping patient journeys, and is a determinant of operational efficiency. To understand the network architecture of patient flow, we performed a data-driven network analysis of patient flow through two acute hospital sites of King’s College Hospital NHS Foundation Trust. Administration databases were queried for all intra-hospital patient transfers in an 18-month period and modelled as a dynamic weighted directed graph. A ‘core’ subnetwork containing only 13–17% of all edges channelled 83–90% of the patient flow, while an ‘ephemeral’ network constituted the remainder. Unsupervised cluster analysis and differential network analysis identified sub-networks where traffic is most associated with A&E performance. Increased flow to clinical decision units was associated with the best A&E performance in both sites. The component analysis also detected a weekend effect on patient transfers which was not associated with performance. We have performed the first data-driven hypothesis-free analysis of patient flow which can enhance understanding of whole healthcare systems. Such analysis can drive transformation in healthcare as it has in industries such as manufacturing. PMID:28968472

Reducing neural network training time with parallel processing

NASA Technical Reports Server (NTRS)

Rogers, James L., Jr.; Lamarsh, William J., II

1995-01-01

Obtaining optimal solutions for engineering design problems is often expensive because the process typically requires numerous iterations involving analysis and optimization programs. Previous research has shown that a near optimum solution can be obtained in less time by simulating a slow, expensive analysis with a fast, inexpensive neural network. A new approach has been developed to further reduce this time. This approach decomposes a large neural network into many smaller neural networks that can be trained in parallel. Guidelines are developed to avoid some of the pitfalls when training smaller neural networks in parallel. These guidelines allow the engineer: to determine the number of nodes on the hidden layer of the smaller neural networks; to choose the initial training weights; and to select a network configuration that will capture the interactions among the smaller neural networks. This paper presents results describing how these guidelines are developed.

Rich club network analysis shows distinct patterns of disruption in frontotemporal dementia and Alzheimer’s disease

PubMed Central

Daianu, Madelaine; Jahanshad, Neda; Villalon-Reina, Julio E.; Mendez, Mario F.; Bartzokis, George; Jimenez, Elvira E.; Joshi, Aditi; Barsuglia, Joseph; Thompson, Paul M.

2015-01-01

Diffusion imaging and brain connectivity analyses can reveal the underlying organizational patterns of the human brain, described as complex networks of densely interlinked regions. Here, we analyzed 1.5-Tesla whole-brain diffusion-weighted images from 64 participants – 15 patients with behavioral variant frontotemporal (bvFTD) dementia, 19 with early-onset Alzheimer’s disease (EOAD), and 30 healthy elderly controls. Based on whole-brain tractography, we reconstructed structural brain connectivity networks to map connections between cortical regions. We examined how bvFTD and EOAD disrupt the weighted ‘rich club’ – a network property where high-degree network nodes are more interconnected than expected by chance. bvFTD disrupts both the nodal and global organization of the network in both low- and high-degree regions of the brain. EOAD targets the global connectivity of the brain, mainly affecting the fiber density of high-degree (highly connected) regions that form the rich club network. These rich club analyses suggest distinct patterns of disruptions among different forms of dementia. PMID:26161050

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

NASA Astrophysics Data System (ADS)

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.

Operational parameters of an opto-electronic neural network employing fixed planar holographic interconnects

NASA Astrophysics Data System (ADS)

Keller, P. E.; Gmitro, A. F.

1993-07-01

A prototype neutral network system of multifaceted, planar interconnection holograms and opto-electronic neurons is analyzed. This analysis shows that a hologram fabricated with electron-beam lithography has the capacity to connect 6700 neuron outputs to 6700 neuron inputs, and that, the encoded synaptic weights have a precision of approximately 5 bits. Higher interconnection densities can be achieved by accepting a lower synaptic weight accuracy. For systems employing laser diodes at the outputs of the neurons, processing rates in the range of 45 to 720 trillion connections per second can potentially be achieved.

Average Weighted Receiving Time of Weighted Tetrahedron Koch Networks

NASA Astrophysics Data System (ADS)

Dai, Meifeng; Zhang, Danping; Ye, Dandan; Zhang, Cheng; Li, Lei

2015-07-01

We introduce weighted tetrahedron Koch networks with infinite weight factors, which are generalization of finite ones. The term of weighted time is firstly defined in this literature. The mean weighted first-passing time (MWFPT) and the average weighted receiving time (AWRT) are defined by weighted time accordingly. We study the AWRT with weight-dependent walk. Results show that the AWRT for a nontrivial weight factor sequence grows sublinearly with the network order. To investigate the reason of sublinearity, the average receiving time (ART) for four cases are discussed.

Method and system for pattern analysis using a coarse-coded neural network

NASA Technical Reports Server (NTRS)

Spirkovska, Liljana (Inventor); Reid, Max B. (Inventor)

1994-01-01

A method and system for performing pattern analysis with a neural network coarse-coding a pattern to be analyzed so as to form a plurality of sub-patterns collectively defined by data. Each of the sub-patterns comprises sets of pattern data. The neural network includes a plurality fields, each field being associated with one of the sub-patterns so as to receive the sub-pattern data therefrom. Training and testing by the neural network then proceeds in the usual way, with one modification: the transfer function thresholds the value obtained from summing the weighted products of each field over all sub-patterns associated with each pattern being analyzed by the system.

Unified functional network and nonlinear time series analysis for complex systems science: The pyunicorn package

NASA Astrophysics Data System (ADS)

Donges, Jonathan; Heitzig, Jobst; Beronov, Boyan; Wiedermann, Marc; Runge, Jakob; Feng, Qing Yi; Tupikina, Liubov; Stolbova, Veronika; Donner, Reik; Marwan, Norbert; Dijkstra, Henk; Kurths, Jürgen

2016-04-01

We introduce the pyunicorn (Pythonic unified complex network and recurrence analysis toolbox) open source software package for applying and combining modern methods of data analysis and modeling from complex network theory and nonlinear time series analysis. pyunicorn is a fully object-oriented and easily parallelizable package written in the language Python. It allows for the construction of functional networks such as climate networks in climatology or functional brain networks in neuroscience representing the structure of statistical interrelationships in large data sets of time series and, subsequently, investigating this structure using advanced methods of complex network theory such as measures and models for spatial networks, networks of interacting networks, node-weighted statistics, or network surrogates. Additionally, pyunicorn provides insights into the nonlinear dynamics of complex systems as recorded in uni- and multivariate time series from a non-traditional perspective by means of recurrence quantification analysis, recurrence networks, visibility graphs, and construction of surrogate time series. The range of possible applications of the library is outlined, drawing on several examples mainly from the field of climatology. pyunicorn is available online at https://github.com/pik-copan/pyunicorn. Reference: J.F. Donges, J. Heitzig, B. Beronov, M. Wiedermann, J. Runge, Q.-Y. Feng, L. Tupikina, V. Stolbova, R.V. Donner, N. Marwan, H.A. Dijkstra, and J. Kurths, Unified functional network and nonlinear time series analysis for complex systems science: The pyunicorn package, Chaos 25, 113101 (2015), DOI: 10.1063/1.4934554, Preprint: arxiv.org:1507.01571 [physics.data-an].

Analysis of the influencing factors of global energy interconnection development

NASA Astrophysics Data System (ADS)

Zhang, Yi; He, Yongxiu; Ge, Sifan; Liu, Lin

2018-04-01

Under the background of building global energy interconnection and achieving green and low-carbon development, this paper grasps a new round of energy restructuring and the trend of energy technology change, based on the present situation of global and China's global energy interconnection development, established the index system of the impact of global energy interconnection development factors. A subjective and objective weight analysis of the factors affecting the development of the global energy interconnection was conducted separately by network level analysis and entropy method, and the weights are summed up by the method of additive integration, which gives the comprehensive weight of the influencing factors and the ranking of their influence.

Fractal and multifractal analyses of bipartite networks

NASA Astrophysics Data System (ADS)

Liu, Jin-Long; Wang, Jian; Yu, Zu-Guo; Xie, Xian-Hua

2017-03-01

Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these properties of bipartite networks. In this paper, we try to unfold the self-similarity structure of bipartite networks by performing the fractal and multifractal analyses for a variety of real-world bipartite network data sets and models. First, we find the fractality in some bipartite networks, including the CiteULike, Netflix, MovieLens (ml-20m), Delicious data sets and (u, v)-flower model. Meanwhile, we observe the shifted power-law or exponential behavior in other several networks. We then focus on the multifractal properties of bipartite networks. Our results indicate that the multifractality exists in those bipartite networks possessing fractality. To capture the inherent attribute of bipartite network with two types different nodes, we give the different weights for the nodes of different classes, and show the existence of multifractality in these node-weighted bipartite networks. In addition, for the data sets with ratings, we modify the two existing algorithms for fractal and multifractal analyses of edge-weighted unipartite networks to study the self-similarity of the corresponding edge-weighted bipartite networks. The results show that our modified algorithms are feasible and can effectively uncover the self-similarity structure of these edge-weighted bipartite networks and their corresponding node-weighted versions.

Fractal and multifractal analyses of bipartite networks.

PubMed

Liu, Jin-Long; Wang, Jian; Yu, Zu-Guo; Xie, Xian-Hua

2017-03-31

Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these properties of bipartite networks. In this paper, we try to unfold the self-similarity structure of bipartite networks by performing the fractal and multifractal analyses for a variety of real-world bipartite network data sets and models. First, we find the fractality in some bipartite networks, including the CiteULike, Netflix, MovieLens (ml-20m), Delicious data sets and (u, v)-flower model. Meanwhile, we observe the shifted power-law or exponential behavior in other several networks. We then focus on the multifractal properties of bipartite networks. Our results indicate that the multifractality exists in those bipartite networks possessing fractality. To capture the inherent attribute of bipartite network with two types different nodes, we give the different weights for the nodes of different classes, and show the existence of multifractality in these node-weighted bipartite networks. In addition, for the data sets with ratings, we modify the two existing algorithms for fractal and multifractal analyses of edge-weighted unipartite networks to study the self-similarity of the corresponding edge-weighted bipartite networks. The results show that our modified algorithms are feasible and can effectively uncover the self-similarity structure of these edge-weighted bipartite networks and their corresponding node-weighted versions.

Fractal and multifractal analyses of bipartite networks

PubMed Central

Liu, Jin-Long; Wang, Jian; Yu, Zu-Guo; Xie, Xian-Hua

2017-01-01

Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these properties of bipartite networks. In this paper, we try to unfold the self-similarity structure of bipartite networks by performing the fractal and multifractal analyses for a variety of real-world bipartite network data sets and models. First, we find the fractality in some bipartite networks, including the CiteULike, Netflix, MovieLens (ml-20m), Delicious data sets and (u, v)-flower model. Meanwhile, we observe the shifted power-law or exponential behavior in other several networks. We then focus on the multifractal properties of bipartite networks. Our results indicate that the multifractality exists in those bipartite networks possessing fractality. To capture the inherent attribute of bipartite network with two types different nodes, we give the different weights for the nodes of different classes, and show the existence of multifractality in these node-weighted bipartite networks. In addition, for the data sets with ratings, we modify the two existing algorithms for fractal and multifractal analyses of edge-weighted unipartite networks to study the self-similarity of the corresponding edge-weighted bipartite networks. The results show that our modified algorithms are feasible and can effectively uncover the self-similarity structure of these edge-weighted bipartite networks and their corresponding node-weighted versions. PMID:28361962

English and Chinese languages as weighted complex networks

NASA Astrophysics Data System (ADS)

Sheng, Long; Li, Chunguang

2009-06-01

In this paper, we analyze statistical properties of English and Chinese written human language within the framework of weighted complex networks. The two language networks are based on an English novel and a Chinese biography, respectively, and both of the networks are constructed in the same way. By comparing the intensity and density of connections between the two networks, we find that high weight connections in Chinese language networks prevail more than those in English language networks. Furthermore, some of the topological and weighted quantities are compared. The results display some differences in the structural organizations between the two language networks. These observations indicate that the two languages may have different linguistic mechanisms and different combinatorial natures.

A canonical correlation neural network for multicollinearity and functional data.

PubMed

Gou, Zhenkun; Fyfe, Colin

2004-03-01

We review a recent neural implementation of Canonical Correlation Analysis and show, using ideas suggested by Ridge Regression, how to make the algorithm robust. The network is shown to operate on data sets which exhibit multicollinearity. We develop a second model which not only performs as well on multicollinear data but also on general data sets. This model allows us to vary a single parameter so that the network is capable of performing Partial Least Squares regression (at one extreme) to Canonical Correlation Analysis (at the other)and every intermediate operation between the two. On multicollinear data, the parameter setting is shown to be important but on more general data no particular parameter setting is required. Finally, we develop a second penalty term which acts on such data as a smoother in that the resulting weight vectors are much smoother and more interpretable than the weights without the robustification term. We illustrate our algorithms on both artificial and real data.

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Jianbao; Ma, Zhongjun, E-mail: mzj1234402@163.com; Chen, Guanrong

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding ormore » deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.« less

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

NASA Astrophysics Data System (ADS)

Zhang, Jianbao; Ma, Zhongjun; Chen, Guanrong

2014-06-01

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding or deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.

A New Stochastic Technique for Painlevé Equation-I Using Neural Network Optimized with Swarm Intelligence

PubMed Central

Raja, Muhammad Asif Zahoor; Khan, Junaid Ali; Ahmad, Siraj-ul-Islam; Qureshi, Ijaz Mansoor

2012-01-01

A methodology for solution of Painlevé equation-I is presented using computational intelligence technique based on neural networks and particle swarm optimization hybridized with active set algorithm. The mathematical model of the equation is developed with the help of linear combination of feed-forward artificial neural networks that define the unsupervised error of the model. This error is minimized subject to the availability of appropriate weights of the networks. The learning of the weights is carried out using particle swarm optimization algorithm used as a tool for viable global search method, hybridized with active set algorithm for rapid local convergence. The accuracy, convergence rate, and computational complexity of the scheme are analyzed based on large number of independents runs and their comprehensive statistical analysis. The comparative studies of the results obtained are made with MATHEMATICA solutions, as well as, with variational iteration method and homotopy perturbation method. PMID:22919371

Entropy-based link prediction in weighted networks

NASA Astrophysics Data System (ADS)

Xu, Zhongqi; Pu, Cunlai; Ramiz Sharafat, Rajput; Li, Lunbo; Yang, Jian

2017-01-01

Information entropy has been proved to be an effective tool to quantify the structural importance of complex networks. In the previous work (Xu et al, 2016 \\cite{xu2016}), we measure the contribution of a path in link prediction with information entropy. In this paper, we further quantify the contribution of a path with both path entropy and path weight, and propose a weighted prediction index based on the contributions of paths, namely Weighted Path Entropy (WPE), to improve the prediction accuracy in weighted networks. Empirical experiments on six weighted real-world networks show that WPE achieves higher prediction accuracy than three typical weighted indices.

Identification of Gene Networks for Residual Feed Intake in Angus Cattle Using Genomic Prediction and RNA-seq.

PubMed

Weber, Kristina L; Welly, Bryan T; Van Eenennaam, Alison L; Young, Amy E; Porto-Neto, Laercio R; Reverter, Antonio; Rincon, Gonzalo

2016-01-01

Improvement in feed conversion efficiency can improve the sustainability of beef cattle production, but genomic selection for feed efficiency affects many underlying molecular networks and physiological traits. This study describes the differences between steer progeny of two influential Angus bulls with divergent genomic predictions for residual feed intake (RFI). Eight steer progeny of each sire were phenotyped for growth and feed intake from 8 mo. of age (average BW 254 kg, with a mean difference between sire groups of 4.8 kg) until slaughter at 14-16 mo. of age (average BW 534 kg, sire group difference of 28.8 kg). Terminal samples from pituitary gland, skeletal muscle, liver, adipose, and duodenum were collected from each steer for transcriptome sequencing. Gene expression networks were derived using partial correlation and information theory (PCIT), including differentially expressed (DE) genes, tissue specific (TS) genes, transcription factors (TF), and genes associated with RFI from a genome-wide association study (GWAS). Relative to progeny of the high RFI sire, progeny of the low RFI sire had -0.56 kg/d finishing period RFI (P = 0.05), -1.08 finishing period feed conversion ratio (P = 0.01), +3.3 kg^0.75 finishing period metabolic mid-weight (MMW; P = 0.04), +28.8 kg final body weight (P = 0.01), -12.9 feed bunk visits per day (P = 0.02) with +0.60 min/visit duration (P = 0.01), and +0.0045 carcass specific gravity (weight in air/weight in air-weight in water, a predictor of carcass fat content; P = 0.03). RNA-seq identified 633 DE genes between sire groups among 17,016 expressed genes. PCIT analysis identified >115,000 significant co-expression correlations between genes and 25 TF hubs, i.e. controllers of clusters of DE, TS, and GWAS SNP genes. Pathway analysis suggests low RFI bull progeny possess heightened gut inflammation and reduced fat deposition. This multi-omics analysis shows how differences in RFI genomic breeding values can impact other traits and gene co-expression networks.

Heterogeneity of link weight and the evolution of cooperation

NASA Astrophysics Data System (ADS)

Iwata, Manabu; Akiyama, Eizo

2016-04-01

In this paper, we investigate the effect of heterogeneity of link weight, heterogeneity of the frequency or amount of interactions among individuals, on the evolution of cooperation. Based on an analysis of the evolutionary prisoner's dilemma game on a weighted one-dimensional lattice network with intra-individual heterogeneity, we confirm that moderate level of link-weight heterogeneity can facilitate cooperation. Furthermore, we identify two key mechanisms by which link-weight heterogeneity promotes the evolution of cooperation: mechanisms for spread and maintenance of cooperation. We also derive the corresponding conditions under which the mechanisms can work through evolutionary dynamics.

Quantitative learning strategies based on word networks

NASA Astrophysics Data System (ADS)

Zhao, Yue-Tian-Yi; Jia, Zi-Yang; Tang, Yong; Xiong, Jason Jie; Zhang, Yi-Cheng

2018-02-01

Learning English requires a considerable effort, but the way that vocabulary is introduced in textbooks is not optimized for learning efficiency. With the increasing population of English learners, learning process optimization will have significant impact and improvement towards English learning and teaching. The recent developments of big data analysis and complex network science provide additional opportunities to design and further investigate the strategies in English learning. In this paper, quantitative English learning strategies based on word network and word usage information are proposed. The strategies integrate the words frequency with topological structural information. By analyzing the influence of connected learned words, the learning weights for the unlearned words and dynamically updating of the network are studied and analyzed. The results suggest that quantitative strategies significantly improve learning efficiency while maintaining effectiveness. Especially, the optimized-weight-first strategy and segmented strategies outperform other strategies. The results provide opportunities for researchers and practitioners to reconsider the way of English teaching and designing vocabularies quantitatively by balancing the efficiency and learning costs based on the word network.

Studies on spatio-temporal filtering of GNSS-derived coordinates

NASA Astrophysics Data System (ADS)

Gruszczynski, Maciej; Bogusz, Janusz; Kłos, Anna; Figurski, Mariusz

2015-04-01

The information about lithospheric deformations may be obtained nowadays by analysis of velocity field derived from permanent GNSS (Global Navigation Satellite System) observations. Despite developing more and more reliable models, the permanent stations residuals must still be considered as coloured noise. Meeting the GGOS (Global Geodetic Observing System) requirements, we are obliged to investigate the correlations between residuals, which are the result of common mode error (CME). This type of error may arise from mismodelling of: satellite orbits, the Earth Orientation Parameters, satellite antenna phase centre variations or unmodelling of large scale atmospheric effects. The above described together cause correlations between stochastic parts of coordinate time series obtained at stations located of even few thousands kilometres from each other. Permanent stations that meet the aforementioned terms form the regional (EPN - EUREF Permanent Network) or local sub-networks of global (IGS - International GNSS Service) network. Other authors (Wdowinski et al., 1997; Dong et al., 2006) dealt with spatio-temporal filtering and indicated three major regional filtering approaches: the stacking, the Principal Component Analysis (PCA) based on the empirical orthogonal function and the Karhunen-Loeve expansion. The need for spatio-temporal filtering is evident today, but the question whether the size of the network affects the accuracy of station's position and its velocity still remains unanswered. With the aim to determine the network's size, for which the assumption of spatial uniform distribution of CME is retained, we used stacking approach. We analyzed time series of IGS stations with daily network solutions processed by the Military University of Technology EPN Local Analysis Centre in Bernese 5.0 software and compared it with the JPL (Jet Propulsion Laboratory) PPP (Precice Point Positioning). The method we propose is based on the division of local GNSS networks into concentric ring-shaped areas. Such an approach allows us to specify the maximum size of the network, where the evident uniform spatial response can be still noticed. In terms of reliable CMEs extraction, the local networks have to be up to 500-600 kilometres extent depending on its character (location). In this study we examined three approaches of spatio-temporal filtering based on stacking procedure. First was based on non-weighted (Wdowinski et. al., 1997) and second on weighted average formula, where the weights are formed by the RMS of individual station position in the corresponding epoch (Nikolaidis, 2002). The third stacking approach, proposed here, was previously unused. It combines the weighted stacking together with the distance between the station and network barycentre into one approach. The analysis allowed to determine the optimal size of local GNSS network and to select the appropriate stacking method for obtaining the most stable solutions for e.g. geodynamical studies. The values of L1 and L2 norms, RMS values of time series (describing stability of the time series) and Pearson correlation coefficients were calculated for the North, East and Up components from more than 200 permanent stations twice: before performing the filtration and after weighted stacking approach. We showed the improvement in the quality of time series analysis using MLE (Maximum Likelihood Estimation) to estimate noise parameters. We demonstrated that the relative RMS improvement of 10, 20 and 30% reduces the noise amplitudes of about 20, 35 and 45%, respectively, what causes the velocity uncertainty to be reduced of 0.3 mm/yr (for the assumption of 7-years of data and flicker noise). The relative decrement of spectral index kappa is 25, 35 and 45%, what means lower velocity uncertainty of even 0.2 mm/yr (when assuming 7 years of data and noise amplitude of 15 mm/yr^-kappa/4) . These results refer to the growing demands on the stability of the series due to their use to realize the kinematic reference frames and for geodynamical studies.

Weighted Networks at the Polish Market

NASA Astrophysics Data System (ADS)

Chmiel, A. M.; Sienkiewicz, J.; Suchecki, K.; Hołyst, J. A.

During the last few years various models of networks [1,2] have become a powerful tool for analysis of complex systems in such distant fields as Internet [3], biology [4], social groups [5], ecology [6] and public transport [7]. Modeling behavior of economical agents is a challenging issue that has also been studied from a network point of view. The examples of such studies are models of financial networks [8], supply chains [9, 10], production networks [11], investment networks [12] or collective bank bankrupcies [13, 14]. Relations between different companies have been already analyzed using several methods: as networks of shareholders [15], networks of correlations between stock prices [16] or networks of board directors [17]. In several cases scaling laws for network characteristics have been observed.

Epidemic spreading in weighted networks: an edge-based mean-field solution.

PubMed

Yang, Zimo; Zhou, Tao

2012-05-01

Weight distribution greatly impacts the epidemic spreading taking place on top of networks. This paper presents a study of a susceptible-infected-susceptible model on regular random networks with different kinds of weight distributions. Simulation results show that the more homogeneous weight distribution leads to higher epidemic prevalence, which, unfortunately, could not be captured by the traditional mean-field approximation. This paper gives an edge-based mean-field solution for general weight distribution, which can quantitatively reproduce the simulation results. This method could be applied to characterize the nonequilibrium steady states of dynamical processes on weighted networks.

Do weight management interventions delivered by online social networks effectively improve body weight, body composition, and chronic disease risk factors? A systematic review.

PubMed

Willis, Erik A; Szabo-Reed, Amanda N; Ptomey, Lauren T; Steger, Felicia L; Honas, Jeffery J; Washburn, Richard A; Donnelly, Joseph E

2017-02-01

Introduction Currently, no systematic review/meta-analysis has examined studies that used online social networks (OSN) as a primary intervention platform. Therefore, the purpose of this review was to evaluate the effectiveness of weight management interventions delivered through OSN. Methods PubMed, EMBASE, PsycINFO, Web of Science, and Scopus were searched (January 1990-November 2015) for studies with data on the effect of OSNs on weight loss. Only primary source articles that utilized OSN as the main platform for delivery of weight management/healthy lifestyle interventions, were published in English language peer-reviewed journals, and reported outcome data on weight were eligible for inclusion in this systematic review. Five articles were included in this review. Results One-hundred percent of the studies ( n = 5) reported a reduction in baseline weight. Three of the five studies (60%) reported significant decreases in body weight when OSN was paired with health educator support. Only one study reported a clinical significant weight loss of ≥5%. Conclusion Using OSN for weight management is in its early stages of development and, while these few studies show promise, more research is needed to acquire information about optimizing these interventions to increase their efficacy.

An information dimension of weighted complex networks

NASA Astrophysics Data System (ADS)

Wen, Tao; Jiang, Wen

2018-07-01

The fractal and self-similarity are important properties in complex networks. Information dimension is a useful dimension for complex networks to reveal these properties. In this paper, an information dimension is proposed for weighted complex networks. Based on the box-covering algorithm for weighted complex networks (BCANw), the proposed method can deal with the weighted complex networks which appear frequently in the real-world, and it can get the influence of the number of nodes in each box on the information dimension. To show the wide scope of information dimension, some applications are illustrated, indicating that the proposed method is effective and feasible.

Multi-omic network-based interrogation of rat liver metabolism following gastric bypass surgery featuring SWATH proteomics.

PubMed

Sridharan, Gautham Vivek; D'Alessandro, Matthew; Bale, Shyam Sundhar; Bhagat, Vicky; Gagnon, Hugo; Asara, John M; Uygun, Korkut; Yarmush, Martin L; Saeidi, Nima

2017-09-01

Morbidly obese patients often elect for Roux-en-Y gastric bypass (RYGB), a form of bariatric surgery that triggers a remarkable 30% reduction in excess body weight and reversal of insulin resistance for those who are type II diabetic. A more complete understanding of the underlying molecular mechanisms that drive the complex metabolic reprogramming post-RYGB could lead to innovative non-invasive therapeutics that mimic the beneficial effects of the surgery, namely weight loss, achievement of glycemic control, or reversal of non-alcoholic steatohepatitis (NASH). To facilitate these discoveries, we hereby demonstrate the first multi-omic interrogation of a rodent RYGB model to reveal tissue-specific pathway modules implicated in the control of body weight regulation and energy homeostasis. In this study, we focus on and evaluate liver metabolism three months following RYGB in rats using both SWATH proteomics, a burgeoning label free approach using high resolution mass spectrometry to quantify protein levels in biological samples, as well as MRM metabolomics. The SWATH analysis enabled the quantification of 1378 proteins in liver tissue extracts, of which we report the significant down-regulation of Thrsp and Acot13 in RYGB as putative targets of lipid metabolism for weight loss. Furthermore, we develop a computational graph-based metabolic network module detection algorithm for the discovery of non-canonical pathways, or sub-networks, enriched with significantly elevated or depleted metabolites and proteins in RYGB-treated rat livers. The analysis revealed a network connection between the depleted protein Baat and the depleted metabolite taurine, corroborating the clinical observation that taurine-conjugated bile acid levels are perturbed post-RYGB.

Signed weighted gene co-expression network analysis of transcriptional regulation in murine embryonic stem cells

PubMed Central

Mason, Mike J; Fan, Guoping; Plath, Kathrin; Zhou, Qing; Horvath, Steve

2009-01-01

Background Recent work has revealed that a core group of transcription factors (TFs) regulates the key characteristics of embryonic stem (ES) cells: pluripotency and self-renewal. Current efforts focus on identifying genes that play important roles in maintaining pluripotency and self-renewal in ES cells and aim to understand the interactions among these genes. To that end, we investigated the use of unsigned and signed network analysis to identify pluripotency and differentiation related genes. Results We show that signed networks provide a better systems level understanding of the regulatory mechanisms of ES cells than unsigned networks, using two independent murine ES cell expression data sets. Specifically, using signed weighted gene co-expression network analysis (WGCNA), we found a pluripotency module and a differentiation module, which are not identified in unsigned networks. We confirmed the importance of these modules by incorporating genome-wide TF binding data for key ES cell regulators. Interestingly, we find that the pluripotency module is enriched with genes related to DNA damage repair and mitochondrial function in addition to transcriptional regulation. Using a connectivity measure of module membership, we not only identify known regulators of ES cells but also show that Mrpl15, Msh6, Nrf1, Nup133, Ppif, Rbpj, Sh3gl2, and Zfp39, among other genes, have important roles in maintaining ES cell pluripotency and self-renewal. We also report highly significant relationships between module membership and epigenetic modifications (histone modifications and promoter CpG methylation status), which are known to play a role in controlling gene expression during ES cell self-renewal and differentiation. Conclusion Our systems biologic re-analysis of gene expression, transcription factor binding, epigenetic and gene ontology data provides a novel integrative view of ES cell biology. PMID:19619308

Statistical methods and neural network approaches for classification of data from multiple sources

NASA Technical Reports Server (NTRS)

Benediktsson, Jon Atli; Swain, Philip H.

1990-01-01

Statistical methods for classification of data from multiple data sources are investigated and compared to neural network models. A problem with using conventional multivariate statistical approaches for classification of data of multiple types is in general that a multivariate distribution cannot be assumed for the classes in the data sources. Another common problem with statistical classification methods is that the data sources are not equally reliable. This means that the data sources need to be weighted according to their reliability but most statistical classification methods do not have a mechanism for this. This research focuses on statistical methods which can overcome these problems: a method of statistical multisource analysis and consensus theory. Reliability measures for weighting the data sources in these methods are suggested and investigated. Secondly, this research focuses on neural network models. The neural networks are distribution free since no prior knowledge of the statistical distribution of the data is needed. This is an obvious advantage over most statistical classification methods. The neural networks also automatically take care of the problem involving how much weight each data source should have. On the other hand, their training process is iterative and can take a very long time. Methods to speed up the training procedure are introduced and investigated. Experimental results of classification using both neural network models and statistical methods are given, and the approaches are compared based on these results.

Semantic integration to identify overlapping functional modules in protein interaction networks

PubMed Central

Cho, Young-Rae; Hwang, Woochang; Ramanathan, Murali; Zhang, Aidong

2007-01-01

Background The systematic analysis of protein-protein interactions can enable a better understanding of cellular organization, processes and functions. Functional modules can be identified from the protein interaction networks derived from experimental data sets. However, these analyses are challenging because of the presence of unreliable interactions and the complex connectivity of the network. The integration of protein-protein interactions with the data from other sources can be leveraged for improving the effectiveness of functional module detection algorithms. Results We have developed novel metrics, called semantic similarity and semantic interactivity, which use Gene Ontology (GO) annotations to measure the reliability of protein-protein interactions. The protein interaction networks can be converted into a weighted graph representation by assigning the reliability values to each interaction as a weight. We presented a flow-based modularization algorithm to efficiently identify overlapping modules in the weighted interaction networks. The experimental results show that the semantic similarity and semantic interactivity of interacting pairs were positively correlated with functional co-occurrence. The effectiveness of the algorithm for identifying modules was evaluated using functional categories from the MIPS database. We demonstrated that our algorithm had higher accuracy compared to other competing approaches. Conclusion The integration of protein interaction networks with GO annotation data and the capability of detecting overlapping modules substantially improve the accuracy of module identification. PMID:17650343

Reinforcement learning design-based adaptive tracking control with less learning parameters for nonlinear discrete-time MIMO systems.

PubMed

Liu, Yan-Jun; Tang, Li; Tong, Shaocheng; Chen, C L Philip; Li, Dong-Juan

2015-01-01

Based on the neural network (NN) approximator, an online reinforcement learning algorithm is proposed for a class of affine multiple input and multiple output (MIMO) nonlinear discrete-time systems with unknown functions and disturbances. In the design procedure, two networks are provided where one is an action network to generate an optimal control signal and the other is a critic network to approximate the cost function. An optimal control signal and adaptation laws can be generated based on two NNs. In the previous approaches, the weights of critic and action networks are updated based on the gradient descent rule and the estimations of optimal weight vectors are directly adjusted in the design. Consequently, compared with the existing results, the main contributions of this paper are: 1) only two parameters are needed to be adjusted, and thus the number of the adaptation laws is smaller than the previous results and 2) the updating parameters do not depend on the number of the subsystems for MIMO systems and the tuning rules are replaced by adjusting the norms on optimal weight vectors in both action and critic networks. It is proven that the tracking errors, the adaptation laws, and the control inputs are uniformly bounded using Lyapunov analysis method. The simulation examples are employed to illustrate the effectiveness of the proposed algorithm.

An analysis of herding behavior in security analysts’ networks

NASA Astrophysics Data System (ADS)

Zhao, Zheng; Zhang, YongJie; Feng, Xu; Zhang, Wei

2014-11-01

In this paper, we build undirected weighted networks to study herding behavior among analysts and to analyze the characteristics and the structure of these networks. We then construct a new indicator based on the average degree of nodes and the average weighted clustering coefficient to research the various types of herding behavior. Our findings suggest that every industry has, to a certain degree, herding behavior among analysts. While there is obvious uninformed herding behavior in real estate and certain other industries, industries such as mining and nonferrous metals have informed herding behavior caused by analysts’ similar reactions to public information. Furthermore, we relate the two types of herding behavior to stock price and find that uninformed herding behavior has a positive effect on market prices, whereas informed herding behavior has a negative effect.

Identification of gene expression profiles and key genes in subchondral bone of osteoarthritis using weighted gene coexpression network analysis.

PubMed

Guo, Sheng-Min; Wang, Jian-Xiong; Li, Jin; Xu, Fang-Yuan; Wei, Quan; Wang, Hai-Ming; Huang, Hou-Qiang; Zheng, Si-Lin; Xie, Yu-Jie; Zhang, Chi

2018-06-15

Osteoarthritis (OA) significantly influences the quality life of people around the world. It is urgent to find an effective way to understand the genetic etiology of OA. We used weighted gene coexpression network analysis (WGCNA) to explore the key genes involved in the subchondral bone pathological process of OA. Fifty gene expression profiles of GSE51588 were downloaded from the Gene Expression Omnibus database. The OA-associated genes and gene ontologies were acquired from JuniorDoc. Weighted gene coexpression network analysis was used to find disease-related networks based on 21756 gene expression correlation coefficients, hub-genes with the highest connectivity in each module were selected, and the correlation between module eigengene and clinical traits was calculated. The genes in the traits-related gene coexpression modules were subject to functional annotation and pathway enrichment analysis using ClusterProfiler. A total of 73 gene modules were identified, of which, 12 modules were found with high connectivity with clinical traits. Five modules were found with enriched OA-associated genes. Moreover, 310 OA-associated genes were found, and 34 of them were among hub-genes in each module. Consequently, enrichment results indicated some key metabolic pathways, such as extracellular matrix (ECM)-receptor interaction (hsa04512), focal adhesion (hsa04510), the phosphatidylinositol 3'-kinase (PI3K)-Akt signaling pathway (PI3K-AKT) (hsa04151), transforming growth factor beta pathway, and Wnt pathway. We intended to identify some core genes, collagen (COL)6A3, COL6A1, ITGA11, BAMBI, and HCK, which could influence downstream signaling pathways once they were activated. In this study, we identified important genes within key coexpression modules, which associate with a pathological process of subchondral bone in OA. Functional analysis results could provide important information to understand the mechanism of OA. © 2018 Wiley Periodicals, Inc.

Functional network connectivity underlying food processing: disturbed salience and visual processing in overweight and obese adults.

PubMed

Kullmann, Stephanie; Pape, Anna-Antonia; Heni, Martin; Ketterer, Caroline; Schick, Fritz; Häring, Hans-Ulrich; Fritsche, Andreas; Preissl, Hubert; Veit, Ralf

2013-05-01

In order to adequately explore the neurobiological basis of eating behavior of humans and their changes with body weight, interactions between brain areas or networks need to be investigated. In the current functional magnetic resonance imaging study, we examined the modulating effects of stimulus category (food vs. nonfood), caloric content of food, and body weight on the time course and functional connectivity of 5 brain networks by means of independent component analysis in healthy lean and overweight/obese adults. These functional networks included motor sensory, default-mode, extrastriate visual, temporal visual association, and salience networks. We found an extensive modulation elicited by food stimuli in the 2 visual and salience networks, with a dissociable pattern in the time course and functional connectivity between lean and overweight/obese subjects. Specifically, only in lean subjects, the temporal visual association network was modulated by the stimulus category and the salience network by caloric content, whereas overweight and obese subjects showed a generalized augmented response in the salience network. Furthermore, overweight/obese subjects showed changes in functional connectivity in networks important for object recognition, motivational salience, and executive control. These alterations could potentially lead to top-down deficiencies driving the overconsumption of food in the obese population.

Detecting communities in large networks

NASA Astrophysics Data System (ADS)

Capocci, A.; Servedio, V. D. P.; Caldarelli, G.; Colaiori, F.

2005-07-01

We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and link orientation. Since the method detects efficiently clustered nodes in large networks even when these are not sharply partitioned, it turns to be specially suitable for the analysis of social and information networks. We test the algorithm on a large-scale data-set from a psychological experiment of word association. In this case, it proves to be successful both in clustering words, and in uncovering mental association patterns.

The International Network for Evaluating Outcomes of very low birth weight, very preterm neonates (iNeo): a protocol for collaborative comparisons of international health services for quality improvement in neonatal care

PubMed Central

2014-01-01

Background The International Network for Evaluating Outcomes in Neonates (iNeo) is a collaboration of population-based national neonatal networks including Australia and New Zealand, Canada, Israel, Japan, Spain, Sweden, Switzerland, and the UK. The aim of iNeo is to provide a platform for comparative evaluation of outcomes of very preterm and very low birth weight neonates at the national, site, and individual level to generate evidence for improvement of outcomes in these infants. Methods/design Individual-level data from each iNeo network will be used for comparative analysis of neonatal outcomes between networks. Variations in outcomes will be identified and disseminated to generate hypotheses regarding factors impacting outcome variation. Detailed information on physical and environmental factors, human and resource factors, and processes of care will be collected from network sites, and tested for association with neonatal outcomes. Subsequently, changes in identified practices that may influence the variations in outcomes will be implemented and evaluated using quality improvement methods. Discussion The evidence obtained using the iNeo platform will enable clinical teams from member networks to identify, implement, and evaluate practice and service provision changes aimed at improving the care and outcomes of very low birth weight and very preterm infants within their respective countries. The knowledge generated will be available worldwide with a likely global impact. PMID:24758585

The Weight-control Information Network (WIN) | NIH MedlinePlus the Magazine

MedlinePlus

... Javascript on. Feature: Reducing Childhood Obesity The Weight-control Information Network (WIN) Past Issues / Spring - Summer 2010 ... overweight children, here are tips from the Weight-control Information Network (WIN), an information service of the ...

Highly Conductive Ionic-Liquid Gels Prepared with Orthogonal Double Networks of a Low-Molecular-Weight Gelator and Cross-Linked Polymer.

PubMed

Kataoka, Toshikazu; Ishioka, Yumi; Mizuhata, Minoru; Minami, Hideto; Maruyama, Tatsuo

2015-10-21

We prepared a heterogeneous double-network (DN) ionogel containing a low-molecular-weight gelator network and a polymer network that can exhibit high ionic conductivity and high mechanical strength. An imidazolium-based ionic liquid was first gelated by the molecular self-assembly of a low-molecular-weight gelator (benzenetricarboxamide derivative), and methyl methacrylate was polymerized with a cross-linker to form a cross-linked poly(methyl methacrylate) (PMMA) network within the ionogel. Microscopic observation and calorimetric measurement revealed that the fibrous network of the low-molecular-weight gelator was maintained in the DN ionogel. The PMMA network strengthened the ionogel of the low-molecular-weight gelator and allowed us to handle the ionogel using tweezers. The orthogonal DNs produced ionogels with a broad range of storage elastic moduli. DN ionogels with low PMMA concentrations exhibited high ionic conductivity that was comparable to that of a neat ionic liquid. The present study demonstrates that the ionic conductivities of the DN and single-network, low-molecular-weight gelator or polymer ionogels strongly depended on their storage elastic moduli.

The core symptoms of bulimia nervosa, anxiety, and depression: A network analysis.

PubMed

Levinson, Cheri A; Zerwas, Stephanie; Calebs, Benjamin; Forbush, Kelsie; Kordy, Hans; Watson, Hunna; Hofmeier, Sara; Levine, Michele; Crosby, Ross D; Peat, Christine; Runfola, Cristin D; Zimmer, Benjamin; Moesner, Markus; Marcus, Marsha D; Bulik, Cynthia M

2017-04-01

Bulimia nervosa (BN) is characterized by symptoms of binge eating and compensatory behavior, and overevaluation of weight and shape, which often co-occur with symptoms of anxiety and depression. However, there is little research identifying which specific BN symptoms maintain BN psychopathology and how they are associated with symptoms of depression and anxiety. Network analyses represent an emerging method in psychopathology research to examine how symptoms interact and may become self-reinforcing. In the current study of adults with a Diagnostic and Statistical Manual for Mental Disorders-Fourth Edition ( DSM-IV ) diagnosis of BN (N = 196), we used network analysis to identify the central symptoms of BN, as well as symptoms that may bridge the association between BN symptoms and anxiety and depression symptoms. Results showed that fear of weight gain was central to BN psychopathology, whereas binge eating, purging, and restriction were less central in the symptom network. Symptoms related to sensitivity to physical sensations (e.g., changes in appetite, feeling dizzy, and wobbly) were identified as bridge symptoms between BN, and anxiety and depressive symptoms. We discuss our findings with respect to cognitive-behavioral treatment approaches for BN. These findings suggest that treatments for BN should focus on fear of weight gain, perhaps through exposure therapies. Further, interventions focusing on exposure to physical sensations may also address BN psychopathology, as well as co-occurring anxiety and depressive symptoms. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

The research on user behavior evaluation method for network state

NASA Astrophysics Data System (ADS)

Zhang, Chengyuan; Xu, Haishui

2017-08-01

Based on the correlation between user behavior and network running state, this paper proposes a method of user behavior evaluation based on network state. Based on the analysis and evaluation methods in other fields of study, we introduce the theory and tools of data mining. Based on the network status information provided by the trusted network view, the user behavior data and the network state data are analysed. Finally, we construct the user behavior evaluation index and weight, and on this basis, we can accurately quantify the influence degree of the specific behavior of different users on the change of network running state, so as to provide the basis for user behavior control decision.

Augmenting Microarray Data with Literature-Based Knowledge to Enhance Gene Regulatory Network Inference

PubMed Central

Kilicoglu, Halil; Shin, Dongwook; Rindflesch, Thomas C.

2014-01-01

Gene regulatory networks are a crucial aspect of systems biology in describing molecular mechanisms of the cell. Various computational models rely on random gene selection to infer such networks from microarray data. While incorporation of prior knowledge into data analysis has been deemed important, in practice, it has generally been limited to referencing genes in probe sets and using curated knowledge bases. We investigate the impact of augmenting microarray data with semantic relations automatically extracted from the literature, with the view that relations encoding gene/protein interactions eliminate the need for random selection of components in non-exhaustive approaches, producing a more accurate model of cellular behavior. A genetic algorithm is then used to optimize the strength of interactions using microarray data and an artificial neural network fitness function. The result is a directed and weighted network providing the individual contribution of each gene to its target. For testing, we used invasive ductile carcinoma of the breast to query the literature and a microarray set containing gene expression changes in these cells over several time points. Our model demonstrates significantly better fitness than the state-of-the-art model, which relies on an initial random selection of genes. Comparison to the component pathways of the KEGG Pathways in Cancer map reveals that the resulting networks contain both known and novel relationships. The p53 pathway results were manually validated in the literature. 60% of non-KEGG relationships were supported (74% for highly weighted interactions). The method was then applied to yeast data and our model again outperformed the comparison model. Our results demonstrate the advantage of combining gene interactions extracted from the literature in the form of semantic relations with microarray analysis in generating contribution-weighted gene regulatory networks. This methodology can make a significant contribution to understanding the complex interactions involved in cellular behavior and molecular physiology. PMID:24921649

Augmenting microarray data with literature-based knowledge to enhance gene regulatory network inference.

PubMed

Chen, Guocai; Cairelli, Michael J; Kilicoglu, Halil; Shin, Dongwook; Rindflesch, Thomas C

2014-06-01

Gene regulatory networks are a crucial aspect of systems biology in describing molecular mechanisms of the cell. Various computational models rely on random gene selection to infer such networks from microarray data. While incorporation of prior knowledge into data analysis has been deemed important, in practice, it has generally been limited to referencing genes in probe sets and using curated knowledge bases. We investigate the impact of augmenting microarray data with semantic relations automatically extracted from the literature, with the view that relations encoding gene/protein interactions eliminate the need for random selection of components in non-exhaustive approaches, producing a more accurate model of cellular behavior. A genetic algorithm is then used to optimize the strength of interactions using microarray data and an artificial neural network fitness function. The result is a directed and weighted network providing the individual contribution of each gene to its target. For testing, we used invasive ductile carcinoma of the breast to query the literature and a microarray set containing gene expression changes in these cells over several time points. Our model demonstrates significantly better fitness than the state-of-the-art model, which relies on an initial random selection of genes. Comparison to the component pathways of the KEGG Pathways in Cancer map reveals that the resulting networks contain both known and novel relationships. The p53 pathway results were manually validated in the literature. 60% of non-KEGG relationships were supported (74% for highly weighted interactions). The method was then applied to yeast data and our model again outperformed the comparison model. Our results demonstrate the advantage of combining gene interactions extracted from the literature in the form of semantic relations with microarray analysis in generating contribution-weighted gene regulatory networks. This methodology can make a significant contribution to understanding the complex interactions involved in cellular behavior and molecular physiology.

Efficient and accurate Greedy Search Methods for mining functional modules in protein interaction networks.

PubMed

He, Jieyue; Li, Chaojun; Ye, Baoliu; Zhong, Wei

2012-06-25

Most computational algorithms mainly focus on detecting highly connected subgraphs in PPI networks as protein complexes but ignore their inherent organization. Furthermore, many of these algorithms are computationally expensive. However, recent analysis indicates that experimentally detected protein complexes generally contain Core/attachment structures. In this paper, a Greedy Search Method based on Core-Attachment structure (GSM-CA) is proposed. The GSM-CA method detects densely connected regions in large protein-protein interaction networks based on the edge weight and two criteria for determining core nodes and attachment nodes. The GSM-CA method improves the prediction accuracy compared to other similar module detection approaches, however it is computationally expensive. Many module detection approaches are based on the traditional hierarchical methods, which is also computationally inefficient because the hierarchical tree structure produced by these approaches cannot provide adequate information to identify whether a network belongs to a module structure or not. In order to speed up the computational process, the Greedy Search Method based on Fast Clustering (GSM-FC) is proposed in this work. The edge weight based GSM-FC method uses a greedy procedure to traverse all edges just once to separate the network into the suitable set of modules. The proposed methods are applied to the protein interaction network of S. cerevisiae. Experimental results indicate that many significant functional modules are detected, most of which match the known complexes. Results also demonstrate that the GSM-FC algorithm is faster and more accurate as compared to other competing algorithms. Based on the new edge weight definition, the proposed algorithm takes advantages of the greedy search procedure to separate the network into the suitable set of modules. Experimental analysis shows that the identified modules are statistically significant. The algorithm can reduce the computational time significantly while keeping high prediction accuracy.

Statistics of Weighted Brain Networks Reveal Hierarchical Organization and Gaussian Degree Distribution

PubMed Central

Ivković, Miloš; Kuceyeski, Amy; Raj, Ashish

2012-01-01

Whole brain weighted connectivity networks were extracted from high resolution diffusion MRI data of 14 healthy volunteers. A statistically robust technique was proposed for the removal of questionable connections. Unlike most previous studies our methods are completely adapted for networks with arbitrary weights. Conventional statistics of these weighted networks were computed and found to be comparable to existing reports. After a robust fitting procedure using multiple parametric distributions it was found that the weighted node degree of our networks is best described by the normal distribution, in contrast to previous reports which have proposed heavy tailed distributions. We show that post-processing of the connectivity weights, such as thresholding, can influence the weighted degree asymptotics. The clustering coefficients were found to be distributed either as gamma or power-law distribution, depending on the formula used. We proposed a new hierarchical graph clustering approach, which revealed that the brain network is divided into a regular base-2 hierarchical tree. Connections within and across this hierarchy were found to be uncommonly ordered. The combined weight of our results supports a hierarchically ordered view of the brain, whose connections have heavy tails, but whose weighted node degrees are comparable. PMID:22761649

Statistics of weighted brain networks reveal hierarchical organization and Gaussian degree distribution.

PubMed

Ivković, Miloš; Kuceyeski, Amy; Raj, Ashish

2012-01-01

Whole brain weighted connectivity networks were extracted from high resolution diffusion MRI data of 14 healthy volunteers. A statistically robust technique was proposed for the removal of questionable connections. Unlike most previous studies our methods are completely adapted for networks with arbitrary weights. Conventional statistics of these weighted networks were computed and found to be comparable to existing reports. After a robust fitting procedure using multiple parametric distributions it was found that the weighted node degree of our networks is best described by the normal distribution, in contrast to previous reports which have proposed heavy tailed distributions. We show that post-processing of the connectivity weights, such as thresholding, can influence the weighted degree asymptotics. The clustering coefficients were found to be distributed either as gamma or power-law distribution, depending on the formula used. We proposed a new hierarchical graph clustering approach, which revealed that the brain network is divided into a regular base-2 hierarchical tree. Connections within and across this hierarchy were found to be uncommonly ordered. The combined weight of our results supports a hierarchically ordered view of the brain, whose connections have heavy tails, but whose weighted node degrees are comparable.

Abnormal functional connectivity and cortical integrity influence dominant hand motor disability in multiple sclerosis: a multimodal analysis.

PubMed

Zhong, Jidan; Nantes, Julia C; Holmes, Scott A; Gallant, Serge; Narayanan, Sridar; Koski, Lisa

2016-12-01

Functional reorganization and structural damage occur in the brains of people with multiple sclerosis (MS) throughout the disease course. However, the relationship between resting-state functional connectivity (FC) reorganization in the sensorimotor network and motor disability in MS is not well understood. This study used resting-state fMRI, T1-weighted and T2-weighted, and magnetization transfer (MT) imaging to investigate the relationship between abnormal FC in the sensorimotor network and upper limb motor disability in people with MS, as well as the impact of disease-related structural abnormalities within this network. Specifically, the differences in FC of the left hemisphere hand motor region between MS participants with preserved (n = 17) and impaired (n = 26) right hand function, compared with healthy controls (n = 20) was investigated. Differences in brain atrophy and MT ratio measured at the global and regional levels were also investigated between the three groups. Motor preserved MS participants had stronger FC in structurally intact visual information processing regions relative to motor impaired MS participants. Motor impaired MS participants showed weaker FC in the sensorimotor and somatosensory association cortices and more severe structural damage throughout the brain compared with the other groups. Logistic regression analysis showed that regional MTR predicted motor disability beyond the impact of global atrophy whereas regional grey matter volume did not. More importantly, as the first multimodal analysis combining resting-state fMRI, T1-weighted, T2-weighted and MTR images in MS, we demonstrate how a combination of structural and functional changes may contribute to motor impairment or preservation in MS. Hum Brain Mapp 37:4262-4275, 2016. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

Cross-species transcriptional network analysis reveals conservation and variation in response to metal stress in cyanobacteria

PubMed Central

2013-01-01

Background As one of the most dominant bacterial groups on Earth, cyanobacteria play a pivotal role in the global carbon cycling and the Earth atmosphere composition. Understanding their molecular responses to environmental perturbations has important scientific and environmental values. Since important biological processes or networks are often evolutionarily conserved, the cross-species transcriptional network analysis offers a useful strategy to decipher conserved and species-specific transcriptional mechanisms that cells utilize to deal with various biotic and abiotic disturbances, and it will eventually lead to a better understanding of associated adaptation and regulatory networks. Results In this study, the Weighted Gene Co-expression Network Analysis (WGCNA) approach was used to establish transcriptional networks for four important cyanobacteria species under metal stress, including iron depletion and high copper conditions. Cross-species network comparison led to discovery of several core response modules and genes possibly essential to metal stress, as well as species-specific hub genes for metal stresses in different cyanobacteria species, shedding light on survival strategies of cyanobacteria responding to different environmental perturbations. Conclusions The WGCNA analysis demonstrated that the application of cross-species transcriptional network analysis will lead to novel insights to molecular response to environmental changes which will otherwise not be achieved by analyzing data from a single species. PMID:23421563

Semi-Interpenetrating polymer network hydrogels based on aspen hemicellulose and chitosan: Effect of crosslinking sequence on hydrogel properties

Treesearch

Muzaffer Ahmet Karaaslan; Mandla A. Tshabalala; Gisela Buschle-Diller

2012-01-01

Semi-interpenetrating network hydrogel films were prepared using hemicellulose and chemically crosslinked chitosan. Hemicellulose was extracted from aspen by using a novel alkaline treatment and characterized by HPSEC, and consisted of a mixture of high and low molecular weight polymeric fractions. HPLC analysis of the acid hydrolysate of the hemicellulose showed that...

Community Landscapes: An Integrative Approach to Determine Overlapping Network Module Hierarchy, Identify Key Nodes and Predict Network Dynamics

PubMed Central

Kovács, István A.; Palotai, Robin; Szalay, Máté S.; Csermely, Peter

2010-01-01

Background Network communities help the functional organization and evolution of complex networks. However, the development of a method, which is both fast and accurate, provides modular overlaps and partitions of a heterogeneous network, has proven to be rather difficult. Methodology/Principal Findings Here we introduce the novel concept of ModuLand, an integrative method family determining overlapping network modules as hills of an influence function-based, centrality-type community landscape, and including several widely used modularization methods as special cases. As various adaptations of the method family, we developed several algorithms, which provide an efficient analysis of weighted and directed networks, and (1) determine pervasively overlapping modules with high resolution; (2) uncover a detailed hierarchical network structure allowing an efficient, zoom-in analysis of large networks; (3) allow the determination of key network nodes and (4) help to predict network dynamics. Conclusions/Significance The concept opens a wide range of possibilities to develop new approaches and applications including network routing, classification, comparison and prediction. PMID:20824084

Support Vector Machine Classification of Major Depressive Disorder Using Diffusion-Weighted Neuroimaging and Graph Theory

PubMed Central

Sacchet, Matthew D.; Prasad, Gautam; Foland-Ross, Lara C.; Thompson, Paul M.; Gotlib, Ian H.

2015-01-01

Recently, there has been considerable interest in understanding brain networks in major depressive disorder (MDD). Neural pathways can be tracked in the living brain using diffusion-weighted imaging (DWI); graph theory can then be used to study properties of the resulting fiber networks. To date, global abnormalities have not been reported in tractography-based graph metrics in MDD, so we used a machine learning approach based on “support vector machines” to differentiate depressed from healthy individuals based on multiple brain network properties. We also assessed how important specific graph metrics were for this differentiation. Finally, we conducted a local graph analysis to identify abnormal connectivity at specific nodes of the network. We were able to classify depression using whole-brain graph metrics. Small-worldness was the most useful graph metric for classification. The right pars orbitalis, right inferior parietal cortex, and left rostral anterior cingulate all showed abnormal network connectivity in MDD. This is the first use of structural global graph metrics to classify depressed individuals. These findings highlight the importance of future research to understand network properties in depression across imaging modalities, improve classification results, and relate network alterations to psychiatric symptoms, medication, and comorbidities. PMID:25762941

Support vector machine classification of major depressive disorder using diffusion-weighted neuroimaging and graph theory.

PubMed

Sacchet, Matthew D; Prasad, Gautam; Foland-Ross, Lara C; Thompson, Paul M; Gotlib, Ian H

2015-01-01

Recently, there has been considerable interest in understanding brain networks in major depressive disorder (MDD). Neural pathways can be tracked in the living brain using diffusion-weighted imaging (DWI); graph theory can then be used to study properties of the resulting fiber networks. To date, global abnormalities have not been reported in tractography-based graph metrics in MDD, so we used a machine learning approach based on "support vector machines" to differentiate depressed from healthy individuals based on multiple brain network properties. We also assessed how important specific graph metrics were for this differentiation. Finally, we conducted a local graph analysis to identify abnormal connectivity at specific nodes of the network. We were able to classify depression using whole-brain graph metrics. Small-worldness was the most useful graph metric for classification. The right pars orbitalis, right inferior parietal cortex, and left rostral anterior cingulate all showed abnormal network connectivity in MDD. This is the first use of structural global graph metrics to classify depressed individuals. These findings highlight the importance of future research to understand network properties in depression across imaging modalities, improve classification results, and relate network alterations to psychiatric symptoms, medication, and comorbidities.

Reducing weight precision of convolutional neural networks towards large-scale on-chip image recognition

NASA Astrophysics Data System (ADS)

Ji, Zhengping; Ovsiannikov, Ilia; Wang, Yibing; Shi, Lilong; Zhang, Qiang

2015-05-01

In this paper, we develop a server-client quantization scheme to reduce bit resolution of deep learning architecture, i.e., Convolutional Neural Networks, for image recognition tasks. Low bit resolution is an important factor in bringing the deep learning neural network into hardware implementation, which directly determines the cost and power consumption. We aim to reduce the bit resolution of the network without sacrificing its performance. To this end, we design a new quantization algorithm called supervised iterative quantization to reduce the bit resolution of learned network weights. In the training stage, the supervised iterative quantization is conducted via two steps on server - apply k-means based adaptive quantization on learned network weights and retrain the network based on quantized weights. These two steps are alternated until the convergence criterion is met. In this testing stage, the network configuration and low-bit weights are loaded to the client hardware device to recognize coming input in real time, where optimized but expensive quantization becomes infeasible. Considering this, we adopt a uniform quantization for the inputs and internal network responses (called feature maps) to maintain low on-chip expenses. The Convolutional Neural Network with reduced weight and input/response precision is demonstrated in recognizing two types of images: one is hand-written digit images and the other is real-life images in office scenarios. Both results show that the new network is able to achieve the performance of the neural network with full bit resolution, even though in the new network the bit resolution of both weight and input are significantly reduced, e.g., from 64 bits to 4-5 bits.

The role of social networks in the development of overweight and obesity among adults: a scoping review.

PubMed

Powell, Katie; Wilcox, John; Clonan, Angie; Bissell, Paul; Preston, Louise; Peacock, Marian; Holdsworth, Michelle

2015-09-30

Although it is increasingly acknowledged that social networks are important to our understanding ofoverweight and obesity, there is limited understanding about the processes by which such networks shapetheir progression. This paper reports the findings of a scoping review of the literature that sought to identify the key processes through which social networks are understood to influence the development of overweight and obesity. A scoping review was conducted. Forty five papers were included in the final review, the findings of which were synthesised to provide an overview of the main processes through which networks have been understood to influence the development of overweight and obesity. Included papers addressed a wide range of research questions framed around six types of networks: a paired network (one's spouse or intimate partner); friends and family (including work colleagues and people within social clubs); ephemeral networks in shared public spaces (such as fellow shoppers in a supermarket or diners in a restaurant); people living within the same geographical region; peers (including co-workers, fellow students, fellow participants in a weight loss programme); and cultural groups (often related toethnicity). As individuals are embedded in many of these different types of social networks at any one time, the pathways of influence from social networks to the development of patterns of overweight and obesity are likely to be complex and interrelated. Included papers addressed a diverse set of issues: body weight trends over time; body size norms or preferences; weight loss and management; physical activity patterns; and dietary patterns. Three inter-related processes were identified: social contagion (whereby the network in which people are embedded influences their weight or weight influencing behaviours), social capital (whereby sense of belonging and social support influence weight or weight influencing behaviours), and social selection (whereby a person's network might develop according to his or her weight). The findings have important implications for understanding about methods to target the spread of obesity, indicating that much greater attention needs to be paid to the social context in which people make decisions about their weight and weight influencing behaviours.

LWT Based Sensor Node Signal Processing in Vehicle Surveillance Distributed Sensor Network

NASA Astrophysics Data System (ADS)

Cha, Daehyun; Hwang, Chansik

Previous vehicle surveillance researches on distributed sensor network focused on overcoming power limitation and communication bandwidth constraints in sensor node. In spite of this constraints, vehicle surveillance sensor node must have signal compression, feature extraction, target localization, noise cancellation and collaborative signal processing with low computation and communication energy dissipation. In this paper, we introduce an algorithm for light-weight wireless sensor node signal processing based on lifting scheme wavelet analysis feature extraction in distributed sensor network.

Non-criticality of interaction network over system's crises: A percolation analysis.

PubMed

Shirazi, Amir Hossein; Saberi, Abbas Ali; Hosseiny, Ali; Amirzadeh, Ehsan; Toranj Simin, Pourya

2017-11-20

Extraction of interaction networks from multi-variate time-series is one of the topics of broad interest in complex systems. Although this method has a wide range of applications, most of the previous analyses have focused on the pairwise relations. Here we establish the potential of such a method to elicit aggregated behavior of the system by making a connection with the concepts from percolation theory. We study the dynamical interaction networks of a financial market extracted from the correlation network of indices, and build a weighted network. In correspondence with the percolation model, we find that away from financial crises the interaction network behaves like a critical random network of Erdős-Rényi, while close to a financial crisis, our model deviates from the critical random network and behaves differently at different size scales. We perform further analysis to clarify that our observation is not a simple consequence of the growth in correlations over the crises.

Emergence of bursts and communities in evolving weighted networks.

PubMed

Jo, Hang-Hyun; Pan, Raj Kumar; Kaski, Kimmo

2011-01-01

Understanding the patterns of human dynamics and social interaction and the way they lead to the formation of an organized and functional society are important issues especially for techno-social development. Addressing these issues of social networks has recently become possible through large scale data analysis of mobile phone call records, which has revealed the existence of modular or community structure with many links between nodes of the same community and relatively few links between nodes of different communities. The weights of links, e.g., the number of calls between two users, and the network topology are found correlated such that intra-community links are stronger compared to the weak inter-community links. This feature is known as Granovetter's "The strength of weak ties" hypothesis. In addition to this inhomogeneous community structure, the temporal patterns of human dynamics turn out to be inhomogeneous or bursty, characterized by the heavy tailed distribution of time interval between two consecutive events, i.e., inter-event time. In this paper, we study how the community structure and the bursty dynamics emerge together in a simple evolving weighted network model. The principal mechanisms behind these patterns are social interaction by cyclic closure, i.e., links to friends of friends and the focal closure, links to individuals sharing similar attributes or interests, and human dynamics by task handling process. These three mechanisms have been implemented as a network model with local attachment, global attachment, and priority-based queuing processes. By comprehensive numerical simulations we show that the interplay of these mechanisms leads to the emergence of heavy tailed inter-event time distribution and the evolution of Granovetter-type community structure. Moreover, the numerical results are found to be in qualitative agreement with empirical analysis results from mobile phone call dataset.

Comparative empirical analysis of flow-weighted transit route networks in R-space and evolution modeling

NASA Astrophysics Data System (ADS)

Huang, Ailing; Zang, Guangzhi; He, Zhengbing; Guan, Wei

2017-05-01

Urban public transit system is a typical mixed complex network with dynamic flow, and its evolution should be a process coupling topological structure with flow dynamics, which has received little attention. This paper presents the R-space to make a comparative empirical analysis on Beijing’s flow-weighted transit route network (TRN) and we found that both the Beijing’s TRNs in the year of 2011 and 2015 exhibit the scale-free properties. As such, we propose an evolution model driven by flow to simulate the development of TRNs with consideration of the passengers’ dynamical behaviors triggered by topological change. The model simulates that the evolution of TRN is an iterative process. At each time step, a certain number of new routes are generated driven by travel demands, which leads to dynamical evolution of new routes’ flow and triggers perturbation in nearby routes that will further impact the next round of opening new routes. We present the theoretical analysis based on the mean-field theory, as well as the numerical simulation for this model. The results obtained agree well with our empirical analysis results, which indicate that our model can simulate the TRN evolution with scale-free properties for distributions of node’s strength and degree. The purpose of this paper is to illustrate the global evolutional mechanism of transit network that will be used to exploit planning and design strategies for real TRNs.

A Regularizer Approach for RBF Networks Under the Concurrent Weight Failure Situation.

PubMed

Leung, Chi-Sing; Wan, Wai Yan; Feng, Ruibin

2017-06-01

Many existing results on fault-tolerant algorithms focus on the single fault source situation, where a trained network is affected by one kind of weight failure. In fact, a trained network may be affected by multiple kinds of weight failure. This paper first studies how the open weight fault and the multiplicative weight noise degrade the performance of radial basis function (RBF) networks. Afterward, we define the objective function for training fault-tolerant RBF networks. Based on the objective function, we then develop two learning algorithms, one batch mode and one online mode. Besides, the convergent conditions of our online algorithm are investigated. Finally, we develop a formula to estimate the test set error of faulty networks trained from our approach. This formula helps us to optimize some tuning parameters, such as RBF width.

Community structure from spectral properties in complex networks

NASA Astrophysics Data System (ADS)

Servedio, V. D. P.; Colaiori, F.; Capocci, A.; Caldarelli, G.

2005-06-01

We analyze the spectral properties of complex networks focusing on their relation to the community structure, and develop an algorithm based on correlations among components of different eigenvectors. The algorithm applies to general weighted networks, and, in a suitably modified version, to the case of directed networks. Our method allows to correctly detect communities in sharply partitioned graphs, however it is useful to the analysis of more complex networks, without a well defined cluster structure, as social and information networks. As an example, we test the algorithm on a large scale data-set from a psychological experiment of free word association, where it proves to be successful both in clustering words, and in uncovering mental association patterns.

Interplay of network dynamics and heterogeneity of ties on spreading dynamics.

PubMed

Ferreri, Luca; Bajardi, Paolo; Giacobini, Mario; Perazzo, Silvia; Venturino, Ezio

2014-07-01

The structure of a network dramatically affects the spreading phenomena unfolding upon it. The contact distribution of the nodes has long been recognized as the key ingredient in influencing the outbreak events. However, limited knowledge is currently available on the role of the weight of the edges on the persistence of a pathogen. At the same time, recent works showed a strong influence of temporal network dynamics on disease spreading. In this work we provide an analytical understanding, corroborated by numerical simulations, about the conditions for infected stable state in weighted networks. In particular, we reveal the role of heterogeneity of edge weights and of the dynamic assignment of weights on the ties in the network in driving the spread of the epidemic. In this context we show that when weights are dynamically assigned to ties in the network, a heterogeneous distribution is able to hamper the diffusion of the disease, contrary to what happens when weights are fixed in time.

Dynamic quality of service differentiation using fixed code weight in optical CDMA networks

NASA Astrophysics Data System (ADS)

Kakaee, Majid H.; Essa, Shawnim I.; Abd, Thanaa H.; Seyedzadeh, Saleh

2015-11-01

The emergence of network-driven applications, such as internet, video conferencing, and online gaming, brings in the need for a network the environments with capability of providing diverse Quality of Services (QoS). In this paper, a new code family of novel spreading sequences, called a Multi-Service (MS) code, has been constructed to support multiple services in Optical- Code Division Multiple Access (CDMA) system. The proposed method uses fixed weight for all services, however reducing the interfering codewords for the users requiring higher QoS. The performance of the proposed code is demonstrated using mathematical analysis. It shown that the total number of served users with satisfactory BER of 10-9 using NB=2 is 82, while they are only 36 and 10 when NB=3 and 4 respectively. The developed MS code is compared with variable-weight codes such as Variable Weight-Khazani Syed (VW-KS) and Multi-Weight-Random Diagonal (MW-RD). Different numbers of basic users (NB) are used to support triple-play services (audio, data and video) with different QoS requirements. Furthermore, reference to the BER of 10-12, 10-9, and 10-3 for video, data and audio, respectively, the system can support up to 45 total users. Hence, results show that the technique can clearly provide a relative QoS differentiation with lower value of basic users can support larger number of subscribers as well as better performance in terms of acceptable BER of 10-9 at fixed code weight.

[Exploration of common biological pathways for attention deficit hyperactivity disorder and low birth weight].

PubMed

Xiang, Bo; Yu, Minglan; Liang, Xuemei; Lei, Wei; Huang, Chaohua; Chen, Jing; He, Wenying; Zhang, Tao; Li, Tao; Liu, Kezhi

2017-12-10

To explore common biological pathways for attention deficit hyperactivity disorder (ADHD) and low birth weight (LBW). Thei-Gsea4GwasV2 software was used to analyze the result of genome-wide association analysis (GWAS) for LBW (pathways were derived from Reactome), and nominally significant (P< 0.05, FDR< 0.25) pathways were tested for replication in ADHD.Significant pathways were analyzed with DAPPLE and Reatome FI software to identify genes involved in such pathways, with each cluster enriched with the gene ontology (GO). The Centiscape2.0 software was used to calculate the degree of genetic networks and the betweenness value to explore the core node (gene). Weighed gene co-expression network analysis (WGCNA) was then used to explore the co-expression of genes in these pathways.With gene expression data derived from BrainSpan, GO enrichment was carried out for each gene module. Eleven significant biological pathways was identified in association with LBW, among which two (Selenoamino acid metabolism and Diseases associated with glycosaminoglycan metabolism) were replicated during subsequent ADHD analysis. Network analysis of 130 genes in these pathways revealed that some of the sub-networksare related with morphology of cerebellum, development of hippocampus, and plasticity of synaptic structure. Upon co-expression network analysis, 120 genes passed the quality control and were found to express in 3 gene modules. These modules are mainly related to the regulation of synaptic structure and activity regulation. ADHD and LBW share some biological regulation processes. Anomalies of such proces sesmay predispose to ADHD.

The role of simulation in the design of a neural network chip

NASA Technical Reports Server (NTRS)

Desai, Utpal; Roppel, Thaddeus A.; Padgett, Mary L.

1993-01-01

An iterative, simulation-based design procedure for a neural network chip is introduced. For this design procedure, the goal is to produce a chip layout for a neural network in which the weights are determined by transistor gate width-to-length ratios. In a given iteration, the current layout is simulated using the circuit simulator SPICE, and layout adjustments are made based on conventional gradient-decent methods. After the iteration converges, the chip is fabricated. Monte Carlo analysis is used to predict the effect of statistical fabrication process variations on the overall performance of the neural network chip.

Comparative Effectiveness of Treatments for Binge-Eating Disorder: Systematic Review and Network Meta-Analysis.

PubMed

Peat, Christine M; Berkman, Nancy D; Lohr, Kathleen N; Brownley, Kimberly A; Bann, Carla M; Cullen, Katherine; Quattlebaum, Mary J; Bulik, Cynthia M

2017-09-01

Psychological and pharmacological interventions for binge-eating disorder have previously demonstrated efficacy (compared with placebo or waitlist control); thus, we aimed to expand that literature with a review of comparative effectiveness. We searched MEDLINE,® EMBASE,® Cochrane Library, Academic OneFile, CINAHL® for binge-eating disorder treatment articles and selected studies using predetermined inclusion and exclusion criteria. Data were sufficient for network meta-analysis comparing two pharmacological interventions; psychological interventions were analysed qualitatively. In all, 28 treatment comparisons were included in this review: one pharmacological comparison (second-generation antidepressants versus lisdexamfetamine) and 26 psychological comparisons. Only three statistically significant differences emerged: lisdexamfetamine was better at increasing binge abstinence than second-generation antidepressants; therapist-led cognitive behavioural therapy was better at reducing binge-eating frequency than behavioural weight loss, but behavioural weight loss was better at reducing weight. The majority of other treatment comparisons revealed few significant differences between groups. Thus, patients and clinicians can choose from several effective treatment options. Copyright © 2017 John Wiley & Sons, Ltd and Eating Disorders Association. Copyright © 2017 John Wiley & Sons, Ltd and Eating Disorders Association.

Application of Weighted Gene Co-expression Network Analysis for Data from Paired Design.

PubMed

Li, Jianqiang; Zhou, Doudou; Qiu, Weiliang; Shi, Yuliang; Yang, Ji-Jiang; Chen, Shi; Wang, Qing; Pan, Hui

2018-01-12

Investigating how genes jointly affect complex human diseases is important, yet challenging. The network approach (e.g., weighted gene co-expression network analysis (WGCNA)) is a powerful tool. However, genomic data usually contain substantial batch effects, which could mask true genomic signals. Paired design is a powerful tool that can reduce batch effects. However, it is currently unclear how to appropriately apply WGCNA to genomic data from paired design. In this paper, we modified the current WGCNA pipeline to analyse high-throughput genomic data from paired design. We illustrated the modified WGCNA pipeline by analysing the miRNA dataset provided by Shiah et al. (2014), which contains forty oral squamous cell carcinoma (OSCC) specimens and their matched non-tumourous epithelial counterparts. OSCC is the sixth most common cancer worldwide. The modified WGCNA pipeline identified two sets of novel miRNAs associated with OSCC, in addition to the existing miRNAs reported by Shiah et al. (2014). Thus, this work will be of great interest to readers of various scientific disciplines, in particular, genetic and genomic scientists as well as medical scientists working on cancer.

A network of discrete events for the representation and analysis of diffusion dynamics.

PubMed

Pintus, Alberto M; Pazzona, Federico G; Demontis, Pierfranco; Suffritti, Giuseppe B

2015-11-14

We developed a coarse-grained description of the phenomenology of diffusive processes, in terms of a space of discrete events and its representation as a network. Once a proper classification of the discrete events underlying the diffusive process is carried out, their transition matrix is calculated on the basis of molecular dynamics data. This matrix can be represented as a directed, weighted network where nodes represent discrete events, and the weight of edges is given by the probability that one follows the other. The structure of this network reflects dynamical properties of the process of interest in such features as its modularity and the entropy rate of nodes. As an example of the applicability of this conceptual framework, we discuss here the physics of diffusion of small non-polar molecules in a microporous material, in terms of the structure of the corresponding network of events, and explain on this basis the diffusivity trends observed. A quantitative account of these trends is obtained by considering the contribution of the various events to the displacement autocorrelation function.

Empirical investigation of topological and weighted properties of a bus transport network from China

NASA Astrophysics Data System (ADS)

Shu-Min, Feng; Bao-Yu, Hu; Cen, Nie; Xiang-Hao, Shen; Yu-Sheng, Ci

2016-03-01

Many bus transport networks (BTNs) have evolved into directed networks. A new representation model for BTNs is proposed, called directed-space P. The bus transport network of Harbin (BTN-H) is described as a directed and weighted complex network by the proposed representation model and by giving each node weights. The topological and weighted properties are revealed in detail. In-degree and out-degree distributions, in-weight and out-weight distributions are presented as an exponential law, respectively. There is a strong relation between in-weight and in-degree (also between out-weight and out-degree), which can be fitted by a power function. Degree-degree and weight-weight correlations are investigated to reveal that BTN-H has a disassortative behavior as the nodes have relatively high degree (or weight). The disparity distributions of out-degree and in-degree follow an approximate power-law. Besides, the node degree shows a near linear increase with the number of routes that connect to the corresponding station. These properties revealed in this paper can help public transport planners to analyze the status quo of the BTN in nature. Project supported by the National High Technology Research and Development Program of China (Grant No. 2014AA110304).

Weighted gene co-expression network analysis reveals potential genes involved in early metamorphosis process in sea cucumber Apostichopus japonicus.

PubMed

Li, Yongxin; Kikuchi, Mani; Li, Xueyan; Gao, Qionghua; Xiong, Zijun; Ren, Yandong; Zhao, Ruoping; Mao, Bingyu; Kondo, Mariko; Irie, Naoki; Wang, Wen

2018-01-01

Sea cucumbers, one main class of Echinoderms, have a very fast and drastic metamorphosis process during their development. However, the molecular basis under this process remains largely unknown. Here we systematically examined the gene expression profiles of Japanese common sea cucumber (Apostichopus japonicus) for the first time by RNA sequencing across 16 developmental time points from fertilized egg to juvenile stage. Based on the weighted gene co-expression network analysis (WGCNA), we identified 21 modules. Among them, MEdarkmagenta was highly expressed and correlated with the early metamorphosis process from late auricularia to doliolaria larva. Furthermore, gene enrichment and differentially expressed gene analysis identified several genes in the module that may play key roles in the metamorphosis process. Our results not only provide a molecular basis for experimentally studying the development and morphological complexity of sea cucumber, but also lay a foundation for improving its emergence rate. Copyright © 2017 Elsevier Inc. All rights reserved.

A multilayer network analysis of hashtags in twitter via co-occurrence and semantic links

NASA Astrophysics Data System (ADS)

Türker, Ilker; Sulak, Eyüb Ekmel

2018-02-01

Complex network studies, as an interdisciplinary framework, span a large variety of subjects including social media. In social networks, several mechanisms generate miscellaneous structures like friendship networks, mention networks, tag networks, etc. Focusing on tag networks (namely, hashtags in twitter), we made a two-layer analysis of tag networks from a massive dataset of Twitter entries. The first layer is constructed by converting the co-occurrences of these tags in a single entry (tweet) into links, while the second layer is constructed converting the semantic relations of the tags into links. We observed that the universal properties of the real networks like small-world property, clustering and power-law distributions in various network parameters are also evident in the multilayer network of hashtags. Moreover, we outlined that co-occurrences of hashtags in tweets are mostly coupled with semantic relations, whereas a small number of semantically unrelated, therefore random links reduce node separation and network diameter in the co-occurrence network layer. Together with the degree distributions, the power-law consistencies of degree difference, edge weight and cosine similarity distributions in both layers are also appealing forms of Zipf’s law evident in nature.

Exploring activity-driven network with biased walks

NASA Astrophysics Data System (ADS)

Wang, Yan; Wu, Ding Juan; Lv, Fang; Su, Meng Long

We investigate the concurrent dynamics of biased random walks and the activity-driven network, where the preferential transition probability is in terms of the edge-weighting parameter. We also obtain the analytical expressions for stationary distribution and the coverage function in directed and undirected networks, all of which depend on the weight parameter. Appropriately adjusting this parameter, more effective search strategy can be obtained when compared with the unbiased random walk, whether in directed or undirected networks. Since network weights play a significant role in the diffusion process.

The effect of epoch length on estimated EEG functional connectivity and brain network organisation

NASA Astrophysics Data System (ADS)

Fraschini, Matteo; Demuru, Matteo; Crobe, Alessandra; Marrosu, Francesco; Stam, Cornelis J.; Hillebrand, Arjan

2016-06-01

Objective. Graph theory and network science tools have revealed fundamental mechanisms of functional brain organization in resting-state M/EEG analysis. Nevertheless, it is still not clearly understood how several methodological aspects may bias the topology of the reconstructed functional networks. In this context, the literature shows inconsistency in the chosen length of the selected epochs, impeding a meaningful comparison between results from different studies. Approach. The aim of this study was to provide a network approach insensitive to the effects that epoch length has on functional connectivity and network reconstruction. Two different measures, the phase lag index (PLI) and the amplitude envelope correlation (AEC) were applied to EEG resting-state recordings for a group of 18 healthy volunteers using non-overlapping epochs with variable length (1, 2, 4, 6, 8, 10, 12, 14 and 16 s). Weighted clustering coefficient (CCw), weighted characteristic path length (L w) and minimum spanning tree (MST) parameters were computed to evaluate the network topology. The analysis was performed on both scalp and source-space data. Main results. Results from scalp analysis show a decrease in both mean PLI and AEC values with an increase in epoch length, with a tendency to stabilize at a length of 12 s for PLI and 6 s for AEC. Moreover, CCw and L w show very similar behaviour, with metrics based on AEC more reliable in terms of stability. In general, MST parameters stabilize at short epoch lengths, particularly for MSTs based on PLI (1-6 s versus 4-8 s for AEC). At the source-level the results were even more reliable, with stability already at 1 s duration for PLI-based MSTs. Significance. The present work suggests that both PLI and AEC depend on epoch length and that this has an impact on the reconstructed network topology, particularly at the scalp-level. Source-level MST topology is less sensitive to differences in epoch length, therefore enabling the comparison of brain network topology between different studies.

Understanding characteristics in multivariate traffic flow time series from complex network structure

NASA Astrophysics Data System (ADS)

Yan, Ying; Zhang, Shen; Tang, Jinjun; Wang, Xiaofei

2017-07-01

Discovering dynamic characteristics in traffic flow is the significant step to design effective traffic managing and controlling strategy for relieving traffic congestion in urban cities. A new method based on complex network theory is proposed to study multivariate traffic flow time series. The data were collected from loop detectors on freeway during a year. In order to construct complex network from original traffic flow, a weighted Froenius norm is adopt to estimate similarity between multivariate time series, and Principal Component Analysis is implemented to determine the weights. We discuss how to select optimal critical threshold for networks at different hour in term of cumulative probability distribution of degree. Furthermore, two statistical properties of networks: normalized network structure entropy and cumulative probability of degree, are utilized to explore hourly variation in traffic flow. The results demonstrate these two statistical quantities express similar pattern to traffic flow parameters with morning and evening peak hours. Accordingly, we detect three traffic states: trough, peak and transitional hours, according to the correlation between two aforementioned properties. The classifying results of states can actually represent hourly fluctuation in traffic flow by analyzing annual average hourly values of traffic volume, occupancy and speed in corresponding hours.

Spatial analysis of bus transport networks using network theory

NASA Astrophysics Data System (ADS)

Shanmukhappa, Tanuja; Ho, Ivan Wang-Hei; Tse, Chi Kong

2018-07-01

In this paper, we analyze the bus transport network (BTN) structure considering the spatial embedding of the network for three cities, namely, Hong Kong (HK), London (LD), and Bengaluru (BL). We propose a novel approach called supernode graph structuring for modeling the bus transport network. A static demand estimation procedure is proposed to assign the node weights by considering the points of interests (POIs) and the population distribution in the city over various localized zones. In addition, the end-to-end delay is proposed as a parameter to measure the topological efficiency of the bus networks instead of the shortest distance measure used in previous works. With the aid of supernode graph representation, important network parameters are analyzed for the directed, weighted and geo-referenced bus transport networks. It is observed that the supernode concept has significant advantage in analyzing the inherent topological behavior. For instance, the scale-free and small-world behavior becomes evident with supernode representation as compared to conventional or regular graph representation for the Hong Kong network. Significant improvement in clustering, reduction in path length, and increase in centrality values are observed in all the three networks with supernode representation. The correlation between topologically central nodes and the geographically central nodes reveals the interesting fact that the proposed static demand estimation method for assigning node weights aids in better identifying the geographically significant nodes in the network. The impact of these geographically significant nodes on the local traffic behavior is demonstrated by simulation using the SUMO (Simulation of Urban Mobility) tool which is also supported by real-world empirical data, and our results indicate that the traffic speed around a particular bus stop can reach a jammed state from a free flow state due to the presence of these geographically important nodes. A comparison of the simulation and the empirical data provides useful information on how bus operators can better plan their routes and deploy stops considering the geographically significant nodes.

NAP: The Network Analysis Profiler, a web tool for easier topological analysis and comparison of medium-scale biological networks.

PubMed

Theodosiou, Theodosios; Efstathiou, Georgios; Papanikolaou, Nikolas; Kyrpides, Nikos C; Bagos, Pantelis G; Iliopoulos, Ioannis; Pavlopoulos, Georgios A

2017-07-14

Nowadays, due to the technological advances of high-throughput techniques, Systems Biology has seen a tremendous growth of data generation. With network analysis, looking at biological systems at a higher level in order to better understand a system, its topology and the relationships between its components is of a great importance. Gene expression, signal transduction, protein/chemical interactions, biomedical literature co-occurrences, are few of the examples captured in biological network representations where nodes represent certain bioentities and edges represent the connections between them. Today, many tools for network visualization and analysis are available. Nevertheless, most of them are standalone applications that often (i) burden users with computing and calculation time depending on the network's size and (ii) focus on handling, editing and exploring a network interactively. While such functionality is of great importance, limited efforts have been made towards the comparison of the topological analysis of multiple networks. Network Analysis Provider (NAP) is a comprehensive web tool to automate network profiling and intra/inter-network topology comparison. It is designed to bridge the gap between network analysis, statistics, graph theory and partially visualization in a user-friendly way. It is freely available and aims to become a very appealing tool for the broader community. It hosts a great plethora of topological analysis methods such as node and edge rankings. Few of its powerful characteristics are: its ability to enable easy profile comparisons across multiple networks, find their intersection and provide users with simplified, high quality plots of any of the offered topological characteristics against any other within the same network. It is written in R and Shiny, it is based on the igraph library and it is able to handle medium-scale weighted/unweighted, directed/undirected and bipartite graphs. NAP is available at http://bioinformatics.med.uoc.gr/NAP .

Cellular telephone-based radiation sensor and wide-area detection network

DOEpatents

Craig, William W [Pittsburg, CA; Labov, Simon E [Berkeley, CA

2006-12-12

A network of radiation detection instruments, each having a small solid state radiation sensor module integrated into a cellular phone for providing radiation detection data and analysis directly to a user. The sensor module includes a solid-state crystal bonded to an ASIC readout providing a low cost, low power, light weight compact instrument to detect and measure radiation energies in the local ambient radiation field. In particular, the photon energy, time of event, and location of the detection instrument at the time of detection is recorded for real time transmission to a central data collection/analysis system. The collected data from the entire network of radiation detection instruments are combined by intelligent correlation/analysis algorithms which map the background radiation and detect, identify and track radiation anomalies in the region.

Cellular telephone-based wide-area radiation detection network

DOEpatents

Craig, William W [Pittsburg, CA; Labov, Simon E [Berkeley, CA

2009-06-09

A network of radiation detection instruments, each having a small solid state radiation sensor module integrated into a cellular phone for providing radiation detection data and analysis directly to a user. The sensor module includes a solid-state crystal bonded to an ASIC readout providing a low cost, low power, light weight compact instrument to detect and measure radiation energies in the local ambient radiation field. In particular, the photon energy, time of event, and location of the detection instrument at the time of detection is recorded for real time transmission to a central data collection/analysis system. The collected data from the entire network of radiation detection instruments are combined by intelligent correlation/analysis algorithms which map the background radiation and detect, identify and track radiation anomalies in the region.

PAVECHECK : integrating deflection and GPR for network condition surveys.

DOT National Transportation Integrated Search

2009-01-01

The PAVECHECK data integration and analysis system was developed to merge Falling Weight : Deflectometer (FWD) and Ground Penetrating Radar (GPR) data together with digital video images of : surface conditions. In this study Global Positioning System...

Effects of measurement unobservability on neural extended Kalman filter tracking

NASA Astrophysics Data System (ADS)

Stubberud, Stephen C.; Kramer, Kathleen A.

2009-05-01

An important component of tracking fusion systems is the ability to fuse various sensors into a coherent picture of the scene. When multiple sensor systems are being used in an operational setting, the types of data vary. A significant but often overlooked concern of multiple sensors is the incorporation of measurements that are unobservable. An unobservable measurement is one that may provide information about the state, but cannot recreate a full target state. A line of bearing measurement, for example, cannot provide complete position information. Often, such measurements come from passive sensors such as a passive sonar array or an electronic surveillance measure (ESM) system. Unobservable measurements will, over time, result in the measurement uncertainty to grow without bound. While some tracking implementations have triggers to protect against the detrimental effects, many maneuver tracking algorithms avoid discussing this implementation issue. One maneuver tracking technique is the neural extended Kalman filter (NEKF). The NEKF is an adaptive estimation algorithm that estimates the target track as it trains a neural network on line to reduce the error between the a priori target motion model and the actual target dynamics. The weights of neural network are trained in a similar method to the state estimation/parameter estimation Kalman filter techniques. The NEKF has been shown to improve target tracking accuracy through maneuvers and has been use to predict target behavior using the new model that consists of the a priori model and the neural network. The key to the on-line adaptation of the NEKF is the fact that the neural network is trained using the same residuals as the Kalman filter for the tracker. The neural network weights are treated as augmented states to the target track. Through the state-coupling function, the weights are coupled to the target states. Thus, if the measurements cause the states of the target track to be unobservable, then the weights of the neural network have unobservable modes as well. In recent analysis, the NEKF was shown to have a significantly larger growth in the eigenvalues of the error covariance matrix than the standard EKF tracker when the measurements were purely bearings-only. This caused detrimental effects to the ability of the NEKF to model the target dynamics. In this work, the analysis is expanded to determine the detrimental effects of bearings-only measurements of various uncertainties on the performance of the NEKF when these unobservable measurements are interlaced with completely observable measurements. This analysis provides the ability to put implementation limitations on the NEKF when bearings-only sensors are present.

Importance of small-degree nodes in assortative networks with degree-weight correlations

NASA Astrophysics Data System (ADS)

Ma, Sijuan; Feng, Ling; Monterola, Christopher Pineda; Lai, Choy Heng

2017-10-01

It has been known that assortative network structure plays an important role in spreading dynamics for unweighted networks. Yet its influence on weighted networks is not clear, in particular when weight is strongly correlated with the degrees of the nodes as we empirically observed in Twitter. Here we use the self-consistent probability method and revised nonperturbative heterogenous mean-field theory method to investigate this influence on both susceptible-infective-recovered (SIR) and susceptible-infective-susceptible (SIS) spreading dynamics. Both our simulation and theoretical results show that while the critical threshold is not significantly influenced by the assortativity, the prevalence in the supercritical regime shows a crossover under different degree-weight correlations. In particular, unlike the case of random mixing networks, in assortative networks, the negative degree-weight correlation leads to higher prevalence in their spreading beyond the critical transmissivity than that of the positively correlated. In addition, the previously observed inhibition effect on spreading velocity by assortative structure is not apparent in negatively degree-weight correlated networks, while it is enhanced for that of the positively correlated. Detailed investigation into the degree distribution of the infected nodes reveals that small-degree nodes play essential roles in the supercritical phase of both SIR and SIS spreadings. Our results have direct implications in understanding viral information spreading over online social networks and epidemic spreading over contact networks.

Social Network Extraction and Analysis Based on Multimodal Dyadic Interaction

PubMed Central

Escalera, Sergio; Baró, Xavier; Vitrià, Jordi; Radeva, Petia; Raducanu, Bogdan

2012-01-01

Social interactions are a very important component in people’s lives. Social network analysis has become a common technique used to model and quantify the properties of social interactions. In this paper, we propose an integrated framework to explore the characteristics of a social network extracted from multimodal dyadic interactions. For our study, we used a set of videos belonging to New York Times’ Blogging Heads opinion blog. The Social Network is represented as an oriented graph, whose directed links are determined by the Influence Model. The links’ weights are a measure of the “influence” a person has over the other. The states of the Influence Model encode automatically extracted audio/visual features from our videos using state-of-the art algorithms. Our results are reported in terms of accuracy of audio/visual data fusion for speaker segmentation and centrality measures used to characterize the extracted social network. PMID:22438733

Ethylene Glycol - Polyethylene Glycol (EG-PEG) Mixtures: Infrared Spectra Wavelet Cross-Correlation Analysis.

PubMed

Caccamo, Maria Teresa; Magazù, Salvatore

2017-03-01

Infrared spectra were collected on mixtures of ethylene glycol (EG) and polyethylene glycol 600 (PEG600) as a function of weight fraction from pure EG to pure PEG600. In this paper, it will be shown that while the OH vibrational contribution drastically reduces its center frequency from 3450 cm -1 to 3300 cm -1 in the weight fraction range 0-25%, the displacement of the mixture spectral features of the mixtures from ideal behavior, i.e., in the absence of interaction, shows the presence of a non-ideal mixing process. Furthermore, wavelet cross-correlation analysis of the registered pairs of spectra and of the intramolecular O-H stretching contributions reveals how the addition of a small amount of pure EG to PEG600 dramatically influences the structural properties of the polymeric matrix, owing to an increase the intermolecular connectivity. In particular, the wavelet cross-correlation parameters, evaluated between each pair of the registered data as a function of weight fraction, in a linear-logarithmic plot, reveals an inflection point for a weight fraction of about 25% of EG, which confirms that, within the three-dimensional networks of hydrogen-bonded EG-PEG600 molecules, a key role is played by EG in determining an increase in the hydrogen-bond network density.

Degradation behavior of, and tissue response to photo-crosslinked poly(trimethylene carbonate) networks.

PubMed

Rongen, Jan J; van Bochove, Bas; Hannink, Gerjon; Grijpma, Dirk W; Buma, Pieter

2016-11-01

Photo-crosslinked networks prepared from three-armed methacrylate functionalized PTMC oligomers (PTMC-tMA macromers) are attractive materials for developing an anatomically correct meniscus scaffold. In this study, we evaluated cell specific biocompatibility, in vitro and in vivo degradation behavior of, and tissue response to, such PTMC networks. By evaluating PTMC networks prepared from PTMC-tMA macromers of different molecular weights, we were able to assess the effect of macromer molecular weight on the degradation rate of the PTMC network obtained after photo-crosslinking. Three photo-crosslinked networks with different crosslinking densities were prepared using PTMC-tMA macromers with molecular weights 13.3, 17.8, and 26.7 kg/mol. Good cell biocompatibility was demonstrated in a proliferation assay with synovium derived cells. PTMC networks degraded slowly, but statistically significant, both in vitro as well as subcutaneously in rats. Networks prepared from macromers with higher molecular weights demonstrated increased degradation rates compared to networks prepared from initial macromers of lowest molecular weight. The degradation process took place via surface erosion. The PTMC networks showed good tissue tolerance during subcutaneous implantation, to which the tissue response was characterized by the presence of fibrous tissue and encapsulation of the implants. Concluding, we developed cell and tissue biocompatible, photo-crosslinked PTMC networks using PTMC-tMA macromers with relatively high molecular weights. These photo-crosslinked PTMC networks slowly degrade by a surface erosion process. Increasing the crosslinking density of these networks decreases the rate of surface degradation. © 2016 Wiley Periodicals, Inc. J Biomed Mater Res Part A: 104A: 2823-2832, 2016. © 2016 Wiley Periodicals, Inc.

Spectral Analysis for Weighted Iterated Triangulations of Graphs

NASA Astrophysics Data System (ADS)

Chen, Yufei; Dai, Meifeng; Wang, Xiaoqian; Sun, Yu; Su, Weiyi

Much information about the structural properties and dynamical aspects of a network is measured by the eigenvalues of its normalized Laplacian matrix. In this paper, we aim to present a first study on the spectra of the normalized Laplacian of weighted iterated triangulations of graphs. We analytically obtain all the eigenvalues, as well as their multiplicities from two successive generations. As an example of application of these results, we then derive closed-form expressions for their multiplicative Kirchhoff index, Kemeny’s constant and number of weighted spanning trees.

Network approach towards understanding the crazing in glassy amorphous polymers

NASA Astrophysics Data System (ADS)

Venkatesan, Sudarkodi; Vivek-Ananth, R. P.; Sreejith, R. P.; Mangalapandi, Pattulingam; Hassanali, Ali A.; Samal, Areejit

2018-04-01

We have used molecular dynamics to simulate an amorphous glassy polymer with long chains to study the deformation mechanism of crazing and associated void statistics. The Van der Waals interactions and the entanglements between chains constituting the polymer play a crucial role in crazing. Thus, we have reconstructed two underlying weighted networks, namely, the Van der Waals network and the entanglement network from polymer configurations extracted from the molecular dynamics simulation. Subsequently, we have performed graph-theoretic analysis of the two reconstructed networks to reveal the role played by them in the crazing of polymers. Our analysis captured various stages of crazing through specific trends in the network measures for Van der Waals networks and entanglement networks. To further corroborate the effectiveness of network analysis in unraveling the underlying physics of crazing in polymers, we have contrasted the trends in network measures for Van der Waals networks and entanglement networks in the light of stress-strain behaviour and voids statistics during deformation. We find that the Van der Waals network plays a crucial role in craze initiation and growth. Although, the entanglement network was found to maintain its structure during craze initiation stage, it was found to progressively weaken and undergo dynamic changes during the hardening and failure stages of crazing phenomena. Our work demonstrates the utility of network theory in quantifying the underlying physics of polymer crazing and widens the scope of applications of network science to characterization of deformation mechanisms in diverse polymers.

Minimum spanning tree analysis of the human connectome

PubMed Central

Sommer, Iris E.; Bohlken, Marc M.; Tewarie, Prejaas; Draaisma, Laurijn; Zalesky, Andrew; Di Biase, Maria; Brown, Jesse A.; Douw, Linda; Otte, Willem M.; Mandl, René C.W.; Stam, Cornelis J.

2018-01-01

Abstract One of the challenges of brain network analysis is to directly compare network organization between subjects, irrespective of the number or strength of connections. In this study, we used minimum spanning tree (MST; a unique, acyclic subnetwork with a fixed number of connections) analysis to characterize the human brain network to create an empirical reference network. Such a reference network could be used as a null model of connections that form the backbone structure of the human brain. We analyzed the MST in three diffusion‐weighted imaging datasets of healthy adults. The MST of the group mean connectivity matrix was used as the empirical null‐model. The MST of individual subjects matched this reference MST for a mean 58%–88% of connections, depending on the analysis pipeline. Hub nodes in the MST matched with previously reported locations of hub regions, including the so‐called rich club nodes (a subset of high‐degree, highly interconnected nodes). Although most brain network studies have focused primarily on cortical connections, cortical–subcortical connections were consistently present in the MST across subjects. Brain network efficiency was higher when these connections were included in the analysis, suggesting that these tracts may be utilized as the major neural communication routes. Finally, we confirmed that MST characteristics index the effects of brain aging. We conclude that the MST provides an elegant and straightforward approach to analyze structural brain networks, and to test network topological features of individual subjects in comparison to empirical null models. PMID:29468769

Optimal and robust control of a class of nonlinear systems using dynamically re-optimised single network adaptive critic design

NASA Astrophysics Data System (ADS)

Tiwari, Shivendra N.; Padhi, Radhakant

2018-01-01

Following the philosophy of adaptive optimal control, a neural network-based state feedback optimal control synthesis approach is presented in this paper. First, accounting for a nominal system model, a single network adaptive critic (SNAC) based multi-layered neural network (called as NN1) is synthesised offline. However, another linear-in-weight neural network (called as NN2) is trained online and augmented to NN1 in such a manner that their combined output represent the desired optimal costate for the actual plant. To do this, the nominal model needs to be updated online to adapt to the actual plant, which is done by synthesising yet another linear-in-weight neural network (called as NN3) online. Training of NN3 is done by utilising the error information between the nominal and actual states and carrying out the necessary Lyapunov stability analysis using a Sobolev norm based Lyapunov function. This helps in training NN2 successfully to capture the required optimal relationship. The overall architecture is named as 'Dynamically Re-optimised single network adaptive critic (DR-SNAC)'. Numerical results for two motivating illustrative problems are presented, including comparison studies with closed form solution for one problem, which clearly demonstrate the effectiveness and benefit of the proposed approach.

Spatio-Temporal Patterns of the International Merger and Acquisition Network.

PubMed

Dueñas, Marco; Mastrandrea, Rossana; Barigozzi, Matteo; Fagiolo, Giorgio

2017-09-07

This paper analyses the world web of mergers and acquisitions (M&As) using a complex network approach. We use data of M&As to build a temporal sequence of binary and weighted-directed networks for the period 1995-2010 and 224 countries (nodes) connected according to their M&As flows (links). We study different geographical and temporal aspects of the international M&A network (IMAN), building sequences of filtered sub-networks whose links belong to specific intervals of distance or time. Given that M&As and trade are complementary ways of reaching foreign markets, we perform our analysis using statistics employed for the study of the international trade network (ITN), highlighting the similarities and differences between the ITN and the IMAN. In contrast to the ITN, the IMAN is a low density network characterized by a persistent giant component with many external nodes and low reciprocity. Clustering patterns are very heterogeneous and dynamic. High-income economies are the main acquirers and are characterized by high connectivity, implying that most countries are targets of a few acquirers. Like in the ITN, geographical distance strongly impacts the structure of the IMAN: link-weights and node degrees have a non-linear relation with distance, and an assortative pattern is present at short distances.

An extensive analysis of disease-gene associations using network integration and fast kernel-based gene prioritization methods.

PubMed

Valentini, Giorgio; Paccanaro, Alberto; Caniza, Horacio; Romero, Alfonso E; Re, Matteo

2014-06-01

In the context of "network medicine", gene prioritization methods represent one of the main tools to discover candidate disease genes by exploiting the large amount of data covering different types of functional relationships between genes. Several works proposed to integrate multiple sources of data to improve disease gene prioritization, but to our knowledge no systematic studies focused on the quantitative evaluation of the impact of network integration on gene prioritization. In this paper, we aim at providing an extensive analysis of gene-disease associations not limited to genetic disorders, and a systematic comparison of different network integration methods for gene prioritization. We collected nine different functional networks representing different functional relationships between genes, and we combined them through both unweighted and weighted network integration methods. We then prioritized genes with respect to each of the considered 708 medical subject headings (MeSH) diseases by applying classical guilt-by-association, random walk and random walk with restart algorithms, and the recently proposed kernelized score functions. The results obtained with classical random walk algorithms and the best single network achieved an average area under the curve (AUC) across the 708 MeSH diseases of about 0.82, while kernelized score functions and network integration boosted the average AUC to about 0.89. Weighted integration, by exploiting the different "informativeness" embedded in different functional networks, outperforms unweighted integration at 0.01 significance level, according to the Wilcoxon signed rank sum test. For each MeSH disease we provide the top-ranked unannotated candidate genes, available for further bio-medical investigation. Network integration is necessary to boost the performances of gene prioritization methods. Moreover the methods based on kernelized score functions can further enhance disease gene ranking results, by adopting both local and global learning strategies, able to exploit the overall topology of the network. Copyright © 2014 The Authors. Published by Elsevier B.V. All rights reserved.

Obtaining Arbitrary Prescribed Mean Field Dynamics for Recurrently Coupled Networks of Type-I Spiking Neurons with Analytically Determined Weights

PubMed Central

Nicola, Wilten; Tripp, Bryan; Scott, Matthew

2016-01-01

A fundamental question in computational neuroscience is how to connect a network of spiking neurons to produce desired macroscopic or mean field dynamics. One possible approach is through the Neural Engineering Framework (NEF). The NEF approach requires quantities called decoders which are solved through an optimization problem requiring large matrix inversion. Here, we show how a decoder can be obtained analytically for type I and certain type II firing rates as a function of the heterogeneity of its associated neuron. These decoders generate approximants for functions that converge to the desired function in mean-squared error like 1/N, where N is the number of neurons in the network. We refer to these decoders as scale-invariant decoders due to their structure. These decoders generate weights for a network of neurons through the NEF formula for weights. These weights force the spiking network to have arbitrary and prescribed mean field dynamics. The weights generated with scale-invariant decoders all lie on low dimensional hypersurfaces asymptotically. We demonstrate the applicability of these scale-invariant decoders and weight surfaces by constructing networks of spiking theta neurons that replicate the dynamics of various well known dynamical systems such as the neural integrator, Van der Pol system and the Lorenz system. As these decoders are analytically determined and non-unique, the weights are also analytically determined and non-unique. We discuss the implications for measured weights of neuronal networks. PMID:26973503

Obtaining Arbitrary Prescribed Mean Field Dynamics for Recurrently Coupled Networks of Type-I Spiking Neurons with Analytically Determined Weights.

PubMed

Nicola, Wilten; Tripp, Bryan; Scott, Matthew

2016-01-01

A fundamental question in computational neuroscience is how to connect a network of spiking neurons to produce desired macroscopic or mean field dynamics. One possible approach is through the Neural Engineering Framework (NEF). The NEF approach requires quantities called decoders which are solved through an optimization problem requiring large matrix inversion. Here, we show how a decoder can be obtained analytically for type I and certain type II firing rates as a function of the heterogeneity of its associated neuron. These decoders generate approximants for functions that converge to the desired function in mean-squared error like 1/N, where N is the number of neurons in the network. We refer to these decoders as scale-invariant decoders due to their structure. These decoders generate weights for a network of neurons through the NEF formula for weights. These weights force the spiking network to have arbitrary and prescribed mean field dynamics. The weights generated with scale-invariant decoders all lie on low dimensional hypersurfaces asymptotically. We demonstrate the applicability of these scale-invariant decoders and weight surfaces by constructing networks of spiking theta neurons that replicate the dynamics of various well known dynamical systems such as the neural integrator, Van der Pol system and the Lorenz system. As these decoders are analytically determined and non-unique, the weights are also analytically determined and non-unique. We discuss the implications for measured weights of neuronal networks.

Distributed synaptic weights in a LIF neural network and learning rules

NASA Astrophysics Data System (ADS)

Perthame, Benoît; Salort, Delphine; Wainrib, Gilles

2017-09-01

Leaky integrate-and-fire (LIF) models are mean-field limits, with a large number of neurons, used to describe neural networks. We consider inhomogeneous networks structured by a connectivity parameter (strengths of the synaptic weights) with the effect of processing the input current with different intensities. We first study the properties of the network activity depending on the distribution of synaptic weights and in particular its discrimination capacity. Then, we consider simple learning rules and determine the synaptic weight distribution it generates. We outline the role of noise as a selection principle and the capacity to memorize a learned signal.

General Dynamics of Topology and Traffic on Weighted Technological Networks

NASA Astrophysics Data System (ADS)

Wang, Wen-Xu; Wang, Bing-Hong; Hu, Bo; Yan, Gang; Ou, Qing

2005-05-01

For most technical networks, the interplay of dynamics, traffic, and topology is assumed crucial to their evolution. In this Letter, we propose a traffic-driven evolution model of weighted technological networks. By introducing a general strength-coupling mechanism under which the traffic and topology mutually interact, the model gives power-law distributions of degree, weight, and strength, as confirmed in many real networks. Particularly, depending on a parameter W that controls the total weight growth of the system, the nontrivial clustering coefficient C, degree assortativity coefficient r, and degree-strength correlation are all consistent with empirical evidence.

Identification of the anti-tumor activity and mechanisms of nuciferine through a network pharmacology approach

PubMed Central

Qi, Quan; Li, Rui; Li, Hui-ying; Cao, Yu-bing; Bai, Ming; Fan, Xiao-jing; Wang, Shu-yan; Zhang, Bo; Li, Shao

2016-01-01

Aim: Nuciferine is an aporphine alkaloid extracted from lotus leaves, which is a raw material in Chinese medicinal herb for weight loss. In this study we used a network pharmacology approach to identify the anti-tumor activity of nuciferine and the underlying mechanisms. Methods: The pharmacological activities and mechanisms of nuciferine were identified through target profile prediction, clustering analysis and functional enrichment analysis using our traditional Chinese medicine (TCM) network pharmacology platform. The anti-tumor activity of nuciferine was validated by in vitro and in vivo experiments. The anti-tumor mechanisms of nuciferine were predicted through network target analysis and verified by in vitro experiments. Results: The nuciferine target profile was enriched with signaling pathways and biological functions, including “regulation of lipase activity”, “response to nicotine” and “regulation of cell proliferation”. Target profile clustering results suggested that nuciferine to exert anti-tumor effect. In experimental validation, nuciferine (0.8 mg/mL) markedly inhibited the viability of human neuroblastoma SY5Y cells and mouse colorectal cancer CT26 cells in vitro, and nuciferine (0.05 mg/mL) significantly suppressed the invasion of 6 cancer cell lines in vitro. Intraperitoneal injection of nuciferine (9.5 mg/mL, ip, 3 times a week for 3 weeks) significantly decreased the weight of SY5Y and CT26 tumor xenografts in nude mice. Network target analysis and experimental validation in SY5Y and CT26 cells showed that the anti-tumor effect of nuciferine was mediated through inhibiting the PI3K-AKT signaling pathway and IL-1 levels in SY5Y and CT26 cells. Conclusion: By using a TCM network pharmacology method, nuciferine is identified as an anti-tumor agent against human neuroblastoma and mouse colorectal cancer in vitro and in vivo, through inhibiting the PI3K-AKT signaling pathways and IL-1 levels. PMID:27180984

An Enhanced K-Means Algorithm for Water Quality Analysis of The Haihe River in China.

PubMed

Zou, Hui; Zou, Zhihong; Wang, Xiaojing

2015-11-12

The increase and the complexity of data caused by the uncertain environment is today's reality. In order to identify water quality effectively and reliably, this paper presents a modified fast clustering algorithm for water quality analysis. The algorithm has adopted a varying weights K-means cluster algorithm to analyze water monitoring data. The varying weights scheme was the best weighting indicator selected by a modified indicator weight self-adjustment algorithm based on K-means, which is named MIWAS-K-means. The new clustering algorithm avoids the margin of the iteration not being calculated in some cases. With the fast clustering analysis, we can identify the quality of water samples. The algorithm is applied in water quality analysis of the Haihe River (China) data obtained by the monitoring network over a period of eight years (2006-2013) with four indicators at seven different sites (2078 samples). Both the theoretical and simulated results demonstrate that the algorithm is efficient and reliable for water quality analysis of the Haihe River. In addition, the algorithm can be applied to more complex data matrices with high dimensionality.

Network-based model of the growth of termite nests

NASA Astrophysics Data System (ADS)

Eom, Young-Ho; Perna, Andrea; Fortunato, Santo; Darrouzet, Eric; Theraulaz, Guy; Jost, Christian

2015-12-01

We present a model for the growth of the transportation network inside nests of the social insect subfamily Termitinae (Isoptera, termitidae). These nests consist of large chambers (nodes) connected by tunnels (edges). The model based on the empirical analysis of the real nest networks combined with pruning (edge removal, either random or weighted by betweenness centrality) and a memory effect (preferential growth from the latest added chambers) successfully predicts emergent nest properties (degree distribution, size of the largest connected component, average path lengths, backbone link ratios, and local graph redundancy). The two pruning alternatives can be associated with different genuses in the subfamily. A sensitivity analysis on the pruning and memory parameters indicates that Termitinae networks favor fast internal transportation over efficient defense strategies against ant predators. Our results provide an example of how complex network organization and efficient network properties can be generated from simple building rules based on local interactions and contribute to our understanding of the mechanisms that come into play for the formation of termite networks and of biological transportation networks in general.

LEGO: a novel method for gene set over-representation analysis by incorporating network-based gene weights

PubMed Central

Dong, Xinran; Hao, Yun; Wang, Xiao; Tian, Weidong

2016-01-01

Pathway or gene set over-representation analysis (ORA) has become a routine task in functional genomics studies. However, currently widely used ORA tools employ statistical methods such as Fisher’s exact test that reduce a pathway into a list of genes, ignoring the constitutive functional non-equivalent roles of genes and the complex gene-gene interactions. Here, we develop a novel method named LEGO (functional Link Enrichment of Gene Ontology or gene sets) that takes into consideration these two types of information by incorporating network-based gene weights in ORA analysis. In three benchmarks, LEGO achieves better performance than Fisher and three other network-based methods. To further evaluate LEGO’s usefulness, we compare LEGO with five gene expression-based and three pathway topology-based methods using a benchmark of 34 disease gene expression datasets compiled by a recent publication, and show that LEGO is among the top-ranked methods in terms of both sensitivity and prioritization for detecting target KEGG pathways. In addition, we develop a cluster-and-filter approach to reduce the redundancy among the enriched gene sets, making the results more interpretable to biologists. Finally, we apply LEGO to two lists of autism genes, and identify relevant gene sets to autism that could not be found by Fisher. PMID:26750448

LEGO: a novel method for gene set over-representation analysis by incorporating network-based gene weights.

PubMed

Dong, Xinran; Hao, Yun; Wang, Xiao; Tian, Weidong

2016-01-11

Pathway or gene set over-representation analysis (ORA) has become a routine task in functional genomics studies. However, currently widely used ORA tools employ statistical methods such as Fisher's exact test that reduce a pathway into a list of genes, ignoring the constitutive functional non-equivalent roles of genes and the complex gene-gene interactions. Here, we develop a novel method named LEGO (functional Link Enrichment of Gene Ontology or gene sets) that takes into consideration these two types of information by incorporating network-based gene weights in ORA analysis. In three benchmarks, LEGO achieves better performance than Fisher and three other network-based methods. To further evaluate LEGO's usefulness, we compare LEGO with five gene expression-based and three pathway topology-based methods using a benchmark of 34 disease gene expression datasets compiled by a recent publication, and show that LEGO is among the top-ranked methods in terms of both sensitivity and prioritization for detecting target KEGG pathways. In addition, we develop a cluster-and-filter approach to reduce the redundancy among the enriched gene sets, making the results more interpretable to biologists. Finally, we apply LEGO to two lists of autism genes, and identify relevant gene sets to autism that could not be found by Fisher.

Complex networks untangle competitive advantage in Australian football

NASA Astrophysics Data System (ADS)

Braham, Calum; Small, Michael

2018-05-01

We construct player-based complex network models of Australian football teams for the 2014 Australian Football League season; modelling the passes between players as weighted, directed edges. We show that analysis of these measures can give an insight into the underlying structure and strategy of Australian football teams, quantitatively distinguishing different playing styles. The relationships observed between network properties and match outcomes suggest that successful teams exhibit well-connected passing networks with the passes distributed between all 22 players as evenly as possible. Linear regression models of team scores and match margins show significant improvements in R2 and Bayesian information criterion when network measures are added to models that use conventional measures, demonstrating that network analysis measures contain useful, extra information. Several measures, particularly the mean betweenness centrality, are shown to be useful in predicting the outcomes of future matches, suggesting they measure some aspect of the intrinsic strength of teams. In addition, several local centrality measures are shown to be useful in analysing individual players' differing contributions to the team's structure.

Complex networks untangle competitive advantage in Australian football.

PubMed

Braham, Calum; Small, Michael

2018-05-01

We construct player-based complex network models of Australian football teams for the 2014 Australian Football League season; modelling the passes between players as weighted, directed edges. We show that analysis of these measures can give an insight into the underlying structure and strategy of Australian football teams, quantitatively distinguishing different playing styles. The relationships observed between network properties and match outcomes suggest that successful teams exhibit well-connected passing networks with the passes distributed between all 22 players as evenly as possible. Linear regression models of team scores and match margins show significant improvements in R 2 and Bayesian information criterion when network measures are added to models that use conventional measures, demonstrating that network analysis measures contain useful, extra information. Several measures, particularly the mean betweenness centrality, are shown to be useful in predicting the outcomes of future matches, suggesting they measure some aspect of the intrinsic strength of teams. In addition, several local centrality measures are shown to be useful in analysing individual players' differing contributions to the team's structure.

Scaling and correlations in three bus-transport networks of China

NASA Astrophysics Data System (ADS)

Xu, Xinping; Hu, Junhui; Liu, Feng; Liu, Lianshou

2007-01-01

We report the statistical properties of three bus-transport networks (BTN) in three different cities of China. These networks are composed of a set of bus lines and stations serviced by these. Network properties, including the degree distribution, clustering and average path length are studied in different definitions of network topology. We explore scaling laws and correlations that may govern intrinsic features of such networks. Besides, we create a weighted network representation for BTN with lines mapped to nodes and number of common stations to weights between lines. In such a representation, the distributions of degree, strength and weight are investigated. A linear behavior between strength and degree s(k)∼k is also observed.

Weighted networks as randomly reinforced urn processes

NASA Astrophysics Data System (ADS)

Caldarelli, Guido; Chessa, Alessandro; Crimaldi, Irene; Pammolli, Fabio

2013-02-01

We analyze weighted networks as randomly reinforced urn processes, in which the edge-total weights are determined by a reinforcement mechanism. We develop a statistical test and a procedure based on it to study the evolution of networks over time, detecting the “dominance” of some edges with respect to the others and then assessing if a given instance of the network is taken at its steady state or not. Distance from the steady state can be considered as a measure of the relevance of the observed properties of the network. Our results are quite general, in the sense that they are not based on a particular probability distribution or functional form of the random weights. Moreover, the proposed tool can be applied also to dense networks, which have received little attention by the network community so far, since they are often problematic. We apply our procedure in the context of the International Trade Network, determining a core of “dominant edges.”

Genetic algorithm based adaptive neural network ensemble and its application in predicting carbon flux

USGS Publications Warehouse

Xue, Y.; Liu, S.; Hu, Y.; Yang, J.; Chen, Q.

2007-01-01

To improve the accuracy in prediction, Genetic Algorithm based Adaptive Neural Network Ensemble (GA-ANNE) is presented. Intersections are allowed between different training sets based on the fuzzy clustering analysis, which ensures the diversity as well as the accuracy of individual Neural Networks (NNs). Moreover, to improve the accuracy of the adaptive weights of individual NNs, GA is used to optimize the cluster centers. Empirical results in predicting carbon flux of Duke Forest reveal that GA-ANNE can predict the carbon flux more accurately than Radial Basis Function Neural Network (RBFNN), Bagging NN ensemble, and ANNE. ?? 2007 IEEE.

A novel method to identify hub pathways of rheumatoid arthritis based on differential pathway networks.

PubMed

Wei, Shi-Tong; Sun, Yong-Hua; Zong, Shi-Hua

2017-09-01

The aim of the current study was to identify hub pathways of rheumatoid arthritis (RA) using a novel method based on differential pathway network (DPN) analysis. The present study proposed a DPN where protein‑protein interaction (PPI) network was integrated with pathway‑pathway interactions. Pathway data was obtained from background PPI network and the Reactome pathway database. Subsequently, pathway interactions were extracted from the pathway data by building randomized gene‑gene interactions and a weight value was assigned to each pathway interaction using Spearman correlation coefficient (SCC) to identify differential pathway interactions. Differential pathway interactions were visualized using Cytoscape to construct a DPN. Topological analysis was conducted to identify hub pathways that possessed the top 5% degree distribution of DPN. Modules of DPN were mined according to ClusterONE. A total of 855 pathways were selected to build pathway interactions. By filtrating pathway interactions of weight values >0.7, a DPN with 312 nodes and 791 edges was obtained. Topological degree analysis revealed 15 hub pathways, such as heparan sulfate/heparin‑glycosaminoglycan (HS‑GAG) degradation, HS‑GAG metabolism and keratan sulfate degradation for RA based on DPN. Furthermore, hub pathways were also important in modules, which validated the significance of hub pathways. In conclusion, the proposed method is a computationally efficient way to identify hub pathways of RA, which identified 15 hub pathways that may be potential biomarkers and provide insight to future investigation and treatment of RA.

Analog hardware implementation of neocognitron networks

NASA Astrophysics Data System (ADS)

Inigo, Rafael M.; Bonde, Allen, Jr.; Holcombe, Bradford

1990-08-01

This paper deals with the analog implementation of neocognitron based neural networks. All of Fukushima''s and related work on the neocognitron is based on digital computer simulations. To fully take advantage of the power of this network paradigm an analog electronic approach is proposed. We first implemented a 6-by-6 sensor network with discrete analog components and fixed weights. The network was given weight values to recognize the characters U L and F. These characters are recognized regardless of their location on the sensor and with various levels of distortion and noise. The network performance has also shown an excellent correlation with software simulation results. Next we implemented a variable weight network which can be trained to recognize simple patterns by means of self-organization. The adaptable weights were implemented with PETs configured as voltage-controlled resistors. To implement a variable weight there must be some type of " memory" to store the weight value and hold it while the value is reinforced or incremented. Two methods were evaluated: an analog sample-hold circuit and a digital storage scheme using binary counters. The latter is preferable for VLSI implementation because it uses standard components and does not require the use of capacitors. The analog design and implementation of these small-scale networks demonstrates the feasibility of implementing more complicated ANNs in electronic hardware. The circuits developed can also be designed for VLSI implementation. 1.

Weight-elimination neural networks applied to coronary surgery mortality prediction.

PubMed

Ennett, Colleen M; Frize, Monique

2003-06-01

The objective was to assess the effectiveness of the weight-elimination cost function in improving classification performance of artificial neural networks (ANNs) and to observe how changing the a priori distribution of the training set affects network performance. Backpropagation feedforward ANNs with and without weight-elimination estimated mortality for coronary artery surgery patients. The ANNs were trained and tested on cases with 32 input variables describing the patient's medical history; the output variable was in-hospital mortality (mortality rates: training 3.7%, test 3.8%). Artificial training sets with mortality rates of 20%, 50%, and 80% were created to observe the impact of training with a higher-than-normal prevalence. When the results were averaged, weight-elimination networks achieved higher sensitivity rates than those without weight-elimination. Networks trained on higher-than-normal prevalence achieved higher sensitivity rates at the cost of lower specificity and correct classification. The weight-elimination cost function can improve the classification performance when the network is trained with a higher-than-normal prevalence. A network trained with a moderately high artificial mortality rate (artificial mortality rate of 20%) can improve the sensitivity of the model without significantly affecting other aspects of the model's performance. The ANN mortality model achieved comparable performance as additive and statistical models for coronary surgery mortality estimation in the literature.

The Data from Aeromechanics Test and Analytics -- Management and Analysis Package (DATAMAP). Volume I. User’s Manual.

DTIC Science & Technology

1980-12-01

to sound pressure level in decibels assuming a fre- quency of 1000 Hz. 249 The perceived noisiness values are derived from a formula specified in...Analyses .......... 244 6.i.16 Perceived Noise Level Analysis .............249 6.1.17 Acoustic Weighting Networks ................250 6.2 DERIVATIONS...BAND ANALYSIS BASIC STATISTICAL ANALYSES: *OCTAVE ANALYSIS MEAN *THIRD OCTAVE ANALYSIS VARIANCE *PERCEIVED NOISE LEVEL STANDARD DEVIATION CALCULATION

Finite-time stability of neutral-type neural networks with random time-varying delays

NASA Astrophysics Data System (ADS)

Ali, M. Syed; Saravanan, S.; Zhu, Quanxin

2017-11-01

This paper is devoted to the finite-time stability analysis of neutral-type neural networks with random time-varying delays. The randomly time-varying delays are characterised by Bernoulli stochastic variable. This result can be extended to analysis and design for neutral-type neural networks with random time-varying delays. On the basis of this paper, we constructed suitable Lyapunov-Krasovskii functional together and established a set of sufficient linear matrix inequalities approach to guarantee the finite-time stability of the system concerned. By employing the Jensen's inequality, free-weighting matrix method and Wirtinger's double integral inequality, the proposed conditions are derived and two numerical examples are addressed for the effectiveness of the developed techniques.

Individual T1-weighted/T2-weighted ratio brain networks: Small-worldness, hubs and modular organization

NASA Astrophysics Data System (ADS)

Wu, Huijun; Wang, Hao; Lü, Linyuan

Applying network science to investigate the complex systems has become a hot topic. In neuroscience, understanding the architectures of complex brain networks was a vital issue. An enormous amount of evidence had supported the brain was cost/efficiency trade-off with small-worldness, hubness and modular organization through the functional MRI and structural MRI investigations. However, the T1-weighted/T2-weighted (T1w/T2w) ratio brain networks were mostly unexplored. Here, we utilized a KL divergence-based method to construct large-scale individual T1w/T2w ratio brain networks and investigated the underlying topological attributes of these networks. Our results supported that the T1w/T2w ratio brain networks were comprised of small-worldness, an exponentially truncated power-law degree distribution, frontal-parietal hubs and modular organization. Besides, there were significant positive correlations between the network metrics and fluid intelligence. Thus, the T1w/T2w ratio brain networks open a new avenue to understand the human brain and are a necessary supplement for future MRI studies.

Topology and weights in a protein domain interaction network--a novel way to predict protein interactions.

PubMed

Wuchty, Stefan

2006-05-23

While the analysis of unweighted biological webs as diverse as genetic, protein and metabolic networks allowed spectacular insights in the inner workings of a cell, biological networks are not only determined by their static grid of links. In fact, we expect that the heterogeneity in the utilization of connections has a major impact on the organization of cellular activities as well. We consider a web of interactions between protein domains of the Protein Family database (PFAM), which are weighted by a probability score. We apply metrics that combine the static layout and the weights of the underlying interactions. We observe that unweighted measures as well as their weighted counterparts largely share the same trends in the underlying domain interaction network. However, we only find weak signals that weights and the static grid of interactions are connected entities. Therefore assuming that a protein interaction is governed by a single domain interaction, we observe strong and significant correlations of the highest scoring domain interaction and the confidence of protein interactions in the underlying interactions of yeast and fly. Modeling an interaction between proteins if we find a high scoring protein domain interaction we obtain 1, 428 protein interactions among 361 proteins in the human malaria parasite Plasmodium falciparum. Assessing their quality by a logistic regression method we observe that increasing confidence of predicted interactions is accompanied by high scoring domain interactions and elevated levels of functional similarity and evolutionary conservation. Our results indicate that probability scores are randomly distributed, allowing to treat static grid and weights of domain interactions as separate entities. In particular, these finding confirms earlier observations that a protein interaction is a matter of a single interaction event on domain level. As an immediate application, we show a simple way to predict potential protein interactions by utilizing expectation scores of single domain interactions.

Different propagation speeds of recalled sequences in plastic spiking neural networks

NASA Astrophysics Data System (ADS)

Huang, Xuhui; Zheng, Zhigang; Hu, Gang; Wu, Si; Rasch, Malte J.

2015-03-01

Neural networks can generate spatiotemporal patterns of spike activity. Sequential activity learning and retrieval have been observed in many brain areas, and e.g. is crucial for coding of episodic memory in the hippocampus or generating temporal patterns during song production in birds. In a recent study, a sequential activity pattern was directly entrained onto the neural activity of the primary visual cortex (V1) of rats and subsequently successfully recalled by a local and transient trigger. It was observed that the speed of activity propagation in coordinates of the retinotopically organized neural tissue was constant during retrieval regardless how the speed of light stimulation sweeping across the visual field during training was varied. It is well known that spike-timing dependent plasticity (STDP) is a potential mechanism for embedding temporal sequences into neural network activity. How training and retrieval speeds relate to each other and how network and learning parameters influence retrieval speeds, however, is not well described. We here theoretically analyze sequential activity learning and retrieval in a recurrent neural network with realistic synaptic short-term dynamics and STDP. Testing multiple STDP rules, we confirm that sequence learning can be achieved by STDP. However, we found that a multiplicative nearest-neighbor (NN) weight update rule generated weight distributions and recall activities that best matched the experiments in V1. Using network simulations and mean-field analysis, we further investigated the learning mechanisms and the influence of network parameters on recall speeds. Our analysis suggests that a multiplicative STDP rule with dominant NN spike interaction might be implemented in V1 since recall speed was almost constant in an NMDA-dominant regime. Interestingly, in an AMPA-dominant regime, neural circuits might exhibit recall speeds that instead follow the change in stimulus speeds. This prediction could be tested in experiments.

Analysis of the streamflow-gaging station network in Ohio for effectiveness in providing regional streamflow information

USGS Publications Warehouse

Straub, D.E.

1998-01-01

The streamflow-gaging station network in Ohio was evaluated for its effectiveness in providing regional streamflow information. The analysis involved application of the principles of generalized least squares regression between streamflow and climatic and basin characteristics. Regression equations were developed for three flow characteristics: (1) the instantaneous peak flow with a 100-year recurrence interval (P100), (2) the mean annual flow (Qa), and (3) the 7-day, 10-year low flow (7Q10). All active and discontinued gaging stations with 5 or more years of unregulated-streamflow data with respect to each flow characteristic were used to develop the regression equations. The gaging-station network was evaluated for the current (1996) condition of the network and estimated conditions of various network strategies if an additional 5 and 20 years of streamflow data were collected. Any active or discontinued gaging station with (1) less than 5 years of unregulated-streamflow record, (2) previously defined basin and climatic characteristics, and (3) the potential for collection of more unregulated-streamflow record were included in the network strategies involving the additional 5 and 20 years of data. The network analysis involved use of the regression equations, in combination with location, period of record, and cost of operation, to determine the contribution of the data for each gaging station to regional streamflow information. The contribution of each gaging station was based on a cost-weighted reduction of the mean square error (average sampling-error variance) associated with each regional estimating equation. All gaging stations included in the network analysis were then ranked according to their contribution to the regional information for each flow characteristic. The predictive ability of the regression equations developed from the gaging station network could be improved for all three flow characteristics with the collection of additional streamflow data. The addition of new gaging stations to the network would result in an even greater improvement of the accuracy of the regional regression equations. Typically, continued data collection at stations with unregulated streamflow for all flow conditions that had less than 11 years of record with drainage areas smaller than 200 square miles contributed the largest cost-weighted reduction to the average sampling-error variance of the regional estimating equations. The results of the network analyses can be used to prioritize the continued operation of active gaging stations or the reactivation of discontinued gaging stations if the objective is to maximize the regional information content in the streamflow-gaging station network.

Exponential stability of stochastic complex networks with multi-weights based on graph theory

NASA Astrophysics Data System (ADS)

Zhang, Chunmei; Chen, Tianrui

2018-04-01

In this paper, a novel approach to exponential stability of stochastic complex networks with multi-weights is investigated by means of the graph-theoretical method. New sufficient conditions are provided to ascertain the moment exponential stability and almost surely exponential stability of stochastic complex networks with multiple weights. It is noted that our stability results are closely related with multi-weights and the intensity of stochastic disturbance. Numerical simulations are also presented to substantiate the theoretical results.

Stochastic simulation and analysis of biomolecular reaction networks

PubMed Central

Frazier, John M; Chushak, Yaroslav; Foy, Brent

2009-01-01

Background In recent years, several stochastic simulation algorithms have been developed to generate Monte Carlo trajectories that describe the time evolution of the behavior of biomolecular reaction networks. However, the effects of various stochastic simulation and data analysis conditions on the observed dynamics of complex biomolecular reaction networks have not recieved much attention. In order to investigate these issues, we employed a a software package developed in out group, called Biomolecular Network Simulator (BNS), to simulate and analyze the behavior of such systems. The behavior of a hypothetical two gene in vitro transcription-translation reaction network is investigated using the Gillespie exact stochastic algorithm to illustrate some of the factors that influence the analysis and interpretation of these data. Results Specific issues affecting the analysis and interpretation of simulation data are investigated, including: (1) the effect of time interval on data presentation and time-weighted averaging of molecule numbers, (2) effect of time averaging interval on reaction rate analysis, (3) effect of number of simulations on precision of model predictions, and (4) implications of stochastic simulations on optimization procedures. Conclusion The two main factors affecting the analysis of stochastic simulations are: (1) the selection of time intervals to compute or average state variables and (2) the number of simulations generated to evaluate the system behavior. PMID:19534796

Altered anatomical patterns of depression in relation to antidepressant treatment: Evidence from a pattern recognition analysis on the topological organization of brain networks.

PubMed

Qin, Jiaolong; Wei, Maobin; Liu, Haiyan; Chen, Jianhuai; Yan, Rui; Yao, Zhijian; Lu, Qing

2015-07-15

Accumulated evidence has illuminated the topological infrastructure of major depressive disorder (MDD). However, the changes of topological properties of anatomical brain networks in remitted major depressive disorder patients (rMDD) remain an open question. The present study provides an exploratory examination of pattern changes among current major depressive disorder patients (cMDD), rMDD patients and healthy controls (HC) by means of a pattern recognition analysis. Twenty-eight cMDD patients (age range: 22-54, mean age: 39.57), 15 rMDD patients (age range: 23-53, mean age: 38.40) and 30 HC (23-54, mean age: 35.57) were enrolled. For each subject, we computed five kinds of weighted white matter (WM) networks via employing five physiological parameters (i.e. fractional anisotropy, mean diffusivity, λ1, λ2 and λ3) and then calculated three network measures of these weighted networks. We treated these measures as features and fed into a feature selection mechanism to choose the most discriminative features for linear support vector machine (SVM) classifiers. Linear SVM could excellently distinguish the three groups with the 100% classification accuracy of recognizing cMDD/rMDD from HC, and 97.67% classification accuracy of recognizing cMDD from rMDD. The further pattern analysis found two types of discriminative patterns among cMDD, rMDD and HC. (i) Compared with HC, both cMDD and rMDD exhibited the similar deficit patterns of node strength primarily involving the salience network (SN), default mode network (DMN) and frontoparietal network (FPN). (ii) Compared with cMDD and rMDD showed the altered pattern of intra-communicability within DMN and inter-communicability between DMN and the other sub-networks including the visual recognition network (VRN) and SN. The present study had a limited sample size and a lack of larger independent data set to validate the methods and confirm the findings. These findings implied that the impairment of MDD was closely associated with the alterations of connections within SN, DMN and FPN, whereas the remission of MDD was benefitted from the network compensatory of intra-communication within DMN and inter-communication between DMN and the other sub-networks (i.e., VRN and SN). Copyright © 2015 Elsevier B.V. All rights reserved.

Feature weighting using particle swarm optimization for learning vector quantization classifier

NASA Astrophysics Data System (ADS)

Dongoran, A.; Rahmadani, S.; Zarlis, M.; Zakarias

2018-03-01

This paper discusses and proposes a method of feature weighting in classification assignments on competitive learning artificial neural network LVQ. The weighting feature method is the search for the weight of an attribute using the PSO so as to give effect to the resulting output. This method is then applied to the LVQ-Classifier and tested on the 3 datasets obtained from the UCI Machine Learning repository. Then an accuracy analysis will be generated by two approaches. The first approach using LVQ1, referred to as LVQ-Classifier and the second approach referred to as PSOFW-LVQ, is a proposed model. The result shows that the PSO algorithm is capable of finding attribute weights that increase LVQ-classifier accuracy.

Risk of gastrointestinal bleeding with direct oral anticoagulants: a systematic review and network meta-analysis.

PubMed

Burr, Nick; Lummis, Katie; Sood, Ruchit; Kane, John Samuel; Corp, Aaron; Subramanian, Venkataraman

2017-02-01

Direct oral anticoagulants are increasingly used for a wide range of indications. However, data are conflicting about the risk of major gastrointestinal bleeding with these drugs. We compared the risk of gastrointestinal bleeding with direct oral anticoagulants, warfarin, and low-molecular-weight heparin. For this systematic review and meta-analysis, we searched MEDLINE and Embase from database inception to April 1, 2016, for prospective and retrospective studies that reported the risk of gastrointestinal bleeding with use of a direct oral anticoagulant compared with warfarin or low-molecular-weight heparin for all indications. We also searched the Cochrane Library for systematic reviews and assessment evaluations, the National Health Service (UK) Economic Evaluation Database, and ISI Web of Science for conference abstracts and proceedings (up to April 1, 2016). The primary outcome was the incidence of major gastrointestinal bleeding, with all gastrointestinal bleeding as a secondary outcome. We did a Bayesian network meta-analysis to produce incidence rate ratios (IRRs) with 95% credible intervals (CrIs). We identified 38 eligible articles, of which 31 were included in the primary analysis, including 287 692 patients exposed to 230 090 years of anticoagulant drugs. The risk of major gastrointestinal bleeding with direct oral anticoagulants did not differ from that with warfarin or low-molecular-weight heparin (factor Xa vs warfarin IRR 0·78 [95% CrI 0·47-1·08]; warfarin vs dabigatran 0·88 [0·59-1·36]; factor Xa vs low-molecular-weight heparin 1·02 [0·42-2·70]; and low-molecular-weight heparin vs dabigatran 0·67 [0·20-1·82]). In the secondary analysis, factor Xa inhibitors were associated with a reduced risk of all severities of gastrointestinal bleeding compared with warfarin (0·25 [0.07-0.76]) or dabigatran (0.24 [0.07-0.77]). Our findings show no increase in risk of major gastrointestinal bleeding with direct oral anticoagulants compared with warfarin or low-molecular-weight heparin. These findings support the continued use of direct oral anticoagulants. Leeds Teaching Hospitals Charitable Foundation. Copyright © 2017 Elsevier Ltd. All rights reserved.

Transcriptome Analysis of Gelatin Seed Treatment as a Biostimulant of Cucumber Plant Growth

PubMed Central

Wilson, H. T.; Xu, K.; Taylor, A. G.

2015-01-01

The beneficial effects of gelatin capsule seed treatment on enhanced plant growth and tolerance to abiotic stress have been reported in a number of crops, but the molecular mechanisms underlying such effects are poorly understood. Using mRNA sequencing based approach, transcriptomes of one- and two-week-old cucumber plants from gelatin capsule treated and nontreated seeds were characterized. The gelatin treated plants had greater total leaf area, fresh weight, frozen weight, and nitrogen content. Pairwise comparisons of the RNA-seq data identified 620 differentially expressed genes between treated and control two-week-old plants, consistent with the timing when the growth related measurements also showed the largest differences. Using weighted gene coexpression network analysis, significant coexpression gene network module of 208 of the 620 differentially expressed genes was identified, which included 16 hub genes in the blue module, a NAC transcription factor, a MYB transcription factor, an amino acid transporter, an ammonium transporter, a xenobiotic detoxifier-glutathione S-transferase, and others. Based on the putative functions of these genes, the identification of the significant WGCNA module and the hub genes provided important insights into the molecular mechanisms of gelatin seed treatment as a biostimulant to enhance plant growth. PMID:26558288

Identification of differential pathways in papillary thyroid carcinoma utilizing pathway co-expression analysis.

PubMed

Qiu, Wei-Hai; Chen, Gui-Yan; Cui, Lu; Zhang, Ting-Ming; Wei, Feng; Yang, Yong

2016-01-01

To identify differential pathways between papillary thyroid carcinoma (PTC) patients and normal controls utilizing a novel method which combined pathway with co-expression network. The proposed method included three steps. In the first step, we conducted pretreatments for background pathways and gained representative pathways in PTC. Subsequently, a co-expression network for representative pathways was constructed using empirical Bayes (EB) approach to assign a weight value for each pathway. Finally, random model was extracted to set the thresholds of identifying differential pathways. We obtained 1267 representative pathways and their weight values based on the co-expressed pathway network, and then by meeting the criterion (Weight > 0.0296), 87 differential pathways in total across PTC patients and normal controls were identified. The top three ranked differential pathways were CREB phosphorylation, attachment of GPI anchor to urokinase plasminogen activator receptor (uPAR) and loss of function of SMAD2/3 in cancer. In conclusion, we successfully identified differential pathways (such as CREB phosphorylation, attachment of GPI anchor to uPAR and post-translational modification: synthesis of GPI-anchored proteins) for PTC using the proposed pathway co-expression method, and these pathways might be potential biomarkers for target therapy and detection of PTC.

Task-specific feature extraction and classification of fMRI volumes using a deep neural network initialized with a deep belief network: Evaluation using sensorimotor tasks

PubMed Central

Jang, Hojin; Plis, Sergey M.; Calhoun, Vince D.; Lee, Jong-Hwan

2016-01-01

Feedforward deep neural networks (DNN), artificial neural networks with multiple hidden layers, have recently demonstrated a record-breaking performance in multiple areas of applications in computer vision and speech processing. Following the success, DNNs have been applied to neuroimaging modalities including functional/structural magnetic resonance imaging (MRI) and positron-emission tomography data. However, no study has explicitly applied DNNs to 3D whole-brain fMRI volumes and thereby extracted hidden volumetric representations of fMRI that are discriminative for a task performed as the fMRI volume was acquired. Our study applied fully connected feedforward DNN to fMRI volumes collected in four sensorimotor tasks (i.e., left-hand clenching, right-hand clenching, auditory attention, and visual stimulus) undertaken by 12 healthy participants. Using a leave-one-subject-out cross-validation scheme, a restricted Boltzmann machine-based deep belief network was pretrained and used to initialize weights of the DNN. The pretrained DNN was fine-tuned while systematically controlling weight-sparsity levels across hidden layers. Optimal weight-sparsity levels were determined from a minimum validation error rate of fMRI volume classification. Minimum error rates (mean ± standard deviation; %) of 6.9 (± 3.8) were obtained from the three-layer DNN with the sparsest condition of weights across the three hidden layers. These error rates were even lower than the error rates from the single-layer network (9.4 ± 4.6) and the two-layer network (7.4 ± 4.1). The estimated DNN weights showed spatial patterns that are remarkably task-specific, particularly in the higher layers. The output values of the third hidden layer represented distinct patterns/codes of the 3D whole-brain fMRI volume and encoded the information of the tasks as evaluated from representational similarity analysis. Our reported findings show the ability of the DNN to classify a single fMRI volume based on the extraction of hidden representations of fMRI volumes associated with tasks across multiple hidden layers. Our study may be beneficial to the automatic classification/diagnosis of neuropsychiatric and neurological diseases and prediction of disease severity and recovery in (pre-) clinical settings using fMRI volumes without requiring an estimation of activation patterns or ad hoc statistical evaluation. PMID:27079534

Task-specific feature extraction and classification of fMRI volumes using a deep neural network initialized with a deep belief network: Evaluation using sensorimotor tasks.

PubMed

Jang, Hojin; Plis, Sergey M; Calhoun, Vince D; Lee, Jong-Hwan

2017-01-15

Feedforward deep neural networks (DNNs), artificial neural networks with multiple hidden layers, have recently demonstrated a record-breaking performance in multiple areas of applications in computer vision and speech processing. Following the success, DNNs have been applied to neuroimaging modalities including functional/structural magnetic resonance imaging (MRI) and positron-emission tomography data. However, no study has explicitly applied DNNs to 3D whole-brain fMRI volumes and thereby extracted hidden volumetric representations of fMRI that are discriminative for a task performed as the fMRI volume was acquired. Our study applied fully connected feedforward DNN to fMRI volumes collected in four sensorimotor tasks (i.e., left-hand clenching, right-hand clenching, auditory attention, and visual stimulus) undertaken by 12 healthy participants. Using a leave-one-subject-out cross-validation scheme, a restricted Boltzmann machine-based deep belief network was pretrained and used to initialize weights of the DNN. The pretrained DNN was fine-tuned while systematically controlling weight-sparsity levels across hidden layers. Optimal weight-sparsity levels were determined from a minimum validation error rate of fMRI volume classification. Minimum error rates (mean±standard deviation; %) of 6.9 (±3.8) were obtained from the three-layer DNN with the sparsest condition of weights across the three hidden layers. These error rates were even lower than the error rates from the single-layer network (9.4±4.6) and the two-layer network (7.4±4.1). The estimated DNN weights showed spatial patterns that are remarkably task-specific, particularly in the higher layers. The output values of the third hidden layer represented distinct patterns/codes of the 3D whole-brain fMRI volume and encoded the information of the tasks as evaluated from representational similarity analysis. Our reported findings show the ability of the DNN to classify a single fMRI volume based on the extraction of hidden representations of fMRI volumes associated with tasks across multiple hidden layers. Our study may be beneficial to the automatic classification/diagnosis of neuropsychiatric and neurological diseases and prediction of disease severity and recovery in (pre-) clinical settings using fMRI volumes without requiring an estimation of activation patterns or ad hoc statistical evaluation. Copyright © 2016 Elsevier Inc. All rights reserved.

An insect-inspired model for visual binding II: functional analysis and visual attention.

PubMed

Northcutt, Brandon D; Higgins, Charles M

2017-04-01

We have developed a neural network model capable of performing visual binding inspired by neuronal circuitry in the optic glomeruli of flies: a brain area that lies just downstream of the optic lobes where early visual processing is performed. This visual binding model is able to detect objects in dynamic image sequences and bind together their respective characteristic visual features-such as color, motion, and orientation-by taking advantage of their common temporal fluctuations. Visual binding is represented in the form of an inhibitory weight matrix which learns over time which features originate from a given visual object. In the present work, we show that information represented implicitly in this weight matrix can be used to explicitly count the number of objects present in the visual image, to enumerate their specific visual characteristics, and even to create an enhanced image in which one particular object is emphasized over others, thus implementing a simple form of visual attention. Further, we present a detailed analysis which reveals the function and theoretical limitations of the visual binding network and in this context describe a novel network learning rule which is optimized for visual binding.

Empirical study on a directed and weighted bus transport network in China

NASA Astrophysics Data System (ADS)

Feng, Shumin; Hu, Baoyu; Nie, Cen; Shen, Xianghao

2016-01-01

Bus transport networks are directed complex networks that consist of routes, stations, and passenger flow. In this study, the concept of duplication factor is introduced to analyze the differences between uplinks and downlinks for the bus transport network of Harbin (BTN-H). Further, a new representation model for BTNs is proposed, named as directed-space P. Two empirical characteristics of BTN-H are reported in this paper. First, the cumulative distributions of weighted degree, degree, number of routes that connect to each station, and node weight (peak-hour trips at a station) uniformly follow the exponential law. Meanwhile, the node weight shows positive correlations with the corresponding weighted degree, degree, and number of routes that connect to a station. Second, a new richness parameter of a node is explored by its node weight and the connectivity, weighted connectivity, average shortest path length and efficiency between rich nodes can be fitted by composite exponential functions to demonstrate the rich-club phenomenon.

Pattern Analysis in Social Networks with Dynamic Connections

NASA Astrophysics Data System (ADS)

Wu, Yu; Zhang, Yu

In this paper, we explore how decentralized local interactions of autonomous agents in a network relate to collective behaviors. Most existing work in this area models social network in which agent relations are fixed; instead, we focus on dynamic social networks where agents can rationally adjust their neighborhoods based on their individual interests. We propose a new connection evaluation rule called the Highest Weighted Reward (HWR) rule, with which agents dynamically choose their neighbors in order to maximize their own utilities based on the rewards from previous interactions. Our experiments show that in the 2-action pure coordination game, our system will stabilize to a clustering state where all relationships in the network are rewarded with the optimal payoff. Our experiments also reveal additional interesting patterns in the network.

Supercooperation in evolutionary games on correlated weighted networks.

PubMed

Buesser, Pierre; Tomassini, Marco

2012-01-01

In this work we study the behavior of classical two-person, two-strategies evolutionary games on a class of weighted networks derived from Barabási-Albert and random scale-free unweighted graphs. Using customary imitative dynamics, our numerical simulation results show that the presence of link weights that are correlated in a particular manner with the degree of the link end points leads to unprecedented levels of cooperation in the whole games' phase space, well above those found for the corresponding unweighted complex networks. We provide intuitive explanations for this favorable behavior by transforming the weighted networks into unweighted ones with particular topological properties. The resulting structures help us to understand why cooperation can thrive and also give ideas as to how such supercooperative networks might be built.

Analyzing the international exergy flow network of ferrous metal ores.

PubMed

Qi, Hai; An, Haizhong; Hao, Xiaoqing; Zhong, Weiqiong; Zhang, Yanbing

2014-01-01

This paper employs an un-weighted and weighted exergy network to study the properties of ferrous metal ores in countries worldwide and their evolution from 2002 to 2012. We find that there are few countries controlling most of the ferrous metal ore exports in terms of exergy and that the entire exergy flow network is becoming more heterogeneous though the addition of new nodes. The increasing of the average clustering coefficient indicates that the formation of an international exergy flow system and regional integration is improving. When we contrast the average out strength of exergy and the average out strength of currency, we find both similarities and differences. Prices are affected largely by human factors; thus, the growth rate of the average out strength of currency has fluctuated acutely in the eleven years from 2002 to 2012. Exergy is defined as the maximum work that can be extracted from a system and can reflect the true cost in the world, and this parameter fluctuates much less. Performing an analysis based on the two aspects of exergy and currency, we find that the network is becoming uneven.

Analyzing the International Exergy Flow Network of Ferrous Metal Ores

PubMed Central

Qi, Hai; An, Haizhong; Hao, Xiaoqing; Zhong, Weiqiong; Zhang, Yanbing

2014-01-01

This paper employs an un-weighted and weighted exergy network to study the properties of ferrous metal ores in countries worldwide and their evolution from 2002 to 2012. We find that there are few countries controlling most of the ferrous metal ore exports in terms of exergy and that the entire exergy flow network is becoming more heterogeneous though the addition of new nodes. The increasing of the average clustering coefficient indicates that the formation of an international exergy flow system and regional integration is improving. When we contrast the average out strength of exergy and the average out strength of currency, we find both similarities and differences. Prices are affected largely by human factors; thus, the growth rate of the average out strength of currency has fluctuated acutely in the eleven years from 2002 to 2012. Exergy is defined as the maximum work that can be extracted from a system and can reflect the true cost in the world, and this parameter fluctuates much less. Performing an analysis based on the two aspects of exergy and currency, we find that the network is becoming uneven. PMID:25188407

A novel method to identify pathways associated with renal cell carcinoma based on a gene co-expression network

PubMed Central

RUAN, XIYUN; LI, HONGYUN; LIU, BO; CHEN, JIE; ZHANG, SHIBAO; SUN, ZEQIANG; LIU, SHUANGQING; SUN, FAHAI; LIU, QINGYONG

2015-01-01

The aim of the present study was to develop a novel method for identifying pathways associated with renal cell carcinoma (RCC) based on a gene co-expression network. A framework was established where a co-expression network was derived from the database as well as various co-expression approaches. First, the backbone of the network based on differentially expressed (DE) genes between RCC patients and normal controls was constructed by the Search Tool for the Retrieval of Interacting Genes/Proteins (STRING) database. The differentially co-expressed links were detected by Pearson’s correlation, the empirical Bayesian (EB) approach and Weighted Gene Co-expression Network Analysis (WGCNA). The co-expressed gene pairs were merged by a rank-based algorithm. We obtained 842; 371; 2,883 and 1,595 co-expressed gene pairs from the co-expression networks of the STRING database, Pearson’s correlation EB method and WGCNA, respectively. Two hundred and eighty-one differentially co-expressed (DC) gene pairs were obtained from the merged network using this novel method. Pathway enrichment analysis based on the Kyoto Encyclopedia of Genes and Genomes (KEGG) database and the network enrichment analysis (NEA) method were performed to verify feasibility of the merged method. Results of the KEGG and NEA pathway analyses showed that the network was associated with RCC. The suggested method was computationally efficient to identify pathways associated with RCC and has been identified as a useful complement to traditional co-expression analysis. PMID:26058425

Establishing a Dynamic Self-Adaptation Learning Algorithm of the BP Neural Network and Its Applications

NASA Astrophysics Data System (ADS)

Li, Xiaofeng; Xiang, Suying; Zhu, Pengfei; Wu, Min

2015-12-01

In order to avoid the inherent deficiencies of the traditional BP neural network, such as slow convergence speed, that easily leading to local minima, poor generalization ability and difficulty in determining the network structure, the dynamic self-adaptive learning algorithm of the BP neural network is put forward to improve the function of the BP neural network. The new algorithm combines the merit of principal component analysis, particle swarm optimization, correlation analysis and self-adaptive model, hence can effectively solve the problems of selecting structural parameters, initial connection weights and thresholds and learning rates of the BP neural network. This new algorithm not only reduces the human intervention, optimizes the topological structures of BP neural networks and improves the network generalization ability, but also accelerates the convergence speed of a network, avoids trapping into local minima, and enhances network adaptation ability and prediction ability. The dynamic self-adaptive learning algorithm of the BP neural network is used to forecast the total retail sale of consumer goods of Sichuan Province, China. Empirical results indicate that the new algorithm is superior to the traditional BP network algorithm in predicting accuracy and time consumption, which shows the feasibility and effectiveness of the new algorithm.

Complexity of the heart rhythm after heart transplantation by entropy of transition network for RR-increments of RR time intervals between heartbeats.

PubMed

Makowiec, Danuta; Struzik, Zbigniew; Graff, Beata; Wdowczyk-Szulc, Joanna; Zarczynska-Buchnowiecka, Marta; Gruchala, Marcin; Rynkiewicz, Andrzej

2013-01-01

Network models have been used to capture, represent and analyse characteristics of living organisms and general properties of complex systems. The use of network representations in the characterization of time series complexity is a relatively new but quickly developing branch of time series analysis. In particular, beat-to-beat heart rate variability can be mapped out in a network of RR-increments, which is a directed and weighted graph with vertices representing RR-increments and the edges of which correspond to subsequent increments. We evaluate entropy measures selected from these network representations in records of healthy subjects and heart transplant patients, and provide an interpretation of the results.

Minimum spanning tree analysis of the human connectome.

PubMed

van Dellen, Edwin; Sommer, Iris E; Bohlken, Marc M; Tewarie, Prejaas; Draaisma, Laurijn; Zalesky, Andrew; Di Biase, Maria; Brown, Jesse A; Douw, Linda; Otte, Willem M; Mandl, René C W; Stam, Cornelis J

2018-06-01

One of the challenges of brain network analysis is to directly compare network organization between subjects, irrespective of the number or strength of connections. In this study, we used minimum spanning tree (MST; a unique, acyclic subnetwork with a fixed number of connections) analysis to characterize the human brain network to create an empirical reference network. Such a reference network could be used as a null model of connections that form the backbone structure of the human brain. We analyzed the MST in three diffusion-weighted imaging datasets of healthy adults. The MST of the group mean connectivity matrix was used as the empirical null-model. The MST of individual subjects matched this reference MST for a mean 58%-88% of connections, depending on the analysis pipeline. Hub nodes in the MST matched with previously reported locations of hub regions, including the so-called rich club nodes (a subset of high-degree, highly interconnected nodes). Although most brain network studies have focused primarily on cortical connections, cortical-subcortical connections were consistently present in the MST across subjects. Brain network efficiency was higher when these connections were included in the analysis, suggesting that these tracts may be utilized as the major neural communication routes. Finally, we confirmed that MST characteristics index the effects of brain aging. We conclude that the MST provides an elegant and straightforward approach to analyze structural brain networks, and to test network topological features of individual subjects in comparison to empirical null models. © 2018 The Authors Human Brain Mapping Published by Wiley Periodicals, Inc.

Enhanced Weight based DSR for Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Verma, Samant; Jain, Sweta

2011-12-01

Routing in ad hoc network is a great problematic, since a good routing protocol must ensure fast and efficient packet forwarding, which isn't evident in ad hoc networks. In literature there exists lot of routing protocols however they don't include all the aspects of ad hoc networks as mobility, device and medium constraints which make these protocols not efficient for some configuration and categories of ad hoc networks. Thus in this paper we propose an improvement of Weight Based DSR in order to include some of the aspects of ad hoc networks as stability, remaining battery power, load and trust factor and proposing a new approach Enhanced Weight Based DSR.

Unwinding the hairball graph: Pruning algorithms for weighted complex networks

NASA Astrophysics Data System (ADS)

Dianati, Navid

2016-01-01

Empirical networks of weighted dyadic relations often contain "noisy" edges that alter the global characteristics of the network and obfuscate the most important structures therein. Graph pruning is the process of identifying the most significant edges according to a generative null model and extracting the subgraph consisting of those edges. Here, we focus on integer-weighted graphs commonly arising when weights count the occurrences of an "event" relating the nodes. We introduce a simple and intuitive null model related to the configuration model of network generation and derive two significance filters from it: the marginal likelihood filter (MLF) and the global likelihood filter (GLF). The former is a fast algorithm assigning a significance score to each edge based on the marginal distribution of edge weights, whereas the latter is an ensemble approach which takes into account the correlations among edges. We apply these filters to the network of air traffic volume between US airports and recover a geographically faithful representation of the graph. Furthermore, compared with thresholding based on edge weight, we show that our filters extract a larger and significantly sparser giant component.

Criterion for correct recalls in associative-memory neural networks

NASA Astrophysics Data System (ADS)

Ji, Han-Bing

1992-12-01

A novel weighted outer-product learning (WOPL) scheme for associative memory neural networks (AMNNs) is presented. In the scheme, each fundamental memory is allocated a learning weight to direct its correct recall. Both the Hopfield and multiple training models are instances of the WOPL model with certain sets of learning weights. A necessary condition of choosing learning weights for the convergence property of the WOPL model is obtained through neural dynamics. A criterion for choosing learning weights for correct associative recalls of the fundamental memories is proposed. In this paper, an important parameter called signal to noise ratio gain (SNRG) is devised, and it is found out empirically that SNRGs have their own threshold values which means that any fundamental memory can be correctly recalled when its corresponding SNRG is greater than or equal to its threshold value. Furthermore, a theorem is given and some theoretical results on the conditions of SNRGs and learning weights for good associative recall performance of the WOPL model are accordingly obtained. In principle, when all SNRGs or learning weights chosen satisfy the theoretically obtained conditions, the asymptotic storage capacity of the WOPL model will grow at the greatest rate under certain known stochastic meaning for AMNNs, and thus the WOPL model can achieve correct recalls for all fundamental memories. The representative computer simulations confirm the criterion and theoretical analysis.

Automated analysis of Physarum network structure and dynamics

NASA Astrophysics Data System (ADS)

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.

Network analysis reveals strongly localized impacts of El Niño

NASA Astrophysics Data System (ADS)

Fan, Jingfang; Meng, Jun; Ashkenazy, Yosef; Havlin, Shlomo; Schellnhuber, Hans Joachim

2017-07-01

Climatic conditions influence the culture and economy of societies and the performance of economies. Specifically, El Niño as an extreme climate event is known to have notable effects on health, agriculture, industry, and conflict. Here, we construct directed and weighted climate networks based on near-surface air temperature to investigate the global impacts of El Niño and La Niña. We find that regions that are characterized by higher positive/negative network “in”-weighted links are exhibiting stronger correlations with the El Niño basin and are warmer/cooler during El Niño/La Niña periods. In contrast to non-El Niño periods, these stronger in-weighted activities are found to be concentrated in very localized areas, whereas a large fraction of the globe is not influenced by the events. The regions of localized activity vary from one El Niño (La Niña) event to another; still, some El Niño (La Niña) events are more similar to each other. We quantify this similarity using network community structure. The results and methodology reported here may be used to improve the understanding and prediction of El Niño/La Niña events and also may be applied in the investigation of other climate variables.

Network analysis reveals strongly localized impacts of El Niño.

PubMed

Fan, Jingfang; Meng, Jun; Ashkenazy, Yosef; Havlin, Shlomo; Schellnhuber, Hans Joachim

2017-07-18

Climatic conditions influence the culture and economy of societies and the performance of economies. Specifically, El Niño as an extreme climate event is known to have notable effects on health, agriculture, industry, and conflict. Here, we construct directed and weighted climate networks based on near-surface air temperature to investigate the global impacts of El Niño and La Niña. We find that regions that are characterized by higher positive/negative network "in"-weighted links are exhibiting stronger correlations with the El Niño basin and are warmer/cooler during El Niño/La Niña periods. In contrast to non-El Niño periods, these stronger in-weighted activities are found to be concentrated in very localized areas, whereas a large fraction of the globe is not influenced by the events. The regions of localized activity vary from one El Niño (La Niña) event to another; still, some El Niño (La Niña) events are more similar to each other. We quantify this similarity using network community structure. The results and methodology reported here may be used to improve the understanding and prediction of El Niño/La Niña events and also may be applied in the investigation of other climate variables.

Spectral analysis for weighted tree-like fractals

NASA Astrophysics Data System (ADS)

Dai, Meifeng; Chen, Yufei; Wang, Xiaoqian; Sun, Yu; Su, Weiyi

2018-02-01

Much information about the structural properties and dynamical aspects of a network is measured by the eigenvalues of its normalized Laplacian matrix. In this paper, we aim to present a study on the spectra of the normalized Laplacian of weighted tree-like fractals. We analytically obtain the relationship between the eigenvalues and their multiplicities for two successive generations. As an example of application of these results, we then derive closed-form expressions for their multiplicative Kirchhoff index and Kemeny's constant.

Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks IV: structuring synaptic pathways among recurrent connections.

PubMed

Gilson, Matthieu; Burkitt, Anthony N; Grayden, David B; Thomas, Doreen A; van Hemmen, J Leo

2009-12-01

In neuronal networks, the changes of synaptic strength (or weight) performed by spike-timing-dependent plasticity (STDP) are hypothesized to give rise to functional network structure. This article investigates how this phenomenon occurs for the excitatory recurrent connections of a network with fixed input weights that is stimulated by external spike trains. We develop a theoretical framework based on the Poisson neuron model to analyze the interplay between the neuronal activity (firing rates and the spike-time correlations) and the learning dynamics, when the network is stimulated by correlated pools of homogeneous Poisson spike trains. STDP can lead to both a stabilization of all the neuron firing rates (homeostatic equilibrium) and a robust weight specialization. The pattern of specialization for the recurrent weights is determined by a relationship between the input firing-rate and correlation structures, the network topology, the STDP parameters and the synaptic response properties. We find conditions for feed-forward pathways or areas with strengthened self-feedback to emerge in an initially homogeneous recurrent network.

Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jin, R; McCallen, S; Almaas, E

2007-05-28

Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of complex networks have mainly focused on their network topology. However, in many real world applications, the edges and vertices have associated attributes that are frequently represented as vertex or edge weights. Furthermore, these weights are often not static, instead changing with time and forming a time series. Hence, to fully understand the dynamics of the complex network, we have to consider both network topology and related time series data. In this work, we propose a motifmore » mining approach to identify trend motifs for such purposes. Simply stated, a trend motif describes a recurring subgraph where each of its vertices or edges displays similar dynamics over a userdefined period. Given this, each trend motif occurrence can help reveal significant events in a complex system; frequent trend motifs may aid in uncovering dynamic rules of change for the system, and the distribution of trend motifs may characterize the global dynamics of the system. Here, we have developed efficient mining algorithms to extract trend motifs. Our experimental validation using three disparate empirical datasets, ranging from the stock market, world trade, to a protein interaction network, has demonstrated the efficiency and effectiveness of our approach.« less

Computation and Learning in Neural Networks With Binary Weights

DTIC Science & Technology

1992-11-28

alternatively, the total number of component updates before convergence is 0(n 3 ). We follow this with an average case analysis, similar in flavour to...anecdotal evidence in support of it in ’Well, maybe an imp. I I situations where the network has a more "distributed" flavour with relatively dense...Within the hipocampus, there is a three stage sequence of processing consisting of granule cells (which 3 receive from the entorhinal cortex), the CA3

A Statistical Discrimination Experiment for Eurasian Events Using a Twenty-Seven-Station Network

DTIC Science & Technology

1980-07-08

to test the effectiveness of a multivariate method of analysis for distinguishing earthquakes from explosions. The data base for the experiment...to test the effectiveness of a multivariate method of analysis for distinguishing earthquakes from explosions. The data base for the experiment...the weight assigned to each variable whenever a new one is added. Jennrich, R. I. (1977). Stepwise discriminant analysis , in Statistical Methods for

Effects of Vertex Activity and Self-organized Criticality Behavior on a Weighted Evolving Network

NASA Astrophysics Data System (ADS)

Zhang, Gui-Qing; Yang, Qiu-Ying; Chen, Tian-Lun

2008-08-01

Effects of vertex activity have been analyzed on a weighted evolving network. The network is characterized by the probability distribution of vertex strength, each edge weight and evolution of the strength of vertices with different vertex activities. The model exhibits self-organized criticality behavior. The probability distribution of avalanche size for different network sizes is also shown. In addition, there is a power law relation between the size and the duration of an avalanche and the average of avalanche size has been studied for different vertex activities.

Limitations of opto-electronic neural networks

NASA Technical Reports Server (NTRS)

Yu, Jeffrey; Johnston, Alan; Psaltis, Demetri; Brady, David

1989-01-01

Consideration is given to the limitations of implementing neurons, weights, and connections in neural networks for electronics and optics. It is shown that the advantages of each technology are utilized when electronically fabricated neurons are included and a combination of optics and electronics are employed for the weights and connections. The relationship between the types of neural networks being constructed and the choice of technologies to implement the weights and connections is examined.

A Real-World Network Modeling Project

DTIC Science & Technology

2014-02-12

about the project, which accounts for a third of their class grade. As can be expected, giving substantial weight to the project increases active student...analysis, humanitarian aid warehouses, Israeli traffic analysis, London Olympic Games transport, medical evacuation, Monterey fire department...responsiveness, Monterey Peninsula evacuation, natural gas pipeline transport, rail transport of new cars, ski lifts for Keystone Colorado, small boat attack

Cognitive-behavioural treatment for weight loss in primary care: a prospective study.

PubMed

Eichler, Klaus; Zoller, Marco; Steurer, Johann; Bachmann, Lucas M

2007-09-08

Cognitive-behavioural treatment (CBT) is effective for weight loss in obese patients, but such programmes are difficult to implement in primary care. We assessed whether implementation of a community-based CBT weight loss programme for adults in routine care is feasible and prospectively assessed patient outcome. The weight loss programme was provided by a network of Swiss general practitioners in cooperation with a community centre for health education. We chose a five-step strategy focusing on structure of care rather than primarily addressing individual physician behaviour. A multidisciplinary core group of trained CBT instructors acted as the central element of the programme. Overweight and obese adults from the community (BMI >25 kg/m2) were included. We used a patient perspective to report the impact on delivery of care and assessed weight change of consecutive participants prospectively with a follow-up of 12 months. Twenty-eight courses, with 16 group meetings each, were initiated over a period of 3 years. 44 of 110 network physicians referred patients to the programme. 147 of 191 study participants were monitored for one year (attrition rate: 23%). Median weight loss after 12 months for 147 completers was 4 kg (IQR: 1-7 kg; intention-to-treat analysis for 191 participants: 2 kg, IQR: 0-5 kg). The programme produced a clinically meaningful weight loss in our participants, with a relatively low attrition rate. Implementation of an easily accessible CBT programme for weight loss in daily routine primary care is feasible.

A review and analysis of neural networks for classification of remotely sensed multispectral imagery

NASA Technical Reports Server (NTRS)

Paola, Justin D.; Schowengerdt, Robert A.

1993-01-01

A literature survey and analysis of the use of neural networks for the classification of remotely sensed multispectral imagery is presented. As part of a brief mathematical review, the backpropagation algorithm, which is the most common method of training multi-layer networks, is discussed with an emphasis on its application to pattern recognition. The analysis is divided into five aspects of neural network classification: (1) input data preprocessing, structure, and encoding; (2) output encoding and extraction of classes; (3) network architecture, (4) training algorithms; and (5) comparisons to conventional classifiers. The advantages of the neural network method over traditional classifiers are its non-parametric nature, arbitrary decision boundary capabilities, easy adaptation to different types of data and input structures, fuzzy output values that can enhance classification, and good generalization for use with multiple images. The disadvantages of the method are slow training time, inconsistent results due to random initial weights, and the requirement of obscure initialization values (e.g., learning rate and hidden layer size). Possible techniques for ameliorating these problems are discussed. It is concluded that, although the neural network method has several unique capabilities, it will become a useful tool in remote sensing only if it is made faster, more predictable, and easier to use.

Revisiting Robustness and Evolvability: Evolution in Weighted Genotype Spaces

PubMed Central

Partha, Raghavendran; Raman, Karthik

2014-01-01

Robustness and evolvability are highly intertwined properties of biological systems. The relationship between these properties determines how biological systems are able to withstand mutations and show variation in response to them. Computational studies have explored the relationship between these two properties using neutral networks of RNA sequences (genotype) and their secondary structures (phenotype) as a model system. However, these studies have assumed every mutation to a sequence to be equally likely; the differences in the likelihood of the occurrence of various mutations, and the consequence of probabilistic nature of the mutations in such a system have previously been ignored. Associating probabilities to mutations essentially results in the weighting of genotype space. We here perform a comparative analysis of weighted and unweighted neutral networks of RNA sequences, and subsequently explore the relationship between robustness and evolvability. We show that assuming an equal likelihood for all mutations (as in an unweighted network), underestimates robustness and overestimates evolvability of a system. In spite of discarding this assumption, we observe that a negative correlation between sequence (genotype) robustness and sequence evolvability persists, and also that structure (phenotype) robustness promotes structure evolvability, as observed in earlier studies using unweighted networks. We also study the effects of base composition bias on robustness and evolvability. Particularly, we explore the association between robustness and evolvability in a sequence space that is AU-rich – sequences with an AU content of 80% or higher, compared to a normal (unbiased) sequence space. We find that evolvability of both sequences and structures in an AU-rich space is lesser compared to the normal space, and robustness higher. We also observe that AU-rich populations evolving on neutral networks of phenotypes, can access less phenotypic variation compared to normal populations evolving on neutral networks. PMID:25390641

Dynamic weight evolution network with preferential attachment

NASA Astrophysics Data System (ADS)

Dai, Meifeng; Xie, Qi; Li, Lei

2014-12-01

A dynamic weight evolution network with preferential attachment is introduced. The network includes two significant characteristics. (i) Topological growth: triggered by newly added node with M links at each time step, each new edge carries an initial weight growing nonlinearly with time. (ii) Weight dynamics: the weight between two existing nodes experiences increasing or decreasing in a nonlinear way. By using continuum theory and mean-field method, we study the strength, the degree, the weight and their distributions. We find that the distributions exhibit a power-law feature. In particular, the relationship between the degree and the strength is nonlinear, and the power-law exponents of the three are the same. All the theoretical predictions are successfully contrasted with numerical simulations.

Nonparametric weighted stochastic block models

NASA Astrophysics Data System (ADS)

Peixoto, Tiago P.

2018-01-01

We present a Bayesian formulation of weighted stochastic block models that can be used to infer the large-scale modular structure of weighted networks, including their hierarchical organization. Our method is nonparametric, and thus does not require the prior knowledge of the number of groups or other dimensions of the model, which are instead inferred from data. We give a comprehensive treatment of different kinds of edge weights (i.e., continuous or discrete, signed or unsigned, bounded or unbounded), as well as arbitrary weight transformations, and describe an unsupervised model selection approach to choose the best network description. We illustrate the application of our method to a variety of empirical weighted networks, such as global migrations, voting patterns in congress, and neural connections in the human brain.

A Mediterranean diet improves HbA1c but not fasting blood glucose compared to alternative dietary strategies: a network meta-analysis.

PubMed

Carter, P; Achana, F; Troughton, J; Gray, L J; Khunti, K; Davies, M J

2014-06-01

Overweight or obese individuals with type 2 diabetes are encouraged to lose weight for optimal glucose management, yet many find this difficult. Determining whether alterations in dietary patterns irrespective of weight loss can aid glucose control has not been fully investigated. We conducted a systematic review and meta-analysis aiming to determine the effects of a Mediterranean diet compared to other dietary interventions on glycaemic control irrespective of weight loss. Electronic databases were searched for controlled trials that included a Mediterranean diet intervention. The interventions included all major components of the Mediterranean diet and were carried out in free-living individuals at high risk or diagnosed with type 2 diabetes. Network meta-analysis compared all interventions with one another at the same time as maintaining randomisation. Analyses were conducted within a Bayesian framework. Eight studies met the inclusion criteria, seven examined fasting blood glucose (n = 972), six examined fasting insulin (n = 1330) and three examined HbA1c (n = 487). None of the interventions were significantly better than the others in lowering glucose parameters. The Mediterranean diet reduced HbA1c significantly compared to usual care but not compared to the Palaeolithic diet. The effect of alterations in dietary practice irrespective of weight loss on glycaemic control cannot be concluded from the present review. The need for further research in this area is apparent because no firm conclusions about relative effectiveness of interventions could be drawn as a result of the paucity of the evidence. © 2013 The British Dietetic Association Ltd.

Vehicle Signal Analysis Using Artificial Neural Networks for a Bridge Weigh-in-Motion System

PubMed Central

Kim, Sungkon; Lee, Jungwhee; Park, Min-Seok; Jo, Byung-Wan

2009-01-01

This paper describes the procedures for development of signal analysis algorithms using artificial neural networks for Bridge Weigh-in-Motion (B-WIM) systems. Through the analysis procedure, the extraction of information concerning heavy traffic vehicles such as weight, speed, and number of axles from the time domain strain data of the B-WIM system was attempted. As one of the several possible pattern recognition techniques, an Artificial Neural Network (ANN) was employed since it could effectively include dynamic effects and bridge-vehicle interactions. A number of vehicle traveling experiments with sufficient load cases were executed on two different types of bridges, a simply supported pre-stressed concrete girder bridge and a cable-stayed bridge. Different types of WIM systems such as high-speed WIM or low-speed WIM were also utilized during the experiments for cross-checking and to validate the performance of the developed algorithms. PMID:22408487

Vehicle Signal Analysis Using Artificial Neural Networks for a Bridge Weigh-in-Motion System.

PubMed

Kim, Sungkon; Lee, Jungwhee; Park, Min-Seok; Jo, Byung-Wan

2009-01-01

This paper describes the procedures for development of signal analysis algorithms using artificial neural networks for Bridge Weigh-in-Motion (B-WIM) systems. Through the analysis procedure, the extraction of information concerning heavy traffic vehicles such as weight, speed, and number of axles from the time domain strain data of the B-WIM system was attempted. As one of the several possible pattern recognition techniques, an Artificial Neural Network (ANN) was employed since it could effectively include dynamic effects and bridge-vehicle interactions. A number of vehicle traveling experiments with sufficient load cases were executed on two different types of bridges, a simply supported pre-stressed concrete girder bridge and a cable-stayed bridge. Different types of WIM systems such as high-speed WIM or low-speed WIM were also utilized during the experiments for cross-checking and to validate the performance of the developed algorithms.

An Enhanced K-Means Algorithm for Water Quality Analysis of The Haihe River in China

PubMed Central

Zou, Hui; Zou, Zhihong; Wang, Xiaojing

2015-01-01

The increase and the complexity of data caused by the uncertain environment is today’s reality. In order to identify water quality effectively and reliably, this paper presents a modified fast clustering algorithm for water quality analysis. The algorithm has adopted a varying weights K-means cluster algorithm to analyze water monitoring data. The varying weights scheme was the best weighting indicator selected by a modified indicator weight self-adjustment algorithm based on K-means, which is named MIWAS-K-means. The new clustering algorithm avoids the margin of the iteration not being calculated in some cases. With the fast clustering analysis, we can identify the quality of water samples. The algorithm is applied in water quality analysis of the Haihe River (China) data obtained by the monitoring network over a period of eight years (2006–2013) with four indicators at seven different sites (2078 samples). Both the theoretical and simulated results demonstrate that the algorithm is efficient and reliable for water quality analysis of the Haihe River. In addition, the algorithm can be applied to more complex data matrices with high dimensionality. PMID:26569283

Innovation Analysis Approach to Design Parameters of High Speed Train Carriage and Their Intrinsic Complexity Relationships

NASA Astrophysics Data System (ADS)

Xiao, Shou-Ne; Wang, Ming-Meng; Hu, Guang-Zhong; Yang, Guang-Wu

2017-09-01

In view of the problem that it's difficult to accurately grasp the influence range and transmission path of the vehicle top design requirements on the underlying design parameters. Applying directed-weighted complex network to product parameter model is an important method that can clarify the relationships between product parameters and establish the top-down design of a product. The relationships of the product parameters of each node are calculated via a simple path searching algorithm, and the main design parameters are extracted by analysis and comparison. A uniform definition of the index formula for out-in degree can be provided based on the analysis of out-in-degree width and depth and control strength of train carriage body parameters. Vehicle gauge, axle load, crosswind and other parameters with higher values of the out-degree index are the most important boundary conditions; the most considerable performance indices are the parameters that have higher values of the out-in-degree index including torsional stiffness, maximum testing speed, service life of the vehicle, and so on; the main design parameters contain train carriage body weight, train weight per extended metre, train height and other parameters with higher values of the in-degree index. The network not only provides theoretical guidance for exploring the relationship of design parameters, but also further enriches the application of forward design method to high-speed trains.

The Role of Vitamin D in the Transcriptional Program of Human Pregnancy

PubMed Central

Al-Garawi, Amal; Carey, Vincent J.; Chhabra, Divya; Morrow, Jarrett; Lasky-Su, Jessica; Qiu, Weiliang; Laranjo, Nancy; Litonjua, Augusto A.; Weiss, Scott T.

2016-01-01

Background Patterns of gene expression of human pregnancy are poorly understood. In a trial of vitamin D supplementation in pregnant women, peripheral blood transcriptomes were measured longitudinally on 30 women and used to characterize gene co-expression networks. Objective Studies suggest that increased maternal Vitamin D levels may reduce the risk of asthma in early life, yet the underlying mechanisms have not been examined. In this study, we used a network-based approach to examine changes in gene expression profiles during the course of normal pregnancy and evaluated their association with maternal Vitamin D levels. Design The VDAART study is a randomized clinical trial of vitamin D supplementation in pregnancy for reduction of pediatric asthma risk. The trial enrolled 881 women at 10–18 weeks of gestation. Longitudinal gene expression measures were obtained on thirty pregnant women, using RNA isolated from peripheral blood samples obtained in the first and third trimesters. Differentially expressed genes were identified using significance of analysis of microarrays (SAM), and clustered using a weighted gene co-expression network analysis (WGCNA). Gene-set enrichment was performed to identify major biological pathways. Results Comparison of transcriptional profiles between first and third trimesters of pregnancy identified 5839 significantly differentially expressed genes (FDR<0.05). Weighted gene co-expression network analysis clustered these transcripts into 14 co-expression modules of which two showed significant correlation with maternal vitamin D levels. Pathway analysis of these two modules revealed genes enriched in immune defense pathways and extracellular matrix reorganization as well as genes enriched in notch signaling and transcription factor networks. Conclusion Our data show that gene expression profiles of healthy pregnant women change during the course of pregnancy and suggest that maternal Vitamin D levels influence transcriptional profiles. These alterations of the maternal transcriptome may contribute to fetal immune imprinting and reduce allergic sensitization in early life. Trial Registration clinicaltrials.gov NCT00920621 PMID:27711190

Multi-parametric centrality method for graph network models

NASA Astrophysics Data System (ADS)

Ivanov, Sergei Evgenievich; Gorlushkina, Natalia Nikolaevna; Ivanova, Lubov Nikolaevna

2018-04-01

The graph model networks are investigated to determine centrality, weights and the significance of vertices. For centrality analysis appliesa typical method that includesany one of the properties of graph vertices. In graph theory, methods of analyzing centrality are used: in terms by degree, closeness, betweenness, radiality, eccentricity, page-rank, status, Katz and eigenvector. We have proposed a new method of multi-parametric centrality, which includes a number of basic properties of the network member. The mathematical model of multi-parametric centrality method is developed. Comparison of results for the presented method with the centrality methods is carried out. For evaluate the results for the multi-parametric centrality methodthe graph model with hundreds of vertices is analyzed. The comparative analysis showed the accuracy of presented method, includes simultaneously a number of basic properties of vertices.

Identifying Repetitive Institutional Review Board Stipulations by Natural Language Processing and Network Analysis.

PubMed

Kury, Fabrício S P; Cimino, James J

2015-01-01

The corrections ("stipulations") to a proposed research study protocol produced by an institutional review board (IRB) can often be repetitive across many studies; however, there is no standard set of stipulations that could be used, for example, by researchers wishing to anticipate and correct problems in their research proposals prior to submitting to an IRB. The objective of the research was to computationally identify the most repetitive types of stipulations generated in the course of IRB deliberations. The text of each stipulation was normalized using the natural language processing techniques. An undirected weighted network was constructed in which each stipulation was represented by a node, and each link, if present, had weight corresponding to the TF-IDF Cosine Similarity of the stipulations. Network analysis software was then used to identify clusters in the network representing similar stipulations. The final results were correlated with additional data to produce further insights about the IRB workflow. From a corpus of 18,582 stipulations we identified 31 types of repetitive stipulations. Those types accounted for 3,870 stipulations (20.8% of the corpus) produced for 697 (88.7%) of all protocols in 392 (also 88.7%) of all the CNS IRB meetings with stipulations entered in our data source. A notable peroportion of the corrections produced by the IRB can be considered highly repetitive. Our shareable method relied on a minimal manual analysis and provides an intuitive exploration with theoretically unbounded granularity. Finer granularity allowed for the insight that is anticipated to prevent the need for identifying the IRB panel expertise or any human supervision.

Context-aided analysis of community evolution in networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pallotta, Giuliana; Konjevod, Goran; Cadena, Jose

Here, we are interested in detecting and analyzing global changes in dynamic networks (networks that evolve with time). More precisely, we consider changes in the activity distribution within the network, in terms of density (ie, edge existence) and intensity (ie, edge weight). Detecting change in local properties, as well as individual measurements or metrics, has been well studied and often reduces to traditional statistical process control. In contrast, detecting change in larger scale structure of the network is more challenging and not as well understood. We address this problem by proposing a framework for detecting change in network structure basedmore » on separate pieces: a probabilistic model for partitioning nodes by their behavior, a label-unswitching heuristic, and an approach to change detection for sequences of complex objects. We examine the performance of one instantiation of such a framework using mostly previously available pieces. The dataset we use for these investigations is the publicly available New York City Taxi and Limousine Commission dataset covering all taxi trips in New York City since 2009. Using it, we investigate the evolution of an ensemble of networks under different spatiotemporal resolutions. We identify the community structure by fitting a weighted stochastic block model. In conclusion, we offer insights on different node ranking and clustering methods, their ability to capture the rhythm of life in the Big Apple, and their potential usefulness in highlighting changes in the underlying network structure.« less

Context-aided analysis of community evolution in networks

DOE PAGES

Pallotta, Giuliana; Konjevod, Goran; Cadena, Jose; ...

2017-09-15

Here, we are interested in detecting and analyzing global changes in dynamic networks (networks that evolve with time). More precisely, we consider changes in the activity distribution within the network, in terms of density (ie, edge existence) and intensity (ie, edge weight). Detecting change in local properties, as well as individual measurements or metrics, has been well studied and often reduces to traditional statistical process control. In contrast, detecting change in larger scale structure of the network is more challenging and not as well understood. We address this problem by proposing a framework for detecting change in network structure basedmore » on separate pieces: a probabilistic model for partitioning nodes by their behavior, a label-unswitching heuristic, and an approach to change detection for sequences of complex objects. We examine the performance of one instantiation of such a framework using mostly previously available pieces. The dataset we use for these investigations is the publicly available New York City Taxi and Limousine Commission dataset covering all taxi trips in New York City since 2009. Using it, we investigate the evolution of an ensemble of networks under different spatiotemporal resolutions. We identify the community structure by fitting a weighted stochastic block model. In conclusion, we offer insights on different node ranking and clustering methods, their ability to capture the rhythm of life in the Big Apple, and their potential usefulness in highlighting changes in the underlying network structure.« less

Connectivity Strength-Weighted Sparse Group Representation-Based Brain Network Construction for MCI Classification

PubMed Central

Yu, Renping; Zhang, Han; An, Le; Chen, Xiaobo; Wei, Zhihui; Shen, Dinggang

2017-01-01

Brain functional network analysis has shown great potential in understanding brain functions and also in identifying biomarkers for brain diseases, such as Alzheimer's disease (AD) and its early stage, mild cognitive impairment (MCI). In these applications, accurate construction of biologically meaningful brain network is critical. Sparse learning has been widely used for brain network construction; however, its l1-norm penalty simply penalizes each edge of a brain network equally, without considering the original connectivity strength which is one of the most important inherent linkwise characters. Besides, based on the similarity of the linkwise connectivity, brain network shows prominent group structure (i.e., a set of edges sharing similar attributes). In this article, we propose a novel brain functional network modeling framework with a “connectivity strength-weighted sparse group constraint.” In particular, the network modeling can be optimized by considering both raw connectivity strength and its group structure, without losing the merit of sparsity. Our proposed method is applied to MCI classification, a challenging task for early AD diagnosis. Experimental results based on the resting-state functional MRI, from 50 MCI patients and 49 healthy controls, show that our proposed method is more effective (i.e., achieving a significantly higher classification accuracy, 84.8%) than other competing methods (e.g., sparse representation, accuracy = 65.6%). Post hoc inspection of the informative features further shows more biologically meaningful brain functional connectivities obtained by our proposed method. PMID:28150897

Spectral analysis and slow spreading dynamics on complex networks.

PubMed

Odor, Géza

2013-09-01

The susceptible-infected-susceptible (SIS) model is one of the simplest memoryless systems for describing information or epidemic spreading phenomena with competing creation and spontaneous annihilation reactions. The effect of quenched disorder on the dynamical behavior has recently been compared to quenched mean-field (QMF) approximations in scale-free networks. QMF can take into account topological heterogeneity and clustering effects of the activity in the steady state by spectral decomposition analysis of the adjacency matrix. Therefore, it can provide predictions on possible rare-region effects, thus on the occurrence of slow dynamics. I compare QMF results of SIS with simulations on various large dimensional graphs. In particular, I show that for Erdős-Rényi graphs this method predicts correctly the occurrence of rare-region effects. It also provides a good estimate for the epidemic threshold in case of percolating graphs. Griffiths Phases emerge if the graph is fragmented or if we apply a strong, exponentially suppressing weighting scheme on the edges. The latter model describes the connection time distributions in the face-to-face experiments. In case of a generalized Barabási-Albert type of network with aging connections, strong rare-region effects and numerical evidence for Griffiths Phase dynamics are shown. The dynamical simulation results agree well with the predictions of the spectral analysis applied for the weighted adjacency matrices.

Cluster Analysis of Weighted Bipartite Networks: A New Copula-Based Approach

PubMed Central

Chessa, Alessandro; Crimaldi, Irene; Riccaboni, Massimo; Trapin, Luca

2014-01-01

In this work we are interested in identifying clusters of “positional equivalent” actors, i.e. actors who play a similar role in a system. In particular, we analyze weighted bipartite networks that describes the relationships between actors on one side and features or traits on the other, together with the intensity level to which actors show their features. We develop a methodological approach that takes into account the underlying multivariate dependence among groups of actors. The idea is that positions in a network could be defined on the basis of the similar intensity levels that the actors exhibit in expressing some features, instead of just considering relationships that actors hold with each others. Moreover, we propose a new clustering procedure that exploits the potentiality of copula functions, a mathematical instrument for the modelization of the stochastic dependence structure. Our clustering algorithm can be applied both to binary and real-valued matrices. We validate it with simulations and applications to real-world data. PMID:25303095

A mass weighted chemical elastic network model elucidates closed form domain motions in proteins

PubMed Central

Kim, Min Hyeok; Seo, Sangjae; Jeong, Jay Il; Kim, Bum Joon; Liu, Wing Kam; Lim, Byeong Soo; Choi, Jae Boong; Kim, Moon Ki

2013-01-01

An elastic network model (ENM), usually Cα coarse-grained one, has been widely used to study protein dynamics as an alternative to classical molecular dynamics simulation. This simple approach dramatically saves the computational cost, but sometimes fails to describe a feasible conformational change due to unrealistically excessive spring connections. To overcome this limitation, we propose a mass-weighted chemical elastic network model (MWCENM) in which the total mass of each residue is assumed to be concentrated on the representative alpha carbon atom and various stiffness values are precisely assigned according to the types of chemical interactions. We test MWCENM on several well-known proteins of which both closed and open conformations are available as well as three α-helix rich proteins. Their normal mode analysis reveals that MWCENM not only generates more plausible conformational changes, especially for closed forms of proteins, but also preserves protein secondary structures thus distinguishing MWCENM from traditional ENMs. In addition, MWCENM also reduces computational burden by using a more sparse stiffness matrix. PMID:23456820

Fuzzy logic and neural networks in artificial intelligence and pattern recognition

NASA Astrophysics Data System (ADS)

Sanchez, Elie

1991-10-01

With the use of fuzzy logic techniques, neural computing can be integrated in symbolic reasoning to solve complex real world problems. In fact, artificial neural networks, expert systems, and fuzzy logic systems, in the context of approximate reasoning, share common features and techniques. A model of Fuzzy Connectionist Expert System is introduced, in which an artificial neural network is designed to construct the knowledge base of an expert system from, training examples (this model can also be used for specifications of rules in fuzzy logic control). Two types of weights are associated with the synaptic connections in an AND-OR structure: primary linguistic weights, interpreted as labels of fuzzy sets, and secondary numerical weights. Cell activation is computed through min-max fuzzy equations of the weights. Learning consists in finding the (numerical) weights and the network topology. This feedforward network is described and first illustrated in a biomedical application (medical diagnosis assistance from inflammatory-syndromes/proteins profiles). Then, it is shown how this methodology can be utilized for handwritten pattern recognition (characters play the role of diagnoses): in a fuzzy neuron describing a number for example, the linguistic weights represent fuzzy sets on cross-detecting lines and the numerical weights reflect the importance (or weakness) of connections between cross-detecting lines and characters.

Cortical Dynamics in Presence of Assemblies of Densely Connected Weight-Hub Neurons

PubMed Central

Setareh, Hesam; Deger, Moritz; Petersen, Carl C. H.; Gerstner, Wulfram

2017-01-01

Experimental measurements of pairwise connection probability of pyramidal neurons together with the distribution of synaptic weights have been used to construct randomly connected model networks. However, several experimental studies suggest that both wiring and synaptic weight structure between neurons show statistics that differ from random networks. Here we study a network containing a subset of neurons which we call weight-hub neurons, that are characterized by strong inward synapses. We propose a connectivity structure for excitatory neurons that contain assemblies of densely connected weight-hub neurons, while the pairwise connection probability and synaptic weight distribution remain consistent with experimental data. Simulations of such a network with generalized integrate-and-fire neurons display regular and irregular slow oscillations akin to experimentally observed up/down state transitions in the activity of cortical neurons with a broad distribution of pairwise spike correlations. Moreover, stimulation of a model network in the presence or absence of assembly structure exhibits responses similar to light-evoked responses of cortical layers in optogenetically modified animals. We conclude that a high connection probability into and within assemblies of excitatory weight-hub neurons, as it likely is present in some but not all cortical layers, changes the dynamics of a layer of cortical microcircuitry significantly. PMID:28690508

Improved Neural Networks with Random Weights for Short-Term Load Forecasting

PubMed Central

Lang, Kun; Zhang, Mingyuan; Yuan, Yongbo

2015-01-01

An effective forecasting model for short-term load plays a significant role in promoting the management efficiency of an electric power system. This paper proposes a new forecasting model based on the improved neural networks with random weights (INNRW). The key is to introduce a weighting technique to the inputs of the model and use a novel neural network to forecast the daily maximum load. Eight factors are selected as the inputs. A mutual information weighting algorithm is then used to allocate different weights to the inputs. The neural networks with random weights and kernels (KNNRW) is applied to approximate the nonlinear function between the selected inputs and the daily maximum load due to the fast learning speed and good generalization performance. In the application of the daily load in Dalian, the result of the proposed INNRW is compared with several previously developed forecasting models. The simulation experiment shows that the proposed model performs the best overall in short-term load forecasting. PMID:26629825

Improved Neural Networks with Random Weights for Short-Term Load Forecasting.

PubMed

Lang, Kun; Zhang, Mingyuan; Yuan, Yongbo

2015-01-01

An effective forecasting model for short-term load plays a significant role in promoting the management efficiency of an electric power system. This paper proposes a new forecasting model based on the improved neural networks with random weights (INNRW). The key is to introduce a weighting technique to the inputs of the model and use a novel neural network to forecast the daily maximum load. Eight factors are selected as the inputs. A mutual information weighting algorithm is then used to allocate different weights to the inputs. The neural networks with random weights and kernels (KNNRW) is applied to approximate the nonlinear function between the selected inputs and the daily maximum load due to the fast learning speed and good generalization performance. In the application of the daily load in Dalian, the result of the proposed INNRW is compared with several previously developed forecasting models. The simulation experiment shows that the proposed model performs the best overall in short-term load forecasting.

A Multi-level Fuzzy Evaluation Method for Smart Distribution Network Based on Entropy Weight

NASA Astrophysics Data System (ADS)

Li, Jianfang; Song, Xiaohui; Gao, Fei; Zhang, Yu

2017-05-01

Smart distribution network is considered as the future trend of distribution network. In order to comprehensive evaluate smart distribution construction level and give guidance to the practice of smart distribution construction, a multi-level fuzzy evaluation method based on entropy weight is proposed. Firstly, focus on both the conventional characteristics of distribution network and new characteristics of smart distribution network such as self-healing and interaction, a multi-level evaluation index system which contains power supply capability, power quality, economy, reliability and interaction is established. Then, a combination weighting method based on Delphi method and entropy weight method is put forward, which take into account not only the importance of the evaluation index in the experts’ subjective view, but also the objective and different information from the index values. Thirdly, a multi-level evaluation method based on fuzzy theory is put forward. Lastly, an example is conducted based on the statistical data of some cites’ distribution network and the evaluation method is proved effective and rational.

Neural network for processing both spatial and temporal data with time based back-propagation

NASA Technical Reports Server (NTRS)

Villarreal, James A. (Inventor); Shelton, Robert O. (Inventor)

1993-01-01

Neural networks are computing systems modeled after the paradigm of the biological brain. For years, researchers using various forms of neural networks have attempted to model the brain's information processing and decision-making capabilities. Neural network algorithms have impressively demonstrated the capability of modeling spatial information. On the other hand, the application of parallel distributed models to the processing of temporal data has been severely restricted. The invention introduces a novel technique which adds the dimension of time to the well known back-propagation neural network algorithm. In the space-time neural network disclosed herein, the synaptic weights between two artificial neurons (processing elements) are replaced with an adaptable-adjustable filter. Instead of a single synaptic weight, the invention provides a plurality of weights representing not only association, but also temporal dependencies. In this case, the synaptic weights are the coefficients to the adaptable digital filters. Novelty is believed to lie in the disclosure of a processing element and a network of the processing elements which are capable of processing temporal as well as spacial data.

Weighting for sex acts to understand the spread of STI on networks.

PubMed

Moslonka-Lefebvre, Mathieu; Bonhoeffer, Sebastian; Alizon, Samuel

2012-10-21

Human sexual networks exhibit a heterogeneous structure where few individuals have many partners and many individuals have few partners. Network theory predicts that the spread of sexually transmitted infections (STI) on such networks should exhibit striking properties (e.g. rapid spread). However, these properties cannot be found in epidemiological data. Current network models typically assume a constant STI transmission risk per partnership, which is unrealistic because it implies that sexual activity is proportional to the number of partners and that individuals have the same activity with each partner. We develop a framework that allows us to weight any sexual network based on biological assumptions. Our results indicate that STI spreading on the resulting weighted networks do not have heterogeneous-related properties, which is consistent with data and earlier studies. Copyright © 2012 Elsevier Ltd. All rights reserved.

Estimating multi-period global cost efficiency and productivity change of systems with network structures

NASA Astrophysics Data System (ADS)

Tohidnia, S.; Tohidi, G.

2018-02-01

The current paper develops three different ways to measure the multi-period global cost efficiency for homogeneous networks of processes when the prices of exogenous inputs are known at all time periods. A multi-period network data envelopment analysis model is presented to measure the minimum cost of the network system based on the global production possibility set. We show that there is a relationship between the multi-period global cost efficiency of network system and its subsystems, and also its processes. The proposed model is applied to compute the global cost Malmquist productivity index for measuring the productivity changes of network system and each of its process between two time periods. This index is circular. Furthermore, we show that the productivity changes of network system can be defined as a weighted average of the process productivity changes. Finally, a numerical example will be presented to illustrate the proposed approach.

Fault detection for hydraulic pump based on chaotic parallel RBF network

NASA Astrophysics Data System (ADS)

Lu, Chen; Ma, Ning; Wang, Zhipeng

2011-12-01

In this article, a parallel radial basis function network in conjunction with chaos theory (CPRBF network) is presented, and applied to practical fault detection for hydraulic pump, which is a critical component in aircraft. The CPRBF network consists of a number of radial basis function (RBF) subnets connected in parallel. The number of input nodes for each RBF subnet is determined by different embedding dimension based on chaotic phase-space reconstruction. The output of CPRBF is a weighted sum of all RBF subnets. It was first trained using the dataset from normal state without fault, and then a residual error generator was designed to detect failures based on the trained CPRBF network. Then, failure detection can be achieved by the analysis of the residual error. Finally, two case studies are introduced to compare the proposed CPRBF network with traditional RBF networks, in terms of prediction and detection accuracy.

A systematic approach to infer biological relevance and biases of gene network structures.

PubMed

Antonov, Alexey V; Tetko, Igor V; Mewes, Hans W

2006-01-10

The development of high-throughput technologies has generated the need for bioinformatics approaches to assess the biological relevance of gene networks. Although several tools have been proposed for analysing the enrichment of functional categories in a set of genes, none of them is suitable for evaluating the biological relevance of the gene network. We propose a procedure and develop a web-based resource (BIOREL) to estimate the functional bias (biological relevance) of any given genetic network by integrating different sources of biological information. The weights of the edges in the network may be either binary or continuous. These essential features make our web tool unique among many similar services. BIOREL provides standardized estimations of the network biases extracted from independent data. By the analyses of real data we demonstrate that the potential application of BIOREL ranges from various benchmarking purposes to systematic analysis of the network biology.

Scaling of global input-output networks

NASA Astrophysics Data System (ADS)

Liang, Sai; Qi, Zhengling; Qu, Shen; Zhu, Ji; Chiu, Anthony S. F.; Jia, Xiaoping; Xu, Ming

2016-06-01

Examining scaling patterns of networks can help understand how structural features relate to the behavior of the networks. Input-output networks consist of industries as nodes and inter-industrial exchanges of products as links. Previous studies consider limited measures for node strengths and link weights, and also ignore the impact of dataset choice. We consider a comprehensive set of indicators in this study that are important in economic analysis, and also examine the impact of dataset choice, by studying input-output networks in individual countries and the entire world. Results show that Burr, Log-Logistic, Log-normal, and Weibull distributions can better describe scaling patterns of global input-output networks. We also find that dataset choice has limited impacts on the observed scaling patterns. Our findings can help examine the quality of economic statistics, estimate missing data in economic statistics, and identify key nodes and links in input-output networks to support economic policymaking.

Skeleton of weighted social network

NASA Astrophysics Data System (ADS)

Zhang, X.; Zhu, J.

2013-03-01

In the literature of social networks, understanding topological structure is an important scientific issue. In this paper, we construct a network from mobile phone call records and use the cumulative number of calls as a measure of the weight of a social tie. We extract skeletons from the weighted social network on the basis of the weights of ties, and we study their properties. We find that strong ties can support the skeleton in the network by studying the percolation characters. We explore the centrality of w-skeletons based on the correlation between some centrality measures and the skeleton index w of a vertex, and we find that the average centrality of a w-skeleton increases as w increases. We also study the cumulative degree distribution of the successive w-skeletons and find that as w increases, the w-skeleton tends to become more self-similar. Furthermore, fractal characteristics appear in higher w-skeletons. We also explore the global information diffusion efficiency of w-skeletons using simulations, from which we can see that the ties in the high w-skeletons play important roles in information diffusion. Identifying such a simple structure of a w-skeleton is a step forward toward understanding and representing the topological structure of weighted social networks.

Independent functional connectivity networks underpin food and monetary reward sensitivity in excess weight.

PubMed

Verdejo-Román, Juan; Fornito, Alex; Soriano-Mas, Carles; Vilar-López, Raquel; Verdejo-García, Antonio

2017-02-01

Overvaluation of palatable food is a primary driver of obesity, and is associated with brain regions of the reward system. However, it remains unclear if this network is specialized in food reward, or generally involved in reward processing. We used functional magnetic resonance imaging (fMRI) to characterize functional connectivity during processing of food and monetary rewards. Thirty-nine adults with excess weight and 37 adults with normal weight performed the Willingness to Pay for Food task and the Monetary Incentive Delay task in the fMRI scanner. A data-driven graph approach was applied to compare whole-brain, task-related functional connectivity between groups. Excess weight was associated with decreased functional connectivity during the processing of food rewards in a network involving primarily frontal and striatal areas, and increased functional connectivity during the processing of monetary rewards in a network involving principally frontal and parietal areas. These two networks were topologically and anatomically distinct, and were independently associated with BMI. The processing of food and monetary rewards involve segregated neural networks, and both are altered in individuals with excess weight. Copyright © 2016 Elsevier Inc. All rights reserved.

Higher-order neural networks, Polyà polynomials, and Fermi cluster diagrams

NASA Astrophysics Data System (ADS)

Kürten, K. E.; Clark, J. W.

2003-09-01

The problem of controlling higher-order interactions in neural networks is addressed with techniques commonly applied in the cluster analysis of quantum many-particle systems. For multineuron synaptic weights chosen according to a straightforward extension of the standard Hebbian learning rule, we show that higher-order contributions to the stimulus felt by a given neuron can be readily evaluated via Polyà’s combinatoric group-theoretical approach or equivalently by exploiting a precise formal analogy with fermion diagrammatics.

Exploring biological interaction networks with tailored weighted quasi-bicliques

PubMed Central

2012-01-01

Background Biological networks provide fundamental insights into the functional characterization of genes and their products, the characterization of DNA-protein interactions, the identification of regulatory mechanisms, and other biological tasks. Due to the experimental and biological complexity, their computational exploitation faces many algorithmic challenges. Results We introduce novel weighted quasi-biclique problems to identify functional modules in biological networks when represented by bipartite graphs. In difference to previous quasi-biclique problems, we include biological interaction levels by using edge-weighted quasi-bicliques. While we prove that our problems are NP-hard, we also describe IP formulations to compute exact solutions for moderately sized networks. Conclusions We verify the effectiveness of our IP solutions using both simulation and empirical data. The simulation shows high quasi-biclique recall rates, and the empirical data corroborate the abilities of our weighted quasi-bicliques in extracting features and recovering missing interactions from biological networks. PMID:22759421

Classification of Company Performance using Weighted Probabilistic Neural Network

NASA Astrophysics Data System (ADS)

Yasin, Hasbi; Waridi Basyiruddin Arifin, Adi; Warsito, Budi

2018-05-01

Classification of company performance can be judged by looking at its financial status, whether good or bad state. Classification of company performance can be achieved by some approach, either parametric or non-parametric. Neural Network is one of non-parametric methods. One of Artificial Neural Network (ANN) models is Probabilistic Neural Network (PNN). PNN consists of four layers, i.e. input layer, pattern layer, addition layer, and output layer. The distance function used is the euclidean distance and each class share the same values as their weights. In this study used PNN that has been modified on the weighting process between the pattern layer and the addition layer by involving the calculation of the mahalanobis distance. This model is called the Weighted Probabilistic Neural Network (WPNN). The results show that the company's performance modeling with the WPNN model has a very high accuracy that reaches 100%.

Betweenness centrality in a weighted network

NASA Astrophysics Data System (ADS)

Wang, Huijuan; Hernandez, Javier Martin; van Mieghem, Piet

2008-04-01

When transport in networks follows the shortest paths, the union of all shortest path trees G∪SPT can be regarded as the “transport overlay network.” Overlay networks such as peer-to-peer networks or virtual private networks can be considered as a subgraph of G∪SPT . The traffic through the network is examined by the betweenness Bl of links in the overlay G∪SPT . The strength of disorder can be controlled by, e.g., tuning the extreme value index α of the independent and identically distributed polynomial link weights. In the strong disorder limit (α→0) , all transport flows over a critical backbone, the minimum spanning tree (MST). We investigate the betweenness distributions of wide classes of trees, such as the MST of those well-known network models and of various real-world complex networks. All these trees with different degree distributions (e.g., uniform, exponential, or power law) are found to possess a power law betweenness distribution Pr[Bl=j]˜j-c . The exponent c seems to be positively correlated with the degree variance of the tree and to be insensitive of the size N of a network. In the weak disorder regime, transport in the network traverses many links. We show that a link with smaller link weight tends to carry more traffic. This negative correlation between link weight and betweenness depends on α and the structure of the underlying topology.

The influence of passenger flow on the topology characteristics of urban rail transit networks

NASA Astrophysics Data System (ADS)

Hu, Yingyue; Chen, Feng; Chen, Peiwen; Tan, Yurong

2017-05-01

Current researches on the network characteristics of metro networks are generally carried out on topology networks without passenger flows running on it, thus more complex features of the networks with ridership loaded on it cannot be captured. In this study, we incorporated the load of metro networks, passenger volume, into the exploration of network features. Thus, the network can be examined in the context of operation, which is the ultimate purpose of the existence of a metro network. To this end, section load was selected as an edge weight to demonstrate the influence of ridership on the network, and a weighted calculation method for complex network indicators and robustness were proposed to capture the unique behaviors of a metro network with passengers flowing in it. The proposed method was applied on Beijing Subway. Firstly, the passenger volume in terms of daily origin and destination matrix was extracted from exhausted transit smart card data. Using the established approach and the matrix as weighting, common indicators of complex network including clustering coefficient, betweenness and degree were calculated, and network robustness were evaluated under potential attacks. The results were further compared to that of unweighted networks, and it suggests indicators of the network with consideration of passenger volumes differ from that without ridership to some extent, and networks tend to be more vulnerable than that without load on it. The significance sequence for the stations can be changed. By introducing passenger flow weighting, actual operation status of the network can be reflected more accurately. It is beneficial to determine the crucial stations and make precautionary measures for the entire network’s operation security.

Improved Autoassociative Neural Networks

NASA Technical Reports Server (NTRS)

Hand, Charles

2003-01-01

Improved autoassociative neural networks, denoted nexi, have been proposed for use in controlling autonomous robots, including mobile exploratory robots of the biomorphic type. In comparison with conventional autoassociative neural networks, nexi would be more complex but more capable in that they could be trained to do more complex tasks. A nexus would use bit weights and simple arithmetic in a manner that would enable training and operation without a central processing unit, programs, weight registers, or large amounts of memory. Only a relatively small amount of memory (to hold the bit weights) and a simple logic application- specific integrated circuit would be needed. A description of autoassociative neural networks is prerequisite to a meaningful description of a nexus. An autoassociative network is a set of neurons that are completely connected in the sense that each neuron receives input from, and sends output to, all the other neurons. (In some instantiations, a neuron could also send output back to its own input terminal.) The state of a neuron is completely determined by the inner product of its inputs with weights associated with its input channel. Setting the weights sets the behavior of the network. The neurons of an autoassociative network are usually regarded as comprising a row or vector. Time is a quantized phenomenon for most autoassociative networks in the sense that time proceeds in discrete steps. At each time step, the row of neurons forms a pattern: some neurons are firing, some are not. Hence, the current state of an autoassociative network can be described with a single binary vector. As time goes by, the network changes the vector. Autoassociative networks move vectors over hyperspace landscapes of possibilities.

Simulation of Foam Divot Weight on External Tank Utilizing Least Squares and Neural Network Methods

NASA Technical Reports Server (NTRS)

Chamis, Christos C.; Coroneos, Rula M.

2007-01-01

Simulation of divot weight in the insulating foam, associated with the external tank of the U.S. space shuttle, has been evaluated using least squares and neural network concepts. The simulation required models based on fundamental considerations that can be used to predict under what conditions voids form, the size of the voids, and subsequent divot ejection mechanisms. The quadratic neural networks were found to be satisfactory for the simulation of foam divot weight in various tests associated with the external tank. Both linear least squares method and the nonlinear neural network predicted identical results.

Central and non-central networks, cognition, clinical symptoms, and polygenic risk scores in schizophrenia.

PubMed

Alloza, Clara; Bastin, Mark E; Cox, Simon R; Gibson, Jude; Duff, Barbara; Semple, Scott I; Whalley, Heather C; Lawrie, Stephen M

2017-12-01

Schizophrenia is a complex disorder that may be the result of aberrant connections between specific brain regions rather than focal brain abnormalities. Here, we investigate the relationships between brain structural connectivity as described by network analysis, intelligence, symptoms, and polygenic risk scores (PGRS) for schizophrenia in a group of patients with schizophrenia and a group of healthy controls. Recently, researchers have shown an interest in the role of high centrality networks in the disorder. However, the importance of non-central networks still remains unclear. Thus, we specifically examined network-averaged fractional anisotropy (mean edge weight) in central and non-central subnetworks. Connections with the highest betweenness centrality within the average network (>75% of centrality values) were selected to represent the central subnetwork. The remaining connections were assigned to the non-central subnetwork. Additionally, we calculated graph theory measures from the average network (connections that occur in at least 2/3 of participants). Density, strength, global efficiency, and clustering coefficient were significantly lower in patients compared with healthy controls for the average network (p FDR  < 0.05). All metrics across networks were significantly associated with intelligence (p FDR  < 0.05). There was a tendency towards significance for a correlation between intelligence and PGRS for schizophrenia (r = -0.508, p = 0.052) that was significantly mediated by central and non-central mean edge weight and every graph metric from the average network. These results are consistent with the hypothesis that intelligence deficits are associated with a genetic risk for schizophrenia, which is mediated via the disruption of distributed brain networks. Hum Brain Mapp 38:5919-5930, 2017. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Optimal Network-based Intervention in the Presence of Undetectable Viruses.

PubMed

Youssef, Mina; Scoglio, Caterina

2014-08-01

This letter presents an optimal control framework to reduce the spread of viruses in networks. The network is modeled as an undirected graph of nodes and weighted links. We consider the spread of viruses in a network as a system, and the total number of infected nodes as the state of the system, while the control function is the weight reduction leading to slow/reduce spread of viruses. Our epidemic model overcomes three assumptions that were extensively used in the literature and produced inaccurate results. We apply the optimal control formulation to crucial network structures. Numerical results show the dynamical weight reduction and reveal the role of the network structure and the epidemic model in reducing the infection size in the presence of indiscernible infected nodes.

Optimal Network-based Intervention in the Presence of Undetectable Viruses

PubMed Central

Youssef, Mina; Scoglio, Caterina

2014-01-01

This letter presents an optimal control framework to reduce the spread of viruses in networks. The network is modeled as an undirected graph of nodes and weighted links. We consider the spread of viruses in a network as a system, and the total number of infected nodes as the state of the system, while the control function is the weight reduction leading to slow/reduce spread of viruses. Our epidemic model overcomes three assumptions that were extensively used in the literature and produced inaccurate results. We apply the optimal control formulation to crucial network structures. Numerical results show the dynamical weight reduction and reveal the role of the network structure and the epidemic model in reducing the infection size in the presence of indiscernible infected nodes. PMID:25422579

Analysis of global gene expression in Brachypodium distachyon reveals extensive network plasticity in response to abiotic stress.

PubMed

Priest, Henry D; Fox, Samuel E; Rowley, Erik R; Murray, Jessica R; Michael, Todd P; Mockler, Todd C

2014-01-01

Brachypodium distachyon is a close relative of many important cereal crops. Abiotic stress tolerance has a significant impact on productivity of agriculturally important food and feedstock crops. Analysis of the transcriptome of Brachypodium after chilling, high-salinity, drought, and heat stresses revealed diverse differential expression of many transcripts. Weighted Gene Co-Expression Network Analysis revealed 22 distinct gene modules with specific profiles of expression under each stress. Promoter analysis implicated short DNA sequences directly upstream of module members in the regulation of 21 of 22 modules. Functional analysis of module members revealed enrichment in functional terms for 10 of 22 network modules. Analysis of condition-specific correlations between differentially expressed gene pairs revealed extensive plasticity in the expression relationships of gene pairs. Photosynthesis, cell cycle, and cell wall expression modules were down-regulated by all abiotic stresses. Modules which were up-regulated by each abiotic stress fell into diverse and unique gene ontology GO categories. This study provides genomics resources and improves our understanding of abiotic stress responses of Brachypodium.

Use of a mobile social networking intervention for weight management: a mixed-methods study protocol

PubMed Central

Lau, Annie Y S; Martin, Paige; Tong, Huong Ly; Coiera, Enrico

2017-01-01

Introduction Obesity and physical inactivity are major societal challenges and significant contributors to the global burden of disease and healthcare costs. Information and communication technologies are increasingly being used in interventions to promote behaviour change in diet and physical activity. In particular, social networking platforms seem promising for the delivery of weight control interventions. We intend to pilot test an intervention involving the use of a social networking mobile application and tracking devices (Fitbit Flex 2 and Fitbit Aria scale) to promote the social comparison of weight and physical activity, in order to evaluate whether mechanisms of social influence lead to changes in those outcomes over the course of the study. Methods and analysis Mixed-methods study involving semi-structured interviews and a pre–post quasi-experimental pilot with one arm, where healthy participants in different body mass index (BMI) categories, aged between 19 and 35 years old, will be subjected to a social networking intervention over a 6-month period. The primary outcome is the average difference in weight before and after the intervention. Secondary outcomes include BMI, number of steps per day, engagement with the intervention, social support and system usability. Semi-structured interviews will assess participants’ expectations and perceptions regarding the intervention. Ethics and dissemination Ethics approval was granted by Macquarie University’s Human Research Ethics Committee for Medical Sciences on 3 November 2016 (ethics reference number 5201600716). The social network will be moderated by a researcher with clinical expertise, who will monitor and respond to concerns raised by participants. Monitoring will involve daily observation of measures collected by the fitness tracker and the wireless scale, as well as continuous supervision of forum interactions and posts. Additionally, a protocol is in place to monitor for participant misbehaviour and direct participants-in-need to appropriate sources of help. PMID:28706104

PROFEAT Update: A Protein Features Web Server with Added Facility to Compute Network Descriptors for Studying Omics-Derived Networks.

PubMed

Zhang, P; Tao, L; Zeng, X; Qin, C; Chen, S Y; Zhu, F; Yang, S Y; Li, Z R; Chen, W P; Chen, Y Z

2017-02-03

The studies of biological, disease, and pharmacological networks are facilitated by the systems-level investigations using computational tools. In particular, the network descriptors developed in other disciplines have found increasing applications in the study of the protein, gene regulatory, metabolic, disease, and drug-targeted networks. Facilities are provided by the public web servers for computing network descriptors, but many descriptors are not covered, including those used or useful for biological studies. We upgraded the PROFEAT web server http://bidd2.nus.edu.sg/cgi-bin/profeat2016/main.cgi for computing up to 329 network descriptors and protein-protein interaction descriptors. PROFEAT network descriptors comprehensively describe the topological and connectivity characteristics of unweighted (uniform binding constants and molecular levels), edge-weighted (varying binding constants), node-weighted (varying molecular levels), edge-node-weighted (varying binding constants and molecular levels), and directed (oriented processes) networks. The usefulness of the network descriptors is illustrated by the literature-reported studies of the biological networks derived from the genome, interactome, transcriptome, metabolome, and diseasome profiles. Copyright © 2016 Elsevier Ltd. All rights reserved.

Spatial Dynamics of the Communities and the Role of Major Countries in the International Rare Earths Trade: A Complex Network Analysis.

PubMed

Wang, Xibo; Ge, Jianping; Wei, Wendong; Li, Hanshi; Wu, Chen; Zhu, Ge

2016-01-01

Rare earths (RE) are critical materials in many high-technology products. Due to the uneven distribution and important functions for industrial development, most countries import RE from a handful of suppliers that are rich in RE, such as China. However, because of the rapid growth of RE exploitation and pollution of the mining and production process, some of the main suppliers have gradually tended to reduce the RE production and exports. Especially in the last decade, international RE trade has been changing in the trade community and trade volume. Based on complex network theory, we built an unweighted and weighted network to explore the evolution of the communities and identify the role of the major countries in the RE trade. The results show that an international RE trade network was dispersed and unstable because of the existence of five to nine trade communities in the unweighted network and four to eight trade communities in the weighted network in the past 13 years. Moreover, trade groups formed due to the great influence of geopolitical relations. China was often associated with the South America and African countries in the same trade group. In addition, Japan, China, the United States, and Germany had the largest impacts on international RE trade from 2002 to 2014. Last, some policy suggestions were highlighted according to the results.

Spatial Dynamics of the Communities and the Role of Major Countries in the International Rare Earths Trade: A Complex Network Analysis

PubMed Central

Wang, Xibo; Ge, Jianping; Wei, Wendong; Li, Hanshi; Wu, Chen; Zhu, Ge

2016-01-01

Rare earths (RE) are critical materials in many high-technology products. Due to the uneven distribution and important functions for industrial development, most countries import RE from a handful of suppliers that are rich in RE, such as China. However, because of the rapid growth of RE exploitation and pollution of the mining and production process, some of the main suppliers have gradually tended to reduce the RE production and exports. Especially in the last decade, international RE trade has been changing in the trade community and trade volume. Based on complex network theory, we built an unweighted and weighted network to explore the evolution of the communities and identify the role of the major countries in the RE trade. The results show that an international RE trade network was dispersed and unstable because of the existence of five to nine trade communities in the unweighted network and four to eight trade communities in the weighted network in the past 13 years. Moreover, trade groups formed due to the great influence of geopolitical relations. China was often associated with the South America and African countries in the same trade group. In addition, Japan, China, the United States, and Germany had the largest impacts on international RE trade from 2002 to 2014. Last, some policy suggestions were highlighted according to the results. PMID:27137779

Space station data system analysis/architecture study. Task 3: Trade studies, DR-5, volume 1

NASA Technical Reports Server (NTRS)

1985-01-01

The primary objective of Task 3 is to provide additional analysis and insight necessary to support key design/programmatic decision for options quantification and selection for system definition. This includes: (1) the identification of key trade study topics; (2) the definition of a trade study procedure for each topic (issues to be resolved, key inputs, criteria/weighting, methodology); (3) conduct tradeoff and sensitivity analysis; and (4) the review/verification of results within the context of evolving system design and definition. The trade study topics addressed in this volume include space autonomy and function automation, software transportability, system network topology, communications standardization, onboard local area networking, distributed operating system, software configuration management, and the software development environment facility.

A Measure for the Cohesion of Weighted Networks.

ERIC Educational Resources Information Center

Egghe, Leo; Rousseau, Ronald

2003-01-01

Discusses graph theory in information science, focusing on measures for the cohesion of networks. Illustrates how a set of weights between connected nodes can be transformed into a set of dissimilarity measures and presents an example of the new compactness measures for a cocitation and a bibliographic coupling network. (Author/LRW)

Improved particle swarm optimization algorithm for android medical care IOT using modified parameters.

PubMed

Sung, Wen-Tsai; Chiang, Yen-Chun

2012-12-01

This study examines wireless sensor network with real-time remote identification using the Android study of things (HCIOT) platform in community healthcare. An improved particle swarm optimization (PSO) method is proposed to efficiently enhance physiological multi-sensors data fusion measurement precision in the Internet of Things (IOT) system. Improved PSO (IPSO) includes: inertia weight factor design, shrinkage factor adjustment to allow improved PSO algorithm data fusion performance. The Android platform is employed to build multi-physiological signal processing and timely medical care of things analysis. Wireless sensor network signal transmission and Internet links allow community or family members to have timely medical care network services.

Self-organization of complex networks as a dynamical system

NASA Astrophysics Data System (ADS)

Aoki, Takaaki; Yawata, Koichiro; Aoyagi, Toshio

2015-01-01

To understand the dynamics of real-world networks, we investigate a mathematical model of the interplay between the dynamics of random walkers on a weighted network and the link weights driven by a resource carried by the walkers. Our numerical studies reveal that, under suitable conditions, the co-evolving dynamics lead to the emergence of stationary power-law distributions of the resource and link weights, while the resource quantity at each node ceaselessly changes with time. We analyze the network organization as a deterministic dynamical system and find that the system exhibits multistability, with numerous fixed points, limit cycles, and chaotic states. The chaotic behavior of the system leads to the continual changes in the microscopic network dynamics in the absence of any external random noises. We conclude that the intrinsic interplay between the states of the nodes and network reformation constitutes a major factor in the vicissitudes of real-world networks.

Self-organization of complex networks as a dynamical system.

PubMed

Aoki, Takaaki; Yawata, Koichiro; Aoyagi, Toshio

2015-01-01

To understand the dynamics of real-world networks, we investigate a mathematical model of the interplay between the dynamics of random walkers on a weighted network and the link weights driven by a resource carried by the walkers. Our numerical studies reveal that, under suitable conditions, the co-evolving dynamics lead to the emergence of stationary power-law distributions of the resource and link weights, while the resource quantity at each node ceaselessly changes with time. We analyze the network organization as a deterministic dynamical system and find that the system exhibits multistability, with numerous fixed points, limit cycles, and chaotic states. The chaotic behavior of the system leads to the continual changes in the microscopic network dynamics in the absence of any external random noises. We conclude that the intrinsic interplay between the states of the nodes and network reformation constitutes a major factor in the vicissitudes of real-world networks.

When is hub gene selection better than standard meta-analysis?

PubMed

Langfelder, Peter; Mischel, Paul S; Horvath, Steve

2013-01-01

Since hub nodes have been found to play important roles in many networks, highly connected hub genes are expected to play an important role in biology as well. However, the empirical evidence remains ambiguous. An open question is whether (or when) hub gene selection leads to more meaningful gene lists than a standard statistical analysis based on significance testing when analyzing genomic data sets (e.g., gene expression or DNA methylation data). Here we address this question for the special case when multiple genomic data sets are available. This is of great practical importance since for many research questions multiple data sets are publicly available. In this case, the data analyst can decide between a standard statistical approach (e.g., based on meta-analysis) and a co-expression network analysis approach that selects intramodular hubs in consensus modules. We assess the performance of these two types of approaches according to two criteria. The first criterion evaluates the biological insights gained and is relevant in basic research. The second criterion evaluates the validation success (reproducibility) in independent data sets and often applies in clinical diagnostic or prognostic applications. We compare meta-analysis with consensus network analysis based on weighted correlation network analysis (WGCNA) in three comprehensive and unbiased empirical studies: (1) Finding genes predictive of lung cancer survival, (2) finding methylation markers related to age, and (3) finding mouse genes related to total cholesterol. The results demonstrate that intramodular hub gene status with respect to consensus modules is more useful than a meta-analysis p-value when identifying biologically meaningful gene lists (reflecting criterion 1). However, standard meta-analysis methods perform as good as (if not better than) a consensus network approach in terms of validation success (criterion 2). The article also reports a comparison of meta-analysis techniques applied to gene expression data and presents novel R functions for carrying out consensus network analysis, network based screening, and meta analysis.

Current-mode subthreshold MOS implementation of the Herault-Jutten autoadaptive network

NASA Astrophysics Data System (ADS)

Cohen, Marc H.; Andreou, Andreas G.

1992-05-01

The translinear circuits in subthreshold MOS technology and current-mode design techniques for the implementation of neuromorphic analog network processing are investigated. The architecture, also known as the Herault-Jutten network, performs an independent component analysis and is essentially a continuous-time recursive linear adaptive filter. Analog I/O interface, weight coefficients, and adaptation blocks are all integrated on the chip. A small network with six neurons and 30 synapses was fabricated in a 2-microns n-well double-polysilicon, double-metal CMOS process. Circuit designs at the transistor level yield area-efficient implementations for neurons, synapses, and the adaptation blocks. The design methodology and constraints as well as test results from the fabricated chips are discussed.

Reinforcement learning neural-network-based controller for nonlinear discrete-time systems with input constraints.

PubMed

He, Pingan; Jagannathan, S

2007-04-01

A novel adaptive-critic-based neural network (NN) controller in discrete time is designed to deliver a desired tracking performance for a class of nonlinear systems in the presence of actuator constraints. The constraints of the actuator are treated in the controller design as the saturation nonlinearity. The adaptive critic NN controller architecture based on state feedback includes two NNs: the critic NN is used to approximate the "strategic" utility function, whereas the action NN is employed to minimize both the strategic utility function and the unknown nonlinear dynamic estimation errors. The critic and action NN weight updates are derived by minimizing certain quadratic performance indexes. Using the Lyapunov approach and with novel weight updates, the uniformly ultimate boundedness of the closed-loop tracking error and weight estimates is shown in the presence of NN approximation errors and bounded unknown disturbances. The proposed NN controller works in the presence of multiple nonlinearities, unlike other schemes that normally approximate one nonlinearity. Moreover, the adaptive critic NN controller does not require an explicit offline training phase, and the NN weights can be initialized at zero or random. Simulation results justify the theoretical analysis.

Determination of important topographic factors for landslide mapping analysis using MLP network.

PubMed

Alkhasawneh, Mutasem Sh; Ngah, Umi Kalthum; Tay, Lea Tien; Mat Isa, Nor Ashidi; Al-batah, Mohammad Subhi

2013-01-01

Landslide is one of the natural disasters that occur in Malaysia. Topographic factors such as elevation, slope angle, slope aspect, general curvature, plan curvature, and profile curvature are considered as the main causes of landslides. In order to determine the dominant topographic factors in landslide mapping analysis, a study was conducted and presented in this paper. There are three main stages involved in this study. The first stage is the extraction of extra topographic factors. Previous landslide studies had identified mainly six topographic factors. Seven new additional factors have been proposed in this study. They are longitude curvature, tangential curvature, cross section curvature, surface area, diagonal line length, surface roughness, and rugosity. The second stage is the specification of the weight of each factor using two methods. The methods are multilayer perceptron (MLP) network classification accuracy and Zhou's algorithm. At the third stage, the factors with higher weights were used to improve the MLP performance. Out of the thirteen factors, eight factors were considered as important factors, which are surface area, longitude curvature, diagonal length, slope angle, elevation, slope aspect, rugosity, and profile curvature. The classification accuracy of multilayer perceptron neural network has increased by 3% after the elimination of five less important factors.

Determination of Important Topographic Factors for Landslide Mapping Analysis Using MLP Network

PubMed Central

Alkhasawneh, Mutasem Sh.; Ngah, Umi Kalthum; Mat Isa, Nor Ashidi; Al-batah, Mohammad Subhi

2013-01-01

Landslide is one of the natural disasters that occur in Malaysia. Topographic factors such as elevation, slope angle, slope aspect, general curvature, plan curvature, and profile curvature are considered as the main causes of landslides. In order to determine the dominant topographic factors in landslide mapping analysis, a study was conducted and presented in this paper. There are three main stages involved in this study. The first stage is the extraction of extra topographic factors. Previous landslide studies had identified mainly six topographic factors. Seven new additional factors have been proposed in this study. They are longitude curvature, tangential curvature, cross section curvature, surface area, diagonal line length, surface roughness, and rugosity. The second stage is the specification of the weight of each factor using two methods. The methods are multilayer perceptron (MLP) network classification accuracy and Zhou's algorithm. At the third stage, the factors with higher weights were used to improve the MLP performance. Out of the thirteen factors, eight factors were considered as important factors, which are surface area, longitude curvature, diagonal length, slope angle, elevation, slope aspect, rugosity, and profile curvature. The classification accuracy of multilayer perceptron neural network has increased by 3% after the elimination of five less important factors. PMID:24453846

Comparative efficacy of CPAP, MADs, exercise-training, and dietary weight loss for sleep apnea: a network meta-analysis.

PubMed

Iftikhar, Imran H; Bittencourt, Lia; Youngstedt, Shawn D; Ayas, Najib; Cistulli, Peter; Schwab, Richard; Durkin, Martin W; Magalang, Ulysses J

2017-02-01

To synthesize evidence from available studies on the relative efficacies of continuous positive airway pressure (CPAP), mandibular advancement device (MAD), supervised aerobic exercise training, and dietary weight loss in patients with obstructive sleep apnea (OSA). Network meta-analysis of 80 randomized controlled trials (RCTs) short-listed from PubMed, SCOPUS, Web of science, and Cochrane register (inception - September 8, 2015). Individuals with OSA. CPAP, MADs, exercise training, and dietary weight loss. CPAP decreased apnea-hypopnea index (AHI) the most [by 25.27 events/hour (22.03-28.52)] followed by exercise training, MADs, and dietary weight loss. While the difference between exercise training and CPAP was non-significant [-8.04 (-17.00 to 0.92), a significant difference was found between CPAP and MADs on AHI and oxygen desaturation index (ODI) [-10.06 (-14.21 to -5.91) and -7.82 (-13.04 to -2.59), respectively]. Exercise training significantly improved Epworth sleepiness scores (ESS) [by 3.08 (0.68-5.48)], albeit with a non-significant difference compared to MADs and CPAP. CPAP is the most efficacious in complete resolution of sleep apnea and in improving the indices of saturation during sleep. While MADs offer a reasonable alternative to CPAP, exercise training which significantly improved daytime sleepiness (ESS) could be used as adjunctive to the former two. Copyright © 2016 Elsevier B.V. All rights reserved.

Covalently crosslinked diels-alder polymer networks.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bowman, Christopher; Adzima, Brian J.; Anderson, Benjamin John

2011-09-01

This project examines the utility of cycloaddition reactions for the synthesis of polymer networks. Cycloaddition reactions are desirable because they produce no unwanted side reactions or small molecules, allowing for the formation of high molecular weight species and glassy crosslinked networks. Both the Diels-Alder reaction and the copper-catalyzed azide-alkyne cycloaddition (CuAAC) were studied. Accomplishments include externally triggered healing of a thermoreversible covalent network via self-limited hysteresis heating, the creation of Diels-Alder based photoresists, and the successful photochemical catalysis of CuAAC as an alternative to the use of ascorbic acid for the generation of Cu(I) in click reactions. An analysis ofmore » the results reveals that these new methods offer the promise of efficiently creating robust, high molecular weight species and delicate three dimensional structures that incorporate chemical functionality in the patterned material. This work was performed under a Strategic Partnerships LDRD during FY10 and FY11 as part of a Sandia National Laboratories/University of Colorado-Boulder Excellence in Science and Engineering Fellowship awarded to Brian J. Adzima, a graduate student at UC-Boulder. Benjamin J. Anderson (Org. 1833) was the Sandia National Laboratories point-of-contact for this fellowship.« less

Clustering Financial Time Series by Network Community Analysis

NASA Astrophysics Data System (ADS)

Piccardi, Carlo; Calatroni, Lisa; Bertoni, Fabio

In this paper, we describe a method for clustering financial time series which is based on community analysis, a recently developed approach for partitioning the nodes of a network (graph). A network with N nodes is associated to the set of N time series. The weight of the link (i, j), which quantifies the similarity between the two corresponding time series, is defined according to a metric based on symbolic time series analysis, which has recently proved effective in the context of financial time series. Then, searching for network communities allows one to identify groups of nodes (and then time series) with strong similarity. A quantitative assessment of the significance of the obtained partition is also provided. The method is applied to two distinct case-studies concerning the US and Italy Stock Exchange, respectively. In the US case, the stability of the partitions over time is also thoroughly investigated. The results favorably compare with those obtained with the standard tools typically used for clustering financial time series, such as the minimal spanning tree and the hierarchical tree.

Acute Antipsychotic Treatment of Children and Adolescents With Schizophrenia-Spectrum Disorders: A Systematic Review and Network Meta-Analysis.

PubMed

Pagsberg, Anne Katrine; Tarp, Simon; Glintborg, Dorte; Stenstrøm, Anne Dorte; Fink-Jensen, Anders; Correll, Christoph Ulrich; Christensen, Robin

2017-03-01

To determine the comparative efficacy and safety of antipsychotics for youth with early-onset schizophrenia using network meta-analytic methods combining direct and indirect trial data. The authors systematically searched MEDLINE, the Cochrane Library, and clinicaltrials.gov and selected randomized controlled trials allocating youth with schizophrenia spectrum disorders to a (non-clozapine) antipsychotic versus placebo or another antipsychotic. Major efficacy outcomes were Positive and Negative Syndrome Scale (PANSS) total and positive symptoms. Major safety outcomes were weight, plasma triglyceride levels, extrapyramidal symptoms, akathisia, and all-cause discontinuation. Sixteen additional outcomes were analyzed. A random-effects arm-based network meta-analysis was applied, and consistency was assessed by pairwise meta-analysis. Confidence in PANSS total estimates was assessed by applying the Grading of Recommendations Assessment, Development and Evaluation (GRADE) approach. Twelve 6- to 12-week trials (N = 2,158; 8-19 years old; 61% boys) involving 8 antipsychotics (aripiprazole, asenapine, paliperidone, risperidone, quetiapine, olanzapine, molindone, and ziprasidone) were analyzed. PANSS total symptom change was comparable among antipsychotics (low- to moderate-quality evidence), except ziprasidone (very low- to low-quality evidence), and all antipsychotics were superior to placebo (low- to high-quality evidence), except ziprasidone and asenapine (low- to moderate-quality evidence). PANSS positive changes and additional efficacy outcomes were comparable among antipsychotics. Weight gain was primarily associated with olanzapine; extrapyramidal symptoms and akathisia were associated with molindone; and prolactin increased with risperidone, paliperidone, and olanzapine. Serious adverse events, discontinuation of treatment, sedation, insomnia, or change in triglycerides did not differ among antipsychotics. This network meta-analysis showed comparable efficacy among antipsychotics for early-onset schizophrenia, except that efficacy appeared inferior for ziprasidone and unclear for asenapine. Adverse reaction profiles varied substantially among the investigated antipsychotics and were largely consistent with prior findings in adults. Protocol registration information-Antipsychotic Treatment for Children With Schizophrenia Spectrum Disorders: Network Meta-Analysis of Randomised Trials; https://www.crd.york.ac.uk/PROSPERO/; CRD42013006676. Copyright © 2017 American Academy of Child and Adolescent Psychiatry. Published by Elsevier Inc. All rights reserved.

Epidemic spreading on contact networks with adaptive weights.

PubMed

Zhu, Guanghu; Chen, Guanrong; Xu, Xin-Jian; Fu, Xinchu

2013-01-21

The heterogeneous patterns of interactions within a population are often described by contact networks, but the variety and adaptivity of contact strengths are usually ignored. This paper proposes a modified epidemic SIS model with a birth-death process and nonlinear infectivity on an adaptive and weighted contact network. The links' weights, named as 'adaptive weights', which indicate the intimacy or familiarity between two connected individuals, will reduce as the disease develops. Through mathematical and numerical analyses, conditions are established for population extermination, disease extinction and infection persistence. Particularly, it is found that the fixed weights setting can trigger the epidemic incidence, and that the adaptivity of weights cannot change the epidemic threshold but it can accelerate the disease decay and lower the endemic level. Finally, some corresponding control measures are suggested. Copyright © 2012 Elsevier Ltd. All rights reserved.

Similarity indices based on link weight assignment for link prediction of unweighted complex networks

NASA Astrophysics Data System (ADS)

Liu, Shuxin; Ji, Xinsheng; Liu, Caixia; Bai, Yi

2017-01-01

Many link prediction methods have been proposed for predicting the likelihood that a link exists between two nodes in complex networks. Among these methods, similarity indices are receiving close attention. Most similarity-based methods assume that the contribution of links with different topological structures is the same in the similarity calculations. This paper proposes a local weighted method, which weights the strength of connection between each pair of nodes. Based on the local weighted method, six local weighted similarity indices extended from unweighted similarity indices (including Common Neighbor (CN), Adamic-Adar (AA), Resource Allocation (RA), Salton, Jaccard and Local Path (LP) index) are proposed. Empirical study has shown that the local weighted method can significantly improve the prediction accuracy of these unweighted similarity indices and that in sparse and weakly clustered networks, the indices perform even better.

Do-it-yourself networks: a novel method of generating weighted networks.

PubMed

Shanafelt, D W; Salau, K R; Baggio, J A

2017-11-01

Network theory is finding applications in the life and social sciences for ecology, epidemiology, finance and social-ecological systems. While there are methods to generate specific types of networks, the broad literature is focused on generating unweighted networks. In this paper, we present a framework for generating weighted networks that satisfy user-defined criteria. Each criterion hierarchically defines a feature of the network and, in doing so, complements existing algorithms in the literature. We use a general example of ecological species dispersal to illustrate the method and provide open-source code for academic purposes.

Emergence of small-world structure in networks of spiking neurons through STDP plasticity.

PubMed

Basalyga, Gleb; Gleiser, Pablo M; Wennekers, Thomas

2011-01-01

In this work, we use a complex network approach to investigate how a neural network structure changes under synaptic plasticity. In particular, we consider a network of conductance-based, single-compartment integrate-and-fire excitatory and inhibitory neurons. Initially the neurons are connected randomly with uniformly distributed synaptic weights. The weights of excitatory connections can be strengthened or weakened during spiking activity by the mechanism known as spike-timing-dependent plasticity (STDP). We extract a binary directed connection matrix by thresholding the weights of the excitatory connections at every simulation step and calculate its major topological characteristics such as the network clustering coefficient, characteristic path length and small-world index. We numerically demonstrate that, under certain conditions, a nontrivial small-world structure can emerge from a random initial network subject to STDP learning.

Markov Chain Monte Carlo Bayesian Learning for Neural Networks

NASA Technical Reports Server (NTRS)

Goodrich, Michael S.

2011-01-01

Conventional training methods for neural networks involve starting al a random location in the solution space of the network weights, navigating an error hyper surface to reach a minimum, and sometime stochastic based techniques (e.g., genetic algorithms) to avoid entrapment in a local minimum. It is further typically necessary to preprocess the data (e.g., normalization) to keep the training algorithm on course. Conversely, Bayesian based learning is an epistemological approach concerned with formally updating the plausibility of competing candidate hypotheses thereby obtaining a posterior distribution for the network weights conditioned on the available data and a prior distribution. In this paper, we developed a powerful methodology for estimating the full residual uncertainty in network weights and therefore network predictions by using a modified Jeffery's prior combined with a Metropolis Markov Chain Monte Carlo method.

International migration network: Topology and modeling

NASA Astrophysics Data System (ADS)

Fagiolo, Giorgio; Mastrorillo, Marina

2013-07-01

This paper studies international migration from a complex-network perspective. We define the international migration network (IMN) as the weighted-directed graph where nodes are world countries and links account for the stock of migrants originated in a given country and living in another country at a given point in time. We characterize the binary and weighted architecture of the network and its evolution over time in the period 1960-2000. We find that the IMN is organized around a modular structure with a small-world binary pattern displaying disassortativity and high clustering, with power-law distributed weighted-network statistics. We also show that a parsimonious gravity model of migration can account for most of observed IMN topological structure. Overall, our results suggest that socioeconomic, geographical, and political factors are more important than local-network properties in shaping the structure of the IMN.

International migration network: topology and modeling.

PubMed

Fagiolo, Giorgio; Mastrorillo, Marina

2013-07-01

This paper studies international migration from a complex-network perspective. We define the international migration network (IMN) as the weighted-directed graph where nodes are world countries and links account for the stock of migrants originated in a given country and living in another country at a given point in time. We characterize the binary and weighted architecture of the network and its evolution over time in the period 1960-2000. We find that the IMN is organized around a modular structure with a small-world binary pattern displaying disassortativity and high clustering, with power-law distributed weighted-network statistics. We also show that a parsimonious gravity model of migration can account for most of observed IMN topological structure. Overall, our results suggest that socioeconomic, geographical, and political factors are more important than local-network properties in shaping the structure of the IMN.

Network community-detection enhancement by proper weighting

NASA Astrophysics Data System (ADS)

Khadivi, Alireza; Ajdari Rad, Ali; Hasler, Martin

2011-04-01

In this paper, we show how proper assignment of weights to the edges of a complex network can enhance the detection of communities and how it can circumvent the resolution limit and the extreme degeneracy problems associated with modularity. Our general weighting scheme takes advantage of graph theoretic measures and it introduces two heuristics for tuning its parameters. We use this weighting as a preprocessing step for the greedy modularity optimization algorithm of Newman to improve its performance. The result of the experiments of our approach on computer-generated and real-world data networks confirm that the proposed approach not only mitigates the problems of modularity but also improves the modularity optimization.

Human connectome module pattern detection using a new multi-graph MinMax cut model.

PubMed

De, Wang; Wang, Yang; Nie, Feiping; Yan, Jingwen; Cai, Weidong; Saykin, Andrew J; Shen, Li; Huang, Heng

2014-01-01

Many recent scientific efforts have been devoted to constructing the human connectome using Diffusion Tensor Imaging (DTI) data for understanding the large-scale brain networks that underlie higher-level cognition in human. However, suitable computational network analysis tools are still lacking in human connectome research. To address this problem, we propose a novel multi-graph min-max cut model to detect the consistent network modules from the brain connectivity networks of all studied subjects. A new multi-graph MinMax cut model is introduced to solve this challenging computational neuroscience problem and the efficient optimization algorithm is derived. In the identified connectome module patterns, each network module shows similar connectivity patterns in all subjects, which potentially associate to specific brain functions shared by all subjects. We validate our method by analyzing the weighted fiber connectivity networks. The promising empirical results demonstrate the effectiveness of our method.

Synchronization of Switched Neural Networks With Communication Delays via the Event-Triggered Control.

PubMed

Wen, Shiping; Zeng, Zhigang; Chen, Michael Z Q; Huang, Tingwen

2017-10-01

This paper addresses the issue of synchronization of switched delayed neural networks with communication delays via event-triggered control. For synchronizing coupled switched neural networks, we propose a novel event-triggered control law which could greatly reduce the number of control updates for synchronization tasks of coupled switched neural networks involving embedded microprocessors with limited on-board resources. The control signals are driven by properly defined events, which depend on the measurement errors and current-sampled states. By using a delay system method, a novel model of synchronization error system with delays is proposed with the communication delays and event-triggered control in the unified framework for coupled switched neural networks. The criteria are derived for the event-triggered synchronization analysis and control synthesis of switched neural networks via the Lyapunov-Krasovskii functional method and free weighting matrix approach. A numerical example is elaborated on to illustrate the effectiveness of the derived results.

Modeling the coevolution of topology and traffic on weighted technological networks

NASA Astrophysics Data System (ADS)

Xie, Yan-Bo; Wang, Wen-Xu; Wang, Bing-Hong

2007-02-01

For many technological networks, the network structures and the traffic taking place on them mutually interact. The demands of traffic increment spur the evolution and growth of the networks to maintain their normal and efficient functioning. In parallel, a change of the network structure leads to redistribution of the traffic. In this paper, we perform an extensive numerical and analytical study, extending results of Wang [Phys. Rev. Lett. 94, 188702 (2005)]. By introducing a general strength-coupling interaction driven by the traffic increment between any pair of vertices, our model generates networks of scale-free distributions of strength, weight, and degree. In particular, the obtained nonlinear correlation between vertex strength and degree, and the disassortative property demonstrate that the model is capable of characterizing weighted technological networks. Moreover, the generated graphs possess both dense clustering structures and an anticorrelation between vertex clustering and degree, which are widely observed in real-world networks. The corresponding theoretical predictions are well consistent with simulation results.

Spatial correlation analysis of urban traffic state under a perspective of community detection

NASA Astrophysics Data System (ADS)

Yang, Yanfang; Cao, Jiandong; Qin, Yong; Jia, Limin; Dong, Honghui; Zhang, Aomuhan

2018-05-01

Understanding the spatial correlation of urban traffic state is essential for identifying the evolution patterns of urban traffic state. However, the distribution of traffic state always has characteristics of large spatial span and heterogeneity. This paper adapts the concept of community detection to the correlation network of urban traffic state and proposes a new perspective to identify the spatial correlation patterns of traffic state. In the proposed urban traffic network, the nodes represent road segments, and an edge between a pair of nodes is added depending on the result of significance test for the corresponding correlation of traffic state. Further, the process of community detection in the urban traffic network (named GWPA-K-means) is applied to analyze the spatial dependency of traffic state. The proposed method extends the traditional K-means algorithm in two steps: (i) redefines the initial cluster centers by two properties of nodes (the GWPA value and the minimum shortest path length); (ii) utilizes the weight signal propagation process to transfer the topological information of the urban traffic network into a node similarity matrix. Finally, numerical experiments are conducted on a simple network and a real urban road network in Beijing. The results show that GWPA-K-means algorithm is valid in spatial correlation analysis of traffic state. The network science and community structure analysis perform well in describing the spatial heterogeneity of traffic state on a large spatial scale.

[Co-author and keyword networks and their clustering appearance in preventive medicine fields in Korea: analysis of papers in the Journal of Preventive Medicine and Public Health, 1991~2006].

PubMed

Jung, Minsoo; Chung, Dongjun

2008-01-01

This study evaluated knowledge structure and its effect factor by analysis of co-author and keyword networks in Korea's preventive medicine sector. The data was extracted from 873 papers listed in the Journal of Preventive Medicine and Public Health, and was transformed into a co-author and keyword matrix where the existence of a 'link' was judged by impact factors calculated by the weight value of the role and rate of author participation. Research achievement was dependent upon the author's status and networking index, as analyzed by neighborhood degree, multidimensional scaling, correspondence analysis, and multiple regression. Co-author networks developed as randomness network in the center of a few high-productivity researchers. In particular, closeness centrality was more developed than degree centrality. Also, power law distribution was discovered in impact factor and research productivity by college affiliation. In multiple regression, the effect of the author's role was significant in both the impact factor calculated by the participatory rate and the number of listed articles. However, the number of listed articles varied by sex. This study shows that the small world phenomenon exists in co-author and keyword networks in a journal, as in citation networks. However, the differentiation of knowledge structure in the field of preventive medicine was relatively restricted by specialization.

Altered structural connectivity of pain-related brain network in burning mouth syndrome-investigation by graph analysis of probabilistic tractography.

PubMed

Wada, Akihiko; Shizukuishi, Takashi; Kikuta, Junko; Yamada, Haruyasu; Watanabe, Yusuke; Imamura, Yoshiki; Shinozaki, Takahiro; Dezawa, Ko; Haradome, Hiroki; Abe, Osamu

2017-05-01

Burning mouth syndrome (BMS) is a chronic intraoral pain syndrome featuring idiopathic oral pain and burning discomfort despite clinically normal oral mucosa. The etiology of chronic pain syndrome is unclear, but preliminary neuroimaging research has suggested the alteration of volume, metabolism, blood flow, and diffusion at multiple brain regions. According to the neuromatrix theory of Melzack, pain sense is generated in the brain by the network of multiple pain-related brain regions. Therefore, the alteration of pain-related network is also assumed as an etiology of chronic pain. In this study, we investigated the brain network of BMS brain by using probabilistic tractography and graph analysis. Fourteen BMS patients and 14 age-matched healthy controls underwent 1.5T MRI. Structural connectivity was calculated in 83 anatomically defined regions with probabilistic tractography of 60-axis diffusion tensor imaging and 3D T1-weighted imaging. Graph theory network analysis was used to evaluate the brain network at local and global connectivity. In BMS brain, a significant difference of local brain connectivity was recognized at the bilateral rostral anterior cingulate cortex, right medial orbitofrontal cortex, and left pars orbitalis which belong to the medial pain system; however, no significant difference was recognized at the lateral system including the somatic sensory cortex. A strengthened connection of the anterior cingulate cortex and medial prefrontal cortex with the basal ganglia, thalamus, and brain stem was revealed. Structural brain network analysis revealed the alteration of the medial system of the pain-related brain network in chronic pain syndrome.

Novel Design of a Soft Lightweight Pneumatic Continuum Robot Arm with Decoupled Variable Stiffness and Positioning.

PubMed

Giannaccini, Maria Elena; Xiang, Chaoqun; Atyabi, Adham; Theodoridis, Theo; Nefti-Meziani, Samia; Davis, Steve

2018-02-01

Soft robot arms possess unique capabilities when it comes to adaptability, flexibility, and dexterity. In addition, soft systems that are pneumatically actuated can claim high power-to-weight ratio. One of the main drawbacks of pneumatically actuated soft arms is that their stiffness cannot be varied independently from their end-effector position in space. The novel robot arm physical design presented in this article successfully decouples its end-effector positioning from its stiffness. An experimental characterization of this ability is coupled with a mathematical analysis. The arm combines the light weight, high payload to weight ratio and robustness of pneumatic actuation with the adaptability and versatility of variable stiffness. Light weight is a vital component of the inherent safety approach to physical human-robot interaction. To characterize the arm, a neural network analysis of the curvature of the arm for different input pressures is performed. The curvature-pressure relationship is also characterized experimentally.

Novel Design of a Soft Lightweight Pneumatic Continuum Robot Arm with Decoupled Variable Stiffness and Positioning

PubMed Central

Xiang, Chaoqun; Atyabi, Adham; Theodoridis, Theo; Nefti-Meziani, Samia; Davis, Steve

2018-01-01

Abstract Soft robot arms possess unique capabilities when it comes to adaptability, flexibility, and dexterity. In addition, soft systems that are pneumatically actuated can claim high power-to-weight ratio. One of the main drawbacks of pneumatically actuated soft arms is that their stiffness cannot be varied independently from their end-effector position in space. The novel robot arm physical design presented in this article successfully decouples its end-effector positioning from its stiffness. An experimental characterization of this ability is coupled with a mathematical analysis. The arm combines the light weight, high payload to weight ratio and robustness of pneumatic actuation with the adaptability and versatility of variable stiffness. Light weight is a vital component of the inherent safety approach to physical human-robot interaction. To characterize the arm, a neural network analysis of the curvature of the arm for different input pressures is performed. The curvature-pressure relationship is also characterized experimentally. PMID:29412080

Connectivity strength-weighted sparse group representation-based brain network construction for MCI classification.

PubMed

Yu, Renping; Zhang, Han; An, Le; Chen, Xiaobo; Wei, Zhihui; Shen, Dinggang

2017-05-01

Brain functional network analysis has shown great potential in understanding brain functions and also in identifying biomarkers for brain diseases, such as Alzheimer's disease (AD) and its early stage, mild cognitive impairment (MCI). In these applications, accurate construction of biologically meaningful brain network is critical. Sparse learning has been widely used for brain network construction; however, its l 1 -norm penalty simply penalizes each edge of a brain network equally, without considering the original connectivity strength which is one of the most important inherent linkwise characters. Besides, based on the similarity of the linkwise connectivity, brain network shows prominent group structure (i.e., a set of edges sharing similar attributes). In this article, we propose a novel brain functional network modeling framework with a "connectivity strength-weighted sparse group constraint." In particular, the network modeling can be optimized by considering both raw connectivity strength and its group structure, without losing the merit of sparsity. Our proposed method is applied to MCI classification, a challenging task for early AD diagnosis. Experimental results based on the resting-state functional MRI, from 50 MCI patients and 49 healthy controls, show that our proposed method is more effective (i.e., achieving a significantly higher classification accuracy, 84.8%) than other competing methods (e.g., sparse representation, accuracy = 65.6%). Post hoc inspection of the informative features further shows more biologically meaningful brain functional connectivities obtained by our proposed method. Hum Brain Mapp 38:2370-2383, 2017. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Insight to the express transport network

NASA Astrophysics Data System (ADS)

Yang, Hua; Nie, Yuchao; Zhang, Hongbin; Di, Zengru; Fan, Ying

2009-09-01

The express delivery industry is developing rapidly in recent years and has attracted attention in many fields. Express shipment service requires that parcels be delivered in a limited time with a low operation cost, which requests a high level and efficient express transport network (ETN). The ETN is constructed based on the public transport networks, especially the airline network. It is similar to the airline network in some aspects, while it has its own feature. With the complex network theory, the topological properties of the ETN are analyzed deeply. We find that the ETN has the small-world property, with disassortative mixing behavior and rich club phenomenon. It also shows difference from the airline network in some features, such as edge density and average shortest path. Analysis on the corresponding distance-weighted network shows that the distance distribution displays a truncated power-law behavior. At last, an evolving model, which takes both geographical constraint and preference attachment into account, is proposed. The model shows similar properties with the empirical results.

Weighted complex network analysis of the Beijing subway system: Train and passenger flows

NASA Astrophysics Data System (ADS)

Feng, Jia; Li, Xiamiao; Mao, Baohua; Xu, Qi; Bai, Yun

2017-05-01

In recent years, complex network theory has become an important approach to the study of the structure and dynamics of traffic networks. However, because traffic data is difficult to collect, previous studies have usually focused on the physical topology of subway systems, whereas few studies have considered the characteristics of traffic flows through the network. Therefore, in this paper, we present a multi-layer model to analyze traffic flow patterns in subway networks, based on trip data and an operation timetable obtained from the Beijing Subway System. We characterize the patterns in terms of the spatiotemporal flow size distributions of both the train flow network and the passenger flow network. In addition, we describe the essential interactions between these two networks based on statistical analyses. The results of this study suggest that layered models of transportation systems can elucidate fundamental differences between the coexisting traffic flows and can also clarify the mechanism that causes these differences.

Weighted Optimization-Based Distributed Kalman Filter for Nonlinear Target Tracking in Collaborative Sensor Networks.

PubMed

Chen, Jie; Li, Jiahong; Yang, Shuanghua; Deng, Fang

2017-11-01

The identification of the nonlinearity and coupling is crucial in nonlinear target tracking problem in collaborative sensor networks. According to the adaptive Kalman filtering (KF) method, the nonlinearity and coupling can be regarded as the model noise covariance, and estimated by minimizing the innovation or residual errors of the states. However, the method requires large time window of data to achieve reliable covariance measurement, making it impractical for nonlinear systems which are rapidly changing. To deal with the problem, a weighted optimization-based distributed KF algorithm (WODKF) is proposed in this paper. The algorithm enlarges the data size of each sensor by the received measurements and state estimates from its connected sensors instead of the time window. A new cost function is set as the weighted sum of the bias and oscillation of the state to estimate the "best" estimate of the model noise covariance. The bias and oscillation of the state of each sensor are estimated by polynomial fitting a time window of state estimates and measurements of the sensor and its neighbors weighted by the measurement noise covariance. The best estimate of the model noise covariance is computed by minimizing the weighted cost function using the exhaustive method. The sensor selection method is in addition to the algorithm to decrease the computation load of the filter and increase the scalability of the sensor network. The existence, suboptimality and stability analysis of the algorithm are given. The local probability data association method is used in the proposed algorithm for the multitarget tracking case. The algorithm is demonstrated in simulations on tracking examples for a random signal, one nonlinear target, and four nonlinear targets. Results show the feasibility and superiority of WODKF against other filtering algorithms for a large class of systems.

Identifying key genes in rheumatoid arthritis by weighted gene co-expression network analysis.

PubMed

Ma, Chunhui; Lv, Qi; Teng, Songsong; Yu, Yinxian; Niu, Kerun; Yi, Chengqin

2017-08-01

This study aimed to identify rheumatoid arthritis (RA) related genes based on microarray data using the WGCNA (weighted gene co-expression network analysis) method. Two gene expression profile datasets GSE55235 (10 RA samples and 10 healthy controls) and GSE77298 (16 RA samples and seven healthy controls) were downloaded from Gene Expression Omnibus database. Characteristic genes were identified using metaDE package. WGCNA was used to find disease-related networks based on gene expression correlation coefficients, and module significance was defined as the average gene significance of all genes used to assess the correlation between the module and RA status. Genes in the disease-related gene co-expression network were subject to functional annotation and pathway enrichment analysis using Database for Annotation Visualization and Integrated Discovery. Characteristic genes were also mapped to the Connectivity Map to screen small molecules. A total of 599 characteristic genes were identified. For each dataset, characteristic genes in the green, red and turquoise modules were most closely associated with RA, with gene numbers of 54, 43 and 79, respectively. These genes were enriched in totally enriched in 17 Gene Ontology terms, mainly related to immune response (CD97, FYB, CXCL1, IKBKE, CCR1, etc.), inflammatory response (CD97, CXCL1, C3AR1, CCR1, LYZ, etc.) and homeostasis (C3AR1, CCR1, PLN, CCL19, PPT1, etc.). Two small-molecule drugs sanguinarine and papaverine were predicted to have a therapeutic effect against RA. Genes related to immune response, inflammatory response and homeostasis presumably have critical roles in RA pathogenesis. Sanguinarine and papaverine have a potential therapeutic effect against RA. © 2017 Asia Pacific League of Associations for Rheumatology and John Wiley & Sons Australia, Ltd.

Investigating the Influence Relationship Models for Stocks in Indian Equity Market: A Weighted Network Modelling Study

PubMed Central

Acharjee, Animesh

2016-01-01

The socio-economic systems today possess high levels of both interconnectedness and interdependencies, and such system-level relationships behave very dynamically. In such situations, it is all around perceived that influence is a perplexing power that has an overseeing part in affecting the dynamics and behaviours of involved ones. As a result of the force & direction of influence, the transformative change of one entity has a cogent aftereffect on the other entities in the system. The current study employs directed weighted networks for investigating the influential relationship patterns existent in a typical equity market as an outcome of inter-stock interactions happening at the market level, the sectorial level and the industrial level. The study dataset is derived from 335 constituent stocks of ‘Standard & Poor Bombay Stock Exchange 500 index’ and study period is 1st June 2005 to 30th June 2015. The study identifies the set of most dynamically influential stocks & their respective temporal pattern at three hierarchical levels: the complete equity market, different sectors, and constituting industry segments of those sectors. A detailed influence relationship analysis is performed for the sectorial level network of the construction sector, and it was found that stocks belonging to the cement industry possessed high influence within this sector. Also, the detailed network analysis of construction sector revealed that it follows scale-free characteristics and power law distribution. In the industry specific influence relationship analysis for cement industry, methods based on threshold filtering and minimum spanning tree were employed to derive a set of sub-graphs having temporally stable high-correlation structure over this ten years period. PMID:27846251

Investigating the Influence Relationship Models for Stocks in Indian Equity Market: A Weighted Network Modelling Study.

PubMed

Bhattacharjee, Biplab; Shafi, Muhammad; Acharjee, Animesh

2016-01-01

The socio-economic systems today possess high levels of both interconnectedness and interdependencies, and such system-level relationships behave very dynamically. In such situations, it is all around perceived that influence is a perplexing power that has an overseeing part in affecting the dynamics and behaviours of involved ones. As a result of the force & direction of influence, the transformative change of one entity has a cogent aftereffect on the other entities in the system. The current study employs directed weighted networks for investigating the influential relationship patterns existent in a typical equity market as an outcome of inter-stock interactions happening at the market level, the sectorial level and the industrial level. The study dataset is derived from 335 constituent stocks of 'Standard & Poor Bombay Stock Exchange 500 index' and study period is 1st June 2005 to 30th June 2015. The study identifies the set of most dynamically influential stocks & their respective temporal pattern at three hierarchical levels: the complete equity market, different sectors, and constituting industry segments of those sectors. A detailed influence relationship analysis is performed for the sectorial level network of the construction sector, and it was found that stocks belonging to the cement industry possessed high influence within this sector. Also, the detailed network analysis of construction sector revealed that it follows scale-free characteristics and power law distribution. In the industry specific influence relationship analysis for cement industry, methods based on threshold filtering and minimum spanning tree were employed to derive a set of sub-graphs having temporally stable high-correlation structure over this ten years period.

CerebralWeb: a Cytoscape.js plug-in to visualize networks stratified by subcellular localization.

PubMed

Frias, Silvia; Bryan, Kenneth; Brinkman, Fiona S L; Lynn, David J

2015-01-01

CerebralWeb is a light-weight JavaScript plug-in that extends Cytoscape.js to enable fast and interactive visualization of molecular interaction networks stratified based on subcellular localization or other user-supplied annotation. The application is designed to be easily integrated into any website and is configurable to support customized network visualization. CerebralWeb also supports the automatic retrieval of Cerebral-compatible localizations for human, mouse and bovine genes via a web service and enables the automated parsing of Cytoscape compatible XGMML network files. CerebralWeb currently supports embedded network visualization on the InnateDB (www.innatedb.com) and Allergy and Asthma Portal (allergen.innatedb.com) database and analysis resources. Database tool URL: http://www.innatedb.com/CerebralWeb © The Author(s) 2015. Published by Oxford University Press.

TreeNetViz: revealing patterns of networks over tree structures.

PubMed

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

A rapid learning and dynamic stepwise updating algorithm for flat neural networks and the application to time-series prediction.

PubMed

Chen, C P; Wan, J Z

1999-01-01

A fast learning algorithm is proposed to find an optimal weights of the flat neural networks (especially, the functional-link network). Although the flat networks are used for nonlinear function approximation, they can be formulated as linear systems. Thus, the weights of the networks can be solved easily using a linear least-square method. This formulation makes it easier to update the weights instantly for both a new added pattern and a new added enhancement node. A dynamic stepwise updating algorithm is proposed to update the weights of the system on-the-fly. The model is tested on several time-series data including an infrared laser data set, a chaotic time-series, a monthly flour price data set, and a nonlinear system identification problem. The simulation results are compared to existing models in which more complex architectures and more costly training are needed. The results indicate that the proposed model is very attractive to real-time processes.

Efficacy, acceptability, and tolerability of antipsychotics in children and adolescents with schizophrenia: A network meta-analysis.

PubMed

Krause, Marc; Zhu, Yikang; Huhn, Maximilian; Schneider-Thoma, Johannes; Bighelli, Irene; Chaimani, Anna; Leucht, Stefan

2018-06-01

Children and adolescents with schizophrenia are a particularly vulnerable group. Thus, we integrated all the randomized evidence from the available antipsychotics used for this subgroup by performing a network-meta-analysis and pairwise meta-analysis using a random-effects model. We searched multiple databases up to Nov 17, 2016 (final update search in PubMed: Dec 12, 2017). The primary outcome was efficacy as measured by overall change/endpoint in symptoms of schizophrenia. Secondary outcomes included positive and negative symptoms, response, dropouts, quality of life, social functioning, weight gain, sedation, prolactin, extrapyramidal side effects (EPS) and antiparkinsonian medication. Twenty-eight randomized controlled trials (RCTs) with 3003 unique participants (58% males; mean age 14.41 years) published from 1967 to 2017 were identified. Clozapine was significantly more effective than all other analyzed antipsychotics. Nearly all antipsychotics were more efficacious compared to placebo, but ziprasidone showed no efficacy. In terms of preventing weight gain, molindone, lurasidone and ziprasidone were benign. The highest weight gain was found for clozapine, quetiapine and olanzapine. Most antipsychotics had some sedating effects. Risperidone, haloperidol, paliperidone and olanzapine were associated with prolactin increase. There were evidence gaps for some drugs and many outcomes, especially safety outcomes. Most of the comparisons are based only on one study or just on indirect evidence. Nevertheless, the available direct and indirect evidence showed that the treatment effects were similar compared to findings in adult patients with schizophrenia. Copyright © 2018 Elsevier B.V. and ECNP. All rights reserved.

A Complex Network Approach to Distributional Semantic Models

PubMed Central

Utsumi, Akira

2015-01-01

A number of studies on network analysis have focused on language networks based on free word association, which reflects human lexical knowledge, and have demonstrated the small-world and scale-free properties in the word association network. Nevertheless, there have been very few attempts at applying network analysis to distributional semantic models, despite the fact that these models have been studied extensively as computational or cognitive models of human lexical knowledge. In this paper, we analyze three network properties, namely, small-world, scale-free, and hierarchical properties, of semantic networks created by distributional semantic models. We demonstrate that the created networks generally exhibit the same properties as word association networks. In particular, we show that the distribution of the number of connections in these networks follows the truncated power law, which is also observed in an association network. This indicates that distributional semantic models can provide a plausible model of lexical knowledge. Additionally, the observed differences in the network properties of various implementations of distributional semantic models are consistently explained or predicted by considering the intrinsic semantic features of a word-context matrix and the functions of matrix weighting and smoothing. Furthermore, to simulate a semantic network with the observed network properties, we propose a new growing network model based on the model of Steyvers and Tenenbaum. The idea underlying the proposed model is that both preferential and random attachments are required to reflect different types of semantic relations in network growth process. We demonstrate that this model provides a better explanation of network behaviors generated by distributional semantic models. PMID:26295940

Backbone of complex networks of corporations: the flow of control.

PubMed

Glattfelder, J B; Battiston, S

2009-09-01

We present a methodology to extract the backbone of complex networks based on the weight and direction of links, as well as on nontopological properties of nodes. We show how the methodology can be applied in general to networks in which mass or energy is flowing along the links. In particular, the procedure enables us to address important questions in economics, namely, how control and wealth are structured and concentrated across national markets. We report on the first cross-country investigation of ownership networks, focusing on the stock markets of 48 countries around the world. On the one hand, our analysis confirms results expected on the basis of the literature on corporate control, namely, that in Anglo-Saxon countries control tends to be dispersed among numerous shareholders. On the other hand, it also reveals that in the same countries, control is found to be highly concentrated at the global level, namely, lying in the hands of very few important shareholders. Interestingly, the exact opposite is observed for European countries. These results have previously not been reported as they are not observable without the kind of network analysis developed here.

Backbone of complex networks of corporations: The flow of control

NASA Astrophysics Data System (ADS)

Glattfelder, J. B.; Battiston, S.

2009-09-01

We present a methodology to extract the backbone of complex networks based on the weight and direction of links, as well as on nontopological properties of nodes. We show how the methodology can be applied in general to networks in which mass or energy is flowing along the links. In particular, the procedure enables us to address important questions in economics, namely, how control and wealth are structured and concentrated across national markets. We report on the first cross-country investigation of ownership networks, focusing on the stock markets of 48 countries around the world. On the one hand, our analysis confirms results expected on the basis of the literature on corporate control, namely, that in Anglo-Saxon countries control tends to be dispersed among numerous shareholders. On the other hand, it also reveals that in the same countries, control is found to be highly concentrated at the global level, namely, lying in the hands of very few important shareholders. Interestingly, the exact opposite is observed for European countries. These results have previously not been reported as they are not observable without the kind of network analysis developed here.

Social networking strategies that aim to reduce obesity have achieved significant although modest results.

PubMed

Ashrafian, Hutan; Toma, Tania; Harling, Leanne; Kerr, Karen; Athanasiou, Thanos; Darzi, Ara

2014-09-01

The global epidemic of obesity continues to escalate. Obesity accounts for an increasing proportion of the international socioeconomic burden of noncommunicable disease. Online social networking services provide an effective medium through which information may be exchanged between obese and overweight patients and their health care providers, potentially contributing to superior weight-loss outcomes. We performed a systematic review and meta-analysis to assess the role of these services in modifying body mass index (BMI). Our analysis of twelve studies found that interventions using social networking services produced a modest but significant 0.64 percent reduction in BMI from baseline for the 941 people who participated in the studies' interventions. We recommend that social networking services that target obesity should be the subject of further clinical trials. Additionally, we recommend that policy makers adopt reforms that promote the use of anti-obesity social networking services, facilitate multistakeholder partnerships in such services, and create a supportive environment to confront obesity and its associated noncommunicable diseases. Project HOPE—The People-to-People Health Foundation, Inc.

Nonlinear dimensionality reduction of electroencephalogram (EEG) for Brain Computer interfaces.

PubMed

Teli, Mohammad Nayeem; Anderson, Charles

2009-01-01

Patterns in electroencephalogram (EEG) signals are analyzed for a Brain Computer Interface (BCI). An important aspect of this analysis is the work on transformations of high dimensional EEG data to low dimensional spaces in which we can classify the data according to mental tasks being performed. In this research we investigate how a Neural Network (NN) in an auto-encoder with bottleneck configuration can find such a transformation. We implemented two approximate second-order methods to optimize the weights of these networks, because the more common first-order methods are very slow to converge for networks like these with more than three layers of computational units. The resulting non-linear projections of time embedded EEG signals show interesting separations that are related to tasks. The bottleneck networks do indeed discover nonlinear transformations to low-dimensional spaces that capture much of the information present in EEG signals. However, the resulting low-dimensional representations do not improve classification rates beyond what is possible using Quadratic Discriminant Analysis (QDA) on the original time-lagged EEG.

Spatial fingerprints of community structure in human interaction network for an extensive set of large-scale regions.

PubMed

Kallus, Zsófia; Barankai, Norbert; Szüle, János; Vattay, Gábor

2015-01-01

Human interaction networks inferred from country-wide telephone activity recordings were recently used to redraw political maps by projecting their topological partitions into geographical space. The results showed remarkable spatial cohesiveness of the network communities and a significant overlap between the redrawn and the administrative borders. Here we present a similar analysis based on one of the most popular online social networks represented by the ties between more than 5.8 million of its geo-located users. The worldwide coverage of their measured activity allowed us to analyze the large-scale regional subgraphs of entire continents and an extensive set of examples for single countries. We present results for North and South America, Europe and Asia. In our analysis we used the well-established method of modularity clustering after an aggregation of the individual links into a weighted graph connecting equal-area geographical pixels. Our results show fingerprints of both of the opposing forces of dividing local conflicts and of uniting cross-cultural trends of globalization.

Sequence-based model of gap gene regulatory network.

PubMed

Kozlov, Konstantin; Gursky, Vitaly; Kulakovskiy, Ivan; Samsonova, Maria

2014-01-01

The detailed analysis of transcriptional regulation is crucially important for understanding biological processes. The gap gene network in Drosophila attracts large interest among researches studying mechanisms of transcriptional regulation. It implements the most upstream regulatory layer of the segmentation gene network. The knowledge of molecular mechanisms involved in gap gene regulation is far less complete than that of genetics of the system. Mathematical modeling goes beyond insights gained by genetics and molecular approaches. It allows us to reconstruct wild-type gene expression patterns in silico, infer underlying regulatory mechanism and prove its sufficiency. We developed a new model that provides a dynamical description of gap gene regulatory systems, using detailed DNA-based information, as well as spatial transcription factor concentration data at varying time points. We showed that this model correctly reproduces gap gene expression patterns in wild type embryos and is able to predict gap expression patterns in Kr mutants and four reporter constructs. We used four-fold cross validation test and fitting to random dataset to validate the model and proof its sufficiency in data description. The identifiability analysis showed that most model parameters are well identifiable. We reconstructed the gap gene network topology and studied the impact of individual transcription factor binding sites on the model output. We measured this impact by calculating the site regulatory weight as a normalized difference between the residual sum of squares error for the set of all annotated sites and for the set with the site of interest excluded. The reconstructed topology of the gap gene network is in agreement with previous modeling results and data from literature. We showed that 1) the regulatory weights of transcription factor binding sites show very weak correlation with their PWM score; 2) sites with low regulatory weight are important for the model output; 3) functional important sites are not exclusively located in cis-regulatory elements, but are rather dispersed through regulatory region. It is of importance that some of the sites with high functional impact in hb, Kr and kni regulatory regions coincide with strong sites annotated and verified in Dnase I footprint assays.

An Approximation of the Error Backpropagation Algorithm in a Predictive Coding Network with Local Hebbian Synaptic Plasticity

PubMed Central

Whittington, James C. R.; Bogacz, Rafal

2017-01-01

To efficiently learn from feedback, cortical networks need to update synaptic weights on multiple levels of cortical hierarchy. An effective and well-known algorithm for computing such changes in synaptic weights is the error backpropagation algorithm. However, in this algorithm, the change in synaptic weights is a complex function of weights and activities of neurons not directly connected with the synapse being modified, whereas the changes in biological synapses are determined only by the activity of presynaptic and postsynaptic neurons. Several models have been proposed that approximate the backpropagation algorithm with local synaptic plasticity, but these models require complex external control over the network or relatively complex plasticity rules. Here we show that a network developed in the predictive coding framework can efficiently perform supervised learning fully autonomously, employing only simple local Hebbian plasticity. Furthermore, for certain parameters, the weight change in the predictive coding model converges to that of the backpropagation algorithm. This suggests that it is possible for cortical networks with simple Hebbian synaptic plasticity to implement efficient learning algorithms in which synapses in areas on multiple levels of hierarchy are modified to minimize the error on the output. PMID:28333583

An Approximation of the Error Backpropagation Algorithm in a Predictive Coding Network with Local Hebbian Synaptic Plasticity.

PubMed

Whittington, James C R; Bogacz, Rafal

2017-05-01

To efficiently learn from feedback, cortical networks need to update synaptic weights on multiple levels of cortical hierarchy. An effective and well-known algorithm for computing such changes in synaptic weights is the error backpropagation algorithm. However, in this algorithm, the change in synaptic weights is a complex function of weights and activities of neurons not directly connected with the synapse being modified, whereas the changes in biological synapses are determined only by the activity of presynaptic and postsynaptic neurons. Several models have been proposed that approximate the backpropagation algorithm with local synaptic plasticity, but these models require complex external control over the network or relatively complex plasticity rules. Here we show that a network developed in the predictive coding framework can efficiently perform supervised learning fully autonomously, employing only simple local Hebbian plasticity. Furthermore, for certain parameters, the weight change in the predictive coding model converges to that of the backpropagation algorithm. This suggests that it is possible for cortical networks with simple Hebbian synaptic plasticity to implement efficient learning algorithms in which synapses in areas on multiple levels of hierarchy are modified to minimize the error on the output.

Mitigation of epidemics in contact networks through optimal contact adaptation *

PubMed Central

Youssef, Mina; Scoglio, Caterina

2013-01-01

This paper presents an optimal control problem formulation to minimize the total number of infection cases during the spread of susceptible-infected-recovered SIR epidemics in contact networks. In the new approach, contact weighted are reduced among nodes and a global minimum contact level is preserved in the network. In addition, the infection cost and the cost associated with the contact reduction are linearly combined in a single objective function. Hence, the optimal control formulation addresses the tradeoff between minimization of total infection cases and minimization of contact weights reduction. Using Pontryagin theorem, the obtained solution is a unique candidate representing the dynamical weighted contact network. To find the near-optimal solution in a decentralized way, we propose two heuristics based on Bang-Bang control function and on a piecewise nonlinear control function, respectively. We perform extensive simulations to evaluate the two heuristics on different networks. Our results show that the piecewise nonlinear control function outperforms the well-known Bang-Bang control function in minimizing both the total number of infection cases and the reduction of contact weights. Finally, our results show awareness of the infection level at which the mitigation strategies are effectively applied to the contact weights. PMID:23906209

Mitigation of epidemics in contact networks through optimal contact adaptation.

PubMed

Youssef, Mina; Scoglio, Caterina

2013-08-01

This paper presents an optimal control problem formulation to minimize the total number of infection cases during the spread of susceptible-infected-recovered SIR epidemics in contact networks. In the new approach, contact weighted are reduced among nodes and a global minimum contact level is preserved in the network. In addition, the infection cost and the cost associated with the contact reduction are linearly combined in a single objective function. Hence, the optimal control formulation addresses the tradeoff between minimization of total infection cases and minimization of contact weights reduction. Using Pontryagin theorem, the obtained solution is a unique candidate representing the dynamical weighted contact network. To find the near-optimal solution in a decentralized way, we propose two heuristics based on Bang-Bang control function and on a piecewise nonlinear control function, respectively. We perform extensive simulations to evaluate the two heuristics on different networks. Our results show that the piecewise nonlinear control function outperforms the well-known Bang-Bang control function in minimizing both the total number of infection cases and the reduction of contact weights. Finally, our results show awareness of the infection level at which the mitigation strategies are effectively applied to the contact weights.

Asymmetric network connectivity using weighted harmonic averages

NASA Astrophysics Data System (ADS)

Morrison, Greg; Mahadevan, L.

2011-02-01

We propose a non-metric measure of the "closeness" felt between two nodes in an undirected, weighted graph using a simple weighted harmonic average of connectivity, that is a real-valued Generalized Erdös Number (GEN). While our measure is developed with a collaborative network in mind, the approach can be of use in a variety of artificial and real-world networks. We are able to distinguish between network topologies that standard distance metrics view as identical, and use our measure to study some simple analytically tractable networks. We show how this might be used to look at asymmetry in authorship networks such as those that inspired the integer Erdös numbers in mathematical coauthorships. We also show the utility of our approach to devise a ratings scheme that we apply to the data from the NetFlix prize, and find a significant improvement using our method over a baseline.

Using structural equation modeling for network meta-analysis.

PubMed

Tu, Yu-Kang; Wu, Yun-Chun

2017-07-14

Network meta-analysis overcomes the limitations of traditional pair-wise meta-analysis by incorporating all available evidence into a general statistical framework for simultaneous comparisons of several treatments. Currently, network meta-analyses are undertaken either within the Bayesian hierarchical linear models or frequentist generalized linear mixed models. Structural equation modeling (SEM) is a statistical method originally developed for modeling causal relations among observed and latent variables. As random effect is explicitly modeled as a latent variable in SEM, it is very flexible for analysts to specify complex random effect structure and to make linear and nonlinear constraints on parameters. The aim of this article is to show how to undertake a network meta-analysis within the statistical framework of SEM. We used an example dataset to demonstrate the standard fixed and random effect network meta-analysis models can be easily implemented in SEM. It contains results of 26 studies that directly compared three treatment groups A, B and C for prevention of first bleeding in patients with liver cirrhosis. We also showed that a new approach to network meta-analysis based on the technique of unrestricted weighted least squares (UWLS) method can also be undertaken using SEM. For both the fixed and random effect network meta-analysis, SEM yielded similar coefficients and confidence intervals to those reported in the previous literature. The point estimates of two UWLS models were identical to those in the fixed effect model but the confidence intervals were greater. This is consistent with results from the traditional pairwise meta-analyses. Comparing to UWLS model with common variance adjusted factor, UWLS model with unique variance adjusted factor has greater confidence intervals when the heterogeneity was larger in the pairwise comparison. The UWLS model with unique variance adjusted factor reflects the difference in heterogeneity within each comparison. SEM provides a very flexible framework for univariate and multivariate meta-analysis, and its potential as a powerful tool for advanced meta-analysis is still to be explored.

Development and Efficacy Testing of a Social Network-Based Competitive Application for Weight Loss.

PubMed

Lee, Jisan; Kim, Jeongeun

2016-05-01

Although a lot of people continuously try to lose weight, the obesity rate has remained high: 36.9% of males and 38.0% of females worldwide in 2013. This suggests the need for a new intervention. In this study, we designed a smartphone application, With U, to aid weight loss by using an offline social network of friends and an online social network, Facebook. To determine the effects of With U, this study was designed as a one-group pretest-posttest design. Overweight, obese, and severely obese adults 20-40 years old, along with their friends, participated in this study. A total of 10 pairs attempted to lose weight for 4 weeks. We used a questionnaire to measure general characteristics, motivation, and intent to continue to use With U, and the Inbody720 (Biospace, Seoul, Republic of Korea) body composition analyzer was used to measure physical characteristics. In addition, we briefly interviewed the participants about their experience. We observed statistically significant effects in terms of motivation to lose weight and the amount of weight loss. Changes in physical characteristics beyond weight loss also showed positive trends. Also, we discovered some interesting facts during the interviews. The weight loss effect was greater when the team members met more and the relationship between the challengers was more direct and intimate. The application With U, designed and developed to allow friends to challenge each other to lose weight, affected both motivation to lose weight and the amount of weight loss. In the future, effects of smartphone applications for health management with social networks need to be studied further.

Information networks in the stock market based on the distance of the multi-attribute dimensions between listed companies

NASA Astrophysics Data System (ADS)

Liu, Qian; Li, Huajiao; Liu, Xueyong; Jiang, Meihui

2018-04-01

In the stock market, there are widespread information connections between economic agents. Listed companies can obtain mutual information about investment decisions from common shareholders, and the extent of sharing information often determines the relationships between listed companies. Because different shareholder compositions and investment shares lead to different formations of the company's governance mechanisms, we map the investment relationships between shareholders to the multi-attribute dimensional spaces of the listed companies (each shareholder investment in a company is a company dimension). Then, we construct the listed company's information network based on co-shareholder relationships. The weights for the edges in the information network are measured with the Euclidean distance between the listed companies in the multi-attribute dimension space. We define two indices to analyze the information network's features. We conduct an empirical study that analyzes Chinese listed companies' information networks. The results from the analysis show that with the diversification and decentralization of shareholder investments, almost all Chinese listed companies exchanged information through common shareholder relationships, and there is a gradual reduction in information sharing capacity between listed companies that have common shareholders. This network analysis has benefits for risk management and portfolio investments.

Investigation of global and local network properties of music perception with culturally different styles of music.

PubMed

Li, Yan; Rui, Xue; Li, Shuyu; Pu, Fang

2014-11-01

Graph theoretical analysis has recently become a popular research tool in neuroscience, however, there have been very few studies on brain responses to music perception, especially when culturally different styles of music are involved. Electroencephalograms were recorded from ten subjects listening to Chinese traditional music, light music and western classical music. For event-related potentials, phase coherence was calculated in the alpha band and then constructed into correlation matrices. Clustering coefficients and characteristic path lengths were evaluated for global properties, while clustering coefficients and efficiency were assessed for local network properties. Perception of light music and western classical music manifested small-world network properties, especially with a relatively low proportion of weights of correlation matrices. For local analysis, efficiency was more discernible than clustering coefficient. Nevertheless, there was no significant discrimination between Chinese traditional and western classical music perception. Perception of different styles of music introduces different network properties, both globally and locally. Research into both global and local network properties has been carried out in other areas; however, this is a preliminary investigation aimed at suggesting a possible new approach to brain network properties in music perception. Copyright © 2014 Elsevier Ltd. All rights reserved.

49 CFR 1180.1 - General policy statement for merger or control of at least two Class I railroads.

Code of Federal Regulations, 2012 CFR

2012-10-01

... Transportation (Continued) SURFACE TRANSPORTATION BOARD, DEPARTMENT OF TRANSPORTATION RULES OF PRACTICE RAILROAD... the railroad industry (including Class II and III carriers) is a network of competing and... weight in our analysis. Applicants shall make a good faith effort to calculate the net public benefits...

49 CFR 1180.1 - General policy statement for merger or control of at least two Class I railroads.

Code of Federal Regulations, 2013 CFR

2013-10-01

... Transportation (Continued) SURFACE TRANSPORTATION BOARD, DEPARTMENT OF TRANSPORTATION RULES OF PRACTICE RAILROAD... the railroad industry (including Class II and III carriers) is a network of competing and... weight in our analysis. Applicants shall make a good faith effort to calculate the net public benefits...

49 CFR 1180.1 - General policy statement for merger or control of at least two Class I railroads.

Code of Federal Regulations, 2011 CFR

2011-10-01

... Transportation (Continued) SURFACE TRANSPORTATION BOARD, DEPARTMENT OF TRANSPORTATION RULES OF PRACTICE RAILROAD... the railroad industry (including Class II and III carriers) is a network of competing and... weight in our analysis. Applicants shall make a good faith effort to calculate the net public benefits...

49 CFR 1180.1 - General policy statement for merger or control of at least two Class I railroads.

Code of Federal Regulations, 2014 CFR

2014-10-01

... Transportation (Continued) SURFACE TRANSPORTATION BOARD, DEPARTMENT OF TRANSPORTATION RULES OF PRACTICE RAILROAD... the railroad industry (including Class II and III carriers) is a network of competing and... weight in our analysis. Applicants shall make a good faith effort to calculate the net public benefits...

An Effective Collaborative Mobile Weighted Clustering Schemes for Energy Balancing in Wireless Sensor Networks.

PubMed

Tang, Chengpei; Shokla, Sanesy Kumcr; Modhawar, George; Wang, Qiang

2016-02-19

Collaborative strategies for mobile sensor nodes ensure the efficiency and the robustness of data processing, while limiting the required communication bandwidth. In order to solve the problem of pipeline inspection and oil leakage monitoring, a collaborative weighted mobile sensing scheme is proposed. By adopting a weighted mobile sensing scheme, the adaptive collaborative clustering protocol can realize an even distribution of energy load among the mobile sensor nodes in each round, and make the best use of battery energy. A detailed theoretical analysis and experimental results revealed that the proposed protocol is an energy efficient collaborative strategy such that the sensor nodes can communicate with a fusion center and produce high power gain.

The network organisation of consumer complaints

NASA Astrophysics Data System (ADS)

Rocha, L. E. C.; Holme, P.

2010-07-01

Interaction between consumers and companies can create conflict. When a consensus is unreachable there are legal authorities to resolve the case. This letter is a study of data from the Brazilian Department of Justice from which we build a bipartite network of categories of complaints linked to the companies receiving those complaints. We find the complaint categories organised in an hierarchical way where companies only get complaints of lower degree if they already got complaints of higher degree. The fraction of resolved complaints for a company appears to be nearly independent of the equity of the company but is positively correlated with the total number of complaints received. We construct feature vectors based on the edge-weight —the weight of an edge represents the times complaints of a category have been filed against that company— and use these vectors to study the similarity between the categories of complaints. From this analysis, we obtain trees mapping the hierarchical organisation of the complaints. We also apply principal component analysis to the set of feature vectors concluding that a reduction of the dimensionality of these from 8827 to 27 gives an optimal hierarchical representation.

Classification of Exacerbation Frequency in the COPDGene Cohort Using Deep Learning with Deep Belief Networks.

PubMed

Ying, Jun; Dutta, Joyita; Guo, Ning; Hu, Chenhui; Zhou, Dan; Sitek, Arkadiusz; Li, Quanzheng

2016-12-21

This study aims to develop an automatic classifier based on deep learning for exacerbation frequency in patients with chronic obstructive pulmonary disease (COPD). A threelayer deep belief network (DBN) with two hidden layers and one visible layer was employed to develop classification models and the models' robustness to exacerbation was analyzed. Subjects from the COPDGene cohort were labeled with exacerbation frequency, defined as the number of exacerbation events per year. 10,300 subjects with 361 features each were included in the analysis. After feature selection and parameter optimization, the proposed classification method achieved an accuracy of 91.99%, using a 10-fold cross validation experiment. The analysis of DBN weights showed that there was a good visual spatial relationship between the underlying critical features of different layers. Our findings show that the most sensitive features obtained from the DBN weights are consistent with the consensus showed by clinical rules and standards for COPD diagnostics. We thus demonstrate that DBN is a competitive tool for exacerbation risk assessment for patients suffering from COPD.

Analysis of adaptive algorithms for an integrated communication network

NASA Technical Reports Server (NTRS)

Reed, Daniel A.; Barr, Matthew; Chong-Kwon, Kim

1985-01-01

Techniques were examined that trade communication bandwidth for decreased transmission delays. When the network is lightly used, these schemes attempt to use additional network resources to decrease communication delays. As the network utilization rises, the schemes degrade gracefully, still providing service but with minimal use of the network. Because the schemes use a combination of circuit and packet switching, they should respond to variations in the types and amounts of network traffic. Also, a combination of circuit and packet switching to support the widely varying traffic demands imposed on an integrated network was investigated. The packet switched component is best suited to bursty traffic where some delays in delivery are acceptable. The circuit switched component is reserved for traffic that must meet real time constraints. Selected packet routing algorithms that might be used in an integrated network were simulated. An integrated traffic places widely varying workload demands on a network. Adaptive algorithms were identified, ones that respond to both the transient and evolutionary changes that arise in integrated networks. A new algorithm was developed, hybrid weighted routing, that adapts to workload changes.

Hybrid optoelectronic neural networks using a mutually pumped phase-conjugate mirror

NASA Astrophysics Data System (ADS)

Dunning, G. J.; Owechko, Y.; Soffer, B. H.

1991-06-01

A method is described for interconnecting hybrid optoelectronic neural networks by using a mutually pumped phase conjugate mirror (MP-PCM). In this method, cross talk due to Bragg degeneracies is greatly reduced by storing each weight among many spatially and angularly multiplexed gratings. The effective weight throughput is increased by the parallel updating of weights using outer-product learning. Experiments demonstrated a high degree of interconnectivity between adjacent pixels. A diagram is presented showing the architecture for the optoelectronic neural network using an MP-PCM.

Cellular telephone-based radiation detection instrument

DOEpatents

Craig, William W [Pittsburg, CA; Labov, Simon E [Berkeley, CA

2011-06-14

A network of radiation detection instruments, each having a small solid state radiation sensor module integrated into a cellular phone for providing radiation detection data and analysis directly to a user. The sensor module includes a solid-state crystal bonded to an ASIC readout providing a low cost, low power, light weight compact instrument to detect and measure radiation energies in the local ambient radiation field. In particular, the photon energy, time of event, and location of the detection instrument at the time of detection is recorded for real time transmission to a central data collection/analysis system. The collected data from the entire network of radiation detection instruments are combined by intelligent correlation/analysis algorithms which map the background radiation and detect, identify and track radiation anomalies in the region.

Global Landscape of a Co-Expressed Gene Network in Barley and its Application to Gene Discovery in Triticeae Crops

PubMed Central

Mochida, Keiichi; Uehara-Yamaguchi, Yukiko; Yoshida, Takuhiro; Sakurai, Tetsuya; Shinozaki, Kazuo

2011-01-01

Accumulated transcriptome data can be used to investigate regulatory networks of genes involved in various biological systems. Co-expression analysis data sets generated from comprehensively collected transcriptome data sets now represent efficient resources that are capable of facilitating the discovery of genes with closely correlated expression patterns. In order to construct a co-expression network for barley, we analyzed 45 publicly available experimental series, which are composed of 1,347 sets of GeneChip data for barley. On the basis of a gene-to-gene weighted correlation coefficient, we constructed a global barley co-expression network and classified it into clusters of subnetwork modules. The resulting clusters are candidates for functional regulatory modules in the barley transcriptome. To annotate each of the modules, we performed comparative annotation using genes in Arabidopsis and Brachypodium distachyon. On the basis of a comparative analysis between barley and two model species, we investigated functional properties from the representative distributions of the gene ontology (GO) terms. Modules putatively involved in drought stress response and cellulose biogenesis have been identified. These modules are discussed to demonstrate the effectiveness of the co-expression analysis. Furthermore, we applied the data set of co-expressed genes coupled with comparative analysis in attempts to discover potentially Triticeae-specific network modules. These results demonstrate that analysis of the co-expression network of the barley transcriptome together with comparative analysis should promote the process of gene discovery in barley. Furthermore, the insights obtained should be transferable to investigations of Triticeae plants. The associated data set generated in this analysis is publicly accessible at http://coexpression.psc.riken.jp/barley/. PMID:21441235

Short-term memory of TiO2-based electrochemical capacitors: empirical analysis with adoption of a sliding threshold

NASA Astrophysics Data System (ADS)

Lim, Hyungkwang; Kim, Inho; Kim, Jin-Sang; Hwang, Cheol Seong; Jeong, Doo Seok

2013-09-01

Chemical synapses are important components of the large-scaled neural network in the hippocampus of the mammalian brain, and a change in their weight is thought to be in charge of learning and memory. Thus, the realization of artificial chemical synapses is of crucial importance in achieving artificial neural networks emulating the brain’s functionalities to some extent. This kind of research is often referred to as neuromorphic engineering. In this study, we report short-term memory behaviours of electrochemical capacitors (ECs) utilizing TiO2 mixed ionic-electronic conductor and various reactive electrode materials e.g. Ti, Ni, and Cr. By experiments, it turned out that the potentiation behaviours did not represent unlimited growth of synaptic weight. Instead, the behaviours exhibited limited synaptic weight growth that can be understood by means of an empirical equation similar to the Bienenstock-Cooper-Munro rule, employing a sliding threshold. The observed potentiation behaviours were analysed using the empirical equation and the differences between the different ECs were parameterized.

Synthesis and Characterisation of Photocrosslinked poly(ethylene glycol) diacrylate Implants for Sustained Ocular Drug Delivery.

PubMed

McAvoy, Kathryn; Jones, David; Thakur, Raghu Raj Singh

2018-01-16

To investigate the sustained ocular delivery of small and large drug molecules from photocrosslinked poly(ethylene glycol) diacrylate (PEGDA) implants with varying pore forming agents. Triamcinolone acetonide and ovalbumin loaded photocrosslinked PEGDA implants, with or without pore-forming agents, were fabricated and characterised for chemical, mechanical, swelling, network parameters, as well as drug release and biocompatibility. HPLC-based analytical methods were employed for analysis of two molecules; ELISA was used to demonstrate bioactivity of ovalbumin. Regardless of PEGDA molecular weight or pore former composition all implants loaded with triamcinolone acetonide released significantly faster than those loaded with ovalbumin. Higher molecular weight PEGDA systems (700 Da) resulted in faster drug release of triamcinolone acetonide than their 250 Da counterpart. All ovalbumin released over the 56-day time period was found to be bioactive. Increasing PEGDA molecular weight resulted in increased system swelling, decreased crosslink density (Ve), increased polymer-water interaction parameter (χ), increased average molecular weight between crosslinks (Mc) and increased mesh size (ε). SEM studies showed the porosity of implants increased with increasing PEGDA molecular weight. Biocompatibility showed both PEGDA molecular weight implants were non-toxic when exposed to retinal epithelial cells over a 7-day period. Photocrosslinked PEGDA implant based systems are capable of controlled drug release of both small and large drug molecules through adaptations in the polymer system network. We are currently continuing evaluation of these systems as potential sustained drug delivery devices.

Algorithm for optimizing bipolar interconnection weights with applications in associative memories and multitarget classification.

PubMed

Chang, S; Wong, K W; Zhang, W; Zhang, Y

1999-08-10

An algorithm for optimizing a bipolar interconnection weight matrix with the Hopfield network is proposed. The effectiveness of this algorithm is demonstrated by computer simulation and optical implementation. In the optical implementation of the neural network the interconnection weights are biased to yield a nonnegative weight matrix. Moreover, a threshold subchannel is added so that the system can realize, in real time, the bipolar weighted summation in a single channel. Preliminary experimental results obtained from the applications in associative memories and multitarget classification with rotation invariance are shown.

Algorithm for Optimizing Bipolar Interconnection Weights with Applications in Associative Memories and Multitarget Classification

NASA Astrophysics Data System (ADS)

Chang, Shengjiang; Wong, Kwok-Wo; Zhang, Wenwei; Zhang, Yanxin

1999-08-01

An algorithm for optimizing a bipolar interconnection weight matrix with the Hopfield network is proposed. The effectiveness of this algorithm is demonstrated by computer simulation and optical implementation. In the optical implementation of the neural network the interconnection weights are biased to yield a nonnegative weight matrix. Moreover, a threshold subchannel is added so that the system can realize, in real time, the bipolar weighted summation in a single channel. Preliminary experimental results obtained from the applications in associative memories and multitarget classification with rotation invariance are shown.

CROSS-DISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: Worldwide Marine Transportation Network: Efficiency and Container Throughput

NASA Astrophysics Data System (ADS)

Deng, Wei-Bing; Guo, Long; Li, Wei; Cai, Xu

2009-11-01

Through empirical analysis of the global structure of the Worldwide Marine Transportation Network (WMTN), we find that the WMTN, a small-world network, exhibits an exponential-like degree distribution. We hereby investigate the efficiency of the WMTN by employing a simple definition. Compared with many other transportation networks, the WMTN possesses relatively low efficiency. Furthermore, by exploring the relationship between the topological structure and the container throughput, we find that strong correlations exist among the container throughout the degree and the clustering coefficient. Also, considering the navigational process that a ship travels in a real shipping line, we obtain that the weight of a seaport is proportional to the total probability contributed by all the passing shipping lines.

Research on two-port network of wavelet transform processor using surface acoustic wavelet devices and its application.

PubMed

Liu, Shoubing; Lu, Wenke; Zhu, Changchun

2017-11-01

The goal of this research is to study two-port network of wavelet transform processor (WTP) using surface acoustic wave (SAW) devices and its application. The motive was prompted by the inconvenience of the long research and design cycle and the huge research funding involved with traditional method in this field, which were caused by the lack of the simulation and emulation method of WTP using SAW devices. For this reason, we introduce the two-port network analysis tool, which has been widely used in the design and analysis of SAW devices with uniform interdigital transducers (IDTs). Because the admittance parameters calculation formula of the two-port network can only be used for the SAW devices with uniform IDTs, this analysis tool cannot be directly applied into the design and analysis of the processor using SAW devices, whose input interdigital transducer (IDT) is apodized weighting. Therefore, in this paper, we propose the channel segmentation method, which can convert the WTP using SAW devices into parallel channels, and also provide with the calculation formula of the number of channels, the number of finger pairs and the static capacitance of an interdigital period in each parallel channel firstly. From the parameters given above, we can calculate the admittance parameters of the two port network for each channel, so that we can obtain the admittance parameter of the two-port network of the WTP using SAW devices on the basis of the simplification rule of parallel two-port network. Through this analysis tool, not only can we get the impulse response function of the WTP using SAW devices but we can also get the matching circuit of it. Large numbers of studies show that the parameters of the two-port network obtained by this paper are consistent with those measured by network analyzer E5061A, and the impulse response function obtained by the two-port network analysis tool is also consistent with that measured by network analyzer E5061A, which can meet the accuracy requirements of the analysis of the WTP using SAW devices. Therefore the two-port network analysis tool discussed in this paper has comparatively higher theoretical and practical value. Copyright © 2017 Elsevier B.V. All rights reserved.

CoryneRegNet 4.0 – A reference database for corynebacterial gene regulatory networks

PubMed Central

Baumbach, Jan

2007-01-01

Background Detailed information on DNA-binding transcription factors (the key players in the regulation of gene expression) and on transcriptional regulatory interactions of microorganisms deduced from literature-derived knowledge, computer predictions and global DNA microarray hybridization experiments, has opened the way for the genome-wide analysis of transcriptional regulatory networks. The large-scale reconstruction of these networks allows the in silico analysis of cell behavior in response to changing environmental conditions. We previously published CoryneRegNet, an ontology-based data warehouse of corynebacterial transcription factors and regulatory networks. Initially, it was designed to provide methods for the analysis and visualization of the gene regulatory network of Corynebacterium glutamicum. Results Now we introduce CoryneRegNet release 4.0, which integrates data on the gene regulatory networks of 4 corynebacteria, 2 mycobacteria and the model organism Escherichia coli K12. As the previous versions, CoryneRegNet provides a web-based user interface to access the database content, to allow various queries, and to support the reconstruction, analysis and visualization of regulatory networks at different hierarchical levels. In this article, we present the further improved database content of CoryneRegNet along with novel analysis features. The network visualization feature GraphVis now allows the inter-species comparisons of reconstructed gene regulatory networks and the projection of gene expression levels onto that networks. Therefore, we added stimulon data directly into the database, but also provide Web Service access to the DNA microarray analysis platform EMMA. Additionally, CoryneRegNet now provides a SOAP based Web Service server, which can easily be consumed by other bioinformatics software systems. Stimulons (imported from the database, or uploaded by the user) can be analyzed in the context of known transcriptional regulatory networks to predict putative contradictions or further gene regulatory interactions. Furthermore, it integrates protein clusters by means of heuristically solving the weighted graph cluster editing problem. In addition, it provides Web Service based access to up to date gene annotation data from GenDB. Conclusion The release 4.0 of CoryneRegNet is a comprehensive system for the integrated analysis of procaryotic gene regulatory networks. It is a versatile systems biology platform to support the efficient and large-scale analysis of transcriptional regulation of gene expression in microorganisms. It is publicly available at . PMID:17986320

Handling Neighbor Discovery and Rendezvous Consistency with Weighted Quorum-Based Approach

PubMed Central

Own, Chung-Ming; Meng, Zhaopeng; Liu, Kehan

2015-01-01

Neighbor discovery and the power of sensors play an important role in the formation of Wireless Sensor Networks (WSNs) and mobile networks. Many asynchronous protocols based on wake-up time scheduling have been proposed to enable neighbor discovery among neighboring nodes for the energy saving, especially in the difficulty of clock synchronization. However, existing researches are divided two parts with the neighbor-discovery methods, one is the quorum-based protocols and the other is co-primality based protocols. Their distinction is on the arrangements of time slots, the former uses the quorums in the matrix, the latter adopts the numerical analysis. In our study, we propose the weighted heuristic quorum system (WQS), which is based on the quorum algorithm to eliminate redundant paths of active slots. We demonstrate the specification of our system: fewer active slots are required, the referring rate is balanced, and remaining power is considered particularly when a device maintains rendezvous with discovered neighbors. The evaluation results showed that our proposed method can effectively reschedule the active slots and save the computing time of the network system. PMID:26404297

Subsonic Aircraft With Regression and Neural-Network Approximators Designed

NASA Technical Reports Server (NTRS)

Patnaik, Surya N.; Hopkins, Dale A.

2004-01-01

At the NASA Glenn Research Center, NASA Langley Research Center's Flight Optimization System (FLOPS) and the design optimization testbed COMETBOARDS with regression and neural-network-analysis approximators have been coupled to obtain a preliminary aircraft design methodology. For a subsonic aircraft, the optimal design, that is the airframe-engine combination, is obtained by the simulation. The aircraft is powered by two high-bypass-ratio engines with a nominal thrust of about 35,000 lbf. It is to carry 150 passengers at a cruise speed of Mach 0.8 over a range of 3000 n mi and to operate on a 6000-ft runway. The aircraft design utilized a neural network and a regression-approximations-based analysis tool, along with a multioptimizer cascade algorithm that uses sequential linear programming, sequential quadratic programming, the method of feasible directions, and then sequential quadratic programming again. Optimal aircraft weight versus the number of design iterations is shown. The central processing unit (CPU) time to solution is given. It is shown that the regression-method-based analyzer exhibited a smoother convergence pattern than the FLOPS code. The optimum weight obtained by the approximation technique and the FLOPS code differed by 1.3 percent. Prediction by the approximation technique exhibited no error for the aircraft wing area and turbine entry temperature, whereas it was within 2 percent for most other parameters. Cascade strategy was required by FLOPS as well as the approximators. The regression method had a tendency to hug the data points, whereas the neural network exhibited a propensity to follow a mean path. The performance of the neural network and regression methods was considered adequate. It was at about the same level for small, standard, and large models with redundancy ratios (defined as the number of input-output pairs to the number of unknown coefficients) of 14, 28, and 57, respectively. In an SGI octane workstation (Silicon Graphics, Inc., Mountainview, CA), the regression training required a fraction of a CPU second, whereas neural network training was between 1 and 9 min, as given. For a single analysis cycle, the 3-sec CPU time required by the FLOPS code was reduced to milliseconds by the approximators. For design calculations, the time with the FLOPS code was 34 min. It was reduced to 2 sec with the regression method and to 4 min by the neural network technique. The performance of the regression and neural network methods was found to be satisfactory for the analysis and design optimization of the subsonic aircraft.

A deep belief network with PLSR for nonlinear system modeling.

PubMed

Qiao, Junfei; Wang, Gongming; Li, Wenjing; Li, Xiaoli

2018-08-01

Nonlinear system modeling plays an important role in practical engineering, and deep learning-based deep belief network (DBN) is now popular in nonlinear system modeling and identification because of the strong learning ability. However, the existing weights optimization for DBN is based on gradient, which always leads to a local optimum and a poor training result. In this paper, a DBN with partial least square regression (PLSR-DBN) is proposed for nonlinear system modeling, which focuses on the problem of weights optimization for DBN using PLSR. Firstly, unsupervised contrastive divergence (CD) algorithm is used in weights initialization. Secondly, initial weights derived from CD algorithm are optimized through layer-by-layer PLSR modeling from top layer to bottom layer. Instead of gradient method, PLSR-DBN can determine the optimal weights using several PLSR models, so that a better performance of PLSR-DBN is achieved. Then, the analysis of convergence is theoretically given to guarantee the effectiveness of the proposed PLSR-DBN model. Finally, the proposed PLSR-DBN is tested on two benchmark nonlinear systems and an actual wastewater treatment system as well as a handwritten digit recognition (nonlinear mapping and modeling) with high-dimension input data. The experiment results show that the proposed PLSR-DBN has better performances of time and accuracy on nonlinear system modeling than that of other methods. Copyright © 2017 Elsevier Ltd. All rights reserved.

GFD-Net: A novel semantic similarity methodology for the analysis of gene networks.

PubMed

Díaz-Montaña, Juan J; Díaz-Díaz, Norberto; Gómez-Vela, Francisco

2017-04-01

Since the popularization of biological network inference methods, it has become crucial to create methods to validate the resulting models. Here we present GFD-Net, the first methodology that applies the concept of semantic similarity to gene network analysis. GFD-Net combines the concept of semantic similarity with the use of gene network topology to analyze the functional dissimilarity of gene networks based on Gene Ontology (GO). The main innovation of GFD-Net lies in the way that semantic similarity is used to analyze gene networks taking into account the network topology. GFD-Net selects a functionality for each gene (specified by a GO term), weights each edge according to the dissimilarity between the nodes at its ends and calculates a quantitative measure of the network functional dissimilarity, i.e. a quantitative value of the degree of dissimilarity between the connected genes. The robustness of GFD-Net as a gene network validation tool was demonstrated by performing a ROC analysis on several network repositories. Furthermore, a well-known network was analyzed showing that GFD-Net can also be used to infer knowledge. The relevance of GFD-Net becomes more evident in Section "GFD-Net applied to the study of human diseases" where an example of how GFD-Net can be applied to the study of human diseases is presented. GFD-Net is available as an open-source Cytoscape app which offers a user-friendly interface to configure and execute the algorithm as well as the ability to visualize and interact with the results(http://apps.cytoscape.org/apps/gfdnet). Copyright © 2017 Elsevier Inc. All rights reserved.

Financial networks based on Granger causality: A case study

NASA Astrophysics Data System (ADS)

Papana, Angeliki; Kyrtsou, Catherine; Kugiumtzis, Dimitris; Diks, Cees

2017-09-01

Connectivity analysis is performed on a long financial record of 21 international stock indices employing a linear and a nonlinear causality measure, the conditional Granger causality index (CGCI) and the partial mutual information on mixed embedding (PMIME), respectively. Both measures aim to specify the direction of the interrelationships among the international stock indexes and portray the links of the resulting networks, by the presence of direct couplings between variables exploiting all available information. However, their differences are assessed due to the presence of nonlinearity. The weighted networks formed with respect to the causality measures are transformed to binary ones using a significance test. The financial networks are formed on sliding windows in order to examine the network characteristics and trace changes in the connectivity structure. Subsequently, two statistical network quantities are calculated; the average degree and the average shortest path length. The empirical findings reveal interesting time-varying properties of the constructed network, which are clearly dependent on the nature of the financial cycle.

Research on robust optimization of emergency logistics network considering the time dependence characteristic

NASA Astrophysics Data System (ADS)

WANG, Qingrong; ZHU, Changfeng; LI, Ying; ZHANG, Zhengkun

2017-06-01

Considering the time dependence of emergency logistic network and complexity of the environment that the network exists in, in this paper the time dependent network optimization theory and robust discrete optimization theory are combined, and the emergency logistics dynamic network optimization model with characteristics of robustness is built to maximize the timeliness of emergency logistics. On this basis, considering the complexity of dynamic network and the time dependence of edge weight, an improved ant colony algorithm is proposed to realize the coupling of the optimization algorithm and the network time dependence and robustness. Finally, a case study has been carried out in order to testify validity of this robustness optimization model and its algorithm, and the value of different regulation factors was analyzed considering the importance of the value of the control factor in solving the optimal path. Analysis results show that this model and its algorithm above-mentioned have good timeliness and strong robustness.

Estimation of effective connectivity using multi-layer perceptron artificial neural network.

PubMed

Talebi, Nasibeh; Nasrabadi, Ali Motie; Mohammad-Rezazadeh, Iman

2018-02-01

Studies on interactions between brain regions estimate effective connectivity, (usually) based on the causality inferences made on the basis of temporal precedence. In this study, the causal relationship is modeled by a multi-layer perceptron feed-forward artificial neural network, because of the ANN's ability to generate appropriate input-output mapping and to learn from training examples without the need of detailed knowledge of the underlying system. At any time instant, the past samples of data are placed in the network input, and the subsequent values are predicted at its output. To estimate the strength of interactions, the measure of " Causality coefficient " is defined based on the network structure, the connecting weights and the parameters of hidden layer activation function. Simulation analysis demonstrates that the method, called "CREANN" (Causal Relationship Estimation by Artificial Neural Network), can estimate time-invariant and time-varying effective connectivity in terms of MVAR coefficients. The method shows robustness with respect to noise level of data. Furthermore, the estimations are not significantly influenced by the model order (considered time-lag), and the different initial conditions (initial random weights and parameters of the network). CREANN is also applied to EEG data collected during a memory recognition task. The results implicate that it can show changes in the information flow between brain regions, involving in the episodic memory retrieval process. These convincing results emphasize that CREANN can be used as an appropriate method to estimate the causal relationship among brain signals.

PageRank versatility analysis of multilayer modality-based network for exploring the evolution of oil-water slug flow.

PubMed

Gao, Zhong-Ke; Dang, Wei-Dong; Li, Shan; Yang, Yu-Xuan; Wang, Hong-Tao; Sheng, Jing-Ran; Wang, Xiao-Fan

2017-07-14

Numerous irregular flow structures exist in the complicated multiphase flow and result in lots of disparate spatial dynamical flow behaviors. The vertical oil-water slug flow continually attracts plenty of research interests on account of its significant importance. Based on the spatial transient flow information acquired through our designed double-layer distributed-sector conductance sensor, we construct multilayer modality-based network to encode the intricate spatial flow behavior. Particularly, we calculate the PageRank versatility and multilayer weighted clustering coefficient to quantitatively explore the inferred multilayer modality-based networks. Our analysis allows characterizing the complicated evolution of oil-water slug flow, from the opening formation of oil slugs, to the succedent inter-collision and coalescence among oil slugs, and then to the dispersed oil bubbles. These properties render our developed method particularly powerful for mining the essential flow features from the multilayer sensor measurements.

Relating Diseases by Integrating Gene Associations and Information Flow through Protein Interaction Network

PubMed Central

Hamaneh, Mehdi Bagheri; Yu, Yi-Kuo

2014-01-01

Identifying similar diseases could potentially provide deeper understanding of their underlying causes, and may even hint at possible treatments. For this purpose, it is necessary to have a similarity measure that reflects the underpinning molecular interactions and biological pathways. We have thus devised a network-based measure that can partially fulfill this goal. Our method assigns weights to all proteins (and consequently their encoding genes) by using information flow from a disease to the protein interaction network and back. Similarity between two diseases is then defined as the cosine of the angle between their corresponding weight vectors. The proposed method also provides a way to suggest disease-pathway associations by using the weights assigned to the genes to perform enrichment analysis for each disease. By calculating pairwise similarities between 2534 diseases, we show that our disease similarity measure is strongly correlated with the probability of finding the diseases in the same disease family and, more importantly, sharing biological pathways. We have also compared our results to those of MimMiner, a text-mining method that assigns pairwise similarity scores to diseases. We find the results of the two methods to be complementary. It is also shown that clustering diseases based on their similarities and performing enrichment analysis for the cluster centers significantly increases the term association rate, suggesting that the cluster centers are better representatives for biological pathways than the diseases themselves. This lends support to the view that our similarity measure is a good indicator of relatedness of biological processes involved in causing the diseases. Although not needed for understanding this paper, the raw results are available for download for further study at ftp://ftp.ncbi.nlm.nih.gov/pub/qmbpmn/DiseaseRelations/. PMID:25360770

Spatial prediction of ground subsidence susceptibility using an artificial neural network.

PubMed

Lee, Saro; Park, Inhye; Choi, Jong-Kuk

2012-02-01

Ground subsidence in abandoned underground coal mine areas can result in loss of life and property. We analyzed ground subsidence susceptibility (GSS) around abandoned coal mines in Jeong-am, Gangwon-do, South Korea, using artificial neural network (ANN) and geographic information system approaches. Spatial data of subsidence area, topography, and geology, as well as various ground-engineering data, were collected and used to create a raster database of relevant factors for a GSS map. Eight major factors causing ground subsidence were extracted from the existing ground subsidence area: slope, depth of coal mine, distance from pit, groundwater depth, rock-mass rating, distance from fault, geology, and land use. Areas of ground subsidence were randomly divided into a training set to analyze GSS using the ANN and a test set to validate the predicted GSS map. Weights of each factor's relative importance were determined by the back-propagation training algorithms and applied to the input factor. The GSS was then calculated using the weights, and GSS maps were created. The process was repeated ten times to check the stability of analysis model using a different training data set. The map was validated using area-under-the-curve analysis with the ground subsidence areas that had not been used to train the model. The validation showed prediction accuracies between 94.84 and 95.98%, representing overall satisfactory agreement. Among the input factors, "distance from fault" had the highest average weight (i.e., 1.5477), indicating that this factor was most important. The generated maps can be used to estimate hazards to people, property, and existing infrastructure, such as the transportation network, and as part of land-use and infrastructure planning.

Relating diseases by integrating gene associations and information flow through protein interaction network.

PubMed

Hamaneh, Mehdi Bagheri; Yu, Yi-Kuo

2014-01-01

Identifying similar diseases could potentially provide deeper understanding of their underlying causes, and may even hint at possible treatments. For this purpose, it is necessary to have a similarity measure that reflects the underpinning molecular interactions and biological pathways. We have thus devised a network-based measure that can partially fulfill this goal. Our method assigns weights to all proteins (and consequently their encoding genes) by using information flow from a disease to the protein interaction network and back. Similarity between two diseases is then defined as the cosine of the angle between their corresponding weight vectors. The proposed method also provides a way to suggest disease-pathway associations by using the weights assigned to the genes to perform enrichment analysis for each disease. By calculating pairwise similarities between 2534 diseases, we show that our disease similarity measure is strongly correlated with the probability of finding the diseases in the same disease family and, more importantly, sharing biological pathways. We have also compared our results to those of MimMiner, a text-mining method that assigns pairwise similarity scores to diseases. We find the results of the two methods to be complementary. It is also shown that clustering diseases based on their similarities and performing enrichment analysis for the cluster centers significantly increases the term association rate, suggesting that the cluster centers are better representatives for biological pathways than the diseases themselves. This lends support to the view that our similarity measure is a good indicator of relatedness of biological processes involved in causing the diseases. Although not needed for understanding this paper, the raw results are available for download for further study at ftp://ftp.ncbi.nlm.nih.gov/pub/qmbpmn/DiseaseRelations/.

The geography of hotspots of rarity-weighted richness of birds and their coverage by Natura 2000

PubMed Central

de Albuquerque, Fábio Suzart; Gregory, Andrew

2017-01-01

A major challenge for biogeographers and conservation planners is to identify where to best locate or distribute high-priority areas for conservation and to explore whether these areas are well represented by conservation actions such as protected areas (PAs). We aimed to identify high-priority areas for conservation, expressed as hotpots of rarity-weighted richness (HRR)–sites that efficiently represent species–for birds across EU countries, and to explore whether HRR are well represented by the Natura 2000 network. Natura 2000 is an evolving network of PAs that seeks to conserve biodiversity through the persistence of the most patrimonial species and habitats across Europe. This network includes Sites of Community Importance (SCI) and Special Areas of Conservation (SAC), where the latter regulated the designation of Special Protected Areas (SPA). Distribution maps for 416 bird species and complementarity-based approaches were used to map geographical patterns of rarity-weighted richness (RWR) and HRR for birds. We used species accumulation index to evaluate whether RWR was efficient surrogates to identify HRRs for birds. The results of our analysis support the proposition that prioritizing sites in order of RWR is a reliable way to identify sites that efficiently represent birds. HRRs were concentrated in the Mediterranean Basin and alpine and boreal biogeographical regions of northern Europe. The cells with high RWR values did not correspond to cells where Natura 2000 was present. We suggest that patterns of RWR could become a focus for conservation biogeography. Our analysis demonstrates that identifying HRR is a robust approach for prioritizing management actions, and reveals the need for more conservation actions, especially on HRR. PMID:28379991

The geography of hotspots of rarity-weighted richness of birds and their coverage by Natura 2000.

PubMed

Albuquerque, Fábio Suzart de; Gregory, Andrew

2017-01-01

A major challenge for biogeographers and conservation planners is to identify where to best locate or distribute high-priority areas for conservation and to explore whether these areas are well represented by conservation actions such as protected areas (PAs). We aimed to identify high-priority areas for conservation, expressed as hotpots of rarity-weighted richness (HRR)-sites that efficiently represent species-for birds across EU countries, and to explore whether HRR are well represented by the Natura 2000 network. Natura 2000 is an evolving network of PAs that seeks to conserve biodiversity through the persistence of the most patrimonial species and habitats across Europe. This network includes Sites of Community Importance (SCI) and Special Areas of Conservation (SAC), where the latter regulated the designation of Special Protected Areas (SPA). Distribution maps for 416 bird species and complementarity-based approaches were used to map geographical patterns of rarity-weighted richness (RWR) and HRR for birds. We used species accumulation index to evaluate whether RWR was efficient surrogates to identify HRRs for birds. The results of our analysis support the proposition that prioritizing sites in order of RWR is a reliable way to identify sites that efficiently represent birds. HRRs were concentrated in the Mediterranean Basin and alpine and boreal biogeographical regions of northern Europe. The cells with high RWR values did not correspond to cells where Natura 2000 was present. We suggest that patterns of RWR could become a focus for conservation biogeography. Our analysis demonstrates that identifying HRR is a robust approach for prioritizing management actions, and reveals the need for more conservation actions, especially on HRR.

What can we learn from the network approach in finance?

NASA Astrophysics Data System (ADS)

Janos, Kertesz

2005-03-01

Correlations between variations of stock prices reveal information about relationships between companies. Different methods of analysis have been applied to such data in order to uncover the taxonomy of the market. We use Mantegna's miminum spanning tree (MST) method for daily data in a dynamic way: By introducing a moving window we study the temporal changes in the structure of the network defined by this ``asset tree.'' The MST is scale free with a significantly changing exponent of the degree distribution for crash periods, which demonstrates the restructuring of the network due to the enhancement of correlations. This approach is compared to that based on what we call ``asset graphs:'' We start from an empty graph with no edges where the vertices correspond to stocks and then, one by one, we insert edges between the vertices according to the rank of their correlation strength. We study the properties of the creatred (weighted) networks, such as topologically different growth types, number and size of clusters and clustering coefficient. Furthermore, we define new tools like subgraph intensity and coherence to describe the role of the weights. We also investigate the time shifted cross correlation functions for high frequency data and find a characteristic time delay in many cases representing that some stocks lead the price changes while others follow them. These data can be used to construct a directed network of influence.

A method for independent component graph analysis of resting-state fMRI.

PubMed

Ribeiro de Paula, Demetrius; Ziegler, Erik; Abeyasinghe, Pubuditha M; Das, Tushar K; Cavaliere, Carlo; Aiello, Marco; Heine, Lizette; di Perri, Carol; Demertzi, Athena; Noirhomme, Quentin; Charland-Verville, Vanessa; Vanhaudenhuyse, Audrey; Stender, Johan; Gomez, Francisco; Tshibanda, Jean-Flory L; Laureys, Steven; Owen, Adrian M; Soddu, Andrea

2017-03-01

Independent component analysis (ICA) has been extensively used for reducing task-free BOLD fMRI recordings into spatial maps and their associated time-courses. The spatially identified independent components can be considered as intrinsic connectivity networks (ICNs) of non-contiguous regions. To date, the spatial patterns of the networks have been analyzed with techniques developed for volumetric data. Here, we detail a graph building technique that allows these ICNs to be analyzed with graph theory. First, ICA was performed at the single-subject level in 15 healthy volunteers using a 3T MRI scanner. The identification of nine networks was performed by a multiple-template matching procedure and a subsequent component classification based on the network "neuronal" properties. Second, for each of the identified networks, the nodes were defined as 1,015 anatomically parcellated regions. Third, between-node functional connectivity was established by building edge weights for each networks. Group-level graph analysis was finally performed for each network and compared to the classical network. Network graph comparison between the classically constructed network and the nine networks showed significant differences in the auditory and visual medial networks with regard to the average degree and the number of edges, while the visual lateral network showed a significant difference in the small-worldness. This novel approach permits us to take advantage of the well-recognized power of ICA in BOLD signal decomposition and, at the same time, to make use of well-established graph measures to evaluate connectivity differences. Moreover, by providing a graph for each separate network, it can offer the possibility to extract graph measures in a specific way for each network. This increased specificity could be relevant for studying pathological brain activity or altered states of consciousness as induced by anesthesia or sleep, where specific networks are known to be altered in different strength.

Using scale and feather traits for module construction provides a functional approach to chicken epidermal development.

PubMed

Bao, Weier; Greenwold, Matthew J; Sawyer, Roger H

2017-11-01

Gene co-expression network analysis has been a research method widely used in systematically exploring gene function and interaction. Using the Weighted Gene Co-expression Network Analysis (WGCNA) approach to construct a gene co-expression network using data from a customized 44K microarray transcriptome of chicken epidermal embryogenesis, we have identified two distinct modules that are highly correlated with scale or feather development traits. Signaling pathways related to feather development were enriched in the traditional KEGG pathway analysis and functional terms relating specifically to embryonic epidermal development were also enriched in the Gene Ontology analysis. Significant enrichment annotations were discovered from customized enrichment tools such as Modular Single-Set Enrichment Test (MSET) and Medical Subject Headings (MeSH). Hub genes in both trait-correlated modules showed strong specific functional enrichment toward epidermal development. Also, regulatory elements, such as transcription factors and miRNAs, were targeted in the significant enrichment result. This work highlights the advantage of this methodology for functional prediction of genes not previously associated with scale- and feather trait-related modules.

CEREBRA: a 3-D visualization tool for brain network extracted from fMRI data.

PubMed

Nasir, Baris; Yarman Vural, Fatos T

2016-08-01

In this paper, we introduce a new tool, CEREBRA, to visualize the 3D network of human brain, extracted from the fMRI data. The tool aims to analyze the brain connectivity by representing the selected voxels as the nodes of the network. The edge weights among the voxels are estimated by considering the relationships among the voxel time series. The tool enables the researchers to observe the active brain regions and the interactions among them by using graph theoretic measures, such as, the edge weight and node degree distributions. CEREBRA provides an interactive interface with basic display and editing options for the researchers to study their hypotheses about the connectivity of the brain network. CEREBRA interactively simplifies the network by selecting the active voxels and the most correlated edge weights. The researchers may remove the voxels and edges by using local and global thresholds selected on the window. The built-in graph reduction algorithms are then eliminate the irrelevant regions, voxels and edges and display various properties of the network. The toolbox is capable of space-time representation of the voxel time series and estimated arc weights by using the animated heat maps.

Multilayer neural networks for reduced-rank approximation.

PubMed

Diamantaras, K I; Kung, S Y

1994-01-01

This paper is developed in two parts. First, the authors formulate the solution to the general reduced-rank linear approximation problem relaxing the invertibility assumption of the input autocorrelation matrix used by previous authors. The authors' treatment unifies linear regression, Wiener filtering, full rank approximation, auto-association networks, SVD and principal component analysis (PCA) as special cases. The authors' analysis also shows that two-layer linear neural networks with reduced number of hidden units, trained with the least-squares error criterion, produce weights that correspond to the generalized singular value decomposition of the input-teacher cross-correlation matrix and the input data matrix. As a corollary the linear two-layer backpropagation model with reduced hidden layer extracts an arbitrary linear combination of the generalized singular vector components. Second, the authors investigate artificial neural network models for the solution of the related generalized eigenvalue problem. By introducing and utilizing the extended concept of deflation (originally proposed for the standard eigenvalue problem) the authors are able to find that a sequential version of linear BP can extract the exact generalized eigenvector components. The advantage of this approach is that it's easier to update the model structure by adding one more unit or pruning one or more units when the application requires it. An alternative approach for extracting the exact components is to use a set of lateral connections among the hidden units trained in such a way as to enforce orthogonality among the upper- and lower-layer weights. The authors call this the lateral orthogonalization network (LON) and show via theoretical analysis-and verify via simulation-that the network extracts the desired components. The advantage of the LON-based model is that it can be applied in a parallel fashion so that the components are extracted concurrently. Finally, the authors show the application of their results to the solution of the identification problem of systems whose excitation has a non-invertible autocorrelation matrix. Previous identification methods usually rely on the invertibility assumption of the input autocorrelation, therefore they can not be applied to this case.

The alliance relationship analysis of international terrorist organizations with link prediction

NASA Astrophysics Data System (ADS)

Fang, Ling; Fang, Haiyang; Tian, Yanfang; Yang, Tinghong; Zhao, Jing

2017-09-01

Terrorism is a huge public hazard of the international community. Alliances of terrorist organizations may cause more serious threat to national security and world peace. Understanding alliances between global terrorist organizations will facilitate more effective anti-terrorism collaboration between governments. Based on publicly available data, this study constructed a alliance network between terrorist organizations and analyzed the alliance relationships with link prediction. We proposed a novel index based on optimal weighted fusion of six similarity indices, in which the optimal weight is calculated by genetic algorithm. Our experimental results showed that this algorithm could achieve better results on the networks than other algorithms. Using this method, we successfully digged out 21 real terrorist organizations alliance from current data. Our experiment shows that this approach used for terrorist organizations alliance mining is effective and this study is expected to benefit the form of a more powerful anti-terrorism strategy.

Protocol of GLUcose COntrol Safety and Efficacy in type 2 DIabetes, a NETwork meta-analysis: GLUCOSE DINET protocol-Rational and design.

PubMed

Grenet, Guillaume; Lajoinie, Audrey; Ribault, Shams; Nguyen, Gia Bao; Linet, Thomas; Metge, Augustin; Cornu, Catherine; Cucherat, Michel; Moulin, Philippe; Gueyffier, François

2017-06-01

The aim of this study was to propose a ranking of the currently available antidiabetic drugs, regarding vascular clinical outcomes, in patients with type 2 diabetes, through a network meta-analysis approach. Randomized clinical trials, regardless of the blinding design, testing contemporary antidiabetic drugs, and considering clinically relevant outcomes in patients with type 2 diabetes mellitus will be included. The primary outcomes of this analysis will be overall mortality, cardiovascular mortality, and major cardiovascular events. Diabetic microangiopathy will be a secondary outcome. Adverse events, hypoglycemia, weight evolution, bariatric surgery, and discontinuation of the treatment will also be recorded. Each drug will be analyzed according to its therapeutic class: biguanide, alpha-glucosidase inhibitors, sulfonylureas, glitazones, glinides, insulin, DPP-4 inhibitors, GLP-1 analogs, and gliflozins. The treatment effect of each drug class will be compared using pairwise meta-analysis and a Bayesian random model network meta-analysis. Sensitivity analyses will be conducted according to the quality of the studies and the glycemic control. The report will follow the PRISMA checklist for network meta-analysis. Results of the search strategy and of the study selection will be presented in a PRISMA compliant flowchart. The treatment effects will be summarized with odds ratio (OR) estimates and their 95% credible intervals. A ranking of the drugs will be proposed. Our network meta-analysis should allow a clinically relevant ranking of the contemporary antidiabetic drugs. © 2016 Société Française de Pharmacologie et de Thérapeutique.

Variable weight spectral amplitude coding for multiservice OCDMA networks

NASA Astrophysics Data System (ADS)

Seyedzadeh, Saleh; Rahimian, Farzad Pour; Glesk, Ivan; Kakaee, Majid H.

2017-09-01

The emergence of heterogeneous data traffic such as voice over IP, video streaming and online gaming have demanded networks with capability of supporting quality of service (QoS) at the physical layer with traffic prioritisation. This paper proposes a new variable-weight code based on spectral amplitude coding for optical code-division multiple-access (OCDMA) networks to support QoS differentiation. The proposed variable-weight multi-service (VW-MS) code relies on basic matrix construction. A mathematical model is developed for performance evaluation of VW-MS OCDMA networks. It is shown that the proposed code provides an optimal code length with minimum cross-correlation value when compared to other codes. Numerical results for a VW-MS OCDMA network designed for triple-play services operating at 0.622 Gb/s, 1.25 Gb/s and 2.5 Gb/s are considered.

The Neonatal Connectome During Preterm Brain Development

PubMed Central

van den Heuvel, Martijn P.; Kersbergen, Karina J.; de Reus, Marcel A.; Keunen, Kristin; Kahn, René S.; Groenendaal, Floris; de Vries, Linda S.; Benders, Manon J.N.L.

2015-01-01

The human connectome is the result of an elaborate developmental trajectory. Acquiring diffusion-weighted imaging and resting-state fMRI, we studied connectome formation during the preterm phase of macroscopic connectome genesis. In total, 27 neonates were scanned at week 30 and/or week 40 gestational age (GA). Examining the architecture of the neonatal anatomical brain network revealed a clear presence of a small-world modular organization before term birth. Analysis of neonatal functional connectivity (FC) showed the early formation of resting-state networks, suggesting that functional networks are present in the preterm brain, albeit being in an immature state. Moreover, structural and FC patterns of the neonatal brain network showed strong overlap with connectome architecture of the adult brain (85 and 81%, respectively). Analysis of brain development between week 30 and week 40 GA revealed clear developmental effects in neonatal connectome architecture, including a significant increase in white matter microstructure (P < 0.01), small-world topology (P < 0.01) and interhemispheric FC (P < 0.01). Computational analysis further showed that developmental changes involved an increase in integration capacity of the connectivity network as a whole. Taken together, we conclude that hallmark organizational structures of the human connectome are present before term birth and subject to early development. PMID:24833018

Generalised Transfer Functions of Neural Networks

NASA Astrophysics Data System (ADS)

Fung, C. F.; Billings, S. A.; Zhang, H.

1997-11-01

When artificial neural networks are used to model non-linear dynamical systems, the system structure which can be extremely useful for analysis and design, is buried within the network architecture. In this paper, explicit expressions for the frequency response or generalised transfer functions of both feedforward and recurrent neural networks are derived in terms of the network weights. The derivation of the algorithm is established on the basis of the Taylor series expansion of the activation functions used in a particular neural network. This leads to a representation which is equivalent to the non-linear recursive polynomial model and enables the derivation of the transfer functions to be based on the harmonic expansion method. By mapping the neural network into the frequency domain information about the structure of the underlying non-linear system can be recovered. Numerical examples are included to demonstrate the application of the new algorithm. These examples show that the frequency response functions appear to be highly sensitive to the network topology and training, and that the time domain properties fail to reveal deficiencies in the trained network structure.

Gene Network Construction from Microarray Data Identifies a Key Network Module and Several Candidate Hub Genes in Age-Associated Spatial Learning Impairment

PubMed Central

Uddin, Raihan; Singh, Shiva M.

2017-01-01

As humans age many suffer from a decrease in normal brain functions including spatial learning impairments. This study aimed to better understand the molecular mechanisms in age-associated spatial learning impairment (ASLI). We used a mathematical modeling approach implemented in Weighted Gene Co-expression Network Analysis (WGCNA) to create and compare gene network models of young (learning unimpaired) and aged (predominantly learning impaired) brains from a set of exploratory datasets in rats in the context of ASLI. The major goal was to overcome some of the limitations previously observed in the traditional meta- and pathway analysis using these data, and identify novel ASLI related genes and their networks based on co-expression relationship of genes. This analysis identified a set of network modules in the young, each of which is highly enriched with genes functioning in broad but distinct GO functional categories or biological pathways. Interestingly, the analysis pointed to a single module that was highly enriched with genes functioning in “learning and memory” related functions and pathways. Subsequent differential network analysis of this “learning and memory” module in the aged (predominantly learning impaired) rats compared to the young learning unimpaired rats allowed us to identify a set of novel ASLI candidate hub genes. Some of these genes show significant repeatability in networks generated from independent young and aged validation datasets. These hub genes are highly co-expressed with other genes in the network, which not only show differential expression but also differential co-expression and differential connectivity across age and learning impairment. The known function of these hub genes indicate that they play key roles in critical pathways, including kinase and phosphatase signaling, in functions related to various ion channels, and in maintaining neuronal integrity relating to synaptic plasticity and memory formation. Taken together, they provide a new insight and generate new hypotheses into the molecular mechanisms responsible for age associated learning impairment, including spatial learning. PMID:29066959

Gene Network Construction from Microarray Data Identifies a Key Network Module and Several Candidate Hub Genes in Age-Associated Spatial Learning Impairment.

PubMed

Uddin, Raihan; Singh, Shiva M

2017-01-01

As humans age many suffer from a decrease in normal brain functions including spatial learning impairments. This study aimed to better understand the molecular mechanisms in age-associated spatial learning impairment (ASLI). We used a mathematical modeling approach implemented in Weighted Gene Co-expression Network Analysis (WGCNA) to create and compare gene network models of young (learning unimpaired) and aged (predominantly learning impaired) brains from a set of exploratory datasets in rats in the context of ASLI. The major goal was to overcome some of the limitations previously observed in the traditional meta- and pathway analysis using these data, and identify novel ASLI related genes and their networks based on co-expression relationship of genes. This analysis identified a set of network modules in the young, each of which is highly enriched with genes functioning in broad but distinct GO functional categories or biological pathways. Interestingly, the analysis pointed to a single module that was highly enriched with genes functioning in "learning and memory" related functions and pathways. Subsequent differential network analysis of this "learning and memory" module in the aged (predominantly learning impaired) rats compared to the young learning unimpaired rats allowed us to identify a set of novel ASLI candidate hub genes. Some of these genes show significant repeatability in networks generated from independent young and aged validation datasets. These hub genes are highly co-expressed with other genes in the network, which not only show differential expression but also differential co-expression and differential connectivity across age and learning impairment. The known function of these hub genes indicate that they play key roles in critical pathways, including kinase and phosphatase signaling, in functions related to various ion channels, and in maintaining neuronal integrity relating to synaptic plasticity and memory formation. Taken together, they provide a new insight and generate new hypotheses into the molecular mechanisms responsible for age associated learning impairment, including spatial learning.

Bioinformatics, interaction network analysis, and neural networks to characterize gene expression of radicular cyst and periapical granuloma.

PubMed

Poswar, Fabiano de Oliveira; Farias, Lucyana Conceição; Fraga, Carlos Alberto de Carvalho; Bambirra, Wilson; Brito-Júnior, Manoel; Sousa-Neto, Manoel Damião; Santos, Sérgio Henrique Souza; de Paula, Alfredo Maurício Batista; D'Angelo, Marcos Flávio Silveira Vasconcelos; Guimarães, André Luiz Sena

2015-06-01

Bioinformatics has emerged as an important tool to analyze the large amount of data generated by research in different diseases. In this study, gene expression for radicular cysts (RCs) and periapical granulomas (PGs) was characterized based on a leader gene approach. A validated bioinformatics algorithm was applied to identify leader genes for RCs and PGs. Genes related to RCs and PGs were first identified in PubMed, GenBank, GeneAtlas, and GeneCards databases. The Web-available STRING software (The European Molecular Biology Laboratory [EMBL], Heidelberg, Baden-Württemberg, Germany) was used in order to build the interaction map among the identified genes by a significance score named weighted number of links. Based on the weighted number of links, genes were clustered using k-means. The genes in the highest cluster were considered leader genes. Multilayer perceptron neural network analysis was used as a complementary supplement for gene classification. For RCs, the suggested leader genes were TP53 and EP300, whereas PGs were associated with IL2RG, CCL2, CCL4, CCL5, CCR1, CCR3, and CCR5 genes. Our data revealed different gene expression for RCs and PGs, suggesting that not only the inflammatory nature but also other biological processes might differentiate RCs and PGs. Copyright © 2015 American Association of Endodontists. Published by Elsevier Inc. All rights reserved.

Optimizing hidden layer node number of BP network to estimate fetal weight

NASA Astrophysics Data System (ADS)

Su, Juan; Zou, Yuanwen; Lin, Jiangli; Wang, Tianfu; Li, Deyu; Xie, Tao

2007-12-01

The ultrasonic estimation of fetal weigh before delivery is of most significance for obstetrical clinic. Estimating fetal weight more accurately is crucial for prenatal care, obstetrical treatment, choosing appropriate delivery methods, monitoring fetal growth and reducing the risk of newborn complications. In this paper, we introduce a method which combines golden section and artificial neural network (ANN) to estimate the fetal weight. The golden section is employed to optimize the hidden layer node number of the back propagation (BP) neural network. The method greatly improves the accuracy of fetal weight estimation, and simultaneously avoids choosing the hidden layer node number with subjective experience. The estimation coincidence rate achieves 74.19%, and the mean absolute error is 185.83g.

Short-term prediction of chaotic time series by using RBF network with regression weights.

PubMed

Rojas, I; Gonzalez, J; Cañas, A; Diaz, A F; Rojas, F J; Rodriguez, M

2000-10-01

We propose a framework for constructing and training a radial basis function (RBF) neural network. The structure of the gaussian functions is modified using a pseudo-gaussian function (PG) in which two scaling parameters sigma are introduced, which eliminates the symmetry restriction and provides the neurons in the hidden layer with greater flexibility with respect to function approximation. We propose a modified PG-BF (pseudo-gaussian basis function) network in which the regression weights are used to replace the constant weights in the output layer. For this purpose, a sequential learning algorithm is presented to adapt the structure of the network, in which it is possible to create a new hidden unit and also to detect and remove inactive units. A salient feature of the network systems is that the method used for calculating the overall output is the weighted average of the output associated with each receptive field. The superior performance of the proposed PG-BF system over the standard RBF are illustrated using the problem of short-term prediction of chaotic time series.

A new mutually reinforcing network node and link ranking algorithm

PubMed Central

Wang, Zhenghua; Dueñas-Osorio, Leonardo; Padgett, Jamie E.

2015-01-01

This study proposes a novel Normalized Wide network Ranking algorithm (NWRank) that has the advantage of ranking nodes and links of a network simultaneously. This algorithm combines the mutual reinforcement feature of Hypertext Induced Topic Selection (HITS) and the weight normalization feature of PageRank. Relative weights are assigned to links based on the degree of the adjacent neighbors and the Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank. Numerical experiment results show that NWRank performs consistently better than HITS, PageRank, eigenvector centrality, and edge betweenness from the perspective of network connectivity and approximate network flow, which is also supported by comparisons with the expensive N-1 benchmark removal criteria based on network efficiency. Furthermore, it can avoid some problems, such as the Tightly Knit Community effect, which exists in HITS. NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity. PMID:26492958

Evolution of weighted complex bus transit networks with flow

NASA Astrophysics Data System (ADS)

Huang, Ailing; Xiong, Jie; Shen, Jinsheng; Guan, Wei

2016-02-01

Study on the intrinsic properties and evolutional mechanism of urban public transit networks (PTNs) has great significance for transit planning and control, particularly considering passengers’ dynamic behaviors. This paper presents an empirical analysis for exploring the complex properties of Beijing’s weighted bus transit network (BTN) based on passenger flow in L-space, and proposes a bi-level evolution model to simulate the development of transit routes from the view of complex network. The model is an iterative process that is driven by passengers’ travel demands and dual-controlled interest mechanism, which is composed of passengers’ spatio-temporal requirements and cost constraint of transit agencies. Also, the flow’s dynamic behaviors, including the evolutions of travel demand, sectional flow attracted by a new link and flow perturbation triggered in nearby routes, are taken into consideration in the evolutional process. We present the numerical experiment to validate the model, where the main parameters are estimated by using distribution functions that are deduced from real-world data. The results obtained have proven that our model can generate a BTN with complex properties, such as the scale-free behavior or small-world phenomenon, which shows an agreement with our empirical results. Our study’s results can be exploited to optimize the real BTN’s structure and improve the network’s robustness.

Exploring Research Topics and Trends in Nursing-related Communication in Intensive Care Units Using Social Network Analysis.

PubMed

Son, Youn-Jung; Lee, Soo-Kyoung; Nam, SeJin; Shim, Jae Lan

2018-05-04

This study used social network analysis to identify the main research topics and trends in nursing-related communication in intensive care units. Keywords from January 1967 to June 2016 were extracted from PubMed using Medical Subject Headings terms. Social network analysis was performed using Gephi software. Research publications and newly emerging topics in nursing-related communication in intensive care units were classified into five chronological phases. After the weighting was adjusted, the top five keyword searches were "conflict," "length of stay," "nursing continuing education," "family," and "nurses." During the most recent phase, research topics included "critical care nursing," "patient handoff," and "quality improvement." The keywords of the top three groups among the 10 groups identified were related to "neonatal nursing and practice guideline," "infant or pediatric and terminal care," and "family, aged, and nurse-patient relations," respectively. This study can promote a systematic understanding of communication in intensive care units by identifying topic networks. Future studies are needed to conduct large prospective cohort studies and randomized controlled trials to verify the effects of patient-centered communication in intensive care units on patient outcomes, such as length of hospital stay and mortality.

Network analysis reveals that bacteria and fungi form modules that correlate independently with soil parameters.

PubMed

de Menezes, Alexandre B; Prendergast-Miller, Miranda T; Richardson, Alan E; Toscas, Peter; Farrell, Mark; Macdonald, Lynne M; Baker, Geoff; Wark, Tim; Thrall, Peter H

2015-08-01

Network and multivariate statistical analyses were performed to determine interactions between bacterial and fungal community terminal restriction length polymorphisms as well as soil properties in paired woodland and pasture sites. Canonical correspondence analysis (CCA) revealed that shifts in woodland community composition correlated with soil dissolved organic carbon, while changes in pasture community composition correlated with moisture, nitrogen and phosphorus. Weighted correlation network analysis detected two distinct microbial modules per land use. Bacterial and fungal ribotypes did not group separately, rather all modules comprised of both bacterial and fungal ribotypes. Woodland modules had a similar fungal : bacterial ribotype ratio, while in the pasture, one module was fungal dominated. There was no correspondence between pasture and woodland modules in their ribotype composition. The modules had different relationships to soil variables, and these contrasts were not detected without the use of network analysis. This study demonstrated that fungi and bacteria, components of the soil microbial communities usually treated as separate functional groups as in a CCA approach, were co-correlated and formed distinct associations in these adjacent habitats. Understanding these distinct modular associations may shed more light on their niche space in the soil environment, and allow a more realistic description of soil microbial ecology and function. © 2014 Society for Applied Microbiology and John Wiley & Sons Ltd.

Walk-based measure of balance in signed networks: Detecting lack of balance in social networks

NASA Astrophysics Data System (ADS)

Estrada, Ernesto; Benzi, Michele

2014-10-01

There is a longstanding belief that in social networks with simultaneous friendly and hostile interactions (signed networks) there is a general tendency to a global balance. Balance represents a state of the network with a lack of contentious situations. Here we introduce a method to quantify the degree of balance of any signed (social) network. It accounts for the contribution of all signed cycles in the network and gives, in agreement with empirical evidence, more weight to the shorter cycles than to the longer ones. We found that, contrary to what is generally believed, many signed social networks, in particular very large directed online social networks, are in general very poorly balanced. We also show that unbalanced states can be changed by tuning the weights of the social interactions among the agents in the network.

Model-free distributed learning

NASA Technical Reports Server (NTRS)

Dembo, Amir; Kailath, Thomas

1990-01-01

Model-free learning for synchronous and asynchronous quasi-static networks is presented. The network weights are continuously perturbed, while the time-varying performance index is measured and correlated with the perturbation signals; the correlation output determines the changes in the weights. The perturbation may be either via noise sources or orthogonal signals. The invariance to detailed network structure mitigates large variability between supposedly identical networks as well as implementation defects. This local, regular, and completely distributed mechanism requires no central control and involves only a few global signals. Thus it allows for integrated on-chip learning in large analog and optical networks.

Using Inspiration from Synaptic Plasticity Rules to Optimize Traffic Flow in Distributed Engineered Networks.

PubMed

Suen, Jonathan Y; Navlakha, Saket

2017-05-01

Controlling the flow and routing of data is a fundamental problem in many distributed networks, including transportation systems, integrated circuits, and the Internet. In the brain, synaptic plasticity rules have been discovered that regulate network activity in response to environmental inputs, which enable circuits to be stable yet flexible. Here, we develop a new neuro-inspired model for network flow control that depends only on modifying edge weights in an activity-dependent manner. We show how two fundamental plasticity rules, long-term potentiation and long-term depression, can be cast as a distributed gradient descent algorithm for regulating traffic flow in engineered networks. We then characterize, both by simulation and analytically, how different forms of edge-weight-update rules affect network routing efficiency and robustness. We find a close correspondence between certain classes of synaptic weight update rules derived experimentally in the brain and rules commonly used in engineering, suggesting common principles to both.

Optimizing Pedestrian-Friendly Walking Path for the First and Last Mile Transit Journey by Using the Analytical Network Process (anp) Decision Model and GIS Network Analysis

NASA Astrophysics Data System (ADS)

Naharudin, N.; Ahamad, M. S. S.; Sadullah, A. F. M.

2017-10-01

Every transit trip begins and ends with pedestrian travel. People need to walk to access the transit services. However, their choice to walk depends on many factors including the connectivity, level of comfort and safety. These factors can influence the pleasantness of riding the transit itself, especially during the first/last mile (FLM) journey. This had triggered few studies attempting to measure the pedestrian-friendliness a walking environment can offer. There were studies that implement the pedestrian experience on walking to assess the pedestrian-friendliness of a walking environment. There were also studies that use spatial analysis to measure it based on the path connectivity and accessibility to public facilities and amenities. Though both are good, but the perception-based studies and spatial analysis can be combined to derive more holistic results. This paper proposes a framework for selecting a pedestrian-friendly path for the FLM transit journey by using the two techniques (perception-based and spatial analysis). First, the degree of importance for the factors influencing a good walking environment will be aggregated by using Analytical Network Process (ANP) decision rules based on people's preferences on those factors. The weight will then be used as attributes in the GIS network analysis. Next, the network analysis will be performed to find a pedestrian-friendly walking route based on the priorities aggregated by ANP. It will choose routes passing through the preferred attributes accordingly. The final output is a map showing pedestrian-friendly walking path for the FLM transit journey.

Group-based strategy diffusion in multiplex networks with weighted values

NASA Astrophysics Data System (ADS)

Yu, Jianyong; Jiang, J. C.; Xiang, Leijun

2017-03-01

The information diffusion of multiplex social networks has received increasing interests in recent years. Actually, the multiplex networks are made of many communities, and it should be gotten more attention for the influences of community level diffusion, besides of individual level interactions. In view of this, this work explores strategy interactions and diffusion processes in multiplex networks with weighted values from a new perspective. Two different groups consisting of some agents with different influential strength are firstly built in each layer network, the authority and non-authority groups. The strategy interactions between different groups in intralayer and interlayer networks are performed to explore community level diffusion, by playing two classical strategy games, Prisoner's Dilemma and Snowdrift Game. The impact forces from the different groups and the reactive forces from individual agents are simultaneously taken into account in intralayer and interlayer interactions. This paper reveals and explains the evolutions of cooperation diffusion and the influences of interlayer interaction tight degrees in multiplex networks with weighted values. Some thresholds of critical parameters of interaction degrees and games parameters settings are also discussed in group-based strategy diffusion.

Parenclitic Network Analysis of Methylation Data for Cancer Identification

PubMed Central

Karsakov, Alexander; Bartlett, Thomas; Ryblov, Artem; Meyerov, Iosif; Ivanchenko, Mikhail; Zaikin, Alexey

2017-01-01

We make use of ideas from the theory of complex networks to implement a machine learning classification of human DNA methylation data, that carry signatures of cancer development. The data were obtained from patients with various kinds of cancers and represented as parenclictic networks, wherein nodes correspond to genes, and edges are weighted according to pairwise variation from control group subjects. We demonstrate that for the 10 types of cancer under study, it is possible to obtain a high performance of binary classification between cancer-positive and negative samples based on network measures. Remarkably, an accuracy as high as 93−99% is achieved with only 12 network topology indices, in a dramatic reduction of complexity from the original 15295 gene methylation levels. Moreover, it was found that the parenclictic networks are scale-free in cancer-negative subjects, and deviate from the power-law node degree distribution in cancer. The node centrality ranking and arising modular structure could provide insights into the systems biology of cancer. PMID:28107365

An Effective Collaborative Mobile Weighted Clustering Schemes for Energy Balancing in Wireless Sensor Networks

PubMed Central

Tang, Chengpei; Shokla, Sanesy Kumcr; Modhawar, George; Wang, Qiang

2016-01-01

Collaborative strategies for mobile sensor nodes ensure the efficiency and the robustness of data processing, while limiting the required communication bandwidth. In order to solve the problem of pipeline inspection and oil leakage monitoring, a collaborative weighted mobile sensing scheme is proposed. By adopting a weighted mobile sensing scheme, the adaptive collaborative clustering protocol can realize an even distribution of energy load among the mobile sensor nodes in each round, and make the best use of battery energy. A detailed theoretical analysis and experimental results revealed that the proposed protocol is an energy efficient collaborative strategy such that the sensor nodes can communicate with a fusion center and produce high power gain. PMID:26907285

Psychological effects of belonging to a Facebook weight management group in overweight and obese adults: Results of a randomised controlled trial.

PubMed

Jane, Monica; Foster, Jonathan; Hagger, Martin; Ho, Suleen; Kane, Robert; Pal, Sebely

2018-05-18

This study was conducted to test whether the weight outcomes in an online social networking group were mediated by changes to psychological outcome measures in overweight and obese individuals, following a weight management programme delivered via Facebook. The data analysed in this study were collected during a three-armed, randomised, controlled clinical weight management trial conducted with overweight and obese adults over 24 weeks. Two intervention groups were given the same weight management programme: one within a Facebook group, along with peer support from other group members (the Facebook Group); the other group received the same programme in a pamphlet (the Pamphlet Group). A Control Group was given standard care. The primary outcome was weight; secondary outcomes included the following domains from self-reported questionnaires: energy intake and expenditure; psychological health, social relationships, physical health, quality of life, depression, anxiety, stress, health anxiety, happiness, as well as Facebook Group participants' opinion of this group. The Facebook Group experienced a reduction in their baseline weight measurement by week 24, significantly compared to the Control Group (p = .016). The Facebook Group recorded a significant increase in the psychological health domain during the trial (at week 12) relative to their baseline measurement, and significant compared to the Control Group (p = .022). Mediation analysis indicated a statistical trend, but not statistical significance, for psychological health as a mediator to weight loss in the Facebook Group. While both intervention groups showed significant changes in psychological outcome measures, the Facebook Group was the only group to experience statistically significant weight loss by the end of the 24 weeks. Therefore, an examination of other psychological and/or behavioural outcome measures undertaken in larger studies in the future may help to identify significant mediators to improved weight loss outcomes in online social networking groups. © 2018 John Wiley & Sons Ltd.

Trends of the World Input and Output Network of Global Trade

PubMed Central

del Río-Chanona, Rita María; Grujić, Jelena; Jeldtoft Jensen, Henrik

2017-01-01

The international trade naturally maps onto a complex networks. Theoretical analysis of this network gives valuable insights about the global economic system. Although different economic data sets have been investigated from the network perspective, little attention has been paid to its dynamical behaviour. Here we take the World Input Output Data set, which has values of the annual transactions between 40 different countries of 35 different sectors for the period of 15 years, and infer the time interdependence between countries and sectors. As a measure of interdependence we use correlations between various time series of the network characteristics. First we form 15 primary networks for each year of the data we have, where nodes are countries and links are annual exports from one country to the other. Then we calculate the strengths (weighted degree) and PageRank of each country in each of the 15 networks for 15 different years. This leads to sets of time series and by calculating the correlations between these we form a secondary network where the links are the positive correlations between different countries or sectors. Furthermore, we also form a secondary network where the links are negative correlations in order to study the competition between countries and sectors. By analysing this secondary network we obtain a clearer picture of the mutual influences between countries. As one might expect, we find that political and geographical circumstances play an important role. However, the derived correlation network reveals surprising aspects which are hidden in the primary network. Sometimes countries which belong to the same community in the original network are found to be competitors in the secondary networks. E.g. Spain and Portugal are always in the same trade flow community, nevertheless secondary network analysis reveal that they exhibit contrary time evolution. PMID:28125656

Trends of the World Input and Output Network of Global Trade.

PubMed

Del Río-Chanona, Rita María; Grujić, Jelena; Jeldtoft Jensen, Henrik

2017-01-01

The international trade naturally maps onto a complex networks. Theoretical analysis of this network gives valuable insights about the global economic system. Although different economic data sets have been investigated from the network perspective, little attention has been paid to its dynamical behaviour. Here we take the World Input Output Data set, which has values of the annual transactions between 40 different countries of 35 different sectors for the period of 15 years, and infer the time interdependence between countries and sectors. As a measure of interdependence we use correlations between various time series of the network characteristics. First we form 15 primary networks for each year of the data we have, where nodes are countries and links are annual exports from one country to the other. Then we calculate the strengths (weighted degree) and PageRank of each country in each of the 15 networks for 15 different years. This leads to sets of time series and by calculating the correlations between these we form a secondary network where the links are the positive correlations between different countries or sectors. Furthermore, we also form a secondary network where the links are negative correlations in order to study the competition between countries and sectors. By analysing this secondary network we obtain a clearer picture of the mutual influences between countries. As one might expect, we find that political and geographical circumstances play an important role. However, the derived correlation network reveals surprising aspects which are hidden in the primary network. Sometimes countries which belong to the same community in the original network are found to be competitors in the secondary networks. E.g. Spain and Portugal are always in the same trade flow community, nevertheless secondary network analysis reveal that they exhibit contrary time evolution.

A cost-function approach to rival penalized competitive learning (RPCL).

PubMed

Ma, Jinwen; Wang, Taijun

2006-08-01

Rival penalized competitive learning (RPCL) has been shown to be a useful tool for clustering on a set of sample data in which the number of clusters is unknown. However, the RPCL algorithm was proposed heuristically and is still in lack of a mathematical theory to describe its convergence behavior. In order to solve the convergence problem, we investigate it via a cost-function approach. By theoretical analysis, we prove that a general form of RPCL, called distance-sensitive RPCL (DSRPCL), is associated with the minimization of a cost function on the weight vectors of a competitive learning network. As a DSRPCL process decreases the cost to a local minimum, a number of weight vectors eventually fall into a hypersphere surrounding the sample data, while the other weight vectors diverge to infinity. Moreover, it is shown by the theoretical analysis and simulation experiments that if the cost reduces into the global minimum, a correct number of weight vectors is automatically selected and located around the centers of the actual clusters, respectively. Finally, we apply the DSRPCL algorithms to unsupervised color image segmentation and classification of the wine data.

Development of Gis Tool for the Solution of Minimum Spanning Tree Problem using Prim's Algorithm

NASA Astrophysics Data System (ADS)

Dutta, S.; Patra, D.; Shankar, H.; Alok Verma, P.

2014-11-01

minimum spanning tree (MST) of a connected, undirected and weighted network is a tree of that network consisting of all its nodes and the sum of weights of all its edges is minimum among all such possible spanning trees of the same network. In this study, we have developed a new GIS tool using most commonly known rudimentary algorithm called Prim's algorithm to construct the minimum spanning tree of a connected, undirected and weighted road network. This algorithm is based on the weight (adjacency) matrix of a weighted network and helps to solve complex network MST problem easily, efficiently and effectively. The selection of the appropriate algorithm is very essential otherwise it will be very hard to get an optimal result. In case of Road Transportation Network, it is very essential to find the optimal results by considering all the necessary points based on cost factor (time or distance). This paper is based on solving the Minimum Spanning Tree (MST) problem of a road network by finding it's minimum span by considering all the important network junction point. GIS technology is usually used to solve the network related problems like the optimal path problem, travelling salesman problem, vehicle routing problems, location-allocation problems etc. Therefore, in this study we have developed a customized GIS tool using Python script in ArcGIS software for the solution of MST problem for a Road Transportation Network of Dehradun city by considering distance and time as the impedance (cost) factors. It has a number of advantages like the users do not need a greater knowledge of the subject as the tool is user-friendly and that allows to access information varied and adapted the needs of the users. This GIS tool for MST can be applied for a nationwide plan called Prime Minister Gram Sadak Yojana in India to provide optimal all weather road connectivity to unconnected villages (points). This tool is also useful for constructing highways or railways spanning several cities optimally or connecting all cities with minimum total road length.

Deterministic convergence of chaos injection-based gradient method for training feedforward neural networks.

PubMed

Zhang, Huisheng; Zhang, Ying; Xu, Dongpo; Liu, Xiaodong

2015-06-01

It has been shown that, by adding a chaotic sequence to the weight update during the training of neural networks, the chaos injection-based gradient method (CIBGM) is superior to the standard backpropagation algorithm. This paper presents the theoretical convergence analysis of CIBGM for training feedforward neural networks. We consider both the case of batch learning as well as the case of online learning. Under mild conditions, we prove the weak convergence, i.e., the training error tends to a constant and the gradient of the error function tends to zero. Moreover, the strong convergence of CIBGM is also obtained with the help of an extra condition. The theoretical results are substantiated by a simulation example.

Effects of different correlation metrics and preprocessing factors on small-world brain functional networks: a resting-state functional MRI study.

PubMed

Liang, Xia; Wang, Jinhui; Yan, Chaogan; Shu, Ni; Xu, Ke; Gong, Gaolang; He, Yong

2012-01-01

Graph theoretical analysis of brain networks based on resting-state functional MRI (R-fMRI) has attracted a great deal of attention in recent years. These analyses often involve the selection of correlation metrics and specific preprocessing steps. However, the influence of these factors on the topological properties of functional brain networks has not been systematically examined. Here, we investigated the influences of correlation metric choice (Pearson's correlation versus partial correlation), global signal presence (regressed or not) and frequency band selection [slow-5 (0.01-0.027 Hz) versus slow-4 (0.027-0.073 Hz)] on the topological properties of both binary and weighted brain networks derived from them, and we employed test-retest (TRT) analyses for further guidance on how to choose the "best" network modeling strategy from the reliability perspective. Our results show significant differences in global network metrics associated with both correlation metrics and global signals. Analysis of nodal degree revealed differing hub distributions for brain networks derived from Pearson's correlation versus partial correlation. TRT analysis revealed that the reliability of both global and local topological properties are modulated by correlation metrics and the global signal, with the highest reliability observed for Pearson's-correlation-based brain networks without global signal removal (WOGR-PEAR). The nodal reliability exhibited a spatially heterogeneous distribution wherein regions in association and limbic/paralimbic cortices showed moderate TRT reliability in Pearson's-correlation-based brain networks. Moreover, we found that there were significant frequency-related differences in topological properties of WOGR-PEAR networks, and brain networks derived in the 0.027-0.073 Hz band exhibited greater reliability than those in the 0.01-0.027 Hz band. Taken together, our results provide direct evidence regarding the influences of correlation metrics and specific preprocessing choices on both the global and nodal topological properties of functional brain networks. This study also has important implications for how to choose reliable analytical schemes in brain network studies.

Efficiency Analysis of Integrated Public Hospital Networks in Outpatient Internal Medicine.

PubMed

Ortíz-Barrios, Miguel Angel; Escorcia-Caballero, Juan P; Sánchez-Sánchez, Fabián; De Felice, Fabio; Petrillo, Antonella

2017-09-07

Healthcare systems are evolving towards a complex network of interconnected services due to the increasing costs and the increasing expectations for high service levels. It is evidenced in the literature the importance of implementing management techniques and sophisticated methods to improve the efficiency of healthcare systems, especially in emerging economies. This paper proposes an integrated collaboration model between two public hospitals to reach the reduction of weighted average lead time in outpatient internal medicine department. A strategic framework based on value stream mapping and collaborative practices has been developed in real case study settled in Colombia.

An evolutionary algorithm that constructs recurrent neural networks.

PubMed

Angeline, P J; Saunders, G M; Pollack, J B

1994-01-01

Standard methods for simultaneously inducing the structure and weights of recurrent neural networks limit every task to an assumed class of architectures. Such a simplification is necessary since the interactions between network structure and function are not well understood. Evolutionary computations, which include genetic algorithms and evolutionary programming, are population-based search methods that have shown promise in many similarly complex tasks. This paper argues that genetic algorithms are inappropriate for network acquisition and describes an evolutionary program, called GNARL, that simultaneously acquires both the structure and weights for recurrent networks. GNARL's empirical acquisition method allows for the emergence of complex behaviors and topologies that are potentially excluded by the artificial architectural constraints imposed in standard network induction methods.

Dynamics of an SAITS alcoholism model on unweighted and weighted networks

NASA Astrophysics Data System (ADS)

Huo, Hai-Feng; Cui, Fang-Fang; Xiang, Hong

2018-04-01

A novel SAITS alcoholism model on networks is introduced, in which alcoholics are divided into light problem alcoholics and heavy problem alcoholics. Susceptible individuals can enter into the compartment of heavy problem alcoholics directly by contacting with light problem alcoholics or heavy problem alcoholics and the heavy problem alcoholics who receive treatment can relapse into the compartment of heavy problem alcoholics are also considered. First, the dynamics of our model on unweighted networks, including the basic reproduction number, existence and stability of equilibria are studied. Second, the models with fixed weighted and adaptive weighted networks are introduced and investigated. At last, some simulations are presented to illustrate and extend our results. Our results show that it is very important to treat alcoholics to quit the drinking.

Generic Information Can Retrieve Known Biological Associations: Implications for Biomedical Knowledge Discovery

PubMed Central

van Haagen, Herman H. H. B. M.; 't Hoen, Peter A. C.; Mons, Barend; Schultes, Erik A.

2013-01-01

Motivation Weighted semantic networks built from text-mined literature can be used to retrieve known protein-protein or gene-disease associations, and have been shown to anticipate associations years before they are explicitly stated in the literature. Our text-mining system recognizes over 640,000 biomedical concepts: some are specific (i.e., names of genes or proteins) others generic (e.g., ‘Homo sapiens’). Generic concepts may play important roles in automated information retrieval, extraction, and inference but may also result in concept overload and confound retrieval and reasoning with low-relevance or even spurious links. Here, we attempted to optimize the retrieval performance for protein-protein interactions (PPI) by filtering generic concepts (node filtering) or links to generic concepts (edge filtering) from a weighted semantic network. First, we defined metrics based on network properties that quantify the specificity of concepts. Then using these metrics, we systematically filtered generic information from the network while monitoring retrieval performance of known protein-protein interactions. We also systematically filtered specific information from the network (inverse filtering), and assessed the retrieval performance of networks composed of generic information alone. Results Filtering generic or specific information induced a two-phase response in retrieval performance: initially the effects of filtering were minimal but beyond a critical threshold network performance suddenly drops. Contrary to expectations, networks composed exclusively of generic information demonstrated retrieval performance comparable to unfiltered networks that also contain specific concepts. Furthermore, an analysis using individual generic concepts demonstrated that they can effectively support the retrieval of known protein-protein interactions. For instance the concept “binding” is indicative for PPI retrieval and the concept “mutation abnormality” is indicative for gene-disease associations. Conclusion Generic concepts are important for information retrieval and cannot be removed from semantic networks without negative impact on retrieval performance. PMID:24260124

Task-Related Edge Density (TED)—A New Method for Revealing Dynamic Network Formation in fMRI Data of the Human Brain

PubMed Central

Lohmann, Gabriele; Stelzer, Johannes; Zuber, Verena; Buschmann, Tilo; Margulies, Daniel; Bartels, Andreas; Scheffler, Klaus

2016-01-01

The formation of transient networks in response to external stimuli or as a reflection of internal cognitive processes is a hallmark of human brain function. However, its identification in fMRI data of the human brain is notoriously difficult. Here we propose a new method of fMRI data analysis that tackles this problem by considering large-scale, task-related synchronisation networks. Networks consist of nodes and edges connecting them, where nodes correspond to voxels in fMRI data, and the weight of an edge is determined via task-related changes in dynamic synchronisation between their respective times series. Based on these definitions, we developed a new data analysis algorithm that identifies edges that show differing levels of synchrony between two distinct task conditions and that occur in dense packs with similar characteristics. Hence, we call this approach “Task-related Edge Density” (TED). TED proved to be a very strong marker for dynamic network formation that easily lends itself to statistical analysis using large scale statistical inference. A major advantage of TED compared to other methods is that it does not depend on any specific hemodynamic response model, and it also does not require a presegmentation of the data for dimensionality reduction as it can handle large networks consisting of tens of thousands of voxels. We applied TED to fMRI data of a fingertapping and an emotion processing task provided by the Human Connectome Project. TED revealed network-based involvement of a large number of brain areas that evaded detection using traditional GLM-based analysis. We show that our proposed method provides an entirely new window into the immense complexity of human brain function. PMID:27341204

Task-Related Edge Density (TED)-A New Method for Revealing Dynamic Network Formation in fMRI Data of the Human Brain.

PubMed

Lohmann, Gabriele; Stelzer, Johannes; Zuber, Verena; Buschmann, Tilo; Margulies, Daniel; Bartels, Andreas; Scheffler, Klaus

2016-01-01

The formation of transient networks in response to external stimuli or as a reflection of internal cognitive processes is a hallmark of human brain function. However, its identification in fMRI data of the human brain is notoriously difficult. Here we propose a new method of fMRI data analysis that tackles this problem by considering large-scale, task-related synchronisation networks. Networks consist of nodes and edges connecting them, where nodes correspond to voxels in fMRI data, and the weight of an edge is determined via task-related changes in dynamic synchronisation between their respective times series. Based on these definitions, we developed a new data analysis algorithm that identifies edges that show differing levels of synchrony between two distinct task conditions and that occur in dense packs with similar characteristics. Hence, we call this approach "Task-related Edge Density" (TED). TED proved to be a very strong marker for dynamic network formation that easily lends itself to statistical analysis using large scale statistical inference. A major advantage of TED compared to other methods is that it does not depend on any specific hemodynamic response model, and it also does not require a presegmentation of the data for dimensionality reduction as it can handle large networks consisting of tens of thousands of voxels. We applied TED to fMRI data of a fingertapping and an emotion processing task provided by the Human Connectome Project. TED revealed network-based involvement of a large number of brain areas that evaded detection using traditional GLM-based analysis. We show that our proposed method provides an entirely new window into the immense complexity of human brain function.

Detection and clustering of features in aerial images by neuron network-based algorithm

NASA Astrophysics Data System (ADS)

Vozenilek, Vit

2015-12-01

The paper presents the algorithm for detection and clustering of feature in aerial photographs based on artificial neural networks. The presented approach is not focused on the detection of specific topographic features, but on the combination of general features analysis and their use for clustering and backward projection of clusters to aerial image. The basis of the algorithm is a calculation of the total error of the network and a change of weights of the network to minimize the error. A classic bipolar sigmoid was used for the activation function of the neurons and the basic method of backpropagation was used for learning. To verify that a set of features is able to represent the image content from the user's perspective, the web application was compiled (ASP.NET on the Microsoft .NET platform). The main achievements include the knowledge that man-made objects in aerial images can be successfully identified by detection of shapes and anomalies. It was also found that the appropriate combination of comprehensive features that describe the colors and selected shapes of individual areas can be useful for image analysis.

A Heterogeneous Network Based Method for Identifying GBM-Related Genes by Integrating Multi-Dimensional Data.

PubMed

Chen Peng; Ao Li

2017-01-01

The emergence of multi-dimensional data offers opportunities for more comprehensive analysis of the molecular characteristics of human diseases and therefore improving diagnosis, treatment, and prevention. In this study, we proposed a heterogeneous network based method by integrating multi-dimensional data (HNMD) to identify GBM-related genes. The novelty of the method lies in that the multi-dimensional data of GBM from TCGA dataset that provide comprehensive information of genes, are combined with protein-protein interactions to construct a weighted heterogeneous network, which reflects both the general and disease-specific relationships between genes. In addition, a propagation algorithm with resistance is introduced to precisely score and rank GBM-related genes. The results of comprehensive performance evaluation show that the proposed method significantly outperforms the network based methods with single-dimensional data and other existing approaches. Subsequent analysis of the top ranked genes suggests they may be functionally implicated in GBM, which further corroborates the superiority of the proposed method. The source code and the results of HNMD can be downloaded from the following URL: http://bioinformatics.ustc.edu.cn/hnmd/ .

Spatiotemporal Dynamics and Fitness Analysis of Global Oil Market: Based on Complex Network

PubMed Central

Wang, Minggang; Fang, Guochang; Shao, Shuai

2016-01-01

We study the overall topological structure properties of global oil trade network, such as degree, strength, cumulative distribution, information entropy and weight clustering. The structural evolution of the network is investigated as well. We find the global oil import and export networks do not show typical scale-free distribution, but display disassortative property. Furthermore, based on the monthly data of oil import values during 2005.01–2014.12, by applying random matrix theory, we investigate the complex spatiotemporal dynamic from the country level and fitness evolution of the global oil market from a demand-side analysis. Abundant information about global oil market can be obtained from deviating eigenvalues. The result shows that the oil market has experienced five different periods, which is consistent with the evolution of country clusters. Moreover, we find the changing trend of fitness function agrees with that of gross domestic product (GDP), and suggest that the fitness evolution of oil market can be predicted by forecasting GDP values. To conclude, some suggestions are provided according to the results. PMID:27706147

Spatial Fingerprints of Community Structure in Human Interaction Network for an Extensive Set of Large-Scale Regions

PubMed Central

Kallus, Zsófia; Barankai, Norbert; Szüle, János; Vattay, Gábor

2015-01-01

Human interaction networks inferred from country-wide telephone activity recordings were recently used to redraw political maps by projecting their topological partitions into geographical space. The results showed remarkable spatial cohesiveness of the network communities and a significant overlap between the redrawn and the administrative borders. Here we present a similar analysis based on one of the most popular online social networks represented by the ties between more than 5.8 million of its geo-located users. The worldwide coverage of their measured activity allowed us to analyze the large-scale regional subgraphs of entire continents and an extensive set of examples for single countries. We present results for North and South America, Europe and Asia. In our analysis we used the well-established method of modularity clustering after an aggregation of the individual links into a weighted graph connecting equal-area geographical pixels. Our results show fingerprints of both of the opposing forces of dividing local conflicts and of uniting cross-cultural trends of globalization. PMID:25993329

Resting-state theta band connectivity and graph analysis in generalized social anxiety disorder.

PubMed

Xing, Mengqi; Tadayonnejad, Reza; MacNamara, Annmarie; Ajilore, Olusola; DiGangi, Julia; Phan, K Luan; Leow, Alex; Klumpp, Heide

2017-01-01

Functional magnetic resonance imaging (fMRI) resting-state studies show generalized social anxiety disorder (gSAD) is associated with disturbances in networks involved in emotion regulation, emotion processing, and perceptual functions, suggesting a network framework is integral to elucidating the pathophysiology of gSAD. However, fMRI does not measure the fast dynamic interconnections of functional networks. Therefore, we examined whole-brain functional connectomics with electroencephalogram (EEG) during resting-state. Resting-state EEG data was recorded for 32 patients with gSAD and 32 demographically-matched healthy controls (HC). Sensor-level connectivity analysis was applied on EEG data by using Weighted Phase Lag Index (WPLI) and graph analysis based on WPLI was used to determine clustering coefficient and characteristic path length to estimate local integration and global segregation of networks. WPLI results showed increased oscillatory midline coherence in the theta frequency band indicating higher connectivity in the gSAD relative to HC group during rest. Additionally, WPLI values positively correlated with state anxiety levels within the gSAD group but not the HC group. Our graph theory based connectomics analysis demonstrated increased clustering coefficient and decreased characteristic path length in theta-based whole brain functional organization in subjects with gSAD compared to HC. Theta-dependent interconnectivity was associated with state anxiety in gSAD and an increase in information processing efficiency in gSAD (compared to controls). Results may represent enhanced baseline self-focused attention, which is consistent with cognitive models of gSAD and fMRI studies implicating emotion dysregulation and disturbances in task negative networks (e.g., default mode network) in gSAD.

Displacement back analysis for a high slope of the Dagangshan Hydroelectric Power Station based on BP neural network and particle swarm optimization.

PubMed

Liang, Zhengzhao; Gong, Bin; Tang, Chunan; Zhang, Yongbin; Ma, Tianhui

2014-01-01

The right bank high slope of the Dagangshan Hydroelectric Power Station is located in complicated geological conditions with deep fractures and unloading cracks. How to obtain the mechanical parameters and then evaluate the safety of the slope are the key problems. This paper presented a displacement back analysis for the slope using an artificial neural network model (ANN) and particle swarm optimization model (PSO). A numerical model was established to simulate the displacement increment results, acquiring training data for the artificial neural network model. The backpropagation ANN model was used to establish a mapping function between the mechanical parameters and the monitoring displacements. The PSO model was applied to initialize the weights and thresholds of the backpropagation (BP) network model and determine suitable values of the mechanical parameters. Then the elastic moduli of the rock masses were obtained according to the monitoring displacement data at different excavation stages, and the BP neural network model was proved to be valid by comparing the measured displacements, the displacements predicted by the BP neural network model, and the numerical simulation using the back-analyzed parameters. The proposed model is useful for rock mechanical parameters determination and instability investigation of rock slopes.

Correlated mRNAs and miRNAs from co-expression and regulatory networks affect porcine muscle and finally meat properties.

PubMed

Ponsuksili, Siriluck; Du, Yang; Hadlich, Frieder; Siengdee, Puntita; Murani, Eduard; Schwerin, Manfred; Wimmers, Klaus

2013-08-05

Physiological processes aiding the conversion of muscle to meat involve many genes associated with muscle structure and metabolic processes. MicroRNAs regulate networks of genes to orchestrate cellular functions, in turn regulating phenotypes. We applied weighted gene co-expression network analysis to identify co-expression modules that correlated to meat quality phenotypes and were highly enriched for genes involved in glucose metabolism, response to wounding, mitochondrial ribosome, mitochondrion, and extracellular matrix. Negative correlation of miRNA with mRNA and target prediction were used to select transcripts out of the modules of trait-associated mRNAs to further identify those genes that are correlated with post mortem traits. Porcine muscle co-expression transcript networks that correlated to post mortem traits were identified. The integration of miRNA and mRNA expression analyses, as well as network analysis, enabled us to interpret the differentially-regulated genes from a systems perspective. Linking co-expression networks of transcripts and hierarchically organized pairs of miRNAs and mRNAs to meat properties yields new insight into several biological pathways underlying phenotype differences. These pathways may also be diagnostic for many myopathies, which are accompanied by deficient nutrient and oxygen supply of muscle fibers.

Displacement Back Analysis for a High Slope of the Dagangshan Hydroelectric Power Station Based on BP Neural Network and Particle Swarm Optimization

PubMed Central

Liang, Zhengzhao; Gong, Bin; Tang, Chunan; Zhang, Yongbin; Ma, Tianhui

2014-01-01

The right bank high slope of the Dagangshan Hydroelectric Power Station is located in complicated geological conditions with deep fractures and unloading cracks. How to obtain the mechanical parameters and then evaluate the safety of the slope are the key problems. This paper presented a displacement back analysis for the slope using an artificial neural network model (ANN) and particle swarm optimization model (PSO). A numerical model was established to simulate the displacement increment results, acquiring training data for the artificial neural network model. The backpropagation ANN model was used to establish a mapping function between the mechanical parameters and the monitoring displacements. The PSO model was applied to initialize the weights and thresholds of the backpropagation (BP) network model and determine suitable values of the mechanical parameters. Then the elastic moduli of the rock masses were obtained according to the monitoring displacement data at different excavation stages, and the BP neural network model was proved to be valid by comparing the measured displacements, the displacements predicted by the BP neural network model, and the numerical simulation using the back-analyzed parameters. The proposed model is useful for rock mechanical parameters determination and instability investigation of rock slopes. PMID:25140345

Grey-matter network disintegration as predictor of cognitive and motor function with aging.

PubMed

Koini, Marisa; Duering, Marco; Gesierich, Benno G; Rombouts, Serge A R B; Ropele, Stefan; Wagner, Fabian; Enzinger, Christian; Schmidt, Reinhold

2018-06-01

Loss of grey-matter volume with advancing age affects the entire cortex. It has been suggested that atrophy occurs in a network-dependent manner with advancing age rather than in independent brain areas. The relationship between networks of structural covariance (SCN) disintegration and cognitive functioning during normal aging is not fully explored. We, therefore, aimed to (1) identify networks that lose GM integrity with advancing age, (2) investigate if age-related impairment of integrity in GM networks associates with cognitive function and decreasing fine motor skills (FMS), and (3) examine if GM disintegration is a mediator between age and cognition and FMS. T1-weighted scans of n = 257 participants (age range: 20-87) were used to identify GM networks using independent component analysis. Random forest analysis was implemented to examine the importance of network integrity as predictors of memory, executive functions, and FMS. The associations between GM disintegration, age and cognitive performance, and FMS were assessed using mediation analyses. Advancing age was associated with decreasing cognitive performance and FMS. Fourteen of 20 GM networks showed integrity changes with advancing age. Next to age and education, eight networks (fronto-parietal, fronto-occipital, temporal, limbic, secondary somatosensory, cuneal, sensorimotor network, and a cerebellar network) showed an association with cognition and FMS (up to 15.08%). GM networks partially mediated the effect between age and cognition and age and FMS. We confirm an age-related decline in cognitive functioning and FMS in non-demented community-dwelling subjects and showed that aging selectively affects the integrity of GM networks. The negative effect of age on cognition and FMS is associated with distinct GM networks and is partly mediated by their disintegration.

A networks-based discrete dynamic systems approach to volcanic seismicity

NASA Astrophysics Data System (ADS)

Suteanu, Mirela

2013-04-01

The detection and relevant description of pattern change concerning earthquake events is an important, but challenging task. In this paper, earthquake events related to volcanic activity are considered manifestations of a dynamic system evolving over time. The system dynamics is seen as a succession of events with point-like appearance both in time and in space. Each event is characterized by a position in three-dimensional space, a moment of occurrence, and an event size (magnitude). A weighted directed network is constructed to capture the effects of earthquakes on subsequent events. Each seismic event represents a node. Relations among events represent edges. Edge directions are given by the temporal succession of the events. Edges are also characterized by weights reflecting the strengths of the relation between the nodes. Weights are calculated as a function of (i) the time interval separating the two events, (ii) the spatial distance between the events, (iii) the magnitude of the earliest event among the two. Different ways of addressing weight components are explored, and their implications for the properties of the produced networks are analyzed. The resulting networks are then characterized in terms of degree- and weight distributions. Subsequently, the distribution of system transitions is determined for all the edges connecting related events in the network. Two- and three-dimensional diagrams are constructed to reflect transition distributions for each set of events. Networks are thus generated for successive temporal windows of different size, and the evolution of (a) network properties and (b) system transition distributions are followed over time and compared to the timeline of documented geologic processes. Applications concerning volcanic seismicity on the Big Island of Hawaii show that this approach is capable of revealing novel aspects of change occurring in the volcanic system on different scales in time and in space.

Tree-average distances on certain phylogenetic networks have their weights uniquely determined.

PubMed

Willson, Stephen J

2012-01-01

A phylogenetic network N has vertices corresponding to species and arcs corresponding to direct genetic inheritance from the species at the tail to the species at the head. Measurements of DNA are often made on species in the leaf set, and one seeks to infer properties of the network, possibly including the graph itself. In the case of phylogenetic trees, distances between extant species are frequently used to infer the phylogenetic trees by methods such as neighbor-joining. This paper proposes a tree-average distance for networks more general than trees. The notion requires a weight on each arc measuring the genetic change along the arc. For each displayed tree the distance between two leaves is the sum of the weights along the path joining them. At a hybrid vertex, each character is inherited from one of its parents. We will assume that for each hybrid there is a probability that the inheritance of a character is from a specified parent. Assume that the inheritance events at different hybrids are independent. Then for each displayed tree there will be a probability that the inheritance of a given character follows the tree; this probability may be interpreted as the probability of the tree. The tree-average distance between the leaves is defined to be the expected value of their distance in the displayed trees. For a class of rooted networks that includes rooted trees, it is shown that the weights and the probabilities at each hybrid vertex can be calculated given the network and the tree-average distances between the leaves. Hence these weights and probabilities are uniquely determined. The hypotheses on the networks include that hybrid vertices have indegree exactly 2 and that vertices that are not leaves have a tree-child.

Disrupted topological properties of brain white matter networks in left temporal lobe epilepsy: a diffusion tensor imaging study.

PubMed

Xu, Y; Qiu, S; Wang, J; Liu, Z; Zhang, R; Li, S; Cheng, L; Liu, Z; Wang, W; Huang, R

2014-10-24

Mesial temporal lobe epilepsy (mTLE) is the most common drug-refractory focal epilepsy in adults. Although previous functional and morphological studies have revealed abnormalities in the brain networks of mTLE, the topological organization of the brain white matter (WM) networks in mTLE patients is still ambiguous. In this study, we constructed brain WM networks for 14 left mTLE patients and 22 age- and gender-matched normal controls using diffusion tensor tractography and estimated the alterations of network properties in the mTLE brain networks using graph theoretical analysis. We found that networks for both the mTLE patients and the controls exhibited prominent small-world properties, suggesting a balanced topology of integration and segregation. However, the brain WM networks of mTLE patients showed a significant increased characteristic path length but significant decreased global efficiency, which indicate a disruption in the organization of the brain WM networks in mTLE patients. Moreover, we found significant between-group differences in the nodal properties in several brain regions, such as the left superior temporal gyrus, left hippocampus, the right occipital and right temporal cortices. The robustness analysis showed that the results were likely to be consistent for the networks constructed with different definitions of node and edge weight. Taken together, our findings may suggest an adverse effect of epileptic seizures on the organization of large-scale brain WM networks in mTLE patients. Copyright © 2014 IBRO. Published by Elsevier Ltd. All rights reserved.

Low-frequency sine wave hard-limiting technique

NASA Technical Reports Server (NTRS)

Anderson, T. O.

1977-01-01

Circuit includes serial-in/parallel-out shift register and weighting network that are used to eliminate effects of noise and other nonrepetitive circuit transients. Register and weighting network average decisions from section of signal where decisions are more dependable or where differences between two consecutive samples are larger.

Seed maturation associated transcriptional programs and regulatory networks underlying genotypic difference in seed dormancy and size/weight in wheat (Triticum aestivum L.).

PubMed

Yamasaki, Yuji; Gao, Feng; Jordan, Mark C; Ayele, Belay T

2017-09-16

Maturation forms one of the critical seed developmental phases and it is characterized mainly by programmed cell death, dormancy and desiccation, however, the transcriptional programs and regulatory networks underlying acquisition of dormancy and deposition of storage reserves during the maturation phase of seed development are poorly understood in wheat. The present study performed comparative spatiotemporal transcriptomic analysis of seed maturation in two wheat genotypes with contrasting seed weight/size and dormancy phenotype. The embryo and endosperm tissues of maturing seeds appeared to exhibit genotype-specific temporal shifts in gene expression profile that might contribute to the seed phenotypic variations. Functional annotations of gene clusters suggest that the two tissues exhibit distinct but genotypically overlapping molecular functions. Motif enrichment predicts genotypically distinct abscisic acid (ABA) and gibberellin (GA) regulated transcriptional networks contribute to the contrasting seed weight/size and dormancy phenotypes between the two genotypes. While other ABA responsive element (ABRE) motifs are enriched in both genotypes, the prevalence of G-box-like motif specifically in tissues of the dormant genotype suggests distinct ABA mediated transcriptional mechanisms control the establishment of dormancy during seed maturation. In agreement with this, the bZIP transcription factors that co-express with ABRE enriched embryonic genes differ with genotype. The enrichment of SITEIIATCYTC motif specifically in embryo clusters of maturing seeds irrespective of genotype predicts a tissue specific role for the respective TCP transcription factors with no or minimal contribution to the variations in seed dormancy. The results of this study advance our understanding of the seed maturation associated molecular mechanisms underlying variation in dormancy and weight/size in wheat seeds, which is a critical step towards the designing of molecular strategies for enhancing seed yield and quality.

The Influence of Synaptic Weight Distribution on Neuronal Population Dynamics

PubMed Central

Buice, Michael; Koch, Christof; Mihalas, Stefan

2013-01-01

The manner in which different distributions of synaptic weights onto cortical neurons shape their spiking activity remains open. To characterize a homogeneous neuronal population, we use the master equation for generalized leaky integrate-and-fire neurons with shot-noise synapses. We develop fast semi-analytic numerical methods to solve this equation for either current or conductance synapses, with and without synaptic depression. We show that its solutions match simulations of equivalent neuronal networks better than those of the Fokker-Planck equation and we compute bounds on the network response to non-instantaneous synapses. We apply these methods to study different synaptic weight distributions in feed-forward networks. We characterize the synaptic amplitude distributions using a set of measures, called tail weight numbers, designed to quantify the preponderance of very strong synapses. Even if synaptic amplitude distributions are equated for both the total current and average synaptic weight, distributions with sparse but strong synapses produce higher responses for small inputs, leading to a larger operating range. Furthermore, despite their small number, such synapses enable the network to respond faster and with more stability in the face of external fluctuations. PMID:24204219

A new optimized GA-RBF neural network algorithm.

PubMed

Jia, Weikuan; Zhao, Dean; Shen, Tian; Su, Chunyang; Hu, Chanli; Zhao, Yuyan

2014-01-01

When confronting the complex problems, radial basis function (RBF) neural network has the advantages of adaptive and self-learning ability, but it is difficult to determine the number of hidden layer neurons, and the weights learning ability from hidden layer to the output layer is low; these deficiencies easily lead to decreasing learning ability and recognition precision. Aiming at this problem, we propose a new optimized RBF neural network algorithm based on genetic algorithm (GA-RBF algorithm), which uses genetic algorithm to optimize the weights and structure of RBF neural network; it chooses new ways of hybrid encoding and optimizing simultaneously. Using the binary encoding encodes the number of the hidden layer's neurons and using real encoding encodes the connection weights. Hidden layer neurons number and connection weights are optimized simultaneously in the new algorithm. However, the connection weights optimization is not complete; we need to use least mean square (LMS) algorithm for further leaning, and finally get a new algorithm model. Using two UCI standard data sets to test the new algorithm, the results show that the new algorithm improves the operating efficiency in dealing with complex problems and also improves the recognition precision, which proves that the new algorithm is valid.

Deciphering metabonomics biomarkers-targets interactions for psoriasis vulgaris by network pharmacology.

PubMed

Gu, Jiangyong; Li, Li; Wang, Dongmei; Zhu, Wei; Han, Ling; Zhao, Ruizhi; Xu, Xiaojie; Lu, Chuanjian

2018-06-01

Psoriasis vulgaris is a chronic inflammatory and immune-mediated skin disease. 44 metabonomics biomarkers were identified by high-throughput liquid chromatography coupled to mass spectrometry in our previous work, but the roles of metabonomics biomarkers in the pathogenesis of psoriasis is unclear. The metabonomics biomarker-enzyme network was constructed. The key metabonomics biomarkers and enzymes were screened out by network analysis. The binding affinity between each metabonomics biomarker and target was calculated by molecular docking. A binding energy-weighted polypharmacological index was introduced to evaluate the importance of target-related pathways. Long-chain fatty acids, phospholipids, Estradiol and NADH were the most important metabonomics biomarkers. Most key enzymes belonged hydrolase, thioesterase and acyltransferase. Six proteins (TNF-alpha, MAPK3, iNOS, eNOS, COX2 and mTOR) were extensively involved in inflammatory reaction, immune response and cell proliferation, and might be drug targets for psoriasis. PI3K-Akt signaling pathway and five other pathways had close correlation with the pathogenesis of psoriasis and could deserve further research. The inflammatory reaction, immune response and cell proliferation are mainly involved in psoriasis. Network pharmacology provide a new insight into the relationships between metabonomics biomarkers and the pathogenesis of psoriasis. KEY MESSAGES   • Network pharmacology was adopted to identify key metabonomics biomarkers and enzymes.   • Six proteins were screened out as important drug targets for psoriasis.   • A binding energy-weighted polypharmacological index was introduced to evaluate the importance of target-related pathways.

Network pharmacology-based virtual screening of natural products from Clerodendrum species for identification of novel anti-cancer therapeutics.

PubMed

Gogoi, Barbi; Gogoi, Dhrubajyoti; Silla, Yumnam; Kakoti, Bibhuti Bhushan; Bhau, Brijmohan Singh

2017-01-31

Plant-derived natural products (NPs) play a vital role in the discovery of new drug molecules and these are used for development of novel therapeutic drugs for a specific disease target. Literature review suggests that natural products possess strong inhibitory efficacy against various types of cancer cells. Clerodendrum indicum and Clerodendrum serratum are reported to have anticancer activity; therefore a study was carried out to identify selective anticancer agents from these plants species. In this report, we employed a docking weighted network pharmacological approach to understand the multi-therapeutics potentiality of C. indicum and C. serratum against various types of cancer. A library of 53 natural products derived from these plants was compiled from the literature and three dimensional space analyses were performed in order to establish the drug-likeness of the NPs library. Further, an NPs-cancer network was built based on docking. We predicted five compounds, namely apigenin 7-glucoside, hispidulin, scutellarein-7-O-beta-d-glucuronate, acteoside and verbascoside, to be potential binding therapeutics for cancer target proteins. Apigenin 7-glucoside and hispidulin were found to have maximum binding interactions (relationship) with 17 cancer drug targets in terms of docking weighted network pharmacological analysis. Hence, we used an integrative approach obtained from network pharmacology for identifying combinatorial drug actions against the cancer targets. We believe that our present study may provide important clues for finding novel drug inhibitors for cancer.

GXNOR-Net: Training deep neural networks with ternary weights and activations without full-precision memory under a unified discretization framework.

PubMed

Deng, Lei; Jiao, Peng; Pei, Jing; Wu, Zhenzhi; Li, Guoqi

2018-04-01

Although deep neural networks (DNNs) are being a revolutionary power to open up the AI era, the notoriously huge hardware overhead has challenged their applications. Recently, several binary and ternary networks, in which the costly multiply-accumulate operations can be replaced by accumulations or even binary logic operations, make the on-chip training of DNNs quite promising. Therefore there is a pressing need to build an architecture that could subsume these networks under a unified framework that achieves both higher performance and less overhead. To this end, two fundamental issues are yet to be addressed. The first one is how to implement the back propagation when neuronal activations are discrete. The second one is how to remove the full-precision hidden weights in the training phase to break the bottlenecks of memory/computation consumption. To address the first issue, we present a multi-step neuronal activation discretization method and a derivative approximation technique that enable the implementing the back propagation algorithm on discrete DNNs. While for the second issue, we propose a discrete state transition (DST) methodology to constrain the weights in a discrete space without saving the hidden weights. Through this way, we build a unified framework that subsumes the binary or ternary networks as its special cases, and under which a heuristic algorithm is provided at the website https://github.com/AcrossV/Gated-XNOR. More particularly, we find that when both the weights and activations become ternary values, the DNNs can be reduced to sparse binary networks, termed as gated XNOR networks (GXNOR-Nets) since only the event of non-zero weight and non-zero activation enables the control gate to start the XNOR logic operations in the original binary networks. This promises the event-driven hardware design for efficient mobile intelligence. We achieve advanced performance compared with state-of-the-art algorithms. Furthermore, the computational sparsity and the number of states in the discrete space can be flexibly modified to make it suitable for various hardware platforms. Copyright © 2018 Elsevier Ltd. All rights reserved.

Effectiveness of the New Hampshire stream-gaging network in providing regional streamflow information

USGS Publications Warehouse

Olson, Scott A.

2003-01-01

The stream-gaging network in New Hampshire was analyzed for its effectiveness in providing regional information on peak-flood flow, mean-flow, and low-flow frequency. The data available for analysis were from stream-gaging stations in New Hampshire and selected stations in adjacent States. The principles of generalized-least-squares regression analysis were applied to develop regional regression equations that relate streamflow-frequency characteristics to watershed characteristics. Regression equations were developed for (1) the instantaneous peak flow with a 100-year recurrence interval, (2) the mean-annual flow, and (3) the 7-day, 10-year low flow. Active and discontinued stream-gaging stations with 10 or more years of flow data were used to develop the regression equations. Each stream-gaging station in the network was evaluated and ranked on the basis of how much the data from that station contributed to the cost-weighted sampling-error component of the regression equation. The potential effect of data from proposed and new stream-gaging stations on the sampling error also was evaluated. The stream-gaging network was evaluated for conditions in water year 2000 and for estimated conditions under various network strategies if an additional 5 years and 20 years of streamflow data were collected. The effectiveness of the stream-gaging network in providing regional streamflow information could be improved for all three flow characteristics with the collection of additional flow data, both temporally and spatially. With additional years of data collection, the greatest reduction in the average sampling error of the regional regression equations was found for the peak- and low-flow characteristics. In general, additional data collection at stream-gaging stations with unregulated flow, relatively short-term record (less than 20 years), and drainage areas smaller than 45 square miles contributed the largest cost-weighted reduction to the average sampling error of the regional estimating equations. The results of the network analyses can be used to prioritize the continued operation of active stations, the reactivation of discontinued stations, or the activation of new stations to maximize the regional information content provided by the stream-gaging network. Final decisions regarding altering the New Hampshire stream-gaging network would require the consideration of the many uses of the streamflow data serving local, State, and Federal interests.

Cascade Error Projection: A Learning Algorithm for Hardware Implementation

NASA Technical Reports Server (NTRS)

Duong, Tuan A.; Daud, Taher

1996-01-01

In this paper, we workout a detailed mathematical analysis for a new learning algorithm termed Cascade Error Projection (CEP) and a general learning frame work. This frame work can be used to obtain the cascade correlation learning algorithm by choosing a particular set of parameters. Furthermore, CEP learning algorithm is operated only on one layer, whereas the other set of weights can be calculated deterministically. In association with the dynamical stepsize change concept to convert the weight update from infinite space into a finite space, the relation between the current stepsize and the previous energy level is also given and the estimation procedure for optimal stepsize is used for validation of our proposed technique. The weight values of zero are used for starting the learning for every layer, and a single hidden unit is applied instead of using a pool of candidate hidden units similar to cascade correlation scheme. Therefore, simplicity in hardware implementation is also obtained. Furthermore, this analysis allows us to select from other methods (such as the conjugate gradient descent or the Newton's second order) one of which will be a good candidate for the learning technique. The choice of learning technique depends on the constraints of the problem (e.g., speed, performance, and hardware implementation); one technique may be more suitable than others. Moreover, for a discrete weight space, the theoretical analysis presents the capability of learning with limited weight quantization. Finally, 5- to 8-bit parity and chaotic time series prediction problems are investigated; the simulation results demonstrate that 4-bit or more weight quantization is sufficient for learning neural network using CEP. In addition, it is demonstrated that this technique is able to compensate for less bit weight resolution by incorporating additional hidden units. However, generation result may suffer somewhat with lower bit weight quantization.

Sparse representation of whole-brain fMRI signals for identification of functional networks.

PubMed

Lv, Jinglei; Jiang, Xi; Li, Xiang; Zhu, Dajiang; Chen, Hanbo; Zhang, Tuo; Zhang, Shu; Hu, Xintao; Han, Junwei; Huang, Heng; Zhang, Jing; Guo, Lei; Liu, Tianming

2015-02-01

There have been several recent studies that used sparse representation for fMRI signal analysis and activation detection based on the assumption that each voxel's fMRI signal is linearly composed of sparse components. Previous studies have employed sparse coding to model functional networks in various modalities and scales. These prior contributions inspired the exploration of whether/how sparse representation can be used to identify functional networks in a voxel-wise way and on the whole brain scale. This paper presents a novel, alternative methodology of identifying multiple functional networks via sparse representation of whole-brain task-based fMRI signals. Our basic idea is that all fMRI signals within the whole brain of one subject are aggregated into a big data matrix, which is then factorized into an over-complete dictionary basis matrix and a reference weight matrix via an effective online dictionary learning algorithm. Our extensive experimental results have shown that this novel methodology can uncover multiple functional networks that can be well characterized and interpreted in spatial, temporal and frequency domains based on current brain science knowledge. Importantly, these well-characterized functional network components are quite reproducible in different brains. In general, our methods offer a novel, effective and unified solution to multiple fMRI data analysis tasks including activation detection, de-activation detection, and functional network identification. Copyright © 2014 Elsevier B.V. All rights reserved.

Semi-supervised word polarity identification in resource-lean languages.

PubMed

Dehdarbehbahani, Iman; Shakery, Azadeh; Faili, Heshaam

2014-10-01

Sentiment words, as fundamental constitutive parts of subjective sentences, have a substantial effect on analysis of opinions, emotions and beliefs. Most of the proposed methods for identifying the semantic orientations of words exploit rich linguistic resources such as WordNet, subjectivity corpora, or polarity tagged words. Shortage of such linguistic resources in resource-lean languages affects the performance of word polarity identification in these languages. In this paper, we present a method which exploits a language with rich subjectivity analysis resources (English) to identify the polarity of words in a resource-lean foreign language. The English WordNet and a sparse foreign WordNet infrastructure are used to create a heterogeneous, multilingual and weighted semantic network. To identify the semantic orientation of foreign words, a random walk based method is applied to the semantic network along with a set of automatically weighted English positive and negative seeds. In a post-processing phase, synonym and antonym relations in the foreign WordNet are used to filter the random walk results. Our experiments on English and Persian languages show that the proposed method can outperform state-of-the-art word polarity identification methods in both languages. Copyright © 2014 Elsevier Ltd. All rights reserved.

Identifying osteosarcoma metastasis associated genes by weighted gene co-expression network analysis (WGCNA).

PubMed

Tian, Honglai; Guan, Donghui; Li, Jianmin

2018-06-01

Osteosarcoma (OS), the most common malignant bone tumor, accounts for the heavy healthy threat in the period of children and adolescents. OS occurrence usually correlates with early metastasis and high death rate. This study aimed to better understand the mechanism of OS metastasis.Based on Gene Expression Omnibus (GEO) database, we downloaded 4 expression profile data sets associated with OS metastasis, and selected differential expressed genes. Weighted gene co-expression network analysis (WGCNA) approach allowed us to investigate the most OS metastasis-correlated module. Gene Ontology functional and Kyoto Encyclopedia of Genes and Genomes (KEGG) pathway enrichment analyses were used to give annotation of selected OS metastasis-associated genes.We select 897 differential expressed genes from OS metastasis and OS non-metastasis groups. Based on these selected genes, WGCNA further explored 142 genes included in the most OS metastasis-correlated module. Gene Ontology functional and KEGG pathway enrichment analyses showed that significantly OS metastasis-associated genes were involved in pathway correlated with insulin-like growth factor binding.Our research figured out several potential molecules participating in metastasis process and factors acting as biomarker. With this study, we could better explore the mechanism of OS metastasis and further discover more therapy targets.

CCSDS Advanced Orbiting Systems Virtual Channel Access Service for QoS MACHETE Model

NASA Technical Reports Server (NTRS)

Jennings, Esther H.; Segui, John S.

2011-01-01

To support various communications requirements imposed by different missions, interplanetary communication protocols need to be designed, validated, and evaluated carefully. Multimission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE), described in "Simulator of Space Communication Networks" (NPO-41373), NASA Tech Briefs, Vol. 29, No. 8 (August 2005), p. 44, combines various tools for simulation and performance analysis of space networks. The MACHETE environment supports orbital analysis, link budget analysis, communications network simulations, and hardware-in-the-loop testing. By building abstract behavioral models of network protocols, one can validate performance after identifying the appropriate metrics of interest. The innovators have extended the MACHETE model library to include a generic link-layer Virtual Channel (VC) model supporting quality-of-service (QoS) controls based on IP streams. The main purpose of this generic Virtual Channel model addition was to interface fine-grain flow-based QoS (quality of service) between the network and MAC layers of the QualNet simulator, a commercial component of MACHETE. This software model adds the capability of mapping IP streams, based on header fields, to virtual channel numbers, allowing extended QoS handling at link layer. This feature further refines the QoS v existing at the network layer. QoS at the network layer (e.g. diffserv) supports few QoS classes, so data from one class will be aggregated together; differentiating between flows internal to a class/priority is not supported. By adding QoS classification capability between network and MAC layers through VC, one maps multiple VCs onto the same physical link. Users then specify different VC weights, and different queuing and scheduling policies at the link layer. This VC model supports system performance analysis of various virtual channel link-layer QoS queuing schemes independent of the network-layer QoS systems.

Real-Time Adaptive Color Segmentation by Neural Networks

NASA Technical Reports Server (NTRS)

Duong, Tuan A.

2004-01-01

Artificial neural networks that would utilize the cascade error projection (CEP) algorithm have been proposed as means of autonomous, real-time, adaptive color segmentation of images that change with time. In the original intended application, such a neural network would be used to analyze digitized color video images of terrain on a remote planet as viewed from an uninhabited spacecraft approaching the planet. During descent toward the surface of the planet, information on the segmentation of the images into differently colored areas would be updated adaptively in real time to capture changes in contrast, brightness, and resolution, all in an effort to identify a safe and scientifically productive landing site and provide control feedback to steer the spacecraft toward that site. Potential terrestrial applications include monitoring images of crops to detect insect invasions and monitoring of buildings and other facilities to detect intruders. The CEP algorithm is reliable and is well suited to implementation in very-large-scale integrated (VLSI) circuitry. It was chosen over other neural-network learning algorithms because it is better suited to realtime learning: It provides a self-evolving neural-network structure, requires fewer iterations to converge and is more tolerant to low resolution (that is, fewer bits) in the quantization of neural-network synaptic weights. Consequently, a CEP neural network learns relatively quickly, and the circuitry needed to implement it is relatively simple. Like other neural networks, a CEP neural network includes an input layer, hidden units, and output units (see figure). As in other neural networks, a CEP network is presented with a succession of input training patterns, giving rise to a set of outputs that are compared with the desired outputs. Also as in other neural networks, the synaptic weights are updated iteratively in an effort to bring the outputs closer to target values. A distinctive feature of the CEP neural network and algorithm is that each update of synaptic weights takes place in conjunction with the addition of another hidden unit, which then remains in place as still other hidden units are added on subsequent iterations. For a given training pattern, the synaptic weight between (1) the inputs and the previously added hidden units and (2) the newly added hidden unit is updated by an amount proportional to the partial derivative of a quadratic error function with respect to the synaptic weight. The synaptic weight between the newly added hidden unit and each output unit is given by a more complex function that involves the errors between the outputs and their target values, the transfer functions (hyperbolic tangents) of the neural units, and the derivatives of the transfer functions.

Optical and mechanical behaviors of glassy silicone networks derived from linear siloxane precursors

NASA Astrophysics Data System (ADS)

Jang, Heejun; Seo, Wooram; Kim, Hyungsun; Lee, Yoonjoo; Kim, Younghee

2016-01-01

Silicon-based inorganic polymers are promising materials as matrix materials for glass fiber composites because of their good process ability, transparency, and thermal property. In this study, for utilization as a matrix precursor for a glass-fiber-reinforced composite, glassy silicone networks were prepared via hydrosilylation of linear/pendant Si-H polysiloxanes and the C=C bonds of viny-lterminated linear/cyclic polysiloxanes. 13C nuclear magnetic resonance spectroscopy was used to determine the structure of the cross-linked states, and a thermal analysis was performed. To assess the mechanical properties of the glassy silicone networks, we performed nanoindentation and 4-point bending tests. Cross-linked networks derived from siloxane polymers are thermally and optically more stable at high temperatures. Different cross-linking agents led to final networks with different properties due to differences in the molecular weights and structures. After stepped postcuring, the Young's modulus and the hardness of the glassy silicone networks increased; however, the brittleness also increased. The characteristics of the cross-linking agent played an important role in the functional glassy silicone networks.

Diffany: an ontology-driven framework to infer, visualise and analyse differential molecular networks.

PubMed

Van Landeghem, Sofie; Van Parys, Thomas; Dubois, Marieke; Inzé, Dirk; Van de Peer, Yves

2016-01-05

Differential networks have recently been introduced as a powerful way to study the dynamic rewiring capabilities of an interactome in response to changing environmental conditions or stimuli. Currently, such differential networks are generated and visualised using ad hoc methods, and are often limited to the analysis of only one condition-specific response or one interaction type at a time. In this work, we present a generic, ontology-driven framework to infer, visualise and analyse an arbitrary set of condition-specific responses against one reference network. To this end, we have implemented novel ontology-based algorithms that can process highly heterogeneous networks, accounting for both physical interactions and regulatory associations, symmetric and directed edges, edge weights and negation. We propose this integrative framework as a standardised methodology that allows a unified view on differential networks and promotes comparability between differential network studies. As an illustrative application, we demonstrate its usefulness on a plant abiotic stress study and we experimentally confirmed a predicted regulator. Diffany is freely available as open-source java library and Cytoscape plugin from http://bioinformatics.psb.ugent.be/supplementary_data/solan/diffany/.

Excavation of attractor modules for nasopharyngeal carcinoma via integrating systemic module inference with attract method.

PubMed

Jiang, T; Jiang, C-Y; Shu, J-H; Xu, Y-J

2017-07-10

The molecular mechanism of nasopharyngeal carcinoma (NPC) is poorly understood and effective therapeutic approaches are needed. This research aimed to excavate the attractor modules involved in the progression of NPC and provide further understanding of the underlying mechanism of NPC. Based on the gene expression data of NPC, two specific protein-protein interaction networks for NPC and control conditions were re-weighted using Pearson correlation coefficient. Then, a systematic tracking of candidate modules was conducted on the re-weighted networks via cliques algorithm, and a total of 19 and 38 modules were separately identified from NPC and control networks, respectively. Among them, 8 pairs of modules with similar gene composition were selected, and 2 attractor modules were identified via the attract method. Functional analysis indicated that these two attractor modules participate in one common bioprocess of cell division. Based on the strategy of integrating systemic module inference with the attract method, we successfully identified 2 attractor modules. These attractor modules might play important roles in the molecular pathogenesis of NPC via affecting the bioprocess of cell division in a conjunct way. Further research is needed to explore the correlations between cell division and NPC.

Bayesian Computation Emerges in Generic Cortical Microcircuits through Spike-Timing-Dependent Plasticity

PubMed Central

Nessler, Bernhard; Pfeiffer, Michael; Buesing, Lars; Maass, Wolfgang

2013-01-01

The principles by which networks of neurons compute, and how spike-timing dependent plasticity (STDP) of synaptic weights generates and maintains their computational function, are unknown. Preceding work has shown that soft winner-take-all (WTA) circuits, where pyramidal neurons inhibit each other via interneurons, are a common motif of cortical microcircuits. We show through theoretical analysis and computer simulations that Bayesian computation is induced in these network motifs through STDP in combination with activity-dependent changes in the excitability of neurons. The fundamental components of this emergent Bayesian computation are priors that result from adaptation of neuronal excitability and implicit generative models for hidden causes that are created in the synaptic weights through STDP. In fact, a surprising result is that STDP is able to approximate a powerful principle for fitting such implicit generative models to high-dimensional spike inputs: Expectation Maximization. Our results suggest that the experimentally observed spontaneous activity and trial-to-trial variability of cortical neurons are essential features of their information processing capability, since their functional role is to represent probability distributions rather than static neural codes. Furthermore it suggests networks of Bayesian computation modules as a new model for distributed information processing in the cortex. PMID:23633941

Performance Analysis of OCDMA Based on AND Detection in FTTH Access Network Using PIN & APD Photodiodes

NASA Astrophysics Data System (ADS)

Aldouri, Muthana; Aljunid, S. A.; Ahmad, R. Badlishah; Fadhil, Hilal A.

2011-06-01

In order to comprise between PIN photo detector and avalanche photodiodes in a system used double weight (DW) code to be a performance of the optical spectrum CDMA in FTTH network with point-to-multi-point (P2MP) application. The performance of PIN against APD is compared through simulation by using opt system software version 7. In this paper we used two networks designed as follows one used PIN photo detector and the second using APD photo diode, both two system using with and without erbium doped fiber amplifier (EDFA). It is found that APD photo diode in this system is better than PIN photo detector for all simulation results. The conversion used a Mach-Zehnder interferometer (MZI) wavelength converter. Also we are study, the proposing a detection scheme known as AND subtraction detection technique implemented with fiber Bragg Grating (FBG) act as encoder and decoder. This FBG is used to encode and decode the spectral amplitude coding namely double weight (DW) code in Optical Code Division Multiple Access (OCDMA). The performances are characterized through bit error rate (BER) and bit rate (BR) also the received power at various bit rate.