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.

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.

A quantitative approach to measure road network information based on edge diversity

NASA Astrophysics Data System (ADS)

Wu, Xun; Zhang, Hong; Lan, Tian; Cao, Weiwei; He, Jing

2015-12-01

The measure of map information has been one of the key issues in assessing cartographic quality and map generalization algorithms. It is also important for developing efficient approaches to transfer geospatial information. Road network is the most common linear object in real world. Approximately describe road network information will benefit road map generalization, navigation map production and urban planning. Most of current approaches focused on node diversities and supposed that all the edges are the same, which is inconsistent to real-life condition, and thus show limitations in measuring network information. As real-life traffic flow are directed and of different quantities, the original undirected vector road map was first converted to a directed topographic connectivity map. Then in consideration of preferential attachment in complex network study and rich-club phenomenon in social network, the from and to weights of each edge are assigned. The from weight of a given edge is defined as the connectivity of its end node to the sum of the connectivities of all the neighbors of the from nodes of the edge. After getting the from and to weights of each edge, edge information, node information and the whole network structure information entropies could be obtained based on information theory. The approach has been applied to several 1 square mile road network samples. Results show that information entropies based on edge diversities could successfully describe the structural differences of road networks. This approach is a complementarity to current map information measurements, and can be extended to measure other kinds of geographical objects.

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.

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.

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.

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.

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.

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

A weighted communicability measure applied to complex brain networks

PubMed Central

Crofts, Jonathan J.; Higham, Desmond J.

2009-01-01

Recent advances in experimental neuroscience allow non-invasive studies of the white matter tracts in the human central nervous system, thus making available cutting-edge brain anatomical data describing these global connectivity patterns. Through magnetic resonance imaging, this non-invasive technique is able to infer a snapshot of the cortical network within the living human brain. Here, we report on the initial success of a new weighted network communicability measure in distinguishing local and global differences between diseased patients and controls. This approach builds on recent advances in network science, where an underlying connectivity structure is used as a means to measure the ease with which information can flow between nodes. One advantage of our method is that it deals directly with the real-valued connectivity data, thereby avoiding the need to discretize the corresponding adjacency matrix, i.e. to round weights up to 1 or down to 0, depending upon some threshold value. Experimental results indicate that the new approach is able to extract biologically relevant features that are not immediately apparent from the raw connectivity data. PMID:19141429

Onboard connectivity network for command-and-control aircraft

NASA Astrophysics Data System (ADS)

Artz, Timothy J.

1993-02-01

Command and control (C2) aircraft are host to an array of communications, information processing, and electronic control systems. The previous method of interconnecting this equipment involves point-to-point wiring harnesses between devices. A fiber optic broadband bus can be used to improve this situation by consolidating equipment connections on a shared medium. This network, known as the Onboard Connectivity Network (OCN), is being prototypes for application on the U.S. Government's Special Air Mission aircraft. Significant weight reduction and simplified future systems integration are the primary benefits of the OCN. The OCN design integrates voice, data, control, and video communications on a 3GHZ single mode fiber backbone. Communications within the aircraft use 500 MHz coaxial cable subnetworks connected to the backbone. The entire network is a dual redundant system for enhanced reliability. Node topologies are based on VMEbus to encourage use of commercial products and facilitate future evolution of the backbone topology. Network encryption technologies are being developed for OCN communications security. Automated workstations will be implemented to control and switch communications assets and to provide a technical control, test, and monitoring function.

Use of social networking sites by parents of very low birth weight infants: experiences and the potential of a dedicated site.

PubMed

Gabbert, Tatjana I; Metze, Boris; Bührer, Christoph; Garten, Lars

2013-12-01

The objective of this study was to study the experiences of parents of preterm infants who use social networking sites and the potential of such sites for gathering information and facilitating personal exchange. An anonymous self-reporting questionnaire was administered to parents of infants below 1,500 g birth weight born between January 1, 2009 and December 31, 2010 in two tertiary neonatal intensive care units. Of the 278 families who were sent a questionnaire, 141 responded; 53.6 % of respondents claimed to be presently members of online social networking sites. However, only 10.7 and 18.6 % used the Internet to exchange information about their infants during the NICU stay and after discharge, respectively. Most (64.0 %) responding parents considered that currently available commercial Internet sites inadequately met their need to exchange information as parents of preterm infants. Overall, 79.1 % of respondents reported that they would be interested in joining a native-language online networking site providing (1) general information on prematurity, (2) explanations of abbreviations commonly used in a hospital setting, and (3) details of common medical problems and the treatment thereof, including the availability of local therapists and follow-up services. Also, parents wanted to engage in personal exchange online not only with other parents but also with medical staff. The support of parents of hospitalized preterm infants by neonatal nurses and doctors could be extended by developing an expert-controlled, online networking site providing reliable and updated information and facilitating personal exchange among parents.

Community structure detection based on the neighbor node degree information

NASA Astrophysics Data System (ADS)

Tang, Li-Ying; Li, Sheng-Nan; Lin, Jian-Hong; Guo, Qiang; Liu, Jian-Guo

2016-11-01

Community structure detection is of great significance for better understanding the network topology property. By taking into account the neighbor degree information of the topological network as the link weight, we present an improved Nonnegative Matrix Factorization (NMF) method for detecting community structure. The results for empirical networks show that the largest improved ratio of the Normalized Mutual Information value could reach 63.21%. Meanwhile, for synthetic networks, the highest Normalized Mutual Information value could closely reach 1, which suggests that the improved method with the optimal λ can detect the community structure more accurately. This work is helpful for understanding the interplay between the link weight and the community structure detection.

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.

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)

Benchmarking Measures of Network Controllability on Canonical Graph Models

NASA Astrophysics Data System (ADS)

Wu-Yan, Elena; Betzel, Richard F.; Tang, Evelyn; Gu, Shi; Pasqualetti, Fabio; Bassett, Danielle S.

2018-03-01

The control of networked dynamical systems opens the possibility for new discoveries and therapies in systems biology and neuroscience. Recent theoretical advances provide candidate mechanisms by which a system can be driven from one pre-specified state to another, and computational approaches provide tools to test those mechanisms in real-world systems. Despite already having been applied to study network systems in biology and neuroscience, the practical performance of these tools and associated measures on simple networks with pre-specified structure has yet to be assessed. Here, we study the behavior of four control metrics (global, average, modal, and boundary controllability) on eight canonical graphs (including Erdős-Rényi, regular, small-world, random geometric, Barábasi-Albert preferential attachment, and several modular networks) with different edge weighting schemes (Gaussian, power-law, and two nonparametric distributions from brain networks, as examples of real-world systems). We observe that differences in global controllability across graph models are more salient when edge weight distributions are heavy-tailed as opposed to normal. In contrast, differences in average, modal, and boundary controllability across graph models (as well as across nodes in the graph) are more salient when edge weight distributions are less heavy-tailed. Across graph models and edge weighting schemes, average and modal controllability are negatively correlated with one another across nodes; yet, across graph instances, the relation between average and modal controllability can be positive, negative, or nonsignificant. Collectively, these findings demonstrate that controllability statistics (and their relations) differ across graphs with different topologies and that these differences can be muted or accentuated by differences in the edge weight distributions. More generally, our numerical studies motivate future analytical efforts to better understand the mathematical underpinnings of the relationship between graph topology and control, as well as efforts to design networks with specific control profiles.

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.

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.

Maximizing Information Diffusion in the Cyber-physical Integrated Network †

PubMed Central

Lu, Hongliang; Lv, Shaohe; Jiao, Xianlong; Wang, Xiaodong; Liu, Juan

2015-01-01

Nowadays, our living environment has been embedded with smart objects, such as smart sensors, smart watches and smart phones. They make cyberspace and physical space integrated by their abundant abilities of sensing, communication and computation, forming a cyber-physical integrated network. In order to maximize information diffusion in such a network, a group of objects are selected as the forwarding points. To optimize the selection, a minimum connected dominating set (CDS) strategy is adopted. However, existing approaches focus on minimizing the size of the CDS, neglecting an important factor: the weight of links. In this paper, we propose a distributed maximizing the probability of information diffusion (DMPID) algorithm in the cyber-physical integrated network. Unlike previous approaches that only consider the size of CDS selection, DMPID also considers the information spread probability that depends on the weight of links. To weaken the effects of excessively-weighted links, we also present an optimization strategy that can properly balance the two factors. The results of extensive simulation show that DMPID can nearly double the information diffusion probability, while keeping a reasonable size of selection with low overhead in different distributed networks. PMID:26569254

Quantification of Graph Complexity Based on the Edge Weight Distribution Balance: Application to Brain Networks.

PubMed

Gomez-Pilar, Javier; Poza, Jesús; Bachiller, Alejandro; Gómez, Carlos; Núñez, Pablo; Lubeiro, Alba; Molina, Vicente; Hornero, Roberto

2018-02-01

The aim of this study was to introduce a novel global measure of graph complexity: Shannon graph complexity (SGC). This measure was specifically developed for weighted graphs, but it can also be applied to binary graphs. The proposed complexity measure was designed to capture the interplay between two properties of a system: the 'information' (calculated by means of Shannon entropy) and the 'order' of the system (estimated by means of a disequilibrium measure). SGC is based on the concept that complex graphs should maintain an equilibrium between the aforementioned two properties, which can be measured by means of the edge weight distribution. In this study, SGC was assessed using four synthetic graph datasets and a real dataset, formed by electroencephalographic (EEG) recordings from controls and schizophrenia patients. SGC was compared with graph density (GD), a classical measure used to evaluate graph complexity. Our results showed that SGC is invariant with respect to GD and independent of node degree distribution. Furthermore, its variation with graph size [Formula: see text] is close to zero for [Formula: see text]. Results from the real dataset showed an increment in the weight distribution balance during the cognitive processing for both controls and schizophrenia patients, although these changes are more relevant for controls. Our findings revealed that SGC does not need a comparison with null-hypothesis networks constructed by a surrogate process. In addition, SGC results on the real dataset suggest that schizophrenia is associated with a deficit in the brain dynamic reorganization related to secondary pathways of the brain network.

The use of nodes attributes in social network analysis with an application to an international trade network

NASA Astrophysics Data System (ADS)

de Andrade, Ricardo Lopes; Rêgo, Leandro Chaves

2018-02-01

The social network analysis (SNA) studies the interactions among actors in a network formed through some relationship (friendship, cooperation, trade, among others). The SNA is constantly approached from a binary point of view, i.e., it is only observed if a link between two actors is present or not regardless of the strength of this link. It is known that different information can be obtained in weighted and unweighted networks and that the information extracted from weighted networks is more accurate and detailed. Another rarely discussed approach in the SNA is related to the individual attributes of the actors (nodes), because such analysis is usually focused on the topological structure of networks. Features of the nodes are not incorporated in the SNA what implies that there is some loss or misperception of information in those analyze. This paper aims at exploring more precisely the complexities of a social network, initially developing a method that inserts the individual attributes in the topological structure of the network and then analyzing the network in four different ways: unweighted, edge-weighted and two methods for using both edge-weights and nodes' attributes. The international trade network was chosen in the application of this approach, where the nodes represent the countries, the links represent the cash flow in the trade transactions and countries' GDP were chosen as nodes' attributes. As a result, it is possible to observe which countries are most connected in the world economy and with higher cash flows, to point out the countries that are central to the intermediation of the wealth flow and those that are most benefited from being included in this network. We also made a principal component analysis to study which metrics are more influential in describing the data variability, which turn out to be mostly the weighted metrics which include the nodes' attributes.

Reinforcement Learning of Two-Joint Virtual Arm Reaching in a Computer Model of Sensorimotor Cortex

PubMed Central

Neymotin, Samuel A.; Chadderdon, George L.; Kerr, Cliff C.; Francis, Joseph T.; Lytton, William W.

2014-01-01

Neocortical mechanisms of learning sensorimotor control involve a complex series of interactions at multiple levels, from synaptic mechanisms to cellular dynamics to network connectomics. We developed a model of sensory and motor neocortex consisting of 704 spiking model neurons. Sensory and motor populations included excitatory cells and two types of interneurons. Neurons were interconnected with AMPA/NMDA and GABAA synapses. We trained our model using spike-timing-dependent reinforcement learning to control a two-joint virtual arm to reach to a fixed target. For each of 125 trained networks, we used 200 training sessions, each involving 15 s reaches to the target from 16 starting positions. Learning altered network dynamics, with enhancements to neuronal synchrony and behaviorally relevant information flow between neurons. After learning, networks demonstrated retention of behaviorally relevant memories by using proprioceptive information to perform reach-to-target from multiple starting positions. Networks dynamically controlled which joint rotations to use to reach a target, depending on current arm position. Learning-dependent network reorganization was evident in both sensory and motor populations: learned synaptic weights showed target-specific patterning optimized for particular reach movements. Our model embodies an integrative hypothesis of sensorimotor cortical learning that could be used to interpret future electrophysiological data recorded in vivo from sensorimotor learning experiments. We used our model to make the following predictions: learning enhances synchrony in neuronal populations and behaviorally relevant information flow across neuronal populations, enhanced sensory processing aids task-relevant motor performance and the relative ease of a particular movement in vivo depends on the amount of sensory information required to complete the movement. PMID:24047323

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.

Information transfer network of global market indices

NASA Astrophysics Data System (ADS)

Kim, Yup; Kim, Jinho; Yook, Soon-Hyung

2015-07-01

We study the topological properties of the information transfer networks (ITN) of the global financial market indices for six different periods. ITN is a directed weighted network, in which the direction and weight are determined by the transfer entropy between market indices. By applying the threshold method, it is found that ITN undergoes a crossover from the complete graph to a small-world (SW) network. SW regime of ITN for a global crisis is found to be much more enhanced than that for ordinary periods. Furthermore, when ITN is in SW regime, the average clustering coefficient is found to be synchronized with average volatility of markets. We also compare the results with the topological properties of correlation networks.

Relative Differences in Resting-State Brain Connectivity Associated with Long Term Intensive Lifestyle Intervention

PubMed Central

Casanova, Ramon; Hayasaka, Satoru; Saldana, Santiago; Bryan, Nick R.; Demos, Kathryn E.; Desiderio, Lisa; Erickson, Kirk I.; Espeland, Mark A.; Nasrallah, Ilya M.; Wadden, Thomas; Laurienti, Paul J.

2016-01-01

A number of studies have reported that type 2 diabetes mellitus (T2DM) is associated with alterations in resting-state activity and connectivity in the brain. There is also evidence that interventions involving physical activity and weight loss may affect brain functional connectivity. In this study, we examined the effects of nearly 10 years of an intensive lifestyle intervention (ILI), designed to induce and sustain weight loss through lower caloric intake and increased physical activity, on resting-state networks in adults with T2DM. We performed a cross-sectional comparison of global and local characteristics from functional brain networks between individuals who had been randomly assigned to ILI or a control condition of health education and support. Upon examining brain networks from 312 participants (average age: 68.8 for ILI and 67.9 for controls), we found that ILI participants (N=160) had attenuated local efficiency at the network-level compared with controls (N=152). Although there was no group difference in the network-level global efficiency, we found that, among ILI participants, nodal global efficiency was elevated in left fusiform gyrus, right middle frontal gyrus, and pars opercularis of right inferior frontal gyrus. These effects were age-dependent, with more pronounced effects for older participants. Overall these results indicate that the individuals assigned to the ILI had brain networks with less regional and more global connectivity, particularly involving frontal lobes. Such patterns would support greater distributed information processing. Future studies are needed to determine if these differences are associated with age-related compensatory function in the ILI group or worse pathology in the control group. PMID:27685338

Neuroendocrine and immune network re-modeling in chronic fatigue syndrome: an exploratory analysis.

PubMed

Fuite, Jim; Vernon, Suzanne D; Broderick, Gordon

2008-12-01

This work investigates the significance of changes in association patterns linking indicators of neuroendocrine and immune activity in patients with chronic fatigue syndrome (CFS). Gene sets preferentially expressed in specific immune cell isolates were integrated with neuroendocrine data from a large population-based study. Co-expression patterns linking immune cell activity with hypothalamic-pituitary-adrenal (HPA), thyroidal (HPT) and gonadal (HPG) axis status were computed using mutual information criteria. Networks in control and CFS subjects were compared globally in terms of a weighted graph edit distance. Local re-modeling of node connectivity was quantified by node degree and eigenvector centrality measures. Results indicate statistically significant differences between CFS and control networks determined mainly by re-modeling around pituitary and thyroid nodes as well as an emergent immune sub-network. Findings align with known mechanisms of chronic inflammation and support possible immune-mediated loss of thyroid function in CFS exacerbated by blunted HPA axis responsiveness.

The QAP weighted network analysis method and its application in international services trade

NASA Astrophysics Data System (ADS)

Xu, Helian; Cheng, Long

2016-04-01

Based on QAP (Quadratic Assignment Procedure) correlation and complex network theory, this paper puts forward a new method named QAP Weighted Network Analysis Method. The core idea of the method is to analyze influences among relations in a social or economic group by building a QAP weighted network of networks of relations. In the QAP weighted network, a node depicts a relation and an undirect edge exists between any pair of nodes if there is significant correlation between relations. As an application of the QAP weighted network, we study international services trade by using the QAP weighted network, in which nodes depict 10 kinds of services trade relations. After the analysis of international services trade by QAP weighted network, and by using distance indicators, hierarchy tree and minimum spanning tree, the conclusion shows that: Firstly, significant correlation exists in all services trade, and the development of any one service trade will stimulate the other nine. Secondly, as the economic globalization goes deeper, correlations in all services trade have been strengthened continually, and clustering effects exist in those services trade. Thirdly, transportation services trade, computer and information services trade and communication services trade have the most influence and are at the core in all services trade.

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.

Adaptive neural network motion control of manipulators with experimental evaluations.

PubMed

Puga-Guzmán, S; Moreno-Valenzuela, J; Santibáñez, V

2014-01-01

A nonlinear proportional-derivative controller plus adaptive neuronal network compensation is proposed. With the aim of estimating the desired torque, a two-layer neural network is used. Then, adaptation laws for the neural network weights are derived. Asymptotic convergence of the position and velocity tracking errors is proven, while the neural network weights are shown to be uniformly bounded. The proposed scheme has been experimentally validated in real time. These experimental evaluations were carried in two different mechanical systems: a horizontal two degrees-of-freedom robot and a vertical one degree-of-freedom arm which is affected by the gravitational force. In each one of the two experimental set-ups, the proposed scheme was implemented without and with adaptive neural network compensation. Experimental results confirmed the tracking accuracy of the proposed adaptive neural network-based controller.

Adaptive Neural Network Motion Control of Manipulators with Experimental Evaluations

PubMed Central

Puga-Guzmán, S.; Moreno-Valenzuela, J.; Santibáñez, V.

2014-01-01

A nonlinear proportional-derivative controller plus adaptive neuronal network compensation is proposed. With the aim of estimating the desired torque, a two-layer neural network is used. Then, adaptation laws for the neural network weights are derived. Asymptotic convergence of the position and velocity tracking errors is proven, while the neural network weights are shown to be uniformly bounded. The proposed scheme has been experimentally validated in real time. These experimental evaluations were carried in two different mechanical systems: a horizontal two degrees-of-freedom robot and a vertical one degree-of-freedom arm which is affected by the gravitational force. In each one of the two experimental set-ups, the proposed scheme was implemented without and with adaptive neural network compensation. Experimental results confirmed the tracking accuracy of the proposed adaptive neural network-based controller. PMID:24574910

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.

Chaos control of the brushless direct current motor using adaptive dynamic surface control based on neural network with the minimum weights.

PubMed

Luo, Shaohua; Wu, Songli; Gao, Ruizhen

2015-07-01

This paper investigates chaos control for the brushless DC motor (BLDCM) system by adaptive dynamic surface approach based on neural network with the minimum weights. The BLDCM system contains parameter perturbation, chaotic behavior, and uncertainty. With the help of radial basis function (RBF) neural network to approximate the unknown nonlinear functions, the adaptive law is established to overcome uncertainty of the control gain. By introducing the RBF neural network and adaptive technology into the dynamic surface control design, a robust chaos control scheme is developed. It is proved that the proposed control approach can guarantee that all signals in the closed-loop system are globally uniformly bounded, and the tracking error converges to a small neighborhood of the origin. Simulation results are provided to show that the proposed approach works well in suppressing chaos and parameter perturbation.

Chaos control of the brushless direct current motor using adaptive dynamic surface control based on neural network with the minimum weights

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

Luo, Shaohua; Department of Mechanical Engineering, Chongqing Aerospace Polytechnic, Chongqing, 400021; Wu, Songli

2015-07-15

This paper investigates chaos control for the brushless DC motor (BLDCM) system by adaptive dynamic surface approach based on neural network with the minimum weights. The BLDCM system contains parameter perturbation, chaotic behavior, and uncertainty. With the help of radial basis function (RBF) neural network to approximate the unknown nonlinear functions, the adaptive law is established to overcome uncertainty of the control gain. By introducing the RBF neural network and adaptive technology into the dynamic surface control design, a robust chaos control scheme is developed. It is proved that the proposed control approach can guarantee that all signals in themore » closed-loop system are globally uniformly bounded, and the tracking error converges to a small neighborhood of the origin. Simulation results are provided to show that the proposed approach works well in suppressing chaos and parameter perturbation.« less

Finite-horizon control-constrained nonlinear optimal control using single network adaptive critics.

PubMed

Heydari, Ali; Balakrishnan, Sivasubramanya N

2013-01-01

To synthesize fixed-final-time control-constrained optimal controllers for discrete-time nonlinear control-affine systems, a single neural network (NN)-based controller called the Finite-horizon Single Network Adaptive Critic is developed in this paper. Inputs to the NN are the current system states and the time-to-go, and the network outputs are the costates that are used to compute optimal feedback control. Control constraints are handled through a nonquadratic cost function. Convergence proofs of: 1) the reinforcement learning-based training method to the optimal solution; 2) the training error; and 3) the network weights are provided. The resulting controller is shown to solve the associated time-varying Hamilton-Jacobi-Bellman equation and provide the fixed-final-time optimal solution. Performance of the new synthesis technique is demonstrated through different examples including an attitude control problem wherein a rigid spacecraft performs a finite-time attitude maneuver subject to control bounds. The new formulation has great potential for implementation since it consists of only one NN with single set of weights and it provides comprehensive feedback solutions online, though it is trained offline.

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.

Robust pinning control of heterogeneous complex networks with jointly connected topologies and time-varying parametric uncertainty

NASA Astrophysics Data System (ADS)

Manfredi, Sabato

2018-05-01

The pinning/leader control problems provide the design of the leader or pinning controller in order to guide a complex network to a desired trajectory or target (synchronisation or consensus). Let a time-invariant complex network, pinning/leader control problems include the design of the leader or pinning controller gain and number of nodes to pin in order to guide a network to a desired trajectory (synchronization or consensus). Usually, lower is the number of pinned nodes larger is the pinning gain required to assess network synchronisation. On the other side, realistic application scenario of complex networks is characterised by switching topologies, time-varying node coupling strength and link weight that make hard to solve the pinning/leader control problem. Additionally, the system dynamics at nodes can be heterogeneous. In this paper, we derive robust stabilisation conditions of time-varying heterogeneous complex networks with jointly connected topologies when coupling strength and link weight interactions are affected by time-varying uncertainties. By employing Lyapunov stability theory and linear matrix inequality (LMI) technique, we formulate low computationally demanding stabilisability conditions to design a pinning/leader control gain for robust network synchronisation. The effectiveness of the proposed approach is shown by several design examples applied to a paradigmatic well-known complex network composed of heterogeneous Chua's circuits.

Forced phase-locked states and information retrieval in a two-layer network of oscillatory neurons with directional connectivity

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

Kazantsev, Victor; Pimashkin, Alexey; Department of Neurodynamics and Neurobiology, Nizhny Novgorod State University, 23 Gagarin Ave., 603950 Nizhny Novgorod

We propose two-layer architecture of associative memory oscillatory network with directional interlayer connectivity. The network is capable to store information in the form of phase-locked (in-phase and antiphase) oscillatory patterns. The first (input) layer takes an input pattern to be recognized and their units are unidirectionally connected with all units of the second (control) layer. The connection strengths are weighted using the Hebbian rule. The output (retrieved) patterns appear as forced-phase locked states of the control layer. The conditions are found and analytically expressed for pattern retrieval in response on incoming stimulus. It is shown that the system is capablemore » to recover patterns with a certain level of distortions or noises in their profiles. The architecture is implemented with the Kuramoto phase model and using synaptically coupled neural oscillators with spikes. It is found that the spiking model is capable to retrieve patterns using the spiking phase that translates memorized patterns into the spiking phase shifts at different time scales.« less

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.

Control Centrality and Hierarchical Structure in Complex Networks

PubMed Central

Liu, Yang-Yu; Slotine, Jean-Jacques; Barabási, Albert-László

2012-01-01

We introduce the concept of control centrality to quantify the ability of a single node to control a directed weighted network. We calculate the distribution of control centrality for several real networks and find that it is mainly determined by the network’s degree distribution. We show that in a directed network without loops the control centrality of a node is uniquely determined by its layer index or topological position in the underlying hierarchical structure of the network. Inspired by the deep relation between control centrality and hierarchical structure in a general directed network, we design an efficient attack strategy against the controllability of malicious networks. PMID:23028542

Analysis of Friendship Network and its Role in Explaining Obesity

PubMed Central

Marathe, Achla; Pan, Zhengzheng; Apolloni, Andrea

2013-01-01

We employ Add Health data to show that friendship networks, constructed from mutual friendship nominations, are important in building weight perception, setting weight goals and measuring social marginalization among adolescents and young adults. We study the relationship between individuals’ perceived weight status, actual weight status, weight status relative to friends’ weight status and weight goals. This analysis helps us understand how individual weight perceptions might be formed, what these perceptions do to the weight goals, and how does friends’ relative weight affect weight perception and weight goals. Combining this information with individuals’ friendship network helps determine the influence of social relationships on weight related variables. Multinomial logistic regression results indicate that relative status is indeed a significant predictor of perceived status, and perceived status is a significant predictor of weight goals. We also address the issue of causality between actual weight status and social marginalization (as measured by the number of friends) and show that obesity precedes social marginalization in time rather than the other way around. This lends credence to the hypothesis that obesity leads to social marginalization not vice versa. Attributes of friendship network can provide new insights into effective interventions for combating obesity since adolescent friendships provide an important social context for weight related behaviors. PMID:25328818

How College Students Search the Internet for Weight Control and Weight Management Information: An Observational Study

ERIC Educational Resources Information Center

Senkowski, Valerie; Branscum, Paul

2015-01-01

Background: Few studies have attempted to examine how young adults search for health information on the Internet, especially information related to weight control and weight management. Purpose: The purpose of this study was to determine search strategies that college students used for finding information related to weight control and weight…

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.

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

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.

Neural Network Control of a Magnetically Suspended Rotor System

NASA Technical Reports Server (NTRS)

Choi, Benjamin B.

1998-01-01

Magnetic bearings offer significant advantages because they do not come into contact with other parts during operation, which can reduce maintenance. Higher speeds, no friction, no lubrication, weight reduction, precise position control, and active damping make them far superior to conventional contact bearings. However, there are technical barriers that limit the application of this technology in industry. One of them is the need for a nonlinear controller that can overcome the system nonlinearity and uncertainty inherent in magnetic bearings. At the NASA Lewis Research Center, a neural network was selected as a nonlinear controller because it generates a neural model without any detailed information regarding the internal working of the magnetic bearing system. It can be used even for systems that are too complex for an accurate system model to be derived. A feed-forward architecture with a back-propagation learning algorithm was selected because of its proven performance, accuracy, and relatively easy implementation.

Photonic reservoir computing: a new approach to optical information processing

NASA Astrophysics Data System (ADS)

Vandoorne, Kristof; Fiers, Martin; Verstraeten, David; Schrauwen, Benjamin; Dambre, Joni; Bienstman, Peter

2010-06-01

Despite ever increasing computational power, recognition and classification problems remain challenging to solve. Recently, advances have been made by the introduction of the new concept of reservoir computing. This is a methodology coming from the field of machine learning and neural networks that has been successfully used in several pattern classification problems, like speech and image recognition. Thus far, most implementations have been in software, limiting their speed and power efficiency. Photonics could be an excellent platform for a hardware implementation of this concept because of its inherent parallelism and unique nonlinear behaviour. Moreover, a photonic implementation offers the promise of massively parallel information processing with low power and high speed. We propose using a network of coupled Semiconductor Optical Amplifiers (SOA) and show in simulation that it could be used as a reservoir by comparing it to conventional software implementations using a benchmark speech recognition task. In spite of the differences with classical reservoir models, the performance of our photonic reservoir is comparable to that of conventional implementations and sometimes slightly better. As our implementation uses coherent light for information processing, we find that phase tuning is crucial to obtain high performance. In parallel we investigate the use of a network of photonic crystal cavities. The coupled mode theory (CMT) is used to investigate these resonators. A new framework is designed to model networks of resonators and SOAs. The same network topologies are used, but feedback is added to control the internal dynamics of the system. By adjusting the readout weights of the network in a controlled manner, we can generate arbitrary periodic patterns.

A fast new algorithm for a robot neurocontroller using inverse QR decomposition

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

Morris, A.S.; Khemaissia, S.

2000-01-01

A new adaptive neural network controller for robots is presented. The controller is based on direct adaptive techniques. Unlike many neural network controllers in the literature, inverse dynamical model evaluation is not required. A numerically robust, computationally efficient processing scheme for neutral network weight estimation is described, namely, the inverse QR decomposition (INVQR). The inverse QR decomposition and a weighted recursive least-squares (WRLS) method for neural network weight estimation is derived using Cholesky factorization of the data matrix. The algorithm that performs the efficient INVQR of the underlying space-time data matrix may be implemented in parallel on a triangular array.more » Furthermore, its systolic architecture is well suited for VLSI implementation. Another important benefit is well suited for VLSI implementation. Another important benefit of the INVQR decomposition is that it solves directly for the time-recursive least-squares filter vector, while avoiding the sequential back-substitution step required by the QR decomposition approaches.« less

The Obesity Learning Centre (OLC) – a website supporting those working towards a healthy weight and reducing obesity levels

PubMed Central

Korjonen, Helena

2011-01-01

Objectives: Develop a website, the OLC, which supports those people who work on promoting a healthy weight and tackling obesity. Research shows that original networks where sharing of information and peer interaction take place create solutions to current public health challenges. Methods: Considerations that are relevant when building a new information service as well as the technical set up and information needs of users were taken into account prior to building the OLC and during continuous development and maintenance. Results: The OLC provides global news, resources and tools and link out to other networks, websites and organisations providing similar useful information. The OLC also uses social networking tools to highlight new and important information. Discussion: Networks contribute to a stronger community that can respond to emerging challenges in public health. The OLC improves connections of people and services from different backgrounds and organisations. Some challenges exist in the technical set up and also because of other aspects, e.g. public health information and differing information needs. Conclusion: Public health work programmes should include networking opportunities where public policy can be disseminated. The provision of necessary tools and resources can lead to better decision-making, save time and money and lead to improved public health outcomes. PMID:23569599

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.

Optimizing Dynamical Network Structure for Pinning Control

NASA Astrophysics Data System (ADS)

Orouskhani, Yasin; Jalili, Mahdi; Yu, Xinghuo

2016-04-01

Controlling dynamics of a network from any initial state to a final desired state has many applications in different disciplines from engineering to biology and social sciences. In this work, we optimize the network structure for pinning control. The problem is formulated as four optimization tasks: i) optimizing the locations of driver nodes, ii) optimizing the feedback gains, iii) optimizing simultaneously the locations of driver nodes and feedback gains, and iv) optimizing the connection weights. A newly developed population-based optimization technique (cat swarm optimization) is used as the optimization method. In order to verify the methods, we use both real-world networks, and model scale-free and small-world networks. Extensive simulation results show that the optimal placement of driver nodes significantly outperforms heuristic methods including placing drivers based on various centrality measures (degree, betweenness, closeness and clustering coefficient). The pinning controllability is further improved by optimizing the feedback gains. We also show that one can significantly improve the controllability by optimizing the connection weights.

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.

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

Gust prediction via artificial hair sensor array and neural network

NASA Astrophysics Data System (ADS)

Pankonien, Alexander M.; Thapa Magar, Kaman S.; Beblo, Richard V.; Reich, Gregory W.

2017-04-01

Gust Load Alleviation (GLA) is an important aspect of flight dynamics and control that reduces structural loadings and enhances ride quality. In conventional GLA systems, the structural response to aerodynamic excitation informs the control scheme. A phase lag, imposed by inertia, between the excitation and the measurement inherently limits the effectiveness of these systems. Hence, direct measurement of the aerodynamic loading can eliminate this lag, providing valuable information for effective GLA system design. Distributed arrays of Artificial Hair Sensors (AHS) are ideal for surface flow measurements that can be used to predict other necessary parameters such as aerodynamic forces, moments, and turbulence. In previous work, the spatially distributed surface flow velocities obtained from an array of artificial hair sensors using a Single-State (or feedforward) Neural Network were found to be effective in estimating the steady aerodynamic parameters such as air speed, angle of attack, lift and moment coefficient. This paper extends the investigation of the same configuration to unsteady force and moment estimation, which is important for active GLA control design. Implementing a Recurrent Neural Network that includes previous-timestep sensor information, the hair sensor array is shown to be capable of capturing gust disturbances with a wide range of periods, reducing predictive error in lift and moment by 68% and 52% respectively. The L2 norms of the first layer of the weight matrices were compared showing a 23% emphasis on prior versus current information. The Recurrent architecture also improves robustness, exhibiting only a 30% increase in predictive error when undertrained as compared to a 170% increase by the Single-State NN. This diverse, localized information can thus be directly implemented into a control scheme that alleviates the gusts without waiting for a structural response or requiring user-intensive sensor calibration.

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.

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.

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

TRACTOGRAPHY DENSITY AND NETWORK MEASURES IN ALZHEIMER'S DISEASE.

PubMed

Prasad, Gautam; Nir, Talia M; Toga, Arthur W; Thompson, Paul M

2013-04-01

Brain connectivity declines in Alzheimer's disease (AD), both functionally and structurally. Connectivity maps and networks derived from diffusion-based tractography offer new ways to track disease progression and to understand how AD affects the brain. Here we set out to identify (1) which fiber network measures show greatest differences between AD patients and controls, and (2) how these effects depend on the density of fibers extracted by the tractography algorithm. We computed brain networks from diffusion-weighted images (DWI) of the brain, in 110 subjects (28 normal elderly, 56 with early and 11 with late mild cognitive impairment, and 15 with AD). We derived connectivity matrices and network topology measures, for each subject, from whole-brain tractography and cortical parcellations. We used an ODF lookup table to speed up fiber extraction, and to exploit the full information in the orientation distribution function (ODF). This made it feasible to compute high density connectivity maps. We used accelerated tractography to compute a large number of fibers to understand what effect fiber density has on network measures and in distinguishing different disease groups in our data. We focused on global efficiency, transitivity, path length, mean degree, density, modularity, small world, and assortativity measures computed from weighted and binary undirected connectivity matrices. Of all these measures, the mean nodal degree best distinguished diagnostic groups. High-density fiber matrices were most helpful for picking up the more subtle clinical differences, e.g. between mild cognitively impaired (MCI) and normals, or for distinguishing subtypes of MCI (early versus late). Care is needed in clinical analyses of brain connectivity, as the density of extracted fibers may affect how well a network measure can pick up differences between patients and controls.

PANATIKI: A Network Access Control Implementation Based on PANA for IoT Devices

PubMed Central

Sanchez, Pedro Moreno; Lopez, Rafa Marin; Gomez Skarmeta, Antonio F.

2013-01-01

Internet of Things (IoT) networks are the pillar of recent novel scenarios, such as smart cities or e-healthcare applications. Among other challenges, these networks cover the deployment and interaction of small devices with constrained capabilities and Internet protocol (IP)-based networking connectivity. These constrained devices usually require connection to the Internet to exchange information (e.g., management or sensing data) or access network services. However, only authenticated and authorized devices can, in general, establish this connection. The so-called authentication, authorization and accounting (AAA) services are in charge of performing these tasks on the Internet. Thus, it is necessary to deploy protocols that allow constrained devices to verify their credentials against AAA infrastructures. The Protocol for Carrying Authentication for Network Access (PANA) has been standardized by the Internet engineering task force (IETF) to carry the Extensible Authentication Protocol (EAP), which provides flexible authentication upon the presence of AAA. To the best of our knowledge, this paper is the first deep study of the feasibility of EAP/PANA for network access control in constrained devices. We provide light-weight versions and implementations of these protocols to fit them into constrained devices. These versions have been designed to reduce the impact in standard specifications. The goal of this work is two-fold: (1) to demonstrate the feasibility of EAP/PANA in IoT devices; (2) to provide the scientific community with the first light-weight interoperable implementation of EAP/PANA for constrained devices in the Contiki operating system (Contiki OS), called PANATIKI. The paper also shows a testbed, simulations and experimental results obtained from real and simulated constrained devices. PMID:24189332

PANATIKI: a network access control implementation based on PANA for IoT devices.

PubMed

Moreno Sanchez, Pedro; Marin Lopez, Rafa; Gomez Skarmeta, Antonio F

2013-11-01

Internet of Things (IoT) networks are the pillar of recent novel scenarios, such as smart cities or e-healthcare applications. Among other challenges, these networks cover the deployment and interaction of small devices with constrained capabilities and Internet protocol (IP)-based networking connectivity. These constrained devices usually require connection to the Internet to exchange information (e.g., management or sensing data) or access network services. However, only authenticated and authorized devices can, in general, establish this connection. The so-called authentication, authorization and accounting (AAA) services are in charge of performing these tasks on the Internet. Thus, it is necessary to deploy protocols that allow constrained devices to verify their credentials against AAA infrastructures. The Protocol for Carrying Authentication for Network Access (PANA) has been standardized by the Internet engineering task force (IETF) to carry the Extensible Authentication Protocol (EAP), which provides flexible authentication upon the presence of AAA. To the best of our knowledge, this paper is the first deep study of the feasibility of EAP/PANA for network access control in constrained devices. We provide light-weight versions and implementations of these protocols to fit them into constrained devices. These versions have been designed to reduce the impact in standard specifications. The goal of this work is two-fold: (1) to demonstrate the feasibility of EAP/PANA in IoT devices; (2) to provide the scientific community with the first light-weight interoperable implementation of EAP/PANA for constrained devices in the Contiki operating system (Contiki OS), called PANATIKI. The paper also shows a testbed, simulations and experimental results obtained from real and simulated constrained devices.

Structured pedigree information for distributed fusion systems

NASA Astrophysics Data System (ADS)

Arambel, Pablo O.

2008-04-01

One of the most critical challenges in distributed data fusion is the avoidance of information double counting (also called "data incest" or "rumor propagation"). This occurs when a node in a network incorporates information into an estimate - e.g. the position of an object - and the estimate is injected into the network. Other nodes fuse this estimate with their own estimates, and continue to propagate estimates through the network. When the first node receives a fused estimate from the network, it does not know if it already contains its own contributions or not. Since the correlation between its own estimate and the estimate received from the network is not known, the node can not fuse the estimates in an optimal way. If it assumes that both estimates are independent from each other, it unknowingly double counts the information that has already being used to obtain the two estimates. This leads to overoptimistic error covariance matrices. If the double-counting is not kept under control, it may lead to serious performance degradation. Double counting can be avoided by propagating uniquely tagged raw measurements; however, that forces each node to process all the measurements and precludes the propagation of derived information. Another approach is to fuse the information using the Covariance Intersection (CI) equations, which maintain consistent estimates irrespective of the cross-correlation among estimates. However, CI does not exploit pedigree information of any kind. In this paper we present an approach that propagates multiple covariance matrices, one for each uncorrelated source in the network. This is a way to compress the pedigree information and avoids the need to propagate raw measurements. The approach uses a generalized version of the Split CI to fuse different estimates with appropriate weights to guarantee the consistency of the estimates.

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

Weighted compactness function based label propagation algorithm for community detection

NASA Astrophysics Data System (ADS)

Zhang, Weitong; Zhang, Rui; Shang, Ronghua; Jiao, Licheng

2018-02-01

Community detection in complex networks, is to detect the community structure with the internal structure relatively compact and the external structure relatively sparse, according to the topological relationship among nodes in the network. In this paper, we propose a compactness function which combines the weight of nodes, and use it as the objective function to carry out the node label propagation. Firstly, according to the node degree, we find the sets of core nodes which have great influence on the network. The more the connections between the core nodes and the other nodes are, the larger the amount of the information these kernel nodes receive and transform. Then, according to the similarity of the nodes between the core nodes sets and the nodes degree, we assign weights to the nodes in the network. So the label of the nodes with great influence will be the priority in the label propagation process, which effectively improves the accuracy of the label propagation. The compactness function between nodes and communities in this paper is based on the nodes influence. It combines the connections between nodes and communities with the degree of the node belongs to its neighbor communities based on calculating the node weight. The function effectively uses the information of nodes and connections in the network. The experimental results show that the proposed algorithm can achieve good results in the artificial network and large-scale real networks compared with the 8 contrast algorithms.

Information Weighted Consensus for Distributed Estimation in Vision Networks

ERIC Educational Resources Information Center

Kamal, Ahmed Tashrif

2013-01-01

Due to their high fault-tolerance, ease of installation and scalability to large networks, distributed algorithms have recently gained immense popularity in the sensor networks community, especially in computer vision. Multi-target tracking in a camera network is one of the fundamental problems in this domain. Distributed estimation algorithms…

Integrative Analysis of Many Weighted Co-Expression Networks Using Tensor Computation

PubMed Central

Li, Wenyuan; Liu, Chun-Chi; Zhang, Tong; Li, Haifeng; Waterman, Michael S.; Zhou, Xianghong Jasmine

2011-01-01

The rapid accumulation of biological networks poses new challenges and calls for powerful integrative analysis tools. Most existing methods capable of simultaneously analyzing a large number of networks were primarily designed for unweighted networks, and cannot easily be extended to weighted networks. However, it is known that transforming weighted into unweighted networks by dichotomizing the edges of weighted networks with a threshold generally leads to information loss. We have developed a novel, tensor-based computational framework for mining recurrent heavy subgraphs in a large set of massive weighted networks. Specifically, we formulate the recurrent heavy subgraph identification problem as a heavy 3D subtensor discovery problem with sparse constraints. We describe an effective approach to solving this problem by designing a multi-stage, convex relaxation protocol, and a non-uniform edge sampling technique. We applied our method to 130 co-expression networks, and identified 11,394 recurrent heavy subgraphs, grouped into 2,810 families. We demonstrated that the identified subgraphs represent meaningful biological modules by validating against a large set of compiled biological knowledge bases. We also showed that the likelihood for a heavy subgraph to be meaningful increases significantly with its recurrence in multiple networks, highlighting the importance of the integrative approach to biological network analysis. Moreover, our approach based on weighted graphs detects many patterns that would be overlooked using unweighted graphs. In addition, we identified a large number of modules that occur predominately under specific phenotypes. This analysis resulted in a genome-wide mapping of gene network modules onto the phenome. Finally, by comparing module activities across many datasets, we discovered high-order dynamic cooperativeness in protein complex networks and transcriptional regulatory networks. PMID:21698123

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.

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.

Neural network L1 adaptive control of MIMO systems with nonlinear uncertainty.

PubMed

Zhen, Hong-tao; Qi, Xiao-hui; Li, Jie; Tian, Qing-min

2014-01-01

An indirect adaptive controller is developed for a class of multiple-input multiple-output (MIMO) nonlinear systems with unknown uncertainties. This control system is comprised of an L 1 adaptive controller and an auxiliary neural network (NN) compensation controller. The L 1 adaptive controller has guaranteed transient response in addition to stable tracking. In this architecture, a low-pass filter is adopted to guarantee fast adaptive rate without generating high-frequency oscillations in control signals. The auxiliary compensation controller is designed to approximate the unknown nonlinear functions by MIMO RBF neural networks to suppress the influence of uncertainties. NN weights are tuned on-line with no prior training and the project operator ensures the weights bounded. The global stability of the closed-system is derived based on the Lyapunov function. Numerical simulations of an MIMO system coupled with nonlinear uncertainties are used to illustrate the practical potential of our theoretical results.

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.

Information spread in networks: Games, optimal control, and stabilization

NASA Astrophysics Data System (ADS)

Khanafer, Ali

This thesis focuses on designing efficient mechanisms for controlling information spread in networks. We consider two models for information spread. The first one is the well-known distributed averaging dynamics. The second model is a nonlinear one that describes virus spread in computer and biological networks. We seek to design optimal, robust, and stabilizing controllers under practical constraints. For distributed averaging networks, we study the interaction between a network designer and an adversary. We consider two types of attacks on the network. In Attack-I, the adversary strategically disconnects a set of links to prevent the nodes from reaching consensus. Meanwhile, the network designer assists the nodes in reaching consensus by changing the weights of a limited number of links in the network. We formulate two problems to describe this competition where the order in which the players act is reversed in the two problems. Although the canonical equations provided by the Pontryagin's Maximum Principle (MP) seem to be intractable, we provide an alternative characterization for the optimal strategies that makes connection to potential theory. Further, we provide a sufficient condition for the existence of a saddle-point equilibrium (SPE) for the underlying zero-sum game. In Attack-II, the designer and the adversary are both capable of altering the measurements of all nodes in the network by injecting global signals. We impose two constraints on both players: a power constraint and an energy constraint. We assume that the available energy to each player is not sufficient to operate at maximum power throughout the horizon of the game. We show the existence of an SPE and derive the optimal strategies in closed form for this attack scenario. As an alternative to the "network designer vs. adversary" framework, we investigate the possibility of stabilizing unknown network diffusion processes using a distributed mechanism, where the uncertainty is due to an attack on the network. To this end, we propose a distributed version of the classical logic-based supervisory control scheme. Given a network of agents whose dynamics contain unknown parameters, the distributed supervisory control scheme is used to assist the agents to converge to a certain set-point without requiring them to have explicit knowledge of that set-point. Unlike the classical supervisory control scheme where a centralized supervisor makes switching decisions among the candidate controllers, in our scheme, each agent is equipped with a local supervisor that switches among the available controllers. The switching decisions made at a certain agent depend only on the information from its neighboring agents. We provide sufficient conditions for stabilization and apply our framework to the distributed averaging problem in the presence of large modeling uncertainty. For infected networks, we study the stability properties of a susceptible-infected-susceptible (SIS) diffusion model, so-called the n-intertwined Markov model, over arbitrary network topologies. Similar to the majority of infection spread dynamics, this model exhibits a threshold phenomenon. When the curing rates in the network are high, the all-healthy state is the unique equilibrium over the network. Otherwise, an endemic equilibrium state emerges, where some infection remains within the network. Using notions from positive systems theory, we provide conditions for the global asymptotic stability of the equilibrium points in both cases over strongly and weakly connected directed networks based on the value of the basic reproduction number, a fundamental quantity in the study of epidemics. Furthermore, we demonstrate that the n-intertwined Markov model can be viewed as a best-response dynamical system of a concave game among the nodes. This characterization allows us to cast new infection spread dynamics; additionally, we provide a sufficient condition, for the global convergence to the all-healthy state, that can be checked in a distributed fashion. Moreover, we investigate the problem of stabilizing the network when the curing rates of a limited number of nodes can be controlled. In particular, we characterize the number of controllers required for a class of undirected graphs. We also design optimal controllers capable of minimizing the total infection in the network at minimum cost. Finally, we outline a set of open problems in the area of information spread control.

The application of immune genetic algorithm in main steam temperature of PID control of BP network

NASA Astrophysics Data System (ADS)

Li, Han; Zhen-yu, Zhang

In order to overcome the uncertainties, large delay, large inertia and nonlinear property of the main steam temperature controlled object in the power plant, a neural network intelligent PID control system based on immune genetic algorithm and BP neural network is designed. Using the immune genetic algorithm global search optimization ability and good convergence, optimize the weights of the neural network, meanwhile adjusting PID parameters using BP network. The simulation result shows that the system is superior to conventional PID control system in the control of quality and robustness.

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

Optimal control of epidemic information dissemination over networks.

PubMed

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

2014-12-01

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

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.

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.

Access control and confidentiality in radiology

NASA Astrophysics Data System (ADS)

Noumeir, Rita; Chafik, Adil

2005-04-01

A medical record contains a large amount of data about the patient such as height, weight and blood pressure. It also contains sensitive information such as fertility, abortion, psychiatric data, sexually transmitted diseases and diagnostic results. Access to this information must be carefully controlled. Information technology has greatly improved patient care. The recent extensive deployment of digital medical images made diagnostic images promptly available to healthcare decision makers, regardless of their geographic location. Medical images are digitally archived, transferred on telecommunication networks, and visualized on computer screens. However, with the widespread use of computing and communication technologies in healthcare, the issue of data security has become increasingly important. Most of the work until now has focused on the security of data communication to ensure its integrity, authentication, confidentiality and user accountability. The mechanisms that have been proposed to achieve the security of data communication are not specific to healthcare. Data integrity can be achieved with data signature. Data authentication can be achieved with certificate exchange. Data confidentiality can be achieved with encryption. User accountability can be achieved with audits. Although these mechanisms are essential to ensure data security during its transfer on the network, access control is needed in order to ensure data confidentiality and privacy within the information system application. In this paper, we present and discuss an access control mechanism that takes into account the notion of a care process. Radiology information is categorized and a model to enforce data privacy is proposed.

Proposed health state awareness of helicopter blades using an artificial neural network strategy

NASA Astrophysics Data System (ADS)

Lee, Andrew; Habtour, Ed; Gadsden, S. A.

2016-05-01

Structural health prognostics and diagnosis strategies can be classified as either model or signal-based. Artificial neural network strategies are popular signal-based techniques. This paper proposes the use of helicopter blades in order to study the sensitivity of an artificial neural network to structural fatigue. The experimental setup consists of a scale aluminum helicopter blade exposed to transverse vibratory excitation at the hub using single axis electrodynamic shaker. The intent of this study is to optimize an algorithm for processing high-dimensional data while retaining important information content in an effort to select input features and weights, as well as health parameters, for training a neural network. Data from accelerometers and piezoelectric transducers is collected from a known system designated as healthy. Structural damage will be introduced to different blades, which they will be designated as unhealthy. A variety of different tests will be performed to track the evolution and severity of the damage. A number of damage detection and diagnosis strategies will be implemented. A preliminary experiment was performed on aluminum cantilever beams providing a simpler model for implementation and proof of concept. Future work will look at utilizing the detection information as part of a hierarchical control system in order to mitigate structural damage and fatigue. The proposed approach may eliminate massive data storage on board of an aircraft through retaining relevant information only. The control system can then employ the relevant information to intelligently reconfigure adaptive maneuvers to avoid harmful regimes, thus, extending the life of the aircraft.

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

Effects of a weight management program delivered by social media on weight and metabolic syndrome risk factors in overweight and obese adults: A randomised controlled trial.

PubMed

Jane, Monica; Hagger, Martin; Foster, Jonathan; Ho, Suleen; Kane, Robert; Pal, Sebely

2017-01-01

The aim of this project was to evaluate the effectiveness of using social media to augment the delivery of, and provide support for, a weight management program delivered to overweight and obese individuals during a twenty four week intervention. Participants randomly divided into either one of two intervention groups or a control group. The two intervention groups were instructed to follow identical weight-management program. One group received the program within a Facebook group, along with a support network with the group, and the other intervention group received the same program in a booklet. The control group was given standard care. Participants' weight and other metabolic syndrome risk factors were measured at baseline and at weeks 6, 12, 18 and 24. The Facebook Group reported a 4.8% reduction in initial weight, significant compared to the CG only (p = 0.01), as well as numerically greater improvements in body mass index, waist circumference, fat mass, lean mass, and energy intake compared to the Pamphlet Group and the Control Group. These results demonstrate the potential of social media to assist overweight and obese individuals with respect to dietary and physical activity modifications for weight management, and justify further research into the inclusion of social media in clinical weight management programs. It is anticipated that social media will provide an invaluable resource for health professionals, as a low maintenance vehicle for communicating with patients, as well as a source of social support and information sharing for individuals undergoing lifestyle modifications.

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.

Leader-Follower Formation Control of UUVs with Model Uncertainties, Current Disturbances, and Unstable Communication

PubMed Central

Yan, Zheping; Xu, Da; Chen, Tao; Zhang, Wei; Liu, Yibo

2018-01-01

Unmanned underwater vehicles (UUVs) have rapidly developed as mobile sensor networks recently in the investigation, survey, and exploration of the underwater environment. The goal of this paper is to develop a practical and efficient formation control method to improve work efficiency of multi-UUV sensor networks. Distributed leader-follower formation controllers are designed based on a state feedback and consensus algorithm. Considering that each vehicle is subject to model uncertainties and current disturbances, a second-order integral UUV model with a nonlinear function is established using the state feedback linearized method under current disturbances. For unstable communication among UUVs, communication failure and acoustic link noise interference are considered. Two-layer random switching communication topologies are proposed to solve the problem of communication failure. For acoustic link noise interference, accurate representation of valid communication information and noise stripping when designing controllers is necessary. Effective communication topology weights are designed to represent the validity of communication information interfered by noise. Utilizing state feedback and noise stripping, sufficient conditions for design formation controllers are proposed to ensure UUV formation achieves consensus under model uncertainties, current disturbances, and unstable communication. The stability of formation controllers is proven by the Lyapunov-Razumikhin theorem, and the validity is verified by simulation results. PMID:29473919

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.

Estimating topological properties of weighted networks from limited information

NASA Astrophysics Data System (ADS)

Gabrielli, Andrea; Cimini, Giulio; Garlaschelli, Diego; Squartini, Angelo

A typical problem met when studying complex systems is the limited information available on their topology, which hinders our understanding of their structural and dynamical properties. A paramount example is provided by financial networks, whose data are privacy protected. Yet, the estimation of systemic risk strongly depends on the detailed structure of the interbank network. The resulting challenge is that of using aggregate information to statistically reconstruct a network and correctly predict its higher-order properties. Standard approaches either generate unrealistically dense networks, or fail to reproduce the observed topology by assigning homogeneous link weights. Here we develop a reconstruction method, based on statistical mechanics concepts, that exploits the empirical link density in a highly non-trivial way. Technically, our approach consists in the preliminary estimation of node degrees from empirical node strengths and link density, followed by a maximum-entropy inference based on a combination of empirical strengths and estimated degrees. Our method is successfully tested on the international trade network and the interbank money market, and represents a valuable tool for gaining insights on privacy-protected or partially accessible systems. Acknoweledgement to ``Growthcom'' ICT - EC project (Grant No: 611272) and ``Crisislab'' Italian Project.

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.

Enabling Controlling Complex Networks with Local Topological Information.

PubMed

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

2018-03-15

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

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.

Contribution of Apollo lunar photography to the establishment of selenodetic control

NASA Technical Reports Server (NTRS)

Dermanis, A.

1975-01-01

Among the various types of available data relevant to the establishment of geometric control on the moon, the only one covering significant portions of the lunar surface (20%) with sufficient information content, is lunar photography, taken at the proximity of the moon from lunar orbiters. The idea of free geodetic networks is introduced as a tool for the statistical comparison of the geometric aspects of the various data used. Methods were developed for the updating of the statistics of observations and the a priori parameter estimates to obtain statistically consistent solutions by means of the optimum relative weighting concept.

Adaptive Neurons For Artificial Neural Networks

NASA Technical Reports Server (NTRS)

Tawel, Raoul

1990-01-01

Training time decreases dramatically. In improved mathematical model of neural-network processor, temperature of neurons (in addition to connection strengths, also called weights, of synapses) varied during supervised-learning phase of operation according to mathematical formalism and not heuristic rule. Evidence that biological neural networks also process information at neuronal level.

Controllability of Deterministic Networks with the Identical Degree Sequence

PubMed Central

Ma, Xiujuan; Zhao, Haixing; Wang, Binghong

2015-01-01

Controlling complex network is an essential problem in network science and engineering. Recent advances indicate that the controllability of complex network is dependent on the network's topology. Liu and Barabási, et.al speculated that the degree distribution was one of the most important factors affecting controllability for arbitrary complex directed network with random link weights. In this paper, we analysed the effect of degree distribution to the controllability for the deterministic networks with unweighted and undirected. We introduce a class of deterministic networks with identical degree sequence, called (x,y)-flower. We analysed controllability of the two deterministic networks ((1, 3)-flower and (2, 2)-flower) by exact controllability theory in detail and give accurate results of the minimum number of driver nodes for the two networks. In simulation, we compare the controllability of (x,y)-flower networks. Our results show that the family of (x,y)-flower networks have the same degree sequence, but their controllability is totally different. So the degree distribution itself is not sufficient to characterize the controllability of deterministic networks with unweighted and undirected. PMID:26020920

Development of automated system based on neural network algorithm for detecting defects on molds installed on casting machines

NASA Astrophysics Data System (ADS)

Bazhin, V. Yu; Danilov, I. V.; Petrov, P. A.

2018-05-01

During the casting of light alloys and ligatures based on aluminum and magnesium, problems of the qualitative distribution of the metal and its crystallization in the mold arise. To monitor the defects of molds on the casting conveyor, a camera with a resolution of 780 x 580 pixels and a shooting rate of 75 frames per second was selected. Images of molds from casting machines were used as input data for neural network algorithm. On the preparation of a digital database and its analytical evaluation stage, the architecture of the convolutional neural network was chosen for the algorithm. The information flow from the local controller is transferred to the OPC server and then to the SCADA system of foundry. After the training, accuracy of neural network defect recognition was about 95.1% on a validation split. After the training, weight coefficients of the neural network were used on testing split and algorithm had identical accuracy with validation images. The proposed technical solutions make it possible to increase the efficiency of the automated process control system in the foundry by expanding the digital database.

On-line, adaptive state estimator for active noise control

NASA Technical Reports Server (NTRS)

Lim, Tae W.

1994-01-01

Dynamic characteristics of airframe structures are expected to vary as aircraft flight conditions change. Accurate knowledge of the changing dynamic characteristics is crucial to enhancing the performance of the active noise control system using feedback control. This research investigates the development of an adaptive, on-line state estimator using a neural network concept to conduct active noise control. In this research, an algorithm has been developed that can be used to estimate displacement and velocity responses at any locations on the structure from a limited number of acceleration measurements and input force information. The algorithm employs band-pass filters to extract from the measurement signal the frequency contents corresponding to a desired mode. The filtered signal is then used to train a neural network which consists of a linear neuron with three weights. The structure of the neural network is designed as simple as possible to increase the sampling frequency as much as possible. The weights obtained through neural network training are then used to construct the transfer function of a mode in z-domain and to identify modal properties of each mode. By using the identified transfer function and interpolating the mode shape obtained at sensor locations, the displacement and velocity responses are estimated with reasonable accuracy at any locations on the structure. The accuracy of the response estimates depends on the number of modes incorporated in the estimates and the number of sensors employed to conduct mode shape interpolation. Computer simulation demonstrates that the algorithm is capable of adapting to the varying dynamic characteristics of structural properties. Experimental implementation of the algorithm on a DSP (digital signal processing) board for a plate structure is underway. The algorithm is expected to reach the sampling frequency range of about 10 kHz to 20 kHz which needs to be maintained for a typical active noise control application.

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.

Vertex centrality as a measure of information flow in Italian Corporate Board Networks

NASA Astrophysics Data System (ADS)

Grassi, Rosanna

2010-06-01

The aim of this article is to investigate the governance models of companies listed on the Italian Stock Exchange by using a network approach, which describes the interlinks between boards of directors. Following mainstream literature, I construct a weighted graph representing the listed companies (vertices) and their relationships (weighted edges), the Corporate Board Network; I then apply three different vertex centrality measures: degree, betweenness and flow betweenness. What emerges from the network construction and by applying the degree centrality is a structure with a large number of connections but not particularly dense, where the presence of a small number of highly connected nodes (hubs) is evident. Then I focus on betweenness and flow betweenness; indeed I expect that these centrality measures may give a representation of the intensity of the relationship between companies, capturing the volume of information flowing from one vertex to another. Finally, I investigate the possible scale-free structure of the network.

Progress in neuromorphic photonics

NASA Astrophysics Data System (ADS)

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

2017-03-01

As society's appetite for information continues to grow, so does our need to process this information with increasing speed and versatility. Many believe that the one-size-fits-all solution of digital electronics is becoming a limiting factor in certain areas such as data links, cognitive radio, and ultrafast control. Analog photonic devices have found relatively simple signal processing niches where electronics can no longer provide sufficient speed and reconfigurability. Recently, the landscape for commercially manufacturable photonic chips has been changing rapidly and now promises to achieve economies of scale previously enjoyed solely by microelectronics. By bridging the mathematical prowess of artificial neural networks to the underlying physics of optoelectronic devices, neuromorphic photonics could breach new domains of information processing demanding significant complexity, low cost, and unmatched speed. In this article, we review the progress in neuromorphic photonics, focusing on photonic integrated devices. The challenges and design rules for optoelectronic instantiation of artificial neurons are presented. The proposed photonic architecture revolves around the processing network node composed of two parts: a nonlinear element and a network interface. We then survey excitable lasers in the recent literature as candidates for the nonlinear node and microring-resonator weight banks as the network interface. Finally, we compare metrics between neuromorphic electronics and neuromorphic photonics and discuss potential applications.

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.

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.

Research on virtual network load balancing based on OpenFlow

NASA Astrophysics Data System (ADS)

Peng, Rong; Ding, Lei

2017-08-01

The Network based on OpenFlow technology separate the control module and data forwarding module. Global deployment of load balancing strategy through network view of control plane is fast and of high efficiency. This paper proposes a Weighted Round-Robin Scheduling algorithm for virtual network and a load balancing plan for server load based on OpenFlow. Load of service nodes and load balancing tasks distribution algorithm will be taken into account.

Adaptive output feedback control of flexible-joint robots using neural networks: dynamic surface design approach.

PubMed

Yoo, Sung Jin; Park, Jin Bae; Choi, Yoon Ho

2008-10-01

In this paper, we propose a new robust output feedback control approach for flexible-joint electrically driven (FJED) robots via the observer dynamic surface design technique. The proposed method only requires position measurements of the FJED robots. To estimate the link and actuator velocity information of the FJED robots with model uncertainties, we develop an adaptive observer using self-recurrent wavelet neural networks (SRWNNs). The SRWNNs are used to approximate model uncertainties in both robot (link) dynamics and actuator dynamics, and all their weights are trained online. Based on the designed observer, the link position tracking controller using the estimated states is induced from the dynamic surface design procedure. Therefore, the proposed controller can be designed more simply than the observer backstepping controller. From the Lyapunov stability analysis, it is shown that all signals in a closed-loop adaptive system are uniformly ultimately bounded. Finally, the simulation results on a three-link FJED robot are presented to validate the good position tracking performance and robustness of the proposed control system against payload uncertainties and external disturbances.

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.

Attention networks in adolescent anorexia nervosa.

PubMed

Weinbach, Noam; Sher, Helene; Lock, James D; Henik, Avishai

2018-03-01

Anorexia nervosa (AN) usually develops during adolescence when considerable structural and functional brain changes are taking place. Neurocognitive inefficiencies have been consistently found in adults with enduring AN and were suggested to play a role in maintaining the disorder. However, such findings are inconsistent in children and adolescents with AN. The current study conducted a comprehensive assessment of attention networks in adolescents with AN who were not severely underweight during the study using an approach that permits disentangling independent components of attention. Twenty partially weight-restored adolescents with AN (AN-WR) and 24 healthy adolescents performed the Attention Network Test which assesses the efficiency of three main attention networks-executive control, orienting, and alerting. The results revealed abnormal function in the executive control network among adolescents with AN-WR. Specifically, adolescents with AN-WR demonstrated superior ability to suppress attention to task-irrelevant information while focusing on a central task. Moreover, the alerting network modulated this ability. No difference was found between the groups in the speed of orienting attention, but reorienting attention to a target resulted in higher error rates in the AN-WR group. The findings suggest that adolescents with AN have attentional abnormalities that cannot be explained by a state of starvation. These attentional dysregulations may underlie clinical phenotypes of the disorder such as increased attention of details.

Identification of influential spreaders in online social networks using interaction weighted K-core decomposition method

NASA Astrophysics Data System (ADS)

Al-garadi, Mohammed Ali; Varathan, Kasturi Dewi; Ravana, Sri Devi

2017-02-01

Online social networks (OSNs) have become a vital part of everyday living. OSNs provide researchers and scientists with unique prospects to comprehend individuals on a scale and to analyze human behavioral patterns. Influential spreaders identification is an important subject in understanding the dynamics of information diffusion in OSNs. Targeting these influential spreaders is significant in planning the techniques for accelerating the propagation of information that is useful for various applications, such as viral marketing applications or blocking the diffusion of annoying information (spreading of viruses, rumors, online negative behaviors, and cyberbullying). Existing K-core decomposition methods consider links equally when calculating the influential spreaders for unweighted networks. Alternatively, the proposed link weights are based only on the degree of nodes. Thus, if a node is linked to high-degree nodes, then this node will receive high weight and is treated as an important node. Conversely, the degree of nodes in OSN context does not always provide accurate influence of users. In the present study, we improve the K-core method for OSNs by proposing a novel link-weighting method based on the interaction among users. The proposed method is based on the observation that the interaction of users is a significant factor in quantifying the spreading capability of user in OSNs. The tracking of diffusion links in the real spreading dynamics of information verifies the effectiveness of our proposed method for identifying influential spreaders in OSNs as compared with degree centrality, PageRank, and original K-core.

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.

Rumor spreading in online social networks by considering the bipolar social reinforcement

NASA Astrophysics Data System (ADS)

Ma, Jing; Li, Dandan; Tian, Zihao

2016-04-01

Considering the bipolar social reinforcement which includes positive and negative effects, in this paper we explore the rumor spreading dynamics in online social networks. By means of the generation function and cavity method developed from statistical physics of disordered system, the rumor spreading threshold can be theoretically drawn. Simulation results indicate that decreasing the positive reinforcement factor or increasing the negative reinforcement factor can suppress the rumor spreading effectively. By analyzing the topological properties of the real world social network, we find that the nodes with lower degree usually have smaller weight. However, the nodes with lower degree may have larger k-shell. In order to curb rumor spreading, some control strategies that are based on the nodes' degree, k-shell and weight are presented. By comparison, we show that controlling those nodes that have larger degree or weight are two effective strategies to prevent the rumor spreading.

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

PubMed

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

2017-07-12

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. 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 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. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2017. All rights reserved. No commercial use is permitted unless otherwise expressly granted.

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

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.

Wild life passer species recognition from a technical passage through data fusion of a wireless sensor network

NASA Astrophysics Data System (ADS)

Gazis, A.; Katsiri, E.

2017-09-01

This paper presents a Wireless Sensor Network (WSN) system which was created as a project about protecting wildlife using sensor networks following the assistance of the department of Electrical and Computer Engineering of the Democritus University of Thrace. An automated process was implemented, regarding the recognition of a passenger (ie human, wolf, bear, etc.) traversing a box-shaped underground passage, such as the ones located along main highways fusing Width, Height and Weight values. These were measured using low-cost distance (beam) and weight (S-type load) micro-sensors and stored in a central repository. Moreover, the information provided by the WSN was analyzed, via a variety of methods including a neural pattern recognition network as well as clustering algorithms, which were able to recognize the kind of passenger, with certainty scores over 90%. The main concern, regarding the future, is the evaluation of these passages in respect to their effectiveness, i.e. whether they are frequently utilized by animals. This information was further analysed by appropriate information systems, in order to provide insights about the effectiveness of such mitigation structures.

Estimating topological properties of weighted networks from limited information.

PubMed

Cimini, Giulio; Squartini, Tiziano; Gabrielli, Andrea; Garlaschelli, Diego

2015-10-01

A problem typically encountered when studying complex systems is the limitedness of the information available on their topology, which hinders our understanding of their structure and of the dynamical processes taking place on them. A paramount example is provided by financial networks, whose data are privacy protected: Banks publicly disclose only their aggregate exposure towards other banks, keeping individual exposures towards each single bank secret. Yet, the estimation of systemic risk strongly depends on the detailed structure of the interbank network. The resulting challenge is that of using aggregate information to statistically reconstruct a network and correctly predict its higher-order properties. Standard approaches either generate unrealistically dense networks, or fail to reproduce the observed topology by assigning homogeneous link weights. Here, we develop a reconstruction method, based on statistical mechanics concepts, that makes use of the empirical link density in a highly nontrivial way. Technically, our approach consists in the preliminary estimation of node degrees from empirical node strengths and link density, followed by a maximum-entropy inference based on a combination of empirical strengths and estimated degrees. Our method is successfully tested on the international trade network and the interbank money market, and represents a valuable tool for gaining insights on privacy-protected or partially accessible systems.

Estimating topological properties of weighted networks from limited information

NASA Astrophysics Data System (ADS)

Cimini, Giulio; Squartini, Tiziano; Gabrielli, Andrea; Garlaschelli, Diego

2015-10-01

A problem typically encountered when studying complex systems is the limitedness of the information available on their topology, which hinders our understanding of their structure and of the dynamical processes taking place on them. A paramount example is provided by financial networks, whose data are privacy protected: Banks publicly disclose only their aggregate exposure towards other banks, keeping individual exposures towards each single bank secret. Yet, the estimation of systemic risk strongly depends on the detailed structure of the interbank network. The resulting challenge is that of using aggregate information to statistically reconstruct a network and correctly predict its higher-order properties. Standard approaches either generate unrealistically dense networks, or fail to reproduce the observed topology by assigning homogeneous link weights. Here, we develop a reconstruction method, based on statistical mechanics concepts, that makes use of the empirical link density in a highly nontrivial way. Technically, our approach consists in the preliminary estimation of node degrees from empirical node strengths and link density, followed by a maximum-entropy inference based on a combination of empirical strengths and estimated degrees. Our method is successfully tested on the international trade network and the interbank money market, and represents a valuable tool for gaining insights on privacy-protected or partially accessible systems.

Distributed Sensor Fusion for Scalar Field Mapping Using Mobile Sensor Networks.

PubMed

La, Hung Manh; Sheng, Weihua

2013-04-01

In this paper, autonomous mobile sensor networks are deployed to measure a scalar field and build its map. We develop a novel method for multiple mobile sensor nodes to build this map using noisy sensor measurements. Our method consists of two parts. First, we develop a distributed sensor fusion algorithm by integrating two different distributed consensus filters to achieve cooperative sensing among sensor nodes. This fusion algorithm has two phases. In the first phase, the weighted average consensus filter is developed, which allows each sensor node to find an estimate of the value of the scalar field at each time step. In the second phase, the average consensus filter is used to allow each sensor node to find a confidence of the estimate at each time step. The final estimate of the value of the scalar field is iteratively updated during the movement of the mobile sensors via weighted average. Second, we develop the distributed flocking-control algorithm to drive the mobile sensors to form a network and track the virtual leader moving along the field when only a small subset of the mobile sensors know the information of the leader. Experimental results are provided to demonstrate our proposed algorithms.

Epistemic brokerage in the bio-property narrative: contributions to explaining opposition to transgenic technologies in agriculture.

PubMed

Herring, Ronald J

2010-11-30

Unlike some global contentions - abolition of slavery, or universal franchise, for example - the rift over rDNA crops is not about ultimate values. Improvement of farmer welfare and enhanced sustainability of agriculture are universally valued goals. However, means to those ends are politically disputed; that dispute depends on alternative empirical stories about biotechnology, sometimes even alternative epistemologies. Opposition revolves around two fundamental dimensions: bio-safety and bio-property. There is convergence of these dimensions around exceptional risk and vulnerability to corporate control of farmers, but these are analytically separable questions of fact. This paper concentrates on bio-property. Epistemic brokers have successfully established knowledge claims that simultaneously undermine the case for rDNA technologies as potential contributors to development and motivate opposition. Epistemic brokers command authority from their positions at junctures of networks, enabling the screening, weighting, theorizing and diffusion of contentious empirical accounts. In contentions of low information, high information costs and diffuse anxiety, these claims provide cognitive support for opposition to 'GMOs'. Specifically, claims of patents, monopoly corporate control and terminator technology have diffused to and from India in global networks. Though effective in transnational advocacy networks, these claims have proved either false or inconsistent with dynamics on the ground. Copyright © 2010 Elsevier B.V. All rights reserved.

Rapid self-organised initiation of ad hoc sensor networks close above the percolation threshold

NASA Astrophysics Data System (ADS)

Korsnes, Reinert

2010-07-01

This work shows potentials for rapid self-organisation of sensor networks where nodes collaborate to relay messages to a common data collecting unit (sink node). The study problem is, in the sense of graph theory, to find a shortest path tree spanning a weighted graph. This is a well-studied problem where for example Dijkstra’s algorithm provides a solution for non-negative edge weights. The present contribution shows by simulation examples that simple modifications of known distributed approaches here can provide significant improvements in performance. Phase transition phenomena, which are known to take place in networks close to percolation thresholds, may explain these observations. An initial method, which here serves as reference, assumes the sink node starts organisation of the network (tree) by transmitting a control message advertising its availability for its neighbours. These neighbours then advertise their current cost estimate for routing a message to the sink. A node which in this way receives a message implying an improved route to the sink, advertises its new finding and remembers which neighbouring node the message came from. This activity proceeds until there are no more improvements to advertise to neighbours. The result is a tree network for cost effective transmission of messages to the sink (root). This distributed approach has potential for simple improvements which are of interest when minimisation of storage and communication of network information are a concern. Fast organisation of the network takes place when the number k of connections for each node ( degree) is close above its critical value for global network percolation and at the same time there is a threshold for the nodes to decide to advertise network route updates.

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.

A high performance long-reach passive optical network with a novel excess bandwidth distribution scheme

NASA Astrophysics Data System (ADS)

Chao, I.-Fen; Zhang, Tsung-Min

2015-06-01

Long-reach passive optical networks (LR-PONs) have been considered to be promising solutions for future access networks. In this paper, we propose a distributed medium access control (MAC) scheme over an advantageous LR-PON network architecture that reroutes the control information from and back to all ONUs through an (N + 1) × (N + 1) star coupler (SC) deployed near the ONUs, thereby overwhelming the extremely long propagation delay problem in LR-PONs. In the network, the control slot is designed to contain all bandwidth requirements of all ONUs and is in-band time-division-multiplexed with a number of data slots within a cycle. In the proposed MAC scheme, a novel profit-weight-based dynamic bandwidth allocation (P-DBA) scheme is presented. The algorithm is designed to efficiently and fairly distribute the amount of excess bandwidth based on a profit value derived from the excess bandwidth usage of each ONU, which resolves the problems of previously reported DBA schemes that are either unfair or inefficient. The simulation results show that the proposed decentralized algorithms exhibit a nearly three-order-of-magnitude improvement in delay performance compared to the centralized algorithms over LR-PONs. Moreover, the newly proposed P-DBA scheme guarantees low delay performance and fairness even when under attack by the malevolent ONU irrespective of traffic loads and burstiness.

Quantized Synchronization of Chaotic Neural Networks With Scheduled Output Feedback Control.

PubMed

Wan, Ying; Cao, Jinde; Wen, Guanghui

In this paper, the synchronization problem of master-slave chaotic neural networks with remote sensors, quantization process, and communication time delays is investigated. The information communication channel between the master chaotic neural network and slave chaotic neural network consists of several remote sensors, with each sensor able to access only partial knowledge of output information of the master neural network. At each sampling instants, each sensor updates its own measurement and only one sensor is scheduled to transmit its latest information to the controller's side in order to update the control inputs for the slave neural network. Thus, such communication process and control strategy are much more energy-saving comparing with the traditional point-to-point scheme. Sufficient conditions for output feedback control gain matrix, allowable length of sampling intervals, and upper bound of network-induced delays are derived to ensure the quantized synchronization of master-slave chaotic neural networks. Lastly, Chua's circuit system and 4-D Hopfield neural network are simulated to validate the effectiveness of the main results.In this paper, the synchronization problem of master-slave chaotic neural networks with remote sensors, quantization process, and communication time delays is investigated. The information communication channel between the master chaotic neural network and slave chaotic neural network consists of several remote sensors, with each sensor able to access only partial knowledge of output information of the master neural network. At each sampling instants, each sensor updates its own measurement and only one sensor is scheduled to transmit its latest information to the controller's side in order to update the control inputs for the slave neural network. Thus, such communication process and control strategy are much more energy-saving comparing with the traditional point-to-point scheme. Sufficient conditions for output feedback control gain matrix, allowable length of sampling intervals, and upper bound of network-induced delays are derived to ensure the quantized synchronization of master-slave chaotic neural networks. Lastly, Chua's circuit system and 4-D Hopfield neural network are simulated to validate the effectiveness of the main results.

Extracting spatial information from networks with low-order eigenvectors

NASA Astrophysics Data System (ADS)

Cucuringu, Mihai; Blondel, Vincent D.; Van Dooren, Paul

2013-03-01

We consider the problem of inferring meaningful spatial information in networks from incomplete information on the connection intensity between the nodes of the network. We consider two spatially distributed networks: a population migration flow network within the US, and a network of mobile phone calls between cities in Belgium. For both networks we use the eigenvectors of the Laplacian matrix constructed from the link intensities to obtain informative visualizations and capture natural geographical subdivisions. We observe that some low-order eigenvectors localize very well and seem to reveal small geographically cohesive regions that match remarkably well with political and administrative boundaries. We discuss possible explanations for this observation by describing diffusion maps and localized eigenfunctions. In addition, we discuss a possible connection with the weighted graph cut problem, and provide numerical evidence supporting the idea that lower-order eigenvectors point out local cuts in the network. However, we do not provide a formal and rigorous justification for our observations.

Complex network construction based on user group attention sequence

NASA Astrophysics Data System (ADS)

Zhang, Gaowei; Xu, Lingyu; Wang, Lei

2018-04-01

In the traditional complex network construction, it is often to use the similarity between nodes, build the weight of the network, and finally build the network. However, this approach tends to focus only on the coupling between nodes, while ignoring the information transfer between nodes and the transfer of directionality. In the network public opinion space, based on the set of stock series that the network groups pay attention to within a certain period of time, we vectorize the different stocks and build a complex network.

Use of computer systems and process information for blast furnace operations at U. S. Steel, Gary Works

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

Sherman, G.J.; Zmierski, M.L.

1994-09-01

US Steel Iron Producing Div. consists of four operating blast furnaces ranging in process control capabilities from 1950's and 1960's era hardware to state of the art technology. The oldest control system consists of a large number of panels containing numerous relays, indicating lights, selector switches, push buttons, analog controllers, strip chart recorders and annunciators. In contrast, the state of the art control system utilizes remote I/O, two sets of redundant PLC's, redundant charge director computer, redundant distributed control system, high resolution video-graphic display system and supervisory computer for real-time data acquisition. Process data are collected and archived on twomore » DEC VAX computers, one for No. 13 blast furnace and the other for the three south end furnaces. Historical trending, data analysis and reporting are available to iron producing personnel through terminals and PC's connected directly to the systems, dial-up modems and various network configurations. These two machines are part of the iron producing network which allows them to pass and receive information from each other as well as numerous other sources throughout the division. This configuration allows personnel to access most pertinent furnace information from a single source. The basic objective of the control systems is to charge raw materials to the top of the furnace at aim weights and sequence, while maintaining blast conditions at the bottom of the furnace at required temperature, pressure and composition. Control changes by the operators are primarily supervisory based on review of system generated plots and tables.« less

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.

Reverse preferential spread in complex networks

NASA Astrophysics Data System (ADS)

Toyoizumi, Hiroshi; Tani, Seiichi; Miyoshi, Naoto; Okamoto, Yoshio

2012-08-01

Large-degree nodes may have a larger influence on the network, but they can be bottlenecks for spreading information since spreading attempts tend to concentrate on these nodes and become redundant. We discuss that the reverse preferential spread (distributing information inversely proportional to the degree of the receiving node) has an advantage over other spread mechanisms. In large uncorrelated networks, we show that the mean number of nodes that receive information under the reverse preferential spread is an upper bound among any other weight-based spread mechanisms, and this upper bound is indeed a logistic growth independent of the degree distribution.

Health literacy and parent attitudes about weight control for children.

PubMed

Liechty, Janet M; Saltzman, Jaclyn A; Musaad, Salma M

2015-08-01

The purpose of this study was to examine associations between parental health literacy and parent attitudes about weight control strategies for young children. Parental low health literacy has been associated with poor child health outcomes, yet little is known about its relationship to child weight control and weight-related health information-seeking preferences. Data were drawn from the STRONG Kids Study, a Midwest panel survey among parents of preschool aged children (n = 497). Parents endorsed an average of 4.3 (SD =2.8) weight loss strategies, 53% endorsed all three recommended weight loss strategies for children, and fewer than 1% of parents endorsed any unsafe strategies. Parents were most likely to seek child weight loss information from healthcare professionals but those with low (vs. adequate) health literacy were significantly less likely to use the Internet or books and more likely to use minister/clergy as sources. Poisson and logistic regressions showed that higher health literacy was associated with endorsement of more strategies overall, more recommended strategies, and greater odds of endorsing each specific recommended strategy for child weight control, after adjusting for parent age, education, race/ethnicity, income, marital status, weight concern, and child BMI percentile. Findings suggest that health literacy impacts parental views about child weight loss strategies and health information-seeking preferences. Pediatric weight loss advice to parents should include assessment of parent attitudes and prior knowledge about child weight control and facilitate parent access to reliable sources of evidence-informed child weight control information. Copyright © 2015 Elsevier Ltd. All rights reserved.

Distinct regions of prefrontal cortex are associated with the controlled retrieval and selection of social information.

PubMed

Satpute, Ajay B; Badre, David; Ochsner, Kevin N

2014-05-01

Research in social neuroscience has uncovered a social knowledge network that is particularly attuned to making social judgments. However, the processes that are being performed by both regions within this network and those outside of this network that are nevertheless engaged in the service of making a social judgment remain unclear. To help address this, we drew upon research in semantic memory, which suggests that making a semantic judgment engages 2 distinct control processes: A controlled retrieval process, which aids in bringing goal-relevant information to mind from long-term stores, and a selection process, which aids in selecting the information that is goal-relevant from the information retrieved. In a neuroimaging study, we investigated whether controlled retrieval and selection for social information engage distinct portions of both the social knowledge network and regions outside this network. Controlled retrieval for social information engaged an anterior ventrolateral portion of the prefrontal cortex, whereas selection engaged both the dorsomedial prefrontal cortex and temporoparietal junction within the social knowledge network. These results suggest that the social knowledge network may be more involved with the selection of social information than the controlled retrieval of it and incorporates lateral prefrontal regions in accessing memory for making social judgments.

Pattern classification by memristive crossbar circuits using ex situ and in situ training.

PubMed

Alibart, Fabien; Zamanidoost, Elham; Strukov, Dmitri B

2013-01-01

Memristors are memory resistors that promise the efficient implementation of synaptic weights in artificial neural networks. Whereas demonstrations of the synaptic operation of memristors already exist, the implementation of even simple networks is more challenging and has yet to be reported. Here we demonstrate pattern classification using a single-layer perceptron network implemented with a memrisitive crossbar circuit and trained using the perceptron learning rule by ex situ and in situ methods. In the first case, synaptic weights, which are realized as conductances of titanium dioxide memristors, are calculated on a precursor software-based network and then imported sequentially into the crossbar circuit. In the second case, training is implemented in situ, so the weights are adjusted in parallel. Both methods work satisfactorily despite significant variations in the switching behaviour of the memristors. These results give hope for the anticipated efficient implementation of artificial neuromorphic networks and pave the way for dense, high-performance information processing systems.

Pattern classification by memristive crossbar circuits using ex situ and in situ training

NASA Astrophysics Data System (ADS)

Alibart, Fabien; Zamanidoost, Elham; Strukov, Dmitri B.

2013-06-01

Memristors are memory resistors that promise the efficient implementation of synaptic weights in artificial neural networks. Whereas demonstrations of the synaptic operation of memristors already exist, the implementation of even simple networks is more challenging and has yet to be reported. Here we demonstrate pattern classification using a single-layer perceptron network implemented with a memrisitive crossbar circuit and trained using the perceptron learning rule by ex situ and in situ methods. In the first case, synaptic weights, which are realized as conductances of titanium dioxide memristors, are calculated on a precursor software-based network and then imported sequentially into the crossbar circuit. In the second case, training is implemented in situ, so the weights are adjusted in parallel. Both methods work satisfactorily despite significant variations in the switching behaviour of the memristors. These results give hope for the anticipated efficient implementation of artificial neuromorphic networks and pave the way for dense, high-performance information processing systems.

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.

Hardware implementation of CMAC neural network with reduced storage requirement.

PubMed

Ker, J S; Kuo, Y H; Wen, R C; Liu, B D

1997-01-01

The cerebellar model articulation controller (CMAC) neural network has the advantages of fast convergence speed and low computation complexity. However, it suffers from a low storage space utilization rate on weight memory. In this paper, we propose a direct weight address mapping approach, which can reduce the required weight memory size with a utilization rate near 100%. Based on such an address mapping approach, we developed a pipeline architecture to efficiently perform the addressing operations. The proposed direct weight address mapping approach also speeds up the computation for the generation of weight addresses. Besides, a CMAC hardware prototype used for color calibration has been implemented to confirm the proposed approach and architecture.

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.

Introductory guide to CVISN

DOT National Transportation Integrated Search

1999-05-01

This guide is designed to provide state administrators of motor carrier programs with information on safety, credentials, fuel tax and size and weight regulation as part of the Commercial Vehicle Information Systems and Networks (CVISN) Program. It d...

Hebbian Wiring Plasticity Generates Efficient Network Structures for Robust Inference with Synaptic Weight Plasticity

PubMed Central

Hiratani, Naoki; Fukai, Tomoki

2016-01-01

In the adult mammalian cortex, a small fraction of spines are created and eliminated every day, and the resultant synaptic connection structure is highly nonrandom, even in local circuits. However, it remains unknown whether a particular synaptic connection structure is functionally advantageous in local circuits, and why creation and elimination of synaptic connections is necessary in addition to rich synaptic weight plasticity. To answer these questions, we studied an inference task model through theoretical and numerical analyses. We demonstrate that a robustly beneficial network structure naturally emerges by combining Hebbian-type synaptic weight plasticity and wiring plasticity. Especially in a sparsely connected network, wiring plasticity achieves reliable computation by enabling efficient information transmission. Furthermore, the proposed rule reproduces experimental observed correlation between spine dynamics and task performance. PMID:27303271

Adaptive optimal control of unknown constrained-input systems using policy iteration and neural networks.

PubMed

Modares, Hamidreza; Lewis, Frank L; Naghibi-Sistani, Mohammad-Bagher

2013-10-01

This paper presents an online policy iteration (PI) algorithm to learn the continuous-time optimal control solution for unknown constrained-input systems. The proposed PI algorithm is implemented on an actor-critic structure where two neural networks (NNs) are tuned online and simultaneously to generate the optimal bounded control policy. The requirement of complete knowledge of the system dynamics is obviated by employing a novel NN identifier in conjunction with the actor and critic NNs. It is shown how the identifier weights estimation error affects the convergence of the critic NN. A novel learning rule is developed to guarantee that the identifier weights converge to small neighborhoods of their ideal values exponentially fast. To provide an easy-to-check persistence of excitation condition, the experience replay technique is used. That is, recorded past experiences are used simultaneously with current data for the adaptation of the identifier weights. Stability of the whole system consisting of the actor, critic, system state, and system identifier is guaranteed while all three networks undergo adaptation. Convergence to a near-optimal control law is also shown. The effectiveness of the proposed method is illustrated with a simulation example.

Training trajectories by continuous recurrent multilayer networks.

PubMed

Leistritz, L; Galicki, M; Witte, H; Kochs, E

2002-01-01

This paper addresses the problem of training trajectories by means of continuous recurrent neural networks whose feedforward parts are multilayer perceptrons. Such networks can approximate a general nonlinear dynamic system with arbitrary accuracy. The learning process is transformed into an optimal control framework where the weights are the controls to be determined. A training algorithm based upon a variational formulation of Pontryagin's maximum principle is proposed for such networks. Computer examples demonstrating the efficiency of the given approach are also presented.

Information spreading on mobile communication networks: A new model that incorporates human behaviors

NASA Astrophysics Data System (ADS)

Ren, Fei; Li, Sai-Ping; Liu, Chuang

2017-03-01

Recently, there is a growing interest in the modeling and simulation based on real social networks among researchers in multi-disciplines. Using an empirical social network constructed from the calling records of a Chinese mobile service provider, we here propose a new model to simulate the information spreading process. This model takes into account two important ingredients that exist in real human behaviors: information prevalence and preferential spreading. The fraction of informed nodes when the system reaches an asymptotically stable state is primarily determined by information prevalence, and the heterogeneity of link weights would slow down the information diffusion. Moreover, the sizes of blind clusters which consist of connected uninformed nodes show a power-law distribution, and these uninformed nodes correspond to a particular portion of nodes which are located at special positions in the network, namely at the edges of large clusters or inside the clusters connected through weak links. Since the simulations are performed on a real world network, the results should be useful in the understanding of the influences of social network structures and human behaviors on information propagation.

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.

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.

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.

Information processing versus social cognitive mediators of weight loss in a podcast-delivered health intervention.

PubMed

Ko, Linda K; Turner-McGrievy, Gabrielle M; Campbell, Marci K

2014-04-01

Podcasting is an emerging technology, and previous interventions have shown promising results using theory-based podcast for weight loss among overweight and obese individuals. This study investigated whether constructs of social cognitive theory and information processing theories (IPTs) mediate the effect of a podcast intervention on weight loss among overweight individuals. Data are from Pounds off Digitally, a study testing the efficacy of two weight loss podcast interventions (control podcast and theory-based podcast). Path models were constructed (n = 66). The IPTs, elaboration likelihood model, information control theory, and cognitive load theory mediated the effect of a theory-based podcast on weight loss. The intervention was significantly associated with all IPTs. Information control theory and cognitive load theory were related to elaboration, and elaboration was associated with weight loss. Social cognitive theory constructs did not mediate weight loss. Future podcast interventions grounded in theory may be effective in promoting weight loss.

A security architecture for health information networks.

PubMed

Kailar, Rajashekar; Muralidhar, Vinod

2007-10-11

Health information network security needs to balance exacting security controls with practicality, and ease of implementation in today's healthcare enterprise. Recent work on 'nationwide health information network' architectures has sought to share highly confidential data over insecure networks such as the Internet. Using basic patterns of health network data flow and trust models to support secure communication between network nodes, we abstract network security requirements to a core set to enable secure inter-network data sharing. We propose a minimum set of security controls that can be implemented without needing major new technologies, but yet realize network security and privacy goals of confidentiality, integrity and availability. This framework combines a set of technology mechanisms with environmental controls, and is shown to be sufficient to counter commonly encountered network security threats adequately.

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.

Fuzzy-rule-based Adaptive Resource Control for Information Sharing in P2P Networks

NASA Astrophysics Data System (ADS)

Wu, Zhengping; Wu, Hao

With more and more peer-to-peer (P2P) technologies available for online collaboration and information sharing, people can launch more and more collaborative work in online social networks with friends, colleagues, and even strangers. Without face-to-face interactions, the question of who can be trusted and then share information with becomes a big concern of a user in these online social networks. This paper introduces an adaptive control service using fuzzy logic in preference definition for P2P information sharing control, and designs a novel decision-making mechanism using formal fuzzy rules and reasoning mechanisms adjusting P2P information sharing status following individual users' preferences. Applications of this adaptive control service into different information sharing environments show that this service can provide a convenient and accurate P2P information sharing control for individual users in P2P networks.

Single-hidden-layer feed-forward quantum neural network based on Grover learning.

PubMed

Liu, Cheng-Yi; Chen, Chein; Chang, Ching-Ter; Shih, Lun-Min

2013-09-01

In this paper, a novel single-hidden-layer feed-forward quantum neural network model is proposed based on some concepts and principles in the quantum theory. By combining the quantum mechanism with the feed-forward neural network, we defined quantum hidden neurons and connected quantum weights, and used them as the fundamental information processing unit in a single-hidden-layer feed-forward neural network. The quantum neurons make a wide range of nonlinear functions serve as the activation functions in the hidden layer of the network, and the Grover searching algorithm outstands the optimal parameter setting iteratively and thus makes very efficient neural network learning possible. The quantum neuron and weights, along with a Grover searching algorithm based learning, result in a novel and efficient neural network characteristic of reduced network, high efficient training and prospect application in future. Some simulations are taken to investigate the performance of the proposed quantum network and the result show that it can achieve accurate learning. Copyright © 2013 Elsevier Ltd. All rights reserved.

Social network size can influence linguistic malleability and the propagation of linguistic change.

PubMed

Lev-Ari, Shiri

2018-07-01

We learn language from our social environment, but the more sources we have, the less informative each source is, and therefore, the less weight we ascribe its input. According to this principle, people with larger social networks should give less weight to new incoming information, and should therefore be less susceptible to the influence of new speakers. This paper tests this prediction, and shows that speakers with smaller social networks indeed have more malleable linguistic representations. In particular, they are more likely to adjust their lexical boundary following exposure to a new speaker. Experiment 2 uses computational simulations to test whether this greater malleability could lead people with smaller social networks to be important for the propagation of linguistic change despite the fact that they interact with fewer people. The results indicate that when innovators were connected with people with smaller rather than larger social networks, the population exhibited greater and faster diffusion. Together these experiments show that the properties of people's social networks can influence individuals' learning and use as well as linguistic phenomena at the community level. Copyright © 2018 Elsevier B.V. All rights reserved.

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.

Infants' prospective control during object manipulation in an uncertain environment.

PubMed

Gottwald, Janna M; Gredebäck, Gustaf

2015-08-01

This study investigates how infants use visual and sensorimotor information to prospectively control their actions. We gave 14-month-olds two objects of different weight and observed how high they were lifted, using a Qualisys Motion Capture System. In one condition, the two objects were visually distinct (different color condition) in another they were visually identical (same color condition). Lifting amplitudes of the first movement unit were analyzed in order to assess prospective control. Results demonstrate that infants lifted a light object higher than a heavy object, especially when vision could be used to assess weight (different color condition). When being confronted with two visually identical objects of different weight (same color condition), infants showed a different lifting pattern than what could be observed in the different color condition, expressed by a significant interaction effect between object weight and color condition on lifting amplitude. These results indicate that (a) visual information about object weight can be used to prospectively control lifting actions and that (b) infants are able to prospectively control their lifting actions even without visual information about object weight. We argue that infants, in the absence of reliable visual information about object weight, heighten their dependence on non-visual information (tactile, sensorimotor memory) in order to estimate weight and pre-adjust their lifting actions in a prospective manner.

Neural Network Control of a Magnetically Suspended Rotor System

NASA Technical Reports Server (NTRS)

Choi, Benjamin; Brown, Gerald; Johnson, Dexter

1997-01-01

Abstract Magnetic bearings offer significant advantages because of their noncontact operation, which can reduce maintenance. Higher speeds, no friction, no lubrication, weight reduction, precise position control, and active damping make them far superior to conventional contact bearings. However, there are technical barriers that limit the application of this technology in industry. One of them is the need for a nonlinear controller that can overcome the system nonlinearity and uncertainty inherent in magnetic bearings. This paper discusses the use of a neural network as a nonlinear controller that circumvents system nonlinearity. A neural network controller was well trained and successfully demonstrated on a small magnetic bearing rig. This work demonstrated the feasibility of using a neural network to control nonlinear magnetic bearings and systems with unknown dynamics.

Social inertia and diversity in collaboration networks

NASA Astrophysics Data System (ADS)

Ramasco, J. J.

2007-04-01

Random graphs are useful tools to study social interactions. In particular, the use of weighted random graphs allows to handle a high level of information concerning which agents interact and in which degree the interactions take place. Taking advantage of this representation, we recently defined a magnitude, the Social Inertia, that measures the eagerness of agents to keep ties with previous partners. To study this magnitude, we used collaboration networks that are specially appropriate to obtain valid statitical results due to the large size of publically available databases. In this work, I study the Social Inertia in two of these empirical networks, IMDB movie database and condmat. More specifically, I focus on how the Inertia relates to other properties of the graphs, and show that the Inertia provides information on how the weight of neighboring edges correlates. A social interpretation of this effect is also offered.

Reconfigurable Control Design with Neural Network Augmentation for a Modified F-15 Aircraft

NASA Technical Reports Server (NTRS)

Burken, John J.

2007-01-01

The viewgraphs present background information about reconfiguration control design, design methods used for paper, control failure survivability results, and results and time histories of tests. Topics examined include control reconfiguration, general information about adaptive controllers, model reference adaptive control (MRAC), the utility of neural networks, radial basis functions (RBF) neural network outputs, neurons, and results of investigations of failures.

A Security Architecture for Health Information Networks

PubMed Central

Kailar, Rajashekar

2007-01-01

Health information network security needs to balance exacting security controls with practicality, and ease of implementation in today’s healthcare enterprise. Recent work on ‘nationwide health information network’ architectures has sought to share highly confidential data over insecure networks such as the Internet. Using basic patterns of health network data flow and trust models to support secure communication between network nodes, we abstract network security requirements to a core set to enable secure inter-network data sharing. We propose a minimum set of security controls that can be implemented without needing major new technologies, but yet realize network security and privacy goals of confidentiality, integrity and availability. This framework combines a set of technology mechanisms with environmental controls, and is shown to be sufficient to counter commonly encountered network security threats adequately. PMID:18693862

Information Extraction of High Resolution Remote Sensing Images Based on the Calculation of Optimal Segmentation Parameters

PubMed Central

Zhu, Hongchun; Cai, Lijie; Liu, Haiying; Huang, Wei

2016-01-01

Multi-scale image segmentation and the selection of optimal segmentation parameters are the key processes in the object-oriented information extraction of high-resolution remote sensing images. The accuracy of remote sensing special subject information depends on this extraction. On the basis of WorldView-2 high-resolution data, the optimal segmentation parameters methodof object-oriented image segmentation and high-resolution image information extraction, the following processes were conducted in this study. Firstly, the best combination of the bands and weights was determined for the information extraction of high-resolution remote sensing image. An improved weighted mean-variance method was proposed andused to calculatethe optimal segmentation scale. Thereafter, the best shape factor parameter and compact factor parameters were computed with the use of the control variables and the combination of the heterogeneity and homogeneity indexes. Different types of image segmentation parameters were obtained according to the surface features. The high-resolution remote sensing images were multi-scale segmented with the optimal segmentation parameters. Ahierarchical network structure was established by setting the information extraction rules to achieve object-oriented information extraction. This study presents an effective and practical method that can explain expert input judgment by reproducible quantitative measurements. Furthermore the results of this procedure may be incorporated into a classification scheme. PMID:27362762

Information Extraction of High Resolution Remote Sensing Images Based on the Calculation of Optimal Segmentation Parameters.

PubMed

Zhu, Hongchun; Cai, Lijie; Liu, Haiying; Huang, Wei

2016-01-01

Multi-scale image segmentation and the selection of optimal segmentation parameters are the key processes in the object-oriented information extraction of high-resolution remote sensing images. The accuracy of remote sensing special subject information depends on this extraction. On the basis of WorldView-2 high-resolution data, the optimal segmentation parameters methodof object-oriented image segmentation and high-resolution image information extraction, the following processes were conducted in this study. Firstly, the best combination of the bands and weights was determined for the information extraction of high-resolution remote sensing image. An improved weighted mean-variance method was proposed andused to calculatethe optimal segmentation scale. Thereafter, the best shape factor parameter and compact factor parameters were computed with the use of the control variables and the combination of the heterogeneity and homogeneity indexes. Different types of image segmentation parameters were obtained according to the surface features. The high-resolution remote sensing images were multi-scale segmented with the optimal segmentation parameters. Ahierarchical network structure was established by setting the information extraction rules to achieve object-oriented information extraction. This study presents an effective and practical method that can explain expert input judgment by reproducible quantitative measurements. Furthermore the results of this procedure may be incorporated into a classification scheme.

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.

Control of Complex Dynamic Systems by Neural Networks

NASA Technical Reports Server (NTRS)

Spall, James C.; Cristion, John A.

1993-01-01

This paper considers the use of neural networks (NN's) in controlling a nonlinear, stochastic system with unknown process equations. The NN is used to model the resulting unknown control law. The approach here is based on using the output error of the system to train the NN controller without the need to construct a separate model (NN or other type) for the unknown process dynamics. To implement such a direct adaptive control approach, it is required that connection weights in the NN be estimated while the system is being controlled. As a result of the feedback of the unknown process dynamics, however, it is not possible to determine the gradient of the loss function for use in standard (back-propagation-type) weight estimation algorithms. Therefore, this paper considers the use of a new stochastic approximation algorithm for this weight estimation, which is based on a 'simultaneous perturbation' gradient approximation that only requires the system output error. It is shown that this algorithm can greatly enhance the efficiency over more standard stochastic approximation algorithms based on finite-difference gradient approximations.

High-performance object tracking and fixation with an online neural estimator.

PubMed

Kumarawadu, Sisil; Watanabe, Keigo; Lee, Tsu-Tian

2007-02-01

Vision-based target tracking and fixation to keep objects that move in three dimensions in view is important for many tasks in several fields including intelligent transportation systems and robotics. Much of the visual control literature has focused on the kinematics of visual control and ignored a number of significant dynamic control issues that limit performance. In line with this, this paper presents a neural network (NN)-based binocular tracking scheme for high-performance target tracking and fixation with minimum sensory information. The procedure allows the designer to take into account the physical (Lagrangian dynamics) properties of the vision system in the control law. The design objective is to synthesize a binocular tracking controller that explicitly takes the systems dynamics into account, yet needs no knowledge of dynamic nonlinearities and joint velocity sensory information. The combined neurocontroller-observer scheme can guarantee the uniform ultimate bounds of the tracking, observer, and NN weight estimation errors under fairly general conditions on the controller-observer gains. The controller is tested and verified via simulation tests in the presence of severe target motion changes.

Neural network for interpretation of multi-meaning Chinese words

NASA Astrophysics Data System (ADS)

He, Qianhua; Xu, Bingzheng

1994-03-01

We proposed a neural network that can interpret multi-meaning Chinese words correctly by using context information. The self-organized network, designed for translating Chinese to English, builds a context according to key words of the processed text and utilizes it to interpret multi-meaning words correctly. The network is generated automatically basing on a Chinese-English dictionary and a knowledge-base of weights, and can adapt to the change of contexts. Simulation experiments have proved that the network worked as expected.

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.

Examining social influence on participation and outcomes among a network of behavioral weight-loss intervention enrollees.

PubMed

Carson, T L; Eddings, K E; Krukowski, R A; Love, S J; Harvey-Berino, J R; West, D S

2013-01-01

Research suggests that social networks, social support, and social influence are associated with weight trajectories among treatment- and non-treatment-seeking individuals. This study examined the impact of having a social contact who participated in the same group behavioral weight-control intervention in the absence of specific social support training on women engaged in a weight-loss program. Participants (n = 92; 100% female; 54% black; mean age: 46 ± 10 years; mean BMI: 38 ± 6) were grouped based upon whether or not they reported a social contact enrolled previously/concurrently in our behavioral weight-control studies. Primary outcomes were 6-month weight change and treatment adherence (session attendance and self-monitoring). Half of the participants (53%) indicated that they had a social contact; black women were more likely to report a social contact than white women (67.3% versus 39.5%; P < 0.01). Among participants with a social contact, 67% reported at least one contact as instrumental in the decision to enroll in the program. Those with a contact lost more weight (5.9 versus 3.7 kg; P = 0.04), attended more group sessions (74% versus 54%; P < 0.01), and submitted more self-monitoring journals (69% versus 54%; P = 0.01) than those without a contact. Participants' weight change was inversely associated with social contacts' weight change (P = 0.04). There was no association between participant and contact's group attendance or self-monitoring. Social networks may be a promising vehicle for recruiting and engaging women in a behavioral weight-loss program, particularly black women. The role of a natural social contact deserves further investigation.

Measuring distance through dense weighted networks: The case of hospital-associated pathogens

PubMed Central

Smieszek, Timo; Henderson, Katherine L.; Johnson, Alan P.

2017-01-01

Hospital networks, formed by patients visiting multiple hospitals, affect the spread of hospital-associated infections, resulting in differences in risks for hospitals depending on their network position. These networks are increasingly used to inform strategies to prevent and control the spread of hospital-associated pathogens. However, many studies only consider patients that are received directly from the initial hospital, without considering the effect of indirect trajectories through the network. We determine the optimal way to measure the distance between hospitals within the network, by reconstructing the English hospital network based on shared patients in 2014–2015, and simulating the spread of a hospital-associated pathogen between hospitals, taking into consideration that each intermediate hospital conveys a delay in the further spread of the pathogen. While the risk of transferring a hospital-associated pathogen between directly neighbouring hospitals is a direct reflection of the number of shared patients, the distance between two hospitals far-away in the network is determined largely by the number of intermediate hospitals in the network. Because the network is dense, most long distance transmission chains in fact involve only few intermediate steps, spreading along the many weak links. The dense connectivity of hospital networks, together with a strong regional structure, causes hospital-associated pathogens to spread from the initial outbreak in a two-step process: first, the directly surrounding hospitals are affected through the strong connections, second all other hospitals receive introductions through the multitude of weaker links. Although the strong connections matter for local spread, weak links in the network can offer ideal routes for hospital-associated pathogens to travel further faster. This hold important implications for infection prevention and control efforts: if a local outbreak is not controlled in time, colonised patients will appear in other regions, irrespective of the distance to the initial outbreak, making import screening ever more difficult. PMID:28771581

Link prediction based on local weighted paths for complex networks

NASA Astrophysics Data System (ADS)

Yao, Yabing; Zhang, Ruisheng; Yang, Fan; Yuan, Yongna; Hu, Rongjing; Zhao, Zhili

As a significant problem in complex networks, link prediction aims to find the missing and future links between two unconnected nodes by estimating the existence likelihood of potential links. It plays an important role in understanding the evolution mechanism of networks and has broad applications in practice. In order to improve prediction performance, a variety of structural similarity-based methods that rely on different topological features have been put forward. As one topological feature, the path information between node pairs is utilized to calculate the node similarity. However, many path-dependent methods neglect the different contributions of paths for a pair of nodes. In this paper, a local weighted path (LWP) index is proposed to differentiate the contributions between paths. The LWP index considers the effect of the link degrees of intermediate links and the connectivity influence of intermediate nodes on paths to quantify the path weight in the prediction procedure. The experimental results on 12 real-world networks show that the LWP index outperforms other seven prediction baselines.

Information Processing Versus Social Cognitive Mediators of Weight Loss in a Podcast-Delivered Health Intervention

PubMed Central

Ko, Linda K.; Turner-McGrievy, Gabrielle; Campbell, Marci K.

2016-01-01

Podcasting is an emerging technology, and previous interventions have shown promising results using theory-based podcast for weight loss among overweight and obese individuals. This study investigated whether constructs of social cognitive theory and information processing theories (IPTs) mediate the effect of a podcast intervention on weight loss among overweight individuals. Data are from Pounds off Digitally, a study testing the efficacy of two weight loss podcast interventions (control podcast and theory-based podcast). Path models were constructed (n = 66). The IPTs—elaboration likelihood model, information control theory, and cognitive load theory—mediated the effect of a theory-based podcast on weight loss. The intervention was significantly associated with all IPTs. Information control theory and cognitive load theory were related to elaboration, and elaboration was associated with weight loss. Social cognitive theory constructs did not mediate weight loss. Future podcast interventions grounded in theory may be effective in promoting weight loss. PMID:24082027

The node-weighted Steiner tree approach to identify elements of cancer-related signaling pathways.

PubMed

Sun, Yahui; Ma, Chenkai; Halgamuge, Saman

2017-12-28

Cancer constitutes a momentous health burden in our society. Critical information on cancer may be hidden in its signaling pathways. However, even though a large amount of money has been spent on cancer research, some critical information on cancer-related signaling pathways still remains elusive. Hence, new works towards a complete understanding of cancer-related signaling pathways will greatly benefit the prevention, diagnosis, and treatment of cancer. We propose the node-weighted Steiner tree approach to identify important elements of cancer-related signaling pathways at the level of proteins. This new approach has advantages over previous approaches since it is fast in processing large protein-protein interaction networks. We apply this new approach to identify important elements of two well-known cancer-related signaling pathways: PI3K/Akt and MAPK. First, we generate a node-weighted protein-protein interaction network using protein and signaling pathway data. Second, we modify and use two preprocessing techniques and a state-of-the-art Steiner tree algorithm to identify a subnetwork in the generated network. Third, we propose two new metrics to select important elements from this subnetwork. On a commonly used personal computer, this new approach takes less than 2 s to identify the important elements of PI3K/Akt and MAPK signaling pathways in a large node-weighted protein-protein interaction network with 16,843 vertices and 1,736,922 edges. We further analyze and demonstrate the significance of these identified elements to cancer signal transduction by exploring previously reported experimental evidences. Our node-weighted Steiner tree approach is shown to be both fast and effective to identify important elements of cancer-related signaling pathways. Furthermore, it may provide new perspectives into the identification of signaling pathways for other human diseases.

Bayesian networks improve causal environmental ...

EPA Pesticide Factsheets

Rule-based weight of evidence approaches to ecological risk assessment may not account for uncertainties and generally lack probabilistic integration of lines of evidence. Bayesian networks allow causal inferences to be made from evidence by including causal knowledge about the problem, using this knowledge with probabilistic calculus to combine multiple lines of evidence, and minimizing biases in predicting or diagnosing causal relationships. Too often, sources of uncertainty in conventional weight of evidence approaches are ignored that can be accounted for with Bayesian networks. Specifying and propagating uncertainties improve the ability of models to incorporate strength of the evidence in the risk management phase of an assessment. Probabilistic inference from a Bayesian network allows evaluation of changes in uncertainty for variables from the evidence. The network structure and probabilistic framework of a Bayesian approach provide advantages over qualitative approaches in weight of evidence for capturing the impacts of multiple sources of quantifiable uncertainty on predictions of ecological risk. Bayesian networks can facilitate the development of evidence-based policy under conditions of uncertainty by incorporating analytical inaccuracies or the implications of imperfect information, structuring and communicating causal issues through qualitative directed graph formulations, and quantitatively comparing the causal power of multiple stressors on value

Multi-agent coordination in directed moving neighbourhood random networks

NASA Astrophysics Data System (ADS)

Shang, Yi-Lun

2010-07-01

This paper considers the consensus problem of dynamical multiple agents that communicate via a directed moving neighbourhood random network. Each agent performs random walk on a weighted directed network. Agents interact with each other through random unidirectional information flow when they coincide in the underlying network at a given instant. For such a framework, we present sufficient conditions for almost sure asymptotic consensus. Numerical examples are taken to show the effectiveness of the obtained results.

Normalization of similarity-based individual brain networks from gray matter MRI and its association with neurodevelopment in infants with intrauterine growth restriction.

PubMed

Batalle, Dafnis; Muñoz-Moreno, Emma; Figueras, Francesc; Bargallo, Nuria; Eixarch, Elisenda; Gratacos, Eduard

2013-12-01

Obtaining individual biomarkers for the prediction of altered neurological outcome is a challenge of modern medicine and neuroscience. Connectomics based on magnetic resonance imaging (MRI) stands as a good candidate to exhaustively extract information from MRI by integrating the information obtained in a few network features that can be used as individual biomarkers of neurological outcome. However, this approach typically requires the use of diffusion and/or functional MRI to extract individual brain networks, which require high acquisition times and present an extreme sensitivity to motion artifacts, critical problems when scanning fetuses and infants. Extraction of individual networks based on morphological similarity from gray matter is a new approach that benefits from the power of graph theory analysis to describe gray matter morphology as a large-scale morphological network from a typical clinical anatomic acquisition such as T1-weighted MRI. In the present paper we propose a methodology to normalize these large-scale morphological networks to a brain network with standardized size based on a parcellation scheme. The proposed methodology was applied to reconstruct individual brain networks of 63 one-year-old infants, 41 infants with intrauterine growth restriction (IUGR) and 22 controls, showing altered network features in the IUGR group, and their association with neurodevelopmental outcome at two years of age by means of ordinal regression analysis of the network features obtained with Bayley Scale for Infant and Toddler Development, third edition. Although it must be more widely assessed, this methodology stands as a good candidate for the development of biomarkers for altered neurodevelopment in the pediatric population. © 2013 Elsevier Inc. All rights reserved.

Anomalous single-subject based morphological cortical networks in drug-naive, first-episode major depressive disorder.

PubMed

Chen, Taolin; Kendrick, Keith M; Wang, Jinhui; Wu, Min; Li, Kaiming; Huang, Xiaoqi; Luo, Yuejia; Lui, Su; Sweeney, John A; Gong, Qiyong

2017-05-01

Major depressive disorder (MDD) has been associated with disruptions in the topological organization of brain morphological networks in group-level data. Such disruptions have not yet been identified in single-patients, which is needed to show relations with symptom severity and to evaluate their potential as biomarkers for illness. To address this issue, we conducted a cross-sectional structural brain network study of 33 treatment-naive, first-episode MDD patients and 33 age-, gender-, and education-matched healthy controls (HCs). Weighted graph-theory based network models were used to characterize the topological organization of brain networks between the two groups. Compared with HCs, MDD patients exhibited lower normalized global efficiency and higher modularity in their whole-brain morphological networks, suggesting impaired integration and increased segregation of morphological brain networks in the patients. Locally, MDD patients exhibited lower efficiency in anatomic organization for transferring information predominantly in default-mode regions including the hippocampus, parahippocampal gyrus, precuneus and superior parietal lobule, and higher efficiency in the insula, calcarine and posterior cingulate cortex, and in the cerebellum. Morphological connectivity comparisons revealed two subnetworks that exhibited higher connectivity strength in MDD mainly involving neocortex-striatum-thalamus-cerebellum and thalamo-hippocampal circuitry. MDD-related alterations correlated with symptom severity and differentiated individuals with MDD from HCs with a sensitivity of 87.9% and specificity of 81.8%. Our findings indicate that single subject grey matter morphological networks are often disrupted in clinically relevant ways in treatment-naive, first episode MDD patients. Circuit-specific changes in brain anatomic network organization suggest alterations in the efficiency of information transfer within particular brain networks in MDD. Hum Brain Mapp 38:2482-2494, 2017. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Epidemic spreading on adaptively weighted scale-free networks.

PubMed

Sun, Mengfeng; Zhang, Haifeng; Kang, Huiyan; Zhu, Guanghu; Fu, Xinchu

2017-04-01

We introduce three modified SIS models on scale-free networks that take into account variable population size, nonlinear infectivity, adaptive weights, behavior inertia and time delay, so as to better characterize the actual spread of epidemics. We develop new mathematical methods and techniques to study the dynamics of the models, including the basic reproduction number, and the global asymptotic stability of the disease-free and endemic equilibria. We show the disease-free equilibrium cannot undergo a Hopf bifurcation. We further analyze the effects of local information of diseases and various immunization schemes on epidemic dynamics. We also perform some stochastic network simulations which yield quantitative agreement with the deterministic mean-field approach.

Complex network structure of musical compositions: Algorithmic generation of appealing music

NASA Astrophysics Data System (ADS)

Liu, Xiao Fan; Tse, Chi K.; Small, Michael

2010-01-01

In this paper we construct networks for music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes and their co-occurring connections. We analyze classical music from Bach, Mozart, Chopin, as well as other types of music such as Chinese pop music. We observe remarkably similar properties in all networks constructed from the selected compositions. We conjecture that preserving the universal network properties is a necessary step in artificial composition of music. Power-law exponents of node degree, node strength and/or edge weight distributions, mean degrees, clustering coefficients, mean geodesic distances, etc. are reported. With the network constructed, music can be composed artificially using a controlled random walk algorithm, which begins with a randomly chosen note and selects the subsequent notes according to a simple set of rules that compares the weights of the edges, weights of the nodes, and/or the degrees of nodes. By generating a large number of compositions, we find that this algorithm generates music which has the necessary qualities to be subjectively judged as appealing.

Modelling information flow along the human connectome using maximum flow.

PubMed

Lyoo, Youngwook; Kim, Jieun E; Yoon, Sujung

2018-01-01

The human connectome is a complex network that transmits information between interlinked brain regions. Using graph theory, previously well-known network measures of integration between brain regions have been constructed under the key assumption that information flows strictly along the shortest paths possible between two nodes. However, it is now apparent that information does flow through non-shortest paths in many real-world networks such as cellular networks, social networks, and the internet. In the current hypothesis, we present a novel framework using the maximum flow to quantify information flow along all possible paths within the brain, so as to implement an analogy to network traffic. We hypothesize that the connection strengths of brain networks represent a limit on the amount of information that can flow through the connections per unit of time. This allows us to compute the maximum amount of information flow between two brain regions along all possible paths. Using this novel framework of maximum flow, previous network topological measures are expanded to account for information flow through non-shortest paths. The most important advantage of the current approach using maximum flow is that it can integrate the weighted connectivity data in a way that better reflects the real information flow of the brain network. The current framework and its concept regarding maximum flow provides insight on how network structure shapes information flow in contrast to graph theory, and suggests future applications such as investigating structural and functional connectomes at a neuronal level. Copyright © 2017 Elsevier Ltd. All rights reserved.

77 FR 33229 - Notice of Proposed Information Collection: Comment Request; National Resource Network

Federal Register 2010, 2011, 2012, 2013, 2014

2012-06-05

... Information Collection: Comment Request; National Resource Network AGENCY: Office of the Assistant Secretary... information: Title of Proposal: National Resource Network. OMB Control Number, if applicable: None... and reporting information related to the proposed National Resource Network. The U.S. Department of...

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.

N-Screen Aware Multicriteria Hybrid Recommender System Using Weight Based Subspace Clustering

PubMed Central

Ullah, Farman; Lee, Sungchang

2014-01-01

This paper presents a recommender system for N-screen services in which users have multiple devices with different capabilities. In N-screen services, a user can use various devices in different locations and time and can change a device while the service is running. N-screen aware recommendation seeks to improve the user experience with recommended content by considering the user N-screen device attributes such as screen resolution, media codec, remaining battery time, and access network and the user temporal usage pattern information that are not considered in existing recommender systems. For N-screen aware recommendation support, this work introduces a user device profile collaboration agent, manager, and N-screen control server to acquire and manage the user N-screen devices profile. Furthermore, a multicriteria hybrid framework is suggested that incorporates the N-screen devices information with user preferences and demographics. In addition, we propose an individual feature and subspace weight based clustering (IFSWC) to assign different weights to each subspace and each feature within a subspace in the hybrid framework. The proposed system improves the accuracy, precision, scalability, sparsity, and cold start issues. The simulation results demonstrate the effectiveness and prove the aforementioned statements. PMID:25152921

Tracking the Reorganization of Module Structure in Time-Varying Weighted Brain Functional Connectivity Networks.

PubMed

Schmidt, Christoph; Piper, Diana; Pester, Britta; Mierau, Andreas; Witte, Herbert

2018-05-01

Identification of module structure in brain functional networks is a promising way to obtain novel insights into neural information processing, as modules correspond to delineated brain regions in which interactions are strongly increased. Tracking of network modules in time-varying brain functional networks is not yet commonly considered in neuroscience despite its potential for gaining an understanding of the time evolution of functional interaction patterns and associated changing degrees of functional segregation and integration. We introduce a general computational framework for extracting consensus partitions from defined time windows in sequences of weighted directed edge-complete networks and show how the temporal reorganization of the module structure can be tracked and visualized. Part of the framework is a new approach for computing edge weight thresholds for individual networks based on multiobjective optimization of module structure quality criteria as well as an approach for matching modules across time steps. By testing our framework using synthetic network sequences and applying it to brain functional networks computed from electroencephalographic recordings of healthy subjects that were exposed to a major balance perturbation, we demonstrate the framework's potential for gaining meaningful insights into dynamic brain function in the form of evolving network modules. The precise chronology of the neural processing inferred with our framework and its interpretation helps to improve the currently incomplete understanding of the cortical contribution for the compensation of such balance perturbations.

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.

Online adaptive optimal control for continuous-time nonlinear systems with completely unknown dynamics

NASA Astrophysics Data System (ADS)

Lv, Yongfeng; Na, Jing; Yang, Qinmin; Wu, Xing; Guo, Yu

2016-01-01

An online adaptive optimal control is proposed for continuous-time nonlinear systems with completely unknown dynamics, which is achieved by developing a novel identifier-critic-based approximate dynamic programming algorithm with a dual neural network (NN) approximation structure. First, an adaptive NN identifier is designed to obviate the requirement of complete knowledge of system dynamics, and a critic NN is employed to approximate the optimal value function. Then, the optimal control law is computed based on the information from the identifier NN and the critic NN, so that the actor NN is not needed. In particular, a novel adaptive law design method with the parameter estimation error is proposed to online update the weights of both identifier NN and critic NN simultaneously, which converge to small neighbourhoods around their ideal values. The closed-loop system stability and the convergence to small vicinity around the optimal solution are all proved by means of the Lyapunov theory. The proposed adaptation algorithm is also improved to achieve finite-time convergence of the NN weights. Finally, simulation results are provided to exemplify the efficacy of the proposed methods.

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

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

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.

Indirect iterative learning control for a discrete visual servo without a camera-robot model.

PubMed

Jiang, Ping; Bamforth, Leon C A; Feng, Zuren; Baruch, John E F; Chen, YangQuan

2007-08-01

This paper presents a discrete learning controller for vision-guided robot trajectory imitation with no prior knowledge of the camera-robot model. A teacher demonstrates a desired movement in front of a camera, and then, the robot is tasked to replay it by repetitive tracking. The imitation procedure is considered as a discrete tracking control problem in the image plane, with an unknown and time-varying image Jacobian matrix. Instead of updating the control signal directly, as is usually done in iterative learning control (ILC), a series of neural networks are used to approximate the unknown Jacobian matrix around every sample point in the demonstrated trajectory, and the time-varying weights of local neural networks are identified through repetitive tracking, i.e., indirect ILC. This makes repetitive segmented training possible, and a segmented training strategy is presented to retain the training trajectories solely within the effective region for neural network approximation. However, a singularity problem may occur if an unmodified neural-network-based Jacobian estimation is used to calculate the robot end-effector velocity. A new weight modification algorithm is proposed which ensures invertibility of the estimation, thus circumventing the problem. Stability is further discussed, and the relationship between the approximation capability of the neural network and the tracking accuracy is obtained. Simulations and experiments are carried out to illustrate the validity of the proposed controller for trajectory imitation of robot manipulators with unknown time-varying Jacobian matrices.

Entropy-Based Analysis and Bioinformatics-Inspired Integration of Global Economic Information Transfer

PubMed Central

An, Sungbae; Kwon, Young-Kyun; Yoon, Sungroh

2013-01-01

The assessment of information transfer in the global economic network helps to understand the current environment and the outlook of an economy. Most approaches on global networks extract information transfer based mainly on a single variable. This paper establishes an entirely new bioinformatics-inspired approach to integrating information transfer derived from multiple variables and develops an international economic network accordingly. In the proposed methodology, we first construct the transfer entropies (TEs) between various intra- and inter-country pairs of economic time series variables, test their significances, and then use a weighted sum approach to aggregate information captured in each TE. Through a simulation study, the new method is shown to deliver better information integration compared to existing integration methods in that it can be applied even when intra-country variables are correlated. Empirical investigation with the real world data reveals that Western countries are more influential in the global economic network and that Japan has become less influential following the Asian currency crisis. PMID:23300959

Entropy-based analysis and bioinformatics-inspired integration of global economic information transfer.

PubMed

Kim, Jinkyu; Kim, Gunn; An, Sungbae; Kwon, Young-Kyun; Yoon, Sungroh

2013-01-01

The assessment of information transfer in the global economic network helps to understand the current environment and the outlook of an economy. Most approaches on global networks extract information transfer based mainly on a single variable. This paper establishes an entirely new bioinformatics-inspired approach to integrating information transfer derived from multiple variables and develops an international economic network accordingly. In the proposed methodology, we first construct the transfer entropies (TEs) between various intra- and inter-country pairs of economic time series variables, test their significances, and then use a weighted sum approach to aggregate information captured in each TE. Through a simulation study, the new method is shown to deliver better information integration compared to existing integration methods in that it can be applied even when intra-country variables are correlated. Empirical investigation with the real world data reveals that Western countries are more influential in the global economic network and that Japan has become less influential following the Asian currency crisis.

Spiking neural networks for handwritten digit recognition-Supervised learning and network optimization.

PubMed

Kulkarni, Shruti R; Rajendran, Bipin

2018-07-01

We demonstrate supervised learning in Spiking Neural Networks (SNNs) for the problem of handwritten digit recognition using the spike triggered Normalized Approximate Descent (NormAD) algorithm. Our network that employs neurons operating at sparse biological spike rates below 300Hz achieves a classification accuracy of 98.17% on the MNIST test database with four times fewer parameters compared to the state-of-the-art. We present several insights from extensive numerical experiments regarding optimization of learning parameters and network configuration to improve its accuracy. We also describe a number of strategies to optimize the SNN for implementation in memory and energy constrained hardware, including approximations in computing the neuronal dynamics and reduced precision in storing the synaptic weights. Experiments reveal that even with 3-bit synaptic weights, the classification accuracy of the designed SNN does not degrade beyond 1% as compared to the floating-point baseline. Further, the proposed SNN, which is trained based on the precise spike timing information outperforms an equivalent non-spiking artificial neural network (ANN) trained using back propagation, especially at low bit precision. Thus, our study shows the potential for realizing efficient neuromorphic systems that use spike based information encoding and learning for real-world applications. Copyright © 2018 Elsevier Ltd. All rights reserved.

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.

Graphs for information security control in software defined networks

NASA Astrophysics Data System (ADS)

Grusho, Alexander A.; Abaev, Pavel O.; Shorgin, Sergey Ya.; Timonina, Elena E.

2017-07-01

Information security control in software defined networks (SDN) is connected with execution of the security policy rules regulating information accesses and protection against distribution of the malicious code and harmful influences. The paper offers a representation of a security policy in the form of hierarchical structure which in case of distribution of resources for the solution of tasks defines graphs of admissible interactions in a networks. These graphs define commutation tables of switches via the SDN controller.

Factors Associated With Weight Change in Online Weight Management Communities: A Case Study in the LoseIt Reddit Community

PubMed Central

Ribeiro, Antonio; Couto Silva, Ana Paula; Meira Jr, Wagner

2017-01-01

Background Recent research has shown that of the 72% of American Internet users who have looked for health information online, 22% have searched for help to lose or control weight. This demand for information has given rise to many online weight management communities, where users support one another throughout their weight loss process. Whether and how user engagement in online communities relates to weight change is not totally understood. Objective We investigated the activity behavior and analyze the semantic content of the messages of active users in LoseIt (r/loseit), a weight management community of the online social network Reddit. We then explored whether these features are associated with weight loss in this online social network. Methods A data collection tool was used to collect English posts, comments, and other public metadata of active users (ie, users with at least one post or comment) on LoseIt from August 2010 to November 2014. Analyses of frequency and intensity of user interaction in the community were performed together with a semantic analysis of the messages, done by a latent Dirichlet allocation method. The association between weight loss and online user activity patterns, the semantics of the messages, and real-world variables was found by a linear regression model using 30-day weight change as the dependent variable. Results We collected posts and comments of 107,886 unique users. Among these, 101,003 (93.62%) wrote at least one comment and 38,981 (36.13%) wrote at least one post. Median percentage of days online was 3.81 (IQR 9.51). The 10 most-discussed semantic topics on posts were related to healthy food, clothing, calorie counting, workouts, looks, habits, support, and unhealthy food. In the subset of 754 users who had gender, age, and 30-day weight change data available, women were predominant and 92.9% (701/754) lost weight. Female gender, body mass index (BMI) at baseline, high levels of online activity, the number of upvotes received per post, and topics discussed within the community were independently associated with weight change. Conclusions Our findings suggest that among active users of a weight management community, self-declaration of higher BMI levels (which may represent greater dissatisfaction with excess weight), high online activity, and engagement in discussions that might provide social support are associated with greater weight loss. These findings have the potential to aid health professionals to assist patients in online interventions by focusing efforts on increasing engagement and/or starting discussions on topics of higher impact on weight change. PMID:28093378

Web Information Systems for Monitoring and Control of Indoor Air Quality at Subway Stations

NASA Astrophysics Data System (ADS)

Choi, Gi Heung; Choi, Gi Sang; Jang, Joo Hyoung

In crowded subway stations indoor air quality (IAQ) is a key factor for ensuring the safety, health and comfort of passengers. In this study, a framework for web-based information system in VDN environment for monitoring and control of IAQ in subway stations is suggested. Since physical variables that describing IAQ need to be closely monitored and controlled in multiple locations in subway stations, concept of distributed monitoring and control network using wireless media needs to be implemented. Connecting remote wireless sensor network and device (LonWorks) networks to the IP network based on the concept of VDN can provide a powerful, integrated, distributed monitoring and control performance, making a web-based information system possible.

Communication of brain network core connections altered in behavioral variant frontotemporal dementia but possibly preserved in early-onset Alzheimer's disease

NASA Astrophysics Data System (ADS)

Daianu, Madelaine; Jahanshad, Neda; Mendez, Mario F.; Bartzokis, George; Jimenez, Elvira E.; Thompson, Paul M.

2015-03-01

Diffusion imaging and brain connectivity analyses can assess white matter deterioration in the brain, revealing the underlying patterns of how brain structure declines. Fiber tractography methods can infer neural pathways and connectivity patterns, yielding sensitive mathematical metrics of network integrity. Here, we analyzed 1.5-Tesla wholebrain diffusion-weighted images from 64 participants - 15 patients with behavioral variant frontotemporal dementia (bvFTD), 19 with early-onset Alzheimer's disease (EOAD), and 30 healthy elderly controls. Using whole-brain tractography, we reconstructed structural brain connectivity networks to map connections between cortical regions. We evaluated the brain's networks focusing on the most highly central and connected regions, also known as hubs, in each diagnostic group - specifically the "high-cost" structural backbone used in global and regional communication. The high-cost backbone of the brain, predicted by fiber density and minimally short pathways between brain regions, accounted for 81-92% of the overall brain communication metric in all diagnostic groups. Furthermore, we found that the set of pathways interconnecting high-cost and high-capacity regions of the brain's communication network are globally and regionally altered in bvFTD, compared to healthy participants; however, the overall organization of the high-cost and high-capacity networks were relatively preserved in EOAD participants, relative to controls. Disruption of the major central hubs that transfer information between brain regions may impair neural communication and functional integrity in characteristic ways typical of each subtype of dementia.

Probabilistic diffusion tractography reveals improvement of structural network in musicians.

PubMed

Li, Jianfu; Luo, Cheng; Peng, Yueheng; Xie, Qiankun; Gong, Jinnan; Dong, Li; Lai, Yongxiu; Li, Hong; Yao, Dezhong

2014-01-01

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

Adaptive critic designs for optimal control of uncertain nonlinear systems with unmatched interconnections.

PubMed

Yang, Xiong; He, Haibo

2018-05-26

In this paper, we develop a novel optimal control strategy for a class of uncertain nonlinear systems with unmatched interconnections. To begin with, we present a stabilizing feedback controller for the interconnected nonlinear systems by modifying an array of optimal control laws of auxiliary subsystems. We also prove that this feedback controller ensures a specified cost function to achieve optimality. Then, under the framework of adaptive critic designs, we use critic networks to solve the Hamilton-Jacobi-Bellman equations associated with auxiliary subsystem optimal control laws. The critic network weights are tuned through the gradient descent method combined with an additional stabilizing term. By using the newly established weight tuning rules, we no longer need the initial admissible control condition. In addition, we demonstrate that all signals in the closed-loop auxiliary subsystems are stable in the sense of uniform ultimate boundedness by using classic Lyapunov techniques. Finally, we provide an interconnected nonlinear plant to validate the present control scheme. Copyright © 2018 Elsevier Ltd. All rights reserved.

Information processing speed and attention in multiple sclerosis: Reconsidering the Attention Network Test (ANT).

PubMed

Roth, Alexandra K; Denney, Douglas R; Lynch, Sharon G

2015-01-01

The Attention Network Test (ANT) assesses attention in terms of discrepancies between response times to items that differ in the burden they place on some facet of attention. However, simple arithmetic difference scores commonly used to capture these discrepancies fail to provide adequate control for information processing speed, leading to distorted findings when patient and control groups differ markedly in the speed with which they process and respond to stimulus information. This study examined attention networks in patients with multiple sclerosis (MS) using simple difference scores, proportional scores, and residualized scores that control for processing speed through statistical regression. Patients with relapsing-remitting (N = 20) or secondary progressive (N = 20) MS and healthy controls (N = 40) of similar age, education, and gender completed the ANT. Substantial differences between patients and controls were found on all measures of processing speed. Patients exhibited difficulties in the executive control network, but only when difference scores were considered. When deficits in information processing speed were adequately controlled using proportional or residualized score, deficits in the alerting network emerged. The effect sizes for these deficits were notably smaller than those for overall information processing speed and were also limited to patients with secondary progressive MS. Deficits in processing speed are more prominent in MS than those involving attention, and when the former are properly accounted for, differences in the latter are confined to the alerting network.

Stochastic Characterization of Communication Network Latency for Wide Area Grid Control Applications.

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

Ameme, Dan Selorm Kwami; Guttromson, Ross

This report characterizes communications network latency under various network topologies and qualities of service (QoS). The characterizations are probabilistic in nature, allowing deeper analysis of stability for Internet Protocol (IP) based feedback control systems used in grid applications. The work involves the use of Raspberry Pi computers as a proxy for a controlled resource, and an ns-3 network simulator on a Linux server to create an experimental platform (testbed) that can be used to model wide-area grid control network communications in smart grid. Modbus protocol is used for information transport, and Routing Information Protocol is used for dynamic route selectionmore » within the simulated network.« less

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.

Information mining in weighted complex networks with nonlinear rating projection

NASA Astrophysics Data System (ADS)

Liao, Hao; Zeng, An; Zhou, Mingyang; Mao, Rui; Wang, Bing-Hong

2017-10-01

Weighted rating networks are commonly used by e-commerce providers nowadays. In order to generate an objective ranking of online items' quality according to users' ratings, many sophisticated algorithms have been proposed in the complex networks domain. In this paper, instead of proposing new algorithms we focus on a more fundamental problem: the nonlinear rating projection. The basic idea is that even though the rating values given by users are linearly separated, the real preference of users to items between the different given values is nonlinear. We thus design an approach to project the original ratings of users to more representative values. This approach can be regarded as a data pretreatment method. Simulation in both artificial and real networks shows that the performance of the ranking algorithms can be improved when the projected ratings are used.

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.

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.

Cooperative learning neural network output feedback control of uncertain nonlinear multi-agent systems under directed topologies

NASA Astrophysics Data System (ADS)

Wang, W.; Wang, D.; Peng, Z. H.

2017-09-01

Without assuming that the communication topologies among the neural network (NN) weights are to be undirected and the states of each agent are measurable, the cooperative learning NN output feedback control is addressed for uncertain nonlinear multi-agent systems with identical structures in strict-feedback form. By establishing directed communication topologies among NN weights to share their learned knowledge, NNs with cooperative learning laws are employed to identify the uncertainties. By designing NN-based κ-filter observers to estimate the unmeasurable states, a new cooperative learning output feedback control scheme is proposed to guarantee that the system outputs can track nonidentical reference signals with bounded tracking errors. A simulation example is given to demonstrate the effectiveness of the theoretical results.

Temporal effects in trend prediction: identifying the most popular nodes in the future.

PubMed

Zhou, Yanbo; Zeng, An; Wang, Wei-Hong

2015-01-01

Prediction is an important problem in different science domains. In this paper, we focus on trend prediction in complex networks, i.e. to identify the most popular nodes in the future. Due to the preferential attachment mechanism in real systems, nodes' recent degree and cumulative degree have been successfully applied to design trend prediction methods. Here we took into account more detailed information about the network evolution and proposed a temporal-based predictor (TBP). The TBP predicts the future trend by the node strength in the weighted network with the link weight equal to its exponential aging. Three data sets with time information are used to test the performance of the new method. We find that TBP have high general accuracy in predicting the future most popular nodes. More importantly, it can identify many potential objects with low popularity in the past but high popularity in the future. The effect of the decay speed in the exponential aging on the results is discussed in detail.

Temporal Effects in Trend Prediction: Identifying the Most Popular Nodes in the Future

PubMed Central

Zhou, Yanbo; Zeng, An; Wang, Wei-Hong

2015-01-01

Prediction is an important problem in different science domains. In this paper, we focus on trend prediction in complex networks, i.e. to identify the most popular nodes in the future. Due to the preferential attachment mechanism in real systems, nodes’ recent degree and cumulative degree have been successfully applied to design trend prediction methods. Here we took into account more detailed information about the network evolution and proposed a temporal-based predictor (TBP). The TBP predicts the future trend by the node strength in the weighted network with the link weight equal to its exponential aging. Three data sets with time information are used to test the performance of the new method. We find that TBP have high general accuracy in predicting the future most popular nodes. More importantly, it can identify many potential objects with low popularity in the past but high popularity in the future. The effect of the decay speed in the exponential aging on the results is discussed in detail. PMID:25806810

The impact of an online social network with wireless monitoring devices on physical activity and weight loss.

PubMed

Greene, Jessica; Sacks, Rebecca; Piniewski, Brigitte; Kil, David; Hahn, Jin S

2013-07-01

Online social networks (OSNs) are a new, promising approach for catalyzing health-related behavior change. To date, the empirical evidence on their impact has been limited. Using a randomized trial, we assessed the impact of a health-oriented OSN with accelerometer and scales on participant's physical activity, weight, and clinical indicators. A sample of 349 PeaceHealth Oregon employees and family members were randomized to the iWell OSN or a control group and followed for 6 months in 2010-2011. The iWell OSN enabled participants to connect with "friends," make public postings, view contacts' postings, set goals, download the number of their steps from an accelerometer and their weight from a scale, view trends in physical activity and weight, and compete against others in physical activity. Both control and intervention participants received traditional education material on diet and physical activity. Laboratory data on weight and clinical indicators (triglycerides, high-density lipoprotein, or low-density lipoprotein), and self-reported data on physical activity, were collected at baseline, 3 months, and 6 months. At 6 months, the intervention group increased leisure walking minutes by 164% compared with 47% in the control group. The intervention group also lost more weight than the controls (5.2 pounds compared with 1.5 pounds). There were no observed significant differences in vigorous exercise or clinical indicators between the 2 groups. Among intervention participants, greater OSN use, as measured by number of private messages sent, was associated with a greater increase in leisure walking and greater weight reduction over the study period. The study provides evidence that interventions using OSNs can successfully promote increases in physical activity and weight loss.

Power-law weighted networks from local attachments

NASA Astrophysics Data System (ADS)

Moriano, P.; Finke, J.

2012-07-01

This letter introduces a mechanism for constructing, through a process of distributed decision-making, substrates for the study of collective dynamics on extended power-law weighted networks with both a desired scaling exponent and a fixed clustering coefficient. The analytical results show that the connectivity distribution converges to the scaling behavior often found in social and engineering systems. To illustrate the approach of the proposed framework we generate network substrates that resemble steady state properties of the empirical citation distributions of i) publications indexed by the Institute for Scientific Information from 1981 to 1997; ii) patents granted by the U.S. Patent and Trademark Office from 1975 to 1999; and iii) opinions written by the Supreme Court and the cases they cite from 1754 to 2002.

Application of dynamic recurrent neural networks in nonlinear system identification

NASA Astrophysics Data System (ADS)

Du, Yun; Wu, Xueli; Sun, Huiqin; Zhang, Suying; Tian, Qiang

2006-11-01

An adaptive identification method of simple dynamic recurrent neural network (SRNN) for nonlinear dynamic systems is presented in this paper. This method based on the theory that by using the inner-states feed-back of dynamic network to describe the nonlinear kinetic characteristics of system can reflect the dynamic characteristics more directly, deduces the recursive prediction error (RPE) learning algorithm of SRNN, and improves the algorithm by studying topological structure on recursion layer without the weight values. The simulation results indicate that this kind of neural network can be used in real-time control, due to its less weight values, simpler learning algorithm, higher identification speed, and higher precision of model. It solves the problems of intricate in training algorithm and slow rate in convergence caused by the complicate topological structure in usual dynamic recurrent neural network.

Connectionist Architectures for Time Series Prediction of Dynamical Systems

NASA Astrophysics Data System (ADS)

Weigend, Andreas Sebastian

We investigate the effectiveness of connectionist networks for predicting the future continuation of temporal sequences. The problem of overfitting, particularly serious for short records of noisy data, is addressed by the method of weight-elimination: a term penalizing network complexity is added to the usual cost function in back-propagation. We describe the dynamics of the procedure and clarify the meaning of the parameters involved. From a Bayesian perspective, the complexity term can be usefully interpreted as an assumption about prior distribution of the weights. We analyze three time series. On the benchmark sunspot series, the networks outperform traditional statistical approaches. We show that the network performance does not deteriorate when there are more input units than needed. In the second example, the notoriously noisy foreign exchange rates series, we pick one weekday and one currency (DM vs. US). Given exchange rate information up to and including a Monday, the task is to predict the rate for the following Tuesday. Weight-elimination manages to extract a significant part of the dynamics and makes the solution interpretable. In the third example, the networks predict the resource utilization of a chaotic computational ecosystem for hundreds of steps forward in time.

Connectomics and neuroticism: an altered functional network organization.

PubMed

Servaas, Michelle N; Geerligs, Linda; Renken, Remco J; Marsman, Jan-Bernard C; Ormel, Johan; Riese, Harriëtte; Aleman, André

2015-01-01

The personality trait neuroticism is a potent risk marker for psychopathology. Although the neurobiological basis remains unclear, studies have suggested that alterations in connectivity may underlie it. Therefore, the aim of the current study was to shed more light on the functional network organization in neuroticism. To this end, we applied graph theory on resting-state functional magnetic resonance imaging (fMRI) data in 120 women selected based on their neuroticism score. Binary and weighted brain-wide graphs were constructed to examine changes in the functional network structure and functional connectivity strength. Furthermore, graphs were partitioned into modules to specifically investigate connectivity within and between functional subnetworks related to emotion processing and cognitive control. Subsequently, complex network measures (ie, efficiency and modularity) were calculated on the brain-wide graphs and modules, and correlated with neuroticism scores. Compared with low neurotic individuals, high neurotic individuals exhibited a whole-brain network structure resembling more that of a random network and had overall weaker functional connections. Furthermore, in these high neurotic individuals, functional subnetworks could be delineated less clearly and the majority of these subnetworks showed lower efficiency, while the affective subnetwork showed higher efficiency. In addition, the cingulo-operculum subnetwork demonstrated more ties with other functional subnetworks in association with neuroticism. In conclusion, the 'neurotic brain' has a less than optimal functional network organization and shows signs of functional disconnectivity. Moreover, in high compared with low neurotic individuals, emotion and salience subnetworks have a more prominent role in the information exchange, while sensory(-motor) and cognitive control subnetworks have a less prominent role.

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.

The influence of body weight on social network ties among adolescents.

PubMed

Ali, Mir M; Amialchuk, Aliaksandr; Rizzo, John A

2012-01-01

Evidence of negative stereotypes, prejudice and discrimination towards obese individuals has been widely documented. However, the effect of a larger body size on social network ties or friendship formations is less well understood. In this paper, we explore the extent to which higher body weight results in social marginalization of adolescents. Using data from a nationally representative sample of adolescents, we estimate endogeneity-corrected models including school-level fixed effects that account for bi-directionality and unobserved confounders to ascertain the effect of body weight on social network ties. We find that obese adolescents have fewer friends and are less socially integrated than their non-obese counterparts. We also find that such penalties in friendship networks are present among whites but not African-Americans or Hispanics, with the largest effect among white females. These results are robust to common environmental influences at the school-level and to controls for preferences, risk attitudes, low self-esteem and objective measures of physical attractiveness. Published by Elsevier B.V.

Identifying highly connected counties compensates for resource limitations when evaluating national spread of an invasive pathogen.

PubMed

Sutrave, Sweta; Scoglio, Caterina; Isard, Scott A; Hutchinson, J M Shawn; Garrett, Karen A

2012-01-01

Surveying invasive species can be highly resource intensive, yet near-real-time evaluations of invasion progress are important resources for management planning. In the case of the soybean rust invasion of the United States, a linked monitoring, prediction, and communication network saved U.S. soybean growers approximately $200 M/yr. Modeling of future movement of the pathogen (Phakopsora pachyrhizi) was based on data about current disease locations from an extensive network of sentinel plots. We developed a dynamic network model for U.S. soybean rust epidemics, with counties as nodes and link weights a function of host hectarage and wind speed and direction. We used the network model to compare four strategies for selecting an optimal subset of sentinel plots, listed here in order of increasing performance: random selection, zonal selection (based on more heavily weighting regions nearer the south, where the pathogen overwinters), frequency-based selection (based on how frequently the county had been infected in the past), and frequency-based selection weighted by the node strength of the sentinel plot in the network model. When dynamic network properties such as node strength are characterized for invasive species, this information can be used to reduce the resources necessary to survey and predict invasion progress.

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.

The co-evolution of networks and prisoner’s dilemma game by considering sensitivity and visibility

NASA Astrophysics Data System (ADS)

Li, Dandan; Ma, Jing; Han, Dun; Sun, Mei; Tian, Lixin; Stanley, H. Eugene

2017-03-01

Strategies adopted by individuals in a social network significantly impact the network, and they strongly affect relationships between individuals in the network. Links between individuals also heavily influence their levels of cooperation. Taking into account the evolution of each individual’s connection, we explore how sensitivity and visibility affect the prisoner’s dilemma game. The so-called ‘sensitivity’ and ‘visibility’ respectively present one’s self-protection consciousness and the ability of gaining information. We find that at moderate levels of player sensitivity cooperative behavior increases, but that at high levels it is inhibited. We also find that the heterogeneity of the weight of individuals at the end of the game is higher when sensitivity and visibility are increased, but that the successful-defection-payoff has less impact on the weight of individuals and on the relationship between the heterogeneity of the weight of individuals and the density of cooperators. This framework can be used to clarify the interaction mechanism between the micro-level of individual behavior and the macro-level of individual co-evolutionary processes.

The co-evolution of networks and prisoner's dilemma game by considering sensitivity and visibility.

PubMed

Li, Dandan; Ma, Jing; Han, Dun; Sun, Mei; Tian, Lixin; Stanley, H Eugene

2017-03-24

Strategies adopted by individuals in a social network significantly impact the network, and they strongly affect relationships between individuals in the network. Links between individuals also heavily influence their levels of cooperation. Taking into account the evolution of each individual's connection, we explore how sensitivity and visibility affect the prisoner's dilemma game. The so-called 'sensitivity' and 'visibility' respectively present one's self-protection consciousness and the ability of gaining information. We find that at moderate levels of player sensitivity cooperative behavior increases, but that at high levels it is inhibited. We also find that the heterogeneity of the weight of individuals at the end of the game is higher when sensitivity and visibility are increased, but that the successful-defection-payoff has less impact on the weight of individuals and on the relationship between the heterogeneity of the weight of individuals and the density of cooperators. This framework can be used to clarify the interaction mechanism between the micro-level of individual behavior and the macro-level of individual co-evolutionary processes.

The co-evolution of networks and prisoner’s dilemma game by considering sensitivity and visibility

PubMed Central

Li, Dandan; Ma, Jing; Han, Dun; Sun, Mei; Tian, Lixin; Stanley, H. Eugene

2017-01-01

Strategies adopted by individuals in a social network significantly impact the network, and they strongly affect relationships between individuals in the network. Links between individuals also heavily influence their levels of cooperation. Taking into account the evolution of each individual’s connection, we explore how sensitivity and visibility affect the prisoner’s dilemma game. The so-called ‘sensitivity’ and ‘visibility’ respectively present one’s self-protection consciousness and the ability of gaining information. We find that at moderate levels of player sensitivity cooperative behavior increases, but that at high levels it is inhibited. We also find that the heterogeneity of the weight of individuals at the end of the game is higher when sensitivity and visibility are increased, but that the successful-defection-payoff has less impact on the weight of individuals and on the relationship between the heterogeneity of the weight of individuals and the density of cooperators. This framework can be used to clarify the interaction mechanism between the micro-level of individual behavior and the macro-level of individual co-evolutionary processes. PMID:28338070

Warnings and caveats in brain controllability.

PubMed

Tu, Chengyi; Rocha, Rodrigo P; Corbetta, Maurizio; Zampieri, Sandro; Zorzi, Marco; Suweis, S

2018-08-01

A recent article by Gu et al. (Nat. Commun. 6, 2015) proposed to characterize brain networks, quantified using anatomical diffusion imaging, in terms of their "controllability", drawing on concepts and methods of control theory. They reported that brain activity is controllable from a single node, and that the topology of brain networks provides an explanation for the types of control roles that different regions play in the brain. In this work, we first briefly review the framework of control theory applied to complex networks. We then show contrasting results on brain controllability through the analysis of five different datasets and numerical simulations. We find that brain networks are not controllable (in a statistical significant way) by one single region. Additionally, we show that random null models, with no biological resemblance to brain network architecture, produce the same type of relationship observed by Gu et al. between the average/modal controllability and weighted degree. Finally, we find that resting state networks defined with fMRI cannot be attributed specific control roles. In summary, our study highlights some warning and caveats in the brain controllability framework. Copyright © 2018 Elsevier Inc. All rights reserved.

Neural-Network-Development Program

NASA Technical Reports Server (NTRS)

Phillips, Todd A.

1993-01-01

NETS, software tool for development and evaluation of neural networks, provides simulation of neural-network algorithms plus computing environment for development of such algorithms. Uses back-propagation learning method for all of networks it creates. Enables user to customize patterns of connections between layers of network. Also provides features for saving, during learning process, values of weights, providing more-precise control over learning process. Written in ANSI standard C language. Machine-independent version (MSC-21588) includes only code for command-line-interface version of NETS 3.0.

Adaptive Neural Network-Based Event-Triggered Control of Single-Input Single-Output Nonlinear Discrete-Time Systems.

PubMed

Sahoo, Avimanyu; Xu, Hao; Jagannathan, Sarangapani

2016-01-01

This paper presents a novel adaptive neural network (NN) control of single-input and single-output uncertain nonlinear discrete-time systems under event sampled NN inputs. In this control scheme, the feedback signals are transmitted, and the NN weights are tuned in an aperiodic manner at the event sampled instants. After reviewing the NN approximation property with event sampled inputs, an adaptive state estimator (SE), consisting of linearly parameterized NNs, is utilized to approximate the unknown system dynamics in an event sampled context. The SE is viewed as a model and its approximated dynamics and the state vector, during any two events, are utilized for the event-triggered controller design. An adaptive event-trigger condition is derived by using both the estimated NN weights and a dead-zone operator to determine the event sampling instants. This condition both facilitates the NN approximation and reduces the transmission of feedback signals. The ultimate boundedness of both the NN weight estimation error and the system state vector is demonstrated through the Lyapunov approach. As expected, during an initial online learning phase, events are observed more frequently. Over time with the convergence of the NN weights, the inter-event times increase, thereby lowering the number of triggered events. These claims are illustrated through the simulation results.

RF beam transmission of x-band PAA system utilizing large-area, polymer-based true-time-delay module developed using imprinting and inkjet printing

NASA Astrophysics Data System (ADS)

Pan, Zeyu; Subbaraman, Harish; Zhang, Cheng; Li, Qiaochu; Xu, Xiaochuan; Chen, Xiangning; Zhang, Xingyu; Zou, Yi; Panday, Ashwin; Guo, L. Jay; Chen, Ray T.

2016-02-01

Phased-array antenna (PAA) technology plays a significant role in modern day radar and communication networks. Truetime- delay (TTD) enabled beam steering networks provide several advantages over their electronic counterparts, including squint-free beam steering, low RF loss, immunity to electromagnetic interference (EMI), and large bandwidth control of PAAs. Chip-scale and integrated TTD modules promise a miniaturized, light-weight system; however, the modules are still rigid and they require complex packaging solutions. Moreover, the total achievable time delay is still restricted by the wafer size. In this work, we propose a light-weight and large-area, true-time-delay beamforming network that can be fabricated on light-weight and flexible/rigid surfaces utilizing low-cost "printing" techniques. In order to prove the feasibility of the approach, a 2-bit thermo-optic polymer TTD network is developed using a combination of imprinting and ink-jet printing. RF beam steering of a 1×4 X-band PAA up to 60° is demonstrated. The development of such active components on large area, light-weight, and low-cost substrates promises significant improvement in size, weight, and power (SWaP) requirements over the state-of-the-art.

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.

An adaptive trajectory tracking control of four rotor hover vehicle using extended normalized radial basis function network

NASA Astrophysics Data System (ADS)

ul Amin, Rooh; Aijun, Li; Khan, Muhammad Umer; Shamshirband, Shahaboddin; Kamsin, Amirrudin

2017-01-01

In this paper, an adaptive trajectory tracking controller based on extended normalized radial basis function network (ENRBFN) is proposed for 3-degree-of-freedom four rotor hover vehicle subjected to external disturbance i.e. wind turbulence. Mathematical model of four rotor hover system is developed using equations of motions and a new computational intelligence based technique ENRBFN is introduced to approximate the unmodeled dynamics of the hover vehicle. The adaptive controller based on the Lyapunov stability approach is designed to achieve tracking of the desired attitude angles of four rotor hover vehicle in the presence of wind turbulence. The adaptive weight update based on the Levenberg-Marquardt algorithm is used to avoid weight drift in case the system is exposed to external disturbances. The closed-loop system stability is also analyzed using Lyapunov stability theory. Simulations and experimental results are included to validate the effectiveness of the proposed control scheme.

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.

Effect of various features on the life cycle cost of the timing/synchronization subsystem of the DCS digital communications network

NASA Technical Reports Server (NTRS)

Kimsey, D. B.

1978-01-01

The effect on the life cycle cost of the timing subsystem was examined, when these optional features were included in various combinations. The features included mutual control, directed control, double-ended reference links, independence of clock error measurement and correction, phase reference combining, self-organization, smoothing for link and nodal dropouts, unequal reference weightings, and a master in a mutual control network. An overall design of a microprocessor-based timing subsystem was formulated. The microprocessor (8080) implements the digital filter portion of a digital phase locked loop, as well as other control functions such as organization of the network through communication with processors at neighboring nodes.

Bayesian Networks Improve Causal Environmental Assessments for Evidence-Based Policy.

PubMed

Carriger, John F; Barron, Mace G; Newman, Michael C

2016-12-20

Rule-based weight of evidence approaches to ecological risk assessment may not account for uncertainties and generally lack probabilistic integration of lines of evidence. Bayesian networks allow causal inferences to be made from evidence by including causal knowledge about the problem, using this knowledge with probabilistic calculus to combine multiple lines of evidence, and minimizing biases in predicting or diagnosing causal relationships. Too often, sources of uncertainty in conventional weight of evidence approaches are ignored that can be accounted for with Bayesian networks. Specifying and propagating uncertainties improve the ability of models to incorporate strength of the evidence in the risk management phase of an assessment. Probabilistic inference from a Bayesian network allows evaluation of changes in uncertainty for variables from the evidence. The network structure and probabilistic framework of a Bayesian approach provide advantages over qualitative approaches in weight of evidence for capturing the impacts of multiple sources of quantifiable uncertainty on predictions of ecological risk. Bayesian networks can facilitate the development of evidence-based policy under conditions of uncertainty by incorporating analytical inaccuracies or the implications of imperfect information, structuring and communicating causal issues through qualitative directed graph formulations, and quantitatively comparing the causal power of multiple stressors on valued ecological resources. These aspects are demonstrated through hypothetical problem scenarios that explore some major benefits of using Bayesian networks for reasoning and making inferences in evidence-based policy.

Consensus-Based Cooperative Control Based on Pollution Sensing and Traffic Information for Urban Traffic Networks

PubMed Central

Artuñedo, Antonio; del Toro, Raúl M.; Haber, Rodolfo E.

2017-01-01

Nowadays many studies are being conducted to develop solutions for improving the performance of urban traffic networks. One of the main challenges is the necessary cooperation among different entities such as vehicles or infrastructure systems and how to exploit the information available through networks of sensors deployed as infrastructures for smart cities. In this work an algorithm for cooperative control of urban subsystems is proposed to provide a solution for mobility problems in cities. The interconnected traffic lights controller (TLC) network adapts traffic lights cycles, based on traffic and air pollution sensory information, in order to improve the performance of urban traffic networks. The presence of air pollution in cities is not only caused by road traffic but there are other pollution sources that contribute to increase or decrease the pollution level. Due to the distributed and heterogeneous nature of the different components involved, a system of systems engineering approach is applied to design a consensus-based control algorithm. The designed control strategy contains a consensus-based component that uses the information shared in the network for reaching a consensus in the state of TLC network components. Discrete event systems specification is applied for modelling and simulation. The proposed solution is assessed by simulation studies with very promising results to deal with simultaneous responses to both pollution levels and traffic flows in urban traffic networks. PMID:28445398

Consensus-Based Cooperative Control Based on Pollution Sensing and Traffic Information for Urban Traffic Networks.

PubMed

Artuñedo, Antonio; Del Toro, Raúl M; Haber, Rodolfo E

2017-04-26

Nowadays many studies are being conducted to develop solutions for improving the performance of urban traffic networks. One of the main challenges is the necessary cooperation among different entities such as vehicles or infrastructure systems and how to exploit the information available through networks of sensors deployed as infrastructures for smart cities. In this work an algorithm for cooperative control of urban subsystems is proposed to provide a solution for mobility problems in cities. The interconnected traffic lights controller ( TLC ) network adapts traffic lights cycles, based on traffic and air pollution sensory information, in order to improve the performance of urban traffic networks. The presence of air pollution in cities is not only caused by road traffic but there are other pollution sources that contribute to increase or decrease the pollution level. Due to the distributed and heterogeneous nature of the different components involved, a system of systems engineering approach is applied to design a consensus-based control algorithm. The designed control strategy contains a consensus-based component that uses the information shared in the network for reaching a consensus in the state of TLC network components. Discrete event systems specification is applied for modelling and simulation. The proposed solution is assessed by simulation studies with very promising results to deal with simultaneous responses to both pollution levels and traffic flows in urban traffic networks.

Urban occupational structures as information networks: The effect on network density of increasing number of occupations.

PubMed

Shutters, Shade T; Lobo, José; Muneepeerakul, Rachata; Strumsky, Deborah; Mellander, Charlotta; Brachert, Matthias; Farinha, Teresa; Bettencourt, Luis M A

2018-01-01

Urban economies are composed of diverse activities, embodied in labor occupations, which depend on one another to produce goods and services. Yet little is known about how the nature and intensity of these interdependences change as cities increase in population size and economic complexity. Understanding the relationship between occupational interdependencies and the number of occupations defining an urban economy is relevant because interdependence within a networked system has implications for system resilience and for how easily can the structure of the network be modified. Here, we represent the interdependencies among occupations in a city as a non-spatial information network, where the strengths of interdependence between pairs of occupations determine the strengths of the links in the network. Using those quantified link strengths we calculate a single metric of interdependence-or connectedness-which is equivalent to the density of a city's weighted occupational network. We then examine urban systems in six industrialized countries, analyzing how the density of urban occupational networks changes with network size, measured as the number of unique occupations present in an urban workforce. We find that in all six countries, density, or economic interdependence, increases superlinearly with the number of distinct occupations. Because connections among occupations represent flows of information, we provide evidence that connectivity scales superlinearly with network size in information networks.

Urban occupational structures as information networks: The effect on network density of increasing number of occupations

PubMed Central

Lobo, José; Muneepeerakul, Rachata; Strumsky, Deborah; Mellander, Charlotta; Brachert, Matthias; Farinha, Teresa; Bettencourt, Luis M. A.

2018-01-01

Urban economies are composed of diverse activities, embodied in labor occupations, which depend on one another to produce goods and services. Yet little is known about how the nature and intensity of these interdependences change as cities increase in population size and economic complexity. Understanding the relationship between occupational interdependencies and the number of occupations defining an urban economy is relevant because interdependence within a networked system has implications for system resilience and for how easily can the structure of the network be modified. Here, we represent the interdependencies among occupations in a city as a non-spatial information network, where the strengths of interdependence between pairs of occupations determine the strengths of the links in the network. Using those quantified link strengths we calculate a single metric of interdependence–or connectedness–which is equivalent to the density of a city’s weighted occupational network. We then examine urban systems in six industrialized countries, analyzing how the density of urban occupational networks changes with network size, measured as the number of unique occupations present in an urban workforce. We find that in all six countries, density, or economic interdependence, increases superlinearly with the number of distinct occupations. Because connections among occupations represent flows of information, we provide evidence that connectivity scales superlinearly with network size in information networks. PMID:29734354

Using Machine Learning to Predict Swine Movements within a Regional Program to Improve Control of Infectious Diseases in the US.

PubMed

Valdes-Donoso, Pablo; VanderWaal, Kimberly; Jarvis, Lovell S; Wayne, Spencer R; Perez, Andres M

2017-01-01

Between-farm animal movement is one of the most important factors influencing the spread of infectious diseases in food animals, including in the US swine industry. Understanding the structural network of contacts in a food animal industry is prerequisite to planning for efficient production strategies and for effective disease control measures. Unfortunately, data regarding between-farm animal movements in the US are not systematically collected and thus, such information is often unavailable. In this paper, we develop a procedure to replicate the structure of a network, making use of partial data available, and subsequently use the model developed to predict animal movements among sites in 34 Minnesota counties. First, we summarized two networks of swine producing facilities in Minnesota, then we used a machine learning technique referred to as random forest, an ensemble of independent classification trees, to estimate the probability of pig movements between farms and/or markets sites located in two counties in Minnesota. The model was calibrated and tested by comparing predicted data and observed data in those two counties for which data were available. Finally, the model was used to predict animal movements in sites located across 34 Minnesota counties. Variables that were important in predicting pig movements included between-site distance, ownership, and production type of the sending and receiving farms and/or markets. Using a weighted-kernel approach to describe spatial variation in the centrality measures of the predicted network, we showed that the south-central region of the study area exhibited high aggregation of predicted pig movements. Our results show an overlap with the distribution of outbreaks of porcine reproductive and respiratory syndrome, which is believed to be transmitted, at least in part, though animal movements. While the correspondence of movements and disease is not a causal test, it suggests that the predicted network may approximate actual movements. Accordingly, the predictions provided here might help to design and implement control strategies in the region. Additionally, the methodology here may be used to estimate contact networks for other livestock systems when only incomplete information regarding animal movements is available.

An efficient fully unsupervised video object segmentation scheme using an adaptive neural-network classifier architecture.

PubMed

Doulamis, A; Doulamis, N; Ntalianis, K; Kollias, S

2003-01-01

In this paper, an unsupervised video object (VO) segmentation and tracking algorithm is proposed based on an adaptable neural-network architecture. The proposed scheme comprises: 1) a VO tracking module and 2) an initial VO estimation module. Object tracking is handled as a classification problem and implemented through an adaptive network classifier, which provides better results compared to conventional motion-based tracking algorithms. Network adaptation is accomplished through an efficient and cost effective weight updating algorithm, providing a minimum degradation of the previous network knowledge and taking into account the current content conditions. A retraining set is constructed and used for this purpose based on initial VO estimation results. Two different scenarios are investigated. The first concerns extraction of human entities in video conferencing applications, while the second exploits depth information to identify generic VOs in stereoscopic video sequences. Human face/ body detection based on Gaussian distributions is accomplished in the first scenario, while segmentation fusion is obtained using color and depth information in the second scenario. A decision mechanism is also incorporated to detect time instances for weight updating. Experimental results and comparisons indicate the good performance of the proposed scheme even in sequences with complicated content (object bending, occlusion).

Where Do Women Get Advice About Weight, Eating, and Physical Activity During Pregnancy?

PubMed

Mercado, Adrian; Marquez, Becky; Abrams, Barbara; Phipps, Maureen G; Wing, Rena R; Phelan, Suzanne

2017-09-01

Most women report not receiving information about gestational weight gain (GWG) from prenatal providers, but less is known about other sources of information and their potential impacts on GWG. The purpose of this study was to investigate sources of information about diet, physical activity, and weight control during pregnancy, and the impact of information sources on maternal GWG. Participants were 183 women with normal weight and 172 women with overweight/obesity who had enrolled in a prenatal lifestyle intervention trial. At 6 weeks postpartum, women were asked whether they had received information about "diet, physical activity, or weight control" from 12 sources uninvolved in the trial (e.g., physician, Internet, and friend) and, if received, the extent to which they followed the advice. Information sources were examined in relation to odds of exceeding Institute of Medicine (IOM) GWG guidelines based on measured weights. Most women reported receiving information from a book (60.6%) or the Internet (58.3%). Advice from physicians, dietitians, or nurses was reported in 55.6%, 48.2%, and 33.9% of women, respectively. Reported receipt of information from physicians was associated with reduced Odds Ratio ([95% Confidence Interval] = 0.55 [0.35-0.88]; p = 0.01) of exceeding IOM GWG guidelines. Reported receipt of information from other sources was not related to GWG. Books and the Internet were the most prevalent information sources reported for prenatal diet, physical activity, and weight control. However, of all sources, only physician provision of information was associated with reduced odds of excessive GWG.

Real-time Adaptive Control Using Neural Generalized Predictive Control

NASA Technical Reports Server (NTRS)

Haley, Pam; Soloway, Don; Gold, Brian

1999-01-01

The objective of this paper is to demonstrate the feasibility of a Nonlinear Generalized Predictive Control algorithm by showing real-time adaptive control on a plant with relatively fast time-constants. Generalized Predictive Control has classically been used in process control where linear control laws were formulated for plants with relatively slow time-constants. The plant of interest for this paper is a magnetic levitation device that is nonlinear and open-loop unstable. In this application, the reference model of the plant is a neural network that has an embedded nominal linear model in the network weights. The control based on the linear model provides initial stability at the beginning of network training. In using a neural network the control laws are nonlinear and online adaptation of the model is possible to capture unmodeled or time-varying dynamics. Newton-Raphson is the minimization algorithm. Newton-Raphson requires the calculation of the Hessian, but even with this computational expense the low iteration rate make this a viable algorithm for real-time control.

Using input feature information to improve ultraviolet retrieval in neural networks

NASA Astrophysics Data System (ADS)

Sun, Zhibin; Chang, Ni-Bin; Gao, Wei; Chen, Maosi; Zempila, Melina

2017-09-01

In neural networks, the training/predicting accuracy and algorithm efficiency can be improved significantly via accurate input feature extraction. In this study, some spatial features of several important factors in retrieving surface ultraviolet (UV) are extracted. An extreme learning machine (ELM) is used to retrieve the surface UV of 2014 in the continental United States, using the extracted features. The results conclude that more input weights can improve the learning capacities of neural networks.

The development of a fiber optics communication network for controlling a Multidegree-Of-Freedom Serpentine Truss

NASA Astrophysics Data System (ADS)

Andrawis, Alfred S.

1994-10-01

The problem addressed by this report is the large size and heavy weight of the cable bundle, used for controlling a Multidegree-Of-Freedom Serpentine Truss Manipulator arm, which imposes limitations on the manipulator arm maneuverability. This report covers a design of an optical fiber network to replace the existing copper wire network of the Serpentine Truss Manipulator. This report proposes a fiber network design which significantly reduces the bundle size into two phases. The first phase does not require any modifications for the manipulator architecture, while the other requires major modifications. Design philosophy, hardware details and schematic diagrams are presented.

The development of a fiber optics communication network for controlling a Multidegree-Of-Freedom Serpentine Truss

NASA Technical Reports Server (NTRS)

Andrawis, Alfred S.

1994-01-01

The problem addressed by this report is the large size and heavy weight of the cable bundle, used for controlling a Multidegree-Of-Freedom Serpentine Truss Manipulator arm, which imposes limitations on the manipulator arm maneuverability. This report covers a design of an optical fiber network to replace the existing copper wire network of the Serpentine Truss Manipulator. This report proposes a fiber network design which significantly reduces the bundle size into two phases. The first phase does not require any modifications for the manipulator architecture, while the other requires major modifications. Design philosophy, hardware details and schematic diagrams are presented.

Low Temperature Performance of High-Speed Neural Network Circuits

NASA Technical Reports Server (NTRS)

Duong, T.; Tran, M.; Daud, T.; Thakoor, A.

1995-01-01

Artificial neural networks, derived from their biological counterparts, offer a new and enabling computing paradigm specially suitable for such tasks as image and signal processing with feature classification/object recognition, global optimization, and adaptive control. When implemented in fully parallel electronic hardware, it offers orders of magnitude speed advantage. Basic building blocks of the new architecture are the processing elements called neurons implemented as nonlinear operational amplifiers with sigmoidal transfer function, interconnected through weighted connections called synapses implemented using circuitry for weight storage and multiply functions either in an analog, digital, or hybrid scheme.

Longitudinal social networks impacts on weight and weight-related behaviors assessed using mobile-based ecological momentary assessments: Study Protocols for the SPARC study.

PubMed

Bruening, Meg; Ohri-Vachaspati, Punam; Brewis, Alexandra; Laska, Melissa; Todd, Michael; Hruschka, Daniel; Schaefer, David R; Whisner, Corrie M; Dunton, Genevieve

2016-08-30

The transition from the home to college is a phase in which emerging adults shift toward more unhealthy eating and physical activity patterns, higher body mass indices, thus increasing risk of overweight/obesity. Currently, little is understood about how changing friendship networks shape weight gain behaviors. This paper describes the recruitment, data collection, and data analytic protocols for the SPARC (Social impact of Physical Activity and nutRition in College) study, a longitudinal examination of the mechanisms by which friends and friendship networks influence nutrition and physical activity behaviors and weight gain in the transition to college life. The SPARC study aims to follow 1450 university freshmen from a large university over an academic year, collecting data on multiple aspects of friends and friendship networks. Integrating multiple types of data related to student lives, ecological momentary assessments (EMAs) are administered via a cell phone application, devilSPARC. EMAs collected in four 1-week periods (a total of 4 EMA waves) are integrated with linked data from web-based surveys and anthropometric measurements conducted at four times points (for a total of eight data collection periods including EMAs, separated by ~1 month). University databases will provide student card data, allowing integration of both time-dated data on food purchasing, use of physical activity venues, and geographical information system (GIS) locations of these activities relative to other students in their social networks. Findings are intended to guide the development of more effective interventions to enhance behaviors among college students that protect against weight gain during college.

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.

Methods and systems for detecting abnormal digital traffic

DOEpatents

Goranson, Craig A [Kennewick, WA; Burnette, John R [Kennewick, WA

2011-03-22

Aspects of the present invention encompass methods and systems for detecting abnormal digital traffic by assigning characterizations of network behaviors according to knowledge nodes and calculating a confidence value based on the characterizations from at least one knowledge node and on weighting factors associated with the knowledge nodes. The knowledge nodes include a characterization model based on prior network information. At least one of the knowledge nodes should not be based on fixed thresholds or signatures. The confidence value includes a quantification of the degree of confidence that the network behaviors constitute abnormal network traffic.

Ensemble Nonlinear Autoregressive Exogenous Artificial Neural Networks for Short-Term Wind Speed and Power Forecasting.

PubMed

Men, Zhongxian; Yee, Eugene; Lien, Fue-Sang; Yang, Zhiling; Liu, Yongqian

2014-01-01

Short-term wind speed and wind power forecasts (for a 72 h period) are obtained using a nonlinear autoregressive exogenous artificial neural network (ANN) methodology which incorporates either numerical weather prediction or high-resolution computational fluid dynamics wind field information as an exogenous input. An ensemble approach is used to combine the predictions from many candidate ANNs in order to provide improved forecasts for wind speed and power, along with the associated uncertainties in these forecasts. More specifically, the ensemble ANN is used to quantify the uncertainties arising from the network weight initialization and from the unknown structure of the ANN. All members forming the ensemble of neural networks were trained using an efficient particle swarm optimization algorithm. The results of the proposed methodology are validated using wind speed and wind power data obtained from an operational wind farm located in Northern China. The assessment demonstrates that this methodology for wind speed and power forecasting generally provides an improvement in predictive skills when compared to the practice of using an "optimal" weight vector from a single ANN while providing additional information in the form of prediction uncertainty bounds.

Ensemble Nonlinear Autoregressive Exogenous Artificial Neural Networks for Short-Term Wind Speed and Power Forecasting

PubMed Central

Lien, Fue-Sang; Yang, Zhiling; Liu, Yongqian

2014-01-01

Short-term wind speed and wind power forecasts (for a 72 h period) are obtained using a nonlinear autoregressive exogenous artificial neural network (ANN) methodology which incorporates either numerical weather prediction or high-resolution computational fluid dynamics wind field information as an exogenous input. An ensemble approach is used to combine the predictions from many candidate ANNs in order to provide improved forecasts for wind speed and power, along with the associated uncertainties in these forecasts. More specifically, the ensemble ANN is used to quantify the uncertainties arising from the network weight initialization and from the unknown structure of the ANN. All members forming the ensemble of neural networks were trained using an efficient particle swarm optimization algorithm. The results of the proposed methodology are validated using wind speed and wind power data obtained from an operational wind farm located in Northern China. The assessment demonstrates that this methodology for wind speed and power forecasting generally provides an improvement in predictive skills when compared to the practice of using an “optimal” weight vector from a single ANN while providing additional information in the form of prediction uncertainty bounds. PMID:27382627

Developing a consumer evaluation tool of weight control strategy advertisements on the Internet.

PubMed

Luevorasirikul, Kanokrat; Gray, Nicola J; Anderson, Claire W

2008-06-01

To develop two evaluation tools for weight loss and weight gain advertisements on the Internet in order to help consumers to evaluate the quality of information within these advertisements. One hundred websites identified by Internet search engines for weight loss and weight gain strategies (50 websites each) were evaluated using two specific scoring instruments, developed by adapting questions from the 'DISCERN' tool and reviewing all related weight control guidelines and advertising regulations. The validity and reliability of the adapted tools were tested. Our evaluation tools rated the information from most websites as poor quality (70%). In the case of weight loss strategies, statements about rapid (18%) and permanent (28%) weight loss caused concern as well as lack of sensible advice about dieting and a lack of product warnings (84%). Safety concerns relating to weight gain products were the lack of warnings about side effects in products containing steroids and creatine (92%). The adapted tools exhibited acceptable validity and reliability. Quality of information within weight control advertisements on the Internet was generally poor. Problems of false claims, little advice on healthy ways to modify weight and few warnings on side effects have been highlighted in this study.

3D Ta/TaO x /TiO2/Ti synaptic array and linearity tuning of weight update for hardware neural network applications

NASA Astrophysics Data System (ADS)

Wang, I.-Ting; Chang, Chih-Cheng; Chiu, Li-Wen; Chou, Teyuh; Hou, Tuo-Hung

2016-09-01

The implementation of highly anticipated hardware neural networks (HNNs) hinges largely on the successful development of a low-power, high-density, and reliable analog electronic synaptic array. In this study, we demonstrate a two-layer Ta/TaO x /TiO2/Ti cross-point synaptic array that emulates the high-density three-dimensional network architecture of human brains. Excellent uniformity and reproducibility among intralayer and interlayer cells were realized. Moreover, at least 50 analog synaptic weight states could be precisely controlled with minimal drifting during a cycling endurance test of 5000 training pulses at an operating voltage of 3 V. We also propose a new state-independent bipolar-pulse-training scheme to improve the linearity of weight updates. The improved linearity considerably enhances the fault tolerance of HNNs, thus improving the training accuracy.

Tweeting it off: characteristics of adults who tweet about a weight loss attempt

PubMed Central

Pagoto, Sherry; Schneider, Kristin L; Evans, Martinus; Waring, Molly E; Appelhans, Brad; Busch, Andrew M; Whited, Matthew C; Thind, Herpreet; Ziedonis, Michelle

2014-01-01

Objective The purpose of this study was to describe adults who use Twitter during a weight loss attempt and to compare the positive and negative social influences they experience from their offline friends, online friends, and family members. Materials and methods Participants (N=100, 80% female, mean age=37.65, SD=8.42) were recruited from Twitter. They completed a brief survey about their experiences discussing their weight loss attempt with their online and offline friends and provided responses to open-ended questions on the benefits and drawbacks of discussing weight on Twitter, Facebook, and weight-specific social networks. Results Participants rated their connections on Twitter and weight loss-specific social networks to be significantly greater sources of positive social influence for their weight loss (F(3)=3.47; p<0.001) and significantly lesser sources of negative social influence (F(3)=40.39 and F(3)=33.68 (both p<0.001)) than their offline friends, family, and Facebook friends. Greater positive social influence from Twitter and Facebook friends was associated with greater weight loss in participants’ most recent weight loss attempt (r=0.30, r=0.32; p<0.01). The most commonly reported benefits of tweeting about weight loss include social support, information, and accountability. The most common drawbacks reported are that interactions were too brief and lacked personal connection. Discussion People who discuss their weight loss on Twitter report more social support and less negativity from their Twitter friends than their Facebook friends and in-person relationships. Conclusions Online social networks should be explored as a tool for connecting patients who lack weight loss social support from their in-person relationships. PMID:24928175

Neonatal medical exposures and characteristics of low birth weight hepatoblastoma cases: a report from the Children's Oncology Group.

PubMed

Turcotte, Lucie M; Georgieff, Michael K; Ross, Julie A; Feusner, James H; Tomlinson, Gail E; Malogolowkin, Marcio H; Krailo, Mark D; Miller, Nicole; Fonstad, Rachel; Spector, Logan G

2014-11-01

Hepatoblastoma is a malignancy of young children. Low birth weight is associated with significantly increased risk of hepatoblastoma and neonatal medical exposures are hypothesized as contributors. This study represents the largest case-control study of hepatoblastoma to date and aimed to define the role of neonatal exposures in hepatoblastoma risk among low birth weight children. Incident hepatoblastoma cases who were born <2,500 g (N = 60), diagnosed between 2000 and 2008, were identified through the Children's Oncology Group. Controls were recruited through state birth registries (N = 51). Neonatal medical exposures were abstracted from medical records. Subjects from the Vermont Oxford Network were used for further comparisons, as were existing reports on neonatal medical exposures. Case-control comparisons were hindered by poor matching within birth weight strata. Cases were smaller and received more aggressive neonatal treatment compared to controls, and reflected high correlation levels between birth weight and treatments. Similar difficulty was encountered when comparing cases to Vermont Oxford Network subjects; cases were smaller and required more aggressive neonatal therapy. Furthermore, it appears hepatoblastoma cases were exposed to a greater number of diagnostic X-rays than in case series previously reported in the neonatal literature. This study presents the largest case series of hepatoblastoma in <2,500 g birth weight infants with accompanying neonatal medical exposure data. Findings confirm that birth weight is highly correlated with exposure intensity, and neonatal exposures are themselves highly correlated, which hampers the identification of a causal exposure among hepatoblastoma cases. Experimental models or genetic susceptibility testing may be more revealing of etiology. © 2014 Wiley Periodicals, Inc.

Neonatal Medical Exposures and Characteristics of Low Birth Weight Hepatoblastoma Cases: A Report From the Children's Oncology Group

PubMed Central

Turcotte, Lucie M.; Georgieff, Michael K.; Ross, Julie A.; Feusner, James H.; Tomlinson, Gail E.; Malogolowkin, Marcio H.; Krailo, Mark D.; Miller, Nicole; Fonstad, Rachel; Spector, Logan G.

2015-01-01

Background Hepatoblastoma is a malignancy of young children. Low birth weight is associated with significantly increased risk of hepatoblastoma and neonatal medical exposures are hypothesized as contributors. This study represents the largest case–control study of hepatoblastoma to date and aimed to define the role of neonatal exposures in hepatoblastoma risk among low birth weight children. Procedure Incident hepatoblastoma cases who were born <2,500 g (N = 60), diagnosed between 2000 and 2008, were identified through the Children's Oncology Group. Controls were recruited through state birth registries (N = 51). Neonatal medical exposures were abstracted from medical records. Subjects from the Vermont Oxford Network were used for further comparisons, as were existing reports on neonatal medical exposures. Results Case–control comparisons were hindered by poor matching within birth weight strata. Cases were smaller and received more aggressive neonatal treatment compared to controls, and reflected high correlation levels between birth weight and treatments. Similar difficulty was encountered when comparing cases to Vermont Oxford Network subjects; cases were smaller and required more aggressive neonatal therapy. Furthermore, it appears hepatoblastoma cases were exposed to a greater number of diagnostic X-rays than in case series previously reported in the neonatal literature. Conclusions This study presents the largest case series of hepatoblastoma in <2,500 g birth weight infants with accompanying neonatal medical exposure data. Findings confirm that birth weight is highly correlated with exposure intensity, and neonatal exposures are themselves highly correlated, which hampers the identification of a causal exposure among hepatoblastoma cases. Experimental models or genetic susceptibility testing may be more revealing of etiology. PMID:25044669

Wireless Sensor Network Congestion Control Based on Standard Particle Swarm Optimization and Single Neuron PID

PubMed Central

Yang, Xiaoping; Chen, Xueying; Xia, Riting; Qian, Zhihong

2018-01-01

Aiming at the problem of network congestion caused by the large number of data transmissions in wireless routing nodes of wireless sensor network (WSN), this paper puts forward an algorithm based on standard particle swarm–neural PID congestion control (PNPID). Firstly, PID control theory was applied to the queue management of wireless sensor nodes. Then, the self-learning and self-organizing ability of neurons was used to achieve online adjustment of weights to adjust the proportion, integral and differential parameters of the PID controller. Finally, the standard particle swarm optimization to neural PID (NPID) algorithm of initial values of proportion, integral and differential parameters and neuron learning rates were used for online optimization. This paper describes experiments and simulations which show that the PNPID algorithm effectively stabilized queue length near the expected value. At the same time, network performance, such as throughput and packet loss rate, was greatly improved, which alleviated network congestion and improved network QoS. PMID:29671822

Wireless Sensor Network Congestion Control Based on Standard Particle Swarm Optimization and Single Neuron PID.

PubMed

Yang, Xiaoping; Chen, Xueying; Xia, Riting; Qian, Zhihong

2018-04-19

Aiming at the problem of network congestion caused by the large number of data transmissions in wireless routing nodes of wireless sensor network (WSN), this paper puts forward an algorithm based on standard particle swarm⁻neural PID congestion control (PNPID). Firstly, PID control theory was applied to the queue management of wireless sensor nodes. Then, the self-learning and self-organizing ability of neurons was used to achieve online adjustment of weights to adjust the proportion, integral and differential parameters of the PID controller. Finally, the standard particle swarm optimization to neural PID (NPID) algorithm of initial values of proportion, integral and differential parameters and neuron learning rates were used for online optimization. This paper describes experiments and simulations which show that the PNPID algorithm effectively stabilized queue length near the expected value. At the same time, network performance, such as throughput and packet loss rate, was greatly improved, which alleviated network congestion and improved network QoS.

Cluster Based Location-Aided Routing Protocol for Large Scale Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Wang, Yi; Dong, Liang; Liang, Taotao; Yang, Xinyu; Zhang, Deyun

Routing algorithms with low overhead, stable link and independence of the total number of nodes in the network are essential for the design and operation of the large-scale wireless mobile ad hoc networks (MANET). In this paper, we develop and analyze the Cluster Based Location-Aided Routing Protocol for MANET (C-LAR), a scalable and effective routing algorithm for MANET. C-LAR runs on top of an adaptive cluster cover of the MANET, which can be created and maintained using, for instance, the weight-based distributed algorithm. This algorithm takes into consideration the node degree, mobility, relative distance, battery power and link stability of mobile nodes. The hierarchical structure stabilizes the end-to-end communication paths and improves the networks' scalability such that the routing overhead does not become tremendous in large scale MANET. The clusterheads form a connected virtual backbone in the network, determine the network's topology and stability, and provide an efficient approach to minimizing the flooding traffic during route discovery and speeding up this process as well. Furthermore, it is fascinating and important to investigate how to control the total number of nodes participating in a routing establishment process so as to improve the network layer performance of MANET. C-LAR is to use geographical location information provided by Global Position System to assist routing. The location information of destination node is used to predict a smaller rectangle, isosceles triangle, or circle request zone, which is selected according to the relative location of the source and the destination, that covers the estimated region in which the destination may be located. Thus, instead of searching the route in the entire network blindly, C-LAR confines the route searching space into a much smaller estimated range. Simulation results have shown that C-LAR outperforms other protocols significantly in route set up time, routing overhead, mean delay and packet collision, and simultaneously maintains low average end-to-end delay, high success delivery ratio, low control overhead, as well as low route discovery frequency.

The algorithm study for using the back propagation neural network in CT image segmentation

NASA Astrophysics Data System (ADS)

Zhang, Peng; Liu, Jie; Chen, Chen; Li, Ying Qi

2017-01-01

Back propagation neural network(BP neural network) is a type of multi-layer feed forward network which spread positively, while the error spread backwardly. Since BP network has advantages in learning and storing the mapping between a large number of input and output layers without complex mathematical equations to describe the mapping relationship, it is most widely used. BP can iteratively compute the weight coefficients and thresholds of the network based on the training and back propagation of samples, which can minimize the error sum of squares of the network. Since the boundary of the computed tomography (CT) heart images is usually discontinuous, and it exist large changes in the volume and boundary of heart images, The conventional segmentation such as region growing and watershed algorithm can't achieve satisfactory results. Meanwhile, there are large differences between the diastolic and systolic images. The conventional methods can't accurately classify the two cases. In this paper, we introduced BP to handle the segmentation of heart images. We segmented a large amount of CT images artificially to obtain the samples, and the BP network was trained based on these samples. To acquire the appropriate BP network for the segmentation of heart images, we normalized the heart images, and extract the gray-level information of the heart. Then the boundary of the images was input into the network to compare the differences between the theoretical output and the actual output, and we reinput the errors into the BP network to modify the weight coefficients of layers. Through a large amount of training, the BP network tend to be stable, and the weight coefficients of layers can be determined, which means the relationship between the CT images and the boundary of heart.

Modeling the spatio-temporal dynamics of porcine reproductive & respiratory syndrome cases at farm level using geographical distance and pig trade network matrices.

PubMed

Amirpour Haredasht, Sara; Polson, Dale; Main, Rodger; Lee, Kyuyoung; Holtkamp, Derald; Martínez-López, Beatriz

2017-06-07

Porcine reproductive and respiratory syndrome (PRRS) is one of the most economically devastating infectious diseases for the swine industry. A better understanding of the disease dynamics and the transmission pathways under diverse epidemiological scenarios is a key for the successful PRRS control and elimination in endemic settings. In this paper we used a two step parameter-driven (PD) Bayesian approach to model the spatio-temporal dynamics of PRRS and predict the PRRS status on farm in subsequent time periods in an endemic setting in the US. For such purpose we used information from a production system with 124 pig sites that reported 237 PRRS cases from 2012 to 2015 and from which the pig trade network and geographical location of farms (i.e., distance was used as a proxy of airborne transmission) was available. We estimated five PD models with different weights namely: (i) geographical distance weight which contains the inverse distance between each pair of farms in kilometers, (ii) pig trade weight (PT ji ) which contains the absolute number of pig movements between each pair of farms, (iii) the product between the distance weight and the standardized relative pig trade weight, (iv) the product between the standardized distance weight and the standardized relative pig trade weight, and (v) the product of the distance weight and the pig trade weight. The model that included the pig trade weight matrix provided the best fit to model the dynamics of PRRS cases on a 6-month basis from 2012 to 2015 and was able to predict PRRS outbreaks in the subsequent time period with an area under the ROC curve (AUC) of 0.88 and the accuracy of 85% (105/124). The result of this study reinforces the importance of pig trade in PRRS transmission in the US. Methods and results of this study may be easily adapted to any production system to characterize the PRRS dynamics under diverse epidemic settings to more timely support decision-making.

QPA-CLIPS: A language and representation for process control

NASA Technical Reports Server (NTRS)

Freund, Thomas G.

1994-01-01

QPA-CLIPS is an extension of CLIPS oriented towards process control applications. Its constructs define a dependency network of process actions driven by sensor information. The language consists of three basic constructs: TASK, SENSOR, and FILTER. TASK's define the dependency network describing alternative state transitions for a process. SENSOR's and FILTER's define sensor information sources used to activate state transitions within the network. Deftemplate's define these constructs and their run-time environment is an interpreter knowledge base, performing pattern matching on sensor information and so activating TASK's in the dependency network. The pattern matching technique is based on the repeatable occurrence of a sensor data pattern. QPA-CIPS has been successfully tested on a SPARCStation providing supervisory control to an Allen-Bradley PLC 5 controller driving molding equipment.

Polymer/Carbon Nanotube Networks for Smart, Self-Repairing and Light-Weighted Nanocomposites

DTIC Science & Technology

2012-11-05

was develop smart, strong, and light-weight polymer/carbon nanotube (CNT) composites which will sense tribologically induced damages and self-heal by...light-weight polymer/carbon nanotube (CNT) composites which will sense tribologically induced damages and self-heal by inhibiting such degradation...one of support references for EPSRC instrument grant application for Micro Materials NanoTest Vantage Testing Suite with NTX4Controller. The grant

Protein Inference from the Integration of Tandem MS Data and Interactome Networks.

PubMed

Zhong, Jiancheng; Wang, Jianxing; Ding, Xiaojun; Zhang, Zhen; Li, Min; Wu, Fang-Xiang; Pan, Yi

2017-01-01

Since proteins are digested into a mixture of peptides in the preprocessing step of tandem mass spectrometry (MS), it is difficult to determine which specific protein a shared peptide belongs to. In recent studies, besides tandem MS data and peptide identification information, some other information is exploited to infer proteins. Different from the methods which first use only tandem MS data to infer proteins and then use network information to refine them, this study proposes a protein inference method named TMSIN, which uses interactome networks directly. As two interacting proteins should co-exist, it is reasonable to assume that if one of the interacting proteins is confidently inferred in a sample, its interacting partners should have a high probability in the same sample, too. Therefore, we can use the neighborhood information of a protein in an interactome network to adjust the probability that the shared peptide belongs to the protein. In TMSIN, a multi-weighted graph is constructed by incorporating the bipartite graph with interactome network information, where the bipartite graph is built with the peptide identification information. Based on multi-weighted graphs, TMSIN adopts an iterative workflow to infer proteins. At each iterative step, the probability that a shared peptide belongs to a specific protein is calculated by using the Bayes' law based on the neighbor protein support scores of each protein which are mapped by the shared peptides. We carried out experiments on yeast data and human data to evaluate the performance of TMSIN in terms of ROC, q-value, and accuracy. The experimental results show that AUC scores yielded by TMSIN are 0.742 and 0.874 in yeast dataset and human dataset, respectively, and TMSIN yields the maximum number of true positives when q-value less than or equal to 0.05. The overlap analysis shows that TMSIN is an effective complementary approach for protein inference.

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.

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.

Autonomous Congestion Control in Delay-Tolerant Networks

NASA Technical Reports Server (NTRS)

Burleigh, Scott C.; Jennings, Esther H.

2005-01-01

Congestion control is an important feature that directly affects network performance. Network congestion may cause loss of data or long delays. Although this problem has been studied extensively in the Internet, the solutions for Internet congestion control do not apply readily to challenged network environments such as Delay Tolerant Networks (DTN) where end-to-end connectivity may not exist continuously and latency can be high. In DTN, end-to-end rate control is not feasible. This calls for congestion control mechanisms where the decisions can be made autonomously with local information only. We use an economic pricing model and propose a rule-based congestion control mechanism where each router can autonomously decide on whether to accept a bundle (data) based on local information such as available storage and the value and risk of accepting the bundle (derived from historical statistics).

Approximate Optimal Control as a Model for Motor Learning

ERIC Educational Resources Information Center

Berthier, Neil E.; Rosenstein, Michael T.; Barto, Andrew G.

2005-01-01

Current models of psychological development rely heavily on connectionist models that use supervised learning. These models adapt network weights when the network output does not match the target outputs computed by some agent. The authors present a model of motor learning in which the child uses exploration to discover appropriate ways of…

Cortical brain connectivity evaluated by graph theory in dementia: a correlation study between functional and structural data.

PubMed

Vecchio, Fabrizio; Miraglia, Francesca; Curcio, Giuseppe; Altavilla, Riccardo; Scrascia, Federica; Giambattistelli, Federica; Quattrocchi, Carlo Cosimo; Bramanti, Placido; Vernieri, Fabrizio; Rossini, Paolo Maria

2015-01-01

A relatively new approach to brain function in neuroscience is the "functional connectivity", namely the synchrony in time of activity in anatomically-distinct but functionally-collaborating brain regions. On the other hand, diffusion tensor imaging (DTI) is a recently developed magnetic resonance imaging (MRI)-based technique with the capability to detect brain structural connection with fractional anisotropy (FA) identification. FA decrease has been observed in the corpus callosum of subjects with Alzheimer's disease (AD) and mild cognitive impairment (MCI, an AD prodromal stage). Corpus callosum splenium DTI abnormalities are thought to be associated with functional disconnections among cortical areas. This study aimed to investigate possible correlations between structural damage, measured by MRI-DTI, and functional abnormalities of brain integration, measured by characteristic path length detected in resting state EEG source activity (40 participants: 9 healthy controls, 10 MCI, 10 mild AD, 11 moderate AD). For each subject, undirected and weighted brain network was built to evaluate graph core measures. eLORETA lagged linear connectivity values were used as weight of the edges of the network. Results showed that callosal FA reduction is associated to a loss of brain interhemispheric functional connectivity characterized by increased delta and decreased alpha path length. These findings suggest that "global" (average network shortest path length representing an index of how efficient is the information transfer between two parts of the network) functional measure can reflect the reduction of fiber connecting the two hemispheres as revealed by DTI analysis and also anticipate in time this structural loss.

Autonomous Information Unit for Fine-Grain Data Access Control and Information Protection in a Net-Centric System

NASA Technical Reports Server (NTRS)

Chow, Edward T.; Woo, Simon S.; James, Mark; Paloulian, George K.

2012-01-01

As communication and networking technologies advance, networks will become highly complex and heterogeneous, interconnecting different network domains. There is a need to provide user authentication and data protection in order to further facilitate critical mission operations, especially in the tactical and mission-critical net-centric networking environment. The Autonomous Information Unit (AIU) technology was designed to provide the fine-grain data access and user control in a net-centric system-testing environment to meet these objectives. The AIU is a fundamental capability designed to enable fine-grain data access and user control in the cross-domain networking environments, where an AIU is composed of the mission data, metadata, and policy. An AIU provides a mechanism to establish trust among deployed AIUs based on recombining shared secrets, authentication and verify users with a username, X.509 certificate, enclave information, and classification level. AIU achieves data protection through (1) splitting data into multiple information pieces using the Shamir's secret sharing algorithm, (2) encrypting each individual information piece using military-grade AES-256 encryption, and (3) randomizing the position of the encrypted data based on the unbiased and memory efficient in-place Fisher-Yates shuffle method. Therefore, it becomes virtually impossible for attackers to compromise data since attackers need to obtain all distributed information as well as the encryption key and the random seeds to properly arrange the data. In addition, since policy can be associated with data in the AIU, different user access and data control strategies can be included. The AIU technology can greatly enhance information assurance and security management in the bandwidth-limited and ad hoc net-centric environments. In addition, AIU technology can be applicable to general complex network domains and applications where distributed user authentication and data protection are necessary. AIU achieves fine-grain data access and user control, reducing the security risk significantly, simplifying the complexity of various security operations, and providing the high information assurance across different network domains.

Characterizing system dynamics with a weighted and directed network constructed from time series data

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

Sun, Xiaoran, E-mail: sxr0806@gmail.com; School of Mathematics and Statistics, The University of Western Australia, Crawley WA 6009; Small, Michael, E-mail: michael.small@uwa.edu.au

In this work, we propose a novel method to transform a time series into a weighted and directed network. For a given time series, we first generate a set of segments via a sliding window, and then use a doubly symbolic scheme to characterize every windowed segment by combining absolute amplitude information with an ordinal pattern characterization. Based on this construction, a network can be directly constructed from the given time series: segments corresponding to different symbol-pairs are mapped to network nodes and the temporal succession between nodes is represented by directed links. With this conversion, dynamics underlying the timemore » series has been encoded into the network structure. We illustrate the potential of our networks with a well-studied dynamical model as a benchmark example. Results show that network measures for characterizing global properties can detect the dynamical transitions in the underlying system. Moreover, we employ a random walk algorithm to sample loops in our networks, and find that time series with different dynamics exhibits distinct cycle structure. That is, the relative prevalence of loops with different lengths can be used to identify the underlying dynamics.« less

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.

Hockey Fans in Training: A Pilot Pragmatic Randomized Controlled Trial.

PubMed

Petrella, Robert J; Gill, Dawn P; Zou, Guangyong; DE Cruz, Ashleigh; Riggin, Brendan; Bartol, Cassandra; Danylchuk, Karen; Hunt, Kate; Wyke, Sally; Gray, Cindy M; Bunn, Christopher; Zwarenstein, Merrick

2017-12-01

Hockey Fans in Training (Hockey FIT) is a gender-sensitized weight loss and healthy lifestyle program. We investigated 1) feasibility of recruiting and retaining overweight and obese men into a pilot pragmatic randomized controlled trial and 2) potential for Hockey FIT to lead to weight loss and improvements in other outcomes at 12 wk and 12 months. Male fans of two ice hockey teams (35-65 yr; body mass index ≥28 kg·m) located in Ontario (Canada) were randomized to intervention (Hockey FIT) or comparator (wait-list control). Hockey FIT includes a 12-wk active phase (weekly, coach-led group meetings including provision of dietary information, practice of behavior change techniques, and safe exercise sessions plus incremental pedometer walking) and a 40-wk minimally supported phase (smartphone app for sustaining physical activity, private online social network, standardized e-mails, booster session/reunion). Measurement at baseline and 12 wk (both groups) and 12 months (intervention group only) included clinical outcomes (e.g., weight) and self-reported physical activity, diet, and self-rated health. Eighty men were recruited in 4 wk; trial retention was >80% at 12 wk and >75% at 12 months. At 12 wk, the intervention group lost 3.6 kg (95% confidence interval, -5.26 to -1.90 kg) more than the comparator group (P < 0.001) and maintained this weight loss to 12 months. The intervention group also demonstrated greater improvements in other clinical measures, physical activity, diet, and self-rated health at 12 wk; most sustained to 12 months. Results suggest feasible recruitment/retention of overweight and obese men in the Hockey FIT program. Results provide evidence for the potential effectiveness of Hockey FIT for weight loss and improved health in at-risk men and, thus, evidence to proceed with a definitive trial.

Autonomous Congestion Control in Delay-Tolerant Networks

NASA Technical Reports Server (NTRS)

Burleigh, Scott; Jennings, Esther; Schoolcraft, Joshua

2006-01-01

Congestion control is an important feature that directly affects network performance. Network congestion may cause loss of data or long delays. Although this problem has been studied extensively in the Internet, the solutions for Internet congestion control do not apply readily to challenged network environments such as Delay Tolerant Networks (DTN) where end-to-end connectivity may not exist continuously and latency can be high. In DTN, end-to-end rate control is not feasible. This calls for congestion control mechanisms where the decisions can be made autonomously with local information only. We use an economic pricing model and propose a rule-based congestion control mechanism where each router can autonomously decide on whether to accept a bundle (data) based on local information such as available storage and the value and risk of accepting the bundle (derived from historical statistics). Preliminary experimental results show that this congestion control mechanism can protect routers from resource depletion without loss of data.

Modulation of attentional networks by food-related disinhibition.

PubMed

Hege, Maike A; Stingl, Krunoslav T; Veit, Ralf; Preissl, Hubert

2017-07-01

The risk of weight gain is especially related to disinhibition, which indicates the responsiveness to external food stimuli with associated disruptions in eating control. We adapted a food-related version of the attention network task and used functional magnetic resonance imaging to study the effects of disinhibition on attentional networks in 19 normal-weight participants. High disinhibition scores were associated with a rapid reorienting response to food pictures after invalid cueing and with an enhanced alerting effect of a warning cue signalizing the upcoming appearance of a food picture. Imaging data revealed activation of a right-lateralized ventral attention network during reorienting. The faster the reorienting and the higher the disinhibition score, the less activation of this network was observed. The alerting contrast showed activation in visual, temporo-parietal and anterior sites. These modulations of attentional networks by food-related disinhibition might be related to an attentional bias to energy dense and palatable food and increased intake of food in disinhibited individuals. Copyright © 2017 Elsevier Inc. All rights reserved.

Adaptive model predictive process control using neural networks

DOEpatents

Buescher, K.L.; Baum, C.C.; Jones, R.D.

1997-08-19

A control system for controlling the output of at least one plant process output parameter is implemented by adaptive model predictive control using a neural network. An improved method and apparatus provides for sampling plant output and control input at a first sampling rate to provide control inputs at the fast rate. The MPC system is, however, provided with a network state vector that is constructed at a second, slower rate so that the input control values used by the MPC system are averaged over a gapped time period. Another improvement is a provision for on-line training that may include difference training, curvature training, and basis center adjustment to maintain the weights and basis centers of the neural in an updated state that can follow changes in the plant operation apart from initial off-line training data. 46 figs.

Adaptive model predictive process control using neural networks

DOEpatents

Buescher, Kevin L.; Baum, Christopher C.; Jones, Roger D.

1997-01-01

A control system for controlling the output of at least one plant process output parameter is implemented by adaptive model predictive control using a neural network. An improved method and apparatus provides for sampling plant output and control input at a first sampling rate to provide control inputs at the fast rate. The MPC system is, however, provided with a network state vector that is constructed at a second, slower rate so that the input control values used by the MPC system are averaged over a gapped time period. Another improvement is a provision for on-line training that may include difference training, curvature training, and basis center adjustment to maintain the weights and basis centers of the neural in an updated state that can follow changes in the plant operation apart from initial off-line training data.

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.

Liraglutide Modulates Appetite and Body Weight Via GLP-1R-Expressing Glutamatergic Neurons.

PubMed

Adams, Jessica M; Pei, Hongjuan; Sandoval, Darleen A; Seeley, Randy J; Chang, Rui B; Liberles, Stephen D; Olson, David P

2018-05-18

Glucagon-like peptide-1 receptor (GLP-1R) agonists are FDA-approved weight loss drugs. Despite their widespread use, the sites of action through which GLP-1R agonists (GLP1RAs) impact appetite and body weight are still not fully understood. Here, we determined whether GLP-1Rs in either GABAergic or glutamatergic neurons are necessary for the acute and chronic effects of the GLP1RA liraglutide on food intake, visceral illness, body weight and neural network activation. We found that mice lacking GLP-1Rs in vGAT -expressing GABAergic neurons responded identically to controls in all parameters measured, whereas deletion of GLP-1Rs in vGlut2 -expressing glutamatergic neurons eliminated liraglutide-induced weight loss and visceral illness and severely attenuated its effects on feeding. Concomitantly, deletion of GLP-1Rs from glutamatergic neurons completely abolished the neural network activation observed after liraglutide administration. We conclude that liraglutide activates a dispersed but discrete neural network to mediate its physiological effects, and that these effects require GLP-1R expression on glutamatergic but not GABAergic neurons. © 2018 by the American Diabetes Association.

Common and distinct changes of default mode and salience network in schizophrenia and major depression.

PubMed

Shao, Junming; Meng, Chun; Tahmasian, Masoud; Brandl, Felix; Yang, Qinli; Luo, Guangchun; Luo, Cheng; Yao, Dezhong; Gao, Lianli; Riedl, Valentin; Wohlschläger, Afra; Sorg, Christian

2018-02-19

Brain imaging reveals schizophrenia as a disorder of macroscopic brain networks. In particular, default mode and salience network (DMN, SN) show highly consistent alterations in both interacting brain activity and underlying brain structure. However, the same networks are also altered in major depression. This overlap in network alterations induces the question whether DMN and SN changes are different across both disorders, potentially indicating distinct underlying pathophysiological mechanisms. To address this question, we acquired T1-weighted, diffusion-weighted, and resting-state functional MRI in patients with schizophrenia, patients with major depression, and healthy controls. We measured regional gray matter volume, inter-regional structural and intrinsic functional connectivity of DMN and SN, and compared these measures across groups by generalized Wilcoxon rank tests, while controlling for symptoms and medication. When comparing patients with controls, we found in each patient group SN volume loss, impaired DMN structural connectivity, and aberrant DMN and SN functional connectivity. When comparing patient groups, SN gray matter volume loss and DMN structural connectivity reduction did not differ between groups, but in schizophrenic patients, functional hyperconnectivity between DMN and SN was less in comparison to depressed patients. Results provide evidence for distinct functional hyperconnectivity between DMN and SN in schizophrenia and major depression, while structural changes in DMN and SN were similar. Distinct hyperconnectivity suggests different pathophysiological mechanism underlying aberrant DMN-SN interactions in schizophrenia and depression.

Synchronization invariance under network structural transformations

NASA Astrophysics Data System (ADS)

Arola-Fernández, Lluís; Díaz-Guilera, Albert; Arenas, Alex

2018-06-01

Synchronization processes are ubiquitous despite the many connectivity patterns that complex systems can show. Usually, the emergence of synchrony is a macroscopic observable; however, the microscopic details of the system, as, e.g., the underlying network of interactions, is many times partially or totally unknown. We already know that different interaction structures can give rise to a common functionality, understood as a common macroscopic observable. Building upon this fact, here we propose network transformations that keep the collective behavior of a large system of Kuramoto oscillators invariant. We derive a method based on information theory principles, that allows us to adjust the weights of the structural interactions to map random homogeneous in-degree networks into random heterogeneous networks and vice versa, keeping synchronization values invariant. The results of the proposed transformations reveal an interesting principle; heterogeneous networks can be mapped to homogeneous ones with local information, but the reverse process needs to exploit higher-order information. The formalism provides analytical insight to tackle real complex scenarios when dealing with uncertainty in the measurements of the underlying connectivity structure.

An information theory account of cognitive control.

PubMed

Fan, Jin

2014-01-01

Our ability to efficiently process information and generate appropriate responses depends on the processes collectively called cognitive control. Despite a considerable focus in the literature on the cognitive control of information processing, neural mechanisms underlying control are still unclear, and have not been characterized by considering the quantity of information to be processed. A novel and comprehensive account of cognitive control is proposed using concepts from information theory, which is concerned with communication system analysis and the quantification of information. This account treats the brain as an information-processing entity where cognitive control and its underlying brain networks play a pivotal role in dealing with conditions of uncertainty. This hypothesis and theory article justifies the validity and properties of such an account and relates experimental findings to the frontoparietal network under the framework of information theory.

Quality assurance and quality control methodologies used within the Austrian UV monitoring network.

PubMed

Mario, Blumthaler

2004-01-01

The Austrian UVB monitoring network is operational since 1997. Nine detectors for measuring erythemally weighted solar UV irradiance are distributed over Austria in order to cover the main populated areas as well as different levels of altitude. The detectors are calibrated to indicate the UV-Index, the internationally agreed unit for erythemally weighted solar UV irradiance. Calibration is carried out in the laboratory for determination of spectral sensitivity of each detector, and under the sun for absolute comparison with a well-calibrated, double-monochromator spectroradiometer. For the conversion from detector-weighted units to erythemally weighted units a lookup table is used, which is calculated using a radiative transfer model and which reflects the dependence of the conversion on the solar zenith angle and total ozone content of the atmosphere. The uncertainty of the calibration is about +/-7%, dominated by the uncertainty of the calibration lamp for the spectroradiometer (+/-4%). The long-term stability of this type of detectors has been found to be not satisfactory. Therefore, routinely every year all detectors are completely recalibrated. Variations of the calibration factors up to +/-10% are found. Thus, during routine operation, several measures take place for quality control. The measured data are compared to results of model calculations with a radiative transfer model, where clear sky and an aerosol-free atmosphere are assumed. At each site, the UV data are also compared with data from a co-located pyranometer measuring total solar irradiance. These two radiation quantities are well correlated, especially on clear days and when the ozone content is taken into account. If suspicious measurements are found for one detector in the network, a well-calibrated travelling reference detector of the same type is set up side-by-side, allowing the identification of relative differences of approximately 3%. If necessary, a recalibration is carried out. As the main aim for the Austrian UV monitoring network is the information of the public about the actual levels of UVB irradiance, the measurement results are published on-line in the Internet (http://www.uibk.ac.at/projects/uv-index). For the previous day and backwards approximately 2 years, the distribution of maximal UVB levels over Austria is shown on a regional map. Additionally, near real-time data of most of the measurement stations are presented with a delay of usually less than half-an-hour. Together with these actually measured data there is also shown the diurnal variation of the maximal expected value of the UV-Index under ideal clear conditions.

Nonvolatile Array Of Synapses For Neural Network

NASA Technical Reports Server (NTRS)

Tawel, Raoul

1993-01-01

Elements of array programmed with help of ultraviolet light. A 32 x 32 very-large-scale integrated-circuit array of electronic synapses serves as building-block chip for analog neural-network computer. Synaptic weights stored in nonvolatile manner. Makes information content of array invulnerable to loss of power, and, by eliminating need for circuitry to refresh volatile synaptic memory, makes architecture simpler and more compact.

Topological Principles of Control in Dynamical Networks

NASA Astrophysics Data System (ADS)

Kim, Jason; Pasqualetti, Fabio; Bassett, Danielle

Networked biological systems, such as the brain, feature complex patterns of interactions. To predict and correct the dynamic behavior of such systems, it is imperative to understand how the underlying topological structure affects and limits the function of the system. Here, we use network control theory to extract topological features that favor or prevent network controllability, and to understand the network-wide effect of external stimuli on large-scale brain systems. Specifically, we treat each brain region as a dynamic entity with real-valued state, and model the time evolution of all interconnected regions using linear, time-invariant dynamics. We propose a simplified feed-forward scheme where the effect of upstream regions (drivers) on the connected downstream regions (non-drivers) is characterized in closed-form. Leveraging this characterization of the simplified model, we derive topological features that predict the controllability properties of non-simplified networks. We show analytically and numerically that these predictors are accurate across a large range of parameters. Among other contributions, our analysis shows that heterogeneity in the network weights facilitate controllability, and allows us to implement targeted interventions that profoundly improve controllability. By assuming an underlying dynamical mechanism, we are able to understand the complex topology of networked biological systems in a functionally meaningful way.

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.

minet: A R/Bioconductor package for inferring large transcriptional networks using mutual information.

PubMed

Meyer, Patrick E; Lafitte, Frédéric; Bontempi, Gianluca

2008-10-29

This paper presents the R/Bioconductor package minet (version 1.1.6) which provides a set of functions to infer mutual information networks from a dataset. Once fed with a microarray dataset, the package returns a network where nodes denote genes, edges model statistical dependencies between genes and the weight of an edge quantifies the statistical evidence of a specific (e.g transcriptional) gene-to-gene interaction. Four different entropy estimators are made available in the package minet (empirical, Miller-Madow, Schurmann-Grassberger and shrink) as well as four different inference methods, namely relevance networks, ARACNE, CLR and MRNET. Also, the package integrates accuracy assessment tools, like F-scores, PR-curves and ROC-curves in order to compare the inferred network with a reference one. The package minet provides a series of tools for inferring transcriptional networks from microarray data. It is freely available from the Comprehensive R Archive Network (CRAN) as well as from the Bioconductor website.

Small Molecules-Big Data.

PubMed

Császár, Attila G; Furtenbacher, Tibor; Árendás, Péter

2016-11-17

Quantum mechanics builds large-scale graphs (networks): the vertices are the discrete energy levels the quantum system possesses, and the edges are the (quantum-mechanically allowed) transitions. Parts of the complete quantum mechanical networks can be probed experimentally via high-resolution, energy-resolved spectroscopic techniques. The complete rovibronic line list information for a given molecule can only be obtained through sophisticated quantum-chemical computations. Experiments as well as computations yield what we call spectroscopic networks (SN). First-principles SNs of even small, three to five atomic molecules can be huge, qualifying for the big data description. Besides helping to interpret high-resolution spectra, the network-theoretical view offers several ideas for improving the accuracy and robustness of the increasingly important information systems containing line-by-line spectroscopic data. For example, the smallest number of measurements necessary to perform to obtain the complete list of energy levels is given by the minimum-weight spanning tree of the SN and network clustering studies may call attention to "weakest links" of a spectroscopic database. A present-day application of spectroscopic networks is within the MARVEL (Measured Active Rotational-Vibrational Energy Levels) approach, whereby the transitions information on a measured SN is turned into experimental energy levels via a weighted linear least-squares refinement. MARVEL has been used successfully for 15 molecules and allowed to validate most of the transitions measured and come up with energy levels with well-defined and realistic uncertainties. Accurate knowledge of the energy levels with computed transition intensities allows the realistic prediction of spectra under many different circumstances, e.g., for widely different temperatures. Detailed knowledge of the energy level structure of a molecule coming from a MARVEL analysis is important for a considerable number of modeling efforts in chemistry, physics, and engineering.

Local-world and cluster-growing weighted networks with controllable clustering

NASA Astrophysics Data System (ADS)

Yang, Chun-Xia; Tang, Min-Xuan; Tang, Hai-Qiang; Deng, Qiang-Qiang

2014-12-01

We constructed an improved weighted network model by introducing local-world selection mechanism and triangle coupling mechanism based on the traditional BBV model. The model gives power-law distributions of degree, strength and edge weight and presents the linear relationship both between the degree and strength and between the degree and the clustering coefficient. Particularly, the model is equipped with an ability to accelerate the speed increase of strength exceeding that of degree. Besides, the model is more sound and efficient in tuning clustering coefficient than the original BBV model. Finally, based on our improved model, we analyze the virus spread process and find that reducing the size of local-world has a great inhibited effect on virus spread.

Neural-network-based state feedback control of a nonlinear discrete-time system in nonstrict feedback form.

PubMed

Jagannathan, Sarangapani; He, Pingan

2008-12-01

In this paper, a suite of adaptive neural network (NN) controllers is designed to deliver a desired tracking performance for the control of an unknown, second-order, nonlinear discrete-time system expressed in nonstrict feedback form. In the first approach, two feedforward NNs are employed in the controller with tracking error as the feedback variable whereas in the adaptive critic NN architecture, three feedforward NNs are used. In the adaptive critic architecture, two action NNs produce virtual and actual control inputs, respectively, whereas the third critic NN approximates certain strategic utility function and its output is employed for tuning action NN weights in order to attain the near-optimal control action. Both the NN control methods present a well-defined controller design and the noncausal problem in discrete-time backstepping design is avoided via NN approximation. A comparison between the controller methodologies is highlighted. The stability analysis of the closed-loop control schemes is demonstrated. The NN controller schemes do not require an offline learning phase and the NN weights can be initialized at zero or random. Results show that the performance of the proposed controller schemes is highly satisfactory while meeting the closed-loop stability.

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.

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

Modeling Aircraft Wing Loads from Flight Data Using Neural Networks

NASA Technical Reports Server (NTRS)

Allen, Michael J.; Dibley, Ryan P.

2003-01-01

Neural networks were used to model wing bending-moment loads, torsion loads, and control surface hinge-moments of the Active Aeroelastic Wing (AAW) aircraft. Accurate loads models are required for the development of control laws designed to increase roll performance through wing twist while not exceeding load limits. Inputs to the model include aircraft rates, accelerations, and control surface positions. Neural networks were chosen to model aircraft loads because they can account for uncharacterized nonlinear effects while retaining the capability to generalize. The accuracy of the neural network models was improved by first developing linear loads models to use as starting points for network training. Neural networks were then trained with flight data for rolls, loaded reversals, wind-up-turns, and individual control surface doublets for load excitation. Generalization was improved by using gain weighting and early stopping. Results are presented for neural network loads models of four wing loads and four control surface hinge moments at Mach 0.90 and an altitude of 15,000 ft. An average model prediction error reduction of 18.6 percent was calculated for the neural network models when compared to the linear models. This paper documents the input data conditioning, input parameter selection, structure, training, and validation of the neural network models.

77 FR 53212 - Notice of Proposed Information Collection: Comment Request Strong Cities Strong Communities...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-31

... Information Collection: Comment Request Strong Cities Strong Communities National Resource Network AGENCY... National Resource Network. OMB Control Number, if applicable: 2528--Pending. Description of the need for... information related to the proposed Strong Cities Strong Communities National Resource Network. The U.S...

Discovering disease-associated genes in weighted protein-protein interaction networks

NASA Astrophysics Data System (ADS)

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

2018-04-01

Although there have been many network-based attempts to discover disease-associated genes, most of them have not taken edge weight - which quantifies their relative strength - into consideration. We use connection weights in a protein-protein interaction (PPI) network to locate disease-related genes. We analyze the topological properties of both weighted and unweighted PPI networks and design an improved random forest classifier to distinguish disease genes from non-disease genes. We use a cross-validation test to confirm that weighted networks are better able to discover disease-associated genes than unweighted networks, which indicates that including link weight in the analysis of network properties provides a better model of complex genotype-phenotype associations.

Cascade Error Projection with Low Bit Weight Quantization for High Order Correlation Data

NASA Technical Reports Server (NTRS)

Duong, Tuan A.; Daud, Taher

1998-01-01

In this paper, we reinvestigate the solution for chaotic time series prediction problem using neural network approach. The nature of this problem is such that the data sequences are never repeated, but they are rather in chaotic region. However, these data sequences are correlated between past, present, and future data in high order. We use Cascade Error Projection (CEP) learning algorithm to capture the high order correlation between past and present data to predict a future data using limited weight quantization constraints. This will help to predict a future information that will provide us better estimation in time for intelligent control system. In our earlier work, it has been shown that CEP can sufficiently learn 5-8 bit parity problem with 4- or more bits, and color segmentation problem with 7- or more bits of weight quantization. In this paper, we demonstrate that chaotic time series can be learned and generalized well with as low as 4-bit weight quantization using round-off and truncation techniques. The results show that generalization feature will suffer less as more bit weight quantization is available and error surfaces with the round-off technique are more symmetric around zero than error surfaces with the truncation technique. This study suggests that CEP is an implementable learning technique for hardware consideration.

Modeling and controlling the two-phase dynamics of the p53 network: a Boolean network approach

NASA Astrophysics Data System (ADS)

Lin, Guo-Qiang; Ao, Bin; Chen, Jia-Wei; Wang, Wen-Xu; Di, Zeng-Ru

2014-12-01

Although much empirical evidence has demonstrated that p53 plays a key role in tumor suppression, the dynamics and function of the regulatory network centered on p53 have not yet been fully understood. Here, we develop a Boolean network model to reproduce the two-phase dynamics of the p53 network in response to DNA damage. In particular, we map the fates of cells into two types of Boolean attractors, and we find that the apoptosis attractor does not exist for minor DNA damage, reflecting that the cell is reparable. As the amount of DNA damage increases, the basin of the repair attractor shrinks, accompanied by the rising of the apoptosis attractor and the expansion of its basin, indicating that the cell becomes more irreparable with more DNA damage. For severe DNA damage, the repair attractor vanishes, and the apoptosis attractor dominates the state space, accounting for the exclusive fate of death. Based on the Boolean network model, we explore the significance of links, in terms of the sensitivity of the two-phase dynamics, to perturbing the weights of links and removing them. We find that the links are either critical or ordinary, rather than redundant. This implies that the p53 network is irreducible, but tolerant of small mutations at some ordinary links, and this can be interpreted with evolutionary theory. We further devised practical control schemes for steering the system into the apoptosis attractor in the presence of DNA damage by pinning the state of a single node or perturbing the weight of a single link. Our approach offers insights into understanding and controlling the p53 network, which is of paramount importance for medical treatment and genetic engineering.

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.

Training a Network of Electronic Neurons for Control of a Mobile Robot

NASA Astrophysics Data System (ADS)

Vromen, T. G. M.; Steur, E.; Nijmeijer, H.

An adaptive training procedure is developed for a network of electronic neurons, which controls a mobile robot driving around in an unknown environment while avoiding obstacles. The neuronal network controls the angular velocity of the wheels of the robot based on the sensor readings. The nodes in the neuronal network controller are clusters of neurons rather than single neurons. The adaptive training procedure ensures that the input-output behavior of the clusters is identical, even though the constituting neurons are nonidentical and have, in isolation, nonidentical responses to the same input. In particular, we let the neurons interact via a diffusive coupling, and the proposed training procedure modifies the diffusion interaction weights such that the neurons behave synchronously with a predefined response. The working principle of the training procedure is experimentally validated and results of an experiment with a mobile robot that is completely autonomously driving in an unknown environment with obstacles are presented.

Essential elements of online information networks on invasive alien species

USGS Publications Warehouse

Simpson, A.; Sellers, E.; Grosse, A.; Xie, Y.

2006-01-01

In order to be effective, information must be placed in the proper context and organized in a manner that is logical and (preferably) standardized. Recently, invasive alien species (IAS) scientists have begun to create online networks to share their information concerning IAS prevention and control. At a special networking session at the Beijing International Symposium on Biological Invasions, an online Eastern Asia-North American IAS Information Network (EA-NA Network) was proposed. To prepare for the development of this network, and to provide models for other regional collaborations, we compare four examples of global, regional, and national online IAS information networks: the Global Invasive Species Information Network, the Invasives Information Network of the Inter-American Biodiversity Information Network, the Chinese Species Information System, and the Invasive Species Information Node of the US National Biological Information Infrastructure. We conclude that IAS networks require a common goal, dedicated leaders, effective communication, and broad endorsement, in order to obtain sustainable, long-term funding and long-term stability. They need to start small, use the experience of other networks, partner with others, and showcase benefits. Global integration and synergy among invasive species networks will succeed with contributions from both the top-down and the bottom-up. ?? 2006 Springer.

Towards integrated crisis support of regional emergency networks.

PubMed

Caro, D H

1999-01-01

Emergency and crisis management pose multidimensional information systems challenges for communities across North America. In the quest to reduce mortality and morbidity risks and to increase the level of crisis preparedness, regional emergency management networks have evolved. Integrated Crisis Support Systems (ICSS) are enabling information technologies that assist emergency managers by enhancing the ability to strategically manage and control these regional emergency networks efficiently and effectively. This article underscores the ICCS development, control and leadership issues and their promising implications for regional emergency management networks.

The Contribution of Network Organization and Integration to the Development of Cognitive Control

PubMed Central

Marek, Scott; Hwang, Kai; Foran, William; Hallquist, Michael N.; Luna, Beatriz

2015-01-01

Abstract Cognitive control, which continues to mature throughout adolescence, is supported by the ability for well-defined organized brain networks to flexibly integrate information. However, the development of intrinsic brain network organization and its relationship to observed improvements in cognitive control are not well understood. In the present study, we used resting state functional magnetic resonance imaging (RS-fMRI), graph theory, the antisaccade task, and rigorous head motion control to characterize and relate developmental changes in network organization, connectivity strength, and integration to inhibitory control development. Subjects were 192 10–26-y-olds who were imaged during 5 min of rest. In contrast to initial studies, our results indicate that network organization is stable throughout adolescence. However, cross-network integration, predominantly of the cingulo-opercular/salience network, increased with age. Importantly, this increased integration of the cingulo-opercular/salience network significantly moderated the robust effect of age on the latency to initiate a correct inhibitory control response. These results provide compelling evidence that the transition to adult-level inhibitory control is dependent upon the refinement and strengthening of integration between specialized networks. Our findings support a novel, two-stage model of neural development, in which networks stabilize prior to adolescence and subsequently increase their integration to support the cross-domain incorporation of information processing critical for mature cognitive control. PMID:26713863

The Contribution of Network Organization and Integration to the Development of Cognitive Control.

PubMed

Marek, Scott; Hwang, Kai; Foran, William; Hallquist, Michael N; Luna, Beatriz

2015-12-01

Cognitive control, which continues to mature throughout adolescence, is supported by the ability for well-defined organized brain networks to flexibly integrate information. However, the development of intrinsic brain network organization and its relationship to observed improvements in cognitive control are not well understood. In the present study, we used resting state functional magnetic resonance imaging (RS-fMRI), graph theory, the antisaccade task, and rigorous head motion control to characterize and relate developmental changes in network organization, connectivity strength, and integration to inhibitory control development. Subjects were 192 10-26-y-olds who were imaged during 5 min of rest. In contrast to initial studies, our results indicate that network organization is stable throughout adolescence. However, cross-network integration, predominantly of the cingulo-opercular/salience network, increased with age. Importantly, this increased integration of the cingulo-opercular/salience network significantly moderated the robust effect of age on the latency to initiate a correct inhibitory control response. These results provide compelling evidence that the transition to adult-level inhibitory control is dependent upon the refinement and strengthening of integration between specialized networks. Our findings support a novel, two-stage model of neural development, in which networks stabilize prior to adolescence and subsequently increase their integration to support the cross-domain incorporation of information processing critical for mature cognitive control.

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

NetWall distributed firewall in the use of campus network

NASA Astrophysics Data System (ADS)

He, Junhua; Zhang, Pengshuai

2011-10-01

Internet provides a modern means of education but also non-mainstream consciousness and poor dissemination of information opens the door, network and moral issues have become prominent, poor dissemination of information and network spread rumors and negative effects of new problems, ideological and political education in schools had a huge impact, poses a severe challenge. This paper presents a distributed firewall will NetWall deployed in a campus network solution. The characteristics of the campus network, using technology to filter out bad information on the means of control, of sensitive information related to the record, establish a complete information security management platform for the campus network.

An information theory account of cognitive control

PubMed Central

Fan, Jin

2014-01-01

Our ability to efficiently process information and generate appropriate responses depends on the processes collectively called cognitive control. Despite a considerable focus in the literature on the cognitive control of information processing, neural mechanisms underlying control are still unclear, and have not been characterized by considering the quantity of information to be processed. A novel and comprehensive account of cognitive control is proposed using concepts from information theory, which is concerned with communication system analysis and the quantification of information. This account treats the brain as an information-processing entity where cognitive control and its underlying brain networks play a pivotal role in dealing with conditions of uncertainty. This hypothesis and theory article justifies the validity and properties of such an account and relates experimental findings to the frontoparietal network under the framework of information theory. PMID:25228875

PeerShield: determining control and resilience criticality of collaborative cyber assets in networks

NASA Astrophysics Data System (ADS)

Cam, Hasan

2012-06-01

As attackers get more coordinated and advanced in cyber attacks, cyber assets are required to have much more resilience, control effectiveness, and collaboration in networks. Such a requirement makes it essential to take a comprehensive and objective approach for measuring the individual and relative performances of cyber security assets in network nodes. To this end, this paper presents four techniques as to how the relative importance of cyber assets can be measured more comprehensively and objectively by considering together the main variables of risk assessment (e.g., threats, vulnerabilities), multiple attributes (e.g., resilience, control, and influence), network connectivity and controllability among collaborative cyber assets in networks. In the first technique, a Bayesian network is used to include the random variables for control, recovery, and resilience attributes of nodes, in addition to the random variables of threats, vulnerabilities, and risk. The second technique shows how graph matching and coloring can be utilized to form collaborative pairs of nodes to shield together against threats and vulnerabilities. The third technique ranks the security assets of nodes by incorporating multiple weights and thresholds of attributes into a decision-making algorithm. In the fourth technique, the hierarchically well-separated tree is enhanced to first identify critical nodes of a network with respect to their attributes and network connectivity, and then selecting some nodes as driver nodes for network controllability.

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.

Active Computer Network Defense: An Assessment

DTIC Science & Technology

2001-04-01

sufficient base of knowledge in information technology can be assumed to be working on some form of computer network warfare, even if only defensive in...the Defense Information Infrastructure (DII) to attack. Transmission Control Protocol/ Internet Protocol (TCP/IP) networks are inherently resistant to...aims to create this part of information superiority, and computer network defense is one of its fundamental components. Most of these efforts center

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.

Hedonic and incentive signals for body weight control.

PubMed

Egecioglu, Emil; Skibicka, Karolina P; Hansson, Caroline; Alvarez-Crespo, Mayte; Friberg, P Anders; Jerlhag, Elisabet; Engel, Jörgen A; Dickson, Suzanne L

2011-09-01

Here we review the emerging neurobiological understanding of the role of the brain's reward system in the regulation of body weight in health and in disease. Common obesity is characterized by the over-consumption of palatable/rewarding foods, reflecting an imbalance in the relative importance of hedonic versus homeostatic signals. The popular 'incentive salience theory' of food reward recognises not only a hedonic/pleasure component ('liking') but also an incentive motivation component ('wanting' or 'reward-seeking'). Central to the neurobiology of the reward mechanism is the mesoaccumbal dopamine system that confers incentive motivation not only for natural rewards such as food but also by artificial rewards (eg. addictive drugs). Indeed, this mesoaccumbal dopamine system receives and integrates information about the incentive (rewarding) value of foods with information about metabolic status. Problematic over-eating likely reflects a changing balance in the control exerted by hypothalamic versus reward circuits and/or it could reflect an allostatic shift in the hedonic set point for food reward. Certainly, for obesity to prevail, metabolic satiety signals such as leptin and insulin fail to regain control of appetitive brain networks, including those involved in food reward. On the other hand, metabolic control could reflect increased signalling by the stomach-derived orexigenic hormone, ghrelin. We have shown that ghrelin activates the mesoaccumbal dopamine system and that central ghrelin signalling is required for reward from both chemical drugs (eg alcohol) and also from palatable food. Future therapies for problematic over-eating and obesity may include drugs that interfere with incentive motivation, such as ghrelin antagonists.

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.

Understanding ITS/CVO Technology Applications, Student Manual, Course 3

DOT National Transportation Integrated Search

1999-01-01

WEIGHT-IN-MOTION OR WIM, COMMERCIAL VEHICLE INFORMATION SYSTEMS AND NETWORK OR CVISN, AUTOMATIC VEHICLE IDENTIFICATION OR AVI, AUTOMATIC LOCATION OR AVL, ELECTRONIC DATA INTERCHANGE OR EDI, GLOBAL POSITIONING SYSTEM OR GPS, INTERNET OR WORLD WIDE WEB...

Neural network computer simulation of medical aerosols.

PubMed

Richardson, C J; Barlow, D J

1996-06-01

Preliminary investigations have been conducted to assess the potential for using artificial neural networks to simulate aerosol behaviour, with a view to employing this type of methodology in the evaluation and design of pulmonary drug-delivery systems. Details are presented of the general purpose software developed for these tasks; it implements a feed-forward back-propagation algorithm with weight decay and connection pruning, the user having complete run-time control of the network architecture and mode of training. A series of exploratory investigations is then reported in which different network structures and training strategies are assessed in terms of their ability to simulate known patterns of fluid flow in simple model systems. The first of these involves simulations of cellular automata-generated data for fluid flow through a partially obstructed two-dimensional pipe. The artificial neural networks are shown to be highly successful in simulating the behaviour of this simple linear system, but with important provisos relating to the information content of the training data and the criteria used to judge when the network is properly trained. A second set of investigations is then reported in which similar networks are used to simulate patterns of fluid flow through aerosol generation devices, using training data furnished through rigorous computational fluid dynamics modelling. These more complex three-dimensional systems are modelled with equal success. It is concluded that carefully tailored, well trained networks could provide valuable tools not just for predicting but also for analysing the spatial dynamics of pharmaceutical aerosols.

Multifractal analysis and topological properties of a new family of weighted Koch networks

NASA Astrophysics Data System (ADS)

Huang, Da-Wen; Yu, Zu-Guo; Anh, Vo

2017-03-01

Weighted complex networks, especially scale-free networks, which characterize real-life systems better than non-weighted networks, have attracted considerable interest in recent years. Studies on the multifractality of weighted complex networks are still to be undertaken. In this paper, inspired by the concepts of Koch networks and Koch island, we propose a new family of weighted Koch networks, and investigate their multifractal behavior and topological properties. We find some key topological properties of the new networks: their vertex cumulative strength has a power-law distribution; there is a power-law relationship between their topological degree and weight strength; the networks have a high weighted clustering coefficient of 0.41004 (which is independent of the scaling factor c) in the limit of large generation t; the second smallest eigenvalue μ2 and the maximum eigenvalue μn are approximated by quartic polynomials of the scaling factor c for the general Laplacian operator, while μ2 is approximately a quartic polynomial of c and μn= 1.5 for the normalized Laplacian operator. Then, we find that weighted koch networks are both fractal and multifractal, their fractal dimension is influenced by the scaling factor c. We also apply these analyses to six real-world networks, and find that the multifractality in three of them are strong.

Association between quality domains and health care spending across physician networks

PubMed Central

Rahman, Farah; Guan, Jun; Glazier, Richard H.; Brown, Adalsteinn; Bierman, Arlene S.; Croxford, Ruth; Stukel, Therese A.

2018-01-01

One of the more fundamental health policy questions is the relationship between health care quality and spending. A better understanding of these relationships is needed to inform health systems interventions aimed at increasing quality and efficiency of care. We measured 65 validated quality indicators (QI) across Ontario physician networks. QIs were aggregated into domains representing six dimensions of care: screening and prevention, evidence-based medications, hospital-community transitions (7-day post-discharge visit with a primary care physician; 30-day post-discharge visit with a primary care physician and specialist), potentially avoidable hospitalizations and emergency department (ED) visits, potentially avoidable readmissions and unplanned returns to the ED, and poor cancer end of life care. Each domain rate was computed as a weighted average of QI rates, weighting by network population at risk. We also measured overall and sector-specific per capita healthcare network spending. We evaluated the associations between domain rates, and between domain rates and spending using weighted correlations, weighting by network population at risk, using an ecological design. All indicators were measured using Ontario health administrative databases. Large variations were seen in timely hospital-community transitions and potentially avoidable hospitalizations. Networks with timely hospital-community transitions had lower rates of avoidable admissions and readmissions (r = -0.89, -0.58, respectively). Higher physician spending, especially outpatient primary care spending, was associated with lower rates of avoidable hospitalizations (r = -0.83) and higher rates of timely hospital-community transitions (r = 0.81) and moderately associated with lower readmission rates (r = -0.46). Investment in effective primary care services may help reduce burden on the acute care sector and associated expenditures. PMID:29614131

A fuzzy call admission control scheme in wireless networks

NASA Astrophysics Data System (ADS)

Ma, Yufeng; Gong, Shenguang; Hu, Xiulin; Zhang, Yunyu

2007-11-01

Scarcity of the spectrum resource and mobility of users make quality of service (QoS) provision a critical issue in wireless networks. This paper presents a fuzzy call admission control scheme to meet the requirement of the QoS. A performance measure is formed as a weighted linear function of new call and handoff call blocking probabilities. Simulation compares the proposed fuzzy scheme with an adaptive channel reservation scheme. Simulation results show that fuzzy scheme has a better robust performance in terms of average blocking criterion.

Calorie Labels on the Restaurant Menu: Is the Use of Weight-Control Behaviors Related to Ordering Decisions?

PubMed

Larson, Nicole; Haynos, Ann F; Roberto, Christina A; Loth, Katie A; Neumark-Sztainer, Dianne

2018-03-01

There is emerging evidence that calorie information on restaurant menus does not similarly influence the ordering decisions of all population groups and may have unintended consequences for individuals who struggle with disordered eating or other weight-related concerns. This study describes demographic patterns in the use of calorie information on restaurant menus and investigates relationships between using this information to limit calorie intake and measures of restaurant visit frequency and weight-related concerns and behavior. There were 788 men and 1042 women (mean age=31.0±1.6 years) who participated in the fourth wave of the Project EAT study. Participants were initially recruited from Minneapolis-St Paul, MN, schools and completed EAT-IV surveys online or by mail from 2015 to 2016. Participants self-reported weight-related concerns, restaurant eating, intuitive eating, dieting, healthy (eg, exercise) and unhealthy (eg, use of laxatives) weight-control behaviors, and binge eating. Descriptive statistics and linear and logistic regression models accounting for demographics and weight status. Approximately half of participants (52.7%) reported they had noticed calorie information while purchasing a meal or snack in a restaurant within the previous month. Among individuals who noticed calorie information, 38.2% reported they did not use it in deciding what to order. The most common use of calorie information was to avoid high-calorie menu items (50.1%) or to decide on a smaller portion (20.2%). Using menu labels to limit calories was related to binge eating among women and was associated with more weight-related concerns, dieting, and unhealthy weight-control behaviors among both women and men. Nutrition educators and other health care professionals should talk with clients who struggle with disordered eating or weight-related concerns to learn about their use of calorie information at restaurants, address any potential unintended consequences, and promote healthy uses of calorie information. Copyright © 2018 Academy of Nutrition and Dietetics. Published by Elsevier Inc. All rights reserved.

76 FR 12998 - Proposed Information Collection Renewals

Federal Register 2010, 2011, 2012, 2013, 2014

2011-03-09

... information are offering to assist, mentor or network for jobs. 3. OMB Control Number: 0420-0533. Old Title... information are offering to assist, mentor or network for jobs. Dated: March 3, 2011. Earl W. Yates, Associate...

The Social Side of Information Networking.

ERIC Educational Resources Information Center

Katz, James E.

1997-01-01

Explores the social issues, including manners, security, crime (fraud), and social control associated with information networking, with emphasis on the Internet. Also addresses the influence of cellular phones, the Internet and other information technologies on society. (GR)

Toward Privacy-preserving Content Access Control for Information Centric Networking

DTIC Science & Technology

2014-03-01

REPORT Toward Privacy-preserving Content Access Control for Information Centric Networking 14. ABSTRACT 16. SECURITY CLASSIFICATION OF: Information...regardless the security mechanisms provided by different content hosting servers. However, using ABE has a drawback that the enforced content access...Encryption (ABE) is a flexible approach to enforce the content access policies regardless the security mechanisms provided by different content hosting

Interactogeneous: Disease Gene Prioritization Using Heterogeneous Networks and Full Topology Scores

PubMed Central

Gonçalves, Joana P.; Francisco, Alexandre P.; Moreau, Yves; Madeira, Sara C.

2012-01-01

Disease gene prioritization aims to suggest potential implications of genes in disease susceptibility. Often accomplished in a guilt-by-association scheme, promising candidates are sorted according to their relatedness to known disease genes. Network-based methods have been successfully exploiting this concept by capturing the interaction of genes or proteins into a score. Nonetheless, most current approaches yield at least some of the following limitations: (1) networks comprise only curated physical interactions leading to poor genome coverage and density, and bias toward a particular source; (2) scores focus on adjacencies (direct links) or the most direct paths (shortest paths) within a constrained neighborhood around the disease genes, ignoring potentially informative indirect paths; (3) global clustering is widely applied to partition the network in an unsupervised manner, attributing little importance to prior knowledge; (4) confidence weights and their contribution to edge differentiation and ranking reliability are often disregarded. We hypothesize that network-based prioritization related to local clustering on graphs and considering full topology of weighted gene association networks integrating heterogeneous sources should overcome the above challenges. We term such a strategy Interactogeneous. We conducted cross-validation tests to assess the impact of network sources, alternative path inclusion and confidence weights on the prioritization of putative genes for 29 diseases. Heat diffusion ranking proved the best prioritization method overall, increasing the gap to neighborhood and shortest paths scores mostly on single source networks. Heterogeneous associations consistently delivered superior performance over single source data across the majority of methods. Results on the contribution of confidence weights were inconclusive. Finally, the best Interactogeneous strategy, heat diffusion ranking and associations from the STRING database, was used to prioritize genes for Parkinson’s disease. This method effectively recovered known genes and uncovered interesting candidates which could be linked to pathogenic mechanisms of the disease. PMID:23185389

Shareholding relationships in the Euro Area banking market: A network perspective

NASA Astrophysics Data System (ADS)

Pecora, Nicolò; Spelta, Alessandro

2015-09-01

In this paper we analyze the topological properties of the network of the Euro Area banking market network, with the primary aim of assessing the importance of a bank in the financial system with respect to ownership and control of other credit institutions. The network displays power law distributions in both binary and weighted degree metrics indicating a robust yet fragile structure and a direct link between an increase of control diversification and a rise in the market power. Therefore while in good time the network is seemingly robust, in bad times many banks can simultaneously go into distress. This behavior paves the way for Central bank's actions. In particular we investigate whether the Single Supervisory Mechanism introduced by the European Central Banks and based on banks' total asset is a good proxy to quantify their systemic importance. Results indicate that not all the financial institutions with high valued total assets are systemically important but only few of them. Moreover the network structure reveals that control is highly concentrated, with few important shareholders approximately controlling a separate subset of banks.

Stabilization of model-based networked control systems

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

Miranda, Francisco; Instituto Politécnico de Viana do Castelo, Viana do Castelo; Abreu, Carlos

2016-06-08

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

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.

Prediction of successful weight reduction after laparoscopic adjustable gastric banding.

PubMed

Lee, Yi-Chih; Liew, Phui-Ly; Lee, Wei-Jei; Lin, Yang-Chu; Lee, Chia Ko; Huangs, Ming-Te; Wang, Weu; Lin, Steven C H

2009-01-01

Compared with conventional pharmacological therapies, bariatric surgery has been shown to cause greater and- sustained weight loss. It was aimed to evaluate weight loss in obese patients after laparoscopic adjustable gastric banding surgery using information typically available during the initial evaluation studied before bariatric surgery and genes. 74 patients undergoing laparoscopic adjustable gastric banding (LAGB) were enrolled. Artificial Neural Network technology was used to predict weight loss. We studied 74 patients consisting of 22 men and 52 women 2 years after operation. Mean age was 31.7 +/- 9.1 years. 27 (36.5%) patients had successful weight reduction (excess weight loss >50%) while 47 (63.5%) did not. ANN provided predicted factors on gender, insulin, albumin and two genes: re4684846_r, rs660339_r which were associated with success. Artificial neural network is a better modeling technique and the predictive accuracy is higher on the basis of multiple variables related to laboratory tests. Our finding gave demonstrated result that obese patients of successful weight reduction after laparoscopic adjustable gastric banding surgery were women, having little lower insulin and albumin, and carrying GG genotype on rs4684846 and with at least one T allele on rs660339. In these cases, weight loss will give better results.

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.

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.

An artificial neural network controller based on MPSO-BFGS hybrid optimization for spherical flying robot

NASA Astrophysics Data System (ADS)

Liu, Xiaolin; Li, Lanfei; Sun, Hanxu

2017-12-01

Spherical flying robot can perform various tasks in the complex and varied environment to reduce labor costs. However, it is difficult to guarantee the stability of the spherical flying robot in the case of strong coupling and time-varying disturbance. In this paper, an artificial neural network controller (ANNC) based on MPSO-BFGS hybrid optimization algorithm is proposed. The MPSO algorithm is used to optimize the initial weights of the controller to avoid the local optimal solution. The BFGS algorithm is introduced to improve the convergence ability of the network. We use Lyapunov method to analyze the stability of ANNC. The controller is simulated under the condition of nonlinear coupling disturbance. The experimental results show that the proposed controller can obtain the expected value in shoter time compared with the other considered methods.

Robust/optimal temperature profile control of a high-speed aerospace vehicle using neural networks.

PubMed

Yadav, Vivek; Padhi, Radhakant; Balakrishnan, S N

2007-07-01

An approximate dynamic programming (ADP)-based suboptimal neurocontroller to obtain desired temperature for a high-speed aerospace vehicle is synthesized in this paper. A 1-D distributed parameter model of a fin is developed from basic thermal physics principles. "Snapshot" solutions of the dynamics are generated with a simple dynamic inversion-based feedback controller. Empirical basis functions are designed using the "proper orthogonal decomposition" (POD) technique and the snapshot solutions. A low-order nonlinear lumped parameter system to characterize the infinite dimensional system is obtained by carrying out a Galerkin projection. An ADP-based neurocontroller with a dual heuristic programming (DHP) formulation is obtained with a single-network-adaptive-critic (SNAC) controller for this approximate nonlinear model. Actual control in the original domain is calculated with the same POD basis functions through a reverse mapping. Further contribution of this paper includes development of an online robust neurocontroller to account for unmodeled dynamics and parametric uncertainties inherent in such a complex dynamic system. A neural network (NN) weight update rule that guarantees boundedness of the weights and relaxes the need for persistence of excitation (PE) condition is presented. Simulation studies show that in a fairly extensive but compact domain, any desired temperature profile can be achieved starting from any initial temperature profile. Therefore, the ADP and NN-based controllers appear to have the potential to become controller synthesis tools for nonlinear distributed parameter systems.

Creating, generating and comparing random network models with NetworkRandomizer.

PubMed

Tosadori, Gabriele; Bestvina, Ivan; Spoto, Fausto; Laudanna, Carlo; Scardoni, Giovanni

2016-01-01

Biological networks are becoming a fundamental tool for the investigation of high-throughput data in several fields of biology and biotechnology. With the increasing amount of information, network-based models are gaining more and more interest and new techniques are required in order to mine the information and to validate the results. To fill the validation gap we present an app, for the Cytoscape platform, which aims at creating randomised networks and randomising existing, real networks. Since there is a lack of tools that allow performing such operations, our app aims at enabling researchers to exploit different, well known random network models that could be used as a benchmark for validating real, biological datasets. We also propose a novel methodology for creating random weighted networks, i.e. the multiplication algorithm, starting from real, quantitative data. Finally, the app provides a statistical tool that compares real versus randomly computed attributes, in order to validate the numerical findings. In summary, our app aims at creating a standardised methodology for the validation of the results in the context of the Cytoscape platform.

Comparison of gene co-networks reveals the molecular mechanisms of the rice (Oryza sativa L.) response to Rhizoctonia solani AG1 IA infection.

PubMed

Zhang, Jinfeng; Zhao, Wenjuan; Fu, Rong; Fu, Chenglin; Wang, Lingxia; Liu, Huainian; Li, Shuangcheng; Deng, Qiming; Wang, Shiquan; Zhu, Jun; Liang, Yueyang; Li, Ping; Zheng, Aiping

2018-05-05

Rhizoctonia solani causes rice sheath blight, an important disease affecting the growth of rice (Oryza sativa L.). Attempts to control the disease have met with little success. Based on transcriptional profiling, we previously identified more than 11,947 common differentially expressed genes (TPM > 10) between the rice genotypes TeQing and Lemont. In the current study, we extended these findings by focusing on an analysis of gene co-expression in response to R. solani AG1 IA and identified gene modules within the networks through weighted gene co-expression network analysis (WGCNA). We compared the different genes assigned to each module and the biological interpretations of gene co-expression networks at early and later modules in the two rice genotypes to reveal differential responses to AG1 IA. Our results show that different changes occurred in the two rice genotypes and that the modules in the two groups contain a number of candidate genes possibly involved in pathogenesis, such as the VQ protein. Furthermore, these gene co-expression networks provide comprehensive transcriptional information regarding gene expression in rice in response to AG1 IA. The co-expression networks derived from our data offer ideas for follow-up experimentation that will help advance our understanding of the translational regulation of rice gene expression changes in response to AG1 IA.

Systemic Risk Analysis on Reconstructed Economic and Financial Networks

PubMed Central

Cimini, Giulio; Squartini, Tiziano; Garlaschelli, Diego; Gabrielli, Andrea

2015-01-01

We address a fundamental problem that is systematically encountered when modeling real-world complex systems of societal relevance: the limitedness of the information available. In the case of economic and financial networks, privacy issues severely limit the information that can be accessed and, as a consequence, the possibility of correctly estimating the resilience of these systems to events such as financial shocks, crises and cascade failures. Here we present an innovative method to reconstruct the structure of such partially-accessible systems, based on the knowledge of intrinsic node-specific properties and of the number of connections of only a limited subset of nodes. This information is used to calibrate an inference procedure based on fundamental concepts derived from statistical physics, which allows to generate ensembles of directed weighted networks intended to represent the real system—so that the real network properties can be estimated as their average values within the ensemble. We test the method both on synthetic and empirical networks, focusing on the properties that are commonly used to measure systemic risk. Indeed, the method shows a remarkable robustness with respect to the limitedness of the information available, thus representing a valuable tool for gaining insights on privacy-protected economic and financial systems. PMID:26507849

Systemic Risk Analysis on Reconstructed Economic and Financial Networks

NASA Astrophysics Data System (ADS)

Cimini, Giulio; Squartini, Tiziano; Garlaschelli, Diego; Gabrielli, Andrea

2015-10-01

We address a fundamental problem that is systematically encountered when modeling real-world complex systems of societal relevance: the limitedness of the information available. In the case of economic and financial networks, privacy issues severely limit the information that can be accessed and, as a consequence, the possibility of correctly estimating the resilience of these systems to events such as financial shocks, crises and cascade failures. Here we present an innovative method to reconstruct the structure of such partially-accessible systems, based on the knowledge of intrinsic node-specific properties and of the number of connections of only a limited subset of nodes. This information is used to calibrate an inference procedure based on fundamental concepts derived from statistical physics, which allows to generate ensembles of directed weighted networks intended to represent the real system—so that the real network properties can be estimated as their average values within the ensemble. We test the method both on synthetic and empirical networks, focusing on the properties that are commonly used to measure systemic risk. Indeed, the method shows a remarkable robustness with respect to the limitedness of the information available, thus representing a valuable tool for gaining insights on privacy-protected economic and financial systems.

Gene regulatory network identification from the yeast cell cycle based on a neuro-fuzzy system.

PubMed

Wang, B H; Lim, J W; Lim, J S

2016-08-30

Many studies exist for reconstructing gene regulatory networks (GRNs). In this paper, we propose a method based on an advanced neuro-fuzzy system, for gene regulatory network reconstruction from microarray time-series data. This approach uses a neural network with a weighted fuzzy function to model the relationships between genes. Fuzzy rules, which determine the regulators of genes, are very simplified through this method. Additionally, a regulator selection procedure is proposed, which extracts the exact dynamic relationship between genes, using the information obtained from the weighted fuzzy function. Time-series related features are extracted from the original data to employ the characteristics of temporal data that are useful for accurate GRN reconstruction. The microarray dataset of the yeast cell cycle was used for our study. We measured the mean squared prediction error for the efficiency of the proposed approach and evaluated the accuracy in terms of precision, sensitivity, and F-score. The proposed method outperformed the other existing approaches.

Distributed weighted least-squares estimation with fast convergence for large-scale systems.

PubMed

Marelli, Damián Edgardo; Fu, Minyue

2015-01-01

In this paper we study a distributed weighted least-squares estimation problem for a large-scale system consisting of a network of interconnected sub-systems. Each sub-system is concerned with a subset of the unknown parameters and has a measurement linear in the unknown parameters with additive noise. The distributed estimation task is for each sub-system to compute the globally optimal estimate of its own parameters using its own measurement and information shared with the network through neighborhood communication. We first provide a fully distributed iterative algorithm to asymptotically compute the global optimal estimate. The convergence rate of the algorithm will be maximized using a scaling parameter and a preconditioning method. This algorithm works for a general network. For a network without loops, we also provide a different iterative algorithm to compute the global optimal estimate which converges in a finite number of steps. We include numerical experiments to illustrate the performances of the proposed methods.

Distributed weighted least-squares estimation with fast convergence for large-scale systems☆

PubMed Central

Marelli, Damián Edgardo; Fu, Minyue

2015-01-01

In this paper we study a distributed weighted least-squares estimation problem for a large-scale system consisting of a network of interconnected sub-systems. Each sub-system is concerned with a subset of the unknown parameters and has a measurement linear in the unknown parameters with additive noise. The distributed estimation task is for each sub-system to compute the globally optimal estimate of its own parameters using its own measurement and information shared with the network through neighborhood communication. We first provide a fully distributed iterative algorithm to asymptotically compute the global optimal estimate. The convergence rate of the algorithm will be maximized using a scaling parameter and a preconditioning method. This algorithm works for a general network. For a network without loops, we also provide a different iterative algorithm to compute the global optimal estimate which converges in a finite number of steps. We include numerical experiments to illustrate the performances of the proposed methods. PMID:25641976

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.

Controls of the U.S. Virtual Water Transfer Network

NASA Astrophysics Data System (ADS)

Garcia, S.; Mejia, A.

2017-12-01

A complex interplay of human and natural factors shape the economic geography of the U.S., operating through socioeconomic forces that drive the consumption, production, and exchange of commodities. The virtual water content of a commodity represents the water embedded in its production. This work investigates the controls of national bilateral transfers of the virtual water transfer network (VWTN), through a gravity-type spatial interaction model. We use a probabilistic model to predict the binary network and investigate whether the gravity model can explain the topological properties of the empirical weighted network. In general, the gravity model relates transfer flows to the mass of the trading regions and their geographical distance. We hypothesize that properties of the nodes such as population, employment, and availability of land, together with the Euclidean distance between two trading regions, capture the main drivers of the national VWTN. The results from the model are then compared to the empirical weighted network to verify its ability to model the structure of this self-organized system. The proposed empirical model provides insight into the processes that underlie the formation of the VWTN. It can be a promising tool to study how flows are affected by changes in the generating conditions due to shocks and/or stresses.

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.

Quality of service policy control in virtual private networks

NASA Astrophysics Data System (ADS)

Yu, Yiqing; Wang, Hongbin; Zhou, Zhi; Zhou, Dongru

2004-04-01

This paper studies the QoS of VPN in an environment where the public network prices connection-oriented services based on source, destination and grade of service, and advertises these prices to its VPN customers (users). As different QoS technologies can produce different QoS, there are according different traffic classification rules and priority rules. The internet service provider (ISP) may need to build complex mechanisms separately for each node. In order to reduce the burden of network configuration, we need to design policy control technologies. We considers mainly directory server, policy server, policy manager and policy enforcers. Policy decision point (PDP) decide its control according to policy rules. In network, policy enforce point (PEP) decide its network controlled unit. For InterServ and DiffServ, we will adopt different policy control methods as following: (1) In InterServ, traffic uses resource reservation protocol (RSVP) to guarantee the network resource. (2) In DiffServ, policy server controls the DiffServ code points and per hop behavior (PHB), its PDP distributes information to each network node. Policy server will function as following: information searching; decision mechanism; decision delivering; auto-configuration. In order to prove the effectiveness of QoS policy control, we make the corrective simulation.

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.

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.

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.

Neural Networks For Demodulation Of Phase-Modulated Signals

NASA Technical Reports Server (NTRS)

Altes, Richard A.

1995-01-01

Hopfield neural networks proposed for demodulating quadrature phase-shift-keyed (QPSK) signals carrying digital information. Networks solve nonlinear integral equations prior demodulation circuits cannot solve. Consists of set of N operational amplifiers connected in parallel, with weighted feedback from output terminal of each amplifier to input terminals of other amplifiers. Used to solve signal processing problems. Implemented as analog very-large-scale integrated circuit that achieves rapid convergence. Alternatively, implemented as digital simulation of such circuit. Also used to improve phase estimation performance over that of phase-locked loop.

Co-scheduling of network resource provisioning and host-to-host bandwidth reservation on high-performance network and storage systems

DOEpatents

Yu, Dantong; Katramatos, Dimitrios; Sim, Alexander; Shoshani, Arie

2014-04-22

A cross-domain network resource reservation scheduler configured to schedule a path from at least one end-site includes a management plane device configured to monitor and provide information representing at least one of functionality, performance, faults, and fault recovery associated with a network resource; a control plane device configured to at least one of schedule the network resource, provision local area network quality of service, provision local area network bandwidth, and provision wide area network bandwidth; and a service plane device configured to interface with the control plane device to reserve the network resource based on a reservation request and the information from the management plane device. Corresponding methods and computer-readable medium are also disclosed.

Bicriteria Network Optimization Problem using Priority-based Genetic Algorithm

NASA Astrophysics Data System (ADS)

Gen, Mitsuo; Lin, Lin; Cheng, Runwei

Network optimization is being an increasingly important and fundamental issue in the fields such as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. In many applications, however, there are several criteria associated with traversing each edge of a network. For example, cost and flow measures are both important in the networks. As a result, there has been recent interest in solving Bicriteria Network Optimization Problem. The Bicriteria Network Optimization Problem is known a NP-hard. The efficient set of paths may be very large, possibly exponential in size. Thus the computational effort required to solve it can increase exponentially with the problem size in the worst case. In this paper, we propose a genetic algorithm (GA) approach used a priority-based chromosome for solving the bicriteria network optimization problem including maximum flow (MXF) model and minimum cost flow (MCF) model. The objective is to find the set of Pareto optimal solutions that give possible maximum flow with minimum cost. This paper also combines Adaptive Weight Approach (AWA) that utilizes some useful information from the current population to readjust weights for obtaining a search pressure toward a positive ideal point. Computer simulations show the several numerical experiments by using some difficult-to-solve network design problems, and show the effectiveness of the proposed method.

Efficient self-organizing multilayer neural network for nonlinear system modeling.

PubMed

Han, Hong-Gui; Wang, Li-Dan; Qiao, Jun-Fei

2013-07-01

It has been shown extensively that the dynamic behaviors of a neural system are strongly influenced by the network architecture and learning process. To establish an artificial neural network (ANN) with self-organizing architecture and suitable learning algorithm for nonlinear system modeling, an automatic axon-neural network (AANN) is investigated in the following respects. First, the network architecture is constructed automatically to change both the number of hidden neurons and topologies of the neural network during the training process. The approach introduced in adaptive connecting-and-pruning algorithm (ACP) is a type of mixed mode operation, which is equivalent to pruning or adding the connecting of the neurons, as well as inserting some required neurons directly. Secondly, the weights are adjusted, using a feedforward computation (FC) to obtain the information for the gradient during learning computation. Unlike most of the previous studies, AANN is able to self-organize the architecture and weights, and to improve the network performances. Also, the proposed AANN has been tested on a number of benchmark problems, ranging from nonlinear function approximating to nonlinear systems modeling. The experimental results show that AANN can have better performances than that of some existing neural networks. Crown Copyright © 2013. Published by Elsevier Ltd. All rights reserved.

MYSEA: The Monterey Security Architecture

DTIC Science & Technology

2009-01-01

Security and Protection, Organization and Design General Terms: Design; Security Keywords: access controls, authentication, information flow controls...Applicable environments include: mil- itary coalitions, agencies and organizations responding to security emergencies, and mandated sharing in business ...network architecture affords users the abil- ity to securely access information across networks at dif- ferent classifications using standardized

76 FR 25695 - Public Health Information Network (PHIN) Messaging Guide for Syndromic Surveillance

Federal Register 2010, 2011, 2012, 2013, 2014

2011-05-05

... DEPARTMENT OF HEALTH AND HUMAN SERVICES Centers for Disease Control and Prevention [Docket No. CDC-2011-0004] Public Health Information Network (PHIN) Messaging Guide for Syndromic Surveillance AGENCY: Centers for Disease Control and Prevention (CDC), Department of Health and Human Services (HHS). ACTION...

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

Analog hardware for delta-backpropagation neural networks

NASA Technical Reports Server (NTRS)

Eberhardt, Silvio P. (Inventor)

1992-01-01

This is a fully parallel analog backpropagation learning processor which comprises a plurality of programmable resistive memory elements serving as synapse connections whose values can be weighted during learning with buffer amplifiers, summing circuits, and sample-and-hold circuits arranged in a plurality of neuron layers in accordance with delta-backpropagation algorithms modified so as to control weight changes due to circuit drift.

Cyber-physical approach to the network-centric robotics control task

NASA Astrophysics Data System (ADS)

Muliukha, Vladimir; Ilyashenko, Alexander; Zaborovsky, Vladimir; Lukashin, Alexey

2016-10-01

Complex engineering tasks concerning control for groups of mobile robots are developed poorly. In our work for their formalization we use cyber-physical approach, which extends the range of engineering and physical methods for a design of complex technical objects by researching the informational aspects of communication and interaction between objects and with an external environment [1]. The paper analyzes network-centric methods for control of cyber-physical objects. Robots or cyber-physical objects interact with each other by transmitting information via computer networks using preemptive queueing system and randomized push-out mechanism [2],[3]. The main field of application for the results of our work is space robotics. The selection of cyber-physical systems as a special class of designed objects is due to the necessity of integrating various components responsible for computing, communications and control processes. Network-centric solutions allow using universal means for the organization of information exchange to integrate different technologies for the control system.

Containment control of networked autonomous underwater vehicles: A predictor-based neural DSC design.

PubMed

Peng, Zhouhua; Wang, Dan; Wang, Wei; Liu, Lu

2015-11-01

This paper investigates the containment control problem of networked autonomous underwater vehicles in the presence of model uncertainty and unknown ocean disturbances. A predictor-based neural dynamic surface control design method is presented to develop the distributed adaptive containment controllers, under which the trajectories of follower vehicles nearly converge to the dynamic convex hull spanned by multiple reference trajectories over a directed network. Prediction errors, rather than tracking errors, are used to update the neural adaptation laws, which are independent of the tracking error dynamics, resulting in two time-scales to govern the entire system. The stability property of the closed-loop network is established via Lyapunov analysis, and transient property is quantified in terms of L2 norms of the derivatives of neural weights, which are shown to be smaller than the classical neural dynamic surface control approach. Comparative studies are given to show the substantial improvements of the proposed new method. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Tracking state deployments of commercial vehicle information systems and networks : 1998 Iowa state report

DOT National Transportation Integrated Search

2000-09-01

There is no available measurement of weight limit compliance sufficiently comprehensive to permit determination of actual penalty effectiveness within different States. The approach used for this study was to conduct discussions with enforcement offi...

Effects of temptations on the affective salience of weight control goals.

PubMed

Palfai, Tibor P; Macdonald, Alexandra

2007-03-01

Despite the value of weight control goals, the maintenance of healthy eating habits represents a challenge for most. Self-regulatory efforts are often challenged by the presence of high-risk cues (e.g., tempting foods) which provide short-term positive outcomes at the expense of these long-term health objectives. The current study examined contextual influences on self-regulation failure by exploring the effect of cues on an indirect measure of goal value. Two experiments were conducted with undergraduate students which examined the effect of temptation cues on the evaluation of information related to the goal of weight control. Results of Study 1 provided preliminary evidence for the utility of this task as an indirect measure of goal value and showed that food-related primes slowed evaluation response times for weight control-related targets. Study 2 replicated and extended these findings by demonstrating that temptation cues may not only decrease the affective salience of weight control related information but increase the salience of information related to the goal of affect enhancement. These results suggest that self-regulation failure may be influenced by contextual changes in the value of health-related goals. Implications for prevention and intervention efforts are discussed.

Does the Superior Colliculus Control Perceptual Sensitivity or Choice Bias during Attention? Evidence from a Multialternative Decision Framework.

PubMed

Sridharan, Devarajan; Steinmetz, Nicholas A; Moore, Tirin; Knudsen, Eric I

2017-01-18

Distinct networks in the forebrain and the midbrain coordinate to control spatial attention. The critical involvement of the superior colliculus (SC)-the central structure in the midbrain network-in visuospatial attention has been shown by four seminal, published studies in monkeys (Macaca mulatta) performing multialternative tasks. However, due to the lack of a mechanistic framework for interpreting behavioral data in such tasks, the nature of the SC's contribution to attention remains unclear. Here we present and validate a novel decision framework for analyzing behavioral data in multialternative attention tasks. We apply this framework to re-examine the behavioral evidence from these published studies. Our model is a multidimensional extension to signal detection theory that distinguishes between two major classes of attentional mechanisms: those that alter the quality of sensory information or "sensitivity," and those that alter the selective gating of sensory information or "choice bias." Model-based simulations and model-based analyses of data from these published studies revealed a converging pattern of results that indicated that choice-bias changes, rather than sensitivity changes, were the primary outcome of SC manipulation. Our results suggest that the SC contributes to attentional performance predominantly by generating a spatial choice bias for stimuli at a selected location, and that this bias operates downstream of forebrain mechanisms that enhance sensitivity. The findings lead to a testable mechanistic framework of how the midbrain and forebrain networks interact to control spatial attention. Attention involves the selection of the most relevant information for differential sensory processing and decision making. While the mechanisms by which attention alters sensory encoding (sensitivity control) are well studied, the mechanisms by which attention alters decisional weighting of sensory evidence (choice-bias control) are poorly understood. Here, we introduce a model of multialternative decision making that distinguishes bias from sensitivity effects in attention tasks. With our model, we simulate experimental data from four seminal studies that microstimulated or inactivated a key attention-related midbrain structure, the superior colliculus (SC). We demonstrate that the experimental effects of SC manipulation are entirely consistent with the SC controlling attention by changing choice bias, thereby shedding new light on how the brain mediates attention. Copyright © 2017 the authors 0270-6474/17/370480-32$15.00/0.

Controllability of social networks and the strategic use of random information.

PubMed

Cremonini, Marco; Casamassima, Francesca

2017-01-01

This work is aimed at studying realistic social control strategies for social networks based on the introduction of random information into the state of selected driver agents. Deliberately exposing selected agents to random information is a technique already experimented in recommender systems or search engines, and represents one of the few options for influencing the behavior of a social context that could be accepted as ethical, could be fully disclosed to members, and does not involve the use of force or of deception. Our research is based on a model of knowledge diffusion applied to a time-varying adaptive network and considers two well-known strategies for influencing social contexts: One is the selection of few influencers for manipulating their actions in order to drive the whole network to a certain behavior; the other, instead, drives the network behavior acting on the state of a large subset of ordinary, scarcely influencing users. The two approaches have been studied in terms of network and diffusion effects. The network effect is analyzed through the changes induced on network average degree and clustering coefficient, while the diffusion effect is based on two ad hoc metrics which are defined to measure the degree of knowledge diffusion and skill level, as well as the polarization of agent interests. The results, obtained through simulations on synthetic networks, show a rich dynamics and strong effects on the communication structure and on the distribution of knowledge and skills. These findings support our hypothesis that the strategic use of random information could represent a realistic approach to social network controllability, and that with both strategies, in principle, the control effect could be remarkable.

A biologically inspired neural network for dynamic programming.

PubMed

Francelin Romero, R A; Kacpryzk, J; Gomide, F

2001-12-01

An artificial neural network with a two-layer feedback topology and generalized recurrent neurons, for solving nonlinear discrete dynamic optimization problems, is developed. A direct method to assign the weights of neural networks is presented. The method is based on Bellmann's Optimality Principle and on the interchange of information which occurs during the synaptic chemical processing among neurons. The neural network based algorithm is an advantageous approach for dynamic programming due to the inherent parallelism of the neural networks; further it reduces the severity of computational problems that can occur in methods like conventional methods. Some illustrative application examples are presented to show how this approach works out including the shortest path and fuzzy decision making problems.

Quantifying networks complexity from information geometry viewpoint

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

Felice, Domenico, E-mail: domenico.felice@unicam.it; Mancini, Stefano; INFN-Sezione di Perugia, Via A. Pascoli, I-06123 Perugia

We consider a Gaussian statistical model whose parameter space is given by the variances of random variables. Underlying this model we identify networks by interpreting random variables as sitting on vertices and their correlations as weighted edges among vertices. We then associate to the parameter space a statistical manifold endowed with a Riemannian metric structure (that of Fisher-Rao). Going on, in analogy with the microcanonical definition of entropy in Statistical Mechanics, we introduce an entropic measure of networks complexity. We prove that it is invariant under networks isomorphism. Above all, considering networks as simplicial complexes, we evaluate this entropy onmore » simplexes and find that it monotonically increases with their dimension.« less

Modeling the controllable pH-responsive swelling and pore size of networked alginate based biomaterials.

PubMed

Chan, Ariel W; Neufeld, Ronald J

2009-10-01

Semisynthetic network alginate polymer (SNAP), synthesized by acetalization of linear alginate with di-aldehyde, is a pH-responsive tetrafunctionally linked 3D gel network, and has potential application in oral delivery of protein therapeutics and active biologicals, and as tissue bioscaffold for regenerative medicine. A constitutive polyelectrolyte gel model based on non-Gaussian polymer elasticity, Flory-Huggins liquid lattice theory, and non-ideal Donnan membrane equilibria was derived, to describe SNAP gel swelling in dilute and ionic solutions containing uni-univalent, uni-bivalent, bi-univalent or bi-bi-valent electrolyte solutions. Flory-Huggins interaction parameters as a function of ionic strength and characteristic ratio of alginates of various molecular weights were determined experimentally to numerically predict SNAP hydrogel swelling. SNAP hydrogel swells pronouncedly to 1000 times in dilute solution, compared to its compact polymer volume, while behaving as a neutral polymer with limited swelling in high ionic strength or low pH solutions. The derived model accurately describes the pH-responsive swelling of SNAP hydrogel in acid and alkaline solutions of wide range of ionic strength. The pore sizes of the synthesized SNAP hydrogels of various crosslink densities were estimated from the derived model to be in the range of 30-450 nm which were comparable to that measured by thermoporometry, and diffusion of bovine serum albumin. The derived equilibrium swelling model can characterize hydrogel structure such as molecular weight between crosslinks and crosslinking density, or can be used as predictive model for swelling, pore size and mechanical properties if gel structural information is known, and can potentially be applied to other point-link network polyelectrolytes such as hyaluronic acid gel.

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.

Overlapping community detection in weighted networks via a Bayesian approach

NASA Astrophysics Data System (ADS)

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

2017-02-01

Complex networks as a powerful way to represent complex systems have been widely studied during the past several years. One of the most important tasks of complex network analysis is to detect communities embedded in networks. In the real world, weighted networks are very common and may contain overlapping communities where a node is allowed to belong to multiple communities. In this paper, we propose a novel Bayesian approach, called the Bayesian mixture network (BMN) model, to detect overlapping communities in weighted networks. The advantages of our method are (i) providing soft-partition solutions in weighted networks; (ii) providing soft memberships, which quantify 'how strongly' a node belongs to a community. Experiments on a large number of real and synthetic networks show that our model has the ability in detecting overlapping communities in weighted networks and is competitive with other state-of-the-art models at shedding light on community partition.

Breaking news dissemination in the media via propagation behavior based on complex network theory

NASA Astrophysics Data System (ADS)

Liu, Nairong; An, Haizhong; Gao, Xiangyun; Li, Huajiao; Hao, Xiaoqing

2016-07-01

The diffusion of breaking news largely relies on propagation behaviors in the media. The tremendous and intricate propagation relationships in the media form a complex network. An improved understanding of breaking news diffusion characteristics can be obtained through the complex network research. Drawing on the news data of Bohai Gulf oil spill event from June 2011 to May 2014, we constructed a weighted and directed complex network in which media are set as nodes, the propagation relationships as edges and the propagation times as the weight of the edges. The primary results show (1) the propagation network presents small world feature, which means relations among media are close and breaking news originating from any node can spread rapidly; (2) traditional media and official websites are the typical sources for news propagation, while business portals are news collectors and spreaders; (3) the propagation network is assortative and the group of core media facilities the spread of breaking news faster; (4) for online media, news originality factor become less important to propagation behaviors. This study offers a new insight to explore information dissemination from the perspective of statistical physics and is beneficial for utilizing the public opinion in a positive way.

Towards a light-weight query engine for accessing health sensor data in a fall prevention system.

PubMed

Kreiner, Karl; Gossy, Christian; Drobics, Mario

2014-01-01

Connecting various sensors in sensor networks has become popular during the last decade. An important aspect next to storing and creating data is information access by domain experts, such as researchers, caretakers and physicians. In this work we present the design and prototypic implementation of a light-weight query engine using natural language processing for accessing health-related sensor data in a fall prevention system.

Postural Compensation for Unilateral Vestibular Loss

PubMed Central

Peterka, Robert J.; Statler, Kennyn D.; Wrisley, Diane M.; Horak, Fay B.

2011-01-01

Postural control of upright stance was investigated in well-compensated, unilateral vestibular loss (UVL) subjects compared to age-matched control subjects. The goal was to determine how sensory weighting for postural control in UVL subjects differed from control subjects, and how sensory weighting related to UVL subjects’ functional compensation, as assessed by standardized balance and dizziness questionnaires. Postural control mechanisms were identified using a model-based interpretation of medial–lateral center-of-mass body-sway evoked by support-surface rotational stimuli during eyes-closed stance. The surface-tilt stimuli consisted of continuous pseudorandom rotations presented at four different amplitudes. Parameters of a feedback control model were obtained that accounted for each subject’s sway response to the surface-tilt stimuli. Sensory weighting factors quantified the relative contributions to stance control of vestibular sensory information, signaling body-sway relative to earth-vertical, and proprioceptive information, signaling body-sway relative to the surface. Results showed that UVL subjects made significantly greater use of proprioceptive, and therefore less use of vestibular, orientation information on all tests. There was relatively little overlap in the distributions of sensory weights measured in UVL and control subjects, although UVL subjects varied widely in the amount they could use their remaining vestibular function. Increased reliance on proprioceptive information by UVL subjects was associated with their balance being more disturbed by the surface-tilt perturbations than control subjects, thus indicating a deficiency of balance control even in well-compensated UVL subjects. Furthermore, there was some tendency for UVL subjects who were less able to utilize remaining vestibular information to also indicate worse functional compensation on questionnaires. PMID:21922014

Neural network application to aircraft control system design

NASA Technical Reports Server (NTRS)

Troudet, Terry; Garg, Sanjay; Merrill, Walter C.

1991-01-01

The feasibility of using artificial neural networks as control systems for modern, complex aerospace vehicles is investigated via an example aircraft control design study. The problem considered is that of designing a controller for an integrated airframe/propulsion longitudinal dynamics model of a modern fighter aircraft to provide independent control of pitch rate and airspeed responses to pilot command inputs. An explicit model following controller using H infinity control design techniques is first designed to gain insight into the control problem as well as to provide a baseline for evaluation of the neurocontroller. Using the model of the desired dynamics as a command generator, a multilayer feedforward neural network is trained to control the vehicle model within the physical limitations of the actuator dynamics. This is achieved by minimizing an objective function which is a weighted sum of tracking errors and control input commands and rates. To gain insight in the neurocontrol, linearized representations of the nonlinear neurocontroller are analyzed along a commanded trajectory. Linear robustness analysis tools are then applied to the linearized neurocontroller models and to the baseline H infinity based controller. Future areas of research are identified to enhance the practical applicability of neural networks to flight control design.

Neural network application to aircraft control system design

NASA Technical Reports Server (NTRS)

Troudet, Terry; Garg, Sanjay; Merrill, Walter C.

1991-01-01

The feasibility of using artificial neural network as control systems for modern, complex aerospace vehicles is investigated via an example aircraft control design study. The problem considered is that of designing a controller for an integrated airframe/propulsion longitudinal dynamics model of a modern fighter aircraft to provide independent control of pitch rate and airspeed responses to pilot command inputs. An explicit model following controller using H infinity control design techniques is first designed to gain insight into the control problem as well as to provide a baseline for evaluation of the neurocontroller. Using the model of the desired dynamics as a command generator, a multilayer feedforward neural network is trained to control the vehicle model within the physical limitations of the actuator dynamics. This is achieved by minimizing an objective function which is a weighted sum of tracking errors and control input commands and rates. To gain insight in the neurocontrol, linearized representations of the nonlinear neurocontroller are analyzed along a commanded trajectory. Linear robustness analysis tools are then applied to the linearized neurocontroller models and to the baseline H infinity based controller. Future areas of research identified to enhance the practical applicability of neural networks to flight control design.

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.

a Weighted Local-World Evolving Network Model Based on the Edge Weights Preferential Selection

NASA Astrophysics Data System (ADS)

Li, Ping; Zhao, Qingzhen; Wang, Haitang

2013-05-01

In this paper, we use the edge weights preferential attachment mechanism to build a new local-world evolutionary model for weighted networks. It is different from previous papers that the local-world of our model consists of edges instead of nodes. Each time step, we connect a new node to two existing nodes in the local-world through the edge weights preferential selection. Theoretical analysis and numerical simulations show that the scale of the local-world affect on the weight distribution, the strength distribution and the degree distribution. We give the simulations about the clustering coefficient and the dynamics of infectious diseases spreading. The weight dynamics of our network model can portray the structure of realistic networks such as neural network of the nematode C. elegans and Online Social Network.

Integrating biological knowledge into variable selection: an empirical Bayes approach with an application in cancer biology

PubMed Central

2012-01-01

Background An important question in the analysis of biochemical data is that of identifying subsets of molecular variables that may jointly influence a biological response. Statistical variable selection methods have been widely used for this purpose. In many settings, it may be important to incorporate ancillary biological information concerning the variables of interest. Pathway and network maps are one example of a source of such information. However, although ancillary information is increasingly available, it is not always clear how it should be used nor how it should be weighted in relation to primary data. Results We put forward an approach in which biological knowledge is incorporated using informative prior distributions over variable subsets, with prior information selected and weighted in an automated, objective manner using an empirical Bayes formulation. We employ continuous, linear models with interaction terms and exploit biochemically-motivated sparsity constraints to permit exact inference. We show an example of priors for pathway- and network-based information and illustrate our proposed method on both synthetic response data and by an application to cancer drug response data. Comparisons are also made to alternative Bayesian and frequentist penalised-likelihood methods for incorporating network-based information. Conclusions The empirical Bayes method proposed here can aid prior elicitation for Bayesian variable selection studies and help to guard against mis-specification of priors. Empirical Bayes, together with the proposed pathway-based priors, results in an approach with a competitive variable selection performance. In addition, the overall procedure is fast, deterministic, and has very few user-set parameters, yet is capable of capturing interplay between molecular players. The approach presented is general and readily applicable in any setting with multiple sources of biological prior knowledge. PMID:22578440

Concurrent information affects response inhibition processes via the modulation of theta oscillations in cognitive control networks.

PubMed

Chmielewski, Witold X; Mückschel, Moritz; Dippel, Gabriel; Beste, Christian

2016-11-01

Inhibiting responses is a challenge, where the outcome (partly) depends on the situational context. In everyday situations, response inhibition performance might be altered when irrelevant input is presented simultaneously with the information relevant for response inhibition. More specifically, irrelevant concurrent information may either brace or interfere with response-relevant information, depending on whether these inputs are redundant or conflicting. The aim of this study is to investigate neurophysiological mechanisms and the network underlying such modulations using EEG beamforming as method. The results show that in comparison to a baseline condition without concurrent information, response inhibition performance can be aggravated or facilitated by manipulating the extent of conflict via concurrent input. This depends on whether the requirement for cognitive control is high, as in conflicting trials, or whether it is low, as in redundant trials. In line with this, the total theta frequency power decreases in a right hemispheric orbitofrontal response inhibition network including the SFG, MFG, and SMA, when concurrent redundant information facilitates response inhibition processes. Vice versa, theta activity in a left-hemispheric response inhibition network (i.e., SFG, MFG, and IFG) increases, when conflicting concurrent information compromises response inhibition processes. We conclude that concurrent information bi-directionally shifts response inhibition performance and modulates the network architecture underlying theta oscillations which are signaling different levels of the need for cognitive control.

An analog neural hardware implementation using charge-injection multipliers and neutron-specific gain control.

PubMed

Massengill, L W; Mundie, D B

1992-01-01

A neural network IC based on a dynamic charge injection is described. The hardware design is space and power efficient, and achieves massive parallelism of analog inner products via charge-based multipliers and spatially distributed summing buses. Basic synaptic cells are constructed of exponential pulse-decay modulation (EPDM) dynamic injection multipliers operating sequentially on propagating signal vectors and locally stored analog weights. Individually adjustable gain controls on each neutron reduce the effects of limited weight dynamic range. A hardware simulator/trainer has been developed which incorporates the physical (nonideal) characteristics of actual circuit components into the training process, thus absorbing nonlinearities and parametric deviations into the macroscopic performance of the network. Results show that charge-based techniques may achieve a high degree of neural density and throughput using standard CMOS processes.

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.

Program Manual for Producing Weight Scaling Conversion Tables

Treesearch

Gary L. Tyre; Clyde A. Fasick; Frank M. Riley; Frank O. Lege

1973-01-01

Three computer programs are presented which can be applied by individual firms to establish a weight-scaling information system, The first generates volume estimates from truckload weights for any combination of veneer, sawmill, and pulpwood volumes. The second provides quality-control information by tabulating differences between estimated volumes and observed check-...

Reduced rich-club connectivity is related to disability in primary progressive MS

PubMed Central

Hodecker, Sibylle; Cheng, Bastian; Wanke, Nadine; Young, Kim Lea; Hilgetag, Claus; Gerloff, Christian; Heesen, Christoph; Thomalla, Götz; Siemonsen, Susanne

2017-01-01

Objective: To investigate whether the structural connectivity of the brain's rich-club organization is altered in patients with primary progressive MS and whether such changes to this fundamental network feature are associated with disability measures. Methods: We recruited 37 patients with primary progressive MS and 21 healthy controls for an observational cohort study. Structural connectomes were reconstructed based on diffusion-weighted imaging data using probabilistic tractography and analyzed with graph theory. Results: We observed the same topological organization of brain networks in patients and controls. Consistent with the originally defined rich-club regions, we identified superior frontal, precuneus, superior parietal, and insular cortex in both hemispheres as rich-club nodes. Connectivity within the rich club was significantly reduced in patients with MS (p = 0.039). The extent of reduced rich-club connectivity correlated with clinical measurements of mobility (Kendall rank correlation coefficient τ = −0.20, p = 0.047), hand function (τ = −0.26, p = 0.014), and information processing speed (τ = −0.20, p = 0.049). Conclusions: In patients with primary progressive MS, the fundamental organization of the structural connectome in rich-club and peripheral nodes was preserved and did not differ from healthy controls. The proportion of rich-club connections was altered and correlated with disability measures. Thus, the rich-club organization of the brain may be a promising network phenotype for understanding the patterns and mechanisms of neurodegeneration in MS. PMID:28804744

Synchronization of Hierarchical Time-Varying Neural Networks Based on Asynchronous and Intermittent Sampled-Data Control.

PubMed

Xiong, Wenjun; Patel, Ragini; Cao, Jinde; Zheng, Wei Xing

In this brief, our purpose is to apply asynchronous and intermittent sampled-data control methods to achieve the synchronization of hierarchical time-varying neural networks. The asynchronous and intermittent sampled-data controllers are proposed for two reasons: 1) the controllers may not transmit the control information simultaneously and 2) the controllers cannot always exist at any time . The synchronization is then discussed for a kind of hierarchical time-varying neural networks based on the asynchronous and intermittent sampled-data controllers. Finally, the simulation results are given to illustrate the usefulness of the developed criteria.In this brief, our purpose is to apply asynchronous and intermittent sampled-data control methods to achieve the synchronization of hierarchical time-varying neural networks. The asynchronous and intermittent sampled-data controllers are proposed for two reasons: 1) the controllers may not transmit the control information simultaneously and 2) the controllers cannot always exist at any time . The synchronization is then discussed for a kind of hierarchical time-varying neural networks based on the asynchronous and intermittent sampled-data controllers. Finally, the simulation results are given to illustrate the usefulness of the developed criteria.

Infoseconomics: A Utility Model for Information Security

DTIC Science & Technology

2010-09-01

are stricter controls on the Secret network, and fewer people have access to it, meaning that breaches occur less frequently. Consider some perishable...decide whether to store and transmit the information on the Secret network or on the Confidential network. Traditionally, we would simply look at the...to be stored on the Secret network. But given that the information is perishable, maybe we can accept a temporary increased risk if this is outweighed

Using Hybrid Angle/Distance Information for Distributed Topology Control in Vehicular Sensor Networks

PubMed Central

Huang, Chao-Chi; Chiu, Yang-Hung; Wen, Chih-Yu

2014-01-01

In a vehicular sensor network (VSN), the key design issue is how to organize vehicles effectively, such that the local network topology can be stabilized quickly. In this work, each vehicle with on-board sensors can be considered as a local controller associated with a group of communication members. In order to balance the load among the nodes and govern the local topology change, a group formation scheme using localized criteria is implemented. The proposed distributed topology control method focuses on reducing the rate of group member change and avoiding the unnecessary information exchange. Two major phases are sequentially applied to choose the group members of each vehicle using hybrid angle/distance information. The operation of Phase I is based on the concept of the cone-based method, which can select the desired vehicles quickly. Afterwards, the proposed time-slot method is further applied to stabilize the network topology. Given the network structure in Phase I, a routing scheme is presented in Phase II. The network behaviors are explored through simulation and analysis in a variety of scenarios. The results show that the proposed mechanism is a scalable and effective control framework for VSNs. PMID:25350506

Accounting for trait architecture in genomic predictions of US Holstein cattle using a weighted realized relationship matrix.

PubMed

Tiezzi, Francesco; Maltecca, Christian

2015-04-02

Genomic BLUP (GBLUP) can predict breeding values for non-phenotyped individuals based on the identity-by-state genomic relationship matrix (G). The G matrix can be constructed from thousands of markers spread across the genome. The strongest assumption of G and consequently of GBLUP is that all markers contribute equally to the genetic variance of a trait. This assumption is violated for traits that are controlled by a small number of quantitative trait loci (QTL) or individual QTL with large effects. In this paper, we investigate the performance of using a weighted genomic relationship matrix (wG) that takes into consideration the genetic architecture of the trait in order to improve predictive ability for a wide range of traits. Multiple methods were used to calculate weights for several economically relevant traits in US Holstein dairy cattle. Predictive performance was tested by k-means cross-validation. Relaxing the GBLUP assumption of equal marker contribution by increasing the weight that is given to a specific marker in the construction of the trait-specific G resulted in increased predictive performance. The increase was strongest for traits that are controlled by a small number of QTL (e.g. fat and protein percentage). Furthermore, bias in prediction estimates was reduced compared to that resulting from the use of regular G. Even for traits with low heritability and lower general predictive performance (e.g. calving ease traits), weighted G still yielded a gain in accuracy. Genomic relationship matrices weighted by marker realized variance yielded more accurate and less biased predictions for traits regulated by few QTL. Genome-wide association analyses were used to derive marker weights for creating weighted genomic relationship matrices. However, this can be cumbersome and prone to low stability over generations because of erosion of linkage disequilibrium between markers and QTL. Future studies may include other sources of information, such as functional annotation and gene networks, to better exploit the genetic architecture of traits and produce more stable predictions.

Online Recorded Data-Based Composite Neural Control of Strict-Feedback Systems With Application to Hypersonic Flight Dynamics.

PubMed

Xu, Bin; Yang, Daipeng; Shi, Zhongke; Pan, Yongping; Chen, Badong; Sun, Fuchun

2017-09-25

This paper investigates the online recorded data-based composite neural control of uncertain strict-feedback systems using the backstepping framework. In each step of the virtual control design, neural network (NN) is employed for uncertainty approximation. In previous works, most designs are directly toward system stability ignoring the fact how the NN is working as an approximator. In this paper, to enhance the learning ability, a novel prediction error signal is constructed to provide additional correction information for NN weight update using online recorded data. In this way, the neural approximation precision is highly improved, and the convergence speed can be faster. Furthermore, the sliding mode differentiator is employed to approximate the derivative of the virtual control signal, and thus, the complex analysis of the backstepping design can be avoided. The closed-loop stability is rigorously established, and the boundedness of the tracking error can be guaranteed. Through simulation of hypersonic flight dynamics, the proposed approach exhibits better tracking performance.

Optical techniques to feed and control GaAs MMIC modules for phased array antenna applications

NASA Astrophysics Data System (ADS)

Bhasin, K. B.; Anzic, G.; Kunath, R. R.; Connolly, D. J.

A complex signal distribution system is required to feed and control GaAs monolithic microwave integrated circuits (MMICs) for phased array antenna applications above 20 GHz. Each MMIC module will require one or more RF lines, one or more bias voltage lines, and digital lines to provide a minimum of 10 bits of combined phase and gain control information. In a closely spaced array, the routing of these multiple lines presents difficult topology problems as well as a high probability of signal interference. To overcome GaAs MMIC phased array signal distribution problems optical fibers interconnected to monolithically integrated optical components with GaAs MMIC array elements are proposed as a solution. System architecture considerations using optical fibers are described. The analog and digital optical links to respectively feed and control MMIC elements are analyzed. It is concluded that a fiber optic network will reduce weight and complexity, and increase reliability and performance, but higher power will be required.

Optical techniques to feed and control GaAs MMIC modules for phased array antenna applications

NASA Technical Reports Server (NTRS)

Bhasin, K. B.; Anzic, G.; Kunath, R. R.; Connolly, D. J.

1986-01-01

A complex signal distribution system is required to feed and control GaAs monolithic microwave integrated circuits (MMICs) for phased array antenna applications above 20 GHz. Each MMIC module will require one or more RF lines, one or more bias voltage lines, and digital lines to provide a minimum of 10 bits of combined phase and gain control information. In a closely spaced array, the routing of these multiple lines presents difficult topology problems as well as a high probability of signal interference. To overcome GaAs MMIC phased array signal distribution problems optical fibers interconnected to monolithically integrated optical components with GaAs MMIC array elements are proposed as a solution. System architecture considerations using optical fibers are described. The analog and digital optical links to respectively feed and control MMIC elements are analyzed. It is concluded that a fiber optic network will reduce weight and complexity, and increase reliability and performance, but higher power will be required.

An intelligent sales forecasting system through integration of artificial neural networks and fuzzy neural networks with fuzzy weight elimination.

PubMed

Kuo, R J; Wu, P; Wang, C P

2002-09-01

Sales forecasting plays a very prominent role in business strategy. Numerous investigations addressing this problem have generally employed statistical methods, such as regression or autoregressive and moving average (ARMA). However, sales forecasting is very complicated owing to influence by internal and external environments. Recently, artificial neural networks (ANNs) have also been applied in sales forecasting since their promising performances in the areas of control and pattern recognition. However, further improvement is still necessary since unique circumstances, e.g. promotion, cause a sudden change in the sales pattern. Thus, this study utilizes a proposed fuzzy neural network (FNN), which is able to eliminate the unimportant weights, for the sake of learning fuzzy IF-THEN rules obtained from the marketing experts with respect to promotion. The result from FNN is further integrated with the time series data through an ANN. Both the simulated and real-world problem results show that FNN with weight elimination can have lower training error compared with the regular FNN. Besides, real-world problem results also indicate that the proposed estimation system outperforms the conventional statistical method and single ANN in accuracy.

Information disclosure and control on Facebook: are they two sides of the same coin or two different processes?

PubMed

Christofides, Emily; Muise, Amy; Desmarais, Serge

2009-06-01

Facebook, the popular social network site, is changing the nature of privacy and the consequences of information disclosure. Despite recent media reports regarding the negative consequences of disclosing information on social network sites such as Facebook, students are generally thought to be unconcerned about the potential costs of this disclosure. The current study explored undergraduate students' information disclosure and information control on Facebook and the personality factors that influence levels of disclosure and control. Participants in this online survey were 343 undergraduate students who were current users of Facebook. Results indicated that participants perceived that they disclosed more information about themselves on Facebook than in general, but participants also reported that information control and privacy were important to them. Participants were very likely to have posted information such as their birthday and e-mail address, and almost all had joined an online network. They were also very likely to post pictures such as a profile picture, pictures with friends, and even pictures at parties and drinking with friends. Contrary to expectations, information disclosure and information control were not significantly negatively correlated, and multiple regression analyses revealed that while disclosure was significantly predicted by the need for popularity, levels of trust and self-esteem predicted information control. Therefore, disclosure and control on Facebook are not as closely related as expected but rather are different processes that are affected by different aspects of personality. Implications of these findings and suggestions for future research are discussed.

AAAIC '88 - Aerospace Applications of Artificial Intelligence; Proceedings of the Fourth Annual Conference, Dayton, OH, Oct. 25-27, 1988. Volumes 1 2

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

Johnson, J.R.; Netrologic, Inc., San Diego, CA)

1988-01-01

Topics presented include integrating neural networks and expert systems, neural networks and signal processing, machine learning, cognition and avionics applications, artificial intelligence and man-machine interface issues, real time expert systems, artificial intelligence, and engineering applications. Also considered are advanced problem solving techniques, combinational optimization for scheduling and resource control, data fusion/sensor fusion, back propagation with momentum, shared weights and recurrency, automatic target recognition, cybernetics, optical neural networks.

Analysis of Informationization Construction of Business Financial Management under the Network Economy

NASA Astrophysics Data System (ADS)

Dong, Yahui; Zhang, Pengwei; Li, Wei

To strengthen the informationization construction of the financial management has great significance to the achievement of business management informationization, and under the network economic environment, it is an important task of the financial management that how to conduct informationization construction of traditional financial management to provide true, reliable and complete financial information system for the business managers. This paper thoroughly researches the problem of financial information orientation management (FIOM) by taking the method of combining theory with practice. This paper puts forward the thinking method of financial information management, makes the new contents of E-finance. At last, this paper rebuilds the system of finance internal control from four aspects such as control of organization and management, system development control and safety control of network system.

Prediction of potential disease-associated microRNAs based on random walk.

PubMed

Xuan, Ping; Han, Ke; Guo, Yahong; Li, Jin; Li, Xia; Zhong, Yingli; Zhang, Zhaogong; Ding, Jian

2015-06-01

Identifying microRNAs associated with diseases (disease miRNAs) is helpful for exploring the pathogenesis of diseases. Because miRNAs fulfill function via the regulation of their target genes and because the current number of experimentally validated targets is insufficient, some existing methods have inferred potential disease miRNAs based on the predicted targets. It is difficult for these methods to achieve excellent performance due to the high false-positive and false-negative rates for the target prediction results. Alternatively, several methods have constructed a network composed of miRNAs based on their associated diseases and have exploited the information within the network to predict the disease miRNAs. However, these methods have failed to take into account the prior information regarding the network nodes and the respective local topological structures of the different categories of nodes. Therefore, it is essential to develop a method that exploits the more useful information to predict reliable disease miRNA candidates. miRNAs with similar functions are normally associated with similar diseases and vice versa. Therefore, the functional similarity between a pair of miRNAs is calculated based on their associated diseases to construct a miRNA network. We present a new prediction method based on random walk on the network. For the diseases with some known related miRNAs, the network nodes are divided into labeled nodes and unlabeled nodes, and the transition matrices are established for the two categories of nodes. Furthermore, different categories of nodes have different transition weights. In this way, the prior information of nodes can be completely exploited. Simultaneously, the various ranges of topologies around the different categories of nodes are integrated. In addition, how far the walker can go away from the labeled nodes is controlled by restarting the walking. This is helpful for relieving the negative effect of noisy data. For the diseases without any known related miRNAs, we extend the walking on a miRNA-disease bilayer network. During the prediction process, the similarity between diseases, the similarity between miRNAs, the known miRNA-disease associations and the topology information of the bilayer network are exploited. Moreover, the importance of information from different layers of network is considered. Our method achieves superior performance for 18 human diseases with AUC values ranging from 0.786 to 0.945. Moreover, case studies on breast neoplasms, lung neoplasms, prostatic neoplasms and 32 diseases further confirm the ability of our method to discover potential disease miRNAs. A web service for the prediction and analysis of disease miRNAs is available at http://bioinfolab.stx.hk/midp/. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

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.

Vaping to lose weight: Predictors of adult e-cigarette use for weight loss or control.

PubMed

Morean, Meghan E; Wedel, Amelia V

2017-03-01

Some traditional cigarette smokers are motivated to smoke to lose weight or control their weight. The current study evaluated whether a subset of adult e-cigarette users reported vaping to lose or control their weight and examined potential predictors of vaping for weight management. Adult e-cigarette users (n=459) who reported wanting to lose weight or maintain their weight completed an anonymous online survey. Participants reported on demographics, vaping frequency, e-cigarette nicotine content, cigarette smoking status, preferred e-cigarette/e-liquid flavors, current weight status (i.e., overweight, underweight), use of dieting strategies associated with anorexia and bulimia, lifetime history of binge eating, self-discipline, and impulse control. Binary logistic regression was used to examine whether vaping for weight loss/control was associated with the aforementioned variables. Participants who reported vaping for weight loss/control (13.5%) were more likely to vape frequently (adjOR=1.15; 95% CI [1.00, 1.31]); be overweight (adjOR=2.80; [1.33, 5.90]); restrict calories (adjOR=2.23; [1.13, 4.42]); have poor impulse control (adjOR=0.59; [0.41, 0.86]); and prefer coffee- (adjOR=2.92; [1.47, 5.80]) or vanilla-flavored e-liquid (adjOR=7.44; [1.56, 36.08]). A subset of adult e-cigarette users reported vaping for weight loss/control, raising concerns about expanded, scientifically unsubstantiated uses of e-cigarettes. Identifying where individuals obtain information about vaping for weight loss (e.g., e-cigarette ads, Internet) and whether weight-related motives promote e-cigarette initiation among e-cigarette naïve individuals is important to informing regulatory efforts. Further research also is needed to better understand the link between e-liquid flavors and weight loss motivations. Copyright © 2016 Elsevier Ltd. All rights reserved.

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

Closed-loop control of a fragile network: application to seizure-like dynamics of an epilepsy model

PubMed Central

Ehrens, Daniel; Sritharan, Duluxan; Sarma, Sridevi V.

2015-01-01

It has recently been proposed that the epileptic cortex is fragile in the sense that seizures manifest through small perturbations in the synaptic connections that render the entire cortical network unstable. Closed-loop therapy could therefore entail detecting when the network goes unstable, and then stimulating with an exogenous current to stabilize the network. In this study, a non-linear stochastic model of a neuronal network was used to simulate both seizure and non-seizure activity. In particular, synaptic weights between neurons were chosen such that the network's fixed point is stable during non-seizure periods, and a subset of these connections (the most fragile) were perturbed to make the same fixed point unstable to model seizure events; and, the model randomly transitions between these two modes. The goal of this study was to measure spike train observations from this epileptic network and then apply a feedback controller that (i) detects when the network goes unstable, and then (ii) applies a state-feedback gain control input to the network to stabilize it. The stability detector is based on a 2-state (stable, unstable) hidden Markov model (HMM) of the network, and detects the transition from the stable mode to the unstable mode from using the firing rate of the most fragile node in the network (which is the output of the HMM). When the unstable mode is detected, a state-feedback gain is applied to generate a control input to the fragile node bringing the network back to the stable mode. Finally, when the network is detected as stable again, the feedback control input is switched off. High performance was achieved for the stability detector, and feedback control suppressed seizures within 2 s after onset. PMID:25784851

The Unified Lunar Control Network 2005

USGS Publications Warehouse

Archinal, Brent A.; Rosiek, Mark R.; Kirk, Randolph L.; Redding, Bonnie L.

2006-01-01

This report documents a new general unified lunar control network and lunar topographic model based on a combination of Clementine images and a previous network derived from Earth-based & Apollo photographs, and Mariner 10, & Galileo images. This photogrammetric network solution is the largest planetary control network ever completed. It includes the determination of the 3-D positions of 272,931 points on the lunar surface and the correction of the camera angles for 43,866 Clementine images, using 546,126 tie point measurements. The solution RMS is 20 ?m (= 0.9 pixels) in the image plane, with the largest residual of 6.4 pixels. The explanation given here, along with the accompanying files, comprises the release of the network information and of global lunar digital elevation models (DEMs) derived from the network. A paper that will describe the solution and network in further detail will be submitted to a refereed journal, and will include additional background information, solution details, discussion of accuracy and precision, and explanatory figures.

Learning and retrieval behavior in recurrent neural networks with pre-synaptic dependent homeostatic plasticity

NASA Astrophysics Data System (ADS)

Mizusaki, Beatriz E. P.; Agnes, Everton J.; Erichsen, Rubem; Brunnet, Leonardo G.

2017-08-01

The plastic character of brain synapses is considered to be one of the foundations for the formation of memories. There are numerous kinds of such phenomenon currently described in the literature, but their role in the development of information pathways in neural networks with recurrent architectures is still not completely clear. In this paper we study the role of an activity-based process, called pre-synaptic dependent homeostatic scaling, in the organization of networks that yield precise-timed spiking patterns. It encodes spatio-temporal information in the synaptic weights as it associates a learned input with a specific response. We introduce a correlation measure to evaluate the precision of the spiking patterns and explore the effects of different inhibitory interactions and learning parameters. We find that large learning periods are important in order to improve the network learning capacity and discuss this ability in the presence of distinct inhibitory currents.

Design of a patient-centered, multi-institutional healthcare information network using peer-to-peer communication in a highly distributed architecture.

PubMed

Geissbuhler, Antoine; Spahni, Stéphane; Assimacopoulos, André; Raetzo, Marc-André; Gobet, Gérard

2004-01-01

to design a community healthcare information network for all 450,000 citizen in the State of Geneva, Switzerland, connecting public and private healthcare professionals. Requirements include the decentralized storage of information at the source of its production, the creation of a virtual patient record at the time of the consultation, the control by the patient of the access rights to the information, and the interoperability with other similar networks at the national and european level. a participative approach and real-world pilot projects are used to design, test and validate key components of the network, including its technical architecture and the strategy for the management of access rights by the patients. a distributed architecture using peer-to-peer communication of information mediators can implement the various requirements while limiting to an absolute minimum the amount of centralized information. Access control can be managed by the patient with the help of a medical information mediator, the physician of trust.

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.

Information needs of cancer patients and survivors regarding diet, exercise and weight management: a qualitative study.

PubMed

James-Martin, G; Koczwara, B; Smith, E L; Miller, M D

2014-05-01

While advanced cancer is often associated with weight loss, curative cancer treatment is often associated with weight gain. Weight gain during treatment may be associated with greater risk of cancer recurrence and development of lifestyle diseases. Currently, limited resources are available to cancer patients focussed on weight control. This study assessed the information needs of patients undergoing curative chemotherapy regarding diet, exercise and weight management for the purpose of developing weight management resources. Focus groups were held with oncology practitioners, patients and survivors to determine current information provision and needs. Focus groups highlighted a perception that information provision regarding diet, exercise and weight management is insufficient and no routine assessment of weight occurs during chemotherapy. Barriers to information provision described included lack of resources and time, and practitioners' uncertainty regarding appropriate messages to provide. Patients wanted more information regarding diet, exercise and weight during treatment time. The findings of this study suggest an increase in provision of diet, exercise and weight management information is needed. This information should be evidence-based and delivered at an appropriate time by the preferred health care professional. It would also be beneficial to implement protocols regarding assessment of weight during treatment. © 2013 John Wiley & Sons Ltd.

Fuzzy Counter Propagation Neural Network Control for a Class of Nonlinear Dynamical Systems

PubMed Central

Sakhre, Vandana; Jain, Sanjeev; Sapkal, Vilas S.; Agarwal, Dev P.

2015-01-01

Fuzzy Counter Propagation Neural Network (FCPN) controller design is developed, for a class of nonlinear dynamical systems. In this process, the weight connecting between the instar and outstar, that is, input-hidden and hidden-output layer, respectively, is adjusted by using Fuzzy Competitive Learning (FCL). FCL paradigm adopts the principle of learning, which is used to calculate Best Matched Node (BMN) which is proposed. This strategy offers a robust control of nonlinear dynamical systems. FCPN is compared with the existing network like Dynamic Network (DN) and Back Propagation Network (BPN) on the basis of Mean Absolute Error (MAE), Mean Square Error (MSE), Best Fit Rate (BFR), and so forth. It envisages that the proposed FCPN gives better results than DN and BPN. The effectiveness of the proposed FCPN algorithms is demonstrated through simulations of four nonlinear dynamical systems and multiple input and single output (MISO) and a single input and single output (SISO) gas furnace Box-Jenkins time series data. PMID:26366169

Fuzzy Counter Propagation Neural Network Control for a Class of Nonlinear Dynamical Systems.

PubMed

Sakhre, Vandana; Jain, Sanjeev; Sapkal, Vilas S; Agarwal, Dev P

2015-01-01

Fuzzy Counter Propagation Neural Network (FCPN) controller design is developed, for a class of nonlinear dynamical systems. In this process, the weight connecting between the instar and outstar, that is, input-hidden and hidden-output layer, respectively, is adjusted by using Fuzzy Competitive Learning (FCL). FCL paradigm adopts the principle of learning, which is used to calculate Best Matched Node (BMN) which is proposed. This strategy offers a robust control of nonlinear dynamical systems. FCPN is compared with the existing network like Dynamic Network (DN) and Back Propagation Network (BPN) on the basis of Mean Absolute Error (MAE), Mean Square Error (MSE), Best Fit Rate (BFR), and so forth. It envisages that the proposed FCPN gives better results than DN and BPN. The effectiveness of the proposed FCPN algorithms is demonstrated through simulations of four nonlinear dynamical systems and multiple input and single output (MISO) and a single input and single output (SISO) gas furnace Box-Jenkins time series data.

The transfer and transformation of collective network information in gene-matched networks.

PubMed

Kitsukawa, Takashi; Yagi, Takeshi

2015-10-09

Networks, such as the human society network, social and professional networks, and biological system networks, contain vast amounts of information. Information signals in networks are distributed over nodes and transmitted through intricately wired links, making the transfer and transformation of such information difficult to follow. Here we introduce a novel method for describing network information and its transfer using a model network, the Gene-matched network (GMN), in which nodes (neurons) possess attributes (genes). In the GMN, nodes are connected according to their expression of common genes. Because neurons have multiple genes, the GMN is cluster-rich. We show that, in the GMN, information transfer and transformation were controlled systematically, according to the activity level of the network. Furthermore, information transfer and transformation could be traced numerically with a vector using genes expressed in the activated neurons, the active-gene array, which was used to assess the relative activity among overlapping neuronal groups. Interestingly, this coding style closely resembles the cell-assembly neural coding theory. The method introduced here could be applied to many real-world networks, since many systems, including human society and various biological systems, can be represented as a network of this type.

Self-control with spiking and non-spiking neural networks playing games.

PubMed

Christodoulou, Chris; Banfield, Gaye; Cleanthous, Aristodemos

2010-01-01

Self-control can be defined as choosing a large delayed reward over a small immediate reward, while precommitment is the making of a choice with the specific aim of denying oneself future choices. Humans recognise that they have self-control problems and attempt to overcome them by applying precommitment. Problems in exercising self-control, suggest a conflict between cognition and motivation, which has been linked to competition between higher and lower brain functions (representing the frontal lobes and the limbic system respectively). This premise of an internal process conflict, lead to a behavioural model being proposed, based on which, we implemented a computational model for studying and explaining self-control through precommitment behaviour. Our model consists of two neural networks, initially non-spiking and then spiking ones, representing the higher and lower brain systems viewed as cooperating for the benefit of the organism. The non-spiking neural networks are of simple feed forward multilayer type with reinforcement learning, one with selective bootstrap weight update rule, which is seen as myopic, representing the lower brain and the other with the temporal difference weight update rule, which is seen as far-sighted, representing the higher brain. The spiking neural networks are implemented with leaky integrate-and-fire neurons with learning based on stochastic synaptic transmission. The differentiating element between the two brain centres in this implementation is based on the memory of past actions determined by an eligibility trace time constant. As the structure of the self-control problem can be likened to the Iterated Prisoner's Dilemma (IPD) game in that cooperation is to defection what self-control is to impulsiveness or what compromising is to insisting, we implemented the neural networks as two players, learning simultaneously but independently, competing in the IPD game. With a technique resembling the precommitment effect, whereby the payoffs for the dilemma cases in the IPD payoff matrix are differentially biased (increased or decreased), it is shown that increasing the precommitment effect (through increasing the differential bias) increases the probability of cooperating with oneself in the future, irrespective of whether the implementation is with spiking or non-spiking neural networks. Copyright (c) 2009 Elsevier Ltd. All rights reserved.

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

An Efficient Supervised Training Algorithm for Multilayer Spiking Neural Networks

PubMed Central

Xie, Xiurui; Qu, Hong; Liu, Guisong; Zhang, Malu; Kurths, Jürgen

2016-01-01

The spiking neural networks (SNNs) are the third generation of neural networks and perform remarkably well in cognitive tasks such as pattern recognition. The spike emitting and information processing mechanisms found in biological cognitive systems motivate the application of the hierarchical structure and temporal encoding mechanism in spiking neural networks, which have exhibited strong computational capability. However, the hierarchical structure and temporal encoding approach require neurons to process information serially in space and time respectively, which reduce the training efficiency significantly. For training the hierarchical SNNs, most existing methods are based on the traditional back-propagation algorithm, inheriting its drawbacks of the gradient diffusion and the sensitivity on parameters. To keep the powerful computation capability of the hierarchical structure and temporal encoding mechanism, but to overcome the low efficiency of the existing algorithms, a new training algorithm, the Normalized Spiking Error Back Propagation (NSEBP) is proposed in this paper. In the feedforward calculation, the output spike times are calculated by solving the quadratic function in the spike response model instead of detecting postsynaptic voltage states at all time points in traditional algorithms. Besides, in the feedback weight modification, the computational error is propagated to previous layers by the presynaptic spike jitter instead of the gradient decent rule, which realizes the layer-wised training. Furthermore, our algorithm investigates the mathematical relation between the weight variation and voltage error change, which makes the normalization in the weight modification applicable. Adopting these strategies, our algorithm outperforms the traditional SNN multi-layer algorithms in terms of learning efficiency and parameter sensitivity, that are also demonstrated by the comprehensive experimental results in this paper. PMID:27044001

Network analysis of global tobacco control collaboration: data from the World Conference on Tobacco or Health (WCTOH).

PubMed

Leischow, Scott J; Okamoto, Janet; McIntosh, Scott; Ossip, Deborah J; Lando, Harry A

2017-04-20

The World Conference on Tobacco or Health (WCTOH) is held every three years to foster communication and collaboration on global tobacco control. Very little is known about the nature of interactions between WCTOH attendees and their linkages to tobacco control organizations, so knowing this information could help improve tobacco control efforts. At the 2015 WCTOH, we implemented an online survey to assess barriers to global tobacco control activities, which information sources they use for tobacco control information, and with whom they interact regarding tobacco control. A total of 169 respondents completed the survey, with responses from all six World Health Organization (WHO) regions. Respondents worked in all areas of tobacco control; the most common were research (29.2%) and patient care/treatment (23.3%). The top barriers faced regarding tobacco control activities were: funding is weak (56.8%), government commitment (45.0%), tobacco industry interference (43.8%), and lack of coordination (34.3%). The network analysis identified Framework Convention Alliance (FCA) and Society for Research on Nicotine and Tobacco (SRNT) as the two most prominent groups that people belonged to and where they went to exchange information and best practices. Important regional and country specific groups also appear to be growing, such as the African Tobacco Control Alliance (ATCA) and the Argentinian Association of Tabacology (ASAT). Mapping and better understanding the global tobacco control network is important for informing knowledge exchange and best practices, particularly as increasing attention is being focused on global tobacco control efforts in low- and middle-income countries in particular. The present study demonstrates that even a subsample of the WCTOH shows considerable collaboration. The full WCTOH network should be mapped in order to foster greater collaboration that has the the potential to improve global tobacco control efforts.

Family Food Providers’ Perceptions of the Causes of Obesity and Effectiveness of Weight Control Strategies in Five Countries in the Asia Pacific Region: A Cross-Sectional Survey

PubMed Central

Worsley, Anthony; Wang, Wei; Sarmugam, Rani; Pham, Quynh; Februhartanty, Judhiastuty; Ridley, Stacey

2017-01-01

The rise of the middle classes in developing countries and the associated epidemiological transition raises the importance of assessing this population group’s awareness of the causes of obesity and effective weight control strategies in order to develop effective health promotion strategies. The study aimed to examine the perceptions of the causes of obesity and weight control strategies held by middle class household food providers in Melbourne, Singapore, Shanghai, Indonesia and Vietnam. An online survey was conducted in late 2013, early 2014 among 3945 respondents. Information about body weight concerns, perceived causes of obesity, effectiveness of weight control methods, demographics, self-reported height and weight, and personal values was elicited. Confirmatory factor analyses (CFA) derived nine reliable factors which were used in structural equation modelling (SEM). Two thirds of respondents were trying to change their body weight, of them, 71% were trying to lose weight. The CFA and SEM showed that demographics, region of residence, personal values and perceptions of the causes of obesity (Unhealthy food behaviours, influences Beyond personal control and Environmental influences) had direct and indirect associations with three weight control methods factors, named: Healthy habits, Eat less, sit less, and Dieting. Middle class food providers in the study regions share public health views of obesity causation and personal weight control. These findings could inform public health and food policies, and the design of public health interventions and communications. Further research is required among lower socio economic status (SES) populations. PMID:28106781

Data-Driven Zero-Sum Neuro-Optimal Control for a Class of Continuous-Time Unknown Nonlinear Systems With Disturbance Using ADP.

PubMed

Wei, Qinglai; Song, Ruizhuo; Yan, Pengfei

2016-02-01

This paper is concerned with a new data-driven zero-sum neuro-optimal control problem for continuous-time unknown nonlinear systems with disturbance. According to the input-output data of the nonlinear system, an effective recurrent neural network is introduced to reconstruct the dynamics of the nonlinear system. Considering the system disturbance as a control input, a two-player zero-sum optimal control problem is established. Adaptive dynamic programming (ADP) is developed to obtain the optimal control under the worst case of the disturbance. Three single-layer neural networks, including one critic and two action networks, are employed to approximate the performance index function, the optimal control law, and the disturbance, respectively, for facilitating the implementation of the ADP method. Convergence properties of the ADP method are developed to show that the system state will converge to a finite neighborhood of the equilibrium. The weight matrices of the critic and the two action networks are also convergent to finite neighborhoods of their optimal ones. Finally, the simulation results will show the effectiveness of the developed data-driven ADP methods.

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.

Solving the influence maximization problem reveals regulatory organization of the yeast cell cycle.

PubMed

Gibbs, David L; Shmulevich, Ilya

2017-06-01

The Influence Maximization Problem (IMP) aims to discover the set of nodes with the greatest influence on network dynamics. The problem has previously been applied in epidemiology and social network analysis. Here, we demonstrate the application to cell cycle regulatory network analysis for Saccharomyces cerevisiae. Fundamentally, gene regulation is linked to the flow of information. Therefore, our implementation of the IMP was framed as an information theoretic problem using network diffusion. Utilizing more than 26,000 regulatory edges from YeastMine, gene expression dynamics were encoded as edge weights using time lagged transfer entropy, a method for quantifying information transfer between variables. By picking a set of source nodes, a diffusion process covers a portion of the network. The size of the network cover relates to the influence of the source nodes. The set of nodes that maximizes influence is the solution to the IMP. By solving the IMP over different numbers of source nodes, an influence ranking on genes was produced. The influence ranking was compared to other metrics of network centrality. Although the top genes from each centrality ranking contained well-known cell cycle regulators, there was little agreement and no clear winner. However, it was found that influential genes tend to directly regulate or sit upstream of genes ranked by other centrality measures. The influential nodes act as critical sources of information flow, potentially having a large impact on the state of the network. Biological events that affect influential nodes and thereby affect information flow could have a strong effect on network dynamics, potentially leading to disease. Code and data can be found at: https://github.com/gibbsdavidl/miergolf.

Toward a new task assignment and path evolution (TAPE) for missile defense system (MDS) using intelligent adaptive SOM with recurrent neural networks (RNNs).

PubMed

Wang, Chi-Hsu; Chen, Chun-Yao; Hung, Kun-Neng

2015-06-01

In this paper, a new adaptive self-organizing map (SOM) with recurrent neural network (RNN) controller is proposed for task assignment and path evolution of missile defense system (MDS). We address the problem of N agents (defending missiles) and D targets (incoming missiles) in MDS. A new RNN controller is designed to force an agent (or defending missile) toward a target (or incoming missile), and a monitoring controller is also designed to reduce the error between RNN controller and ideal controller. A new SOM with RNN controller is then designed to dispatch agents to their corresponding targets by minimizing total damaging cost. This is actually an important application of the multiagent system. The SOM with RNN controller is the main controller. After task assignment, the weighting factors of our new SOM with RNN controller are activated to dispatch the agents toward their corresponding targets. Using the Lyapunov constraints, the weighting factors for the proposed SOM with RNN controller are updated to guarantee the stability of the path evolution (or planning) system. Excellent simulations are obtained using this new approach for MDS, which show that our RNN has the lowest average miss distance among the several techniques.

Smart pitch control strategy for wind generation system using doubly fed induction generator

NASA Astrophysics Data System (ADS)

Raza, Syed Ahmed

A smart pitch control strategy for a variable speed doubly fed wind generation system is presented in this thesis. A complete dynamic model of DFIG system is developed. The model consists of the generator, wind turbine, aerodynamic and the converter system. The strategy proposed includes the use of adaptive neural network to generate optimized controller gains for pitch control. This involves the generation of controller parameters of pitch controller making use of differential evolution intelligent technique. Training of the back propagation neural network has been carried out for the development of an adaptive neural network. This tunes the weights of the network according to the system states in a variable wind speed environment. Four cases have been taken to test the pitch controller which includes step and sinusoidal changes in wind speeds. The step change is composed of both step up and step down changes in wind speeds. The last case makes use of scaled wind data collected from the wind turbine installed at King Fahd University beach front. Simulation studies show that the differential evolution based adaptive neural network is capable of generating the appropriate control to deliver the maximum possible aerodynamic power available from wind to the generator in an efficient manner by minimizing the transients.

76 FR 12983 - Notice of Proposed Information Collection: Comment Request; Tenant Resource Network Program

Federal Register 2010, 2011, 2012, 2013, 2014

2011-03-09

... DEPARTMENT OF HOUSING AND URBAN DEVELOPMENT [Docket No. FR-5484-N-06] Notice of Proposed Information Collection: Comment Request; Tenant Resource Network Program AGENCY: Office of the Assistant...: Tenant Resource Network Program. OMB Control Number, if applicable: 2502-new-65pTRNP. Description of the...

BIO-Plex Information System Concept

NASA Technical Reports Server (NTRS)

Jones, Harry; Boulanger, Richard; Arnold, James O. (Technical Monitor)

1999-01-01

This paper describes a suggested design for an integrated information system for the proposed BIO-Plex (Bioregenerative Planetary Life Support Systems Test Complex) at Johnson Space Center (JSC), including distributed control systems, central control, networks, database servers, personal computers and workstations, applications software, and external communications. The system will have an open commercial computing and networking, architecture. The network will provide automatic real-time transfer of information to database server computers which perform data collection and validation. This information system will support integrated, data sharing applications for everything, from system alarms to management summaries. Most existing complex process control systems have information gaps between the different real time subsystems, between these subsystems and central controller, between the central controller and system level planning and analysis application software, and between the system level applications and management overview reporting. An integrated information system is vitally necessary as the basis for the integration of planning, scheduling, modeling, monitoring, and control, which will allow improved monitoring and control based on timely, accurate and complete data. Data describing the system configuration and the real time processes can be collected, checked and reconciled, analyzed and stored in database servers that can be accessed by all applications. The required technology is available. The only opportunity to design a distributed, nonredundant, integrated system is before it is built. Retrofit is extremely difficult and costly.

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.

The Agility Advantage: A Survival Guide for Complex Enterprises and Endeavors

DTIC Science & Technology

2011-09-01

weighted probability 75th pctl weighted probability 13. Carman. K. G. and Kooreman, P, “ Flu Shots, Mammogram, and the Perception of Probabilities,” 2010...sharing capabilities until users can tes- tify to the benefi ts. This creates a chicken and egg situa- tion, because the consumers of information fi...Bibliography 563 Campen, Alan D. Look Closely at Network-Centric Warfare. Signal, January 2004. Carman, Katherine G., and Peter Kooreman, Peter. Flu Shots

Gender-based analysis of cortical thickness and structural connectivity in Parkinson's disease.

PubMed

Yadav, Santosh K; Kathiresan, Nagarajan; Mohan, Suyash; Vasileiou, Georgia; Singh, Anup; Kaura, Deepak; Melhem, Elias R; Gupta, Rakesh K; Wang, Ena; Marincola, Francesco M; Borthakur, Arijitt; Haris, Mohammad

2016-11-01

Parkinson's disease (PD) is a progressive neurological disorder and appears to have gender-specific symptoms. Studies have observed a higher frequency for development of PD in male than in female. In the current study, we evaluated the gender-based changes in cortical thickness and structural connectivity in PD patients. With informed consent, 64 PD (43 males and 21 females) patients, and 46 (12 males and 34 females) age-matched controls underwent clinical assessment including Mini-Mental State Examination (MMSE) and magnetic resonance imaging on a 1.5 Tesla clinical MR scanner. Whole brain high-resolution T1-weighted images were acquired from all subjects and used to measure cortical thickness and structural network connectivity. No significant difference in MMSE score was observed between male and female both in control and PD subjects. Male PD patients showed significantly reduced cortical thickness in multiple brain regions including frontal, parietal, temporal, and occipital lobes as compared with those in female PD patients. The graph theory-based network analysis depicted lower connection strengths, lower clustering coefficients, and altered network hubs in PD male than in PD female. Male-specific cortical thickness changes and altered connectivity in PD patients may derive from behavioral, physiological, environmental, and genetical differences between male and female, and may have significant implications in diagnosing and treating PD among genders.

Fixed-time synchronization of complex networks with nonidentical nodes and stochastic noise perturbations

NASA Astrophysics Data System (ADS)

Zhang, Wanli; Li, Chuandong; Huang, Tingwen; Huang, Junjian

2018-02-01

This paper investigates the fixed-time synchronization of complex networks (CNs) with nonidentical nodes and stochastic noise perturbations. By designing new controllers, constructing Lyapunov functions and using the properties of Weiner process, different synchronization criteria are derived according to whether the node systems in the CNs or the goal system satisfies the corresponding conditions. Moreover, the role of the designed controllers is analyzed in great detail by constructing a suitable comparison system and a new method is presented to estimate the settling time by utilizing the comparison system. Results of this paper can be applied to both directed and undirected weighted networks. Numerical simulations are offered to verify the effectiveness of our new results.

Robust Group Sparse Beamforming for Multicast Green Cloud-RAN With Imperfect CSI

NASA Astrophysics Data System (ADS)

Shi, Yuanming; Zhang, Jun; Letaief, Khaled B.

2015-09-01

In this paper, we investigate the network power minimization problem for the multicast cloud radio access network (Cloud-RAN) with imperfect channel state information (CSI). The key observation is that network power minimization can be achieved by adaptively selecting active remote radio heads (RRHs) via controlling the group-sparsity structure of the beamforming vector. However, this yields a non-convex combinatorial optimization problem, for which we propose a three-stage robust group sparse beamforming algorithm. In the first stage, a quadratic variational formulation of the weighted mixed l1/l2-norm is proposed to induce the group-sparsity structure in the aggregated beamforming vector, which indicates those RRHs that can be switched off. A perturbed alternating optimization algorithm is then proposed to solve the resultant non-convex group-sparsity inducing optimization problem by exploiting its convex substructures. In the second stage, we propose a PhaseLift technique based algorithm to solve the feasibility problem with a given active RRH set, which helps determine the active RRHs. Finally, the semidefinite relaxation (SDR) technique is adopted to determine the robust multicast beamformers. Simulation results will demonstrate the convergence of the perturbed alternating optimization algorithm, as well as, the effectiveness of the proposed algorithm to minimize the network power consumption for multicast Cloud-RAN.

Wideband, mobile networking technologies

NASA Astrophysics Data System (ADS)

Hyer, Kevin L.; Bowen, Douglas G.; Pulsipher, Dennis C.

2005-05-01

Ubiquitous communications will be the next era in the evolving communications revolution. From the human perspective, access to information will be instantaneous and provide a revolution in services available to both the consumer and the warfighter. Services will be from the mundane - anytime, anywhere access to any movie ever made - to the vital - reliable and immediate access to the analyzed real-time video from the multi-spectral sensors scanning for snipers in the next block. In the former example, the services rely on a fixed infrastructure of networking devices housed in controlled environments and coupled to fixed terrestrial fiber backbones - in the latter, the services are derived from an agile and highly mobile ad-hoc backbone established in a matter of minutes by size, weight, and power-constrained platforms. This network must mitigate significant changes in the transmission media caused by millisecond-scale atmospheric temperature variations, the deployment of smoke, or the drifting of a cloud. It must mitigate against structural obscurations, jet wash, or incapacitation of a node. To maintain vital connectivity, the mobile backbone must be predictive and self-healing on both near-real-time and real-time time scales. The nodes of this network must be reconfigurable to mitigate intentional and environmental jammers, block attackers, and alleviate interoperability concerns caused by changing standards. The nodes must support multi-access of disparate waveform and protocols.

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.

The design of the automated control system for warehouse equipment under radio-electronic manufacturing

NASA Astrophysics Data System (ADS)

Kapulin, D. V.; Chemidov, I. V.; Kazantsev, M. A.

2017-01-01

In the paper, the aspects of design, development and implementation of the automated control system for warehousing under the manufacturing process of the radio-electronic enterprise JSC «Radiosvyaz» are discussed. The architecture of the automated control system for warehousing proposed in the paper consists of a server which is connected to the physically separated information networks: the network with a database server, which stores information about the orders for picking, and the network with the automated storage and retrieval system. This principle allows implementing the requirements for differentiation of access, ensuring the information safety and security requirements. Also, the efficiency of the developed automated solutions in terms of optimizing the warehouse’s logistic characteristics is researched.

Adaptive Sliding Mode Control of Dynamic Systems Using Double Loop Recurrent Neural Network Structure.

PubMed

Fei, Juntao; Lu, Cheng

2018-04-01

In this paper, an adaptive sliding mode control system using a double loop recurrent neural network (DLRNN) structure is proposed for a class of nonlinear dynamic systems. A new three-layer RNN is proposed to approximate unknown dynamics with two different kinds of feedback loops where the firing weights and output signal calculated in the last step are stored and used as the feedback signals in each feedback loop. Since the new structure has combined the advantages of internal feedback NN and external feedback NN, it can acquire the internal state information while the output signal is also captured, thus the new designed DLRNN can achieve better approximation performance compared with the regular NNs without feedback loops or the regular RNNs with a single feedback loop. The new proposed DLRNN structure is employed in an equivalent controller to approximate the unknown nonlinear system dynamics, and the parameters of the DLRNN are updated online by adaptive laws to get favorable approximation performance. To investigate the effectiveness of the proposed controller, the designed adaptive sliding mode controller with the DLRNN is applied to a -axis microelectromechanical system gyroscope to control the vibrating dynamics of the proof mass. Simulation results demonstrate that the proposed methodology can achieve good tracking property, and the comparisons of the approximation performance between radial basis function NN, RNN, and DLRNN show that the DLRNN can accurately estimate the unknown dynamics with a fast speed while the internal states of DLRNN are more stable.

Core psychopathology in anorexia nervosa and bulimia nervosa: A network analysis.

PubMed

Forrest, Lauren N; Jones, Payton J; Ortiz, Shelby N; Smith, April R

2018-04-25

The cognitive-behavioral theory of eating disorders (EDs) proposes that shape and weight overvaluation are the core ED psychopathology. Core symptoms can be statistically identified using network analysis. Existing ED network studies support that shape and weight overvaluation are the core ED psychopathology, yet no studies have estimated AN core psychopathology and concerns exist about the replicability of network analysis findings. The current study estimated ED symptom networks among people with anorexia nervosa (AN) and bulimia nervosa (BN) and among a combined group of people with AN and BN. Participants were girls and women with AN (n = 604) and BN (n = 477) seeking residential ED treatment. ED symptoms were assessed with the Eating Disorder Examination-Questionnaire (EDE-Q); 27 of the EDE-Q items were included as nodes in symptom networks. Core symptoms were determined by expected influence and strength values. In all networks, desiring weight loss, restraint, shape and weight preoccupation, and shape overvaluation emerged as the most important symptoms. In addition, in the AN and combined networks, fearing weight gain emerged as an important symptom. In the BN network, weight overvaluation emerged as another important symptom. Findings support the cognitive-behavioral premise that shape and weight overvaluation are at the core of AN psychopathology. Our BN and combined network findings provide a high degree of replication of previous findings. Clinically, findings highlight the importance of considering shape and weight overvaluation as a severity specifier and primary treatment target for people with EDs. © 2018 Wiley Periodicals, Inc.

Connectomics-based analysis of information flow in the Drosophila brain.

PubMed

Shih, Chi-Tin; Sporns, Olaf; Yuan, Shou-Li; Su, Ta-Shun; Lin, Yen-Jen; Chuang, Chao-Chun; Wang, Ting-Yuan; Lo, Chung-Chuang; Greenspan, Ralph J; Chiang, Ann-Shyn

2015-05-18

Understanding the overall patterns of information flow within the brain has become a major goal of neuroscience. In the current study, we produced a first draft of the Drosophila connectome at the mesoscopic scale, reconstructed from 12,995 images of neuron projections collected in FlyCircuit (version 1.1). Neuron polarities were predicted according to morphological criteria, with nodes of the network corresponding to brain regions designated as local processing units (LPUs). The weight of each directed edge linking a pair of LPUs was determined by the number of neuron terminals that connected one LPU to the other. The resulting network showed hierarchical structure and small-world characteristics and consisted of five functional modules that corresponded to sensory modalities (olfactory, mechanoauditory, and two visual) and the pre-motor center. Rich-club organization was present in this network and involved LPUs in all sensory centers, and rich-club members formed a putative motor center of the brain. Major intra- and inter-modular loops were also identified that could play important roles for recurrent and reverberant information flow. The present analysis revealed whole-brain patterns of network structure and information flow. Additionally, we propose that the overall organizational scheme showed fundamental similarities to the network structure of the mammalian brain. Copyright © 2015 Elsevier Ltd. All rights reserved.

Searching LOGIN, the Local Government Information Network.

ERIC Educational Resources Information Center

Jack, Robert F.

1984-01-01

Describes a computer-based information retrieval and electronic messaging system produced by Control Data Corporation now being used by government agencies and other organizations. Background of Local Government Information Network (LOGIN), database structure, types of LOGIN units, searching LOGIN (intersect, display, and list commands), and how…

Next generation information communication infrastructure and case studies for future power systems

NASA Astrophysics Data System (ADS)

Qiu, Bin

As power industry enters the new century, powerful driving forces, uncertainties and new functions are compelling electric utilities to make dramatic changes in their information communication infrastructure. Expanding network services such as real time measurement and monitoring are also driving the need for more bandwidth in the communication network. These needs will grow further as new remote real-time protection and control applications become more feasible and pervasive. This dissertation addresses two main issues for the future power system information infrastructure: communication network infrastructure and associated power system applications. Optical networks no doubt will become the predominant data transmission media for next generation power system communication. The rapid development of fiber optic network technology poses new challenges in the areas of topology design, network management and real time applications. Based on advanced fiber optic technologies, an all-fiber network is investigated and proposed. The study will cover the system architecture and data exchange protocol aspects. High bandwidth, robust optical networks could provide great opportunities to the power system for better service and efficient operation. In the dissertation, different applications are investigated. One of the typical applications is the SCADA information accessing system. An Internet-based application for the substation automation system will be presented. VLSI (Very Large Scale Integration) technology is also used for one-line diagrams auto-generation. High transition rate and low latency optical network is especially suitable for power system real time control. In the dissertation, a new local area network based Load Shedding Controller (LSC) for isolated power system will be presented. By using PMU (Phasor Measurement Unit) and fiber optic network, an AGE (Area Generation Error) based accurate wide area load shedding scheme will also be proposed. The objective is to shed the load in the limited area with minimum disturbance.

An Intelligent Control for the Distributed Flexible Network Photovoltaic System using Autonomous Control and Agent

NASA Astrophysics Data System (ADS)

Park, Sangsoo; Miura, Yushi; Ise, Toshifumi

This paper proposes an intelligent control for the distributed flexible network photovoltaic system using autonomous control and agent. The distributed flexible network photovoltaic system is composed of a secondary battery bank and a number of subsystems which have a solar array, a dc/dc converter and a load. The control mode of dc/dc converter can be selected based on local information by autonomous control. However, if only autonomous control using local information is applied, there are some problems associated with several cases such as voltage drop on long power lines. To overcome these problems, the authors propose introducing agents to improve control characteristics. The autonomous control with agents is called as intelligent control in this paper. The intelligent control scheme that employs the communication between agents is applied for the model system and proved with simulation using PSCAD/EMTDC.

Fault-tolerant nonlinear adaptive flight control using sliding mode online learning.

PubMed

Krüger, Thomas; Schnetter, Philipp; Placzek, Robin; Vörsmann, Peter

2012-08-01

An expanded nonlinear model inversion flight control strategy using sliding mode online learning for neural networks is presented. The proposed control strategy is implemented for a small unmanned aircraft system (UAS). This class of aircraft is very susceptible towards nonlinearities like atmospheric turbulence, model uncertainties and of course system failures. Therefore, these systems mark a sensible testbed to evaluate fault-tolerant, adaptive flight control strategies. Within this work the concept of feedback linearization is combined with feed forward neural networks to compensate for inversion errors and other nonlinear effects. Backpropagation-based adaption laws of the network weights are used for online training. Within these adaption laws the standard gradient descent backpropagation algorithm is augmented with the concept of sliding mode control (SMC). Implemented as a learning algorithm, this nonlinear control strategy treats the neural network as a controlled system and allows a stable, dynamic calculation of the learning rates. While considering the system's stability, this robust online learning method therefore offers a higher speed of convergence, especially in the presence of external disturbances. The SMC-based flight controller is tested and compared with the standard gradient descent backpropagation algorithm in the presence of system failures. Copyright © 2012 Elsevier Ltd. All rights reserved.

Using Cognitive Control in Software Defined Networking for Port Scan Detection

DTIC Science & Technology

2017-07-01

ARL-TR-8059 ● July 2017 US Army Research Laboratory Using Cognitive Control in Software-Defined Networking for Port Scan...Cognitive Control in Software-Defined Networking for Port Scan Detection by Vinod K Mishra Computational and Information Sciences Directorate, ARL...currently valid OMB control number. PLEASE DO NOT RETURN YOUR FORM TO THE ABOVE ADDRESS. 1. REPORT DATE (DD-MM-YYYY) July 2017 2. REPORT TYPE

Deep neural network with weight sparsity control and pre-training extracts hierarchical features and enhances classification performance: Evidence from whole-brain resting-state functional connectivity patterns of schizophrenia

PubMed Central

Kim, Junghoe; Calhoun, Vince D.; Shim, Eunsoo; Lee, Jong-Hwan

2015-01-01

Functional connectivity (FC) patterns obtained from resting-state functional magnetic resonance imaging data are commonly employed to study neuropsychiatric conditions by using pattern classifiers such as the support vector machine (SVM). Meanwhile, a deep neural network (DNN) with multiple hidden layers has shown its ability to systematically extract lower-to-higher level information of image and speech data from lower-to-higher hidden layers, markedly enhancing classification accuracy. The objective of this study was to adopt the DNN for whole-brain resting-state FC pattern classification of schizophrenia (SZ) patients vs. healthy controls (HCs) and identification of aberrant FC patterns associated with SZ. We hypothesized that the lower-to-higher level features learned via the DNN would significantly enhance the classification accuracy, and proposed an adaptive learning algorithm to explicitly control the weight sparsity in each hidden layer via L1-norm regularization. Furthermore, the weights were initialized via stacked autoencoder based pre-training to further improve the classification performance. Classification accuracy was systematically evaluated as a function of (1) the number of hidden layers/nodes, (2) the use of L1-norm regularization, (3) the use of the pre-training, (4) the use of framewise displacement (FD) removal, and (5) the use of anatomical/functional parcellation. Using FC patterns from anatomically parcellated regions without FD removal, an error rate of 14.2% was achieved by employing three hidden layers and 50 hidden nodes with both L1-norm regularization and pre-training, which was substantially lower than the error rate from the SVM (22.3%). Moreover, the trained DNN weights (i.e., the learned features) were found to represent the hierarchical organization of aberrant FC patterns in SZ compared with HC. Specifically, pairs of nodes extracted from the lower hidden layer represented sparse FC patterns implicated in SZ, which was quantified by using kurtosis/modularity measures and features from the higher hidden layer showed holistic/global FC patterns differentiating SZ from HC. Our proposed schemes and reported findings attained by using the DNN classifier and whole-brain FC data suggest that such approaches show improved ability to learn hidden patterns in brain imaging data, which may be useful for developing diagnostic tools for SZ and other neuropsychiatric disorders and identifying associated aberrant FC patterns. PMID:25987366

Topology association analysis in weighted protein interaction network for gene prioritization

NASA Astrophysics Data System (ADS)

Wu, Shunyao; Shao, Fengjing; Zhang, Qi; Ji, Jun; Xu, Shaojie; Sun, Rencheng; Sun, Gengxin; Du, Xiangjun; Sui, Yi

2016-11-01

Although lots of algorithms for disease gene prediction have been proposed, the weights of edges are rarely taken into account. In this paper, the strengths of topology associations between disease and essential genes are analyzed in weighted protein interaction network. Empirical analysis demonstrates that compared to other genes, disease genes are weakly connected with essential genes in protein interaction network. Based on this finding, a novel global distance measurement for gene prioritization with weighted protein interaction network is proposed in this paper. Positive and negative flow is allocated to disease and essential genes, respectively. Additionally network propagation model is extended for weighted network. Experimental results on 110 diseases verify the effectiveness and potential of the proposed measurement. Moreover, weak links play more important role than strong links for gene prioritization, which is meaningful to deeply understand protein interaction network.

A weighted information criterion for multiple minor components and its adaptive extraction algorithms.

PubMed

Gao, Yingbin; Kong, Xiangyu; Zhang, Huihui; Hou, Li'an

2017-05-01

Minor component (MC) plays an important role in signal processing and data analysis, so it is a valuable work to develop MC extraction algorithms. Based on the concepts of weighted subspace and optimum theory, a weighted information criterion is proposed for searching the optimum solution of a linear neural network. This information criterion exhibits a unique global minimum attained if and only if the state matrix is composed of the desired MCs of an autocorrelation matrix of an input signal. By using gradient ascent method and recursive least square (RLS) method, two algorithms are developed for multiple MCs extraction. The global convergences of the proposed algorithms are also analyzed by the Lyapunov method. The proposed algorithms can extract the multiple MCs in parallel and has advantage in dealing with high dimension matrices. Since the weighted matrix does not require an accurate value, it facilitates the system design of the proposed algorithms for practical applications. The speed and computation advantages of the proposed algorithms are verified through simulations. Copyright © 2017 Elsevier Ltd. All rights reserved.

Artificial neural systems for interpretation and inversion of seismic data

NASA Astrophysics Data System (ADS)

Calderon-Macias, Carlos

The goal of this work is to investigate the feasibility of using neural network (NN) models for solving geophysical exploration problems. First, a feedforward neural network (FNN) is used to solve inverse problems. The operational characteristics of a FNN are primarily controlled by a set of weights and a nonlinear function that performs a mapping between two sets of data. In a process known as training, the FNN weights are iteratively adjusted to perform the mapping. After training, the computed weights encode important features of the data that enable one pattern to be distinguished from another. Synthetic data computed from an ensemble of earth models and the corresponding models provide the training data. Two training methods are studied: the backpropagation method which is a gradient scheme, and a global optimization method called very fast simulated annealing (VFSA). A trained network is then used to predict models from new data (e.g., data from a new location) in a one-step procedure. The application of this method to the problems of obtaining formation resistivities and layer thicknesses from resistivity sounding data and 1D velocity models from seismic data shows that trained FNNs produce reasonably accurate earth models when observed data are input to the FNNs. In a second application, a FNN is used for automating the NMO correction process of seismic reflection data. The task of the FNN is to map CMP data at control locations along a seismic line into subsurface velocities. The network is trained while the velocity analyses are performed at the control locations. Once trained, the computed weights are used as an operator that acts on the remaining CMP data as a velocity interpolator, resulting in a fast method for NMO correction. The second part of this dissertation describes the application of a Hopfield neural network (HNN) to the problems of deconvolution and multiple attenuation. In these applications, the unknown parameters (reflection coefficients and source wavelet in the first problem and an operator in the second) are mapped as neurons of the HNN. The proposed deconvolution method attempts to reproduce the data with a limited number of events. The multiple attenuation method resembles the predictive deconvolution method. Results of this method are compared with a multiple elimination method based on estimating the source wavelet from the seismic data.

Learning State Space Dynamics in Recurrent Networks

NASA Astrophysics Data System (ADS)

Simard, Patrice Yvon

Fully recurrent (asymmetrical) networks can be used to learn temporal trajectories. The network is unfolded in time, and backpropagation is used to train the weights. The presence of recurrent connections creates internal states in the system which vary as a function of time. The resulting dynamics can provide interesting additional computing power but learning is made more difficult by the existence of internal memories. This study first exhibits the properties of recurrent networks in terms of convergence when the internal states of the system are unknown. A new energy functional is provided to change the weights of the units in order to the control the stability of the fixed points of the network's dynamics. The power of the resultant algorithm is illustrated with the simulation of a content addressable memory. Next, the more general case of time trajectories on a recurrent network is studied. An application is proposed in which trajectories are generated to draw letters as a function of an input. In another application of recurrent systems, a neural network certain temporal properties observed in human callosally sectioned brains. Finally the proposed algorithm for stabilizing dynamics around fixed points is extended to one for stabilizing dynamics around time trajectories. Its effects are illustrated on a network which generates Lisajous curves.

Modification of a neuronal network direction using stepwise photo-thermal etching of an agarose architecture.

PubMed

Suzuki, Ikurou; Sugio, Yoshihiro; Moriguchi, Hiroyuki; Jimbo, Yasuhiko; Yasuda, Kenji

2004-07-01

Control over spatial distribution of individual neurons and the pattern of neural network provides an important tool for studying information processing pathways during neural network formation. Moreover, the knowledge of the direction of synaptic connections between cells in each neural network can provide detailed information on the relationship between the forward and feedback signaling. We have developed a method for topographical control of the direction of synaptic connections within a living neuronal network using a new type of individual-cell-based on-chip cell-cultivation system with an agarose microchamber array (AMCA). The advantages of this system include the possibility to control positions and number of cultured cells as well as flexible control of the direction of elongation of axons through stepwise melting of narrow grooves. Such micrometer-order microchannels are obtained by photo-thermal etching of agarose where a portion of the gel is melted with a 1064-nm infrared laser beam. Using this system, we created neural network from individual Rat hippocampal cells. We were able to control elongation of individual axons during cultivation (from cells contained within the AMCA) by non-destructive stepwise photo-thermal etching. We have demonstrated the potential of our on-chip AMCA cell cultivation system for the controlled development of individual cell-based neural networks.

Gamified physical activation of young men – a Multidisciplinary Population-Based Randomized Controlled Trial (MOPO study)

PubMed Central

2013-01-01

Background Inactive and unhealthy lifestyles are common among adolescent men. The planned intervention examines the effectiveness of an interactive, gamified activation method, based on tailored health information, peer networks and participation, on physical activity, health and wellbeing in young men. We hypothesize that following the intervention the physical activation group will have an improved physical activity, as well as self-determined and measured health compared with the controls. Methods/design Conscription-aged men (18 years) attending compulsory annual call-ups for military service in the city of Oulu in Finland (n = 1500) will be randomized to a 6-months intervention (n = 640) or a control group (n = 640) during the fall 2013. A questionnaire on health, health behaviour, diet and wellbeing is administered in the beginning and end of the intervention. In addition, anthropometric measures (height, weight and waist circumference), body composition, grip strength, heart rate variability and aerobic fitness will be measured. The activation group utilizes an online gamified activation method in combination with communal youth services, objective physical activity measurement, social networking, tailored health information and exercise programs according to baseline activity level and the readiness of changes of each individual. Daily physical activity of the participants is monitored in both the activation and control groups. The activation service rewards improvements in physical activity or reductions in sedentary behaviour. The performance and completion of the military service of the participants will also be followed. Discussion The study will provide new information of physical activity, health and health behaviour of young men. Furthermore, a novel model including methods for increasing physical activity among young people is developed and its effects tested through an intervention. This unique gamified service for activating young men can provide a translational model for community use. It can also be utilized as such or tailored to other selected populations or age groups. Trial registration ClinicalTrials.gov Identifier: NCT01376986 PMID:23311678

Gamified physical activation of young men--a Multidisciplinary Population-Based Randomized Controlled Trial (MOPO study).

PubMed

Ahola, Riikka; Pyky, Riitta; Jämsä, Timo; Mäntysaari, Matti; Koskimäki, Heli; Ikäheimo, Tiina M; Huotari, Maija-Leena; Röning, Juha; Heikkinen, Hannu I; Korpelainen, Raija

2013-01-14

Inactive and unhealthy lifestyles are common among adolescent men. The planned intervention examines the effectiveness of an interactive, gamified activation method, based on tailored health information, peer networks and participation, on physical activity, health and wellbeing in young men. We hypothesize that following the intervention the physical activation group will have an improved physical activity, as well as self-determined and measured health compared with the controls. Conscription-aged men (18 years) attending compulsory annual call-ups for military service in the city of Oulu in Finland (n = 1500) will be randomized to a 6-months intervention (n = 640) or a control group (n = 640) during the fall 2013. A questionnaire on health, health behaviour, diet and wellbeing is administered in the beginning and end of the intervention. In addition, anthropometric measures (height, weight and waist circumference), body composition, grip strength, heart rate variability and aerobic fitness will be measured. The activation group utilizes an online gamified activation method in combination with communal youth services, objective physical activity measurement, social networking, tailored health information and exercise programs according to baseline activity level and the readiness of changes of each individual. Daily physical activity of the participants is monitored in both the activation and control groups. The activation service rewards improvements in physical activity or reductions in sedentary behaviour. The performance and completion of the military service of the participants will also be followed. The study will provide new information of physical activity, health and health behaviour of young men. Furthermore, a novel model including methods for increasing physical activity among young people is developed and its effects tested through an intervention. This unique gamified service for activating young men can provide a translational model for community use. It can also be utilized as such or tailored to other selected populations or age groups. ClinicalTrials.gov Identifier: NCT01376986.

76 FR 59696 - Agency Information Collection Activities; Submission to OMB for Review and Approval; Comment...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-09-27

... Activities; Submission to OMB for Review and Approval; Comment Request; Exchange Network Grants Progress...: Exchange Network Grants Progress Reports (Renewal). ICR Numbers: EPA ICR No. 2207.04, OMB Control No. 2025... Network (NEIEN) Grant Program. The EPA Office of Environmental Information provides funding to EPA's...

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.

Engaging rural women in healthy lifestyle programs: insights from a randomized controlled trial.

PubMed

Kozica, Samantha L; Harrison, Cheryce L; Teede, Helena J; Ng, Sze; Moran, Lisa J; Lombard, Catherine B

2015-09-16

The obesity epidemic is well established, particularly in rural settings. Programs promoting healthy lifestyles for rural women are urgently needed; however, participant engagement is challenging. In the context of a large randomized controlled trial targeting the prevention of weight gain in rural women, we explored successful recruitment strategies and aimed to understand participants' barriers, enablers and reasons for program participation. We recruited women (aged 18-55 years) from the general rural Australian population. A mixed-methods approach was applied to explore factors that influenced program participation, including quantitative questionnaires for all participants (n = 649) and qualitative semi-structured interviews conducted for a subgroup of participants (n = 45). Data were collected at three time points: baseline, 6 and 12 months post program commencement. We recruited 649 rural women through a community communication and partnering strategy, a program marketing campaign and mobilization of social networks. Program participants were diverse across education and income levels and were representative of the wider Australian regional population. Factors that influenced program engagement were divided into personal (perceived program benefits and program accessibility) and social (peer persuasion and support). Identified enablers included convenience of the program location, perceived program utility, such as weight management and optimization of lifestyle choices, as well as attending the program with peer support. Barriers to engagement, which are likely exacerbated in rural communities included lack of anonymity, self-consciousness and segregated social networks in rural settings. Participants reported that eliciting local support and maximizing publicity is fundamental to improving future program engagement. Multiple program promotion strategies including communication, marketing and partnering, as well as mobilization of social networks and peer persuasion, enabled engagement of rural women into a healthy lifestyle program. These recruitment strategies are consistent with successful strategies utilized previously to recruit urban-dwelling women into lifestyle programs. Future engagement efforts in rural settings could be enhanced by hosting multiple sessions within existing socio-cultural networks and assuring participants that they will not need to share their personal health information with others in their community. Australia & New Zealand Clinical Trial Registry. Trial number ACTRN12612000115831. Date of registration 24 January 2012.

Hockey Fans in Training: A Pilot Pragmatic Randomized Controlled Trial

PubMed Central

PETRELLA, ROBERT J.; GILL, DAWN P.; ZOU, GUANGYONG; DE CRUZ, ASHLEIGH; RIGGIN, BRENDAN; BARTOL, CASSANDRA; DANYLCHUK, KAREN; HUNT, KATE; WYKE, SALLY; GRAY, CINDY M.; BUNN, CHRISTOPHER; ZWARENSTEIN, MERRICK

2017-01-01

ABSTRACT Introduction Hockey Fans in Training (Hockey FIT) is a gender-sensitized weight loss and healthy lifestyle program. We investigated 1) feasibility of recruiting and retaining overweight and obese men into a pilot pragmatic randomized controlled trial and 2) potential for Hockey FIT to lead to weight loss and improvements in other outcomes at 12 wk and 12 months. Methods Male fans of two ice hockey teams (35–65 yr; body mass index ≥28 kg·m−2) located in Ontario (Canada) were randomized to intervention (Hockey FIT) or comparator (wait-list control). Hockey FIT includes a 12-wk active phase (weekly, coach-led group meetings including provision of dietary information, practice of behavior change techniques, and safe exercise sessions plus incremental pedometer walking) and a 40-wk minimally supported phase (smartphone app for sustaining physical activity, private online social network, standardized e-mails, booster session/reunion). Measurement at baseline and 12 wk (both groups) and 12 months (intervention group only) included clinical outcomes (e.g., weight) and self-reported physical activity, diet, and self-rated health. Results Eighty men were recruited in 4 wk; trial retention was >80% at 12 wk and >75% at 12 months. At 12 wk, the intervention group lost 3.6 kg (95% confidence interval, −5.26 to −1.90 kg) more than the comparator group (P < 0.001) and maintained this weight loss to 12 months. The intervention group also demonstrated greater improvements in other clinical measures, physical activity, diet, and self-rated health at 12 wk; most sustained to 12 months. Conclusions Results suggest feasible recruitment/retention of overweight and obese men in the Hockey FIT program. Results provide evidence for the potential effectiveness of Hockey FIT for weight loss and improved health in at-risk men and, thus, evidence to proceed with a definitive trial. PMID:28719494

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.

A Data Driven Network Approach to Rank Countries Production Diversity and Food Specialization

PubMed Central

Tu, Chengyi; Carr, Joel

2016-01-01

The easy access to large data sets has allowed for leveraging methodology in network physics and complexity science to disentangle patterns and processes directly from the data, leading to key insights in the behavior of systems. Here we use country specific food production data to study binary and weighted topological properties of the bipartite country-food production matrix. This country-food production matrix can be: 1) transformed into overlap matrices which embed information regarding shared production of products among countries, and or shared countries for individual products, 2) identify subsets of countries which produce similar commodities or subsets of commodities shared by a given country allowing for visualization of correlations in large networks, and 3) used to rank country fitness (the ability to produce a diverse array of products weighted on the type of food commodities) and food specialization (quantified on the number of countries producing a specific food product weighted on their fitness). Our results show that, on average, countries with high fitness produce both low and high specializion food commodities, whereas nations with low fitness tend to produce a small basket of diverse food products, typically comprised of low specializion food commodities. PMID:27832118

A Data Driven Network Approach to Rank Countries Production Diversity and Food Specialization.

PubMed

Tu, Chengyi; Carr, Joel; Suweis, Samir

2016-01-01

The easy access to large data sets has allowed for leveraging methodology in network physics and complexity science to disentangle patterns and processes directly from the data, leading to key insights in the behavior of systems. Here we use country specific food production data to study binary and weighted topological properties of the bipartite country-food production matrix. This country-food production matrix can be: 1) transformed into overlap matrices which embed information regarding shared production of products among countries, and or shared countries for individual products, 2) identify subsets of countries which produce similar commodities or subsets of commodities shared by a given country allowing for visualization of correlations in large networks, and 3) used to rank country fitness (the ability to produce a diverse array of products weighted on the type of food commodities) and food specialization (quantified on the number of countries producing a specific food product weighted on their fitness). Our results show that, on average, countries with high fitness produce both low and high specializion food commodities, whereas nations with low fitness tend to produce a small basket of diverse food products, typically comprised of low specializion food commodities.

Delivering Health Information via Podcast or Web: Media Effects on Psychosocial and Physiological Responses

PubMed Central

Turner-McGrievy, Gabrielle; Kalyanaraman, Sri; Campbell, Marci K.

2016-01-01

This study explored differences in psychosocial and physiological variables in response to being presented with information on weight loss through either reading text on a website or listening to the same information via podcast. Participants were randomized to receive a weight loss website (n = 20) or podcast (n = 20). Participants had skin conductance levels measured and completed questionnaire items assessing demographic characteristics, user control, novelty, and knowledge. Participants in the podcast group exhibited greater levels of physiological arousal and reported the intervention to be more novel than those in the Web group; however, the Web group reported greater user control. There was no difference in knowledge between the groups. This study presents the first step in examining the role that novelty and user control may play in two different weight-loss electronic media, as well as differences in knowledge acquisition. Future research should explore adding additional media features, such as video content, to the podcasts and websites in order to optimize fully the different mediums and to examine whether user control and novelty are potential mediators of weight loss outcomes. PMID:22420785

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.

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.

Analysis of a large-scale weighted network of one-to-one human communication

NASA Astrophysics Data System (ADS)

Onnela, Jukka-Pekka; Saramäki, Jari; Hyvönen, Jörkki; Szabó, Gábor; Argollo de Menezes, M.; Kaski, Kimmo; Barabási, Albert-László; Kertész, János

2007-06-01

We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks.

Tongue Images Classification Based on Constrained High Dispersal Network.

PubMed

Meng, Dan; Cao, Guitao; Duan, Ye; Zhu, Minghua; Tu, Liping; Xu, Dong; Xu, Jiatuo

2017-01-01

Computer aided tongue diagnosis has a great potential to play important roles in traditional Chinese medicine (TCM). However, the majority of the existing tongue image analyses and classification methods are based on the low-level features, which may not provide a holistic view of the tongue. Inspired by deep convolutional neural network (CNN), we propose a novel feature extraction framework called constrained high dispersal neural networks (CHDNet) to extract unbiased features and reduce human labor for tongue diagnosis in TCM. Previous CNN models have mostly focused on learning convolutional filters and adapting weights between them, but these models have two major issues: redundancy and insufficient capability in handling unbalanced sample distribution. We introduce high dispersal and local response normalization operation to address the issue of redundancy. We also add multiscale feature analysis to avoid the problem of sensitivity to deformation. Our proposed CHDNet learns high-level features and provides more classification information during training time, which may result in higher accuracy when predicting testing samples. We tested the proposed method on a set of 267 gastritis patients and a control group of 48 healthy volunteers. Test results show that CHDNet is a promising method in tongue image classification for the TCM study.

Glove-talk II - a neural-network interface which maps gestures to parallel formant speech synthesizer controls.

PubMed

Fels, S S; Hinton, G E

1997-01-01

Glove-Talk II is a system which translates hand gestures to speech through an adaptive interface. Hand gestures are mapped continuously to ten control parameters of a parallel formant speech synthesizer. The mapping allows the hand to act as an artificial vocal tract that produces speech in real time. This gives an unlimited vocabulary in addition to direct control of fundamental frequency and volume. Currently, the best version of Glove-Talk II uses several input devices, a parallel formant speech synthesizer, and three neural networks. The gesture-to-speech task is divided into vowel and consonant production by using a gating network to weight the outputs of a vowel and a consonant neural network. The gating network and the consonant network are trained with examples from the user. The vowel network implements a fixed user-defined relationship between hand position and vowel sound and does not require any training examples from the user. Volume, fundamental frequency, and stop consonants are produced with a fixed mapping from the input devices. With Glove-Talk II, the subject can speak slowly but with far more natural sounding pitch variations than a text-to-speech synthesizer.

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.

Decentralized event-triggered consensus control strategy for leader-follower networked systems

NASA Astrophysics Data System (ADS)

Zhang, Shouxu; Xie, Duosi; Yan, Weisheng

2017-08-01

In this paper, the consensus problem of leader-follower networked systems is addressed. At first, a centralized and a decentralized event-triggered control strategy are proposed, which make the control actuators of followers update at aperiodic invent interval. In particular, the latter one makes each follower requires the local information only. After that, an improved triggering function that only uses the follower's own information and the neighbors' states at their latest event instants is developed to relax the requirement of the continuous state of the neighbors. In addition, the strategy does not require the information of the topology, nor the eigenvalues of the Laplacian matrix. And if the follower does not have direct connection to the leader, the leader's information is not required either. It is analytically shown that by using the proposed strategy the leader-follower networked system is able to reach consensus without continuous communication among followers. Simulation examples are given to show effectiveness of the proposed control strategy.

Locating influential nodes in complex networks

PubMed Central

Malliaros, Fragkiskos D.; Rossi, Maria-Evgenia G.; Vazirgiannis, Michalis

2016-01-01

Understanding and controlling spreading processes in networks is an important topic with many diverse applications, including information dissemination, disease propagation and viral marketing. It is of crucial importance to identify which entities act as influential spreaders that can propagate information to a large portion of the network, in order to ensure efficient information diffusion, optimize available resources or even control the spreading. In this work, we capitalize on the properties of the K-truss decomposition, a triangle-based extension of the core decomposition of graphs, to locate individual influential nodes. Our analysis on real networks indicates that the nodes belonging to the maximal K-truss subgraph show better spreading behavior compared to previously used importance criteria, including node degree and k-core index, leading to faster and wider epidemic spreading. We further show that nodes belonging to such dense subgraphs, dominate the small set of nodes that achieve the optimal spreading in the network. PMID:26776455

Sensitivity of feedforward neural networks to weight errors

NASA Technical Reports Server (NTRS)

Stevenson, Maryhelen; Widrow, Bernard; Winter, Rodney

1990-01-01

An analysis is made of the sensitivity of feedforward layered networks of Adaline elements (threshold logic units) to weight errors. An approximation is derived which expresses the probability of error for an output neuron of a large network (a network with many neurons per layer) as a function of the percentage change in the weights. As would be expected, the probability of error increases with the number of layers in the network and with the percentage change in the weights. The probability of error is essentially independent of the number of weights per neuron and of the number of neurons per layer, as long as these numbers are large (on the order of 100 or more).

Supervised learning from human performance at the computationally hard problem of optimal traffic signal control on a network of junctions

PubMed Central

Box, Simon

2014-01-01

Optimal switching of traffic lights on a network of junctions is a computationally intractable problem. In this research, road traffic networks containing signallized junctions are simulated. A computer game interface is used to enable a human ‘player’ to control the traffic light settings on the junctions within the simulation. A supervised learning approach, based on simple neural network classifiers can be used to capture human player's strategies in the game and thus develop a human-trained machine control (HuTMaC) system that approaches human levels of performance. Experiments conducted within the simulation compare the performance of HuTMaC to two well-established traffic-responsive control systems that are widely deployed in the developed world and also to a temporal difference learning-based control method. In all experiments, HuTMaC outperforms the other control methods in terms of average delay and variance over delay. The conclusion is that these results add weight to the suggestion that HuTMaC may be a viable alternative, or supplemental method, to approximate optimization for some practical engineering control problems where the optimal strategy is computationally intractable. PMID:26064570

Supervised learning from human performance at the computationally hard problem of optimal traffic signal control on a network of junctions.

PubMed

Box, Simon

2014-12-01

Optimal switching of traffic lights on a network of junctions is a computationally intractable problem. In this research, road traffic networks containing signallized junctions are simulated. A computer game interface is used to enable a human 'player' to control the traffic light settings on the junctions within the simulation. A supervised learning approach, based on simple neural network classifiers can be used to capture human player's strategies in the game and thus develop a human-trained machine control (HuTMaC) system that approaches human levels of performance. Experiments conducted within the simulation compare the performance of HuTMaC to two well-established traffic-responsive control systems that are widely deployed in the developed world and also to a temporal difference learning-based control method. In all experiments, HuTMaC outperforms the other control methods in terms of average delay and variance over delay. The conclusion is that these results add weight to the suggestion that HuTMaC may be a viable alternative, or supplemental method, to approximate optimization for some practical engineering control problems where the optimal strategy is computationally intractable.

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

Index of tobacco control sustainability (ITCS): a tool to measure the sustainability of national tobacco control programmes.

PubMed

Jackson-Morris, Angela; Latif, Ehsan

2017-03-01

To produce a tool to assess and guide sustainability of national tobacco control programmes. A two-stage process adapting the Delphi and Nominal group techniques. A series of indicators of tobacco control sustainability were identified in grantee/country advisor reports to The International Union Against Tuberculosis and Lung Disease under the Bloomberg Initiative to Reduce Tobacco Control (2007-2015). Focus groups and key informant interviews in seven low and middle-income countries (52 government and civil society participants) provided consensus ratings of the indicators' relative importance. Data were reviewed and the indicators were accorded relative weightings to produce the 'Index of Tobacco Control Sustainability' (ITCS). All 31 indicators were considered 'Critical' or 'Important' by the great majority of participants. There was consensus that a tool to measure progress towards tobacco control sustainability was important. The most critical indicators related to financial policies and allocations, a national law, a dedicated national tobacco control unit and civil society tobacco control network, a national policy against tobacco industry 'Corporate Social Responsibility' (CSR), national mortality and morbidity data, and national policy evaluation mechanisms. The 31 indicators were agreed to be 'critical' or 'important' factors for tobacco control sustainability. The Index comprises the weighted indicators as a tool to identify aspects of national tobacco control programmes requiring further development to augment their sustainability and to measure and compare progress over time. The next step is to apply the ITCS and produce tobacco control sustainability assessments. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/.

Access Selection Algorithm of Heterogeneous Wireless Networks for Smart Distribution Grid Based on Entropy-Weight and Rough Set

NASA Astrophysics Data System (ADS)

Xiang, Min; Qu, Qinqin; Chen, Cheng; Tian, Li; Zeng, Lingkang

2017-11-01

To improve the reliability of communication service in smart distribution grid (SDG), an access selection algorithm based on dynamic network status and different service types for heterogeneous wireless networks was proposed. The network performance index values were obtained in real time by multimode terminal and the variation trend of index values was analyzed by the growth matrix. The index weights were calculated by entropy-weight and then modified by rough set to get the final weights. Combining the grey relational analysis to sort the candidate networks, and the optimum communication network is selected. Simulation results show that the proposed algorithm can implement dynamically access selection in heterogeneous wireless networks of SDG effectively and reduce the network blocking probability.

Fisher information at the edge of chaos in random Boolean networks.

PubMed

Wang, X Rosalind; Lizier, Joseph T; Prokopenko, Mikhail

2011-01-01

We study the order-chaos phase transition in random Boolean networks (RBNs), which have been used as models of gene regulatory networks. In particular we seek to characterize the phase diagram in information-theoretic terms, focusing on the effect of the control parameters (activity level and connectivity). Fisher information, which measures how much system dynamics can reveal about the control parameters, offers a natural interpretation of the phase diagram in RBNs. We report that this measure is maximized near the order-chaos phase transitions in RBNs, since this is the region where the system is most sensitive to its parameters. Furthermore, we use this study of RBNs to clarify the relationship between Shannon and Fisher information measures.

Rate-based congestion control in networks with smart links, revision. B.S. Thesis - May 1988

NASA Technical Reports Server (NTRS)

Heybey, Andrew Tyrrell

1990-01-01

The author uses a network simulator to explore rate-based congestion control in networks with smart links that can feed back information to tell senders to adjust their transmission rates. This method differs in a very important way from congestion control in which a congested network component just drops packets - the most commonly used method. It is clearly advantageous for the links in the network to communicate with the end users about the network capacity, rather than the users unilaterally picking a transmission rate. The components in the middle of the network, not the end users, have information about the capacity and traffic in the network. The author experiments with three different algorithms for calculating the control rate to feed back to the users. All of the algorithms exhibit problems in the form of large queues when simulated with a configuration modeling the dynamics of a packet-voice system. However, the problems are not with the algorithms themselves, but with the fact that feedback takes time. If the network steady-state utilization is low enough that it can absorb transients in the traffic through it, then the large queues disappear. If the users are modified to start sending slowly, to allow the network to adapt to a new flow without causing congestion, a greater portion of the network's bandwidth can be used.

Communication Dynamics in Finite Capacity Social Networks

NASA Astrophysics Data System (ADS)

Haerter, Jan O.; Jamtveit, Bjørn; Mathiesen, Joachim

2012-10-01

In communication networks, structure and dynamics are tightly coupled. The structure controls the flow of information and is itself shaped by the dynamical process of information exchanged between nodes. In order to reconcile structure and dynamics, a generic model, based on the local interaction between nodes, is considered for the communication in large social networks. In agreement with data from a large human organization, we show that the flow is non-Markovian and controlled by the temporal limitations of individuals. We confirm the versatility of our model by predicting simultaneously the degree-dependent node activity, the balance between information input and output of nodes, and the degree distribution. Finally, we quantify the limitations to network analysis when it is based on data sampled over a finite period of time.

Associations Between Internet-Based Professional Social Networking and Emotional Distress.

PubMed

Jones, Jacquelynn R; Colditz, Jason B; Shensa, Ariel; Sidani, Jaime E; Lin, Liu Yi; Terry, Martha Ann; Primack, Brian A

2016-10-01

Professional social networking websites are commonly used among young professionals. In light of emerging concerns regarding social networking use and emotional distress, the purpose of this study was to investigate the association between frequency of use of LinkedIn, the most commonly used professional social networking website, and depression and anxiety among young adults. In October 2014, we assessed a nationally representative sample of 1,780 U.S. young adults between the ages of 19-32 regarding frequency of LinkedIn use, depression and anxiety, and sociodemographic covariates. We measured depression and anxiety using validated Patient-Reported Outcomes Measurement Information System measures. We used bivariable and multivariable logistic regression to assess the association between LinkedIn use and depression and anxiety, while controlling for age, sex, race, relationship status, living situation, household income, education level, and overall social media use. In weighted analyses, 72% of participants did not report use of LinkedIn, 16% reported at least some use, but less than once each week, and 12% reported use at least once per week. In multivariable analyses controlling for all covariates, compared with those who did not use LinkedIn, participants using LinkedIn at least once per week had significantly greater odds of increased depression (adjusted odds ratio [AOR] = 2.10, 95% confidence interval [CI] = 1.31-3.38) and increased anxiety (AOR = 2.79, 95% CI = 1.72-4.53). LinkedIn use was significantly related to both outcomes in a dose-response manner. Future research should investigate directionality of this association and possible reasons for it.

Network Centric Warfare: A Realistic Defense Alternative for Smaller Nations?

DTIC Science & Technology

2004-06-01

organic information sources. The degree to which force entities are networked will determine the quality of information that is available to various...control processes will determine the extent that information is shared, as well as the nature and quality of the interactions that occur between and...

Real-time evaluation of polyphenol oxidase (PPO) activity in lychee pericarp based on weighted combination of spectral data and image features as determined by fuzzy neural network.

PubMed

Yang, Yi-Chao; Sun, Da-Wen; Wang, Nan-Nan; Xie, Anguo

2015-07-01

A novel method of using hyperspectral imaging technique with the weighted combination of spectral data and image features by fuzzy neural network (FNN) was proposed for real-time prediction of polyphenol oxidase (PPO) activity in lychee pericarp. Lychee images were obtained by a hyperspectral reflectance imaging system operating in the range of 400-1000nm. A support vector machine-recursive feature elimination (SVM-RFE) algorithm was applied to eliminating variables with no or little information for the prediction from all bands, resulting in a reduced set of optimal wavelengths. Spectral information at the optimal wavelengths and image color features were then used respectively to develop calibration models for the prediction of PPO in pericarp during storage, and the results of two models were compared. In order to improve the prediction accuracy, a decision strategy was developed based on weighted combination of spectral data and image features, in which the weights were determined by FNN for a better estimation of PPO activity. The results showed that the combined decision model was the best among all of the calibration models, with high R(2) values of 0.9117 and 0.9072 and low RMSEs of 0.45% and 0.459% for calibration and prediction, respectively. These results demonstrate that the proposed weighted combined decision method has great potential for improving model performance. The proposed technique could be used for a better prediction of other internal and external quality attributes of fruits. Copyright © 2015 Elsevier B.V. All rights reserved.

The network and transmission of based on the principle of laser multipoint communication

NASA Astrophysics Data System (ADS)

Fu, Qiang; Liu, Xianzhu; Jiang, Huilin; Hu, Yuan; Jiang, Lun

2014-11-01

Space laser communication is the perfectly choose to the earth integrated information backbone network in the future. This paper introduces the structure of the earth integrated information network that is a large capacity integrated high-speed broadband information network, a variety of communications platforms were densely interconnected together, such as the land, sea, air and deep air users or aircraft, the technologies of the intelligent high-speed processing, switching and routing were adopt. According to the principle of maximum effective comprehensive utilization of information resources, get accurately information, fast processing and efficient transmission through inter-satellite, satellite earth, sky and ground station and other links. Namely it will be a space-based, air-based and ground-based integrated information network. It will be started from the trends of laser communication. The current situation of laser multi-point communications were expounded, the transmission scheme of the dynamic multi-point between wireless laser communication n network has been carefully studied, a variety of laser communication network transmission schemes the corresponding characteristics and scope described in detail , described the optical multiplexer machine that based on the multiport form of communication is applied to relay backbone link; the optical multiplexer-based on the form of the segmentation receiver field of view is applied to small angle link, the optical multiplexer-based form of three concentric spheres structure is applied to short distances, motorized occasions, and the multi-point stitching structure based on the rotation paraboloid is applied to inter-satellite communications in detail. The multi-point laser communication terminal apparatus consist of the transmitting and receiving antenna, a relay optical system, the spectroscopic system, communication system and communication receiver transmitter system. The communication forms of optical multiplexer more than four goals or more, the ratio of received power and volume weight will be Obvious advantages, and can track multiple moving targets in flexible.It would to provide reference for the construction of earth integrated information networks.

Synchronization of discrete-time neural networks with delays and Markov jump topologies based on tracker information.

PubMed

Yang, Xinsong; Feng, Zhiguo; Feng, Jianwen; Cao, Jinde

2017-01-01

In this paper, synchronization in an array of discrete-time neural networks (DTNNs) with time-varying delays coupled by Markov jump topologies is considered. It is assumed that the switching information can be collected by a tracker with a certain probability and transmitted from the tracker to controller precisely. Then the controller selects suitable control gains based on the received switching information to synchronize the network. This new control scheme makes full use of received information and overcomes the shortcomings of mode-dependent and mode-independent control schemes. Moreover, the proposed control method includes both the mode-dependent and mode-independent control techniques as special cases. By using linear matrix inequality (LMI) method and designing new Lyapunov functionals, delay-dependent conditions are derived to guarantee that the DTNNs with Markov jump topologies to be asymptotically synchronized. Compared with existing results on Markov systems which are obtained by separately using mode-dependent and mode-independent methods, our result has great flexibility in practical applications. Numerical simulations are finally given to demonstrate the effectiveness of the theoretical results. Copyright © 2016 Elsevier Ltd. All rights reserved.

Stability and performance of propulsion control systems with distributed control architectures and failures

NASA Astrophysics Data System (ADS)

Belapurkar, Rohit K.

Future aircraft engine control systems will be based on a distributed architecture, in which, the sensors and actuators will be connected to the Full Authority Digital Engine Control (FADEC) through an engine area network. Distributed engine control architecture will allow the implementation of advanced, active control techniques along with achieving weight reduction, improvement in performance and lower life cycle cost. The performance of a distributed engine control system is predominantly dependent on the performance of the communication network. Due to the serial data transmission policy, network-induced time delays and sampling jitter are introduced between the sensor/actuator nodes and the distributed FADEC. Communication network faults and transient node failures may result in data dropouts, which may not only degrade the control system performance but may even destabilize the engine control system. Three different architectures for a turbine engine control system based on a distributed framework are presented. A partially distributed control system for a turbo-shaft engine is designed based on ARINC 825 communication protocol. Stability conditions and control design methodology are developed for the proposed partially distributed turbo-shaft engine control system to guarantee the desired performance under the presence of network-induced time delay and random data loss due to transient sensor/actuator failures. A fault tolerant control design methodology is proposed to benefit from the availability of an additional system bandwidth and from the broadcast feature of the data network. It is shown that a reconfigurable fault tolerant control design can help to reduce the performance degradation in presence of node failures. A T-700 turbo-shaft engine model is used to validate the proposed control methodology based on both single input and multiple-input multiple-output control design techniques.

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.

Reward-Modulated Hebbian Plasticity as Leverage for Partially Embodied Control in Compliant Robotics

PubMed Central

Burms, Jeroen; Caluwaerts, Ken; Dambre, Joni

2015-01-01

In embodied computation (or morphological computation), part of the complexity of motor control is offloaded to the body dynamics. We demonstrate that a simple Hebbian-like learning rule can be used to train systems with (partial) embodiment, and can be extended outside of the scope of traditional neural networks. To this end, we apply the learning rule to optimize the connection weights of recurrent neural networks with different topologies and for various tasks. We then apply this learning rule to a simulated compliant tensegrity robot by optimizing static feedback controllers that directly exploit the dynamics of the robot body. This leads to partially embodied controllers, i.e., hybrid controllers that naturally integrate the computations that are performed by the robot body into a neural network architecture. Our results demonstrate the universal applicability of reward-modulated Hebbian learning. Furthermore, they demonstrate the robustness of systems trained with the learning rule. This study strengthens our belief that compliant robots should or can be seen as computational units, instead of dumb hardware that needs a complex controller. This link between compliant robotics and neural networks is also the main reason for our search for simple universal learning rules for both neural networks and robotics. PMID:26347645

Neuronal integration of dynamic sources: Bayesian learning and Bayesian inference.

PubMed

Siegelmann, Hava T; Holzman, Lars E

2010-09-01

One of the brain's most basic functions is integrating sensory data from diverse sources. This ability causes us to question whether the neural system is computationally capable of intelligently integrating data, not only when sources have known, fixed relative dependencies but also when it must determine such relative weightings based on dynamic conditions, and then use these learned weightings to accurately infer information about the world. We suggest that the brain is, in fact, fully capable of computing this parallel task in a single network and describe a neural inspired circuit with this property. Our implementation suggests the possibility that evidence learning requires a more complex organization of the network than was previously assumed, where neurons have different specialties, whose emergence brings the desired adaptivity seen in human online inference.

Green neighborhoods, food retail and childhood overweight: differences by population density.

PubMed

Liu, Gilbert C; Wilson, Jeffrey S; Qi, Rong; Ying, Jun

2007-01-01

This study examines relationships between overweight in children and two environmentalfactors--amount of vegetation surrounding a child's place of residence and proximity of the child's residence to various types of food retail locations. We hypothesize that living in greener neighborhoods, farther from fast food restaurants, and closer to supermarkets would be associated with lower risk of overweight. Cross-sectional study. Network of primary care pediatric clinics in Marion County, Indiana. We acquired data for 7334 subjects, ages 3 to 18 years, presenting for routine well-child care. Neighborhood vegetation and proximity to food retail were calculated using geographic information systems for each subject using circular and network buffers. Child weight status was defined using body mass index percentiles. Analysis. We used cumulative logit models to examine associations between an index of overweight, neighborhood vegetation, and food retail environment. After controlling for individual socio-demographics and neighborhood socioeconomic status, measures of vegetation and food retail significantly predicted overweight in children. Increased neighborhood vegetation was associated with decreased risk for overweight, but only for subjects residing in higher population density regions. Increased distance between a subject's residence and the nearest large brand name supermarkets was associated with increased risk of overweight, but only for subjects residing in lower population density regions. This research suggests that aspects of the built environment are determinants of child weight status, ostensibly by influencing physical activity and dietary behaviors.

Preparation of poly(ethylene glycol) hydrogels with different network structures for the application of enzyme immobilization.

PubMed

Choi, Dongkil; Lee, Woojin; Park, Jinwon; Koh, Wongun

2008-01-01

In this study, poly(ethylene glycol) (PEG)-based hydrogels having different network structures were synthesized by UV-initiated photopolymerization and used for the enzyme immobilization. PEGs with different molecular weight were acrylated by derivatizing both ends with acryloyl chloride and photopolymerization of PEG-diacrylate (PEG-DA) yielded crosslinked hydrogel network within 5 seconds. Attachment of acrylate groups and gelation were confirmed by ATR/FT-IR and FT-Raman spectroscopy. Network structures of hydrogels could be easily controlled by changing the molecular weight (MW) of PEG-DA and characterized by calculating molecular weight between crosslinks and mesh size from the swelling measurement. Synthesis of hydrogels with higher MW of PEG produced less crosslinked hydrogels having higher water content, larger value of Mc and mesh size, which resulted in enhanced mass transfer but loss of mechanical properties. For the enzyme immobilization, glucose oxidase (GOX) was immobilized inside PEG hydrogels by means of physical entrapment and covalent immobilization. Encapsulated GOX were covalently bound to PEG backbone using acryloyl-PEG-N-hydroxysuccinimide and maintained their activity over a week period without leakage. Kinetic study indicated that immobilized enzyme inside hydrogel prepared from higher MW of PEG possessed lower apparent Km (Michaelis-Menten constant) and higher activity.

Leptin signaling and leptin resistance

PubMed Central

Zhou, Yingjiang; Rui, Liangyou

2014-01-01

Leptin is secreted into the bloodstream by adipocytes and is required for the maintenance of energy homeostasis and body weight. Leptin deficiency or genetic defects in the components of the leptin signaling pathways causes obesity. Leptin controls energy balance and body weight primarily by targeting LEPRb-expressing neurons in the brain, particularly in the hypothalamus. These LEPRb-expressing neurons function as the first-order neurons that project to the second-order neurons located within and outside the hypothalamus, forming a neural network that controls the energy homeostasis and body weight. Multiple factors, including inflammation and ER stress, contribute to leptin resistance, and leptin resistance is the key risk factor for obesity. This review is focused on recent advance about leptin action, leptin signaling, and leptin resistance. PMID:23580174

Combining PubMed knowledge and EHR data to develop a weighted bayesian network for pancreatic cancer prediction.

PubMed

Zhao, Di; Weng, Chunhua

2011-10-01

In this paper, we propose a novel method that combines PubMed knowledge and Electronic Health Records to develop a weighted Bayesian Network Inference (BNI) model for pancreatic cancer prediction. We selected 20 common risk factors associated with pancreatic cancer and used PubMed knowledge to weigh the risk factors. A keyword-based algorithm was developed to extract and classify PubMed abstracts into three categories that represented positive, negative, or neutral associations between each risk factor and pancreatic cancer. Then we designed a weighted BNI model by adding the normalized weights into a conventional BNI model. We used this model to extract the EHR values for patients with or without pancreatic cancer, which then enabled us to calculate the prior probabilities for the 20 risk factors in the BNI. The software iDiagnosis was designed to use this weighted BNI model for predicting pancreatic cancer. In an evaluation using a case-control dataset, the weighted BNI model significantly outperformed the conventional BNI and two other classifiers (k-Nearest Neighbor and Support Vector Machine). We conclude that the weighted BNI using PubMed knowledge and EHR data shows remarkable accuracy improvement over existing representative methods for pancreatic cancer prediction. Copyright © 2011 Elsevier Inc. All rights reserved.

Combining PubMed Knowledge and EHR Data to Develop a Weighted Bayesian Network for Pancreatic Cancer Prediction

PubMed Central

Zhao, Di; Weng, Chunhua

2011-01-01

In this paper, we propose a novel method that combines PubMed knowledge and Electronic Health Records to develop a weighted Bayesian Network Inference (BNI) model for pancreatic cancer prediction. We selected 20 common risk factors associated with pancreatic cancer and used PubMed knowledge to weigh the risk factors. A keyword-based algorithm was developed to extract and classify PubMed abstracts into three categories that represented positive, negative, or neutral associations between each risk factor and pancreatic cancer. Then we designed a weighted BNI model by adding the normalized weights into a conventional BNI model. We used this model to extract the EHR values for patients with or without pancreatic cancer, which then enabled us to calculate the prior probabilities for the 20 risk factors in the BNI. The software iDiagnosis was designed to use this weighted BNI model for predicting pancreatic cancer. In an evaluation using a case-control dataset, the weighted BNI model significantly outperformed the conventional BNI and two other classifiers (k-Nearest Neighbor and Support Vector Machine). We conclude that the weighted BNI using PubMed knowledge and EHR data shows remarkable accuracy improvement over existing representative methods for pancreatic cancer prediction. PMID:21642013

Management of ATM-based networks supporting multimedia medical information systems

NASA Astrophysics Data System (ADS)

Whitman, Robert A.; Blaine, G. James; Fritz, Kevin; Goodgold, Ken; Heisinger, Patrick

1997-05-01

Medical information systems are acquiring the ability to collect and deliver many different types of medical information. In support of the increased network demands necessitated by these expanded capabilities, asynchronous transfer mode (ATM) based networks are being deployed in medical care systems. While ATM supplies a much greater line rate than currently deployed networks, the management and standards surrounding ATM are yet to mature. This paper explores the management and control issues surrounding an ATM network supporting medical information systems, and examines how management impacts network performance and robustness. A multivendor ATM network at the BJC Health System/Washington University and the applications using the network are discussed. Performance information for specific applications is presented and analyzed. Network management's influence on application reliability is outlined. The information collected is used to show how ATM network standards and management tools influence network reliability and performance. Performance of current applications using the ATM network is discussed. Special attention is given to issues encountered in implementation of hypertext transfer protocol over ATM internet protocol (IP) communications. A classical IP ATM implementation yields greater than twenty percent higher network performance over LANE. Maximum performance for a host's suite of applications can be obtained by establishing multiple individually engineered IP links through its ATM network connection.

Environmental Public Health Tracking: Health and Environment Linked for Information Exchange-Atlanta (HEXIX-Atlanta: A cooperative Program Between CDC and NASA for Development of an Environmental Public Health Tracking Network in the Atlanta Metropolitan Area

NASA Technical Reports Server (NTRS)

Quattrochi, Dale A.; Niskar, Amanda Sue

2005-01-01

The Centers for Disease Control and Prevention (CDC) is coordinating HELIX- Atlanta to provide information regarding the five-county Metropolitan Atlanta Area (Clayton, Cobb, DeKalb, Fulton, and Gwinett) via a network of integrated environmental monitoring and public health data systems so that all sectors can take action to prevent and control environmentally related health effects. The HELIX-Atlanta Network is a tool to access interoperable information systems with optional information technology linkage functionality driven by scientific rationale. HELIX-Atlanta is a collaborative effort with local, state, federal, and academic partners, including the NASA Marshall Space Flight Center. The HELIX-Atlanta Partners identified the following HELIX-Atlanta initial focus areas: childhood lead poisoning, short-latency cancers, developmental disabilities, birth defects, vital records, respiratory health, age of housing, remote sensing data, and environmental monitoring, HELIX-Atlanta Partners identified and evaluated information systems containing information on the above focus areas. The information system evaluations resulted in recommendations for what resources would be needed to interoperate selected information systems in compliance with the CDC Public Health Information Network (PHIN). This presentation will discuss the collaborative process of building a network that links health and environment data for information exchange, including NASA remote sensing data, for use in HELIX-Atlanta.

The informational architecture of the cell.

PubMed

Walker, Sara Imari; Kim, Hyunju; Davies, Paul C W

2016-03-13

We compare the informational architecture of biological and random networks to identify informational features that may distinguish biological networks from random. The study presented here focuses on the Boolean network model for regulation of the cell cycle of the fission yeast Schizosaccharomyces pombe. We compare calculated values of local and global information measures for the fission yeast cell cycle to the same measures as applied to two different classes of random networks: Erdös-Rényi and scale-free. We report patterns in local information processing and storage that do indeed distinguish biological from random, associated with control nodes that regulate the function of the fission yeast cell-cycle network. Conversely, we find that integrated information, which serves as a global measure of 'emergent' information processing, does not differ from random for the case presented. We discuss implications for our understanding of the informational architecture of the fission yeast cell-cycle network in particular, and more generally for illuminating any distinctive physics that may be operative in life. © 2016 The Author(s).

Reduced integration and improved segregation of functional brain networks in Alzheimer’s disease

NASA Astrophysics Data System (ADS)

Kabbara, A.; Eid, H.; El Falou, W.; Khalil, M.; Wendling, F.; Hassan, M.

2018-04-01

Objective. Emerging evidence shows that cognitive deficits in Alzheimer’s disease (AD) are associated with disruptions in brain functional connectivity. Thus, the identification of alterations in AD functional networks has become a topic of increasing interest. However, to what extent AD induces disruption of the balance of local and global information processing in the human brain remains elusive. The main objective of this study is to explore the dynamic topological changes of AD networks in terms of brain network segregation and integration. Approach. We used electroencephalography (EEG) data recorded from 20 participants (10 AD patients and 10 healthy controls) during resting state. Functional brain networks were reconstructed using EEG source connectivity computed in different frequency bands. Graph theoretical analyses were performed assess differences between both groups. Main results. Results revealed that AD networks, compared to networks of age-matched healthy controls, are characterized by lower global information processing (integration) and higher local information processing (segregation). Results showed also significant correlation between the alterations in the AD patients’ functional brain networks and their cognitive scores. Significance. These findings may contribute to the development of EEG network-based test that could strengthen results obtained from currently-used neurophysiological tests in neurodegenerative diseases.

Reduced integration and improved segregation of functional brain networks in Alzheimer's disease.

PubMed

Kabbara, A; Eid, H; El Falou, W; Khalil, M; Wendling, F; Hassan, M

2018-04-01

Emerging evidence shows that cognitive deficits in Alzheimer's disease (AD) are associated with disruptions in brain functional connectivity. Thus, the identification of alterations in AD functional networks has become a topic of increasing interest. However, to what extent AD induces disruption of the balance of local and global information processing in the human brain remains elusive. The main objective of this study is to explore the dynamic topological changes of AD networks in terms of brain network segregation and integration. We used electroencephalography (EEG) data recorded from 20 participants (10 AD patients and 10 healthy controls) during resting state. Functional brain networks were reconstructed using EEG source connectivity computed in different frequency bands. Graph theoretical analyses were performed assess differences between both groups. Results revealed that AD networks, compared to networks of age-matched healthy controls, are characterized by lower global information processing (integration) and higher local information processing (segregation). Results showed also significant correlation between the alterations in the AD patients' functional brain networks and their cognitive scores. These findings may contribute to the development of EEG network-based test that could strengthen results obtained from currently-used neurophysiological tests in neurodegenerative diseases.

Application of the device based on chirping of optical impulses for management of software-defined networks in dynamic mode

NASA Astrophysics Data System (ADS)

Vinogradova, Irina L.; Khasansin, Vadim R.; Andrianova, Anna V.; Yantilina, Liliya Z.; Vinogradov, Sergey L.

2016-03-01

The analysis of the influence of the physical layer concepts in optical networks on the performance of the whole network. It is concluded that the relevance of the search for new means of transmitting information on a physical level. It is proposed to use an optical chirp overhead transmission between controllers SDN. This article is devoted to research of a creation opportunity of optical neural switchboards controlled in addition by submitted optical radiation. It is supposed, that the managing radiation changes a parameter of refraction of optical environment of the device, and with it and length of a wave of information radiation. For the control by last is used multibeam interferometer. The brief estimation of technical aspects of construction of the device is carried out. The principle of using the device to an extensive network. Simulation of network performance parameters.

Design of the smart home system based on the optimal routing algorithm and ZigBee network.

PubMed

Jiang, Dengying; Yu, Ling; Wang, Fei; Xie, Xiaoxia; Yu, Yongsheng

2017-01-01

To improve the traditional smart home system, its electric wiring, networking technology, information transmission and facility control are studied. In this paper, we study the electric wiring, networking technology, information transmission and facility control to improve the traditional smart home system. First, ZigBee is used to replace the traditional electric wiring. Second, a network is built to connect lots of wireless sensors and facilities, thanks to the capability of ZigBee self-organized network and Genetic Algorithm-Particle Swarm Optimization Algorithm (GA-PSOA) to search for the optimal route. Finally, when the smart home system is connected to the internet based on the remote server technology, home environment and facilities could be remote real-time controlled. The experiments show that the GA-PSOA reduce the system delay and decrease the energy consumption of the wireless system.

Design of the smart home system based on the optimal routing algorithm and ZigBee network

PubMed Central

Xie, Xiaoxia

2017-01-01

To improve the traditional smart home system, its electric wiring, networking technology, information transmission and facility control are studied. In this paper, we study the electric wiring, networking technology, information transmission and facility control to improve the traditional smart home system. First, ZigBee is used to replace the traditional electric wiring. Second, a network is built to connect lots of wireless sensors and facilities, thanks to the capability of ZigBee self-organized network and Genetic Algorithm-Particle Swarm Optimization Algorithm (GA-PSOA) to search for the optimal route. Finally, when the smart home system is connected to the internet based on the remote server technology, home environment and facilities could be remote real-time controlled. The experiments show that the GA-PSOA reduce the system delay and decrease the energy consumption of the wireless system. PMID:29131868

Study protocol: differential effects of diet and physical activity based interventions in pregnancy on maternal and fetal outcomes--individual patient data (IPD) meta-analysis and health economic evaluation.

PubMed

Ruifrok, Anneloes E; Rogozinska, Ewelina; van Poppel, Mireille N M; Rayanagoudar, Girish; Kerry, Sally; de Groot, Christianne J M; Yeo, SeonAe; Molyneaux, Emma; McAuliffe, Fionnuala M; Poston, Lucilla; Roberts, Tracy; Riley, Richard D; Coomarasamy, Arri; Khan, Khalid; Mol, Ben Willem; Thangaratinam, Shakila

2014-11-04

Pregnant women who gain excess weight are at risk of complications during pregnancy and in the long term. Interventions based on diet and physical activity minimise gestational weight gain with varied effect on clinical outcomes. The effect of interventions on varied groups of women based on body mass index, age, ethnicity, socioeconomic status, parity, and underlying medical conditions is not clear. Our individual patient data (IPD) meta-analysis of randomised trials will assess the differential effect of diet- and physical activity-based interventions on maternal weight gain and pregnancy outcomes in clinically relevant subgroups of women. Randomised trials on diet and physical activity in pregnancy will be identified by searching the following databases: MEDLINE, EMBASE, BIOSIS, LILACS, Pascal, Science Citation Index, Cochrane Database of Systematic Reviews, Cochrane Central Register of Controlled Trials, Database of Abstracts of Reviews of Effects, and Health Technology Assessment Database. Primary researchers of the identified trials are invited to join the International Weight Management in Pregnancy Collaborative Network and share their individual patient data. We will reanalyse each study separately and confirm the findings with the original authors. Then, for each intervention type and outcome, we will perform as appropriate either a one-step or a two-step IPD meta-analysis to obtain summary estimates of effects and 95% confidence intervals, for all women combined and for each subgroup of interest. The primary outcomes are gestational weight gain and composite adverse maternal and fetal outcomes. The difference in effects between subgroups will be estimated and between-study heterogeneity suitably quantified and explored. The potential for publication bias and availability bias in the IPD obtained will be investigated. We will conduct a model-based economic evaluation to assess the cost effectiveness of the interventions to manage weight gain in pregnancy and undertake a value of information analysis to inform future research. PROSPERO 2013: CRD42013003804.