Hardware Realization of an Ethernet Packet Analyzer Search Engine
2000-06-30
specific for the home automation industry. This analyzer will be at the gateway of a network and analyze Ethernet packets as they go by. It will keep... home automation and not the computer network. This system is a stand-alone real-time network analyzer capable of decoding Ethernet protocols. The
Research on invulnerability of equipment support information network
NASA Astrophysics Data System (ADS)
Sun, Xiao; Liu, Bin; Zhong, Qigen; Cao, Zhiyi
2013-03-01
In this paper, the entity composition of equipment support information network is studied, and the network abstract model is built. The influence factors of the invulnerability of equipment support information network are analyzed, and the invulnerability capabilities under random attack are analyzed. According to the centrality theory, the materiality evaluation centralities of the nodes are given, and the invulnerability capabilities under selective attack are analyzed. Finally, the reasons that restrict the invulnerability of equipment support information network are summarized, and the modified principles and methods are given.
Analyzing the Social Networks of High- and Low-Performing Students in Online Discussion Forums
ERIC Educational Resources Information Center
Ghadirian, Hajar; Salehi, Keyvan; Ayub, Ahmad Fauzi Mohd
2018-01-01
An ego network is an individual's social network relationships with core members. In this study, the ego network parameters in online discussion spaces of high- and low-performing students were compared. The extent to which students' ego networks changed over the course were also analyzed. Participation in 7 weeks of online discussions were…
Empirical Studies on the Network of Social Groups: The Case of Tencent QQ.
You, Zhi-Qiang; Han, Xiao-Pu; Lü, Linyuan; Yeung, Chi Ho
2015-01-01
Participation in social groups are important but the collective behaviors of human as a group are difficult to analyze due to the difficulties to quantify ordinary social relation, group membership, and to collect a comprehensive dataset. Such difficulties can be circumvented by analyzing online social networks. In this paper, we analyze a comprehensive dataset released from Tencent QQ, an instant messenger with the highest market share in China. Specifically, we analyze three derivative networks involving groups and their members-the hypergraph of groups, the network of groups and the user network-to reveal social interactions at microscopic and mesoscopic level. Our results uncover interesting behaviors on the growth of user groups, the interactions between groups, and their relationship with member age and gender. These findings lead to insights which are difficult to obtain in social networks based on personal contacts.
Analysis of bHLH coding genes using gene co-expression network approach.
Srivastava, Swati; Sanchita; Singh, Garima; Singh, Noopur; Srivastava, Gaurava; Sharma, Ashok
2016-07-01
Network analysis provides a powerful framework for the interpretation of data. It uses novel reference network-based metrices for module evolution. These could be used to identify module of highly connected genes showing variation in co-expression network. In this study, a co-expression network-based approach was used for analyzing the genes from microarray data. Our approach consists of a simple but robust rank-based network construction. The publicly available gene expression data of Solanum tuberosum under cold and heat stresses were considered to create and analyze a gene co-expression network. The analysis provide highly co-expressed module of bHLH coding genes based on correlation values. Our approach was to analyze the variation of genes expression, according to the time period of stress through co-expression network approach. As the result, the seed genes were identified showing multiple connections with other genes in the same cluster. Seed genes were found to be vary in different time periods of stress. These analyzed seed genes may be utilized further as marker genes for developing the stress tolerant plant species.
Latent geometry of bipartite networks
NASA Astrophysics Data System (ADS)
Kitsak, Maksim; Papadopoulos, Fragkiskos; Krioukov, Dmitri
2017-03-01
Despite the abundance of bipartite networked systems, their organizing principles are less studied compared to unipartite networks. Bipartite networks are often analyzed after projecting them onto one of the two sets of nodes. As a result of the projection, nodes of the same set are linked together if they have at least one neighbor in common in the bipartite network. Even though these projections allow one to study bipartite networks using tools developed for unipartite networks, one-mode projections lead to significant loss of information and artificial inflation of the projected network with fully connected subgraphs. Here we pursue a different approach for analyzing bipartite systems that is based on the observation that such systems have a latent metric structure: network nodes are points in a latent metric space, while connections are more likely to form between nodes separated by shorter distances. This approach has been developed for unipartite networks, and relatively little is known about its applicability to bipartite systems. Here, we fully analyze a simple latent-geometric model of bipartite networks and show that this model explains the peculiar structural properties of many real bipartite systems, including the distributions of common neighbors and bipartite clustering. We also analyze the geometric information loss in one-mode projections in this model and propose an efficient method to infer the latent pairwise distances between nodes. Uncovering the latent geometry underlying real bipartite networks can find applications in diverse domains, ranging from constructing efficient recommender systems to understanding cell metabolism.
Mobile Computing and Ubiquitous Networking: Concepts, Technologies and Challenges.
ERIC Educational Resources Information Center
Pierre, Samuel
2001-01-01
Analyzes concepts, technologies and challenges related to mobile computing and networking. Defines basic concepts of cellular systems. Describes the evolution of wireless technologies that constitute the foundations of mobile computing and ubiquitous networking. Presents characterization and issues of mobile computing. Analyzes economical and…
Novel indexes based on network structure to indicate financial market
NASA Astrophysics Data System (ADS)
Zhong, Tao; Peng, Qinke; Wang, Xiao; Zhang, Jing
2016-02-01
There have been various achievements to understand and to analyze the financial market by complex network model. However, current studies analyze the financial network model but seldom present quantified indexes to indicate or forecast the price action of market. In this paper, the stock market is modeled as a dynamic network, in which the vertices refer to listed companies and edges refer to their rank-based correlation based on price series. Characteristics of the network are analyzed and then novel indexes are introduced into market analysis, which are calculated from maximum and fully-connected subnets. The indexes are compared with existing ones and the results confirm that our indexes perform better to indicate the daily trend of market composite index in advance. Via investment simulation, the performance of our indexes is analyzed in detail. The results indicate that the dynamic complex network model could not only serve as a structural description of the financial market, but also work to predict the market and guide investment by indexes.
Analyzing complex networks evolution through Information Theory quantifiers
NASA Astrophysics Data System (ADS)
Carpi, Laura C.; Rosso, Osvaldo A.; Saco, Patricia M.; Ravetti, Martín Gómez
2011-01-01
A methodology to analyze dynamical changes in complex networks based on Information Theory quantifiers is proposed. The square root of the Jensen-Shannon divergence, a measure of dissimilarity between two probability distributions, and the MPR Statistical Complexity are used to quantify states in the network evolution process. Three cases are analyzed, the Watts-Strogatz model, a gene network during the progression of Alzheimer's disease and a climate network for the Tropical Pacific region to study the El Niño/Southern Oscillation (ENSO) dynamic. We find that the proposed quantifiers are able not only to capture changes in the dynamics of the processes but also to quantify and compare states in their evolution.
Analysis of interference performance of tactical radio network
NASA Astrophysics Data System (ADS)
Nie, Hao; Cai, Xiaoxia; Chen, Hong
2017-08-01
Mobile Ad hoc network has a strong military background for its development as the core technology of the backbone network of US tactical Internet. And which tactical radio network, is the war in today's tactical use of the Internet more mature form of networking, mainly used in brigade and brigade following forces. This paper analyzes the typical protocol AODV in the tactical radio network, and then carries on the networking. By adding the interference device to the whole network, the battlefield environment is simulated, and then the throughput, delay and packet loss rate are analyzed, and the performance of the whole network and the single node before and after the interference is obtained.
Empirical Studies on the Network of Social Groups: The Case of Tencent QQ
You, Zhi-Qiang; Han, Xiao-Pu; Lü, Linyuan; Yeung, Chi Ho
2015-01-01
Background Participation in social groups are important but the collective behaviors of human as a group are difficult to analyze due to the difficulties to quantify ordinary social relation, group membership, and to collect a comprehensive dataset. Such difficulties can be circumvented by analyzing online social networks. Methodology/Principal Findings In this paper, we analyze a comprehensive dataset released from Tencent QQ, an instant messenger with the highest market share in China. Specifically, we analyze three derivative networks involving groups and their members—the hypergraph of groups, the network of groups and the user network—to reveal social interactions at microscopic and mesoscopic level. Conclusions/Significance Our results uncover interesting behaviors on the growth of user groups, the interactions between groups, and their relationship with member age and gender. These findings lead to insights which are difficult to obtain in social networks based on personal contacts. PMID:26176850
System, apparatus and methods to implement high-speed network analyzers
Ezick, James; Lethin, Richard; Ros-Giralt, Jordi; Szilagyi, Peter; Wohlford, David E
2015-11-10
Systems, apparatus and methods for the implementation of high-speed network analyzers are provided. A set of high-level specifications is used to define the behavior of the network analyzer emitted by a compiler. An optimized inline workflow to process regular expressions is presented without sacrificing the semantic capabilities of the processing engine. An optimized packet dispatcher implements a subset of the functions implemented by the network analyzer, providing a fast and slow path workflow used to accelerate specific processing units. Such dispatcher facility can also be used as a cache of policies, wherein if a policy is found, then packet manipulations associated with the policy can be quickly performed. An optimized method of generating DFA specifications for network signatures is also presented. The method accepts several optimization criteria, such as min-max allocations or optimal allocations based on the probability of occurrence of each signature input bit.
NASA Technical Reports Server (NTRS)
Mahmud, Faisal; Samiul, Hasan
2010-01-01
It is interesting to observe new innovations, products, or ideas propagating into the society. One important factor of this propagation is the role of individual's social network; while another factor is individual's activities. In this paper, an approach will be made to analyze the propagation of different ideas in a popular social network. Individuals' responses to different activities in the network will be analyzed. The properties of network will also be investigated for successful propagation of innovations.
NASA Astrophysics Data System (ADS)
Bhardwaj, Manish; McCaughan, Leon; Olkhovets, Anatoli; Korotky, Steven K.
2006-12-01
We formulate an analytic framework for the restoration performance of path-based restoration schemes in planar mesh networks. We analyze various switch architectures and signaling schemes and model their total restoration interval. We also evaluate the network global expectation value of the time to restore a demand as a function of network parameters. We analyze a wide range of nominally capacity-optimal planar mesh networks and find our analytic model to be in good agreement with numerical simulation data.
The use of network theory to model disparate ship design information
NASA Astrophysics Data System (ADS)
Rigterink, Douglas; Piks, Rebecca; Singer, David J.
2014-06-01
This paper introduces the use of network theory to model and analyze disparate ship design information. This work will focus on a ship's distributed systems and their intra- and intersystem structures and interactions. The three system to be analyzed are: a passageway system, an electrical system, and a fire fighting system. These systems will be analyzed individually using common network metrics to glean information regarding their structures and attributes. The systems will also be subjected to community detection algorithms both separately and as a multiplex network to compare their similarities, differences, and interactions. Network theory will be shown to be useful in the early design stage due to its simplicity and ability to model any shipboard system.
Robustness of Oscillatory Behavior in Correlated Networks
Sasai, Takeyuki; Morino, Kai; Tanaka, Gouhei; Almendral, Juan A.; Aihara, Kazuyuki
2015-01-01
Understanding network robustness against failures of network units is useful for preventing large-scale breakdowns and damages in real-world networked systems. The tolerance of networked systems whose functions are maintained by collective dynamical behavior of the network units has recently been analyzed in the framework called dynamical robustness of complex networks. The effect of network structure on the dynamical robustness has been examined with various types of network topology, but the role of network assortativity, or degree–degree correlations, is still unclear. Here we study the dynamical robustness of correlated (assortative and disassortative) networks consisting of diffusively coupled oscillators. Numerical analyses for the correlated networks with Poisson and power-law degree distributions show that network assortativity enhances the dynamical robustness of the oscillator networks but the impact of network disassortativity depends on the detailed network connectivity. Furthermore, we theoretically analyze the dynamical robustness of correlated bimodal networks with two-peak degree distributions and show the positive impact of the network assortativity. PMID:25894574
From scale-free to Erdos-Rényi networks.
Gómez-Gardeñes, Jesús; Moreno, Yamir
2006-05-01
We analyze a model that interpolates between scale-free and Erdos-Rényi networks. The model introduced generates a one-parameter family of networks and allows one to analyze the role of structural heterogeneity. Analytical calculations are compared with extensive numerical simulations in order to describe the transition between these two important classes of networks. Finally, an application of the proposed model to the study of the percolation transition is presented.
Research on Information Sharing Mechanism of Network Organization Based on Evolutionary Game
NASA Astrophysics Data System (ADS)
Wang, Lin; Liu, Gaozhi
2018-02-01
This article first elaborates the concept and effect of network organization, and the ability to share information is analyzed, secondly introduces the evolutionary game theory, network organization for information sharing all kinds of limitations, establishes the evolutionary game model, analyzes the dynamic evolution of network organization of information sharing, through reasoning and evolution. The network information sharing by the initial state and two sides of the game payoff matrix of excess profits and information is the information sharing of cost and risk sharing are the influence of network organization node information sharing decision.
Risk analysis of urban gas pipeline network based on improved bow-tie model
NASA Astrophysics Data System (ADS)
Hao, M. J.; You, Q. J.; Yue, Z.
2017-11-01
Gas pipeline network is a major hazard source in urban areas. In the event of an accident, there could be grave consequences. In order to understand more clearly the causes and consequences of gas pipeline network accidents, and to develop prevention and mitigation measures, the author puts forward the application of improved bow-tie model to analyze risks of urban gas pipeline network. The improved bow-tie model analyzes accident causes from four aspects: human, materials, environment and management; it also analyzes the consequences from four aspects: casualty, property loss, environment and society. Then it quantifies the causes and consequences. Risk identification, risk analysis, risk assessment, risk control, and risk management will be clearly shown in the model figures. Then it can suggest prevention and mitigation measures accordingly to help reduce accident rate of gas pipeline network. The results show that the whole process of an accident can be visually investigated using the bow-tie model. It can also provide reasons for and predict consequences of an unfortunate event. It is of great significance in order to analyze leakage failure of gas pipeline network.
NASA Astrophysics Data System (ADS)
Zhang, Gaowei; Xu, Lingyu; Wang, Lei
2018-04-01
The purpose of this chapter is to analyze the investor's psychological characteristics and investment decision-making behavior characteristics, to study the investor sentiment under the network public opinion, and then analyze from three aspects: First, investor sentiment analysis and how to spread in the online media; The influence mechanism of investor's emotion on the stock market and its effect; the third one is to measure the investor's emotion based on the degree of attention, trying hard to sort out the internal relations between the investor's sentiment and the network public opinion and the stock market, in order to lay the theoretical foundation of this article.
Allocation of spectral and spatial modes in multidimensional metro-access optical networks
NASA Astrophysics Data System (ADS)
Gao, Wenbo; Cvijetic, Milorad
2018-04-01
Introduction of spatial division multiplexing (SDM) has added a new dimension in an effort to increase optical fiber channel capacity. At the same time, it can also be explored as an advanced optical networking tool. In this paper, we have investigated the resource allocation to end-users in multidimensional networking structure with plurality of spectral and spatial modes actively deployed in different networking segments. This presents a more comprehensive method as compared to the common practice where the segments of optical network are analyzed independently since the interaction between network hierarchies is included into consideration. We explored the possible transparency from the metro/core network to the optical access network, analyzed the potential bottlenecks from the network architecture perspective, and identified an optimized network structure. In our considerations, the viability of optical grooming through the entire hierarchical all-optical network is investigated by evaluating the effective utilization and spectral efficiency of the network architecture.
Data communication network at the ASRM facility
NASA Technical Reports Server (NTRS)
Moorhead, Robert J., III; Smith, Wayne D.; Nirgudkar, Ravi; Dement, James
1994-01-01
This three-year project (February 1991 to February 1994) has involved analyzing and helping to design the communication network for the Advanced Solid Rocket Motor (ASRM) facility at Yellow Creek, near Iuka, MS. The principal concerns in the analysis were the bandwidth (both on average and in the worst case) and the expandability of the network. As the communication network was designed and modified, a careful evaluation of the bandwidth of the network, the capabilities of the protocol, and the requirements of the controllers and computers on the network was required. The overall network, which was heterogeneous in protocol and bandwidth, needed to be modeled, analyzed, and simulated to obtain some degree of confidence in its performance capabilities and in its performance under nominal and heavy loads. The results of our analysis did have an impact on the design and operation of the ASRM facility. During 1993 we analyzed many configurations of this basic network structure. The analyses are described in detail in Section 2 and 3 herein. Section 2 reports on an analysis of the whole network. The preliminary results of that research indicated that the most likely bottleneck as the network traffic increased would be the hubs. Thus a study of Cabletron hubs was initiated. The results of that study are in Section 3. Section 4 herein reports on the final network configuration analyzed. When the ASRM facility was mothballed in December of 1993, this was basically the planned and partially installed network. A briefing was held at NASA/MSFC on December 7, 1993, at which time our final analysis and conclusions were disseminated. This report contains a written record of most of the information disseminated at that briefing.
Thinking on building the network cardiovasology of Chinese medicine.
Yu, Gui; Wang, Jie
2012-11-01
With advances in complex network theory, the thinking and methods regarding complex systems have changed revolutionarily. Network biology and network pharmacology were built by applying network-based approaches in biomedical research. The cardiovascular system may be regarded as a complex network, and cardiovascular diseases may be taken as the damage of structure and function of the cardiovascular network. Although Chinese medicine (CM) is effective in treating cardiovascular diseases, its mechanisms are still unclear. With the guidance of complex network theory, network biology and network pharmacology, network-based approaches could be used in the study of CM in preventing and treating cardiovascular diseases. A new discipline-network cardiovasology of CM was, therefore, developed. In this paper, complex network theory, network biology and network pharmacology were introduced and the connotation of "disease-syndrome-formula-herb" was illustrated from the network angle. Network biology could be used to analyze cardiovascular diseases and syndromes and network pharmacology could be used to analyze CM formulas and herbs. The "network-network"-based approaches could provide a new view for elucidating the mechanisms of CM treatment.
Epidemic Percolation Networks, Epidemic Outcomes, and Interventions
Kenah, Eben; Miller, Joel C.
2011-01-01
Epidemic percolation networks (EPNs) are directed random networks that can be used to analyze stochastic “Susceptible-Infectious-Removed” (SIR) and “Susceptible-Exposed-Infectious-Removed” (SEIR) epidemic models, unifying and generalizing previous uses of networks and branching processes to analyze mass-action and network-based S(E)IR models. This paper explains the fundamental concepts underlying the definition and use of EPNs, using them to build intuition about the final outcomes of epidemics. We then show how EPNs provide a novel and useful perspective on the design of vaccination strategies.
Baggio, Jacopo A; BurnSilver, Shauna B; Arenas, Alex; Magdanz, James S; Kofinas, Gary P; De Domenico, Manlio
2016-11-29
Network analysis provides a powerful tool to analyze complex influences of social and ecological structures on community and household dynamics. Most network studies of social-ecological systems use simple, undirected, unweighted networks. We analyze multiplex, directed, and weighted networks of subsistence food flows collected in three small indigenous communities in Arctic Alaska potentially facing substantial economic and ecological changes. Our analysis of plausible future scenarios suggests that changes to social relations and key households have greater effects on community robustness than changes to specific wild food resources.
Epidemic Percolation Networks, Epidemic Outcomes, and Interventions
Kenah, Eben; Miller, Joel C.
2011-01-01
Epidemic percolation networks (EPNs) are directed random networks that can be used to analyze stochastic “Susceptible-Infectious-Removed” (SIR) and “Susceptible-Exposed-Infectious-Removed” (SEIR) epidemic models, unifying and generalizing previous uses of networks and branching processes to analyze mass-action and network-based S(E)IR models. This paper explains the fundamental concepts underlying the definition and use of EPNs, using them to build intuition about the final outcomes of epidemics. We then show how EPNs provide a novel and useful perspective on the design of vaccination strategies. PMID:21437002
Impact analysis of two kinds of failure strategies in Beijing road transportation network
NASA Astrophysics Data System (ADS)
Zhang, Zundong; Xu, Xiaoyang; Zhang, Zhaoran; Zhou, Huijuan
The Beijing road transportation network (BRTN), as a large-scale technological network, exhibits very complex and complicate features during daily periods. And it has been widely highlighted that how statistical characteristics (i.e. average path length and global network efficiency) change while the network evolves. In this paper, by using different modeling concepts, three kinds of network models of BRTN namely the abstract network model, the static network model with road mileage as weights and the dynamic network model with travel time as weights — are constructed, respectively, according to the topological data and the real detected flow data. The degree distribution of the three kinds of network models are analyzed, which proves that the urban road infrastructure network and the dynamic network behavior like scale-free networks. By analyzing and comparing the important statistical characteristics of three models under random attacks and intentional attacks, it shows that the urban road infrastructure network and the dynamic network of BRTN are both robust and vulnerable.
Design and implementation of dynamic hybrid Honeypot network
NASA Astrophysics Data System (ADS)
Qiao, Peili; Hu, Shan-Shan; Zhai, Ji-Qiang
2013-05-01
The method of constructing a dynamic and self-adaptive virtual network is suggested to puzzle adversaries, delay and divert attacks, exhaust attacker resources and collect attacking information. The concepts of Honeypot and Honeyd, which is the frame of virtual Honeypot are introduced. The techniques of network scanning including active fingerprint recognition are analyzed. Dynamic virtual network system is designed and implemented. A virtual network similar to real network topology is built according to the collected messages from real environments in this system. By doing this, the system can perplex the attackers when Hackers attack and can further analyze and research the attacks. The tests to this system prove that this design can successfully simulate real network environment and can be used in network security analysis.
EPMOSt: An Energy-Efficient Passive Monitoring System for Wireless Sensor Networks
Garcia, Fernando P.; Andrade, Rossana M. C.; Oliveira, Carina T.; de Souza, José Neuman
2014-01-01
Monitoring systems are important for debugging and analyzing Wireless Sensor Networks (WSN). In passive monitoring, a monitoring network needs to be deployed in addition to the network to be monitored, named the target network. The monitoring network captures and analyzes packets transmitted by the target network. An energy-efficient passive monitoring system is necessary when we need to monitor a WSN in a real scenario because the lifetime of the monitoring network is extended and, consequently, the target network benefits from the monitoring for a longer time. In this work, we have identified, analyzed and compared the main passive monitoring systems proposed for WSN. During our research, we did not identify any passive monitoring system for WSN that aims to reduce the energy consumption of the monitoring network. Therefore, we propose an Energy-efficient Passive MOnitoring SysTem for WSN named EPMOSt that provides monitoring information using a Simple Network Management Protocol (SNMP) agent. Thus, any management tool that supports the SNMP protocol can be integrated with this monitoring system. Experiments with real sensors were performed in several scenarios. The results obtained show the energy efficiency of the proposed monitoring system and the viability of using it to monitor WSN in real scenarios. PMID:24949639
Game Theoretic Models of Competition and Upgrade Investments in Communication Networks
ERIC Educational Resources Information Center
Wu, Shuang
2010-01-01
In the first part of this dissertation, we study the competition among network service providers in a parallel-link network with the presence of elastic user demand that diminishes both with higher prices and congestion. First we analyze a game where providers strategically price their service for single class of traffic. Later we analyze a game…
Structural factoring approach for analyzing stochastic networks
NASA Technical Reports Server (NTRS)
Hayhurst, Kelly J.; Shier, Douglas R.
1991-01-01
The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.
Sanchis-Cano, Angel; Romero, Julián; Sacoto-Cabrera, Erwin J; Guijarro, Luis
2017-11-25
We analyze the feasibility of providing Wireless Sensor Network-data-based services in an Internet of Things scenario from an economical point of view. The scenario has two competing service providers with their own private sensor networks, a network operator and final users. The scenario is analyzed as two games using game theory. In the first game, sensors decide to subscribe or not to the network operator to upload the collected sensing-data, based on a utility function related to the mean service time and the price charged by the operator. In the second game, users decide to subscribe or not to the sensor-data-based service of the service providers based on a Logit discrete choice model related to the quality of the data collected and the subscription price. The sinks and users subscription stages are analyzed using population games and discrete choice models, while network operator and service providers pricing stages are analyzed using optimization and Nash equilibrium concepts respectively. The model is shown feasible from an economic point of view for all the actors if there are enough interested final users and opens the possibility of developing more efficient models with different types of services.
W-band six-port network analyzer for two-port characterization of millimeter wave transistors
NASA Technical Reports Server (NTRS)
Moeller, Karl J.; Schaffner, James H.; Fetterman, Harold R.
1989-01-01
A W-band (75-100 GHz) six-port junction network analyzer was constructed from commercially available descrete waveguide components and was used for the direct two-port S-parameter measurement of active three-terminal devices. A comparison between the six-port and a down-converter-type frequency extender for a conventional network analyzer revealed the superior performance of the six-port. The application of the six-port to characterize a 0.1-micron gate-length HEMT at W-band is described, and representative results are presented.
Cultured Neuronal Networks Express Complex Patterns of Activity and Morphological Memory
NASA Astrophysics Data System (ADS)
Raichman, Nadav; Rubinsky, Liel; Shein, Mark; Baruchi, Itay; Volman, Vladislav; Ben-Jacob, Eshel
The following sections are included: * Cultured Neuronal Networks * Recording the Network Activity * Network Engineering * The Formation of Synchronized Bursting Events * The Characterization of the SBEs * Highly-Active Neurons * Function-Form Relations in Cultured Networks * Analyzing the SBEs Motifs * Network Repertoire * Network under Hypothermia * Summary * Acknowledgments * References
A Novel Network Attack Audit System based on Multi-Agent Technology
NASA Astrophysics Data System (ADS)
Jianping, Wang; Min, Chen; Xianwen, Wu
A network attack audit system which includes network attack audit Agent, host audit Agent and management control center audit Agent is proposed. And the improved multi-agent technology is carried out in the network attack audit Agent which has achieved satisfactory audit results. The audit system in terms of network attack is just in-depth, and with the function improvement of network attack audit Agent, different attack will be better analyzed and audit. In addition, the management control center Agent should manage and analyze audit results from AA (or HA) and audit data on time. And the history files of network packets and host log data should also be audit to find deeper violations that cannot be found in real time.
Process-based network decomposition reveals backbone motif structure
Wang, Guanyu; Du, Chenghang; Chen, Hao; Simha, Rahul; Rong, Yongwu; Xiao, Yi; Zeng, Chen
2010-01-01
A central challenge in systems biology today is to understand the network of interactions among biomolecules and, especially, the organizing principles underlying such networks. Recent analysis of known networks has identified small motifs that occur ubiquitously, suggesting that larger networks might be constructed in the manner of electronic circuits by assembling groups of these smaller modules. Using a unique process-based approach to analyzing such networks, we show for two cell-cycle networks that each of these networks contains a giant backbone motif spanning all the network nodes that provides the main functional response. The backbone is in fact the smallest network capable of providing the desired functionality. Furthermore, the remaining edges in the network form smaller motifs whose role is to confer stability properties rather than provide function. The process-based approach used in the above analysis has additional benefits: It is scalable, analytic (resulting in a single analyzable expression that describes the behavior), and computationally efficient (all possible minimal networks for a biological process can be identified and enumerated). PMID:20498084
Efficient discovery of overlapping communities in massive networks
Gopalan, Prem K.; Blei, David M.
2013-01-01
Detecting overlapping communities is essential to analyzing and exploring natural networks such as social networks, biological networks, and citation networks. However, most existing approaches do not scale to the size of networks that we regularly observe in the real world. In this paper, we develop a scalable approach to community detection that discovers overlapping communities in massive real-world networks. Our approach is based on a Bayesian model of networks that allows nodes to participate in multiple communities, and a corresponding algorithm that naturally interleaves subsampling from the network and updating an estimate of its communities. We demonstrate how we can discover the hidden community structure of several real-world networks, including 3.7 million US patents, 575,000 physics articles from the arXiv preprint server, and 875,000 connected Web pages from the Internet. Furthermore, we demonstrate on large simulated networks that our algorithm accurately discovers the true community structure. This paper opens the door to using sophisticated statistical models to analyze massive networks. PMID:23950224
"Time-dependent flow-networks"
NASA Astrophysics Data System (ADS)
Tupikina, Liubov; Molkentin, Nora; Lopez, Cristobal; Hernandez-Garcia, Emilio; Marwan, Norbert; Kurths, Jürgen
2015-04-01
Complex networks have been successfully applied to various systems such as society, technology, and recently climate. Links in a climate network are defined between two geographical locations if the correlation between the time series of some climate variable is higher than a threshold. Therefore, network links are considered to imply information or heat exchange. However, the relationship between the oceanic and atmospheric flows and the climate network's structure is still unclear. Recently, a theoretical approach verifying the correlation between ocean currents and surface air temperature networks has been introduced, where the Pearson correlation networks were constructed from advection-diffusion dynamics on an underlying flow. Since the continuous approach has its limitations, i.e. high computational complexity and fixed variety of the flows in the underlying system, we introduce a new, method of flow-networks for changing in time velocity fields including external forcing in the system, noise and temperature-decay. Method of the flow-network construction can be divided into several steps: first we obtain the linear recursive equation for the temperature time-series. Then we compute the correlation matrix for time-series averaging the tensor product over all realizations of the noise, which we interpret as a weighted adjacency matrix of the flow-network and analyze using network measures. We apply the method to different types of moving flows with geographical relevance such as meandering flow. Analyzing the flow-networks using network measures we find that our approach can highlight zones of high velocity by degree and transition zones by betweenness, while the combination of these network measures can uncover how the flow propagates within time. Flow-networks can be powerful tool to understand the connection between system's dynamics and network's topology analyzed using network measures in order to shed light on different climatic phenomena.
Artificial neural networks applied to forecasting time series.
Montaño Moreno, Juan J; Palmer Pol, Alfonso; Muñoz Gracia, Pilar
2011-04-01
This study offers a description and comparison of the main models of Artificial Neural Networks (ANN) which have proved to be useful in time series forecasting, and also a standard procedure for the practical application of ANN in this type of task. The Multilayer Perceptron (MLP), Radial Base Function (RBF), Generalized Regression Neural Network (GRNN), and Recurrent Neural Network (RNN) models are analyzed. With this aim in mind, we use a time series made up of 244 time points. A comparative study establishes that the error made by the four neural network models analyzed is less than 10%. In accordance with the interpretation criteria of this performance, it can be concluded that the neural network models show a close fit regarding their forecasting capacity. The model with the best performance is the RBF, followed by the RNN and MLP. The GRNN model is the one with the worst performance. Finally, we analyze the advantages and limitations of ANN, the possible solutions to these limitations, and provide an orientation towards future research.
Integration of biological networks and gene expression data using Cytoscape
Cline, Melissa S; Smoot, Michael; Cerami, Ethan; Kuchinsky, Allan; Landys, Nerius; Workman, Chris; Christmas, Rowan; Avila-Campilo, Iliana; Creech, Michael; Gross, Benjamin; Hanspers, Kristina; Isserlin, Ruth; Kelley, Ryan; Killcoyne, Sarah; Lotia, Samad; Maere, Steven; Morris, John; Ono, Keiichiro; Pavlovic, Vuk; Pico, Alexander R; Vailaya, Aditya; Wang, Peng-Liang; Adler, Annette; Conklin, Bruce R; Hood, Leroy; Kuiper, Martin; Sander, Chris; Schmulevich, Ilya; Schwikowski, Benno; Warner, Guy J; Ideker, Trey; Bader, Gary D
2013-01-01
Cytoscape is a free software package for visualizing, modeling and analyzing molecular and genetic interaction networks. This protocol explains how to use Cytoscape to analyze the results of mRNA expression profiling, and other functional genomics and proteomics experiments, in the context of an interaction network obtained for genes of interest. Five major steps are described: (i) obtaining a gene or protein network, (ii) displaying the network using layout algorithms, (iii) integrating with gene expression and other functional attributes, (iv) identifying putative complexes and functional modules and (v) identifying enriched Gene Ontology annotations in the network. These steps provide a broad sample of the types of analyses performed by Cytoscape. PMID:17947979
Limitation of degree information for analyzing the interaction evolution in online social networks
NASA Astrophysics Data System (ADS)
Shang, Ke-Ke; Yan, Wei-Sheng; Xu, Xiao-Ke
2014-04-01
Previously many studies on online social networks simply analyze the static topology in which the friend relationship once established, then the links and nodes will not disappear, but this kind of static topology may not accurately reflect temporal interactions on online social services. In this study, we define four types of users and interactions in the interaction (dynamic) network. We found that active, disappeared, new and super nodes (users) have obviously different strength distribution properties and this result also can be revealed by the degree characteristics of the unweighted interaction and friendship (static) networks. However, the active, disappeared, new and super links (interactions) only can be reflected by the strength distribution in the weighted interaction network. This result indicates the limitation of the static topology data on analyzing social network evolutions. In addition, our study uncovers the approximately stable statistics for the dynamic social network in which there are a large variation for users and interaction intensity. Our findings not only verify the correctness of our definitions, but also helped to study the customer churn and evaluate the commercial value of valuable customers in online social networks.
NASA Technical Reports Server (NTRS)
Wong, M. D.
1974-01-01
The role of technology in nontraditional higher education with particular emphasis on technology-based networks is analyzed nontraditional programs, institutions, and consortia are briefly reviewed. Nontraditional programs which utilize technology are studied. Technology-based networks are surveyed and analyzed with regard to kinds of students, learning locations, technology utilization, interinstitutional relationships, cost aspects, problems, and future outlook.
ERIC Educational Resources Information Center
Hung, Aaron Chia Yuan
2016-01-01
The paper uses actor-network theory (ANT) to analyze the sociotechnical networks of three groups of adolescents who played online games in different physical and social contexts. These include: an internet café, which allowed the players to be co-present; a personal laptop, which gave the player more control over how he played; and at home through…
Analyzing milestoning networks for molecular kinetics: definitions, algorithms, and examples.
Viswanath, Shruthi; Kreuzer, Steven M; Cardenas, Alfredo E; Elber, Ron
2013-11-07
Network representations are becoming increasingly popular for analyzing kinetic data from techniques like Milestoning, Markov State Models, and Transition Path Theory. Mapping continuous phase space trajectories into a relatively small number of discrete states helps in visualization of the data and in dissecting complex dynamics to concrete mechanisms. However, not only are molecular networks derived from molecular dynamics simulations growing in number, they are also getting increasingly complex, owing partly to the growth in computer power that allows us to generate longer and better converged trajectories. The increased complexity of the networks makes simple interpretation and qualitative insight of the molecular systems more difficult to achieve. In this paper, we focus on various network representations of kinetic data and algorithms to identify important edges and pathways in these networks. The kinetic data can be local and partial (such as the value of rate coefficients between states) or an exact solution to kinetic equations for the entire system (such as the stationary flux between vertices). In particular, we focus on the Milestoning method that provides fluxes as the main output. We proposed Global Maximum Weight Pathways as a useful tool for analyzing molecular mechanism in Milestoning networks. A closely related definition was made in the context of Transition Path Theory. We consider three algorithms to find Global Maximum Weight Pathways: Recursive Dijkstra's, Edge-Elimination, and Edge-List Bisection. The asymptotic efficiency of the algorithms is analyzed and numerical tests on finite networks show that Edge-List Bisection and Recursive Dijkstra's algorithms are most efficient for sparse and dense networks, respectively. Pathways are illustrated for two examples: helix unfolding and membrane permeation. Finally, we illustrate that networks based on local kinetic information can lead to incorrect interpretation of molecular mechanisms.
Network analysis applications in hydrology
NASA Astrophysics Data System (ADS)
Price, Katie
2017-04-01
Applied network theory has seen pronounced expansion in recent years, in fields such as epidemiology, computer science, and sociology. Concurrent development of analytical methods and frameworks has increased possibilities and tools available to researchers seeking to apply network theory to a variety of problems. While water and nutrient fluxes through stream systems clearly demonstrate a directional network structure, the hydrological applications of network theory remain underexplored. This presentation covers a review of network applications in hydrology, followed by an overview of promising network analytical tools that potentially offer new insights into conceptual modeling of hydrologic systems, identifying behavioral transition zones in stream networks and thresholds of dynamical system response. Network applications were tested along an urbanization gradient in Atlanta, Georgia, USA. Peachtree Creek and Proctor Creek. Peachtree Creek contains a nest of five longterm USGS streamflow and water quality gages, allowing network application of longterm flow statistics. The watershed spans a range of suburban and heavily urbanized conditions. Summary flow statistics and water quality metrics were analyzed using a suite of network analysis techniques, to test the conceptual modeling and predictive potential of the methodologies. Storm events and low flow dynamics during Summer 2016 were analyzed using multiple network approaches, with an emphasis on tomogravity methods. Results indicate that network theory approaches offer novel perspectives for understanding long term and eventbased hydrological data. Key future directions for network applications include 1) optimizing data collection, 2) identifying "hotspots" of contaminant and overland flow influx to stream systems, 3) defining process domains, and 4) analyzing dynamic connectivity of various system components, including groundwatersurface water interactions.
DOT National Transportation Integrated Search
2010-10-01
Organizational network analysis (ONA) consists of gathering data on information sharing and : connectivity in a group, calculating network measures, creating network maps, and using this : information to analyze and improve the functionality of the g...
Analysis and Visualization of Internet QA Bulletin Boards Represented as Heterogeneous Networks
NASA Astrophysics Data System (ADS)
Murata, Tsuyoshi; Ikeya, Tomoyuki
Visualizing and analyzing social interactions of CGM (Consumer Generated Media) are important for understanding overall activities on the internet. Social interactions are often represented as simple networks that are composed of homogeneous nodes and edges between them. However, related entities in real world are often not homogeneous. Such relations are naturally represented as heterogeneous networks composed of more than one kind of nodes and edges connecting them. In the case of CGM, for example, users and their contents constitute nodes of heterogeneous networks. There are related users (user communities) and related contents (contents communities) in the heterogeneous networks. Discovering both communities and finding correspondence among them will clarify the characteristics of the communites. This paper describes an attempt for visualizing and analyzing social interactions of Yahoo! Chiebukuro (Japanese Yahoo! Answers). New criteria for measuring correspondence between user communities and board communites are defined, and characteristics of both communities are analyzed using the criteria.
NASA Astrophysics Data System (ADS)
Li, Huajiao; An, Haizhong; Wang, Yue; Huang, Jiachen; Gao, Xiangyun
2016-05-01
Keeping abreast of trends in the articles and rapidly grasping a body of article's key points and relationship from a holistic perspective is a new challenge in both literature research and text mining. As the important component, keywords can present the core idea of the academic article. Usually, articles on a single theme or area could share one or some same keywords, and we can analyze topological features and evolution of the articles co-keyword networks and keywords co-occurrence networks to realize the in-depth analysis of the articles. This paper seeks to integrate statistics, text mining, complex networks and visualization to analyze all of the academic articles on one given theme, complex network(s). All 5944 ;complex networks; articles that were published between 1990 and 2013 and are available on the Web of Science are extracted. Based on the two-mode affiliation network theory, a new frontier of complex networks, we constructed two different networks, one taking the articles as nodes, the co-keyword relationships as edges and the quantity of co-keywords as the weight to construct articles co-keyword network, and another taking the articles' keywords as nodes, the co-occurrence relationships as edges and the quantity of simultaneous co-occurrences as the weight to construct keyword co-occurrence network. An integrated method for analyzing the topological features and evolution of the articles co-keyword network and keywords co-occurrence networks is proposed, and we also defined a new function to measure the innovation coefficient of the articles in annual level. This paper provides a useful tool and process for successfully achieving in-depth analysis and rapid understanding of the trends and relationships of articles in a holistic perspective.
NASA Astrophysics Data System (ADS)
Gong, Tao; Shuai, Lan; Wu, Yicheng
2014-12-01
By analyzing complex networks constructed from authentic language data, Cong and Liu [1] advance linguistics research into the big data era. The network approach has revealed many intrinsic generalities and crucial differences at both the macro and micro scales between human languages. The axiom behind this research is that language is a complex adaptive system [2]. Although many lexical, semantic, or syntactic features have been discovered by means of analyzing the static and dynamic linguistic networks of world languages, available network-based language studies have not explicitly addressed the evolutionary dynamics of language systems and the correlations between language and human cognition. This commentary aims to provide some insights on how to use the network approach to study these issues.
A Unified Framework for Analyzing and Designing for Stationary Arterial Networks
DOT National Transportation Integrated Search
2017-05-17
This research aims to develop a unified theoretical and simulation framework for analyzing and designing signals for stationary arterial networks. Existing traffic flow models used in design and analysis of signal control strategies are either too si...
Modeling and analyzing malware propagation in social networks with heterogeneous infection rates
NASA Astrophysics Data System (ADS)
Jia, Peng; Liu, Jiayong; Fang, Yong; Liu, Liang; Liu, Luping
2018-10-01
With the rapid development of social networks, hackers begin to try to spread malware more widely by utilizing various kinds of social networks. Thus, studying malware epidemic dynamics in these networks is becoming a popular subject in the literature. Most of the previous works focus on the effects of factors, such as network topology and user behavior, on malware propagation. Some researchers try to analyze the heterogeneity of infection rates, but the common problem of their works is the factors they mentioned that could affect the heterogeneity are not comprehensive enough. In this paper, focusing on the effects of heterogeneous infection rates, we propose a novel model called HSID (heterogeneous-susceptible-infectious-dormant model) to characterize virus propagation in social networks, in which a connection factor is presented to evaluate the heterogeneous relationships between nodes, and a resistance factor is introduced to represent node's mutable resistant ability. We analyzed how key parameters in the two factors affect the heterogeneity and then performed simulations to explore the effects in three real-world social networks. The results indicate: heterogeneous relationship could lead to wider diffusion in directed network, and heterogeneous security awareness could lead to wider diffusion in both directed and undirected networks; heterogeneous relationship could restrain the outbreak of malware but heterogeneous initial security awareness would increase the probability; furthermore, the increasing resistibility along with infected times would lead to malware's disappearance in social networks.
The community structure of the global corporate network.
Vitali, Stefania; Battiston, Stefano
2014-01-01
We investigate the community structure of the global ownership network of transnational corporations. We find a pronounced organization in communities that cannot be explained by randomness. Despite the global character of this network, communities reflect first of all the geographical location of firms, while the industrial sector plays only a marginal role. We also analyze the meta-network in which the nodes are the communities and the links are obtained by aggregating the links among firms belonging to pairs of communities. We analyze the network centrality of the top 50 communities and we provide a quantitative assessment of the financial sector role in connecting the global economy.
The Community Structure of the Global Corporate Network
Vitali, Stefania; Battiston, Stefano
2014-01-01
We investigate the community structure of the global ownership network of transnational corporations. We find a pronounced organization in communities that cannot be explained by randomness. Despite the global character of this network, communities reflect first of all the geographical location of firms, while the industrial sector plays only a marginal role. We also analyze the meta-network in which the nodes are the communities and the links are obtained by aggregating the links among firms belonging to pairs of communities. We analyze the network centrality of the top 50 communities and we provide a quantitative assessment of the financial sector role in connecting the global economy. PMID:25126722
Romero, Julián; Sacoto-Cabrera, Erwin J.
2017-01-01
We analyze the feasibility of providing Wireless Sensor Network-data-based services in an Internet of Things scenario from an economical point of view. The scenario has two competing service providers with their own private sensor networks, a network operator and final users. The scenario is analyzed as two games using game theory. In the first game, sensors decide to subscribe or not to the network operator to upload the collected sensing-data, based on a utility function related to the mean service time and the price charged by the operator. In the second game, users decide to subscribe or not to the sensor-data-based service of the service providers based on a Logit discrete choice model related to the quality of the data collected and the subscription price. The sinks and users subscription stages are analyzed using population games and discrete choice models, while network operator and service providers pricing stages are analyzed using optimization and Nash equilibrium concepts respectively. The model is shown feasible from an economic point of view for all the actors if there are enough interested final users and opens the possibility of developing more efficient models with different types of services. PMID:29186847
NASA Technical Reports Server (NTRS)
Alexandrov, Natalia (Technical Monitor); Kuby, Michael; Tierney, Sean; Roberts, Tyler; Upchurch, Christopher
2005-01-01
This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.
Correlations of stock price fluctuations under multi-scale and multi-threshold scenarios
NASA Astrophysics Data System (ADS)
Sui, Guo; Li, Huajiao; Feng, Sida; Liu, Xueyong; Jiang, Meihui
2018-01-01
The multi-scale method is widely used in analyzing time series of financial markets and it can provide market information for different economic entities who focus on different periods. Through constructing multi-scale networks of price fluctuation correlation in the stock market, we can detect the topological relationship between each time series. Previous research has not addressed the problem that the original fluctuation correlation networks are fully connected networks and more information exists within these networks that is currently being utilized. Here we use listed coal companies as a case study. First, we decompose the original stock price fluctuation series into different time scales. Second, we construct the stock price fluctuation correlation networks at different time scales. Third, we delete the edges of the network based on thresholds and analyze the network indicators. Through combining the multi-scale method with the multi-threshold method, we bring to light the implicit information of fully connected networks.
Wen, Shameng; Meng, Qingkun; Feng, Chao; Tang, Chaojing
2017-01-01
Formal techniques have been devoted to analyzing whether network protocol specifications violate security policies; however, these methods cannot detect vulnerabilities in the implementations of the network protocols themselves. Symbolic execution can be used to analyze the paths of the network protocol implementations, but for stateful network protocols, it is difficult to reach the deep states of the protocol. This paper proposes a novel model-guided approach to detect vulnerabilities in network protocol implementations. Our method first abstracts a finite state machine (FSM) model, then utilizes the model to guide the symbolic execution. This approach achieves high coverage of both the code and the protocol states. The proposed method is implemented and applied to test numerous real-world network protocol implementations. The experimental results indicate that the proposed method is more effective than traditional fuzzing methods such as SPIKE at detecting vulnerabilities in the deep states of network protocol implementations.
Do the rich get richer? An empirical analysis of the Bitcoin transaction network.
Kondor, Dániel; Pósfai, Márton; Csabai, István; Vattay, Gábor
2014-01-01
The possibility to analyze everyday monetary transactions is limited by the scarcity of available data, as this kind of information is usually considered highly sensitive. Present econophysics models are usually employed on presumed random networks of interacting agents, and only some macroscopic properties (e.g. the resulting wealth distribution) are compared to real-world data. In this paper, we analyze Bitcoin, which is a novel digital currency system, where the complete list of transactions is publicly available. Using this dataset, we reconstruct the network of transactions and extract the time and amount of each payment. We analyze the structure of the transaction network by measuring network characteristics over time, such as the degree distribution, degree correlations and clustering. We find that linear preferential attachment drives the growth of the network. We also study the dynamics taking place on the transaction network, i.e. the flow of money. We measure temporal patterns and the wealth accumulation. Investigating the microscopic statistics of money movement, we find that sublinear preferential attachment governs the evolution of the wealth distribution. We report a scaling law between the degree and wealth associated to individual nodes.
Do the Rich Get Richer? An Empirical Analysis of the Bitcoin Transaction Network
Kondor, Dániel; Pósfai, Márton; Csabai, István; Vattay, Gábor
2014-01-01
The possibility to analyze everyday monetary transactions is limited by the scarcity of available data, as this kind of information is usually considered highly sensitive. Present econophysics models are usually employed on presumed random networks of interacting agents, and only some macroscopic properties (e.g. the resulting wealth distribution) are compared to real-world data. In this paper, we analyze Bitcoin, which is a novel digital currency system, where the complete list of transactions is publicly available. Using this dataset, we reconstruct the network of transactions and extract the time and amount of each payment. We analyze the structure of the transaction network by measuring network characteristics over time, such as the degree distribution, degree correlations and clustering. We find that linear preferential attachment drives the growth of the network. We also study the dynamics taking place on the transaction network, i.e. the flow of money. We measure temporal patterns and the wealth accumulation. Investigating the microscopic statistics of money movement, we find that sublinear preferential attachment governs the evolution of the wealth distribution. We report a scaling law between the degree and wealth associated to individual nodes. PMID:24505257
Detection of network attacks based on adaptive resonance theory
NASA Astrophysics Data System (ADS)
Bukhanov, D. G.; Polyakov, V. M.
2018-05-01
The paper considers an approach to intrusion detection systems using a neural network of adaptive resonant theory. It suggests the structure of an intrusion detection system consisting of two types of program modules. The first module manages connections of user applications by preventing the undesirable ones. The second analyzes the incoming network traffic parameters to check potential network attacks. After attack detection, it notifies the required stations using a secure transmission channel. The paper describes the experiment on the detection and recognition of network attacks using the test selection. It also compares the obtained results with similar experiments carried out by other authors. It gives findings and conclusions on the sufficiency of the proposed approach. The obtained information confirms the sufficiency of applying the neural networks of adaptive resonant theory to analyze network traffic within the intrusion detection system.
Intelligent neural network and fuzzy logic control of industrial and power systems
NASA Astrophysics Data System (ADS)
Kuljaca, Ognjen
The main role played by neural network and fuzzy logic intelligent control algorithms today is to identify and compensate unknown nonlinear system dynamics. There are a number of methods developed, but often the stability analysis of neural network and fuzzy control systems was not provided. This work will meet those problems for the several algorithms. Some more complicated control algorithms included backstepping and adaptive critics will be designed. Nonlinear fuzzy control with nonadaptive fuzzy controllers is also analyzed. An experimental method for determining describing function of SISO fuzzy controller is given. The adaptive neural network tracking controller for an autonomous underwater vehicle is analyzed. A novel stability proof is provided. The implementation of the backstepping neural network controller for the coupled motor drives is described. Analysis and synthesis of adaptive critic neural network control is also provided in the work. Novel tuning laws for the system with action generating neural network and adaptive fuzzy critic are given. Stability proofs are derived for all those control methods. It is shown how these control algorithms and approaches can be used in practical engineering control. Stability proofs are given. Adaptive fuzzy logic control is analyzed. Simulation study is conducted to analyze the behavior of the adaptive fuzzy system on the different environment changes. A novel stability proof for adaptive fuzzy logic systems is given. Also, adaptive elastic fuzzy logic control architecture is described and analyzed. A novel membership function is used for elastic fuzzy logic system. The stability proof is proffered. Adaptive elastic fuzzy logic control is compared with the adaptive nonelastic fuzzy logic control. The work described in this dissertation serves as foundation on which analysis of particular representative industrial systems will be conducted. Also, it gives a good starting point for analysis of learning abilities of adaptive and neural network control systems, as well as for the analysis of the different algorithms such as elastic fuzzy systems.
A Process Management System for Networked Manufacturing
NASA Astrophysics Data System (ADS)
Liu, Tingting; Wang, Huifen; Liu, Linyan
With the development of computer, communication and network, networked manufacturing has become one of the main manufacturing paradigms in the 21st century. Under the networked manufacturing environment, there exist a large number of cooperative tasks susceptible to alterations, conflicts caused by resources and problems of cost and quality. This increases the complexity of administration. Process management is a technology used to design, enact, control, and analyze networked manufacturing processes. It supports efficient execution, effective management, conflict resolution, cost containment and quality control. In this paper we propose an integrated process management system for networked manufacturing. Requirements of process management are analyzed and architecture of the system is presented. And a process model considering process cost and quality is developed. Finally a case study is provided to explain how the system runs efficiently.
Vaccination intervention on epidemic dynamics in networks
NASA Astrophysics Data System (ADS)
Peng, Xiao-Long; Xu, Xin-Jian; Fu, Xinchu; Zhou, Tao
2013-02-01
Vaccination is an important measure available for preventing or reducing the spread of infectious diseases. In this paper, an epidemic model including susceptible, infected, and imperfectly vaccinated compartments is studied on Watts-Strogatz small-world, Barabási-Albert scale-free, and random scale-free networks. The epidemic threshold and prevalence are analyzed. For small-world networks, the effective vaccination intervention is suggested and its influence on the threshold and prevalence is analyzed. For scale-free networks, the threshold is found to be strongly dependent both on the effective vaccination rate and on the connectivity distribution. Moreover, so long as vaccination is effective, it can linearly decrease the epidemic prevalence in small-world networks, whereas for scale-free networks it acts exponentially. These results can help in adopting pragmatic treatment upon diseases in structured populations.
Systems and methods for modeling and analyzing networks
Hill, Colin C; Church, Bruce W; McDonagh, Paul D; Khalil, Iya G; Neyarapally, Thomas A; Pitluk, Zachary W
2013-10-29
The systems and methods described herein utilize a probabilistic modeling framework for reverse engineering an ensemble of causal models, from data and then forward simulating the ensemble of models to analyze and predict the behavior of the network. In certain embodiments, the systems and methods described herein include data-driven techniques for developing causal models for biological networks. Causal network models include computational representations of the causal relationships between independent variables such as a compound of interest and dependent variables such as measured DNA alterations, changes in mRNA, protein, and metabolites to phenotypic readouts of efficacy and toxicity.
Analyzing neuronal networks using discrete-time dynamics
NASA Astrophysics Data System (ADS)
Ahn, Sungwoo; Smith, Brian H.; Borisyuk, Alla; Terman, David
2010-05-01
We develop mathematical techniques for analyzing detailed Hodgkin-Huxley like models for excitatory-inhibitory neuronal networks. Our strategy for studying a given network is to first reduce it to a discrete-time dynamical system. The discrete model is considerably easier to analyze, both mathematically and computationally, and parameters in the discrete model correspond directly to parameters in the original system of differential equations. While these networks arise in many important applications, a primary focus of this paper is to better understand mechanisms that underlie temporally dynamic responses in early processing of olfactory sensory information. The models presented here exhibit several properties that have been described for olfactory codes in an insect’s Antennal Lobe. These include transient patterns of synchronization and decorrelation of sensory inputs. By reducing the model to a discrete system, we are able to systematically study how properties of the dynamics, including the complex structure of the transients and attractors, depend on factors related to connectivity and the intrinsic and synaptic properties of cells within the network.
Impact of Drainage Networks on Cholera Outbreaks in Lusaka, Zambia
Suzuki, Hiroshi; Fujino, Yasuyuki; Kimura, Yoshinari; Cheelo, Meetwell
2009-01-01
Objectives. We investigated the association between precipitation patterns and cholera outbreaks and the preventative roles of drainage networks against outbreaks in Lusaka, Zambia. Methods. We collected data on 6542 registered cholera patients in the 2003–2004 outbreak season and on 6045 cholera patients in the 2005–2006 season. Correlations between monthly cholera incidences and amount of precipitation were examined. The distribution pattern of the disease was analyzed by a kriging spatial analysis method. We analyzed cholera case distribution and spatiotemporal cluster by using 2590 cholera cases traced with a global positioning system in the 2005–2006 season. The association between drainage networks and cholera cases was analyzed with regression analysis. Results. Increased precipitation was associated with the occurrence of cholera outbreaks, and insufficient drainage networks were statistically associated with cholera incidences. Conclusions. Insufficient coverage of drainage networks elevated the risk of cholera outbreaks. Integrated development is required to upgrade high-risk areas with sufficient infrastructure for a long-term cholera prevention strategy. PMID:19762668
A traffic analyzer for multiple SpaceWire links
NASA Astrophysics Data System (ADS)
Liu, Scige J.; Giusi, Giovanni; Di Giorgio, Anna M.; Vertolli, Nello; Galli, Emanuele; Biondi, David; Farina, Maria; Pezzuto, Stefano; Spinoglio, Luigi
2014-07-01
Modern space missions are becoming increasingly complex: the interconnection of the units in a satellite is now a network of terminals linked together through routers, where devices with different level of automation and intelligence share the same data-network. The traceability of the network transactions is performed mostly at terminal level through log analysis and hence it is difficult to verify in real time the reliability of the interconnections and the interchange protocols. To improve and ease the traffic analysis in a SpaceWire network we implemented a low-level link analyzer, with the specific goal to simplify the integration and test phases in the development of space instrumentation. The traffic analyzer collects signals coming from pod probes connected in-series on the interested links between two SpaceWire terminals. With respect to the standard traffic analyzers, the design of this new tool includes the possibility to internally reshape the LVDS signal. This improvement increases the robustness of the analyzer towards environmental noise effects and guarantees a deterministic delay on all analyzed signals. The analyzer core is implemented on a Xilinx FPGA, programmed to decode the bidirectional LVDS signals at Link and Network level. Successively, the core packetizes protocol characters in homogeneous sets of time ordered events. The analyzer provides time-tagging functionality for each characters set, with a precision down to the FPGA Clock, i.e. about 20nsec in the adopted HW environment. The use of a common time reference for each character stream allows synchronous performance measurements. The collected information is then routed to an external computer for quick analysis: this is done via high-speed USB2 connection. With this analyzer it is possible to verify the link performances in terms of induced delays in the transmitted signals. A case study focused on the analysis of the Time-Code synchronization in presence of a SpaceWire Router is shown in this paper as well.
Interactive Planning under Uncertainty with Casual Modeling and Analysis
2006-01-01
Tool ( CAT ), a system for creating and analyzing causal models similar to Bayes networks. In order to use CAT as a tool for planning, users go through...an iterative process in which they use CAT to create and an- alyze alternative plans. One of the biggest difficulties is that the number of possible...Causal Analysis Tool ( CAT ), which is a tool for representing and analyzing causal networks sim- ilar to Bayesian networks. In order to represent plans
Application of wireless sensor network technology in logistics information system
NASA Astrophysics Data System (ADS)
Xu, Tao; Gong, Lina; Zhang, Wei; Li, Xuhong; Wang, Xia; Pan, Wenwen
2017-04-01
This paper introduces the basic concepts of active RFID (WSN-ARFID) based on wireless sensor networks and analyzes the shortcomings of the existing RFID-based logistics monitoring system. Integrated wireless sensor network technology and the scrambling point of RFID technology. A new real-time logistics detection system based on WSN and RFID, a model of logistics system based on WSN-ARFID is proposed, and the feasibility of this technology applied to logistics field is analyzed.
Zhou, Wen; Koptyug, Nikita; Ye, Shutao; Jia, Yifan; Lu, Xiaolong
2016-01-01
As computer science and complex network theory develop, non-cooperative games and their formation and application on complex networks have been important research topics. In the inter-firm innovation network, it is a typical game behavior for firms to invest in their alliance partners. Accounting for the possibility that firms can be resource constrained, this paper analyzes a coordination game using the Nash bargaining solution as allocation rules between firms in an inter-firm innovation network. We build an extended inter-firm n-player game based on nonidealized conditions, describe four investment strategies and simulate the strategies on an inter-firm innovation network in order to compare their performance. By analyzing the results of our experiments, we find that our proposed greedy strategy is the best-performing in most situations. We hope this study provides a theoretical insight into how firms make investment decisions. PMID:26745375
Zhou, Wen; Koptyug, Nikita; Ye, Shutao; Jia, Yifan; Lu, Xiaolong
2016-01-01
As computer science and complex network theory develop, non-cooperative games and their formation and application on complex networks have been important research topics. In the inter-firm innovation network, it is a typical game behavior for firms to invest in their alliance partners. Accounting for the possibility that firms can be resource constrained, this paper analyzes a coordination game using the Nash bargaining solution as allocation rules between firms in an inter-firm innovation network. We build an extended inter-firm n-player game based on nonidealized conditions, describe four investment strategies and simulate the strategies on an inter-firm innovation network in order to compare their performance. By analyzing the results of our experiments, we find that our proposed greedy strategy is the best-performing in most situations. We hope this study provides a theoretical insight into how firms make investment decisions.
Correlates and Risk Markers for Sleep Disturbance in Participants of the Autism Treatment Network
ERIC Educational Resources Information Center
Hollway, Jill A.; Aman, Michael G.; Butter, Eric
2013-01-01
We explored possible cognitive, behavioral, emotional, and physiological risk markers for sleep disturbance in children with autism spectrum disorders. Data from 1,583 children in the Autism Treatment Network were analyzed. Approximately 45 potential predictors were analyzed using hierarchical regression modeling. As medication could confound…
ERIC Educational Resources Information Center
Lazinger, Susan S.
1991-01-01
Describes ALEPH, the research library network in Israel, and analyzes the strengths and weaknesses of its decentralized structure. Highlights include comparisons between RLIN and ALEPH; centralized versus decentralized networks; the format of ALEPH; authority control in ALEPH; and non-Roman scripts in both networks. (16 references) (LRW)
Saez-Rodriguez, Julio; Gayer, Stefan; Ginkel, Martin; Gilles, Ernst Dieter
2008-08-15
The modularity of biochemical networks in general, and signaling networks in particular, has been extensively studied over the past few years. It has been proposed to be a useful property to analyze signaling networks: by decomposing the network into subsystems, more manageable units are obtained that are easier to analyze. While many powerful algorithms are available to identify modules in protein interaction networks, less attention has been paid to signaling networks de.ned as chemical systems. Such a decomposition would be very useful as most quantitative models are de.ned using the latter, more detailed formalism. Here, we introduce a novel method to decompose biochemical networks into modules so that the bidirectional (retroactive) couplings among the modules are minimized. Our approach adapts a method to detect community structures, and applies it to the so-called retroactivity matrix that characterizes the couplings of the network. Only the structure of the network, e.g. in SBML format, is required. Furthermore, the modularized models can be loaded into ProMoT, a modeling tool which supports modular modeling. This allows visualization of the models, exploiting their modularity and easy generation of models of one or several modules for further analysis. The method is applied to several relevant cases, including an entangled model of the EGF-induced MAPK cascade and a comprehensive model of EGF signaling, demonstrating its ability to uncover meaningful modules. Our approach can thus help to analyze large networks, especially when little a priori knowledge on the structure of the network is available. The decomposition algorithms implemented in MATLAB (Mathworks, Inc.) are freely available upon request. ProMoT is freely available at http://www.mpi-magdeburg.mpg.de/projects/promot. Supplementary data are available at Bioinformatics online.
Online Advertising in Social Networks
NASA Astrophysics Data System (ADS)
Bagherjeiran, Abraham; Bhatt, Rushi P.; Parekh, Rajesh; Chaoji, Vineet
Online social networks offer opportunities to analyze user behavior and social connectivity and leverage resulting insights for effective online advertising. This chapter focuses on the role of social network information in online display advertising.
How to estimate the signs' configuration in the directed signed social networks?
NASA Astrophysics Data System (ADS)
Guo, Long; Gao, Fujuan; Jiang, Jian
2017-02-01
Inspired by the ensemble theory in statistical mechanics, we introduce a reshuffling approach to empirical analyze signs' configuration in the directed signed social networks of Epinions and Slashdots. In our reshuffling approach, each negative link has the reshuffling probability prs to exchange its sign with another positive link chosen randomly. Many reshuffled networks with different signs' configuration are built under different prss. For each reshuffled network, the entropies of the self social status are calculated and the opinion formation of the majority-rule model is analyzed. We find that Souts reach their own minimum values and the order parameter |m* | reaches its maximum value in the networks of Epinions and Slashdots without the reshuffling operation. Namely, individuals share the homogeneous properties of self social status and dynamic status in the real directed signed social networks. Our present work provides some interesting tools and perspective to understand the signs' configuration in signed social networks, especially in the online affiliation networks.
Exploring the spiral of silence in adjustable social networks
NASA Astrophysics Data System (ADS)
Wu, Yue; Du, Ya-Jun; Li, Xian-Yong; Chen, Xiao-Liang
2015-03-01
This study extends the understanding of the spiral of silence theory by taking into account four factors, including the topology of networks, the time factor of information transmission, the node degree of individuals and the freedom of expression. Simulation experiments analyze the silencers, public opinion in steady state and relaxation time in small-world networks, scale-free networks and community-structured networks by adjusting the initial conditions. Results highlight that individuals are easier to keep silent in scale-free network, especially when the individual with big degree and minority opinion starts the discussion. Conversely, there are only a few individuals keep silent in the community-structured network when the two communities hold opposite opinions. Moreover, the number of silencers grows as the degree of coupling increases, and it decreases as the freedom of expression goes up. By analyzing the public opinion evolution, we also find some important conditions, such as the network topology, the potential public opinion distribution, and the status and sides of the first speaker, can drive the minority reversal.
Hybrid modeling and empirical analysis of automobile supply chain network
NASA Astrophysics Data System (ADS)
Sun, Jun-yan; Tang, Jian-ming; Fu, Wei-ping; Wu, Bing-ying
2017-05-01
Based on the connection mechanism of nodes which automatically select upstream and downstream agents, a simulation model for dynamic evolutionary process of consumer-driven automobile supply chain is established by integrating ABM and discrete modeling in the GIS-based map. Firstly, the rationality is proved by analyzing the consistency of sales and changes in various agent parameters between the simulation model and a real automobile supply chain. Second, through complex network theory, hierarchical structures of the model and relationships of networks at different levels are analyzed to calculate various characteristic parameters such as mean distance, mean clustering coefficients, and degree distributions. By doing so, it verifies that the model is a typical scale-free network and small-world network. Finally, the motion law of this model is analyzed from the perspective of complex self-adaptive systems. The chaotic state of the simulation system is verified, which suggests that this system has typical nonlinear characteristics. This model not only macroscopically illustrates the dynamic evolution of complex networks of automobile supply chain but also microcosmically reflects the business process of each agent. Moreover, the model construction and simulation of the system by means of combining CAS theory and complex networks supplies a novel method for supply chain analysis, as well as theory bases and experience for supply chain analysis of auto companies.
Crustal movements in Europe observed with EUROPE and IVS-T2 VLBI networks
NASA Astrophysics Data System (ADS)
Zubko, N.; Poutanen, M.
2011-07-01
The comparative analysis of the EUROPE and IVS-T2 geodetic VLBI sessions has been performed. The main purpose of both campaigns is to observe and accurately determine the VLBI station coordinates and their time evolution. In this analysis our interest is to understand the influence of network configuration on the estimated parameters and, also, how much the results of these two campaigns are consistent. We have used the VieVS software developing at Vienna University of Technology to analyze the EUROPE and IVS-T2 sessions of 2002-2009. We have analyzed the difference of crustal movements obtained with these two networks and the effect of network configuration and station selection. The EPN (EUREF permanent GNSS Network) and IGS (International GNSS Service) networks can be used to compare the results.
Application of a neural network for reflectance spectrum classification
NASA Astrophysics Data System (ADS)
Yang, Gefei; Gartley, Michael
2017-05-01
Traditional reflectance spectrum classification algorithms are based on comparing spectrum across the electromagnetic spectrum anywhere from the ultra-violet to the thermal infrared regions. These methods analyze reflectance on a pixel by pixel basis. Inspired by high performance that Convolution Neural Networks (CNN) have demonstrated in image classification, we applied a neural network to analyze directional reflectance pattern images. By using the bidirectional reflectance distribution function (BRDF) data, we can reformulate the 4-dimensional into 2 dimensions, namely incident direction × reflected direction × channels. Meanwhile, RIT's micro-DIRSIG model is utilized to simulate additional training samples for improving the robustness of the neural networks training. Unlike traditional classification by using hand-designed feature extraction with a trainable classifier, neural networks create several layers to learn a feature hierarchy from pixels to classifier and all layers are trained jointly. Hence, the our approach of utilizing the angular features are different to traditional methods utilizing spatial features. Although training processing typically has a large computational cost, simple classifiers work well when subsequently using neural network generated features. Currently, most popular neural networks such as VGG, GoogLeNet and AlexNet are trained based on RGB spatial image data. Our approach aims to build a directional reflectance spectrum based neural network to help us to understand from another perspective. At the end of this paper, we compare the difference among several classifiers and analyze the trade-off among neural networks parameters.
Loneliness and depression in the elderly: the role of social network.
Domènech-Abella, Joan; Lara, Elvira; Rubio-Valera, Maria; Olaya, Beatriz; Moneta, Maria Victoria; Rico-Uribe, Laura Alejandra; Ayuso-Mateos, Jose Luis; Mundó, Jordi; Haro, Josep Maria
2017-04-01
Loneliness and depression are associated, in particular in older adults. Less is known about the role of social networks in this relationship. The present study analyzes the influence of social networks in the relationship between loneliness and depression in the older adult population in Spain. A population-representative sample of 3535 adults aged 50 years and over from Spain was analyzed. Loneliness was assessed by means of the three-item UCLA Loneliness Scale. Social network characteristics were measured using the Berkman-Syme Social Network Index. Major depression in the previous 12 months was assessed with the Composite International Diagnostic Interview (CIDI). Logistic regression models were used to analyze the survey data. Feelings of loneliness were more prevalent in women, those who were younger (50-65), single, separated, divorced or widowed, living in a rural setting, with a lower frequency of social interactions and smaller social network, and with major depression. Among people feeling lonely, those with depression were more frequently married and had a small social network. Among those not feeling lonely, depression was associated with being previously married. In depressed people, feelings of loneliness were associated with having a small social network; while among those without depression, feelings of loneliness were associated with being married. The type and size of social networks have a role in the relationship between loneliness and depression. Increasing social interaction may be more beneficial than strategies based on improving maladaptive social cognition in loneliness to reduce the prevalence of depression among Spanish older adults.
Zhang, Minlu; Zhu, Cheng; Jacomy, Alexis; Lu, Long J.; Jegga, Anil G.
2011-01-01
The low prevalence rate of orphan diseases (OD) requires special combined efforts to improve diagnosis, prevention, and discovery of novel therapeutic strategies. To identify and investigate relationships based on shared genes or shared functional features, we have conducted a bioinformatic-based global analysis of all orphan diseases with known disease-causing mutant genes. Starting with a bipartite network of known OD and OD-causing mutant genes and using the human protein interactome, we first construct and topologically analyze three networks: the orphan disease network, the orphan disease-causing mutant gene network, and the orphan disease-causing mutant gene interactome. Our results demonstrate that in contrast to the common disease-causing mutant genes that are predominantly nonessential, a majority of orphan disease-causing mutant genes are essential. In confirmation of this finding, we found that OD-causing mutant genes are topologically important in the protein interactome and are ubiquitously expressed. Additionally, functional enrichment analysis of those genes in which mutations cause ODs shows that a majority result in premature death or are lethal in the orthologous mouse gene knockout models. To address the limitations of traditional gene-based disease networks, we also construct and analyze OD networks on the basis of shared enriched features (biological processes, cellular components, pathways, phenotypes, and literature citations). Analyzing these functionally-linked OD networks, we identified several additional OD-OD relations that are both phenotypically similar and phenotypically diverse. Surprisingly, we observed that the wiring of the gene-based and other feature-based OD networks are largely different; this suggests that the relationship between ODs cannot be fully captured by the gene-based network alone. PMID:21664998
Mining the modular structure of protein interaction networks.
Berenstein, Ariel José; Piñero, Janet; Furlong, Laura Inés; Chernomoretz, Ariel
2015-01-01
Cluster-based descriptions of biological networks have received much attention in recent years fostered by accumulated evidence of the existence of meaningful correlations between topological network clusters and biological functional modules. Several well-performing clustering algorithms exist to infer topological network partitions. However, due to respective technical idiosyncrasies they might produce dissimilar modular decompositions of a given network. In this contribution, we aimed to analyze how alternative modular descriptions could condition the outcome of follow-up network biology analysis. We considered a human protein interaction network and two paradigmatic cluster recognition algorithms, namely: the Clauset-Newman-Moore and the infomap procedures. We analyzed to what extent both methodologies yielded different results in terms of granularity and biological congruency. In addition, taking into account Guimera's cartographic role characterization of network nodes, we explored how the adoption of a given clustering methodology impinged on the ability to highlight relevant network meso-scale connectivity patterns. As a case study we considered a set of aging related proteins and showed that only the high-resolution modular description provided by infomap, could unveil statistically significant associations between them and inter/intra modular cartographic features. Besides reporting novel biological insights that could be gained from the discovered associations, our contribution warns against possible technical concerns that might affect the tools used to mine for interaction patterns in network biology studies. In particular our results suggested that sub-optimal partitions from the strict point of view of their modularity levels might still be worth being analyzed when meso-scale features were to be explored in connection with external source of biological knowledge.
Dynamical and topological aspects of consensus formation in complex networks
NASA Astrophysics Data System (ADS)
Chacoma, A.; Mato, G.; Kuperman, M. N.
2018-04-01
The present work analyzes a particular scenario of consensus formation, where the individuals navigate across an underlying network defining the topology of the walks. The consensus, associated to a given opinion coded as a simple message, is generated by interactions during the agent's walk and manifest itself in the collapse of the various opinions into a single one. We analyze how the topology of the underlying networks and the rules of interaction between the agents promote or inhibit the emergence of this consensus. We find that non-linear interaction rules are required to form consensus and that consensus is more easily achieved in networks whose degree distribution is narrower.
Networking Technologies Enable Advances in Earth Science
NASA Technical Reports Server (NTRS)
Johnson, Marjory; Freeman, Kenneth; Gilstrap, Raymond; Beck, Richard
2004-01-01
This paper describes an experiment to prototype a new way of conducting science by applying networking and distributed computing technologies to an Earth Science application. A combination of satellite, wireless, and terrestrial networking provided geologists at a remote field site with interactive access to supercomputer facilities at two NASA centers, thus enabling them to validate and calibrate remotely sensed geological data in near-real time. This represents a fundamental shift in the way that Earth scientists analyze remotely sensed data. In this paper we describe the experiment and the network infrastructure that enabled it, analyze the data flow during the experiment, and discuss the scientific impact of the results.
Characterizing time series: when Granger causality triggers complex networks
NASA Astrophysics Data System (ADS)
Ge, Tian; Cui, Yindong; Lin, Wei; Kurths, Jürgen; Liu, Chong
2012-08-01
In this paper, we propose a new approach to characterize time series with noise perturbations in both the time and frequency domains by combining Granger causality and complex networks. We construct directed and weighted complex networks from time series and use representative network measures to describe their physical and topological properties. Through analyzing the typical dynamical behaviors of some physical models and the MIT-BIHMassachusetts Institute of Technology-Beth Israel Hospital. human electrocardiogram data sets, we show that the proposed approach is able to capture and characterize various dynamics and has much potential for analyzing real-world time series of rather short length.
Window Dressing on the Set: An Update.
ERIC Educational Resources Information Center
Commission on Civil Rights, Washington, DC.
Analyzed in this report are the portrayals of minorities and women in television drama from 1975-1977 and the representation of minorities and women in the network news of 1977. Also analyzed are 1977 employment patterns at local and network television stations and television's effects on viewers and the first amendment. Data presented show that…
How to Analyze Company Using Social Network?
NASA Astrophysics Data System (ADS)
Palus, Sebastian; Bródka, Piotr; Kazienko, Przemysław
Every single company or institution wants to utilize its resources in the most efficient way. In order to do so they have to be have good structure. The new way to analyze company structure by utilizing existing within company natural social network and example of its usage on Enron company are presented in this paper.
Preparing for a Career as a Network Engineer
ERIC Educational Resources Information Center
Morris, Gerard; Fustos, Janos; Haga, Wayne
2012-01-01
A network engineer is an Information Technology (IT) professional who designs, implements, maintains, and troubleshoots computer networks. While the United States is still experiencing relatively high unemployment, demand for network engineers remains strong. To determine what skills employers are looking for, data was collected and analyzed from…
Interpersonal Choice and Networks in China.
ERIC Educational Resources Information Center
Blau, Peter M.; And Others
1991-01-01
The microstructures of interpersonal networks in China and the United States contain many consistent patterns, despite the countries' great differences. In-group choices and network diversity are analyzed with regard to age, sex, educational attainment, occupation, socioeconomic status, and proportion of kin in the network. Contains 21 references…
De Brún, Aoife; McAuliffe, Eilish
2018-03-13
Health systems research recognizes the complexity of healthcare, and the interacting and interdependent nature of components of a health system. To better understand such systems, innovative methods are required to depict and analyze their structures. This paper describes social network analysis as a methodology to depict, diagnose, and evaluate health systems and networks therein. Social network analysis is a set of techniques to map, measure, and analyze social relationships between people, teams, and organizations. Through use of a case study exploring support relationships among senior managers in a newly established hospital group, this paper illustrates some of the commonly used network- and node-level metrics in social network analysis, and demonstrates the value of these maps and metrics to understand systems. Network analysis offers a valuable approach to health systems and services researchers as it offers a means to depict activity relevant to network questions of interest, to identify opinion leaders, influencers, clusters in the network, and those individuals serving as bridgers across clusters. The strengths and limitations inherent in the method are discussed, and the applications of social network analysis in health services research are explored.
Song, Kaida; Wang, Rui; Liu, Yi; Qian, Depei; Zhang, Han; Cai, Jihong
2015-01-01
Community networks, the distinguishing feature of which is membership admittance, appear on P2P networks, social networks, and conventional Web networks. Joining the network costs money, time or network bandwidth, but the individuals get access to special resources owned by the community in return. The prosperity and stability of the community are determined by both the policy of admittance and the attraction of the privileges gained by joining. However, some misbehaving users can get the dedicated resources with some illicit and low-cost approaches, which introduce instability into the community, a phenomenon that will destroy the membership policy. In this paper, we analyze on the stability using game theory on such a phenomenon. We propose a game-theoretical model of stability analysis in community networks and provide conditions for a stable community. We then extend the model to analyze the effectiveness of different incentive policies, which could be used when the community cannot maintain its members in certain situations. Then we verify those models through a simulation. Finally, we discuss several ways to promote community network's stability by adjusting the network's properties and give some proposal on the designs of these types of networks from the points of game theory and stability.
GFD-Net: A novel semantic similarity methodology for the analysis of gene networks.
Díaz-Montaña, Juan J; Díaz-Díaz, Norberto; Gómez-Vela, Francisco
2017-04-01
Since the popularization of biological network inference methods, it has become crucial to create methods to validate the resulting models. Here we present GFD-Net, the first methodology that applies the concept of semantic similarity to gene network analysis. GFD-Net combines the concept of semantic similarity with the use of gene network topology to analyze the functional dissimilarity of gene networks based on Gene Ontology (GO). The main innovation of GFD-Net lies in the way that semantic similarity is used to analyze gene networks taking into account the network topology. GFD-Net selects a functionality for each gene (specified by a GO term), weights each edge according to the dissimilarity between the nodes at its ends and calculates a quantitative measure of the network functional dissimilarity, i.e. a quantitative value of the degree of dissimilarity between the connected genes. The robustness of GFD-Net as a gene network validation tool was demonstrated by performing a ROC analysis on several network repositories. Furthermore, a well-known network was analyzed showing that GFD-Net can also be used to infer knowledge. The relevance of GFD-Net becomes more evident in Section "GFD-Net applied to the study of human diseases" where an example of how GFD-Net can be applied to the study of human diseases is presented. GFD-Net is available as an open-source Cytoscape app which offers a user-friendly interface to configure and execute the algorithm as well as the ability to visualize and interact with the results(http://apps.cytoscape.org/apps/gfdnet). Copyright © 2017 Elsevier Inc. All rights reserved.
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.
Liang, Geng; Wang, Hong; Li, Wen; Li, Dazhong
2010-10-01
Data exchange patterns between nodes in WorldFIP fieldbus network are quite important and meaningful in improving the communication performance of WorldFIP network. Based on the basic communication ways supported in WorldFIP protocol, we propose two patterns for implementation of data exchange between peer nodes over WorldFIP network. Effects on communication performance of WorldFIP network in terms of some network parameters, such as number of bytes in user's data and turn-around time, in both the proposed patterns, are analyzed at length when different network speeds are applied. Such effects with the patterns of periodic message transmission using acknowledged and non-acknowledged messages, are also studied. Communication performance in both the proposed patterns are analyzed and compared. Practical applications of the research are presented. Through the study, it can be seen that different data exchange patterns make a great difference in improving communication efficiency with different network parameters, which is quite useful and helpful in the practical design of distributed systems based on WorldFIP network. Copyright © 2010 ISA. Published by Elsevier Ltd. All rights reserved.
Visual behavior characterization for intrusion and misuse detection
NASA Astrophysics Data System (ADS)
Erbacher, Robert F.; Frincke, Deborah
2001-05-01
As computer and network intrusions become more and more of a concern, the need for better capabilities, to assist in the detection and analysis of intrusions also increase. System administrators typically rely on log files to analyze usage and detect misuse. However, as a consequence of the amount of data collected by each machine, multiplied by the tens or hundreds of machines under the system administrator's auspices, the entirety of the data available is neither collected nor analyzed. This is compounded by the need to analyze network traffic data as well. We propose a methodology for analyzing network and computer log information visually based on the analysis of the behavior of the users. Each user's behavior is the key to determining their intent and overriding activity, whether they attempt to hide their actions or not. Proficient hackers will attempt to hide their ultimate activities, which hinders the reliability of log file analysis. Visually analyzing the users''s behavior however, is much more adaptable and difficult to counteract.
Development of a new software for analyzing 3-D fracture network
NASA Astrophysics Data System (ADS)
Um, Jeong-Gi; Noh, Young-Hwan; Choi, Yosoon
2014-05-01
A new software is presented to analyze fracture network in 3-D. Recently, we completed the software package based on information given in EGU2013. The software consists of several modules that play roles in management of borehole data, stochastic modelling of fracture network, construction of analysis domain, visualization of fracture geometry in 3-D, calculation of equivalent pipes and production of cross-section diagrams. Intel Parallel Studio XE 2013, Visual Studio.NET 2010 and the open source VTK library were utilized as development tools to efficiently implement the modules and the graphical user interface of the software. A case study was performed to analyze 3-D fracture network system at the Upper Devonian Grosmont Formation in Alberta, Canada. The results have suggested that the developed software is effective in modelling and visualizing 3-D fracture network system, and can provide useful information to tackle the geomechanical problems related to strength, deformability and hydraulic behaviours of the fractured rock masses. This presentation describes the concept and details of the development and implementation of the software.
Zhang, Wei; Zhang, Gengxin; Dong, Feihong; Xie, Zhidong; Bian, Dongming
2015-01-01
This article investigates the capacity problem of an integrated remote wireless sensor and satellite network (IWSSN) in emergency scenarios. We formulate a general model to evaluate the remote sensor and satellite network capacity. Compared to most existing works for ground networks, the proposed model is time varying and space oriented. To capture the characteristics of a practical network, we sift through major capacity-impacting constraints and analyze the influence of these constraints. Specifically, we combine the geometric satellite orbit model and satellite tool kit (STK) engineering software to quantify the trends of the capacity constraints. Our objective in analyzing these trends is to provide insights and design guidelines for optimizing the integrated remote wireless sensor and satellite network schedules. Simulation results validate the theoretical analysis of capacity trends and show the optimization opportunities of the IWSSN. PMID:26593919
Zhang, Wei; Zhang, Gengxin; Dong, Feihong; Xie, Zhidong; Bian, Dongming
2015-11-17
This article investigates the capacity problem of an integrated remote wireless sensor and satellite network (IWSSN) in emergency scenarios. We formulate a general model to evaluate the remote sensor and satellite network capacity. Compared to most existing works for ground networks, the proposed model is time varying and space oriented. To capture the characteristics of a practical network, we sift through major capacity-impacting constraints and analyze the influence of these constraints. Specifically, we combine the geometric satellite orbit model and satellite tool kit (STK) engineering software to quantify the trends of the capacity constraints. Our objective in analyzing these trends is to provide insights and design guidelines for optimizing the integrated remote wireless sensor and satellite network schedules. Simulation results validate the theoretical analysis of capacity trends and show the optimization opportunities of the IWSSN.
Research on TCP/IP network communication based on Node.js
NASA Astrophysics Data System (ADS)
Huang, Jing; Cai, Lixiong
2018-04-01
In the face of big data, long connection and high synchronization, TCP/IP network communication will cause performance bottlenecks due to its blocking multi-threading service model. This paper presents a method of TCP/IP network communication protocol based on Node.js. On the basis of analyzing the characteristics of Node.js architecture and asynchronous non-blocking I/O model, the principle of its efficiency is discussed, and then compare and analyze the network communication model of TCP/IP protocol to expound the reasons why TCP/IP protocol stack is widely used in network communication. Finally, according to the large data and high concurrency in the large-scale grape growing environment monitoring process, a TCP server design based on Node.js is completed. The results show that the example runs stably and efficiently.
Chen, Shi; Ilany, Amiyaal; White, Brad J; Sanderson, Michael W; Lanzas, Cristina
2015-01-01
Animal social network is the key to understand many ecological and epidemiological processes. We used real-time location system (RTLS) to accurately track cattle position, analyze their proximity networks, and tested the hypothesis of temporal stationarity and spatial homogeneity in these networks during different daily time periods and in different areas of the pen. The network structure was analyzed using global network characteristics (network density), subgroup clustering (modularity), triadic property (transitivity), and dyadic interactions (correlation coefficient from a quadratic assignment procedure) at hourly level. We demonstrated substantial spatial-temporal heterogeneity in these networks and potential link between indirect animal-environment contact and direct animal-animal contact. But such heterogeneity diminished if data were collected at lower spatial (aggregated at entire pen level) or temporal (aggregated at daily level) resolution. The network structure (described by the characteristics such as density, modularity, transitivity, etc.) also changed substantially at different time and locations. There were certain time (feeding) and location (hay) that the proximity network structures were more consistent based on the dyadic interaction analysis. These results reveal new insights for animal network structure and spatial-temporal dynamics, provide more accurate descriptions of animal social networks, and allow more accurate modeling of multiple (both direct and indirect) disease transmission pathways.
Increasing Scalability of Researcher Network Extraction from the Web
NASA Astrophysics Data System (ADS)
Asada, Yohei; Matsuo, Yutaka; Ishizuka, Mitsuru
Social networks, which describe relations among people or organizations as a network, have recently attracted attention. With the help of a social network, we can analyze the structure of a community and thereby promote efficient communications within it. We investigate the problem of extracting a network of researchers from the Web, to assist efficient cooperation among researchers. Our method uses a search engine to get the cooccurences of names of two researchers and calculates the streangth of the relation between them. Then we label the relation by analyzing the Web pages in which these two names cooccur. Research on social network extraction using search engines as ours, is attracting attention in Japan as well as abroad. However, the former approaches issue too many queries to search engines to extract a large-scale network. In this paper, we propose a method to filter superfluous queries and facilitates the extraction of large-scale networks. By this method we are able to extract a network of around 3000-nodes. Our experimental results show that the proposed method reduces the number of queries significantly while preserving the quality of the network as compared to former methods.
Inferring Phylogenetic Networks Using PhyloNet.
Wen, Dingqiao; Yu, Yun; Zhu, Jiafan; Nakhleh, Luay
2018-07-01
PhyloNet was released in 2008 as a software package for representing and analyzing phylogenetic networks. At the time of its release, the main functionalities in PhyloNet consisted of measures for comparing network topologies and a single heuristic for reconciling gene trees with a species tree. Since then, PhyloNet has grown significantly. The software package now includes a wide array of methods for inferring phylogenetic networks from data sets of unlinked loci while accounting for both reticulation (e.g., hybridization) and incomplete lineage sorting. In particular, PhyloNet now allows for maximum parsimony, maximum likelihood, and Bayesian inference of phylogenetic networks from gene tree estimates. Furthermore, Bayesian inference directly from sequence data (sequence alignments or biallelic markers) is implemented. Maximum parsimony is based on an extension of the "minimizing deep coalescences" criterion to phylogenetic networks, whereas maximum likelihood and Bayesian inference are based on the multispecies network coalescent. All methods allow for multiple individuals per species. As computing the likelihood of a phylogenetic network is computationally hard, PhyloNet allows for evaluation and inference of networks using a pseudolikelihood measure. PhyloNet summarizes the results of the various analyzes and generates phylogenetic networks in the extended Newick format that is readily viewable by existing visualization software.
Souza, Marcos Antônio de; Salvalaio, Dalva
2010-10-01
to analyze the cost of a self-owned network maintained by a Brazilian health insurance provider as compared to the price charged by accredited service providers, so as to identify whether or not the self-owned network is economically advantageous. for this exploratory study, the company's management reports were reviewed. The cost associated with the self-owned network was calculated based on medical and dental office visits and diagnostic/laboratory tests performed at one of the company's most representative facilities. The costs associated with third parties were derived from price tables used by the accredited network for the same services analyzed in the self-owned network. The full-cost method was used for cost quantification. Costs are presented as absolute values (in R$) and percent comparisons between self-owned network costs versus accredited network costs. overall, the self-owned network was advantageous for medical and dental consultations as well as diagnostic and laboratory tests. Pediatric and labor medicine consultations and x-rays were less costly in the accredited network. the choice of verticalization has economic advantages for the health care insurance operator in comparison with services provided by third parties.
Merrill, Jacqueline; Bakken, Suzanne; Rockoff, Maxine; Gebbie, Kristine; Carley, Kathleen
2007-01-01
In this case study we describe a method that has potential to provide systematic support for public health information management. Public health agencies depend on specialized information that travels throughout an organization via communication networks among employees. Interactions that occur within these networks are poorly understood and are generally unmanaged. We applied organizational network analysis, a method for studying communication networks, to assess the method’s utility to support decision making for public health managers, and to determine what links existed between information use and agency processes. Data on communication links among a health department’s staff was obtained via survey with a 93% response rate, and analyzed using Organizational Risk Analyzer (ORA) software. The findings described the structure of information flow in the department’s communication networks. The analysis succeeded in providing insights into organizational processes which informed public health managers’ strategies to address problems and to take advantage of network strengths. PMID:17098480
The stability of the international oil trade network from short-term and long-term perspectives
NASA Astrophysics Data System (ADS)
Sun, Qingru; Gao, Xiangyun; Zhong, Weiqiong; Liu, Nairong
2017-09-01
To examine the stability of the international oil trade network and explore the influence of countries and trade relationships on the trade stability, we construct weighted and unweighted international oil trade networks based on complex network theory using oil trading data between countries from 1996 to 2014. We analyze the stability of international oil trade network (IOTN) from short-term and long-term aspects. From the short-term perspective, we find that the trade volumes play an important role on the stability. Moreover, the weighted IOTN is stable; however, the unweighted networks can better reflect the actual evolution of IOTN. From the long-term perspective, we identify trade relationships that are maintained during the whole sample period to reveal the situation of the whole international oil trade. We provide a way to quantitatively measure the stability of complex network from short-term and long-term perspectives, which can be applied to measure and analyze trade stability of other goods or services.
NASA Astrophysics Data System (ADS)
Fu, Yu-Hsiang; Huang, Chung-Yuan; Sun, Chuen-Tsai
2016-11-01
Using network community structures to identify multiple influential spreaders is an appropriate method for analyzing the dissemination of information, ideas and infectious diseases. For example, data on spreaders selected from groups of customers who make similar purchases may be used to advertise products and to optimize limited resource allocation. Other examples include community detection approaches aimed at identifying structures and groups in social or complex networks. However, determining the number of communities in a network remains a challenge. In this paper we describe our proposal for a two-phase evolutionary framework (TPEF) for determining community numbers and maximizing community modularity. Lancichinetti-Fortunato-Radicchi benchmark networks were used to test our proposed method and to analyze execution time, community structure quality, convergence, and the network spreading effect. Results indicate that our proposed TPEF generates satisfactory levels of community quality and convergence. They also suggest a need for an index, mechanism or sampling technique to determine whether a community detection approach should be used for selecting multiple network spreaders.
Zhang, Xiao-Dong; Wu, Hong-Ying; Jin, Jin; Yu, Guang-Yun; He, Xin; Wang, Hao; Shen, Xiu; Zhou, Ze-Wei; Liu, Pei-Xun; Fan, Sai-Jun
2013-01-01
A traditional Chinese medicine (TCM) formula network including 362 TCM formulas was built by using complex network methodologies. The properties of this network were analyzed including network diameter, average distance, clustering coefficient, and average degree. Meanwhile, we built a TCM chemical space and a TCM metabolism room under the theory of chemical space. The properties of chemical space and metabolism room were calculated and analyzed. The properties of the medicine pairs in “eighteen antagonisms and nineteen mutual inhibitors,” an ancient rule for TCM incompatibility, were studied based on the TCM formula network, chemical space, and metabolism room. The results showed that the properties of these incompatible medicine pairs are different from those of the other TCM based on the analysis of the TCM formula network, chemical space, and metabolism room. The lines of evidence derived from our work demonstrated that the ancient rule of TCM incompatibility, “eighteen antagonisms and nineteen mutual inhibitors,” is probably scientifically based. PMID:24369478
Safari-Alighiarloo, Nahid; Taghizadeh, Mohammad; Tabatabaei, Seyyed Mohammad; Namaki, Saeed
2016-01-01
Background The involvement of multiple genes and missing heritability, which are dominant in complex diseases such as multiple sclerosis (MS), entail using network biology to better elucidate their molecular basis and genetic factors. We therefore aimed to integrate interactome (protein–protein interaction (PPI)) and transcriptomes data to construct and analyze PPI networks for MS disease. Methods Gene expression profiles in paired cerebrospinal fluid (CSF) and peripheral blood mononuclear cells (PBMCs) samples from MS patients, sampled in relapse or remission and controls, were analyzed. Differentially expressed genes which determined only in CSF (MS vs. control) and PBMCs (relapse vs. remission) separately integrated with PPI data to construct the Query-Query PPI (QQPPI) networks. The networks were further analyzed to investigate more central genes, functional modules and complexes involved in MS progression. Results The networks were analyzed and high centrality genes were identified. Exploration of functional modules and complexes showed that the majority of high centrality genes incorporated in biological pathways driving MS pathogenesis. Proteasome and spliceosome were also noticeable in enriched pathways in PBMCs (relapse vs. remission) which were identified by both modularity and clique analyses. Finally, STK4, RB1, CDKN1A, CDK1, RAC1, EZH2, SDCBP genes in CSF (MS vs. control) and CDC37, MAP3K3, MYC genes in PBMCs (relapse vs. remission) were identified as potential candidate genes for MS, which were the more central genes involved in biological pathways. Discussion This study showed that network-based analysis could explicate the complex interplay between biological processes underlying MS. Furthermore, an experimental validation of candidate genes can lead to identification of potential therapeutic targets. PMID:28028462
Application of the GERTS II simulator in the industrial environment.
NASA Technical Reports Server (NTRS)
Whitehouse, G. E.; Klein, K. I.
1971-01-01
GERT was originally developed to aid in the analysis of stochastic networks. GERT can be used to graphically model and analyze complex systems. Recently a simulator model, GERTS II, has been developed to solve GERT Networks. The simulator language used in the development of this model was GASP II A. This paper discusses the possible application of GERTS II to model and analyze (1) assembly line operations, (2) project management networks, (3) conveyor systems and (4) inventory systems. Finally, an actual application dealing with a job shop loading problem is presented.
Fractional Hopfield Neural Networks: Fractional Dynamic Associative Recurrent Neural Networks.
Pu, Yi-Fei; Yi, Zhang; Zhou, Ji-Liu
2017-10-01
This paper mainly discusses a novel conceptual framework: fractional Hopfield neural networks (FHNN). As is commonly known, fractional calculus has been incorporated into artificial neural networks, mainly because of its long-term memory and nonlocality. Some researchers have made interesting attempts at fractional neural networks and gained competitive advantages over integer-order neural networks. Therefore, it is naturally makes one ponder how to generalize the first-order Hopfield neural networks to the fractional-order ones, and how to implement FHNN by means of fractional calculus. We propose to introduce a novel mathematical method: fractional calculus to implement FHNN. First, we implement fractor in the form of an analog circuit. Second, we implement FHNN by utilizing fractor and the fractional steepest descent approach, construct its Lyapunov function, and further analyze its attractors. Third, we perform experiments to analyze the stability and convergence of FHNN, and further discuss its applications to the defense against chip cloning attacks for anticounterfeiting. The main contribution of our work is to propose FHNN in the form of an analog circuit by utilizing a fractor and the fractional steepest descent approach, construct its Lyapunov function, prove its Lyapunov stability, analyze its attractors, and apply FHNN to the defense against chip cloning attacks for anticounterfeiting. A significant advantage of FHNN is that its attractors essentially relate to the neuron's fractional order. FHNN possesses the fractional-order-stability and fractional-order-sensitivity characteristics.
Method and system for pattern analysis using a coarse-coded neural network
NASA Technical Reports Server (NTRS)
Spirkovska, Liljana (Inventor); Reid, Max B. (Inventor)
1994-01-01
A method and system for performing pattern analysis with a neural network coarse-coding a pattern to be analyzed so as to form a plurality of sub-patterns collectively defined by data. Each of the sub-patterns comprises sets of pattern data. The neural network includes a plurality fields, each field being associated with one of the sub-patterns so as to receive the sub-pattern data therefrom. Training and testing by the neural network then proceeds in the usual way, with one modification: the transfer function thresholds the value obtained from summing the weighted products of each field over all sub-patterns associated with each pattern being analyzed by the system.
ERIC Educational Resources Information Center
Abouserie, Hossam Eldin Mohamed Refaat
2009-01-01
The study investigated networking courses offered in accredited Library and Information Science schools in the United States in 2009. The study analyzed and compared network syllabi according to Course Syllabus Evaluation Rubric to obtain in-depth understanding of basic features and characteristics of networking courses taught. The study embraced…
Relationship between Social Networks Adoption and Social Intelligence
ERIC Educational Resources Information Center
Gunduz, Semseddin
2017-01-01
The purpose of this study was to set forth the relationship between the individuals' states to adopt social networks and social intelligence and analyze both concepts according to various variables. Research data were collected from 1145 social network users in the online media by using the Adoption of Social Network Scale and Social Intelligence…
ERIC Educational Resources Information Center
Reychav, Iris; Raban, Daphne Ruth; McHaney, Roger
2018-01-01
The current empirical study examines relationships between network measures and learning performance from a social network analysis perspective. We collected computerized, networking data to analyze how 401 junior high students connected to classroom peers using text- and video-based material on iPads. Following a period of computerized…
What Factors Predict Who Will Have a Strong Social Network Following a Stroke?
ERIC Educational Resources Information Center
Northcott, Sarah; Marshall, Jane; Hilari, Katerina
2016-01-01
Purpose: Measures of social networks assess the number and nature of a person's social contacts, and strongly predict health outcomes. We explored how social networks change following a stroke and analyzed concurrent and baseline predictors of social networks 6 months poststroke. Method: We conducted a prospective longitudinal observational study.…
Development and Evaluation of a City-Wide Wireless Weather Sensor Network
ERIC Educational Resources Information Center
Chang, Ben; Wang, Hsue-Yie; Peng, Tian-Yin; Hsu, Ying-Shao
2010-01-01
This project analyzed the effectiveness of a city-wide wireless weather sensor network, the Taipei Weather Science Learning Network (TWIN), in facilitating elementary and junior high students' study of weather science. The network, composed of sixty school-based weather sensor nodes and a centralized weather data archive server, provides students…
Gregoretti, Francesco; Belcastro, Vincenzo; di Bernardo, Diego; Oliva, Gennaro
2010-04-21
The reverse engineering of gene regulatory networks using gene expression profile data has become crucial to gain novel biological knowledge. Large amounts of data that need to be analyzed are currently being produced due to advances in microarray technologies. Using current reverse engineering algorithms to analyze large data sets can be very computational-intensive. These emerging computational requirements can be met using parallel computing techniques. It has been shown that the Network Identification by multiple Regression (NIR) algorithm performs better than the other ready-to-use reverse engineering software. However it cannot be used with large networks with thousands of nodes--as is the case in biological networks--due to the high time and space complexity. In this work we overcome this limitation by designing and developing a parallel version of the NIR algorithm. The new implementation of the algorithm reaches a very good accuracy even for large gene networks, improving our understanding of the gene regulatory networks that is crucial for a wide range of biomedical applications.
Meng, Lu; Xiang, Jing
2016-11-01
The present study investigated frequency dependent developmental patterns of the brain resting-state networks from childhood to adolescence. Magnetoencephalography (MEG) data were recorded from 20 healthy subjects at resting-state with eyes-open. The resting-state networks (RSNs) was analyzed at source-level. Brain network organization was characterized by mean clustering coefficient and average path length. The correlations between brain network measures and subjects' age during development from childhood to adolescence were statistically analyzed in delta (1-4Hz), theta (4-8Hz), alpha (8-12Hz), and beta (12-30Hz) frequency bands. A significant positive correlation between functional connectivity with age was found in alpha and beta frequency bands. A significant negative correlation between average path lengths with age was found in beta frequency band. The results suggest that there are significant developmental changes of resting-state networks from childhood to adolescence, which matures from a lattice network to a small-world network. Copyright © 2016 The Japanese Society of Child Neurology. Published by Elsevier B.V. All rights reserved.
Effects of the bipartite structure of a network on performance of recommenders
NASA Astrophysics Data System (ADS)
Wang, Qing-Xian; Li, Jian; Luo, Xin; Xu, Jian-Jun; Shang, Ming-Sheng
2018-02-01
Recommender systems aim to predict people's preferences for online items by analyzing their historical behaviors. A recommender can be modeled as a high-dimensional and sparse bipartite network, where the key issue is to understand the relation between the network structure and a recommender's performance. To address this issue, we choose three network characteristics, clustering coefficient, network density and user-item ratio, as the analyzing targets. For the cluster coefficient, we adopt the Degree-preserving rewiring algorithm to obtain a series of bipartite network with varying cluster coefficient, while the degree of user and item keep unchanged. Furthermore, five state-of-the-art recommenders are applied on two real datasets. The performances of recommenders are measured by both numerical and physical metrics. These results show that a recommender's performance is positively related to the clustering coefficient of a bipartite network. Meanwhile, higher density of a bipartite network can provide more accurate but less diverse or novel recommendations. Furthermore, the user-item ratio is positively correlated with the accuracy metrics but negatively correlated with the diverse and novel metrics.
Mallik, Mrinmay Kumar
2018-02-07
Biological networks can be analyzed using "Centrality Analysis" to identify the more influential nodes and interactions in the network. This study was undertaken to create and visualize a biological network comprising of protein-protein interactions (PPIs) amongst proteins which are preferentially over-expressed in glioma cancer stem cell component (GCSC) of glioblastomas as compared to the glioma non-stem cancer cell (GNSC) component and then to analyze this network through centrality analyses (CA) in order to identify the essential proteins in this network and their interactions. In addition, this study proposes a new centrality analysis method pertaining exclusively to transcription factors (TFs) and interactions amongst them. Moreover the relevant molecular functions, biological processes and biochemical pathways amongst these proteins were sought through enrichment analysis. A protein interaction network was created using a list of proteins which have been shown to be preferentially expressed or over-expressed in GCSCs isolated from glioblastomas as compared to the GNSCs. This list comprising of 38 proteins, created using manual literature mining, was submitted to the Reactome FIViz tool, a web based application integrated into Cytoscape, an open source software platform for visualizing and analyzing molecular interaction networks and biological pathways to produce the network. This network was subjected to centrality analyses utilizing ranked lists of six centrality measures using the FIViz application and (for the first time) a dedicated centrality analysis plug-in ; CytoNCA. The interactions exclusively amongst the transcription factors were nalyzed through a newly proposed centrality analysis method called "Gene Expression Associated Degree Centrality Analysis (GEADCA)". Enrichment analysis was performed using the "network function analysis" tool on Reactome. The CA was able to identify a small set of proteins with consistently high centrality ranks that is indicative of their strong influence in the protein protein interaction network. Similarly the newly proposed GEADCA helped identify the transcription factors with high centrality values indicative of their key roles in transcriptional regulation. The enrichment studies provided a list of molecular functions, biological processes and biochemical pathways associated with the constructed network. The study shows how pathway based databases may be used to create and analyze a relevant protein interaction network in glioma cancer stem cells and identify the essential elements within it to gather insights into the molecular interactions that regulate the properties of glioma stem cells. How these insights may be utilized to help the development of future research towards formulation of new management strategies have been discussed from a theoretical standpoint. Copyright © 2017 Elsevier Ltd. All rights reserved.
Udrescu, Lucreţia; Sbârcea, Laura; Topîrceanu, Alexandru; Iovanovici, Alexandru; Kurunczi, Ludovic; Bogdan, Paul; Udrescu, Mihai
2016-09-07
Analyzing drug-drug interactions may unravel previously unknown drug action patterns, leading to the development of new drug discovery tools. We present a new approach to analyzing drug-drug interaction networks, based on clustering and topological community detection techniques that are specific to complex network science. Our methodology uncovers functional drug categories along with the intricate relationships between them. Using modularity-based and energy-model layout community detection algorithms, we link the network clusters to 9 relevant pharmacological properties. Out of the 1141 drugs from the DrugBank 4.1 database, our extensive literature survey and cross-checking with other databases such as Drugs.com, RxList, and DrugBank 4.3 confirm the predicted properties for 85% of the drugs. As such, we argue that network analysis offers a high-level grasp on a wide area of pharmacological aspects, indicating possible unaccounted interactions and missing pharmacological properties that can lead to drug repositioning for the 15% drugs which seem to be inconsistent with the predicted property. Also, by using network centralities, we can rank drugs according to their interaction potential for both simple and complex multi-pathology therapies. Moreover, our clustering approach can be extended for applications such as analyzing drug-target interactions or phenotyping patients in personalized medicine applications.
Udrescu, Lucreţia; Sbârcea, Laura; Topîrceanu, Alexandru; Iovanovici, Alexandru; Kurunczi, Ludovic; Bogdan, Paul; Udrescu, Mihai
2016-01-01
Analyzing drug-drug interactions may unravel previously unknown drug action patterns, leading to the development of new drug discovery tools. We present a new approach to analyzing drug-drug interaction networks, based on clustering and topological community detection techniques that are specific to complex network science. Our methodology uncovers functional drug categories along with the intricate relationships between them. Using modularity-based and energy-model layout community detection algorithms, we link the network clusters to 9 relevant pharmacological properties. Out of the 1141 drugs from the DrugBank 4.1 database, our extensive literature survey and cross-checking with other databases such as Drugs.com, RxList, and DrugBank 4.3 confirm the predicted properties for 85% of the drugs. As such, we argue that network analysis offers a high-level grasp on a wide area of pharmacological aspects, indicating possible unaccounted interactions and missing pharmacological properties that can lead to drug repositioning for the 15% drugs which seem to be inconsistent with the predicted property. Also, by using network centralities, we can rank drugs according to their interaction potential for both simple and complex multi-pathology therapies. Moreover, our clustering approach can be extended for applications such as analyzing drug-target interactions or phenotyping patients in personalized medicine applications. PMID:27599720
Uhart, Marina; Flores, Gabriel; Bustos, Diego M.
2016-01-01
Posttranslational regulation of protein function is an ubiquitous mechanism in eukaryotic cells. Here, we analyzed biological properties of nodes and edges of a human protein-protein interaction phosphorylation-based network, especially of those nodes critical for the network controllability. We found that the minimal number of critical nodes needed to control the whole network is 29%, which is considerably lower compared to other real networks. These critical nodes are more regulated by posttranslational modifications and contain more binding domains to these modifications than other kinds of nodes in the network, suggesting an intra-group fast regulation. Also, when we analyzed the edges characteristics that connect critical and non-critical nodes, we found that the former are enriched in domain-to-eukaryotic linear motif interactions, whereas the later are enriched in domain-domain interactions. Our findings suggest a possible structure for protein-protein interaction networks with a densely interconnected and self-regulated central core, composed of critical nodes with a high participation in the controllability of the full network, and less regulated peripheral nodes. Our study offers a deeper understanding of complex network control and bridges the controllability theorems for complex networks and biological protein-protein interaction phosphorylation-based networked systems. PMID:27195976
Hosseini, S M Hadi; Hoeft, Fumiko; Kesler, Shelli R
2012-01-01
In recent years, graph theoretical analyses of neuroimaging data have increased our understanding of the organization of large-scale structural and functional brain networks. However, tools for pipeline application of graph theory for analyzing topology of brain networks is still lacking. In this report, we describe the development of a graph-analysis toolbox (GAT) that facilitates analysis and comparison of structural and functional network brain networks. GAT provides a graphical user interface (GUI) that facilitates construction and analysis of brain networks, comparison of regional and global topological properties between networks, analysis of network hub and modules, and analysis of resilience of the networks to random failure and targeted attacks. Area under a curve (AUC) and functional data analyses (FDA), in conjunction with permutation testing, is employed for testing the differences in network topologies; analyses that are less sensitive to the thresholding process. We demonstrated the capabilities of GAT by investigating the differences in the organization of regional gray-matter correlation networks in survivors of acute lymphoblastic leukemia (ALL) and healthy matched Controls (CON). The results revealed an alteration in small-world characteristics of the brain networks in the ALL survivors; an observation that confirm our hypothesis suggesting widespread neurobiological injury in ALL survivors. Along with demonstration of the capabilities of the GAT, this is the first report of altered large-scale structural brain networks in ALL survivors.
MmWave Vehicle-to-Infrastructure Communication :Analysis of Urban Microcellular Networks
DOT National Transportation Integrated Search
2017-05-01
Vehicle-to-infrastructure (V2I) communication may provide high data rates to vehicles via millimeterwave (mmWave) microcellular networks. This report uses stochastic geometry to analyze the coverage of urban mmWave microcellular networks. Prior work ...
NASA Technical Reports Server (NTRS)
Patniak, Surya N.; Guptill, James D.; Hopkins, Dale A.; Lavelle, Thomas M.
1998-01-01
Nonlinear mathematical-programming-based design optimization can be an elegant method. However, the calculations required to generate the merit function, constraints, and their gradients, which are frequently required, can make the process computational intensive. The computational burden can be greatly reduced by using approximating analyzers derived from an original analyzer utilizing neural networks and linear regression methods. The experience gained from using both of these approximation methods in the design optimization of a high speed civil transport aircraft is the subject of this paper. The Langley Research Center's Flight Optimization System was selected for the aircraft analysis. This software was exercised to generate a set of training data with which a neural network and a regression method were trained, thereby producing the two approximating analyzers. The derived analyzers were coupled to the Lewis Research Center's CometBoards test bed to provide the optimization capability. With the combined software, both approximation methods were examined for use in aircraft design optimization, and both performed satisfactorily. The CPU time for solution of the problem, which had been measured in hours, was reduced to minutes with the neural network approximation and to seconds with the regression method. Instability encountered in the aircraft analysis software at certain design points was also eliminated. On the other hand, there were costs and difficulties associated with training the approximating analyzers. The CPU time required to generate the input-output pairs and to train the approximating analyzers was seven times that required for solution of the problem.
NASA Astrophysics Data System (ADS)
Wang, Yubao; Zhu, Zhaohui; Wang, Lu; Bai, Jian
2016-05-01
A novel GPON-oriented sensing data digitalization system is proposed to achieve remote monitoring of fiber grating sensing networks utilizing existing optical communication networks in some harsh environments. In which, Quick digitalization of sensing information obtained from the reflected lightwaves by fiber Bragg grating (FBG) sensor is realized, and a novel frame format of sensor signal is designed to suit for public transport so as to facilitate sensor monitoring center to receive and analyze the sensor data. The delay effect, identification method of the sensor data, and various interference factors which influence the sensor data to be correctly received are analyzed. The system simulation is carried out with OptiSystem/Matlab co-simulation approach. The theoretical analysis and simulation results verify the feasibility of the integration of the sensor network and communication network.
Statistical mechanics of the international trade network.
Fronczak, Agata; Fronczak, Piotr
2012-05-01
Analyzing real data on international trade covering the time interval 1950-2000, we show that in each year over the analyzed period the network is a typical representative of the ensemble of maximally random weighted networks, whose directed connections (bilateral trade volumes) are only characterized by the product of the trading countries' GDPs. It means that time evolution of this network may be considered as a continuous sequence of equilibrium states, i.e., a quasistatic process. This, in turn, allows one to apply the linear response theory to make (and also verify) simple predictions about the network. In particular, we show that bilateral trade fulfills a fluctuation-response theorem, which states that the average relative change in imports (exports) between two countries is a sum of the relative changes in their GDPs. Yearly changes in trade volumes prove that the theorem is valid.
The Global Oscillation Network Group site survey. 1: Data collection and analysis methods
NASA Technical Reports Server (NTRS)
Hill, Frank; Fischer, George; Grier, Jennifer; Leibacher, John W.; Jones, Harrison B.; Jones, Patricia P.; Kupke, Renate; Stebbins, Robin T.
1994-01-01
The Global Oscillation Network Group (GONG) Project is planning to place a set of instruments around the world to observe solar oscillations as continuously as possible for at least three years. The Project has now chosen the sites that will comprise the network. This paper describes the methods of data collection and analysis that were used to make this decision. Solar irradiance data were collected with a one-minute cadence at fifteen sites around the world and analyzed to produce statistics of cloud cover, atmospheric extinction, and transparency power spectra at the individual sites. Nearly 200 reasonable six-site networks were assembled from the individual stations, and a set of statistical measures of the performance of the networks was analyzed using a principal component analysis. An accompanying paper presents the results of the survey.
Statistical mechanics of the international trade network
NASA Astrophysics Data System (ADS)
Fronczak, Agata; Fronczak, Piotr
2012-05-01
Analyzing real data on international trade covering the time interval 1950-2000, we show that in each year over the analyzed period the network is a typical representative of the ensemble of maximally random weighted networks, whose directed connections (bilateral trade volumes) are only characterized by the product of the trading countries' GDPs. It means that time evolution of this network may be considered as a continuous sequence of equilibrium states, i.e., a quasistatic process. This, in turn, allows one to apply the linear response theory to make (and also verify) simple predictions about the network. In particular, we show that bilateral trade fulfills a fluctuation-response theorem, which states that the average relative change in imports (exports) between two countries is a sum of the relative changes in their GDPs. Yearly changes in trade volumes prove that the theorem is valid.
National law enforcement telecommunications network
NASA Technical Reports Server (NTRS)
Reilly, N. B.; Garrison, G. W.; Sohn, R. L.; Gallop, D. L.; Goldstein, B. L.
1975-01-01
Alternative approaches are analyzed to a National Law Enforcement Telecommunications Network (NALECOM) designed to service all state-to-state and state-to-national criminal justice communications traffic needs in the United States. Network topology options were analyzed, and equipment and personnel requirements for each option were defined in accordance with NALECOM functional specifications and design guidelines. Evaluation criteria were developed and applied to each of the options leading to specific conclusions. Detailed treatments of methods for determining traffic requirements, communication line costs, switcher configurations and costs, microwave costs, satellite system configurations and costs, facilities, operations and engineering costs, network delay analysis and network availability analysis are presented. It is concluded that a single regional switcher configuration is the optimum choice based on cost and technical factors. A two-region configuration is competitive. Multiple-region configurations are less competitive due to increasing costs without attending benefits.
Integrating Entropy and Closed Frequent Pattern Mining for Social Network Modelling and Analysis
NASA Astrophysics Data System (ADS)
Adnan, Muhaimenul; Alhajj, Reda; Rokne, Jon
The recent increase in the explicitly available social networks has attracted the attention of the research community to investigate how it would be possible to benefit from such a powerful model in producing effective solutions for problems in other domains where the social network is implicit; we argue that social networks do exist around us but the key issue is how to realize and analyze them. This chapter presents a novel approach for constructing a social network model by an integrated framework that first preparing the data to be analyzed and then applies entropy and frequent closed patterns mining for network construction. For a given problem, we first prepare the data by identifying items and transactions, which arc the basic ingredients for frequent closed patterns mining. Items arc main objects in the problem and a transaction is a set of items that could exist together at one time (e.g., items purchased in one visit to the supermarket). Transactions could be analyzed to discover frequent closed patterns using any of the well-known techniques. Frequent closed patterns have the advantage that they successfully grab the inherent information content of the dataset and is applicable to a broader set of domains. Entropies of the frequent closed patterns arc used to keep the dimensionality of the feature vectors to a reasonable size; it is a kind of feature reduction process. Finally, we analyze the dynamic behavior of the constructed social network. Experiments were conducted on a synthetic dataset and on the Enron corpus email dataset. The results presented in the chapter show that social networks extracted from a feature set as frequent closed patterns successfully carry the community structure information. Moreover, for the Enron email dataset, we present an analysis to dynamically indicate the deviations from each user's individual and community profile. These indications of deviations can be very useful to identify unusual events.
Distributed Computing Environment for Mine Warfare Command
1993-06-01
based system to a decentralized network of personal computers over the past several years. This thesis analyzes the progress of the evolution as of May of...network of personal computers over the past several years. This thesis analyzes the progress of the evolution as of May of 1992. The building blocks of a...85 A. BACKGROUND ............. .................. 85 B. PAST ENVIRONMENT ........... ............... 86 C. PRESENT ENVIRONMENT
A Design Tool Utilizing Stoichiometric Structure for the Analysis of Biochemical Reaction Networks
1990-05-20
production of astaxanthin , a natural red pigment was analyzed. Penicillin production was examined for the effects of various carbon and reduction...reaction networks were examined. A proposed pathway for the biosynthetic production of astaxanthin , a natural red pigment was analyzed. The overall...Chapter 4. Case Study I: Astaxanthin Biosynthesis ................... 53 4.1. Carotenoid Uses ...................................................... 53
A study on efficient detection of network-based IP spoofing DDoS and malware-infected Systems.
Seo, Jung Woo; Lee, Sang Jin
2016-01-01
Large-scale network environments require effective detection and response methods against DDoS attacks. Depending on the advancement of IT infrastructure such as the server or network equipment, DDoS attack traffic arising from a few malware-infected systems capable of crippling the organization's internal network has become a significant threat. This study calculates the frequency of network-based packet attributes and analyzes the anomalies of the attributes in order to detect IP-spoofed DDoS attacks. Also, a method is proposed for the effective detection of malware infection systems triggering IP-spoofed DDoS attacks on an edge network. Detection accuracy and performance of the collected real-time traffic on a core network is analyzed thru the use of the proposed algorithm, and a prototype was developed to evaluate the performance of the algorithm. As a result, DDoS attacks on the internal network were detected in real-time and whether or not IP addresses were spoofed was confirmed. Detecting hosts infected by malware in real-time allowed the execution of intrusion responses before stoppage of the internal network caused by large-scale attack traffic.
Mapping the online communication patterns of political conversations
NASA Astrophysics Data System (ADS)
Borondo, J.; Morales, A. J.; Benito, R. M.; Losada, J. C.
2014-11-01
The structure of the social networks in which individuals are embedded influences their political choices and therefore their voting behavior. Nowadays, social media represent a new channel for individuals to communicate, what together with the availability of the data, makes it possible to analyze the online social network resulting from political conversations. Here, by taking advantage of the recently developed techniques to analyze complex systems, we map the communication patterns resulting from Spanish political conversations. We identify the different existing communities, building networks of communities, and finding that users cluster themselves in politically homogeneous networks. We found that while most of the collective attention was monopolized by politicians, traditional media accounts were still the preferred sources from which to propagate information. Finally, we propose methods to analyze the use of different languages, finding a clear trend from sympathizers of several political parties to overuse or infra-use each language. We conclude that, on the light of a social media analysis perspective, the political conversation is constrained by both ideology and language.
On the Performance of TCP Spoofing in Satellite Networks
NASA Technical Reports Server (NTRS)
Ishac, Joseph; Allman, Mark
2001-01-01
In this paper, we analyze the performance of Transmission Control Protocol (TCP) in a network that consists of both satellite and terrestrial components. One method, proposed by outside research, to improve the performance of data transfers over satellites is to use a performance enhancing proxy often dubbed 'spoofing.' Spoofing involves the transparent splitting of a TCP connection between the source and destination by some entity within the network path. In order to analyze the impact of spoofing, we constructed a simulation suite based around the network simulator ns-2. The simulation reflects a host with a satellite connection to the Internet and allows the option to spoof connections just prior to the satellite. The methodology used in our simulation allows us to analyze spoofing over a large range of file sizes and under various congested conditions, while prior work on this topic has primarily focused on bulk transfers with no congestion. As a result of these simulations, we find that the performance of spoofing is dependent upon a number of conditions.
Opinion dynamics in a group-based society
NASA Astrophysics Data System (ADS)
Gargiulo, F.; Huet, S.
2010-09-01
Many models have been proposed to analyze the evolution of opinion structure due to the interaction of individuals in their social environment. Such models analyze the spreading of ideas both in completely interacting backgrounds and on social networks, where each person has a finite set of interlocutors. In this paper we analyze the reciprocal feedback between the opinions of the individuals and the structure of the interpersonal relationships at the level of community structures. For this purpose we define a group-based random network and we study how this structure co-evolves with opinion dynamics processes. We observe that the adaptive network structure affects the opinion dynamics process helping the consensus formation. The results also show interesting behaviors in regards to the size distribution of the groups and their correlation with opinion structure.
Organising a University Computer System: Analytical Notes.
ERIC Educational Resources Information Center
Jacquot, J. P.; Finance, J. P.
1990-01-01
Thirteen trends in university computer system development are identified, system user requirements are analyzed, critical system qualities are outlined, and three options for organizing a computer system are presented. The three systems include a centralized network, local network, and federation of local networks. (MSE)
Traffic Profiling in Wireless Sensor Networks
2006-12-01
components, that can be used for traffic profiling and monitoring of a wireless sensor network . The work demostrates how the IDS should capture and...observed and analyzed. Finally, initial indications from basic analysis of wireless sensor network traffic demonstrated a high degree of self-similarity.
Neural networks and MIMD-multiprocessors
NASA Technical Reports Server (NTRS)
Vanhala, Jukka; Kaski, Kimmo
1990-01-01
Two artificial neural network models are compared. They are the Hopfield Neural Network Model and the Sparse Distributed Memory model. Distributed algorithms for both of them are designed and implemented. The run time characteristics of the algorithms are analyzed theoretically and tested in practice. The storage capacities of the networks are compared. Implementations are done using a distributed multiprocessor system.
Interactome Networks and Human Disease
Vidal, Marc; Cusick, Michael E.; Barabási, Albert-László
2011-01-01
Complex biological systems and cellular networks may underlie most genotype to phenotype relationships. Here we review basic concepts in network biology, discussing different types of interactome networks and the insights that can come from analyzing them. We elaborate on why interactome networks are important to consider in biology, how they can be mapped and integrated with each other, what global properties are starting to emerge from interactome network models, and how these properties may relate to human disease. PMID:21414488
Characterization of Adaptation by Morphology in a Planar Biological Network of Plasmodial Slime Mold
NASA Astrophysics Data System (ADS)
Ito, Masateru; Okamoto, Riki; Takamatsu, Atsuko
2011-07-01
Growth processes of a planar biological network of plasmodium of a true slime mold, Physarum polycephalum, were analyzed quantitatively. The plasmodium forms a transportation network through which protoplasm conveys nutrients, oxygen, and cellular organelles similarly to blood in a mammalian vascular network. To analyze the network structure, vertices were defined at tube bifurcation points. Then edges were defined for the tubes connecting both end vertices. Morphological analysis was attempted along with conventional topological analysis, revealing that the growth process of the plasmodial network structure depends on environmental conditions. In an attractive condition, the network is a polygonal lattice with more than six edges per vertex at the early stage and the hexagonal lattice at a later stage. Through all growing stages, the tube structure was not highly developed but an unstructured protoplasmic thin sheet was dominantly formed. The network size is small. In contrast, in the repulsive condition, the network is a mixture of polygonal lattice and tree-graph. More specifically, the polygonal lattice has more than six edges per vertex in the early stage, then a tree-graph structure is added to the lattice network at a later stage. The thick tube structure was highly developed. The network size, in the meaning of Euclidean distance but not topological one, grows considerably. Finally, the biological meaning of the environment-dependent network structure in the plasmodium is discussed.
Analyzing Enterprise Networks Needs: Action Research from the Mechatronics Sector
NASA Astrophysics Data System (ADS)
Cagnazzo, Luca; Taticchi, Paolo; Bidini, Gianni; Baglieri, Enzo
New business models and theories are developing nowadays towards collaborative environments direction, and many new tools in sustaining companies involved in these organizations are emerging. Among them, a plethora of methodologies to analyze their needs are already developed for single companies. Few academic works are available about Enterprise Networks (ENs) need analysis. This paper presents the learning from an action research (AR) in the mechatronics sector: AR has been used in order to experience the issue of evaluating network needs and therefore define, develop, and test a complete framework for network evaluation. Reflection on the story in the light of the experience and the theory is presented, as well as extrapolation to a broader context and articulation of usable knowledge.
NASA Astrophysics Data System (ADS)
Borondo, J.; Morales, A. J.; Losada, J. C.; Benito, R. M.
2012-06-01
Transmitting messages in the most efficient way as possible has always been one of politicians' main concerns during electoral processes. Due to the rapidly growing number of users, online social networks have become ideal platforms for politicians to interact with their potential voters. Exploiting the available potential of these tools to maximize their influence over voters is one of politicians' actual challenges. To step in this direction, we have analyzed the user activity in the online social network Twitter, during the 2011 Spanish Presidential electoral process, and found that such activity is correlated with the election results. We introduce a new measure to study political sentiment in Twitter, which we call the relative support. We have also characterized user behavior by analyzing the structural and dynamical patterns of the complex networks emergent from the mention and retweet networks. Our results suggest that the collective attention is driven by a very small fraction of users. Furthermore, we have analyzed the interactions taking place among politicians, observing a lack of debate. Finally, we develop a network growth model to reproduce the interactions taking place among politicians.
Borondo, J; Morales, A J; Losada, J C; Benito, R M
2012-06-01
Transmitting messages in the most efficient way as possible has always been one of politicians' main concerns during electoral processes. Due to the rapidly growing number of users, online social networks have become ideal platforms for politicians to interact with their potential voters. Exploiting the available potential of these tools to maximize their influence over voters is one of politicians' actual challenges. To step in this direction, we have analyzed the user activity in the online social network Twitter, during the 2011 Spanish Presidential electoral process, and found that such activity is correlated with the election results. We introduce a new measure to study political sentiment in Twitter, which we call the relative support. We have also characterized user behavior by analyzing the structural and dynamical patterns of the complex networks emergent from the mention and retweet networks. Our results suggest that the collective attention is driven by a very small fraction of users. Furthermore, we have analyzed the interactions taking place among politicians, observing a lack of debate. Finally, we develop a network growth model to reproduce the interactions taking place among politicians.
Robustness of airline route networks
NASA Astrophysics Data System (ADS)
Lordan, Oriol; Sallan, Jose M.; Escorihuela, Nuria; Gonzalez-Prieto, David
2016-03-01
Airlines shape their route network by defining their routes through supply and demand considerations, paying little attention to network performance indicators, such as network robustness. However, the collapse of an airline network can produce high financial costs for the airline and all its geographical area of influence. The aim of this study is to analyze the topology and robustness of the network route of airlines following Low Cost Carriers (LCCs) and Full Service Carriers (FSCs) business models. Results show that FSC hubs are more central than LCC bases in their route network. As a result, LCC route networks are more robust than FSC networks.
Network traffic behaviour near phase transition point
NASA Astrophysics Data System (ADS)
Lawniczak, A. T.; Tang, X.
2006-03-01
We explore packet traffic dynamics in a data network model near phase transition point from free flow to congestion. The model of data network is an abstraction of the Network Layer of the OSI (Open Systems Interconnect) Reference Model of packet switching networks. The Network Layer is responsible for routing packets across the network from their sources to their destinations and for control of congestion in data networks. Using the model we investigate spatio-temporal packets traffic dynamics near the phase transition point for various network connection topologies, and static and adaptive routing algorithms. We present selected simulation results and analyze them.
Assessing the Robustness of Graph Statistics for Network Analysis Under Incomplete Information
strategy for dismantling these networks based on their network structure. However, these strategies typically assume complete information about the...combat them with missing information . This thesis analyzes the performance of a variety of network statistics in the context of incomplete information by...leveraging simulation to remove nodes and edges from networks and evaluating the effect this missing information has on our ability to accurately
Developing an Effective Plan for Smart Sanctions: A Network Analysis Approach
2012-10-31
data and a network model that realistically simulates the Iranian nuclear development program. We then utilize several network analysis techniques...the Iran Watch (iranwatch.org) watchdog website. Using this data, which at first glance seems obtuse and unwieldy, we constructed network models in... model is created, nodes were evaluated using several measures of centrality. The team then analyzed this network utilizing four of the most common
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.
Xia, Kai; Dong, Dong; Han, Jing-Dong J
2006-01-01
Background Although protein-protein interaction (PPI) networks have been explored by various experimental methods, the maps so built are still limited in coverage and accuracy. To further expand the PPI network and to extract more accurate information from existing maps, studies have been carried out to integrate various types of functional relationship data. A frequently updated database of computationally analyzed potential PPIs to provide biological researchers with rapid and easy access to analyze original data as a biological network is still lacking. Results By applying a probabilistic model, we integrated 27 heterogeneous genomic, proteomic and functional annotation datasets to predict PPI networks in human. In addition to previously studied data types, we show that phenotypic distances and genetic interactions can also be integrated to predict PPIs. We further built an easy-to-use, updatable integrated PPI database, the Integrated Network Database (IntNetDB) online, to provide automatic prediction and visualization of PPI network among genes of interest. The networks can be visualized in SVG (Scalable Vector Graphics) format for zooming in or out. IntNetDB also provides a tool to extract topologically highly connected network neighborhoods from a specific network for further exploration and research. Using the MCODE (Molecular Complex Detections) algorithm, 190 such neighborhoods were detected among all the predicted interactions. The predicted PPIs can also be mapped to worm, fly and mouse interologs. Conclusion IntNetDB includes 180,010 predicted protein-protein interactions among 9,901 human proteins and represents a useful resource for the research community. Our study has increased prediction coverage by five-fold. IntNetDB also provides easy-to-use network visualization and analysis tools that allow biological researchers unfamiliar with computational biology to access and analyze data over the internet. The web interface of IntNetDB is freely accessible at . Visualization requires Mozilla version 1.8 (or higher) or Internet Explorer with installation of SVGviewer. PMID:17112386
Water Network Tool for Resilience (WNTR) User Manual
The Water Network Tool for Resilience (WNTR) is a new Python package designed to simulate and analyze resilience of water distribution networks to a variety of disaster scenarios. WNTR can help water utilities to explore the capacity of their systems to handle disasters and gui...
Astakhov, Vadim
2009-01-01
Interest in simulation of large-scale metabolic networks, species development, and genesis of various diseases requires new simulation techniques to accommodate the high complexity of realistic biological networks. Information geometry and topological formalisms are proposed to analyze information processes. We analyze the complexity of large-scale biological networks as well as transition of the system functionality due to modification in the system architecture, system environment, and system components. The dynamic core model is developed. The term dynamic core is used to define a set of causally related network functions. Delocalization of dynamic core model provides a mathematical formalism to analyze migration of specific functions in biosystems which undergo structure transition induced by the environment. The term delocalization is used to describe these processes of migration. We constructed a holographic model with self-poetic dynamic cores which preserves functional properties under those transitions. Topological constraints such as Ricci flow and Pfaff dimension were found for statistical manifolds which represent biological networks. These constraints can provide insight on processes of degeneration and recovery which take place in large-scale networks. We would like to suggest that therapies which are able to effectively implement estimated constraints, will successfully adjust biological systems and recover altered functionality. Also, we mathematically formulate the hypothesis that there is a direct consistency between biological and chemical evolution. Any set of causal relations within a biological network has its dual reimplementation in the chemistry of the system environment.
A Comprehensive Review on Adaptability of Network Forensics Frameworks for Mobile Cloud Computing
Abdul Wahab, Ainuddin Wahid; Han, Qi; Bin Abdul Rahman, Zulkanain
2014-01-01
Network forensics enables investigation and identification of network attacks through the retrieved digital content. The proliferation of smartphones and the cost-effective universal data access through cloud has made Mobile Cloud Computing (MCC) a congenital target for network attacks. However, confines in carrying out forensics in MCC is interrelated with the autonomous cloud hosting companies and their policies for restricted access to the digital content in the back-end cloud platforms. It implies that existing Network Forensic Frameworks (NFFs) have limited impact in the MCC paradigm. To this end, we qualitatively analyze the adaptability of existing NFFs when applied to the MCC. Explicitly, the fundamental mechanisms of NFFs are highlighted and then analyzed using the most relevant parameters. A classification is proposed to help understand the anatomy of existing NFFs. Subsequently, a comparison is given that explores the functional similarities and deviations among NFFs. The paper concludes by discussing research challenges for progressive network forensics in MCC. PMID:25097880
A comprehensive review on adaptability of network forensics frameworks for mobile cloud computing.
Khan, Suleman; Shiraz, Muhammad; Wahab, Ainuddin Wahid Abdul; Gani, Abdullah; Han, Qi; Rahman, Zulkanain Bin Abdul
2014-01-01
Network forensics enables investigation and identification of network attacks through the retrieved digital content. The proliferation of smartphones and the cost-effective universal data access through cloud has made Mobile Cloud Computing (MCC) a congenital target for network attacks. However, confines in carrying out forensics in MCC is interrelated with the autonomous cloud hosting companies and their policies for restricted access to the digital content in the back-end cloud platforms. It implies that existing Network Forensic Frameworks (NFFs) have limited impact in the MCC paradigm. To this end, we qualitatively analyze the adaptability of existing NFFs when applied to the MCC. Explicitly, the fundamental mechanisms of NFFs are highlighted and then analyzed using the most relevant parameters. A classification is proposed to help understand the anatomy of existing NFFs. Subsequently, a comparison is given that explores the functional similarities and deviations among NFFs. The paper concludes by discussing research challenges for progressive network forensics in MCC.
General method to find the attractors of discrete dynamic models of biological systems.
Gan, Xiao; Albert, Réka
2018-04-01
Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.
General method to find the attractors of discrete dynamic models of biological systems
NASA Astrophysics Data System (ADS)
Gan, Xiao; Albert, Réka
2018-04-01
Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.
Galleske, I; Castellanos, J
2002-05-01
This article proposes a procedure for the automatic determination of the elements of the covariance matrix of the gaussian kernel function of probabilistic neural networks. Two matrices, a rotation matrix and a matrix of variances, can be calculated by analyzing the local environment of each training pattern. The combination of them will form the covariance matrix of each training pattern. This automation has two advantages: First, it will free the neural network designer from indicating the complete covariance matrix, and second, it will result in a network with better generalization ability than the original model. A variation of the famous two-spiral problem and real-world examples from the UCI Machine Learning Repository will show a classification rate not only better than the original probabilistic neural network but also that this model can outperform other well-known classification techniques.
A Study of Quality of Service Communication for High-Speed Packet-Switching Computer Sub-Networks
NASA Technical Reports Server (NTRS)
Cui, Zhenqian
1999-01-01
In this thesis, we analyze various factors that affect quality of service (QoS) communication in high-speed, packet-switching sub-networks. We hypothesize that sub-network-wide bandwidth reservation and guaranteed CPU processing power at endpoint systems for handling data traffic are indispensable to achieving hard end-to-end quality of service. Different bandwidth reservation strategies, traffic characterization schemes, and scheduling algorithms affect the network resources and CPU usage as well as the extent that QoS can be achieved. In order to analyze those factors, we design and implement a communication layer. Our experimental analysis supports our research hypothesis. The Resource ReSerVation Protocol (RSVP) is designed to realize resource reservation. Our analysis of RSVP shows that using RSVP solely is insufficient to provide hard end-to-end quality of service in a high-speed sub-network. Analysis of the IEEE 802.lp protocol also supports the research hypothesis.
The Structural Underpinnings of Policy Learning: A Classroom Policy Simulation
NASA Astrophysics Data System (ADS)
Bird, Stephen
This paper investigates the relationship between the centrality of individual actors in a social network structure and their policy learning performance. In a dynamic comparable to real-world policy networks, results from a classroom simulation demonstrate a strong relationship between centrality in social learning networks and grade performance. Previous research indicates that social network centrality should have a positive effect on learning in other contexts and this link is tested in a policy learning context. Second, the distinction between collaborative learning versus information diffusion processes in policy learning is examined. Third, frequency of interaction is analyzed to determine whether consistent, frequent tics have a greater impact on the learning process. Finally, the data arc analyzed to determine if the benefits of centrality have limitations or thresholds when benefits no longer accrue. These results demonstrate the importance of network structure, and support a collaborative conceptualization of the policy learning process.
Rural women and violence situation: access and accessibility limits to the healthcare network.
Costa, Marta Cocco da; Silva, Ethel Bastos da; Soares, Joannie Dos Santos Fachinelli; Borth, Luana Cristina; Honnef, Fernanda
2017-07-13
To analyze the access and accessibility to the healthcare network of women dwelling in rural contexts undergoing violence situation, as seen from the professionals' speeches. A qualitative, exploratory, descriptive study with professionals from the healthcare network services about coping with violence in four municipalities in the northern region of Rio Grande do Sul. The information derived from interviews, which have been analyzed by thematic modality. (Lack of) information of women, distance, restricted access to transportation, dependence on the partner and (lack of) attention by professionals to welcome women undergoing violence situation and (non)-articulation of the network are factors that limit the access and, as a consequence, they result in the lack of confrontation of this problem. To bring closer the services which integrate the confrontation network of violence against women and to qualify professionals to welcome these situations are factors that can facilitate the access and adhesion of rural women to the services.
Flow networks for Ocean currents
NASA Astrophysics Data System (ADS)
Tupikina, Liubov; Molkenthin, Nora; Marwan, Norbert; Kurths, Jürgen
2014-05-01
Complex networks have been successfully applied to various systems such as society, technology, and recently climate. Links in a climate network are defined between two geographical locations if the correlation between the time series of some climate variable is higher than a threshold. Therefore, network links are considered to imply heat exchange. However, the relationship between the oceanic and atmospheric flows and the climate network's structure is still unclear. Recently, a theoretical approach verifying the correlation between ocean currents and surface air temperature networks has been introduced, where the Pearson correlation networks were constructed from advection-diffusion dynamics on an underlying flow. Since the continuous approach has its limitations, i.e., by its high computational complexity, we here introduce a new, discrete construction of flow-networks, which is then applied to static and dynamic velocity fields. Analyzing the flow-networks of prototypical flows we find that our approach can highlight the zones of high velocity by degree and transition zones by betweenness, while the combination of these network measures can uncover how the flow propagates within time. We also apply the method to time series data of the Equatorial Pacific Ocean Current and the Gulf Stream ocean current for the changing velocity fields, which could not been done before, and analyse the properties of the dynamical system. Flow-networks can be powerful tools to theoretically understand the step from system's dynamics to network's topology that can be analyzed using network measures and is used for shading light on different climatic phenomena.
Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks
Wen, Chih-Yu; Chen, Ying-Chih
2009-01-01
This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks. PMID:22412343
Dynamic hierarchical sleep scheduling for wireless ad-hoc sensor networks.
Wen, Chih-Yu; Chen, Ying-Chih
2009-01-01
This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks.
The Effect of Social Network Diagrams on a Virtual Network of Practice: A Korean Case
ERIC Educational Resources Information Center
Jo, Il-Hyun
2009-01-01
This study investigates the effect of the presentation of social network diagrams on virtual team members' interaction behavior via e-mail. E-mail transaction data from 22 software developers in a Korean IT company was analyzed and depicted as diagrams by social network analysis (SNA), and presented to the members as an intervention. Results…
ERIC Educational Resources Information Center
Cerf, M.; Bail, Le; Lusson, J. M.; Omon, B.
2017-01-01
Purpose: To highlight the way a public policy aiming to achieve a 50% decrease of pesticides use in France reframed advice provision in public and private networks. Design/methodology/approach: We developed a framework to analyze intermediation in a public funded network, a farmers' association, and a network of co-operatives. The framework…
Signaling in large-scale neural networks.
Berg, Rune W; Hounsgaard, Jørn
2009-02-01
We examine the recent finding that neurons in spinal motor circuits enter a high conductance state during functional network activity. The underlying concomitant increase in random inhibitory and excitatory synaptic activity leads to stochastic signal processing. The possible advantages of this metabolically costly organization are analyzed by comparing with synaptically less intense networks driven by the intrinsic response properties of the network neurons.
Hogg, Rachel A; Varda, Danielle
2016-11-01
Community networks that include nonprofit, public, and private organizations have formed around many health issues, such as chronic disease management and healthy living and eating. Despite the increases in the numbers of and funding for cross-sector networks, and the growing literature about them, there are limited data and methods that can be used to assess their effectiveness and analyze their designs. We addressed this gap in knowledge by analyzing the characteristics of 260 cross-sector community health networks that collectively consisted of 7,816 organizations during the period 2008-15. We found that nonprofit organizations were more prevalent than private firms or government agencies in these networks. Traditional types of partners in community health networks such as hospitals, community health centers, and public health agencies were the most trusted and valued by other members of their networks. However, nontraditional partners, such as employer or business groups and colleges or universities, reported contributing relatively high numbers of resources to their networks. Further evidence is needed to inform collaborative management processes and policies as a mechanism for building what the Robert Wood Johnson Foundation describes as a culture of health. Project HOPE—The People-to-People Health Foundation, Inc.
Weber, Jens; Schmidt, Johannes; Thomas, Arne; Böhlmann, Winfried
2010-10-05
The microporosity of two microporous polymer networks is investigated in detail. Both networks are based on a central spirobifluorene motif but have different linker groups, namely, imide and thiophene units. The microporosity of the networks is based on the "polymers of intrinsic microporosity (PIM)" design strategy. Nitrogen, argon, and carbon dioxide were used as sorbates in order to analyze the microporosity in greater detail. The gas sorption data was analyzed with respect to important parameters such as specific surface area, pore volume, and pore size (distribution). It is shown that the results can be strongly model dependent and swelling effects have to be regarded. (129)Xe NMR was used as an independent technique for the estimation of the average pore size of the polymer networks. The results indicate that both networks are mainly ultramicroporous (pore sizes < 0.8 nm) in the dry state, which was not expected based on the molecular design. Phase separation and network defects might influence the overall network morphology strongly. Finally, the observed swelling indicates that this "soft" microporous matter might have a different micropore size in the solvent swollen/filled state that in the dry state.
Xu, W; LeBeau, J M
2018-05-01
We establish a series of deep convolutional neural networks to automatically analyze position averaged convergent beam electron diffraction patterns. The networks first calibrate the zero-order disk size, center position, and rotation without the need for pretreating the data. With the aligned data, additional networks then measure the sample thickness and tilt. The performance of the network is explored as a function of a variety of variables including thickness, tilt, and dose. A methodology to explore the response of the neural network to various pattern features is also presented. Processing patterns at a rate of ∼ 0.1 s/pattern, the network is shown to be orders of magnitude faster than a brute force method while maintaining accuracy. The approach is thus suitable for automatically processing big, 4D STEM data. We also discuss the generality of the method to other materials/orientations as well as a hybrid approach that combines the features of the neural network with least squares fitting for even more robust analysis. The source code is available at https://github.com/subangstrom/DeepDiffraction. Copyright © 2018 Elsevier B.V. All rights reserved.
A network of automatic atmospherics analyzer
NASA Technical Reports Server (NTRS)
Schaefer, J.; Volland, H.; Ingmann, P.; Eriksson, A. J.; Heydt, G.
1980-01-01
The design and function of an atmospheric analyzer which uses a computer are discussed. Mathematical models which show the method of measurement are presented. The data analysis and recording procedures of the analyzer are discussed.
Application of machine learning methods for traffic signs recognition
NASA Astrophysics Data System (ADS)
Filatov, D. V.; Ignatev, K. V.; Deviatkin, A. V.; Serykh, E. V.
2018-02-01
This paper focuses on solving a relevant and pressing safety issue on intercity roads. Two approaches were considered for solving the problem of traffic signs recognition; the approaches involved neural networks to analyze images obtained from a camera in the real-time mode. The first approach is based on a sequential image processing. At the initial stage, with the help of color filters and morphological operations (dilatation and erosion), the area containing the traffic sign is located on the image, then the selected and scaled fragment of the image is analyzed using a feedforward neural network to determine the meaning of the found traffic sign. Learning of the neural network in this approach is carried out using a backpropagation method. The second approach involves convolution neural networks at both stages, i.e. when searching and selecting the area of the image containing the traffic sign, and when determining its meaning. Learning of the neural network in the second approach is carried out using the intersection over union function and a loss function. For neural networks to learn and the proposed algorithms to be tested, a series of videos from a dash cam were used that were shot under various weather and illumination conditions. As a result, the proposed approaches for traffic signs recognition were analyzed and compared by key indicators such as recognition rate percentage and the complexity of neural networks’ learning process.
The study and implementation of the wireless network data security model
NASA Astrophysics Data System (ADS)
Lin, Haifeng
2013-03-01
In recent years, the rapid development of Internet technology and the advent of information age, people are increasing the strong demand for the information products and the market for information technology. Particularly, the network security requirements have become more sophisticated. This paper analyzes the wireless network in the data security vulnerabilities. And a list of wireless networks in the framework is the serious defects with the related problems. It has proposed the virtual private network technology and wireless network security defense structure; and it also given the wireless networks and related network intrusion detection model for the detection strategies.
Coarse graining for synchronization in directed networks
NASA Astrophysics Data System (ADS)
Zeng, An; Lü, Linyuan
2011-05-01
Coarse-graining model is a promising way to analyze and visualize large-scale networks. The coarse-grained networks are required to preserve statistical properties as well as the dynamic behaviors of the initial networks. Some methods have been proposed and found effective in undirected networks, while the study on coarse-graining directed networks lacks of consideration. In this paper we proposed a path-based coarse-graining (PCG) method to coarse grain the directed networks. Performing the linear stability analysis of synchronization and numerical simulation of the Kuramoto model on four kinds of directed networks, including tree networks and variants of Barabási-Albert networks, Watts-Strogatz networks, and Erdös-Rényi networks, we find our method can effectively preserve the network synchronizability.
Rural health network development: public policy issues and state initiatives.
Casey, M M; Wellever, A; Moscovice, I
1997-02-01
Rural health networks are a potential way for rural health care systems to improve access to care, reduce costs, and enhance quality of care. Networks provide a means for rural providers to contract with managed care organizations, develop their own managed care entities, share resources, and structure practice opportunities to support recruitment and retention of rural physicians and other health care professionals. The results of early network development initiatives indicate a need for state officials and others interested in encouraging network development to agree on common rural health network definitions, to identify clearly the goals of network development programs, and to document and analyze program outcomes. Future network development efforts need to be much more comprehensive if they are to have a significant impact on rural health care. This article analyzes public policy issues related to integrated rural health network development, discusses current efforts to encourage network development in rural areas, and suggests actions that states may take if they desire to support rural health network development. These actions include adopting a formal rural health network definition, providing networks with alternatives to certain regulatory requirements, and providing incentives such as matching grants, loans, or technical assistance. Without public sector support for networks, managed care options may continue to be unavailable in many less densely populated rural areas of the country, and locally controlled rural health networks are unlikely to develop as an alternative to the dominant pattern of managed care expansion by large urban entities. Implementation of Medicare reform legislation could provide significant incentives for the development of rural health networks, depending on the reimbursement provisions, financial solvency standards, and antitrust exemptions for provider-sponsored networks in the final legislation and federal regulations.
The solvability of quantum k-pair network in a measurement-based way.
Li, Jing; Xu, Gang; Chen, Xiu-Bo; Qu, Zhiguo; Niu, Xin-Xin; Yang, Yi-Xian
2017-12-01
Network coding is an effective means to enhance the communication efficiency. The characterization of network solvability is one of the most important topic in this field. However, for general network, the solvability conditions are still a challenge. In this paper, we consider the solvability of general quantum k-pair network in measurement-based framework. For the first time, a detailed account of measurement-based quantum network coding(MB-QNC) is specified systematically. Differing from existing coding schemes, single qubit measurements on a pre-shared graph state are the only allowed coding operations. Since no control operations are concluded, it makes MB-QNC schemes more feasible. Further, the sufficient conditions formulating by eigenvalue equations and stabilizer matrix are presented, which build an unambiguous relation among the solvability and the general network. And this result can also analyze the feasibility of sharing k EPR pairs task in large-scale networks. Finally, in the presence of noise, we analyze the advantage of MB-QNC in contrast to gate-based way. By an instance network [Formula: see text], we show that MB-QNC allows higher error thresholds. Specially, for X error, the error threshold is about 30% higher than 10% in gate-based way. In addition, the specific expressions of fidelity subject to some constraint conditions are given.
Computer-aided linear-circuit design.
NASA Technical Reports Server (NTRS)
Penfield, P.
1971-01-01
Usually computer-aided design (CAD) refers to programs that analyze circuits conceived by the circuit designer. Among the services such programs should perform are direct network synthesis, analysis, optimization of network parameters, formatting, storage of miscellaneous data, and related calculations. The program should be embedded in a general-purpose conversational language such as BASIC, JOSS, or APL. Such a program is MARTHA, a general-purpose linear-circuit analyzer embedded in APL.
Cooperation stimulation strategies for peer-to-peer wireless live video-sharing social networks.
Lin, W Sabrina; Zhao, H Vicky; Liu, K J Ray
2010-07-01
Human behavior analysis in video sharing social networks is an emerging research area, which analyzes the behavior of users who share multimedia content and investigates the impact of human dynamics on video sharing systems. Users watching live streaming in the same wireless network share the same limited bandwidth of backbone connection to the Internet, thus, they might want to cooperate with each other to obtain better video quality. These users form a wireless live-streaming social network. Every user wishes to watch video with high quality while paying as little as possible cost to help others. This paper focuses on providing incentives for user cooperation. We propose a game-theoretic framework to model user behavior and to analyze the optimal strategies for user cooperation simulation in wireless live streaming. We first analyze the Pareto optimality and the time-sensitive bargaining equilibrium of the two-person game. We then extend the solution to the multiuser scenario. We also consider potential selfish users' cheating behavior and malicious users' attacking behavior and analyze the performance of the proposed strategies with the existence of cheating users and malicious attackers. Both our analytical and simulation results show that the proposed strategies can effectively stimulate user cooperation, achieve cheat free and attack resistance, and help provide reliable services for wireless live streaming applications.
NASA Astrophysics Data System (ADS)
Caglar, Mehmet Umut; Pal, Ranadip
2011-03-01
Central dogma of molecular biology states that ``information cannot be transferred back from protein to either protein or nucleic acid''. However, this assumption is not exactly correct in most of the cases. There are a lot of feedback loops and interactions between different levels of systems. These types of interactions are hard to analyze due to the lack of cell level data and probabilistic - nonlinear nature of interactions. Several models widely used to analyze and simulate these types of nonlinear interactions. Stochastic Master Equation (SME) models give probabilistic nature of the interactions in a detailed manner, with a high calculation cost. On the other hand Probabilistic Boolean Network (PBN) models give a coarse scale picture of the stochastic processes, with a less calculation cost. Differential Equation (DE) models give the time evolution of mean values of processes in a highly cost effective way. The understanding of the relations between the predictions of these models is important to understand the reliability of the simulations of genetic regulatory networks. In this work the success of the mapping between SME, PBN and DE models is analyzed and the accuracy and affectivity of the control policies generated by using PBN and DE models is compared.
Impact of heuristics in clustering large biological networks.
Shafin, Md Kishwar; Kabir, Kazi Lutful; Ridwan, Iffatur; Anannya, Tasmiah Tamzid; Karim, Rashid Saadman; Hoque, Mohammad Mozammel; Rahman, M Sohel
2015-12-01
Traditional clustering algorithms often exhibit poor performance for large networks. On the contrary, greedy algorithms are found to be relatively efficient while uncovering functional modules from large biological networks. The quality of the clusters produced by these greedy techniques largely depends on the underlying heuristics employed. Different heuristics based on different attributes and properties perform differently in terms of the quality of the clusters produced. This motivates us to design new heuristics for clustering large networks. In this paper, we have proposed two new heuristics and analyzed the performance thereof after incorporating those with three different combinations in a recently celebrated greedy clustering algorithm named SPICi. We have extensively analyzed the effectiveness of these new variants. The results are found to be promising. Copyright © 2015 Elsevier Ltd. All rights reserved.
Toward two-dimensional search engines
NASA Astrophysics Data System (ADS)
Ermann, L.; Chepelianskii, A. D.; Shepelyansky, D. L.
2012-07-01
We study the statistical properties of various directed networks using ranking of their nodes based on the dominant vectors of the Google matrix known as PageRank and CheiRank. On average PageRank orders nodes proportionally to a number of ingoing links, while CheiRank orders nodes proportionally to a number of outgoing links. In this way, the ranking of nodes becomes two dimensional which paves the way for the development of two-dimensional search engines of a new type. Statistical properties of information flow on the PageRank-CheiRank plane are analyzed for networks of British, French and Italian universities, Wikipedia, Linux Kernel, gene regulation and other networks. A special emphasis is done for British universities networks using the large database publicly available in the UK. Methods of spam links control are also analyzed.
A Graph Oriented Approach for Network Forensic Analysis
ERIC Educational Resources Information Center
Wang, Wei
2010-01-01
Network forensic analysis is a process that analyzes intrusion evidence captured from networked environment to identify suspicious entities and stepwise actions in an attack scenario. Unfortunately, the overwhelming amount and low quality of output from security sensors make it difficult for analysts to obtain a succinct high-level view of complex…
Social Networks, Communication Styles, and Learning Performance in a CSCL Community
ERIC Educational Resources Information Center
Cho, Hichang; Gay, Geri; Davidson, Barry; Ingraffea, Anthony
2007-01-01
The aim of this study is to empirically investigate the relationships between communication styles, social networks, and learning performance in a computer-supported collaborative learning (CSCL) community. Using social network analysis (SNA) and longitudinal survey data, we analyzed how 31 distributed learners developed collaborative learning…
Analyzing Online Teacher Networks: Cyber Networks Require Cyber Research Tools
ERIC Educational Resources Information Center
Schlager, Mark S.; Farooq, Umer; Fusco, Judith; Schank, Patricia; Dwyer, Nathan
2009-01-01
The authors argue that conceptual and methodological limitations in existing research approaches severely hamper theory building and empirical exploration of teacher learning and collaboration through cyber-enabled networks. They conclude that new frameworks, tools, and techniques are needed to understand and maximize the benefits of teacher…
The Talloires Network: A Global Coalition of Engaged Universities
ERIC Educational Resources Information Center
Hollister, Robert M.; Pollock, John P.; Gearan, Mark; Reid, Janice; Stroud, Susan; Babcock, Elizabeth
2012-01-01
This article describes and analyzes the origins, work to date, and future of the Talloires Network, an international association of institutions committed to strengthening the civic roles and social responsibilities of higher education. Included are reflections on the network's strategies for advancing civic engagement in higher education…
The architecture of dynamic reservoir in the echo state network
NASA Astrophysics Data System (ADS)
Cui, Hongyan; Liu, Xiang; Li, Lixiang
2012-09-01
Echo state network (ESN) has recently attracted increasing interests because of its superior capability in modeling nonlinear dynamic systems. In the conventional echo state network model, its dynamic reservoir (DR) has a random and sparse topology, which is far from the real biological neural networks from both structural and functional perspectives. We hereby propose three novel types of echo state networks with new dynamic reservoir topologies based on complex network theory, i.e., with a small-world topology, a scale-free topology, and a mixture of small-world and scale-free topologies, respectively. We then analyze the relationship between the dynamic reservoir structure and its prediction capability. We utilize two commonly used time series to evaluate the prediction performance of the three proposed echo state networks and compare them to the conventional model. We also use independent and identically distributed time series to analyze the short-term memory and prediction precision of these echo state networks. Furthermore, we study the ratio of scale-free topology and the small-world topology in the mixed-topology network, and examine its influence on the performance of the echo state networks. Our simulation results show that the proposed echo state network models have better prediction capabilities, a wider spectral radius, but retain almost the same short-term memory capacity as compared to the conventional echo state network model. We also find that the smaller the ratio of the scale-free topology over the small-world topology, the better the memory capacities.
Spreading in online social networks: the role of social reinforcement.
Zheng, Muhua; Lü, Linyuan; Zhao, Ming
2013-07-01
Some epidemic spreading models are usually applied to analyze the propagation of opinions or news. However, the dynamics of epidemic spreading and information or behavior spreading are essentially different in many aspects. Centola's experiments [Science 329, 1194 (2010)] on behavior spreading in online social networks showed that the spreading is faster and broader in regular networks than in random networks. This result contradicts with the former understanding that random networks are preferable for spreading than regular networks. To describe the spreading in online social networks, a unknown-known-approved-exhausted four-status model was proposed, which emphasizes the effect of social reinforcement and assumes that the redundant signals can improve the probability of approval (i.e., the spreading rate). Performing the model on regular and random networks, it is found that our model can well explain the results of Centola's experiments on behavior spreading and some former studies on information spreading in different parameter space. The effects of average degree and network size on behavior spreading process are further analyzed. The results again show the importance of social reinforcement and are accordant with Centola's anticipation that increasing the network size or decreasing the average degree will enlarge the difference of the density of final approved nodes between regular and random networks. Our work complements the former studies on spreading dynamics, especially the spreading in online social networks where the information usually requires individuals' confirmations before being transmitted to others.
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.
Analysis of Computer Network Information Based on "Big Data"
NASA Astrophysics Data System (ADS)
Li, Tianli
2017-11-01
With the development of the current era, computer network and large data gradually become part of the people's life, people use the computer to provide convenience for their own life, but at the same time there are many network information problems has to pay attention. This paper analyzes the information security of computer network based on "big data" analysis, and puts forward some solutions.
Modeling online social signed networks
NASA Astrophysics Data System (ADS)
Li, Le; Gu, Ke; Zeng, An; Fan, Ying; Di, Zengru
2018-04-01
People's online rating behavior can be modeled by user-object bipartite networks directly. However, few works have been devoted to reveal the hidden relations between users, especially from the perspective of signed networks. We analyze the signed monopartite networks projected by the signed user-object bipartite networks, finding that the networks are highly clustered with obvious community structure. Interestingly, the positive clustering coefficient is remarkably higher than the negative clustering coefficient. Then, a Signed Growing Network model (SGN) based on local preferential attachment is proposed to generate a user's signed network that has community structure and high positive clustering coefficient. Other structural properties of the modeled networks are also found to be similar to the empirical networks.
Li, Wei; Liu, Jian Guo; Zhu, Ning Hua
2015-04-15
We report a novel optical vector network analyzer (OVNA) with improved accuracy based on polarization modulation and stimulated Brillouin scattering (SBS) assisted polarization pulling. The beating between adjacent higher-order optical sidebands which are generated because of the nonlinearity of an electro-optic modulator (EOM) introduces considerable error to the OVNA. In our scheme, the measurement error is significantly reduced by removing the even-order optical sidebands using polarization discrimination. The proposed approach is theoretically analyzed and experimentally verified. The experimental results show that the accuracy of the OVNA is greatly improved compared to a conventional OVNA.
Social-ecological network analysis of scale mismatches in estuary watershed restoration.
Sayles, Jesse S; Baggio, Jacopo A
2017-03-07
Resource management boundaries seldom align with environmental systems, which can lead to social and ecological problems. Mapping and analyzing how resource management organizations in different areas collaborate can provide vital information to help overcome such misalignment. Few quantitative approaches exist, however, to analyze social collaborations alongside environmental patterns, especially among local and regional organizations (i.e., in multilevel governance settings). This paper develops and applies such an approach using social-ecological network analysis (SENA), which considers relationships among and between social and ecological units. The framework and methods are shown using an estuary restoration case from Puget Sound, United States. Collaboration patterns and quality are analyzed among local and regional organizations working in hydrologically connected areas. These patterns are correlated with restoration practitioners' assessments of the productivity of their collaborations to inform network theories for natural resource governance. The SENA is also combined with existing ecological data to jointly consider social and ecological restoration concerns. Results show potentially problematic areas in nearshore environments, where collaboration networks measured by density (percentage of possible network connections) and productivity are weakest. Many areas also have high centralization (a few nodes hold the network together), making network cohesion dependent on key organizations. Although centralization and productivity are inversely related, no clear relationship between density and productivity is observed. This research can help practitioners to identify where governance capacity needs strengthening and jointly consider social and ecological concerns. It advances SENA by developing a multilevel approach to assess social-ecological (or social-environmental) misalignments, also known as scale mismatches.
Loads Bias Genetic and Signaling Switches in Synthetic and Natural Systems
Medford, June; Prasad, Ashok
2014-01-01
Biological protein interactions networks such as signal transduction or gene transcription networks are often treated as modular, allowing motifs to be analyzed in isolation from the rest of the network. Modularity is also a key assumption in synthetic biology, where it is similarly expected that when network motifs are combined together, they do not lose their essential characteristics. However, the interactions that a network module has with downstream elements change the dynamical equations describing the upstream module and thus may change the dynamic and static properties of the upstream circuit even without explicit feedback. In this work we analyze the behavior of a ubiquitous motif in gene transcription and signal transduction circuits: the switch. We show that adding an additional downstream component to the simple genetic toggle switch changes its dynamical properties by changing the underlying potential energy landscape, and skewing it in favor of the unloaded side, and in some situations adding loads to the genetic switch can also abrogate bistable behavior. We find that an additional positive feedback motif found in naturally occurring toggle switches could tune the potential energy landscape in a desirable manner. We also analyze autocatalytic signal transduction switches and show that a ubiquitous positive feedback switch can lose its switch-like properties when connected to a downstream load. Our analysis underscores the necessity of incorporating the effects of downstream components when understanding the physics of biochemical network motifs, and raises the question as to how these effects are managed in real biological systems. This analysis is particularly important when scaling synthetic networks to more complex organisms. PMID:24676102
Effective Utilization of Commercial Wireless Networking Technology in Planetary Environments
NASA Technical Reports Server (NTRS)
Caulev, Michael (Technical Monitor); Phillip, DeLeon; Horan, Stephen; Borah, Deva; Lyman, Ray
2005-01-01
The purpose of this research is to investigate the use of commercial, off-the-shelf wireless networking technology in planetary exploration applications involving rovers and sensor webs. The three objectives of this research project are to: 1) simulate the radio frequency environment of proposed landing sites on Mars using actual topographic data, 2) analyze the performance of current wireless networking standards in the simulated radio frequency environment, and 3) propose modifications to the standards for more efficient utilization. In this annual report, we present our results for the second year of research. During this year, the effort has focussed on the second objective of analyzing the performance of the IEEE 802.11a and IEEE 802.1lb wireless networking standards in the simulated radio frequency environment of Mars. The approach builds upon our previous results which deterministically modelled the RF environment at selected sites on Mars using high-resolution topographical data. These results provide critical information regarding antenna coverage patterns, maximum link distances, effects of surface clutter, and multipath effects. Using these previous results, the physical layer of these wireless networking standards has now been simulated and analyzed in the Martian environment. We are looking to extending these results to the and medium access layer next. Our results give us critical information regarding the performance (data rates, packet error rates, link distances, etc.) of IEEE 802.1 la/b wireless networks. This information enables a critical examination of how these wireless networks may be utilized in future Mars missions and how they may be possibly modified for more optimal usage.
Social–ecological network analysis of scale mismatches in estuary watershed restoration
Sayles, Jesse S.
2017-01-01
Resource management boundaries seldom align with environmental systems, which can lead to social and ecological problems. Mapping and analyzing how resource management organizations in different areas collaborate can provide vital information to help overcome such misalignment. Few quantitative approaches exist, however, to analyze social collaborations alongside environmental patterns, especially among local and regional organizations (i.e., in multilevel governance settings). This paper develops and applies such an approach using social–ecological network analysis (SENA), which considers relationships among and between social and ecological units. The framework and methods are shown using an estuary restoration case from Puget Sound, United States. Collaboration patterns and quality are analyzed among local and regional organizations working in hydrologically connected areas. These patterns are correlated with restoration practitioners’ assessments of the productivity of their collaborations to inform network theories for natural resource governance. The SENA is also combined with existing ecological data to jointly consider social and ecological restoration concerns. Results show potentially problematic areas in nearshore environments, where collaboration networks measured by density (percentage of possible network connections) and productivity are weakest. Many areas also have high centralization (a few nodes hold the network together), making network cohesion dependent on key organizations. Although centralization and productivity are inversely related, no clear relationship between density and productivity is observed. This research can help practitioners to identify where governance capacity needs strengthening and jointly consider social and ecological concerns. It advances SENA by developing a multilevel approach to assess social–ecological (or social–environmental) misalignments, also known as scale mismatches. PMID:28223529
Ultrafast and Wide Range Analysis of DNA Molecules Using Rigid Network Structure of Solid Nanowires
Rahong, Sakon; Yasui, Takao; Yanagida, Takeshi; Nagashima, Kazuki; Kanai, Masaki; Klamchuen, Annop; Meng, Gang; He, Yong; Zhuge, Fuwei; Kaji, Noritada; Kawai, Tomoji; Baba, Yoshinobu
2014-01-01
Analyzing sizes of DNA via electrophoresis using a gel has played an important role in the recent, rapid progress of biology and biotechnology. Although analyzing DNA over a wide range of sizes in a short time is desired, no existing electrophoresis methods have been able to fully satisfy these two requirements. Here we propose a novel method using a rigid 3D network structure composed of solid nanowires within a microchannel. This rigid network structure enables analysis of DNA under applied DC electric fields for a large DNA size range (100 bp–166 kbp) within 13 s, which are much wider and faster conditions than those of any existing methods. The network density is readily varied for the targeted DNA size range by tailoring the number of cycles of the nanowire growth only at the desired spatial position within the microchannel. The rigid dense 3D network structure with spatial density control plays an important role in determining the capability for analyzing DNA. Since the present method allows the spatial location and density of the nanostructure within the microchannels to be defined, this unique controllability offers a new strategy to develop an analytical method not only for DNA but also for other biological molecules. PMID:24918865
Ultrafast and Wide Range Analysis of DNA Molecules Using Rigid Network Structure of Solid Nanowires
NASA Astrophysics Data System (ADS)
Rahong, Sakon; Yasui, Takao; Yanagida, Takeshi; Nagashima, Kazuki; Kanai, Masaki; Klamchuen, Annop; Meng, Gang; He, Yong; Zhuge, Fuwei; Kaji, Noritada; Kawai, Tomoji; Baba, Yoshinobu
2014-06-01
Analyzing sizes of DNA via electrophoresis using a gel has played an important role in the recent, rapid progress of biology and biotechnology. Although analyzing DNA over a wide range of sizes in a short time is desired, no existing electrophoresis methods have been able to fully satisfy these two requirements. Here we propose a novel method using a rigid 3D network structure composed of solid nanowires within a microchannel. This rigid network structure enables analysis of DNA under applied DC electric fields for a large DNA size range (100 bp-166 kbp) within 13 s, which are much wider and faster conditions than those of any existing methods. The network density is readily varied for the targeted DNA size range by tailoring the number of cycles of the nanowire growth only at the desired spatial position within the microchannel. The rigid dense 3D network structure with spatial density control plays an important role in determining the capability for analyzing DNA. Since the present method allows the spatial location and density of the nanostructure within the microchannels to be defined, this unique controllability offers a new strategy to develop an analytical method not only for DNA but also for other biological molecules.
Shariff, Afreen I; Fang, Xiangming; Desai, Tejas
2013-07-01
Twitter is the fastest growing social media network. It offers participants the ability to network with other individuals. Medical societies are interested in helping individuals network to boost recruitment, encourage collaboration, and assist in job placement. We hypothesized that the American Society of Nephrology (ASN) successfully used Twitter to create a network between participants and itself to stay connected with its members. Tweets from 3 Twitter networking sessions during Kidney Week 2011 were analyzed for content. These messages were used to create a network between all participants of the networking sessions. The network was analyzed for strength and influence by calculating clustering coefficients (CC) and eigenvector centrality (EC) scores, respectively. Eight moderators and 9 trainees authored 376 Twitter messages. Most tweets by trainees (64%) and moderators (61%) discussed 1 of 3 themes: networking, education, or navigating Kidney Week 2011. A total of 25 online network connections were established during the 3 sessions; 20% were bidirectional. The CC for the network was 0.300. All moderators formed at least 1 connection, but 7 of the 9 trainees failed to make any connections. ASN made 5 unidirectional and 0 bidirectional connections with a low EC of 0.108. ASN was unable to form powerful connections with trainees through Twitter, but medical societies should not be discouraged by the results reported in this investigation. As societies become more familiar with Twitter and understand the mechanisms to develop connections, these societies will have a greater influence within increasingly stronger networks. Copyright © 2013 National Kidney Foundation, Inc. Published by Elsevier Inc. All rights reserved.
Top-down network analysis characterizes hidden termite-termite interactions.
Campbell, Colin; Russo, Laura; Marins, Alessandra; DeSouza, Og; Schönrogge, Karsten; Mortensen, David; Tooker, John; Albert, Réka; Shea, Katriona
2016-09-01
The analysis of ecological networks is generally bottom-up, where networks are established by observing interactions between individuals. Emergent network properties have been indicated to reflect the dominant mode of interactions in communities that might be mutualistic (e.g., pollination) or antagonistic (e.g., host-parasitoid communities). Many ecological communities, however, comprise species interactions that are difficult to observe directly. Here, we propose that a comparison of the emergent properties from detail-rich reference communities with known modes of interaction can inform our understanding of detail-sparse focal communities. With this top-down approach, we consider patterns of coexistence between termite species that live as guests in mounds built by other host termite species as a case in point. Termite societies are extremely sensitive to perturbations, which precludes determining the nature of their interactions through direct observations. We perform a literature review to construct two networks representing termite mound cohabitation in a Brazilian savanna and in the tropical forest of Cameroon. We contrast the properties of these cohabitation networks with a total of 197 geographically diverse mutualistic plant-pollinator and antagonistic host-parasitoid networks. We analyze network properties for the networks, perform a principal components analysis (PCA), and compute the Mahalanobis distance of the termite networks to the cloud of mutualistic and antagonistic networks to assess the extent to which the termite networks overlap with the properties of the reference networks. Both termite networks overlap more closely with the mutualistic plant-pollinator communities than the antagonistic host-parasitoid communities, although the Brazilian community overlap with mutualistic communities is stronger. The analysis raises the hypothesis that termite-termite cohabitation networks may be overall mutualistic. More broadly, this work provides support for the argument that cryptic communities may be analyzed via comparison to well-characterized communities.
Airport Surface Network Architecture Definition
NASA Technical Reports Server (NTRS)
Nguyen, Thanh C.; Eddy, Wesley M.; Bretmersky, Steven C.; Lawas-Grodek, Fran; Ellis, Brenda L.
2006-01-01
Currently, airport surface communications are fragmented across multiple types of systems. These communication systems for airport operations at most airports today are based dedicated and separate architectures that cannot support system-wide interoperability and information sharing. The requirements placed upon the Communications, Navigation, and Surveillance (CNS) systems in airports are rapidly growing and integration is urgently needed if the future vision of the National Airspace System (NAS) and the Next Generation Air Transportation System (NGATS) 2025 concept are to be realized. To address this and other problems such as airport surface congestion, the Space Based Technologies Project s Surface ICNS Network Architecture team at NASA Glenn Research Center has assessed airport surface communications requirements, analyzed existing and future surface applications, and defined a set of architecture functions that will help design a scalable, reliable and flexible surface network architecture to meet the current and future needs of airport operations. This paper describes the systems approach or methodology to networking that was employed to assess airport surface communications requirements, analyze applications, and to define the surface network architecture functions as the building blocks or components of the network. The systems approach used for defining these functions is relatively new to networking. It is viewing the surface network, along with its environment (everything that the surface network interacts with or impacts), as a system. Associated with this system are sets of services that are offered by the network to the rest of the system. Therefore, the surface network is considered as part of the larger system (such as the NAS), with interactions and dependencies between the surface network and its users, applications, and devices. The surface network architecture includes components such as addressing/routing, network management, network performance and security.
Analysis of HD 73045 light curve data
NASA Astrophysics Data System (ADS)
Das, Mrinal Kanti; Bhatraju, Naveen Kumar; Joshi, Santosh
2018-04-01
In this work we analyzed the Kepler light curve data of HD 73045. The raw data has been smoothened using standard filters. The power spectrum has been obtained by using a fast Fourier transform routine. It shows the presence of more than one period. In order to take care of any non-stationary behavior, we carried out a wavelet analysis to obtain the wavelet power spectrum. In addition, to identify the scale invariant structure, the data has been analyzed using a multifractal detrended fluctuation analysis. Further to characterize the diversity of embedded patterns in the HD 73045 flux time series, we computed various entropy-based complexity measures e.g. sample entropy, spectral entropy and permutation entropy. The presence of periodic structure in the time series was further analyzed using the visibility network and horizontal visibility network model of the time series. The degree distributions in the two network models confirm such structures.
Comparison analysis on vulnerability of metro networks based on complex network
NASA Astrophysics Data System (ADS)
Zhang, Jianhua; Wang, Shuliang; Wang, Xiaoyuan
2018-04-01
This paper analyzes the networked characteristics of three metro networks, and two malicious attacks are employed to investigate the vulnerability of metro networks based on connectivity vulnerability and functionality vulnerability. Meanwhile, the networked characteristics and vulnerability of three metro networks are compared with each other. The results show that Shanghai metro network has the largest transport capacity, Beijing metro network has the best local connectivity and Guangzhou metro network has the best global connectivity, moreover Beijing metro network has the best homogeneous degree distribution. Furthermore, we find that metro networks are very vulnerable subjected to malicious attacks, and Guangzhou metro network has the best topological structure and reliability among three metro networks. The results indicate that the proposed methodology is feasible and effective to investigate the vulnerability and to explore better topological structure of metro networks.
Application of Artificial Neural Network to Optical Fluid Analyzer
NASA Astrophysics Data System (ADS)
Kimura, Makoto; Nishida, Katsuhiko
1994-04-01
A three-layer artificial neural network has been applied to the presentation of optical fluid analyzer (OFA) raw data, and the accuracy of oil fraction determination has been significantly improved compared to previous approaches. To apply the artificial neural network approach to solving a problem, the first step is training to determine the appropriate weight set for calculating the target values. This involves using a series of data sets (each comprising a set of input values and an associated set of output values that the artificial neural network is required to determine) to tune artificial neural network weighting parameters so that the output of the neural network to the given set of input values is as close as possible to the required output. The physical model used to generate the series of learning data sets was the effective flow stream model, developed for OFA data presentation. The effectiveness of the training was verified by reprocessing the same input data as were used to determine the weighting parameters and then by comparing the results of the artificial neural network to the expected output values. The standard deviation of the expected and obtained values was approximately 10% (two sigma).
Campos, Andre N.; Souza, Efren L.; Nakamura, Fabiola G.; Nakamura, Eduardo F.; Rodrigues, Joel J. P. C.
2012-01-01
Target tracking is an important application of wireless sensor networks. The networks' ability to locate and track an object is directed linked to the nodes' ability to locate themselves. Consequently, localization systems are essential for target tracking applications. In addition, sensor networks are often deployed in remote or hostile environments. Therefore, density control algorithms are used to increase network lifetime while maintaining its sensing capabilities. In this work, we analyze the impact of localization algorithms (RPE and DPE) and density control algorithms (GAF, A3 and OGDC) on target tracking applications. We adapt the density control algorithms to address the k-coverage problem. In addition, we analyze the impact of network density, residual integration with density control, and k-coverage on both target tracking accuracy and network lifetime. Our results show that DPE is a better choice for target tracking applications than RPE. Moreover, among the evaluated density control algorithms, OGDC is the best option among the three. Although the choice of the density control algorithm has little impact on the tracking precision, OGDC outperforms GAF and A3 in terms of tracking time. PMID:22969329
BiNA: A Visual Analytics Tool for Biological Network Data
Gerasch, Andreas; Faber, Daniel; Küntzer, Jan; Niermann, Peter; Kohlbacher, Oliver; Lenhof, Hans-Peter; Kaufmann, Michael
2014-01-01
Interactive visual analysis of biological high-throughput data in the context of the underlying networks is an essential task in modern biomedicine with applications ranging from metabolic engineering to personalized medicine. The complexity and heterogeneity of data sets require flexible software architectures for data analysis. Concise and easily readable graphical representation of data and interactive navigation of large data sets are essential in this context. We present BiNA - the Biological Network Analyzer - a flexible open-source software for analyzing and visualizing biological networks. Highly configurable visualization styles for regulatory and metabolic network data offer sophisticated drawings and intuitive navigation and exploration techniques using hierarchical graph concepts. The generic projection and analysis framework provides powerful functionalities for visual analyses of high-throughput omics data in the context of networks, in particular for the differential analysis and the analysis of time series data. A direct interface to an underlying data warehouse provides fast access to a wide range of semantically integrated biological network databases. A plugin system allows simple customization and integration of new analysis algorithms or visual representations. BiNA is available under the 3-clause BSD license at http://bina.unipax.info/. PMID:24551056
Securing Information with Complex Optical Encryption Networks
2015-08-11
Network Security, Network Vulnerability , Multi-dimentional Processing, optoelectronic devices 16. SECURITY CLASSIFICATION OF: 17. LIMITATION... optoelectronic devices and systems should be analyzed before the retrieval, any hostile hacker will need to possess multi-disciplinary scientific...sophisticated optoelectronic principles and systems where he/she needs to process the information. However, in the military applications, most military
Optimization Techniques for Analysis of Biological and Social Networks
2012-03-28
analyzing a new metaheuristic technique, variable objective search. 3. Experimentation and application: Implement the proposed algorithms , test and fine...alternative mathematical programming formulations, their theoretical analysis, the development of exact algorithms , and heuristics. Originally, clusters...systematic fashion under a unifying theoretical and algorithmic framework. Optimization, Complex Networks, Social Network Analysis, Computational
Network analysis reveals multiscale controls on streamwater chemistry
Kevin J. McGuire; Christian E. Torgersen; Gene E. Likens; Donald C. Buso; Winsor H. Lowe; Scott W. Bailey
2014-01-01
By coupling synoptic data from a basin-wide assessment of streamwater chemistry with network-based geostatistical analysis, we show that spatial processes differentially affect biogeochemical condition and pattern across a headwater stream network. We analyzed a high-resolution dataset consisting of 664 water samples collected every 100 m throughout 32 tributaries in...
ERIC Educational Resources Information Center
Munoz, David Andres; Queupil, Juan Pablo; Fraser, Pablo
2016-01-01
Purpose: The purpose of this paper is to analyze collaboration networks and their patterns among higher education institutions (HEIs) in Chile and the Latin American region. This will provide evidence to educational managements in order to properly allocate their efforts to improve collaboration. Design/methodology/approach: This quantitative…
Algorithmic Coordination in Robotic Networks
2010-11-29
appropriate performance, robustness and scalability properties for various task allocation , surveillance, and information gathering applications is...networking, we envision designing and analyzing algorithms with appropriate performance, robustness and scalability properties for various task ...distributed algorithms for target assignments; based on the classic auction algorithms in static networks, we intend to design efficient algorithms in worst
A Survey of Neural Network Publications.
ERIC Educational Resources Information Center
Vijayaraman, Bindiganavale S.; Osyk, Barbara
This paper is a survey of publications on artificial neural networks published in business journals for the period ending July 1996. Its purpose is to identify and analyze trends in neural network research during that period. This paper shows which topics have been heavily researched, when these topics were researched, and how that research has…
Computer-Based Semantic Network in Molecular Biology: A Demonstration.
ERIC Educational Resources Information Center
Callman, Joshua L.; And Others
This paper analyzes the hardware and software features that would be desirable in a computer-based semantic network system for representing biology knowledge. It then describes in detail a prototype network of molecular biology knowledge that has been developed using Filevision software and a Macintosh computer. The prototype contains about 100…
TimeXNet Web: Identifying cellular response networks from diverse omics time-course data.
Tan, Phit Ling; López, Yosvany; Nakai, Kenta; Patil, Ashwini
2018-05-14
Condition-specific time-course omics profiles are frequently used to study cellular response to stimuli and identify associated signaling pathways. However, few online tools allow users to analyze multiple types of high-throughput time-course data. TimeXNet Web is a web server that extracts a time-dependent gene/protein response network from time-course transcriptomic, proteomic or phospho-proteomic data, and an input interaction network. It classifies the given genes/proteins into time-dependent groups based on the time of their highest activity and identifies the most probable paths connecting genes/proteins in consecutive groups. The response sub-network is enriched in activated genes/proteins and contains novel regulators that do not show any observable change in the input data. Users can view the resultant response network and analyze it for functional enrichment. TimeXNet Web supports the analysis of high-throughput data from multiple species by providing high quality, weighted protein-protein interaction networks for 12 model organisms. http://txnet.hgc.jp/. ashwini@hgc.jp. Supplementary data are available at Bioinformatics online.
NASA Astrophysics Data System (ADS)
Xu, Ronghua; Wong, Wing-Keung; Chen, Guanrong; Huang, Shuo
2017-02-01
In this paper, we analyze the relationship among stock networks by focusing on the statistically reliable connectivity between financial time series, which accurately reflects the underlying pure stock structure. To do so, we firstly filter out the effect of market index on the correlations between paired stocks, and then take a t-test based P-threshold approach to lessening the complexity of the stock network based on the P values. We demonstrate the superiority of its performance in understanding network complexity by examining the Hong Kong stock market. By comparing with other filtering methods, we find that the P-threshold approach extracts purely and significantly correlated stock pairs, which reflect the well-defined hierarchical structure of the market. In analyzing the dynamic stock networks with fixed-size moving windows, our results show that three global financial crises, covered by the long-range time series, can be distinguishingly indicated from the network topological and evolutionary perspectives. In addition, we find that the assortativity coefficient can manifest the financial crises and therefore can serve as a good indicator of the financial market development.
2010-06-01
Ron’s Code 4 . . . . . . . . . . . . . . . . . . . 18 2.3.3 Virtual Private Network and Secure Shell Tunnels 19 2.3.4 Darknets ...created using Iodine. 2.2 Analyzing and Classifying Network Traffic Before the advent of Darknets and anonymizers like Tor (see Section 2.3), ana... darknets , and the Tor network. 2.3.1 Byte Padding. Byte padding is the most primitive obfuscation method used to hide payloads in network traffic. When byte
Packets Distributing Evolutionary Algorithm Based on PSO for Ad Hoc Network
NASA Astrophysics Data System (ADS)
Xu, Xiao-Feng
2018-03-01
Wireless communication network has such features as limited bandwidth, changeful channel and dynamic topology, etc. Ad hoc network has lots of difficulties in accessing control, bandwidth distribution, resource assign and congestion control. Therefore, a wireless packets distributing Evolutionary algorithm based on PSO (DPSO)for Ad Hoc Network is proposed. Firstly, parameters impact on performance of network are analyzed and researched to obtain network performance effective function. Secondly, the improved PSO Evolutionary Algorithm is used to solve the optimization problem from local to global in the process of network packets distributing. The simulation results show that the algorithm can ensure fairness and timeliness of network transmission, as well as improve ad hoc network resource integrated utilization efficiency.
Improved community model for social networks based on social mobility
NASA Astrophysics Data System (ADS)
Lu, Zhe-Ming; Wu, Zhen; Luo, Hao; Wang, Hao-Xian
2015-07-01
This paper proposes an improved community model for social networks based on social mobility. The relationship between the group distribution and the community size is investigated in terms of communication rate and turnover rate. The degree distributions, clustering coefficients, average distances and diameters of networks are analyzed. Experimental results demonstrate that the proposed model possesses the small-world property and can reproduce social networks effectively and efficiently.
Functional Roles of Slow Enzyme Conformational Changes in Network Dynamics
Wu, Zhanghan; Xing, Jianhua
2012-01-01
Extensive studies from different fields reveal that many macromolecules, especially enzymes, show slow transitions among different conformations. This phenomenon is named such things as dynamic disorder, heterogeneity, hysteretic or mnemonic enzymes across these different fields, and has been directly demonstrated by single molecule enzymology and NMR studies recently. We analyzed enzyme slow conformational changes in the context of regulatory networks. A single enzymatic reaction with slow conformational changes can filter upstream network noises, and can either resonantly respond to the system stimulus at certain frequencies or respond adaptively for sustained input signals of the network fluctuations. It thus can serve as a basic functional motif with properties that are normally for larger intermolecular networks in the field of systems biology. We further analyzed examples including enzymes functioning against pH fluctuations, metabolic state change of Artemia embryos, and kinetic insulation of fluctuations in metabolic networks. The study also suggests that hysteretic enzymes may be building blocks of synthetic networks with various properties such as narrow-banded filtering. The work fills the missing gap between studies on enzyme biophysics and network level dynamics, and reveals that the coupling between the two is functionally important; it also suggests that the conformational dynamics of some enzymes may be evolutionally selected. PMID:23009855
Properties of a new small-world network with spatially biased random shortcuts
NASA Astrophysics Data System (ADS)
Matsuzawa, Ryo; Tanimoto, Jun; Fukuda, Eriko
2017-11-01
This paper introduces a small-world (SW) network with a power-law distance distribution that differs from conventional models in that it uses completely random shortcuts. By incorporating spatial constraints, we analyze the divergence of the proposed model from conventional models in terms of fundamental network properties such as clustering coefficient, average path length, and degree distribution. We find that when the spatial constraint more strongly prohibits a long shortcut, the clustering coefficient is improved and the average path length increases. We also analyze the spatial prisoner's dilemma (SPD) games played on our new SW network in order to understand its dynamical characteristics. Depending on the basis graph, i.e., whether it is a one-dimensional ring or a two-dimensional lattice, and the parameter controlling the prohibition of long-distance shortcuts, the emergent results can vastly differ.
Zare-Farashbandi, Firoozeh; Geraei, Ehsan; Siamaki, Saba
2014-01-01
Background: Co-authorship is one of the most tangible forms of research collaboration. A co-authorship network is a social network in which the authors through participation in one or more publication through an indirect path have linked to each other. The present research using the social network analysis studied co-authorship network of 681 articles published in Journal of Research in Medical Sciences (JRMS) during 2008-2012. Materials and Methods: The study was carried out with the scientometrics approach and using co-authorship network analysis of authors. The topology of the co-authorship network of 681 published articles in JRMS between 2008 and 2012 was analyzed using macro-level metrics indicators of network analysis such as density, clustering coefficient, components and mean distance. In addition, in order to evaluate the performance of each authors and countries in the network, the micro-level indicators such as degree centrality, closeness centrality and betweenness centrality as well as productivity index were used. The UCINET and NetDraw softwares were used to draw and analyze the co-authorship network of the papers. Results: The assessment of the authors productivity in this journal showed that the first ranks were belonged to only five authors, respectively. Furthermore, analysis of the co-authorship of the authors in the network demonstrated that in the betweenness centrality index, three authors of them had the good position in the network. They can be considered as the network leaders able to control the flow of information in the network compared with the other members based on the shortest paths. On the other hand, the key role of the network according to the productivity and centrality indexes was belonged to Iran, Malaysia and United States of America. Conclusion: Co-authorship network of JRMS has the characteristics of a small world network. In addition, the theory of 6° separation is valid in this network was also true. PMID:24672564
NASA Astrophysics Data System (ADS)
de Andrés, Javier; Landajo, Manuel; Lorca, Pedro; Labra, Jose; Ordóñez, Patricia
Artificial neural networks have proven to be useful tools for solving financial analysis problems such as financial distress prediction and audit risk assessment. In this paper we focus on the performance of robust (least absolute deviation-based) neural networks on measuring liquidity of firms. The problem of learning the bivariate relationship between the components (namely, current liabilities and current assets) of the so-called current ratio is analyzed, and the predictive performance of several modelling paradigms (namely, linear and log-linear regressions, classical ratios and neural networks) is compared. An empirical analysis is conducted on a representative data base from the Spanish economy. Results indicate that classical ratio models are largely inadequate as a realistic description of the studied relationship, especially when used for predictive purposes. In a number of cases, especially when the analyzed firms are microenterprises, the linear specification is improved by considering the flexible non-linear structures provided by neural networks.
The topology of large Open Connectome networks for the human brain.
Gastner, Michael T; Ódor, Géza
2016-06-07
The structural human connectome (i.e. the network of fiber connections in the brain) can be analyzed at ever finer spatial resolution thanks to advances in neuroimaging. Here we analyze several large data sets for the human brain network made available by the Open Connectome Project. We apply statistical model selection to characterize the degree distributions of graphs containing up to nodes and edges. A three-parameter generalized Weibull (also known as a stretched exponential) distribution is a good fit to most of the observed degree distributions. For almost all networks, simple power laws cannot fit the data, but in some cases there is statistical support for power laws with an exponential cutoff. We also calculate the topological (graph) dimension D and the small-world coefficient σ of these networks. While σ suggests a small-world topology, we found that D < 4 showing that long-distance connections provide only a small correction to the topology of the embedding three-dimensional space.
The topology of large Open Connectome networks for the human brain
NASA Astrophysics Data System (ADS)
Gastner, Michael T.; Ódor, Géza
2016-06-01
The structural human connectome (i.e. the network of fiber connections in the brain) can be analyzed at ever finer spatial resolution thanks to advances in neuroimaging. Here we analyze several large data sets for the human brain network made available by the Open Connectome Project. We apply statistical model selection to characterize the degree distributions of graphs containing up to nodes and edges. A three-parameter generalized Weibull (also known as a stretched exponential) distribution is a good fit to most of the observed degree distributions. For almost all networks, simple power laws cannot fit the data, but in some cases there is statistical support for power laws with an exponential cutoff. We also calculate the topological (graph) dimension D and the small-world coefficient σ of these networks. While σ suggests a small-world topology, we found that D < 4 showing that long-distance connections provide only a small correction to the topology of the embedding three-dimensional space.
System Analysis of LWDH Related Genes Based on Text Mining in Biological Networks
Miao, Yingbo; Zhang, Liangcai; Wang, Yang; Feng, Rennan; Yang, Lei; Zhang, Shihua; Jiang, Yongshuai; Liu, Guiyou
2014-01-01
Liuwei-dihuang (LWDH) is widely used in traditional Chinese medicine (TCM), but its molecular mechanism about gene interactions is unclear. LWDH genes were extracted from the existing literatures based on text mining technology. To simulate the complex molecular interactions that occur in the whole body, protein-protein interaction networks (PPINs) were constructed and the topological properties of LWDH genes were analyzed. LWDH genes have higher centrality properties and may play important roles in the complex biological network environment. It was also found that the distances within LWDH genes are smaller than expected, which means that the communication of LWDH genes during the biological process is rapid and effectual. At last, a comprehensive network of LWDH genes, including the related drugs and regulatory pathways at both the transcriptional and posttranscriptional levels, was constructed and analyzed. The biological network analysis strategy used in this study may be helpful for the understanding of molecular mechanism of TCM. PMID:25243143
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.
Graph Frequency Analysis of Brain Signals
Huang, Weiyu; Goldsberry, Leah; Wymbs, Nicholas F.; Grafton, Scott T.; Bassett, Danielle S.; Ribeiro, Alejandro
2016-01-01
This paper presents methods to analyze functional brain networks and signals from graph spectral perspectives. The notion of frequency and filters traditionally defined for signals supported on regular domains such as discrete time and image grids has been recently generalized to irregular graph domains, and defines brain graph frequencies associated with different levels of spatial smoothness across the brain regions. Brain network frequency also enables the decomposition of brain signals into pieces corresponding to smooth or rapid variations. We relate graph frequency with principal component analysis when the networks of interest denote functional connectivity. The methods are utilized to analyze brain networks and signals as subjects master a simple motor skill. We observe that brain signals corresponding to different graph frequencies exhibit different levels of adaptability throughout learning. Further, we notice a strong association between graph spectral properties of brain networks and the level of exposure to tasks performed, and recognize the most contributing and important frequency signatures at different levels of task familiarity. PMID:28439325
Fault tree analysis for data-loss in long-term monitoring networks.
Dirksen, J; ten Veldhuis, J A E; Schilperoort, R P S
2009-01-01
Prevention of data-loss is an important aspect in the design as well as the operational phase of monitoring networks since data-loss can seriously limit intended information yield. In the literature limited attention has been paid to the origin of unreliable or doubtful data from monitoring networks. Better understanding of causes of data-loss points out effective solutions to increase data yield. This paper introduces FTA as a diagnostic tool to systematically deduce causes of data-loss in long-term monitoring networks in urban drainage systems. In order to illustrate the effectiveness of FTA, a fault tree is developed for a monitoring network and FTA is applied to analyze the data yield of a UV/VIS submersible spectrophotometer. Although some of the causes of data-loss cannot be recovered because the historical database of metadata has been updated infrequently, the example points out that FTA still is a powerful tool to analyze the causes of data-loss and provides useful information on effective data-loss prevention.
Characterizing air quality data from complex network perspective.
Fan, Xinghua; Wang, Li; Xu, Huihui; Li, Shasha; Tian, Lixin
2016-02-01
Air quality depends mainly on changes in emission of pollutants and their precursors. Understanding its characteristics is the key to predicting and controlling air quality. In this study, complex networks were built to analyze topological characteristics of air quality data by correlation coefficient method. Firstly, PM2.5 (particulate matter with aerodynamic diameter less than 2.5 μm) indexes of eight monitoring sites in Beijing were selected as samples from January 2013 to December 2014. Secondly, the C-C method was applied to determine the structure of phase space. Points in the reconstructed phase space were considered to be nodes of the network mapped. Then, edges were determined by nodes having the correlation greater than a critical threshold. Three properties of the constructed networks, degree distribution, clustering coefficient, and modularity, were used to determine the optimal value of the critical threshold. Finally, by analyzing and comparing topological properties, we pointed out that similarities and difference in the constructed complex networks revealed influence factors and their different roles on real air quality system.
Application of Game Theory Approaches in Routing Protocols for Wireless Networks
NASA Astrophysics Data System (ADS)
Javidi, Mohammad M.; Aliahmadipour, Laya
2011-09-01
An important and essential issue for wireless networks is routing protocol design that is a major technical challenge due to the function of the network. Game theory is a powerful mathematical tool that analyzes the strategic interactions among multiple decision makers and the results of researches show that applied game theory in routing protocol lead to improvement the network performance through reduce overhead and motivates selfish nodes to collaborate in the network. This paper presents a review and comparison for typical representatives of routing protocols designed that applied game theory approaches for various wireless networks such as ad hoc networks, mobile ad hoc networks and sensor networks that all of them lead to improve the network performance.
Weighted Networks at the Polish Market
NASA Astrophysics Data System (ADS)
Chmiel, A. M.; Sienkiewicz, J.; Suchecki, K.; Hołyst, J. A.
During the last few years various models of networks [1,2] have become a powerful tool for analysis of complex systems in such distant fields as Internet [3], biology [4], social groups [5], ecology [6] and public transport [7]. Modeling behavior of economical agents is a challenging issue that has also been studied from a network point of view. The examples of such studies are models of financial networks [8], supply chains [9, 10], production networks [11], investment networks [12] or collective bank bankrupcies [13, 14]. Relations between different companies have been already analyzed using several methods: as networks of shareholders [15], networks of correlations between stock prices [16] or networks of board directors [17]. In several cases scaling laws for network characteristics have been observed.
Analysis of the enzyme network involved in cattle milk production using graph theory.
Ghorbani, Sholeh; Tahmoorespur, Mojtaba; Masoudi Nejad, Ali; Nasiri, Mohammad; Asgari, Yazdan
2015-06-01
Understanding cattle metabolism and its relationship with milk products is important in bovine breeding. A systemic view could lead to consequences that will result in a better understanding of existing concepts. Topological indices and quantitative characterizations mostly result from the application of graph theory on biological data. In the present work, the enzyme network involved in cattle milk production was reconstructed and analyzed based on available bovine genome information using several public datasets (NCBI, Uniprot, KEGG, and Brenda). The reconstructed network consisted of 3605 reactions named by KEGG compound numbers and 646 enzymes that catalyzed the corresponding reactions. The characteristics of the directed and undirected network were analyzed using Graph Theory. The mean path length was calculated to be4.39 and 5.41 for directed and undirected networks, respectively. The top 11 hub enzymes whose abnormality could harm bovine health and reduce milk production were determined. Therefore, the aim of constructing the enzyme centric network was twofold; first to find out whether such network followed the same properties of other biological networks, and second, to find the key enzymes. The results of the present study can improve our understanding of milk production in cattle. Also, analysis of the enzyme network can help improve the modeling and simulation of biological systems and help design desired phenotypes to increase milk production quality or quantity.
NASA Astrophysics Data System (ADS)
Zhang, Lin; Lu, Jian; Zhou, Jialin; Zhu, Jinqing; Li, Yunxuan; Wan, Qian
2018-03-01
Didi Dache is the most popular taxi order mobile app in China, which provides online taxi-hailing service. The obtained big database from this app could be used to analyze the complexities’ day-to-day dynamic evolution of Didi taxi trip network (DTTN) from the level of complex network dynamics. First, this paper proposes the data cleaning and modeling methods for expressing Nanjing’s DTTN as a complex network. Second, the three consecutive weeks’ data are cleaned to establish 21 DTTNs based on the proposed big data processing technology. Then, multiple topology measures that characterize the complexities’ day-to-day dynamic evolution of these networks are provided. Third, these measures of 21 DTTNs are calculated and subsequently explained with actual implications. They are used as a training set for modeling the BP neural network which is designed for predicting DTTN complexities evolution. Finally, the reliability of the designed BP neural network is verified by comparing with the actual data and the results obtained from ARIMA method simultaneously. Because network complexities are the basis for modeling cascading failures and conducting link prediction in complex system, this proposed research framework not only provides a novel perspective for analyzing DTTN from the level of system aggregated behavior, but can also be used to improve the DTTN management level.
Yazdizadeh, Bahareh; Majdzadeh, Reza; Alami, Ali; Amrolalaei, Sima
2014-10-29
Formal knowledge networks are considered among the solutions for strengthening knowledge translation and one of the elements of innovative systems in developing and developed countries. In the year 2000, knowledge networks were established in Iran's health system to organize, lead, empower, and coordinate efforts made by health-related research centers in the country. Since the assessment of a knowledge network is one of the main requirements for its success, the current study was designed in two qualitative and quantitative sections to identify the strengths and weaknesses of the established knowledge networks and to assess their efficiency. In the qualitative section, semi-structured, in-depth interviews were held with network directors and secretaries. The interviews were analyzed through the framework approach. To analyze effectiveness, social network analysis approach was used. That is, by considering the networks' research council members as 'nodes', and the numbers of their joint articles--before and after the network establishments--as 'relations or ties', indices of density, clique, and centrality were calculated for each network. In the qualitative section, non-transparency of management, lack of goals, administrative problems were among the most prevalent issues observed. Currently, the most important challenges are the policies related to them and their management. In the quantitative section, we observed that density and clique indices had risen for some networks; however, the centrality index for the same networks was not as high. Consequently the attribution of density and clique indices to these networks was not possible. Therefore, consolidating and revising policies relevant to the networks and preparing a guide for establishing managing networks could prove helpful. To develop knowledge and technology in a country, networks need to solve the problems they face in management and governance. That is, the first step towards the realization of true knowledge networks in health system.
Li, Su-Yi; Ji, Yan-Ju; Liu, Wei-Yu; Wang, Zhi-Hong
2013-04-01
In the present study, an innovative method is proposed, employing both wavelet transform and neural network, to analyze the near-infrared spectrum data in oil shale survey. The method entails using db8 wavelet at 3 levels decomposition to process raw data, using the transformed data as the input matrix, and creating the model through neural network. To verify the validity of the method, this study analyzes 30 synthesized oil shale samples, in which 20 samples are randomly selected for network training, the other 10 for model prediction, and uses the full spectrum and the wavelet transformed spectrum to carry out 10 network models, respectively. Results show that the mean speed of the full spectrum neural network modeling is 570.33 seconds, and the predicted residual sum of squares (PRESS) and correlation coefficient of prediction are 0.006 012 and 0.843 75, respectively. In contrast, the mean speed of the wavelet network modeling method is 3.15 seconds, and the mean PRESS and correlation coefficient of prediction are 0.002 048 and 0.953 19, respectively. These results demonstrate that the wavelet neural network modeling method is significantly superior to the full spectrum neural network modeling method. This study not only provides a new method for more efficient and accurate detection of the oil content of oil shale, but also indicates the potential for applying wavelet transform and neutral network in broad near-infrared spectrum analysis.
Long-term data sets of all-sky and clear-sky downwelling shortwave (SW) radiation, cloud cover fraction, and aerosol optical depth (AOD) were analyzed together with surface concentrations from several networks (e.g., Surface Radiation Budget Network (SURFRAD), Clean Air Status an...
Language Views on Social Networking Sites for Language Learning: The Case of Busuu
ERIC Educational Resources Information Center
Álvarez Valencia, José Aldemar
2016-01-01
Social networking has compelled the area of computer-assisted language learning (CALL) to expand its research palette and account for new virtual ecologies that afford language learning and socialization. This study focuses on Busuu, a social networking site for language learning (SNSLL), and analyzes the views of language that are enacted through…
Dealing with Disadvantage: Resilience and the Social Capital of Young People's Networks
ERIC Educational Resources Information Center
Bottrell, Dorothy
2009-01-01
This article analyzes how peer and extended networks provide young people with support and resources for dealing with disadvantage. Centering girls' accounts of growing up in the Glebe public housing estate, the difficulties they face, their critiques and aspirations are interpreted as resilience, supported by the social capital of their networks.…
Diaz-Montana, Juan J.; Diaz-Diaz, Norberto
2014-01-01
Gene networks are one of the main computational models used to study the interaction between different elements during biological processes being widely used to represent gene–gene, or protein–protein interaction complexes. We present GFD-Net, a Cytoscape app for visualizing and analyzing the functional dissimilarity of gene networks. PMID:25400907
LAN Configuration and Analysis: Projects for the Data Communications and Networking Course
ERIC Educational Resources Information Center
Chen, Fang; Brabston, Mary
2011-01-01
We implemented two local area network (LAN) projects in our introductory data communications and networking course. The first project required students to develop a LAN from scratch for a small imaginary organization. The second project required student groups to analyze a LAN for a real world small organization. By allowing students to apply what…
Predicting and controlling infectious disease epidemics using temporal networks
Holme, Petter
2013-01-01
Infectious diseases can be considered to spread over social networks of people or animals. Mainly owing to the development of data recording and analysis techniques, an increasing amount of social contact data with time stamps has been collected in the last decade. Such temporal data capture the dynamics of social networks on a timescale relevant to epidemic spreading and can potentially lead to better ways to analyze, forecast, and prevent epidemics. However, they also call for extended analysis tools for network epidemiology, which has, to date, mostly viewed networks as static entities. We review recent results of network epidemiology for such temporal network data and discuss future developments. PMID:23513178
Lifting SU(2) spin networks to projected spin networks
DOE Office of Scientific and Technical Information (OSTI.GOV)
Dupuis, Maiete; Livine, Etera R.
2010-09-15
Projected spin network states are the canonical basis of quantum states of geometry for the recent EPRL-FK spinfoam models for quantum gravity introduced by Engle-Pereira-Rovelli-Livine and Freidel-Krasnov. They are functionals of both the Lorentz connection and the time-normal field. We analyze in detail the map from these projected spin networks to the standard SU(2) spin networks of loop quantum gravity. We show that this map is not one to one and that the corresponding ambiguity is parameterized by the Immirzi parameter. We conclude with a comparison of the scalar products between projected spin networks and SU(2) spin network states.
Small-time Scale Network Traffic Prediction Based on Complex-valued Neural Network
NASA Astrophysics Data System (ADS)
Yang, Bin
2017-07-01
Accurate models play an important role in capturing the significant characteristics of the network traffic, analyzing the network dynamic, and improving the forecasting accuracy for system dynamics. In this study, complex-valued neural network (CVNN) model is proposed to further improve the accuracy of small-time scale network traffic forecasting. Artificial bee colony (ABC) algorithm is proposed to optimize the complex-valued and real-valued parameters of CVNN model. Small-scale traffic measurements data namely the TCP traffic data is used to test the performance of CVNN model. Experimental results reveal that CVNN model forecasts the small-time scale network traffic measurement data very accurately
Predicting and controlling infectious disease epidemics using temporal networks.
Masuda, Naoki; Holme, Petter
2013-01-01
Infectious diseases can be considered to spread over social networks of people or animals. Mainly owing to the development of data recording and analysis techniques, an increasing amount of social contact data with time stamps has been collected in the last decade. Such temporal data capture the dynamics of social networks on a timescale relevant to epidemic spreading and can potentially lead to better ways to analyze, forecast, and prevent epidemics. However, they also call for extended analysis tools for network epidemiology, which has, to date, mostly viewed networks as static entities. We review recent results of network epidemiology for such temporal network data and discuss future developments.
Norbutas, Lukas
2018-06-01
Cryptomarkets, or illegal anonymizing online platforms that facilitate drug trade, have been analyzed in a rapidly growing body of research. Previous research has found that, despite increased risks, cryptomarket sellers are often willing to ship illegal drugs internationally. There is little to no information, however, about the extent to which uncertainty and risk related to geographic constraints shapes buyers' behavior and, in turn, the structure of the global online drug trade network. In this paper, we analyze the structure of a complete cryptomarket trade network with a focus on the role of geographic clustering of buyers and sellers. We use publicly available crawls of the cryptomarket Abraxas, encompassing market transactions between 463 sellers and 3542 buyers of drugs in 2015. We use descriptive social network analysis and Exponential Random Graph Models (ERGM) to analyze the structure of the trade network. The structure of the online drug trade network is primarily shaped by geographical boundaries. Buyers are more likely to buy from multiple sellers within a single country, and avoid buying from sellers in different countries, which leads to strong geographic clustering. The effect is especially strong between continents and weaker for countries within Europe. A small fraction of buyers (10%) account for more than a half of all drug purchases, while most buyers only buy once. Online drug trade networks might still be heavily shaped by offline (geographic) constraints, despite their ability to provide access for end-users to large international supply. Cryptomarkets might be more "localized" and less international than thought before. We discuss potential explanations for such geographical clustering and implications of the findings. Copyright © 2018 The Author(s). Published by Elsevier B.V. All rights reserved.
NASA Astrophysics Data System (ADS)
Yasami, Yasser; Safaei, Farshad
2018-02-01
The traditional complex network theory is particularly focused on network models in which all network constituents are dealt with equivalently, while fail to consider the supplementary information related to the dynamic properties of the network interactions. This is a main constraint leading to incorrect descriptions of some real-world phenomena or incomplete capturing the details of certain real-life problems. To cope with the problem, this paper addresses the multilayer aspects of dynamic complex networks by analyzing the properties of intrinsically multilayered co-authorship networks, DBLP and Astro Physics, and presenting a novel multilayer model of dynamic complex networks. The model examines the layers evolution (layers birth/death process and lifetime) throughout the network evolution. Particularly, this paper models the evolution of each node's membership in different layers by an Infinite Factorial Hidden Markov Model considering feature cascade, and thereby formulates the link generation process for intra-layer and inter-layer links. Although adjacency matrixes are useful to describe the traditional single-layer networks, such a representation is not sufficient to describe and analyze the multilayer dynamic networks. This paper also extends a generalized mathematical infrastructure to address the problems issued by multilayer complex networks. The model inference is performed using some Markov Chain Monte Carlo sampling strategies, given synthetic and real complex networks data. Experimental results indicate a tremendous improvement in the performance of the proposed multilayer model in terms of sensitivity, specificity, positive and negative predictive values, positive and negative likelihood ratios, F1-score, Matthews correlation coefficient, and accuracy for two important applications of missing link prediction and future link forecasting. The experimental results also indicate the strong predictivepower of the proposed model for the application of cascade prediction in terms of accuracy.
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.
NASA Astrophysics Data System (ADS)
Kawamoto, Hirokazu; Takayasu, Hideki; Takayasu, Misako
We analyze the typical characteristics of the percolation transition of a large-scale complex network, a Japanese business relation network consisting of approximately 600,000 nodes and 4,000,000 links. By utilizing percolation characteristics, we revise the definition of network survival rate that we previously proposed. The new network survival rate has a strong correlation with the old one. The calculation cost is also much smaller and the number of trials decreases from 100,000 to 1,000. Finally, we discuss the identification of robust and fragile regions using this index.
Privacy Breach Analysis in Social Networks
NASA Astrophysics Data System (ADS)
Nagle, Frank
This chapter addresses various aspects of analyzing privacy breaches in social networks. We first review literature that defines three types of privacy breaches in social networks: interactive, active, and passive. We then survey the various network anonymization schemes that have been constructed to address these privacy breaches. After exploring these breaches and anonymization schemes, we evaluate a measure for determining the level of anonymity inherent in a network graph based on its topological structure. Finally, we close by emphasizing the difficulty of anonymizing social network data while maintaining usability for research purposes and offering areas for future work.
Epidemic spreading on interconnected networks.
Saumell-Mendiola, Anna; Serrano, M Ángeles; Boguñá, Marián
2012-08-01
Many real networks are not isolated from each other but form networks of networks, often interrelated in nontrivial ways. Here, we analyze an epidemic spreading process taking place on top of two interconnected complex networks. We develop a heterogeneous mean-field approach that allows us to calculate the conditions for the emergence of an endemic state. Interestingly, a global endemic state may arise in the coupled system even though the epidemics is not able to propagate on each network separately and even when the number of coupling connections is small. Our analytic results are successfully confronted against large-scale numerical simulations.
Epidemic spreading on interconnected networks
NASA Astrophysics Data System (ADS)
Saumell-Mendiola, Anna; Serrano, M. Ángeles; Boguñá, Marián
2012-08-01
Many real networks are not isolated from each other but form networks of networks, often interrelated in nontrivial ways. Here, we analyze an epidemic spreading process taking place on top of two interconnected complex networks. We develop a heterogeneous mean-field approach that allows us to calculate the conditions for the emergence of an endemic state. Interestingly, a global endemic state may arise in the coupled system even though the epidemics is not able to propagate on each network separately and even when the number of coupling connections is small. Our analytic results are successfully confronted against large-scale numerical simulations.
Inferring Boolean network states from partial information
2013-01-01
Networks of molecular interactions regulate key processes in living cells. Therefore, understanding their functionality is a high priority in advancing biological knowledge. Boolean networks are often used to describe cellular networks mathematically and are fitted to experimental datasets. The fitting often results in ambiguities since the interpretation of the measurements is not straightforward and since the data contain noise. In order to facilitate a more reliable mapping between datasets and Boolean networks, we develop an algorithm that infers network trajectories from a dataset distorted by noise. We analyze our algorithm theoretically and demonstrate its accuracy using simulation and microarray expression data. PMID:24006954
The Analysis of Duocentric Social Networks: A Primer.
Kennedy, David P; Jackson, Grace L; Green, Harold D; Bradbury, Thomas N; Karney, Benjamin R
2015-02-01
Marriages and other intimate partnerships are facilitated or constrained by the social networks within which they are embedded. To date, methods used to assess the social networks of couples have been limited to global ratings of social network characteristics or network data collected from each partner separately. In the current article, the authors offer new tools for expanding on the existing literature by describing methods of collecting and analyzing duocentric social networks, that is, the combined social networks of couples. They provide an overview of the key considerations for measuring duocentric networks, such as how and why to combine separate network interviews with partners into one shared duocentric network, the number of network members to assess, and the implications of different network operationalizations. They illustrate these considerations with analyses of social network data collected from 57 low-income married couples, presenting visualizations and quantitative measures of network composition and structure.
Topological Vulnerability Analysis
NASA Astrophysics Data System (ADS)
Jajodia, Sushil; Noel, Steven
Traditionally, network administrators rely on labor-intensive processes for tracking network configurations and vulnerabilities. This requires a great deal of expertise, and is error prone because of the complexity of networks and associated security data. The interdependencies of network vulnerabilities make traditional point-wise vulnerability analysis inadequate. We describe a Topological Vulnerability Analysis (TVA) approach that analyzes vulnerability dependencies and shows all possible attack paths into a network. From models of the network vulnerabilities and potential attacker exploits, we compute attack graphs that convey the impact of individual and combined vulnerabilities on overall security. TVA finds potential paths of vulnerability through a network, showing exactly how attackers may penetrate a network. From this, we identify key vulnerabilities and provide strategies for protection of critical network assets.
Polarity-specific high-level information propagation in neural networks.
Lin, Yen-Nan; Chang, Po-Yen; Hsiao, Pao-Yueh; Lo, Chung-Chuan
2014-01-01
Analyzing the connectome of a nervous system provides valuable information about the functions of its subsystems. Although much has been learned about the architectures of neural networks in various organisms by applying analytical tools developed for general networks, two distinct and functionally important properties of neural networks are often overlooked. First, neural networks are endowed with polarity at the circuit level: Information enters a neural network at input neurons, propagates through interneurons, and leaves via output neurons. Second, many functions of nervous systems are implemented by signal propagation through high-level pathways involving multiple and often recurrent connections rather than by the shortest paths between nodes. In the present study, we analyzed two neural networks: the somatic nervous system of Caenorhabditis elegans (C. elegans) and the partial central complex network of Drosophila, in light of these properties. Specifically, we quantified high-level propagation in the vertical and horizontal directions: the former characterizes how signals propagate from specific input nodes to specific output nodes and the latter characterizes how a signal from a specific input node is shared by all output nodes. We found that the two neural networks are characterized by very efficient vertical and horizontal propagation. In comparison, classic small-world networks show a trade-off between vertical and horizontal propagation; increasing the rewiring probability improves the efficiency of horizontal propagation but worsens the efficiency of vertical propagation. Our result provides insights into how the complex functions of natural neural networks may arise from a design that allows them to efficiently transform and combine input signals.
Polarity-specific high-level information propagation in neural networks
Lin, Yen-Nan; Chang, Po-Yen; Hsiao, Pao-Yueh; Lo, Chung-Chuan
2014-01-01
Analyzing the connectome of a nervous system provides valuable information about the functions of its subsystems. Although much has been learned about the architectures of neural networks in various organisms by applying analytical tools developed for general networks, two distinct and functionally important properties of neural networks are often overlooked. First, neural networks are endowed with polarity at the circuit level: Information enters a neural network at input neurons, propagates through interneurons, and leaves via output neurons. Second, many functions of nervous systems are implemented by signal propagation through high-level pathways involving multiple and often recurrent connections rather than by the shortest paths between nodes. In the present study, we analyzed two neural networks: the somatic nervous system of Caenorhabditis elegans (C. elegans) and the partial central complex network of Drosophila, in light of these properties. Specifically, we quantified high-level propagation in the vertical and horizontal directions: the former characterizes how signals propagate from specific input nodes to specific output nodes and the latter characterizes how a signal from a specific input node is shared by all output nodes. We found that the two neural networks are characterized by very efficient vertical and horizontal propagation. In comparison, classic small-world networks show a trade-off between vertical and horizontal propagation; increasing the rewiring probability improves the efficiency of horizontal propagation but worsens the efficiency of vertical propagation. Our result provides insights into how the complex functions of natural neural networks may arise from a design that allows them to efficiently transform and combine input signals. PMID:24672472
Nonlinear dynamic evolution and control in CCFN with mixed attachment mechanisms
NASA Astrophysics Data System (ADS)
Wang, Jianrong; Wang, Jianping; Han, Dun
2017-01-01
In recent years, wireless communication plays an important role in our lives. Cooperative communication, is used by a mobile station with single antenna to share with each other forming a virtual MIMO antenna system, will become a development with a diversity gain for wireless communication in tendency future. In this paper, a fitness model of evolution network based on complex networks with mixed attachment mechanisms is devised in order to study an actual network-CCFN (cooperative communication fitness network). Firstly, the evolution of CCFN is given by four cases with different probabilities, and the rate equations of nodes degree are presented to analyze the evolution of CCFN. Secondly, the degree distribution is analyzed by calculating the rate equation and numerical simulation with the examples of four fitness distributions such as power law, uniform fitness distribution, exponential fitness distribution and Rayleigh fitness distribution. Finally, the robustness of CCFN is studied by numerical simulation with four fitness distributions under random attack and intentional attack to analyze the effects of degree distribution, average path length and average degree. The results of this paper offers insights for building CCFN systems in order to program communication resources.
Ex vivo method to visualize and quantify vascular networks in native and tissue engineered skin.
Egaña, José Tomás; Condurache, Alexandru; Lohmeyer, Jörn Andreas; Kremer, Mathias; Stöckelhuber, Beate M; Lavandero, Sergio; Machens, Hans-Günther
2009-03-01
Neovascularization plays a pivotal role in tissue engineering and tissue regeneration. However, reliable technologies to visualize and quantify blood vessel networks in target tissue areas are still pending. In this work, we introduce a new method which allows comparing vascularization levels in normal and tissue-engineered skin. Normal skin was isolated, and vascular dermal regeneration was analyzed based on tissue transillumination and computerized digital segmentation. For tissue-engineered skin, a bilateral full skin defect was created in a nude mouse model and then covered with a commercially available scaffold for dermal regeneration. After 3 weeks, the whole skin (including scaffold for dermal regeneration) was harvested, and vascularization levels were analyzed. The blood vessel network in the skin was better visualized by transillumination than by radio-angiographic studies, the gold standard for angiographies. After visualization, the whole vascular network was digitally segmented showing an excellent overlapping with the original pictures. Quantification over the digitally segmented picture was performed, and an index of vascularization area (VAI) and length (VLI) of the vessel network was obtained in target tissues. VAI/VLI ratio was calculated to obtain the vessel size index. We present a new technique which has several advantages compared to others, as animals do not require intravascular perfusions, total areas of interest can be quantitatively analyzed at once, and the same target tissue can be processed for further experimental analysis.
Overview of Computer-Based Models Applicable to Freight Car Utilization
DOT National Transportation Integrated Search
1977-10-01
This report documents a study performed to identify and analyze twenty-two of the important computer-based models of railroad operations. The models are divided into three categories: network simulations, yard simulations, and network optimizations. ...
Tutte polynomial in functional magnetic resonance imaging
NASA Astrophysics Data System (ADS)
García-Castillón, Marlly V.
2015-09-01
Methods of graph theory are applied to the processing of functional magnetic resonance images. Specifically the Tutte polynomial is used to analyze such kind of images. Functional Magnetic Resonance Imaging provide us connectivity networks in the brain which are represented by graphs and the Tutte polynomial will be applied. The problem of computing the Tutte polynomial for a given graph is #P-hard even for planar graphs. For a practical application the maple packages "GraphTheory" and "SpecialGraphs" will be used. We will consider certain diagram which is depicting functional connectivity, specifically between frontal and posterior areas, in autism during an inferential text comprehension task. The Tutte polynomial for the resulting neural networks will be computed and some numerical invariants for such network will be obtained. Our results show that the Tutte polynomial is a powerful tool to analyze and characterize the networks obtained from functional magnetic resonance imaging.
Massive Social Network Analysis: Mining Twitter for Social Good
DOE Office of Scientific and Technical Information (OSTI.GOV)
Ediger, David; Jiang, Karl; Riedy, Edward J.
Social networks produce an enormous quantity of data. Facebook consists of over 400 million active users sharing over 5 billion pieces of information each month. Analyzing this vast quantity of unstructured data presents challenges for software and hardware. We present GraphCT, a Graph Characterization Tooklit for massive graphs representing social network data. On a 128-processor Cray XMT, GraphCT estimates the betweenness centrality of an artificially generated (R-MAT) 537 million vertex, 8.6 billion edge graph in 55 minutes. We use GraphCT to analyze public data from Twitter, a microblogging network. Twitter's message connections appear primarily tree-structured as a news dissemination system.more » Within the public data, however, are clusters of conversations. Using GraphCT, we can rank actors within these conversations and help analysts focus attention on a much smaller data subset.« less
Impact of nonlinearity phenomenon FWM in DWDM optical link considering dispersive fiber
NASA Astrophysics Data System (ADS)
Puche, William S.; Amaya, Ferney O.; Sierra, Javier E.
2013-12-01
The increasing demand of network traffic requires new research centers; improve their communications networks, due to the excessive use of mobile and portable devices wanting to have greater access to the network by downloading interactive content quickly and effectively. For our case analyze optical network link through simulation results assuming a DWDM (Dense wavelength Division Multiplexing) optical link, considering the nonlinearity phenomenon FWM (Four Mixed Wavelength) in order to compare their performance, assuming transmission bit rates to 2.5 Gbps and 10 Gbps, using three primary wavelengths of 1450 nm, 1550 nm and 1650 nm for the transmission of information, whose separation is 100 GHz to generate 16 channels or user information. Tests were conducted to analyze optical amplifiers EDFAs link robustness at a maximum distance of 200 km and identify parameters OSNR, SNR and BER, for a robust and effective transmission
Predictability of Extreme Climate Events via a Complex Network Approach
NASA Astrophysics Data System (ADS)
Muhkin, D.; Kurths, J.
2017-12-01
We analyse climate dynamics from a complex network approach. This leads to an inverse problem: Is there a backbone-like structure underlying the climate system? For this we propose a method to reconstruct and analyze a complex network from data generated by a spatio-temporal dynamical system. This approach enables us to uncover relations to global circulation patterns in oceans and atmosphere. This concept is then applied to Monsoon data; in particular, we develop a general framework to predict extreme events by combining a non-linear synchronization technique with complex networks. Applying this method, we uncover a new mechanism of extreme floods in the eastern Central Andes which could be used for operational forecasts. Moreover, we analyze the Indian Summer Monsoon (ISM) and identify two regions of high importance. By estimating an underlying critical point, this leads to an improved prediction of the onset of the ISM; this scheme was successful in 2016 and 2017.
Computer-aided design of biological circuits using TinkerCell
Bergmann, Frank T; Sauro, Herbert M
2010-01-01
Synthetic biology is an engineering discipline that builds on modeling practices from systems biology and wet-lab techniques from genetic engineering. As synthetic biology advances, efficient procedures will be developed that will allow a synthetic biologist to design, analyze and build biological networks. In this idealized pipeline, computer-aided design (CAD) is a necessary component. The role of a CAD application would be to allow efficient transition from a general design to a final product. TinkerCell is a design tool for serving this purpose in synthetic biology. In TinkerCell, users build biological networks using biological parts and modules. The network can be analyzed using one of several functions provided by TinkerCell or custom programs from third-party sources. Since best practices for modeling and constructing synthetic biology networks have not yet been established, TinkerCell is designed as a flexible and extensible application that can adjust itself to changes in the field. PMID:21327060
Persistent homology analysis of ion aggregations and hydrogen-bonding networks.
Xia, Kelin
2018-05-16
Despite the great advancement of experimental tools and theoretical models, a quantitative characterization of the microscopic structures of ion aggregates and their associated water hydrogen-bonding networks still remains a challenging problem. In this paper, a newly-invented mathematical method called persistent homology is introduced, for the first time, to quantitatively analyze the intrinsic topological properties of ion aggregation systems and hydrogen-bonding networks. The two most distinguishable properties of persistent homology analysis of assembly systems are as follows. First, it does not require a predefined bond length to construct the ion or hydrogen-bonding network. Persistent homology results are determined by the morphological structure of the data only. Second, it can directly measure the size of circles or holes in ion aggregates and hydrogen-bonding networks. To validate our model, we consider two well-studied systems, i.e., NaCl and KSCN solutions, generated from molecular dynamics simulations. They are believed to represent two morphological types of aggregation, i.e., local clusters and extended ion networks. It has been found that the two aggregation types have distinguishable topological features and can be characterized by our topological model very well. Further, we construct two types of networks, i.e., O-networks and H2O-networks, for analyzing the topological properties of hydrogen-bonding networks. It is found that for both models, KSCN systems demonstrate much more dramatic variations in their local circle structures with a concentration increase. A consistent increase of large-sized local circle structures is observed and the sizes of these circles become more and more diverse. In contrast, NaCl systems show no obvious increase of large-sized circles. Instead a consistent decline of the average size of the circle structures is observed and the sizes of these circles become more and more uniform with a concentration increase. As far as we know, these unique intrinsic topological features in ion aggregation systems have never been pointed out before. More importantly, our models can be directly used to quantitatively analyze the intrinsic topological invariants, including circles, loops, holes, and cavities, of any network-like structures, such as nanomaterials, colloidal systems, biomolecular assemblies, among others. These topological invariants cannot be described by traditional graph and network models.
An Architecture for SCADA Network Forensics
NASA Astrophysics Data System (ADS)
Kilpatrick, Tim; Gonzalez, Jesus; Chandia, Rodrigo; Papa, Mauricio; Shenoi, Sujeet
Supervisory control and data acquisition (SCADA) systems are widely used in industrial control and automation. Modern SCADA protocols often employ TCP/IP to transport sensor data and control signals. Meanwhile, corporate IT infrastructures are interconnecting with previously isolated SCADA networks. The use of TCP/IP as a carrier protocol and the interconnection of IT and SCADA networks raise serious security issues. This paper describes an architecture for SCADA network forensics. In addition to supporting forensic investigations of SCADA network incidents, the architecture incorporates mechanisms for monitoring process behavior, analyzing trends and optimizing plant performance.
Identifying influential nodes in complex networks: A node information dimension approach
NASA Astrophysics Data System (ADS)
Bian, Tian; Deng, Yong
2018-04-01
In the field of complex networks, how to identify influential nodes is a significant issue in analyzing the structure of a network. In the existing method proposed to identify influential nodes based on the local dimension, the global structure information in complex networks is not taken into consideration. In this paper, a node information dimension is proposed by synthesizing the local dimensions at different topological distance scales. A case study of the Netscience network is used to illustrate the efficiency and practicability of the proposed method.
Evolving network with different edges
DOE Office of Scientific and Technical Information (OSTI.GOV)
Sun Jie; Department of Mathematics and Computer Science, Clarkson University, Potsdam, New York 13699; Ge Yizhi
2007-10-15
We propose a scale-free network similar to Barabasi-Albert networks but with two different types of edges. This model is based on the idea that in many cases there are more than one kind of link in a network and when a new node enters the network both old nodes and different kinds of links compete to obtain it. The degree distribution of both the total degree and the degree of each type of edge is analyzed and found to be scale-free. Simulations are shown to confirm these results.
A method for independent component graph analysis of resting-state fMRI.
Ribeiro de Paula, Demetrius; Ziegler, Erik; Abeyasinghe, Pubuditha M; Das, Tushar K; Cavaliere, Carlo; Aiello, Marco; Heine, Lizette; di Perri, Carol; Demertzi, Athena; Noirhomme, Quentin; Charland-Verville, Vanessa; Vanhaudenhuyse, Audrey; Stender, Johan; Gomez, Francisco; Tshibanda, Jean-Flory L; Laureys, Steven; Owen, Adrian M; Soddu, Andrea
2017-03-01
Independent component analysis (ICA) has been extensively used for reducing task-free BOLD fMRI recordings into spatial maps and their associated time-courses. The spatially identified independent components can be considered as intrinsic connectivity networks (ICNs) of non-contiguous regions. To date, the spatial patterns of the networks have been analyzed with techniques developed for volumetric data. Here, we detail a graph building technique that allows these ICNs to be analyzed with graph theory. First, ICA was performed at the single-subject level in 15 healthy volunteers using a 3T MRI scanner. The identification of nine networks was performed by a multiple-template matching procedure and a subsequent component classification based on the network "neuronal" properties. Second, for each of the identified networks, the nodes were defined as 1,015 anatomically parcellated regions. Third, between-node functional connectivity was established by building edge weights for each networks. Group-level graph analysis was finally performed for each network and compared to the classical network. Network graph comparison between the classically constructed network and the nine networks showed significant differences in the auditory and visual medial networks with regard to the average degree and the number of edges, while the visual lateral network showed a significant difference in the small-worldness. This novel approach permits us to take advantage of the well-recognized power of ICA in BOLD signal decomposition and, at the same time, to make use of well-established graph measures to evaluate connectivity differences. Moreover, by providing a graph for each separate network, it can offer the possibility to extract graph measures in a specific way for each network. This increased specificity could be relevant for studying pathological brain activity or altered states of consciousness as induced by anesthesia or sleep, where specific networks are known to be altered in different strength.
Extracting information from multiplex networks
NASA Astrophysics Data System (ADS)
Iacovacci, Jacopo; Bianconi, Ginestra
2016-06-01
Multiplex networks are generalized network structures that are able to describe networks in which the same set of nodes are connected by links that have different connotations. Multiplex networks are ubiquitous since they describe social, financial, engineering, and biological networks as well. Extending our ability to analyze complex networks to multiplex network structures increases greatly the level of information that is possible to extract from big data. For these reasons, characterizing the centrality of nodes in multiplex networks and finding new ways to solve challenging inference problems defined on multiplex networks are fundamental questions of network science. In this paper, we discuss the relevance of the Multiplex PageRank algorithm for measuring the centrality of nodes in multilayer networks and we characterize the utility of the recently introduced indicator function Θ ˜ S for describing their mesoscale organization and community structure. As working examples for studying these measures, we consider three multiplex network datasets coming for social science.
Dynamics of comb-of-comb-network polymers in random layered flows
NASA Astrophysics Data System (ADS)
Katyal, Divya; Kant, Rama
2016-12-01
We analyze the dynamics of comb-of-comb-network polymers in the presence of external random flows. The dynamics of such structures is evaluated through relevant physical quantities, viz., average square displacement (ASD) and the velocity autocorrelation function (VACF). We focus on comparing the dynamics of the comb-of-comb network with the linear polymer. The present work displays an anomalous diffusive behavior of this flexible network in the random layered flows. The effect of the polymer topology on the dynamics is analyzed by varying the number of generations and branch lengths in these networks. In addition, we investigate the influence of external flow on the dynamics by varying flow parameters, like the flow exponent α and flow strength Wα. Our analysis highlights two anomalous power-law regimes, viz., subdiffusive (intermediate-time polymer stretching and flow-induced diffusion) and superdiffusive (long-time flow-induced diffusion). The anomalous long-time dynamics is governed by the temporal exponent ν of ASD, viz., ν =2 -α /2 . Compared to a linear polymer, the comb-of-comb network shows a shorter crossover time (from the subdiffusive to superdiffusive regime) but a reduced magnitude of ASD. Our theory displays an anomalous VACF in the random layered flows that scales as t-α /2. We show that the network with greater total mass moves faster.
On the quirks of maximum parsimony and likelihood on phylogenetic networks.
Bryant, Christopher; Fischer, Mareike; Linz, Simone; Semple, Charles
2017-03-21
Maximum parsimony is one of the most frequently-discussed tree reconstruction methods in phylogenetic estimation. However, in recent years it has become more and more apparent that phylogenetic trees are often not sufficient to describe evolution accurately. For instance, processes like hybridization or lateral gene transfer that are commonplace in many groups of organisms and result in mosaic patterns of relationships cannot be represented by a single phylogenetic tree. This is why phylogenetic networks, which can display such events, are becoming of more and more interest in phylogenetic research. It is therefore necessary to extend concepts like maximum parsimony from phylogenetic trees to networks. Several suggestions for possible extensions can be found in recent literature, for instance the softwired and the hardwired parsimony concepts. In this paper, we analyze the so-called big parsimony problem under these two concepts, i.e. we investigate maximum parsimonious networks and analyze their properties. In particular, we show that finding a softwired maximum parsimony network is possible in polynomial time. We also show that the set of maximum parsimony networks for the hardwired definition always contains at least one phylogenetic tree. Lastly, we investigate some parallels of parsimony to different likelihood concepts on phylogenetic networks. Copyright © 2017 Elsevier Ltd. All rights reserved.
Huang, Shu-Li; Lee, Ying-Chieh; Budd, William W; Yang, Min-Chia
2012-04-01
The farm pond system for irrigation is the most prominent feature in the Taoyuan area, Taiwan, giving the region a unique landscape and hydrological character. Although this area had more than 3,290 ponds in the 1970s, fewer than 1,800 now remain. This study analyzes changes in irrigation farm ponds and the canal network landscape in the Taoyuan area. The spatial and temporal changes to ponds and the canal network on the Taoyuan plain were examined graphically for each spatial unit (2,765 m × 2,525 m) using aerial photographs for 1979 and 2005. Landscape metrics were calculated to analyze landscape change associated with increased urbanization. Landscape indices of connectivity and circuitry were utilized to describe changes in the configuration of ponds and canal networks. The total length of canals and total number of ponds in the study area decreased significantly during 1979-2005. The average values of connectivity indices (γ- and α-index) also decreased during 1979-2005, reflecting degradation of canal networks due to urban sprawl. A multivariate technique was applied to portion the study area into three zones according to changes to land cover, ponds, and canal networks. The effects of urban sprawl on the spatial pattern of ponds and canal networks are discussed.
Xu, Zhijing; Zu, Zhenghu; Zheng, Tao; Zhang, Wendou; Xu, Qing; Liu, Jinjie
2014-01-01
The high incidence of emerging infectious diseases has highlighted the importance of effective immunization strategies, especially the stochastic algorithms based on local available network information. Present stochastic strategies are mainly evaluated based on classical network models, such as scale-free networks and small-world networks, and thus are insufficient. Three frequently referred stochastic immunization strategies-acquaintance immunization, community-bridge immunization, and ring vaccination-were analyzed in this work. The optimal immunization ratios for acquaintance immunization and community-bridge immunization strategies were investigated, and the effectiveness of these three strategies in controlling the spreading of epidemics were analyzed based on realistic social contact networks. The results show all the strategies have decreased the coverage of the epidemics compared to baseline scenario (no control measures). However the effectiveness of acquaintance immunization and community-bridge immunization are very limited, with acquaintance immunization slightly outperforming community-bridge immunization. Ring vaccination significantly outperforms acquaintance immunization and community-bridge immunization, and the sensitivity analysis shows it could be applied to controlling the epidemics with a wide infectivity spectrum. The effectiveness of several classical stochastic immunization strategies was evaluated based on realistic contact networks for the first time in this study. These results could have important significance for epidemic control research and practice.
Parallel or convergent evolution in human population genomic data revealed by genotype networks.
R Vahdati, Ali; Wagner, Andreas
2016-08-02
Genotype networks are representations of genetic variation data that are complementary to phylogenetic trees. A genotype network is a graph whose nodes are genotypes (DNA sequences) with the same broadly defined phenotype. Two nodes are connected if they differ in some minimal way, e.g., in a single nucleotide. We analyze human genome variation data from the 1,000 genomes project, and construct haploid genotype (haplotype) networks for 12,235 protein coding genes. The structure of these networks varies widely among genes, indicating different patterns of variation despite a shared evolutionary history. We focus on those genes whose genotype networks show many cycles, which can indicate homoplasy, i.e., parallel or convergent evolution, on the sequence level. For 42 genes, the observed number of cycles is so large that it cannot be explained by either chance homoplasy or recombination. When analyzing possible explanations, we discovered evidence for positive selection in 21 of these genes and, in addition, a potential role for constrained variation and purifying selection. Balancing selection plays at most a small role. The 42 genes with excess cycles are enriched in functions related to immunity and response to pathogens. Genotype networks are representations of genetic variation data that can help understand unusual patterns of genomic variation.
2012-01-01
networks has become fast , cheap, and easy (Shapiro, 1971; Trigg & Weiser, 1986). Modern information and communication technologies, such as the internet...However, once the model is learned, inference time is not subject to this constraint. Therefore, applying the model in end-user applications is fast ...products that facilitate the fast collection and assessment of these networks. For the purpose of analyzing socio-technical networks of geopolitical
Synchronization on Erdös-Rényi networks.
Gong, Baihua; Yang, Lei; Yang, Kongqing
2005-09-01
In this Brief Report, by analyzing the spectral properties of the Laplacian matrix of Erdös-Rényi networks, we obtained the critical coupling strength of the complete synchronization analytically. In particular, for any size of the networks, when the average degree is greater than a threshold and the coupling strength is large enough, the networks can synchronize. Here, the threshold is determined by the value of the maximal Lyapunov exponent of each dynamical unit.
Quantitative description and modeling of real networks
NASA Astrophysics Data System (ADS)
Capocci, Andrea; Caldarelli, Guido; de Los Rios, Paolo
2003-10-01
We present data analysis and modeling of two particular cases of study in the field of growing networks. We analyze World Wide Web data set and authorship collaboration networks in order to check the presence of correlation in the data. The results are reproduced with good agreement through a suitable modification of the standard Albert-Barabási model of network growth. In particular, intrinsic relevance of sites plays a role in determining the future degree of the vertex.
An iteration algorithm for optimal network flows
NASA Astrophysics Data System (ADS)
Woong, C. J.
1983-09-01
A packet switching network has the desirable feature of rapidly handling short (bursty) messages of the type often found in computer communication systems. In evaluating packet switching networks, the average time delay per packet is one of the most important measures of performance. The problem of message routing to minimize time delay is analyzed here using two approaches, called "successive saturation' and "max-slack', for various traffic requirement matrices and networks with fixed topology and link capacities.
A reliability analysis tool for SpaceWire network
NASA Astrophysics Data System (ADS)
Zhou, Qiang; Zhu, Longjiang; Fei, Haidong; Wang, Xingyou
2017-04-01
A SpaceWire is a standard for on-board satellite networks as the basis for future data-handling architectures. It is becoming more and more popular in space applications due to its technical advantages, including reliability, low power and fault protection, etc. High reliability is the vital issue for spacecraft. Therefore, it is very important to analyze and improve the reliability performance of the SpaceWire network. This paper deals with the problem of reliability modeling and analysis with SpaceWire network. According to the function division of distributed network, a reliability analysis method based on a task is proposed, the reliability analysis of every task can lead to the system reliability matrix, the reliability result of the network system can be deduced by integrating these entire reliability indexes in the matrix. With the method, we develop a reliability analysis tool for SpaceWire Network based on VC, where the computation schemes for reliability matrix and the multi-path-task reliability are also implemented. By using this tool, we analyze several cases on typical architectures. And the analytic results indicate that redundancy architecture has better reliability performance than basic one. In practical, the dual redundancy scheme has been adopted for some key unit, to improve the reliability index of the system or task. Finally, this reliability analysis tool will has a directive influence on both task division and topology selection in the phase of SpaceWire network system design.
Structural Behavioral Study on the General Aviation Network Based on Complex Network
NASA Astrophysics Data System (ADS)
Zhang, Liang; Lu, Na
2017-12-01
The general aviation system is an open and dissipative system with complex structures and behavioral features. This paper has established the system model and network model for general aviation. We have analyzed integral attributes and individual attributes by applying the complex network theory and concluded that the general aviation network has influential enterprise factors and node relations. We have checked whether the network has small world effect, scale-free property and network centrality property which a complex network should have by applying degree distribution of functions and proved that the general aviation network system is a complex network. Therefore, we propose to achieve the evolution process of the general aviation industrial chain to collaborative innovation cluster of advanced-form industries by strengthening network multiplication effect, stimulating innovation performance and spanning the structural hole path.
The Study on the Communication Network of Wide Area Measurement System in Electricity Grid
NASA Astrophysics Data System (ADS)
Xiaorong, Cheng; Ying, Wang; Yangdan, Ni
Wide area measurement system(WAMS) is a fundamental part of security defense in Smart Grid, and the communication system of WAMS is an important part of Electric power communication network. For a large regional network is concerned, the real-time data which is transferred in the communication network of WAMS will affect the safe operation of the power grid directly. Therefore, WAMS raised higher requirements for real-time, reliability and security to its communication network. In this paper, the architecture of WASM communication network was studied according to the seven layers model of the open systems interconnection(OSI), and the network architecture was researched from all levels. We explored the media of WAMS communication network, the network communication protocol and network technology. Finally, the delay of the network were analyzed.
Interdependent networks - Topological percolation research and application in finance
NASA Astrophysics Data System (ADS)
Zhou, Di
This dissertation covers the two major parts of my Ph.D. research: i) developing a theoretical framework of complex networks and applying simulation and numerical methods to study the robustness of the network system, and ii) applying statistical physics concepts and methods to quantitatively analyze complex systems and applying the theoretical framework to study real-world systems. In part I, we focus on developing theories of interdependent networks as well as building computer simulation models, which includes three parts: 1) We report on the effects of topology on failure propagation for a model system consisting of two interdependent networks. We find that the internal node correlations in each of the networks significantly changes the critical density of failures, which can trigger the total disruption of the two-network system. Specifically, we find that the assortativity within a single network decreases the robustness of the entire system. 2) We study the percolation behavior of two interdependent scale-free (SF) networks under random failure of 1-p fraction of nodes. We find that as the coupling strength q between the two networks reduces from 1 (fully coupled) to 0 (no coupling), there exist two critical coupling strengths q1 and q2 , which separate the behaviors of the giant component as a function of p into three different regions, and for q2 < q < q 1 , we observe a hybrid order phase transition phenomenon. 3) We study the robustness of n interdependent networks with partially support-dependent relationship both analytically and numerically. We study a starlike network of n Erdos-Renyi (ER), SF networks and a looplike network of n ER networks, and we find for starlike networks, their phase transition regions change with n, but for looplike networks the phase regions change with average degree k . In part II, we apply concepts and methods developed in statistical physics to study economic systems. We analyze stock market indices and foreign exchange daily returns for 60 countries over the period of 1999-2012. We build a multi-layer network model based on different correlation measures, and introduce a dynamic network model to simulate and analyze the initializing and spreading of financial crisis. Using different computational approaches and econometric tests, we find atypical behavior of the cross correlations and community formations in the financial networks that we study during the financial crisis of 2008. For example, the overall correlation of stock market increases during crisis while the correlation between stock market and foreign exchange market decreases. The dramatic increase in correlations between a specific nation and other nations may indicate that this nation could trigger a global financial crisis. Specifically, core countries that have higher correlations with other countries and larger Gross Domestic Product (GDP) values spread financial crisis quite effectively, yet some countries with small GDPs like Greece and Cyprus are also effective in propagating systemic risk and spreading global financial crisis.
A research on the application of software defined networking in satellite network architecture
NASA Astrophysics Data System (ADS)
Song, Huan; Chen, Jinqiang; Cao, Suzhi; Cui, Dandan; Li, Tong; Su, Yuxing
2017-10-01
Software defined network is a new type of network architecture, which decouples control plane and data plane of traditional network, has the feature of flexible configurations and is a direction of the next generation terrestrial Internet development. Satellite network is an important part of the space-ground integrated information network, while the traditional satellite network has the disadvantages of difficult network topology maintenance and slow configuration. The application of SDN technology in satellite network can solve these problems that traditional satellite network faces. At present, the research on the application of SDN technology in satellite network is still in the stage of preliminary study. In this paper, we start with introducing the SDN technology and satellite network architecture. Then we mainly introduce software defined satellite network architecture, as well as the comparison of different software defined satellite network architecture and satellite network virtualization. Finally, the present research status and development trend of SDN technology in satellite network are analyzed.
Social network analyzer on the example of Twitter
NASA Astrophysics Data System (ADS)
Gorodetskaia, Mariia; Khruslova, Diana
2017-09-01
Social networks are powerful sources of data due to their popularity. Twitter is one of the networks providing a lot of data. There is need to collect this data for future usage from linguistics to SMM and marketing. The report examines the existing software solutions and provides new ones. The study includes information about the software developed. Some future features are listed.
ERIC Educational Resources Information Center
Russell, Jennifer Lin; Meredith, Julie; Childs, Joshua; Stein, Mary Kay; Prine, Deanna Weber
2015-01-01
This study sought to understand the opportunities and challenges associated with the implementation of state designed Race to the Top (RttT) funded reform networks. Drawing on a conceptual framework developed from the networked governance literature, we analyzed the 12 state RttT grantees' applications. Our analysis revealed that states designed…
Protege Career Aspirations: The Influence of Formal E-Mentor Networks and Family-Based Role Models
ERIC Educational Resources Information Center
DiRenzo, Marco S.; Weer, Christy H.; Linnehan, Frank
2013-01-01
Using longitudinal data from a nine-month e-mentoring program, we analyzed the influence of formal e-mentor networks and family-based role models on increases in both psychosocial and career-related outcomes. Findings indicate that e-mentor network relationship quality positively influenced general- and career-based self-efficacy which, in turn,…
Study of Personalized Network Tutoring System Based on Emotional-cognitive Interaction
NASA Astrophysics Data System (ADS)
Qi, Manfei; Ma, Ding; Wang, Wansen
Aiming at emotion deficiency in present Network tutoring system, a lot of negative effects is analyzed and corresponding countermeasures are proposed. The model of Personalized Network tutoring system based on Emotional-cognitive interaction is constructed in the paper. The key techniques of realizing the system such as constructing emotional model and adjusting teaching strategies are also introduced.
ERIC Educational Resources Information Center
Blickle, Gerhard; Witzki, Alexander H.; Schneider, Paula B.
2009-01-01
Career success of early employees was analyzed from a power perspective and a developmental network perspective. In a predictive field study with 112 employees mentoring support and mentors' power were assessed in the first wave, employees' networking was assessed after two years, and career success (i.e. income and hierarchical position) and…
Child Pornography in Peer-to-Peer Networks
ERIC Educational Resources Information Center
Steel, Chad M. S.
2009-01-01
Objective: The presence of child pornography in peer-to-peer networks is not disputed, but there has been little effort done to quantify and analyze the distribution and nature of that content to-date. By performing an analysis of queries and query hits on the largest peer-to-peer network, we are able to both quantify and describe the nature of…
Advanced Computational Techniques for Power Tube Design.
1986-07-01
fixturing applications, in addition to the existing computer-aided engineering capabilities. o Helix TWT Manufacturing has Implemented a tooling and fixturing...illustrates the ajor features of this computer network. ) The backbone of our system is a Sytek Broadband Network (LAN) which Interconnects terminals and...automatic network analyzer (FANA) which electrically characterizes the slow-wave helices of traveling-wave tubes ( TWTs ) -- both for engineering design
Coexistence: Threat to the Performance of Heterogeneous Network
NASA Astrophysics Data System (ADS)
Sharma, Neetu; Kaur, Amanpreet
2010-11-01
Wireless technology is gaining broad acceptance as users opt for the freedom that only wireless network can provide. Well-accepted wireless communication technologies generally operate in frequency bands that are shared among several users, often using different RF schemes. This is true in particular for WiFi, Bluetooth, and more recently ZigBee. These all three operate in the unlicensed 2.4 GHz band, also known as ISM band, which has been key to the development of a competitive and innovative market for wireless embedded devices. But, as with any resource held in common, it is crucial that those technologies coexist peacefully to allow each user of the band to fulfill its communication goals. This has led to an increase in wireless devices intended for use in IEEE 802.11 wireless local area networks (WLANs) and wireless personal area networks (WPANs), both of which support operation in the crowded 2.4-GHz industrial, scientific and medical (ISM) band. Despite efforts made by standardization bodies to ensure smooth coexistence it may occur that communication technologies transmitting for instance at very different power levels interfere with each other. In particular, it has been pointed out that ZigBee could potentially experience interference from WiFi traffic given that while both protocols can transmit on the same channel, WiFi transmissions usually occur at much higher power level. In this work, we considered a heterogeneous network and analyzed the impact of coexistence between IEEE 802.15.4 and IEEE 802.11b. To evaluate the performance of this network, measurement and simulation study are conducted and developed in the QualNet Network simulator, version 5.0.Model is analyzed for different placement models or topologies such as Random. Grid & Uniform. Performance is analyzed on the basis of characteristics such as throughput, average jitter and average end to end delay. Here, the impact of varying different antenna gain & shadowing model for this heterogeneous network is considered for the purpose of analysis.
How Unstable Are Complex Financial Systems? Analyzing an Inter-bank Network of Credit Relations
NASA Astrophysics Data System (ADS)
Sinha, Sitabhra; Thess, Maximilian; Markose, Sheri
The recent worldwide economic crisis of 2007-09 has focused attention on the need to analyze systemic risk in complex financial networks. We investigate the problem of robustness of such systems in the context of the general theory of dynamical stability in complex networks and, in particular, how the topology of connections influence the risk of the failure of a single institution triggering a cascade of successive collapses propagating through the network. We use data on bilateral liabilities (or exposure) in the derivatives market between 202 financial intermediaries based in USA and Europe in the last quarter of 2009 to empirically investigate the network structure of the over-the-counter (OTC) derivatives market. We observe that the network exhibits both heterogeneity in node properties and the existence of communities. It also has a prominent core-periphery organization and can resist large-scale collapse when subjected to individual bank defaults (however, failure of any bank in the core may result in localized collapse of the innermost core with substantial loss of capital) but is vulnerable to system-wide breakdown as a result of an accompanying liquidity crisis.
Results from using a new dyadic-dependence model to analyze sociocentric physician networks.
Paul, Sudeshna; Keating, Nancy L; Landon, Bruce E; O'Malley, A James
2014-09-01
Professional physician networks can potentially influence clinical practices and quality of care. With the current focus on coordinated care, discerning influences of naturally occurring clusters and other forms of dependence among physicians' relationships based on their attributes and care patterns is an important area of research. In this paper, two directed physician networks: a physician influential conversation network (N = 33) and a physician network obtained from patient visit data (N = 135) are analyzed using a new model that accounts for effect modification of the within-dyad effect of reciprocity and inter-dyad effects involving three (or more) actors. The results from this model include more nuanced effects involving reciprocity and triadic dependence than under incumbent models and more flexible control for these effects in the extraction of other network phenomena, including the relationship between similarity of individuals' attributes (e.g., same-gender, same residency location) and tie-status. In both cases we find extensive evidence of clustering and triadic dependence that if not accounted for confounds the effect of reciprocity and attribute homophily. Findings from our analysis suggest alternative conclusions to those from incumbent models. Copyright © 2014 Elsevier Ltd. All rights reserved.
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.
Cerina, Federica; Zhu, Zhen; Chessa, Alessandro; Riccaboni, Massimo
2015-01-01
Production systems, traditionally analyzed as almost independent national systems, are increasingly connected on a global scale. Only recently becoming available, the World Input-Output Database (WIOD) is one of the first efforts to construct the global multi-regional input-output (GMRIO) tables. By viewing the world input-output system as an interdependent network where the nodes are the individual industries in different economies and the edges are the monetary goods flows between industries, we analyze respectively the global, regional, and local network properties of the so-called world input-output network (WION) and document its evolution over time. At global level, we find that the industries are highly but asymmetrically connected, which implies that micro shocks can lead to macro fluctuations. At regional level, we find that the world production is still operated nationally or at most regionally as the communities detected are either individual economies or geographically well defined regions. Finally, at local level, for each industry we compare the network-based measures with the traditional methods of backward linkages. We find that the network-based measures such as PageRank centrality and community coreness measure can give valuable insights into identifying the key industries. PMID:26222389
Is Multitask Deep Learning Practical for Pharma?
Ramsundar, Bharath; Liu, Bowen; Wu, Zhenqin; Verras, Andreas; Tudor, Matthew; Sheridan, Robert P; Pande, Vijay
2017-08-28
Multitask deep learning has emerged as a powerful tool for computational drug discovery. However, despite a number of preliminary studies, multitask deep networks have yet to be widely deployed in the pharmaceutical and biotech industries. This lack of acceptance stems from both software difficulties and lack of understanding of the robustness of multitask deep networks. Our work aims to resolve both of these barriers to adoption. We introduce a high-quality open-source implementation of multitask deep networks as part of the DeepChem open-source platform. Our implementation enables simple python scripts to construct, fit, and evaluate sophisticated deep models. We use our implementation to analyze the performance of multitask deep networks and related deep models on four collections of pharmaceutical data (three of which have not previously been analyzed in the literature). We split these data sets into train/valid/test using time and neighbor splits to test multitask deep learning performance under challenging conditions. Our results demonstrate that multitask deep networks are surprisingly robust and can offer strong improvement over random forests. Our analysis and open-source implementation in DeepChem provide an argument that multitask deep networks are ready for widespread use in commercial drug discovery.
Robust Analysis of Network-Based Real-Time Kinematic for GNSS-Derived Heights.
Bae, Tae-Suk; Grejner-Brzezinska, Dorota; Mader, Gerald; Dennis, Michael
2015-10-26
New guidelines and procedures for real-time (RT) network-based solutions are required in order to support Global Navigation Satellite System (GNSS) derived heights. Two kinds of experiments were carried out to analyze the performance of the network-based real-time kinematic (RTK) solutions. New test marks were installed in different surrounding environments, and the existing GPS benchmarks were used for analyzing the effect of different factors, such as baseline lengths, antenna types, on the final accuracy and reliability of the height estimation. The RT solutions are categorized into three groups: single-base RTK, multiple-epoch network RTK (mRTN), and single-epoch network RTK (sRTN). The RTK solution can be biased up to 9 mm depending on the surrounding environment, but there was no notable bias for a longer reference base station (about 30 km) In addition, the occupation time for the network RTK was investigated in various cases. There is no explicit bias in the solution for different durations, but smoother results were obtained for longer durations. Further investigation is needed into the effect of changing the occupation time between solutions and into the possibility of using single-epoch solutions in precise determination of heights by GNSS.
Nitti, Mariangela; Ciavolino, Enrico; Salvatore, Sergio; Gennaro, Alessandro
2010-09-01
The authors propose a method for analyzing the psychotherapy process: discourse flow analysis (DFA). DFA is a technique representing the verbal interaction between therapist and patient as a discourse network, aimed at measuring the therapist-patient discourse ability to generate new meanings through time. DFA assumes that the main function of psychotherapy is to produce semiotic novelty. DFA is applied to the verbatim transcript of the psychotherapy. It defines the main meanings active within the therapeutic discourse by means of the combined use of text analysis and statistical techniques. Subsequently, it represents the dynamic interconnections among these meanings in terms of a "discursive network." The dynamic and structural indexes of the discursive network have been shown to provide a valid representation of the patient-therapist communicative flow as well as an estimation of its clinical quality. Finally, a neural network is designed specifically to identify patterns of functioning of the discursive network and to verify the clinical validity of these patterns in terms of their association with specific phases of the psychotherapy process. An application of the DFA to a case of psychotherapy is provided to illustrate the method and the kinds of results it produces.
Xu, Ronghua; Wong, Wing-Keung; Chen, Guanrong; Huang, Shuo
2017-01-01
In this paper, we analyze the relationship among stock networks by focusing on the statistically reliable connectivity between financial time series, which accurately reflects the underlying pure stock structure. To do so, we firstly filter out the effect of market index on the correlations between paired stocks, and then take a t-test based P-threshold approach to lessening the complexity of the stock network based on the P values. We demonstrate the superiority of its performance in understanding network complexity by examining the Hong Kong stock market. By comparing with other filtering methods, we find that the P-threshold approach extracts purely and significantly correlated stock pairs, which reflect the well-defined hierarchical structure of the market. In analyzing the dynamic stock networks with fixed-size moving windows, our results show that three global financial crises, covered by the long-range time series, can be distinguishingly indicated from the network topological and evolutionary perspectives. In addition, we find that the assortativity coefficient can manifest the financial crises and therefore can serve as a good indicator of the financial market development. PMID:28145494
Networking between Practitioners and Academics in Law Enforcement.
ERIC Educational Resources Information Center
Caldwell, Dean S.; Dorling, Ernest W.
1995-01-01
A survey analyzing networking and contact with colleagues received 159 of 307 responses, 73% from criminal justice practitioners and 27% from criminal justice faculty. Apparent differences in communication practices disappear when educational level and research involvement are considered. (SK)
Modeling socio-cultural processes in network-centric environments
NASA Astrophysics Data System (ADS)
Santos, Eunice E.; Santos, Eugene, Jr.; Korah, John; George, Riya; Gu, Qi; Kim, Keumjoo; Li, Deqing; Russell, Jacob; Subramanian, Suresh
2012-05-01
The major focus in the field of modeling & simulation for network centric environments has been on the physical layer while making simplifications for the human-in-the-loop. However, the human element has a big impact on the capabilities of network centric systems. Taking into account the socio-behavioral aspects of processes such as team building, group decision-making, etc. are critical to realistically modeling and analyzing system performance. Modeling socio-cultural processes is a challenge because of the complexity of the networks, dynamism in the physical and social layers, feedback loops and uncertainty in the modeling data. We propose an overarching framework to represent, model and analyze various socio-cultural processes within network centric environments. The key innovation in our methodology is to simultaneously model the dynamism in both the physical and social layers while providing functional mappings between them. We represent socio-cultural information such as friendships, professional relationships and temperament by leveraging the Culturally Infused Social Network (CISN) framework. The notion of intent is used to relate the underlying socio-cultural factors to observed behavior. We will model intent using Bayesian Knowledge Bases (BKBs), a probabilistic reasoning network, which can represent incomplete and uncertain socio-cultural information. We will leverage previous work on a network performance modeling framework called Network-Centric Operations Performance and Prediction (N-COPP) to incorporate dynamism in various aspects of the physical layer such as node mobility, transmission parameters, etc. We validate our framework by simulating a suitable scenario, incorporating relevant factors and providing analyses of the results.
Multirelational organization of large-scale social networks in an online world
Szell, Michael; Lambiotte, Renaud; Thurner, Stefan
2010-01-01
The capacity to collect fingerprints of individuals in online media has revolutionized the way researchers explore human society. Social systems can be seen as a nonlinear superposition of a multitude of complex social networks, where nodes represent individuals and links capture a variety of different social relations. Much emphasis has been put on the network topology of social interactions, however, the multidimensional nature of these interactions has largely been ignored, mostly because of lack of data. Here, for the first time, we analyze a complete, multirelational, large social network of a society consisting of the 300,000 odd players of a massive multiplayer online game. We extract networks of six different types of one-to-one interactions between the players. Three of them carry a positive connotation (friendship, communication, trade), three a negative (enmity, armed aggression, punishment). We first analyze these types of networks as separate entities and find that negative interactions differ from positive interactions by their lower reciprocity, weaker clustering, and fatter-tail degree distribution. We then explore how the interdependence of different network types determines the organization of the social system. In particular, we study correlations and overlap between different types of links and demonstrate the tendency of individuals to play different roles in different networks. As a demonstration of the power of the approach, we present the first empirical large-scale verification of the long-standing structural balance theory, by focusing on the specific multiplex network of friendship and enmity relations. PMID:20643965
Chinese lexical networks: The structure, function and formation
NASA Astrophysics Data System (ADS)
Li, Jianyu; Zhou, Jie; Luo, Xiaoyue; Yang, Zhanxin
2012-11-01
In this paper Chinese phrases are modeled using complex networks theory. We analyze statistical properties of the networks and find that phrase networks display some important features: not only small world and the power-law distribution, but also hierarchical structure and disassortative mixing. These statistical traits display the global organization of Chinese phrases. The origin and formation of such traits are analyzed from a macroscopic Chinese culture and philosophy perspective. It is interesting to find that Chinese culture and philosophy may shape the formation and structure of Chinese phrases. To uncover the structural design principles of networks, network motif patterns are studied. It is shown that they serve as basic building blocks to form the whole phrase networks, especially triad 38 (feed forward loop) plays a more important role in forming most of the phrases and other motifs. The distinct structure may not only keep the networks stable and robust, but also be helpful for information processing. The results of the paper can give some insight into Chinese language learning and language acquisition. It strengthens the idea that learning the phrases helps to understand Chinese culture. On the other side, understanding Chinese culture and philosophy does help to learn Chinese phrases. The hub nodes in the networks show the close relationship with Chinese culture and philosophy. Learning or teaching the hub characters, hub-linking phrases and phrases which are meaning related based on motif feature should be very useful and important for Chinese learning and acquisition.
Minimum spanning tree analysis of the human connectome
Sommer, Iris E.; Bohlken, Marc M.; Tewarie, Prejaas; Draaisma, Laurijn; Zalesky, Andrew; Di Biase, Maria; Brown, Jesse A.; Douw, Linda; Otte, Willem M.; Mandl, René C.W.; Stam, Cornelis J.
2018-01-01
Abstract One of the challenges of brain network analysis is to directly compare network organization between subjects, irrespective of the number or strength of connections. In this study, we used minimum spanning tree (MST; a unique, acyclic subnetwork with a fixed number of connections) analysis to characterize the human brain network to create an empirical reference network. Such a reference network could be used as a null model of connections that form the backbone structure of the human brain. We analyzed the MST in three diffusion‐weighted imaging datasets of healthy adults. The MST of the group mean connectivity matrix was used as the empirical null‐model. The MST of individual subjects matched this reference MST for a mean 58%–88% of connections, depending on the analysis pipeline. Hub nodes in the MST matched with previously reported locations of hub regions, including the so‐called rich club nodes (a subset of high‐degree, highly interconnected nodes). Although most brain network studies have focused primarily on cortical connections, cortical–subcortical connections were consistently present in the MST across subjects. Brain network efficiency was higher when these connections were included in the analysis, suggesting that these tracts may be utilized as the major neural communication routes. Finally, we confirmed that MST characteristics index the effects of brain aging. We conclude that the MST provides an elegant and straightforward approach to analyze structural brain networks, and to test network topological features of individual subjects in comparison to empirical null models. PMID:29468769
Multirelational organization of large-scale social networks in an online world.
Szell, Michael; Lambiotte, Renaud; Thurner, Stefan
2010-08-03
The capacity to collect fingerprints of individuals in online media has revolutionized the way researchers explore human society. Social systems can be seen as a nonlinear superposition of a multitude of complex social networks, where nodes represent individuals and links capture a variety of different social relations. Much emphasis has been put on the network topology of social interactions, however, the multidimensional nature of these interactions has largely been ignored, mostly because of lack of data. Here, for the first time, we analyze a complete, multirelational, large social network of a society consisting of the 300,000 odd players of a massive multiplayer online game. We extract networks of six different types of one-to-one interactions between the players. Three of them carry a positive connotation (friendship, communication, trade), three a negative (enmity, armed aggression, punishment). We first analyze these types of networks as separate entities and find that negative interactions differ from positive interactions by their lower reciprocity, weaker clustering, and fatter-tail degree distribution. We then explore how the interdependence of different network types determines the organization of the social system. In particular, we study correlations and overlap between different types of links and demonstrate the tendency of individuals to play different roles in different networks. As a demonstration of the power of the approach, we present the first empirical large-scale verification of the long-standing structural balance theory, by focusing on the specific multiplex network of friendship and enmity relations.
Organization of complex networks
NASA Astrophysics Data System (ADS)
Kitsak, Maksim
Many large complex systems can be successfully analyzed using the language of graphs and networks. Interactions between the objects in a network are treated as links connecting nodes. This approach to understanding the structure of networks is an important step toward understanding the way corresponding complex systems function. Using the tools of statistical physics, we analyze the structure of networks as they are found in complex systems such as the Internet, the World Wide Web, and numerous industrial and social networks. In the first chapter we apply the concept of self-similarity to the study of transport properties in complex networks. Self-similar or fractal networks, unlike non-fractal networks, exhibit similarity on a range of scales. We find that these fractal networks have transport properties that differ from those of non-fractal networks. In non-fractal networks, transport flows primarily through the hubs. In fractal networks, the self-similar structure requires any transport to also flow through nodes that have only a few connections. We also study, in models and in real networks, the crossover from fractal to non-fractal networks that occurs when a small number of random interactions are added by means of scaling techniques. In the second chapter we use k-core techniques to study dynamic processes in networks. The k-core of a network is the network's largest component that, within itself, exhibits all nodes with at least k connections. We use this k-core analysis to estimate the relative leadership positions of firms in the Life Science (LS) and Information and Communication Technology (ICT) sectors of industry. We study the differences in the k-core structure between the LS and the ICT sectors. We find that the lead segment (highest k-core) of the LS sector, unlike that of the ICT sector, is remarkably stable over time: once a particular firm enters the lead segment, it is likely to remain there for many years. In the third chapter we study how epidemics spread though networks. Our results indicate that a virus is more likely to infect a large area of a network if it originates at a node contained within k-core of high index k.
Towards a Methodology for Validation of Centrality Measures in Complex Networks
2014-01-01
Background Living systems are associated with Social networks — networks made up of nodes, some of which may be more important in various aspects as compared to others. While different quantitative measures labeled as “centralities” have previously been used in the network analysis community to find out influential nodes in a network, it is debatable how valid the centrality measures actually are. In other words, the research question that remains unanswered is: how exactly do these measures perform in the real world? So, as an example, if a centrality of a particular node identifies it to be important, is the node actually important? Purpose The goal of this paper is not just to perform a traditional social network analysis but rather to evaluate different centrality measures by conducting an empirical study analyzing exactly how do network centralities correlate with data from published multidisciplinary network data sets. Method We take standard published network data sets while using a random network to establish a baseline. These data sets included the Zachary's Karate Club network, dolphin social network and a neural network of nematode Caenorhabditis elegans. Each of the data sets was analyzed in terms of different centrality measures and compared with existing knowledge from associated published articles to review the role of each centrality measure in the determination of influential nodes. Results Our empirical analysis demonstrates that in the chosen network data sets, nodes which had a high Closeness Centrality also had a high Eccentricity Centrality. Likewise high Degree Centrality also correlated closely with a high Eigenvector Centrality. Whereas Betweenness Centrality varied according to network topology and did not demonstrate any noticeable pattern. In terms of identification of key nodes, we discovered that as compared with other centrality measures, Eigenvector and Eccentricity Centralities were better able to identify important nodes. PMID:24709999
Modeling MAC layer for powerline communications networks
NASA Astrophysics Data System (ADS)
Hrasnica, Halid; Haidine, Abdelfatteh
2001-02-01
The usage of electrical power distribution networks for voice and data transmission, called Powerline Communications, becomes nowadays more and more attractive, particularly in the telecommunication access area. The most important reasons for that are the deregulation of the telecommunication market and a fact that the access networks are still property of former monopolistic companies. In this work, first we analyze a PLC network and system structure as well as a disturbance scenario in powerline networks. After that, we define a logical structure of the powerline MAC layer and propose the reservation MAC protocols for the usage in the PLC network which provides collision free data transmission. This makes possible better network utilization and realization of QoS guarantees which can make PLC networks competitive to other access technologies.
Plasmodial vein networks of the slime mold Physarum polycephalum form regular graphs
NASA Astrophysics Data System (ADS)
Baumgarten, Werner; Ueda, Tetsuo; Hauser, Marcus J. B.
2010-10-01
The morphology of a typical developing biological transportation network, the vein network of the plasmodium of the myxomycete Physarum polycephalum is analyzed during its free extension. The network forms a classical, regular graph, and has exclusively nodes of degree 3. This contrasts to most real-world transportation networks which show small-world or scale-free properties. The complexity of the vein network arises from the weighting of the lengths, widths, and areas of the vein segments. The lengths and areas follow exponential distributions, while the widths are distributed log-normally. These functional dependencies are robust during the entire evolution of the network, even though the exponents change with time due to the coarsening of the vein network.
Plasmodial vein networks of the slime mold Physarum polycephalum form regular graphs.
Baumgarten, Werner; Ueda, Tetsuo; Hauser, Marcus J B
2010-10-01
The morphology of a typical developing biological transportation network, the vein network of the plasmodium of the myxomycete Physarum polycephalum is analyzed during its free extension. The network forms a classical, regular graph, and has exclusively nodes of degree 3. This contrasts to most real-world transportation networks which show small-world or scale-free properties. The complexity of the vein network arises from the weighting of the lengths, widths, and areas of the vein segments. The lengths and areas follow exponential distributions, while the widths are distributed log-normally. These functional dependencies are robust during the entire evolution of the network, even though the exponents change with time due to the coarsening of the vein network.
Multi-scale modularity and motif distributional effect in metabolic networks.
Gao, Shang; Chen, Alan; Rahmani, Ali; Zeng, Jia; Tan, Mehmet; Alhajj, Reda; Rokne, Jon; Demetrick, Douglas; Wei, Xiaohui
2016-01-01
Metabolism is a set of fundamental processes that play important roles in a plethora of biological and medical contexts. It is understood that the topological information of reconstructed metabolic networks, such as modular organization, has crucial implications on biological functions. Recent interpretations of modularity in network settings provide a view of multiple network partitions induced by different resolution parameters. Here we ask the question: How do multiple network partitions affect the organization of metabolic networks? Since network motifs are often interpreted as the super families of evolved units, we further investigate their impact under multiple network partitions and investigate how the distribution of network motifs influences the organization of metabolic networks. We studied Homo sapiens, Saccharomyces cerevisiae and Escherichia coli metabolic networks; we analyzed the relationship between different community structures and motif distribution patterns. Further, we quantified the degree to which motifs participate in the modular organization of metabolic networks.
Radar signal categorization using a neural network
NASA Technical Reports Server (NTRS)
Anderson, James A.; Gately, Michael T.; Penz, P. Andrew; Collins, Dean R.
1991-01-01
Neural networks were used to analyze a complex simulated radar environment which contains noisy radar pulses generated by many different emitters. The neural network used is an energy minimizing network (the BSB model) which forms energy minima - attractors in the network dynamical system - based on learned input data. The system first determines how many emitters are present (the deinterleaving problem). Pulses from individual simulated emitters give rise to separate stable attractors in the network. Once individual emitters are characterized, it is possible to make tentative identifications of them based on their observed parameters. As a test of this idea, a neural network was used to form a small data base that potentially could make emitter identifications.
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.
Stability of a giant connected component in a complex network
NASA Astrophysics Data System (ADS)
Kitsak, Maksim; Ganin, Alexander A.; Eisenberg, Daniel A.; Krapivsky, Pavel L.; Krioukov, Dmitri; Alderson, David L.; Linkov, Igor
2018-01-01
We analyze the stability of the network's giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network consists of the same nodes, regardless of the specific set of deactivated links. Our results are intuitive in the case of single-layered systems: the presence of large degree nodes in a single-layered network ensures both its robustness and stability. In contrast, we find that interdependent networks that are robust to adverse events have unstable connected components. Our results bring novel insights to the design of resilient network topologies and the reinforcement of existing networked systems.
Nonequilibrium transitions in complex networks: A model of social interaction
NASA Astrophysics Data System (ADS)
Klemm, Konstantin; Eguíluz, Víctor M.; Toral, Raúl; San Miguel, Maxi
2003-02-01
We analyze the nonequilibrium order-disorder transition of Axelrod’s model of social interaction in several complex networks. In a small-world network, we find a transition between an ordered homogeneous state and a disordered state. The transition point is shifted by the degree of spatial disorder of the underlying network, the network disorder favoring ordered configurations. In random scale-free networks the transition is only observed for finite size systems, showing system size scaling, while in the thermodynamic limit only ordered configurations are always obtained. Thus, in the thermodynamic limit the transition disappears. However, in structured scale-free networks, the phase transition between an ordered and a disordered phase is restored.
Identifying Jets Using Artifical Neural Networks
NASA Astrophysics Data System (ADS)
Rosand, Benjamin; Caines, Helen; Checa, Sofia
2017-09-01
We investigate particle jet interactions with the Quark Gluon Plasma (QGP) using artificial neural networks modeled on those used in computer image recognition. We create jet images by binning jet particles into pixels and preprocessing every image. We analyzed the jets with a Multi-layered maxout network and a convolutional network. We demonstrate each network's effectiveness in differentiating simulated quenched jets from unquenched jets, and we investigate the method that the network uses to discriminate among different quenched jet simulations. Finally, we develop a greater understanding of the physics behind quenched jets by investigating what the network learnt as well as its effectiveness in differentiating samples. Yale College Freshman Summer Research Fellowship in the Sciences and Engineering.
Kinetic signature of fractal-like filament networks formed by orientational linear epitaxy.
Hwang, Wonmuk; Eryilmaz, Esma
2014-07-11
We study a broad class of epitaxial assembly of filament networks on lattice surfaces. Over time, a scale-free behavior emerges with a 2.5-3 power-law exponent in filament length distribution. Partitioning between the power-law and exponential behaviors in a network can be used to find the stage and kinetic parameters of the assembly process. To analyze real-world networks, we develop a computer program that measures the network architecture in experimental images. Application to triaxial networks of collagen fibrils shows quantitative agreement with our model. Our unifying approach can be used for characterizing and controlling the network formation that is observed across biological and nonbiological systems.
NASA Astrophysics Data System (ADS)
Almalaq, Yasser; Matin, Mohammad A.
2014-09-01
The broadband passive optical network (BPON) has the ability to support high-speed data, voice, and video services to home and small businesses customers. In this work, the performance of bi-directional BPON is analyzed for both down and up streams traffic cases by the help of erbium doped fiber amplifier (EDFA). The importance of BPON is reduced cost. Because PBON uses a splitter the cost of the maintenance between the providers and the customers side is suitable. In the proposed research, BPON has been tested by the use of bit error rate (BER) analyzer. BER analyzer realizes maximum Q factor, minimum bit error rate, and eye height.
Lavigne, Katie M; Woodward, Todd S
2018-04-01
Hypercoupling of activity in speech-perception-specific brain networks has been proposed to play a role in the generation of auditory-verbal hallucinations (AVHs) in schizophrenia; however, it is unclear whether this hypercoupling extends to nonverbal auditory perception. We investigated this by comparing schizophrenia patients with and without AVHs, and healthy controls, on task-based functional magnetic resonance imaging (fMRI) data combining verbal speech perception (SP), inner verbal thought generation (VTG), and nonverbal auditory oddball detection (AO). Data from two previously published fMRI studies were simultaneously analyzed using group constrained principal component analysis for fMRI (group fMRI-CPCA), which allowed for comparison of task-related functional brain networks across groups and tasks while holding the brain networks under study constant, leading to determination of the degree to which networks are common to verbal and nonverbal perception conditions, and which show coordinated hyperactivity in hallucinations. Three functional brain networks emerged: (a) auditory-motor, (b) language processing, and (c) default-mode (DMN) networks. Combining the AO and sentence tasks allowed the auditory-motor and language networks to separately emerge, whereas they were aggregated when individual tasks were analyzed. AVH patients showed greater coordinated activity (deactivity for DMN regions) than non-AVH patients during SP in all networks, but this did not extend to VTG or AO. This suggests that the hypercoupling in AVH patients in speech-perception-related brain networks is specific to perceived speech, and does not extend to perceived nonspeech or inner verbal thought generation. © 2017 Wiley Periodicals, Inc.
LENS: web-based lens for enrichment and network studies of human proteins
2015-01-01
Background Network analysis is a common approach for the study of genetic view of diseases and biological pathways. Typically, when a set of genes are identified to be of interest in relation to a disease, say through a genome wide association study (GWAS) or a different gene expression study, these genes are typically analyzed in the context of their protein-protein interaction (PPI) networks. Further analysis is carried out to compute the enrichment of known pathways and disease-associations in the network. Having tools for such analysis at the fingertips of biologists without the requirement for computer programming or curation of data would accelerate the characterization of genes of interest. Currently available tools do not integrate network and enrichment analysis and their visualizations, and most of them present results in formats not most conducive to human cognition. Results We developed the tool Lens for Enrichment and Network Studies of human proteins (LENS) that performs network and pathway and diseases enrichment analyses on genes of interest to users. The tool creates a visualization of the network, provides easy to read statistics on network connectivity, and displays Venn diagrams with statistical significance values of the network's association with drugs, diseases, pathways, and GWASs. We used the tool to analyze gene sets related to craniofacial development, autism, and schizophrenia. Conclusion LENS is a web-based tool that does not require and download or plugins to use. The tool is free and does not require login for use, and is available at http://severus.dbmi.pitt.edu/LENS. PMID:26680011
NASA Astrophysics Data System (ADS)
Ji, Xingpei; Wang, Bo; Liu, Dichen; Dong, Zhaoyang; Chen, Guo; Zhu, Zhenshan; Zhu, Xuedong; Wang, Xunting
2016-10-01
Whether the realistic electrical cyber-physical interdependent networks will undergo first-order transition under random failures still remains a question. To reflect the reality of Chinese electrical cyber-physical system, the "partial one-to-one correspondence" interdependent networks model is proposed and the connectivity vulnerabilities of three realistic electrical cyber-physical interdependent networks are analyzed. The simulation results show that due to the service demands of power system the topologies of power grid and its cyber network are highly inter-similar which can effectively avoid the first-order transition. By comparing the vulnerability curves between electrical cyber-physical interdependent networks and its single-layer network, we find that complex network theory is still useful in the vulnerability analysis of electrical cyber-physical interdependent networks.
A queueing network model to analyze the impact of parallelization of care on patient cycle time.
Jiang, Lixiang; Giachetti, Ronald E
2008-09-01
The total time a patient spends in an outpatient facility, called the patient cycle time, is a major contributor to overall patient satisfaction. A frequently recommended strategy to reduce the total time is to perform some activities in parallel thereby shortening patient cycle time. To analyze patient cycle time this paper extends and improves upon existing multi-class open queueing network model (MOQN) so that the patient flow in an urgent care center can be modeled. Results of the model are analyzed using data from an urgent care center contemplating greater parallelization of patient care activities. The results indicate that parallelization can reduce the cycle time for those patient classes which require more than one diagnostic and/ or treatment intervention. However, for many patient classes there would be little if any improvement, indicating the importance of tools to analyze business process reengineering rules. The paper makes contributions by implementing an approximation for fork/join queues in the network and by improving the approximation for multiple server queues in both low traffic and high traffic conditions. We demonstrate the accuracy of the MOQN results through comparisons to simulation results.
Percolation of a general network of networks.
Gao, Jianxi; Buldyrev, Sergey V; Stanley, H Eugene; Xu, Xiaoming; Havlin, Shlomo
2013-12-01
Percolation theory is an approach to study the vulnerability of a system. We develop an analytical framework and analyze the percolation properties of a network composed of interdependent networks (NetONet). Typically, percolation of a single network shows that the damage in the network due to a failure is a continuous function of the size of the failure, i.e., the fraction of failed nodes. In sharp contrast, in NetONet, due to the cascading failures, the percolation transition may be discontinuous and even a single node failure may lead to an abrupt collapse of the system. We demonstrate our general framework for a NetONet composed of n classic Erdős-Rényi (ER) networks, where each network depends on the same number m of other networks, i.e., for a random regular network (RR) formed of interdependent ER networks. The dependency between nodes of different networks is taken as one-to-one correspondence, i.e., a node in one network can depend only on one node in the other network (no-feedback condition). In contrast to a treelike NetONet in which the size of the largest connected cluster (mutual component) depends on n, the loops in the RR NetONet cause the largest connected cluster to depend only on m and the topology of each network but not on n. We also analyzed the extremely vulnerable feedback condition of coupling, where the coupling between nodes of different networks is not one-to-one correspondence. In the case of NetONet formed of ER networks, percolation only exhibits two phases, a second order phase transition and collapse, and no first order percolation transition regime is found in the case of the no-feedback condition. In the case of NetONet composed of RR networks, there exists a first order phase transition when the coupling strength q (fraction of interdependency links) is large and a second order phase transition when q is small. Our insight on the resilience of coupled networks might help in designing robust interdependent systems.
Research on dynamic routing mechanisms in wireless sensor networks.
Zhao, A Q; Weng, Y N; Lu, Y; Liu, C Y
2014-01-01
WirelessHART is the most widely applied standard in wireless sensor networks nowadays. However, it does not provide any dynamic routing mechanism, which is important for the reliability and robustness of the wireless network applications. In this paper, a collection tree protocol based, dynamic routing mechanism was proposed for WirelessHART network. The dynamic routing mechanism was evaluated through several simulation experiments in three aspects: time for generating the topology, link quality, and stability of network. Besides, the data transmission efficiency of this routing mechanism was analyzed. The simulation and evaluation results show that this mechanism can act as a dynamic routing mechanism for the TDMA-based wireless sensor network.
NASA Astrophysics Data System (ADS)
Frahm, K. M.; Shepelyansky, D. L.
2012-10-01
We construct the Google matrix of the entire Twitter network, dated by July 2009, and analyze its spectrum and eigenstate properties including the PageRank and CheiRank vectors and 2DRanking of all nodes. Our studies show much stronger inter-connectivity between top PageRank nodes for the Twitter network compared to the networks of Wikipedia and British Universities studied previously. Our analysis allows to locate the top Twitter users which control the information flow on the network. We argue that this small fraction of the whole number of users, which can be viewed as the social network elite, plays the dominant role in the process of opinion formation on the network.
Signature neural networks: definition and application to multidimensional sorting problems.
Latorre, Roberto; de Borja Rodriguez, Francisco; Varona, Pablo
2011-01-01
In this paper we present a self-organizing neural network paradigm that is able to discriminate information locally using a strategy for information coding and processing inspired in recent findings in living neural systems. The proposed neural network uses: 1) neural signatures to identify each unit in the network; 2) local discrimination of input information during the processing; and 3) a multicoding mechanism for information propagation regarding the who and the what of the information. The local discrimination implies a distinct processing as a function of the neural signature recognition and a local transient memory. In the context of artificial neural networks none of these mechanisms has been analyzed in detail, and our goal is to demonstrate that they can be used to efficiently solve some specific problems. To illustrate the proposed paradigm, we apply it to the problem of multidimensional sorting, which can take advantage of the local information discrimination. In particular, we compare the results of this new approach with traditional methods to solve jigsaw puzzles and we analyze the situations where the new paradigm improves the performance.
Cross-Domain Analogies as Relating Derived Relations among Two Separate Relational Networks
Ruiz, Francisco J; Luciano, Carmen
2011-01-01
Contemporary behavior analytic research is making headway in analyzing analogy as the establishment of a relation of coordination among common types of trained or derived relations. Previous studies have been focused on within-domain analogy. The current study expands previous research by analyzing cross-domain analogy as relating relations among separate relational networks and by correlating participants' performance with a standard measure of analogical reasoning. In two experiments, adult participants first completed general intelligence and analogical reasoning tests. Subsequently, they were exposed to a computerized conditional discrimination training procedure designed to create two relational networks, each consisting of two 3-member equivalence classes. The critical test was a two-part analogical test in which participants had to relate combinatorial relations of coordination and distinction between the two relational networks. In Experiment 1, combinatorial relations for each network were individually tested prior to analogical testing, but in Experiment 2 they were not. Across both experiments, 65% of participants passed the analogical test on the first attempt. Moreover, results from the training procedure were strongly correlated with the standard measure of analogical reasoning. PMID:21547072
NASA Astrophysics Data System (ADS)
Guo, Liyan; Xia, Changliang; Wang, Huimin; Wang, Zhiqiang; Shi, Tingna
2018-05-01
As is well known, the armature current will be ahead of the back electromotive force (back-EMF) under load condition of the interior permanent magnet (PM) machine. This kind of advanced armature current will produce a demagnetizing field, which may make irreversible demagnetization appeared in PMs easily. To estimate the working points of PMs more accurately and take demagnetization under consideration in the early design stage of a machine, an improved equivalent magnetic network model is established in this paper. Each PM under each magnetic pole is segmented, and the networks in the rotor pole shoe are refined, which makes a more precise model of the flux path in the rotor pole shoe possible. The working point of each PM under each magnetic pole can be calculated accurately by the established improved equivalent magnetic network model. Meanwhile, the calculated results are compared with those calculated by FEM. And the effects of d-axis component and q-axis component of armature current, air-gap length and flux barrier size on working points of PMs are analyzed by the improved equivalent magnetic network model.
NASA Astrophysics Data System (ADS)
Rangaswamy, T.; Vidhyashankar, S.; Madhusudan, M.; Bharath Shekar, H. R.
2015-04-01
The current trends of engineering follow the basic rule of innovation in mechanical engineering aspects. For the engineers to be efficient, problem solving aspects need to be viewed in a multidimensional perspective. One such methodology implemented is the fusion of technologies from other disciplines in order to solve the problems. This paper mainly deals with the application of Neural Networks in order to analyze the performance parameters of an XD3P Peugeot engine (used in Ministry of Defence). The basic propaganda of the work is divided into two main working stages. In the former stage, experimentation of an IC engine is carried out in order to obtain the primary data. In the latter stage the primary database formed is used to design and implement a predictive neural network in order to analyze the output parameters variation with respect to each other. A mathematical governing equation for the neural network is obtained. The obtained polynomial equation describes the characteristic behavior of the built neural network system. Finally, a comparative study of the results is carried out.
Network Analysis Tools: from biological networks to clusters and pathways.
Brohée, Sylvain; Faust, Karoline; Lima-Mendez, Gipsi; Vanderstocken, Gilles; van Helden, Jacques
2008-01-01
Network Analysis Tools (NeAT) is a suite of computer tools that integrate various algorithms for the analysis of biological networks: comparison between graphs, between clusters, or between graphs and clusters; network randomization; analysis of degree distribution; network-based clustering and path finding. The tools are interconnected to enable a stepwise analysis of the network through a complete analytical workflow. In this protocol, we present a typical case of utilization, where the tasks above are combined to decipher a protein-protein interaction network retrieved from the STRING database. The results returned by NeAT are typically subnetworks, networks enriched with additional information (i.e., clusters or paths) or tables displaying statistics. Typical networks comprising several thousands of nodes and arcs can be analyzed within a few minutes. The complete protocol can be read and executed in approximately 1 h.
Hyperbolicity measures democracy in real-world networks
NASA Astrophysics Data System (ADS)
Borassi, Michele; Chessa, Alessandro; Caldarelli, Guido
2015-09-01
In this work, we analyze the hyperbolicity of real-world networks, a geometric quantity that measures if a space is negatively curved. We provide two improvements in our understanding of this quantity: first of all, in our interpretation, a hyperbolic network is "aristocratic", since few elements "connect" the system, while a non-hyperbolic network has a more "democratic" structure with a larger number of crucial elements. The second contribution is the introduction of the average hyperbolicity of the neighbors of a given node. Through this definition, we outline an "influence area" for the vertices in the graph. We show that in real networks the influence area of the highest degree vertex is small in what we define "local" networks (i.e., social or peer-to-peer networks), and large in "global" networks (i.e., power grid, metabolic networks, or autonomous system networks).
Advanced functional network analysis in the geosciences: The pyunicorn package
NASA Astrophysics Data System (ADS)
Donges, Jonathan F.; Heitzig, Jobst; Runge, Jakob; Schultz, Hanna C. H.; Wiedermann, Marc; Zech, Alraune; Feldhoff, Jan; Rheinwalt, Aljoscha; Kutza, Hannes; Radebach, Alexander; Marwan, Norbert; Kurths, Jürgen
2013-04-01
Functional networks are a powerful tool for analyzing large geoscientific datasets such as global fields of climate time series originating from observations or model simulations. pyunicorn (pythonic unified complex network and recurrence analysis toolbox) is an open-source, fully object-oriented and easily parallelizable package written in the language Python. It allows for constructing functional networks (aka climate networks) representing the structure of statistical interrelationships in large datasets and, subsequently, investigating this structure using advanced methods of complex network theory such as measures for networks of interacting networks, node-weighted statistics or network surrogates. Additionally, pyunicorn allows to study the complex dynamics of geoscientific systems as recorded by time series by means of recurrence networks and visibility graphs. The range of possible applications of the package is outlined drawing on several examples from climatology.
Failure Analysis of Network Based Accessible Pedestrian Signals in Closed-Loop Operation
DOT National Transportation Integrated Search
2011-03-01
The potential failure modes of a network based accessible pedestrian system were analyzed to determine the limitations and benefits of closed-loop operation. The vulnerabilities of the system are accessed using the industry standard process known as ...
A historical perspective of the Global Transportation Network (GTN)
DOT National Transportation Integrated Search
2000-03-01
This thesis analyzes the changes within the Global Transportation Network (GTN)/In Transit Visibility (ITV) feeder systems and the subsequent ITV they provide by comparing the current position to the past and by examining future trends. Up until now,...
Spectral properties of Google matrix of Wikipedia and other networks
NASA Astrophysics Data System (ADS)
Ermann, Leonardo; Frahm, Klaus M.; Shepelyansky, Dima L.
2013-05-01
We study the properties of eigenvalues and eigenvectors of the Google matrix of the Wikipedia articles hyperlink network and other real networks. With the help of the Arnoldi method, we analyze the distribution of eigenvalues in the complex plane and show that eigenstates with significant eigenvalue modulus are located on well defined network communities. We also show that the correlator between PageRank and CheiRank vectors distinguishes different organizations of information flow on BBC and Le Monde web sites.
The role of banks in the Brazilian interbank market: Does bank type matter?
NASA Astrophysics Data System (ADS)
Cajueiro, Daniel O.; Tabak, Benjamin M.
2008-12-01
This paper analyzes the Brazilian interbank network structure using a complex network-based approach. Results suggest a weak evidence of community structure, high heterogeneity of the network and that this market is characterized by money centers having exposures to many banks. Furthermore, we go beyond the structure of the network using information about the characteristics of the nodes and a non-parametric test in order to understand the role of the banks in the interbanking market.
1994-02-01
desired that the problem to which the design space mapping techniques were applied be easily analyzed, yet provide a design space with realistic complexity...consistent fully stressed solution. 3 DESIGN SPACE MAPPING In order to reduce the computational expense required to optimize design spaces, neural networks...employed in this study. Some of the issues involved in using neural networks to do design space mapping are how to configure the neural network, how much
On-board processing satellite network architectures for broadband ISDN
NASA Technical Reports Server (NTRS)
Inukai, Thomas; Faris, Faris; Shyy, Dong-Jye
1992-01-01
Onboard baseband processing architectures for future satellite broadband integrated services digital networks (B-ISDN's) are addressed. To assess the feasibility of implementing satellite B-ISDN services, critical design issues, such as B-ISDN traffic characteristics, transmission link design, and a trade-off between onboard circuit and fast packet switching, are analyzed. Examples of the two types of switching mechanisms and potential onboard network control functions are presented. A sample network architecture is also included to illustrate a potential onboard processing system.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Grudka, Andrzej; National Quantum Information Centre of Gdansk, PL-81-824 Sopot; Horodecki, Pawel
2010-06-15
We analyze quantum network primitives which are entanglement breaking. We show superadditivity of quantum and classical capacity regions for quantum multiple-access channels and the quantum butterfly network. Since the effects are especially visible at high noise they suggest that quantum information effects may be particularly helpful in the case of the networks with occasional high noise rates. The present effects provide a qualitative borderline between superadditivities of bipartite and multipartite systems.
Voting procedures from the perspective of theory of neural networks
NASA Astrophysics Data System (ADS)
Suleimenov, Ibragim; Panchenko, Sergey; Gabrielyan, Oleg; Pak, Ivan
2016-11-01
It is shown that voting procedure in any authority can be treated as Hopfield neural network analogue. It was revealed that weight coefficients of neural network which has discrete outputs -1 and 1 can be replaced by coefficients of a discrete set (-1, 0, 1). This gives us the opportunity to qualitatively analyze the voting procedure on the basis of limited data about mutual influence of members. It also proves that result of voting procedure is actually taken by network formed by voting members.
NASA Astrophysics Data System (ADS)
Sakata, Akio; Ito, Norio; Kawamoto, Atsushi; Shiraki, Wataru
For road networks in mountain site which are very important infrastructures for rescue and support operations in disaster, a study on preparing the BCP for local administrations at less favored area considering subsisted risk analysis is performed. As a risk the stop of road networks caused by collapse of natural slop or cut slop is considered. The effects of the stop of road networks are analyzed and the important of preparing the BCP is demonstrated.
On the robustness of complex heterogeneous gene expression networks.
Gómez-Gardeñes, Jesús; Moreno, Yamir; Floría, Luis M
2005-04-01
We analyze a continuous gene expression model on the underlying topology of a complex heterogeneous network. Numerical simulations aimed at studying the chaotic and periodic dynamics of the model are performed. The results clearly indicate that there is a region in which the dynamical and structural complexity of the system avoid chaotic attractors. However, contrary to what has been reported for Random Boolean Networks, the chaotic phase cannot be completely suppressed, which has important bearings on network robustness and gene expression modeling.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Caschili, Simone, E-mail: s.caschili@ucl.ac.uk; De Montis, Andrea; Ganciu, Amedeo
2014-07-01
Academic literature has been continuously growing at such a pace that it can be difficult to follow the progression of scientific achievements; hence, the need to dispose of quantitative knowledge support systems to analyze the literature of a subject. In this article we utilize network analysis tools to build a literature review of scientific documents published in the multidisciplinary field of Strategic Environment Assessment (SEA). The proposed approach helps researchers to build unbiased and comprehensive literature reviews. We collect information on 7662 SEA publications and build the SEA Bibliographic Network (SEABN) employing the basic idea that two publications are interconnectedmore » if one cites the other. We apply network analysis at macroscopic (network architecture), mesoscopic (sub graph) and microscopic levels (node) in order to i) verify what network structure characterizes the SEA literature, ii) identify the authors, disciplines and journals that are contributing to the international discussion on SEA, and iii) scrutinize the most cited and important publications in the field. Results show that the SEA is a multidisciplinary subject; the SEABN belongs to the class of real small world networks with a dominance of publications in Environmental studies over a total of 12 scientific sectors. Christopher Wood, Olivia Bina, Matthew Cashmore, and Andrew Jordan are found to be the leading authors while Environmental Impact Assessment Review is by far the scientific journal with the highest number of publications in SEA studies. - Highlights: • We utilize network analysis to analyze scientific documents in the SEA field. • We build the SEA Bibliographic Network (SEABN) of 7662 publications. • We apply network analysis at macroscopic, mesoscopic and microscopic network levels. • We identify SEABN architecture, relevant publications, authors, subjects and journals.« less
Implications of network structure on public health collaboratives.
Retrum, Jessica H; Chapman, Carrie L; Varda, Danielle M
2013-10-01
Interorganizational collaboration is an essential function of public health agencies. These partnerships form social networks that involve diverse types of partners and varying levels of interaction. Such collaborations are widely accepted and encouraged, yet very little comparative research exists on how public health partnerships develop and evolve, specifically in terms of how subsequent network structures are linked to outcomes. A systems science approach, that is, one that considers the interdependencies and nested features of networks, provides the appropriate methods to examine the complex nature of these networks. Applying Mays and Scutchfields's categorization of "structural signatures" (breadth, density, and centralization), this research examines how network structure influences the outcomes of public health collaboratives. Secondary data from the Program to Analyze, Record, and Track Networks to Enhance Relationships (www.partnertool.net) data set are analyzed. This data set consists of dyadic (N = 12,355), organizational (N = 2,486), and whole network (N = 99) data from public health collaborations around the United States. Network data are used to calculate structural signatures and weighted least squares regression is used to examine how network structures can predict selected intermediary outcomes (resource contributions, overall value and trust rankings, and outcomes) in public health collaboratives. Our findings suggest that network structure may have an influence on collaborative-related outcomes. The structural signature that had the most significant relationship to outcomes was density, with higher density indicating more positive outcomes. Also significant was the finding that more breadth creates new challenges such as difficulty in reaching consensus and creating ties with other members. However, assumptions that these structural components lead to improved outcomes for public health collaboratives may be slightly premature. Implications of these findings for research and practice are discussed.
An economic analysis on optical Ethernet in the access network
NASA Astrophysics Data System (ADS)
Kim, Sung Hwi; Nam, Dohyun; Yoo, Gunil; Kim, WoonHa
2004-04-01
Nowadays, Broadband service subscribers have increased exponentially and have almost saturated in Korea. Several types of solutions for broadband service applied to the field. Among several types of broadband services, most of subscribers provided xDSL service like ADSL or VDSL. Usually, they who live in an apartment provided Internet service by Ntopia network as FTTC structure that is a dormant network in economical view at KT. Under competitive telecom environment for new services like video, we faced with needing to expand or rebuild portions of our access networks, are looking for ways to provide any service that competitors might offer presently or in the near future. In order to look for new business model like FTTH service, we consider deploying optical access network. In spite of numerous benefits of PON until now, we cannot believe that PON is the best solution in Korea. Because we already deployed optical access network of ring type feeder cable and have densely population of subscribers that mainly distributed inside 6km from central office. So we try to utilize an existing Ntopia network for FTTH service under optical access environment. Despite of such situations, we try to deploy PON solution in the field as FTTC or FTTH architecture. Therefore we analyze PON structure in comparison with AON structure in order to look for optimized structure in Korea. At first, we describe the existing optical access networks and network architecture briefly. Secondly we investigate the cost of building optical access networks by modeling cost functions on AON and PON structure which based on Ethernet protocol, and analyze two different network architectures according to different deployment scenarios: Urban, small town, rural. Finally we suggest the economic and best solution with PON structure to optimize to optical access environment of KT.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Akibue, Seiseki; Murao, Mio
2014-12-04
We investigate distributed implementation of two-qubit unitary operations over two primitive networks, the butterfly network and the ladder network, as a first step to apply network coding for quantum computation. By classifying two-qubit unitary operations in terms of the Kraus-Cirac number, the number of non-zero parameters describing the global part of two-qubit unitary operations, we analyze which class of two-qubit unitary operations is implementable over these networks with free classical communication. For the butterfly network, we show that two classes of two-qubit unitary operations, which contain all Clifford, controlled-unitary and matchgate operations, are implementable over the network. For the laddermore » network, we show that two-qubit unitary operations are implementable over the network if and only if their Kraus-Cirac number do not exceed the number of the bridges of the ladder.« less
Reliable Communication Models in Interdependent Critical Infrastructure Networks
DOE Office of Scientific and Technical Information (OSTI.GOV)
Lee, Sangkeun; Chinthavali, Supriya; Shankar, Mallikarjun
Modern critical infrastructure networks are becoming increasingly interdependent where the failures in one network may cascade to other dependent networks, causing severe widespread national-scale failures. A number of previous efforts have been made to analyze the resiliency and robustness of interdependent networks based on different models. However, communication network, which plays an important role in today's infrastructures to detect and handle failures, has attracted little attention in the interdependency studies, and no previous models have captured enough practical features in the critical infrastructure networks. In this paper, we study the interdependencies between communication network and other kinds of critical infrastructuremore » networks with an aim to identify vulnerable components and design resilient communication networks. We propose several interdependency models that systematically capture various features and dynamics of failures spreading in critical infrastructure networks. We also discuss several research challenges in building reliable communication solutions to handle failures in these models.« less
UMA/GAN network architecture analysis
NASA Astrophysics Data System (ADS)
Yang, Liang; Li, Wensheng; Deng, Chunjian; Lv, Yi
2009-07-01
This paper is to critically analyze the architecture of UMA which is one of Fix Mobile Convergence (FMC) solutions, and also included by the third generation partnership project(3GPP). In UMA/GAN network architecture, UMA Network Controller (UNC) is the key equipment which connects with cellular core network and mobile station (MS). UMA network could be easily integrated into the existing cellular networks without influencing mobile core network, and could provides high-quality mobile services with preferentially priced indoor voice and data usage. This helps to improve subscriber's experience. On the other hand, UMA/GAN architecture helps to integrate other radio technique into cellular network which includes WiFi, Bluetooth, and WiMax and so on. This offers the traditional mobile operators an opportunity to integrate WiMax technique into cellular network. In the end of this article, we also give an analysis of potential influence on the cellular core networks ,which is pulled by UMA network.
Structural Properties of the Brazilian Air Transportation Network.
Couto, Guilherme S; da Silva, Ana Paula Couto; Ruiz, Linnyer B; Benevenuto, Fabrício
2015-09-01
The air transportation network in a country has a great impact on the local, national and global economy. In this paper, we analyze the air transportation network in Brazil with complex network features to better understand its characteristics. In our analysis, we built networks composed either by national or by international flights. We also consider the network when both types of flights are put together. Interesting conclusions emerge from our analysis. For instance, Viracopos Airport (Campinas City) is the most central and connected airport on the national flights network. Any operational problem in this airport separates the Brazilian national network into six distinct subnetworks. Moreover, the Brazilian air transportation network exhibits small world characteristics and national connections network follows a power law distribution. Therefore, our analysis sheds light on the current Brazilian air transportation infrastructure, bringing a novel understanding that may help face the recent fast growth in the usage of the Brazilian transport network.
Rethinking Traffic Management: Design of Optimizable Networks
2008-06-01
Though this paper used optimization theory to design and analyze DaVinci , op- timization theory is one of many possible tools to enable a grounded...dynamically allocate bandwidth shares. The distributed protocols can be implemented using DaVinci : Dynamically Adaptive VIrtual Networks for a Customized...Internet. In DaVinci , each virtual network runs traffic-management protocols optimized for a traffic class, and link bandwidth is dynamically allocated
On the Probability of Error and Stochastic Resonance in Discrete Memoryless Channels
2013-12-01
Information - Driven Doppler Shift Estimation and Compensation Methods for Underwater Wireless Sensor Networks ”, which is to analyze and develop... underwater wireless sensor networks . We formulated an analytic relationship that relates the average probability of error to the systems parameters, the...thesis, we studied the performance of Discrete Memoryless Channels (DMC), arising in the context of cooperative underwater wireless sensor networks
Optimal Scheduling for Underwater Communications in Multiple-User Scenarios
2015-09-30
term goals of this project is to analyze and propose energy-efficient communication techniques for underwater acoustic sensor networks . These...investigate the possibility that these underwater acoustic networks disrupt the behavior of surrounding species of marine mammals. As a consequence of... underwater VHF acoustics , high data rate/short range acoustic communications and networking , and acoustic sensing in the VHF regime. WORK COMPLETED We
ERIC Educational Resources Information Center
Haavelsrud, Magnus; Stenberg, Oddbjorn
2012-01-01
Eleven articles on peace education published in the first volume of the Journal of Peace Education are analyzed. This selection comprises peace education programs that have been planned or carried out in different contexts. In analyzing peace pedagogies as proposed in the 11 contributions, we have chosen network analysis as our method--enabling…
On the stochastic dissemination of faults in an admissible network
NASA Technical Reports Server (NTRS)
Kyrala, A.
1987-01-01
The dynamic distribution of faults in a general type network is discussed. The starting point is a uniquely branched network in which each pair of nodes is connected by a single branch. Mathematical expressions for the uniquely branched network transition matrix are derived to show that sufficient stationarity exists to ensure the validity of the use of the Markov Chain model to analyze networks. In addition the conditions for the use of Semi-Markov models are discussed. General mathematical expressions are derived in an examination of branch redundancy techniques commonly used to increase reliability.
Performance Analysis of Optical Mobile Fronthaul for Cloud Radio Access Networks
NASA Astrophysics Data System (ADS)
Zhang, Jiawei; Xiao, Yuming; Li, Hui; Ji, Yuefeng
2017-10-01
Cloud radio access networks (C-RAN) separates baseband units (BBU) of conventional base station to a centralized pool which connects remote radio heads (RRH) through mobile fronthaul. Mobile fronthaul is a new network segment of C-RAN, it is designed to transport digital sampling data between BBU and RRH. Optical transport networks that provide large bandwidth and low latency is a promising fronthaul solution. In this paper, we discuss several optical transport networks which are candidates for mobile fronthaul, analyze their performances including the number of used wavelength, round-trip latency and wavelength utilization.
System data communication structures for active-control transport aircraft, volume 1
NASA Technical Reports Server (NTRS)
Hopkins, A. L.; Martin, J. H.; Brock, L. D.; Jansson, D. G.; Serben, S.; Smith, T. B.; Hanley, L. D.
1981-01-01
Candidate data communication techniques are identified, including dedicated links, local buses, broadcast buses, multiplex buses, and mesh networks. The design methodology for mesh networks is then discussed, including network topology and node architecture. Several concepts of power distribution are reviewed, including current limiting and mesh networks for power. The technology issues of packaging, transmission media, and lightning are addressed, and, finally, the analysis tools developed to aid in the communication design process are described. There are special tools to analyze the reliability and connectivity of networks and more general reliability analysis tools for all types of systems.
Modeling Multiple Human-Automation Distributed Systems using Network-form Games
NASA Technical Reports Server (NTRS)
Brat, Guillaume
2012-01-01
The paper describes at a high-level the network-form game framework (based on Bayes net and game theory), which can be used to model and analyze safety issues in large, distributed, mixed human-automation systems such as NextGen.
Advancing Future Network Science through Content Understanding
2014-05-01
BitTorrent, PostgreSQL, MySQL , and GRSecurity) and emerging technologies (HadoopDFS, Tokutera, Sector/Sphere, HBase, and other BigTable-like...result. • Multi-Source Network Pulse Analyzer and Correlator provides course of action planning by enhancing the understanding of the complex dynamics
Advanced Communication Techniques
1988-07-01
networks with different structures have been developed. In some networks, stations (i.e., computers and/or their peripherals, such as printers , etc.) are...existence of codes which exceed the Gilbert- Varsharmov bound as demonstrated by Tafasman, Vladut, and Zink . Geometric methods will then be used to analyze
Synchronous versus asynchronous modeling of gene regulatory networks.
Garg, Abhishek; Di Cara, Alessandro; Xenarios, Ioannis; Mendoza, Luis; De Micheli, Giovanni
2008-09-01
In silico modeling of gene regulatory networks has gained some momentum recently due to increased interest in analyzing the dynamics of biological systems. This has been further facilitated by the increasing availability of experimental data on gene-gene, protein-protein and gene-protein interactions. The two dynamical properties that are often experimentally testable are perturbations and stable steady states. Although a lot of work has been done on the identification of steady states, not much work has been reported on in silico modeling of cellular differentiation processes. In this manuscript, we provide algorithms based on reduced ordered binary decision diagrams (ROBDDs) for Boolean modeling of gene regulatory networks. Algorithms for synchronous and asynchronous transition models have been proposed and their corresponding computational properties have been analyzed. These algorithms allow users to compute cyclic attractors of large networks that are currently not feasible using existing software. Hereby we provide a framework to analyze the effect of multiple gene perturbation protocols, and their effect on cell differentiation processes. These algorithms were validated on the T-helper model showing the correct steady state identification and Th1-Th2 cellular differentiation process. The software binaries for Windows and Linux platforms can be downloaded from http://si2.epfl.ch/~garg/genysis.html.
A Subsonic Aircraft Design Optimization With Neural Network and Regression Approximators
NASA Technical Reports Server (NTRS)
Patnaik, Surya N.; Coroneos, Rula M.; Guptill, James D.; Hopkins, Dale A.; Haller, William J.
2004-01-01
The Flight-Optimization-System (FLOPS) code encountered difficulty in analyzing a subsonic aircraft. The limitation made the design optimization problematic. The deficiencies have been alleviated through use of neural network and regression approximations. The insight gained from using the approximators is discussed in this paper. The FLOPS code is reviewed. Analysis models are developed and validated for each approximator. The regression method appears to hug the data points, while the neural network approximation follows a mean path. For an analysis cycle, the approximate model required milliseconds of central processing unit (CPU) time versus seconds by the FLOPS code. Performance of the approximators was satisfactory for aircraft analysis. A design optimization capability has been created by coupling the derived analyzers to the optimization test bed CometBoards. The approximators were efficient reanalysis tools in the aircraft design optimization. Instability encountered in the FLOPS analyzer was eliminated. The convergence characteristics were improved for the design optimization. The CPU time required to calculate the optimum solution, measured in hours with the FLOPS code was reduced to minutes with the neural network approximation and to seconds with the regression method. Generation of the approximators required the manipulation of a very large quantity of data. Design sensitivity with respect to the bounds of aircraft constraints is easily generated.
Topological patterns in street networks of self-organized urban settlements
NASA Astrophysics Data System (ADS)
Buhl, J.; Gautrais, J.; Reeves, N.; Solé, R. V.; Valverde, S.; Kuntz, P.; Theraulaz, G.
2006-02-01
Many urban settlements result from a spatially distributed, decentralized building process. Here we analyze the topological patterns of organization of a large collection of such settlements using the approach of complex networks. The global efficiency (based on the inverse of shortest-path lengths), robustness to disconnections and cost (in terms of length) of these graphs is studied and their possible origins analyzed. A wide range of patterns is found, from tree-like settlements (highly vulnerable to random failures) to meshed urban patterns. The latter are shown to be more robust and efficient.
Tabu Search enhances network robustness under targeted attacks
NASA Astrophysics Data System (ADS)
Sun, Shi-wen; Ma, Yi-lin; Li, Rui-qi; Wang, Li; Xia, Cheng-yi
2016-03-01
We focus on the optimization of network robustness with respect to intentional attacks on high-degree nodes. Given an existing network, this problem can be considered as a typical single-objective combinatorial optimization problem. Based on the heuristic Tabu Search optimization algorithm, a link-rewiring method is applied to reconstruct the network while keeping the degree of every node unchanged. Through numerical simulations, BA scale-free network and two real-world networks are investigated to verify the effectiveness of the proposed optimization method. Meanwhile, we analyze how the optimization affects other topological properties of the networks, including natural connectivity, clustering coefficient and degree-degree correlation. The current results can help to improve the robustness of existing complex real-world systems, as well as to provide some insights into the design of robust networks.
EEG classification of emotions using emotion-specific brain functional network.
Gonuguntla, V; Shafiq, G; Wang, Y; Veluvolu, K C
2015-08-01
The brain functional network perspective forms the basis to relate mechanisms of brain functions. This work analyzes the network mechanisms related to human emotion based on synchronization measure - phase-locking value in EEG to formulate the emotion specific brain functional network. Based on network dissimilarities between emotion and rest tasks, most reactive channel pairs and the reactive band corresponding to emotions are identified. With the identified most reactive pairs, the subject-specific functional network is formed. The identified subject-specific and emotion-specific dynamic network pattern show significant synchrony variation in line with the experiment protocol. The same network pattern are then employed for classification of emotions. With the study conducted on the 4 subjects, an average classification accuracy of 62 % was obtained with the proposed technique.
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.
On the stability, storage capacity, and design of nonlinear continuous neural networks
NASA Technical Reports Server (NTRS)
Guez, Allon; Protopopsecu, Vladimir; Barhen, Jacob
1988-01-01
The stability, capacity, and design of a nonlinear continuous neural network are analyzed. Sufficient conditions for existence and asymptotic stability of the network's equilibria are reduced to a set of piecewise-linear inequality relations that can be solved by a feedforward binary network, or by methods such as Fourier elimination. The stability and capacity of the network is characterized by the post synaptic firing rate function. An N-neuron network with sigmoidal firing function is shown to have up to 3N equilibrium points. This offers a higher capacity than the (0.1-0.2)N obtained in the binary Hopfield network. Moreover, it is shown that by a proper selection of the postsynaptic firing rate function, one can significantly extend the capacity storage of the network.
Dynamics Behaviors of Scale-Free Networks with Elastic Demand
NASA Astrophysics Data System (ADS)
Li, Yan-Lai; Sun, Hui-Jun; Wu, Jian-Jun
Many real-world networks, such as transportation networks and Internet, have the scale-free properties. It is important to study the bearing capacity of such networks. Considering the elastic demand condition, we analyze load distributions and bearing capacities with different parameters through artificially created scale-free networks. The simulation results show that the load distribution follows a power-law form, which means some ordered pairs, playing the dominant role in the transportation network, have higher demand than other pairs. We found that, with the decrease of perceptual error, the total and average ordered pair demand will decrease and then stay in a steady state. However, with the increase of the network size, the average demand of each ordered pair will decrease, which is particularly interesting for the network design problem.
Communication networks for the tactical edge
NASA Astrophysics Data System (ADS)
Evans, Joseph B.; Pennington, Steven G.; Ewy, Benjamin J.
2017-04-01
Information at the tactical level is increasingly critical in today's conflicts. The proliferation of commercial tablets and smart phones has created the ability for extensive information sharing at the tactical edge, beyond the traditional tactical voice communications and location information. This is particularly the case in Gray Zone conflicts, in which tactical decision making and actions are intertwined with information sharing and exploitation. Networking of tactical devices is the key to this information sharing. In this work, we detail and analyze two network models at different parts of the Gray Zone spectrum, and explore a number of networking options including Named Data Networking. We also compare networking approaches in a variety of realistic operating environments. Our results show that Named Data Networking is a good match for the disrupted networking environments found in many tactical situations
Rich, Scott; Booth, Victoria; Zochowski, Michal
2016-01-01
The plethora of inhibitory interneurons in the hippocampus and cortex play a pivotal role in generating rhythmic activity by clustering and synchronizing cell firing. Results of our simulations demonstrate that both the intrinsic cellular properties of neurons and the degree of network connectivity affect the characteristics of clustered dynamics exhibited in randomly connected, heterogeneous inhibitory networks. We quantify intrinsic cellular properties by the neuron's current-frequency relation (IF curve) and Phase Response Curve (PRC), a measure of how perturbations given at various phases of a neurons firing cycle affect subsequent spike timing. We analyze network bursting properties of networks of neurons with Type I or Type II properties in both excitability and PRC profile; Type I PRCs strictly show phase advances and IF curves that exhibit frequencies arbitrarily close to zero at firing threshold while Type II PRCs display both phase advances and delays and IF curves that have a non-zero frequency at threshold. Type II neurons whose properties arise with or without an M-type adaptation current are considered. We analyze network dynamics under different levels of cellular heterogeneity and as intrinsic cellular firing frequency and the time scale of decay of synaptic inhibition are varied. Many of the dynamics exhibited by these networks diverge from the predictions of the interneuron network gamma (ING) mechanism, as well as from results in all-to-all connected networks. Our results show that randomly connected networks of Type I neurons synchronize into a single cluster of active neurons while networks of Type II neurons organize into two mutually exclusive clusters segregated by the cells' intrinsic firing frequencies. Networks of Type II neurons containing the adaptation current behave similarly to networks of either Type I or Type II neurons depending on network parameters; however, the adaptation current creates differences in the cluster dynamics compared to those in networks of Type I or Type II neurons. To understand these results, we compute neuronal PRCs calculated with a perturbation matching the profile of the synaptic current in our networks. Differences in profiles of these PRCs across the different neuron types reveal mechanisms underlying the divergent network dynamics. PMID:27812323
YANA – a software tool for analyzing flux modes, gene-expression and enzyme activities
Schwarz, Roland; Musch, Patrick; von Kamp, Axel; Engels, Bernd; Schirmer, Heiner; Schuster, Stefan; Dandekar, Thomas
2005-01-01
Background A number of algorithms for steady state analysis of metabolic networks have been developed over the years. Of these, Elementary Mode Analysis (EMA) has proven especially useful. Despite its low user-friendliness, METATOOL as a reliable high-performance implementation of the algorithm has been the instrument of choice up to now. As reported here, the analysis of metabolic networks has been improved by an editor and analyzer of metabolic flux modes. Analysis routines for expression levels and the most central, well connected metabolites and their metabolic connections are of particular interest. Results YANA features a platform-independent, dedicated toolbox for metabolic networks with a graphical user interface to calculate (integrating METATOOL), edit (including support for the SBML format), visualize, centralize, and compare elementary flux modes. Further, YANA calculates expected flux distributions for a given Elementary Mode (EM) activity pattern and vice versa. Moreover, a dissection algorithm, a centralization algorithm, and an average diameter routine can be used to simplify and analyze complex networks. Proteomics or gene expression data give a rough indication of some individual enzyme activities, whereas the complete flux distribution in the network is often not known. As such data are noisy, YANA features a fast evolutionary algorithm (EA) for the prediction of EM activities with minimum error, including alerts for inconsistent experimental data. We offer the possibility to include further known constraints (e.g. growth constraints) in the EA calculation process. The redox metabolism around glutathione reductase serves as an illustration example. All software and documentation are available for download at . Conclusion A graphical toolbox and an editor for METATOOL as well as a series of additional routines for metabolic network analyses constitute a new user-friendly software for such efforts. PMID:15929789
Research on centrality of urban transport network nodes
NASA Astrophysics Data System (ADS)
Wang, Kui; Fu, Xiufen
2017-05-01
Based on the actual data of urban transport in Guangzhou, 19,150 bus stations in Guangzhou (as of 2014) are selected as nodes. Based on the theory of complex network, the network model of Guangzhou urban transport is constructed. By analyzing the degree centrality index, betweenness centrality index and closeness centrality index of nodes in the network, the level of centrality of each node in the network is studied. From a different point of view to determine the hub node of Guangzhou urban transport network, corresponding to the city's key sites and major transfer sites. The reliability of the network is determined by the stability of some key nodes (transport hub station). The research of network node centralization can provide a theoretical basis for the rational allocation of urban transport network sites and public transport system planning.
Dynamics of brain networks in the aesthetic appreciation
Cela-Conde, Camilo J.; García-Prieto, Juan; Ramasco, José J.; Mirasso, Claudio R.; Bajo, Ricardo; Munar, Enric; Flexas, Albert; del-Pozo, Francisco; Maestú, Fernando
2013-01-01
Neuroimage experiments have been essential for identifying active brain networks. During cognitive tasks as in, e.g., aesthetic appreciation, such networks include regions that belong to the default mode network (DMN). Theoretically, DMN activity should be interrupted during cognitive tasks demanding attention, as is the case for aesthetic appreciation. Analyzing the functional connectivity dynamics along three temporal windows and two conditions, beautiful and not beautiful stimuli, here we report experimental support for the hypothesis that aesthetic appreciation relies on the activation of two different networks, an initial aesthetic network and a delayed aesthetic network, engaged within distinct time frames. Activation of the DMN might correspond mainly to the delayed aesthetic network. We discuss adaptive and evolutionary explanations for the relationships existing between the DMN and aesthetic networks and offer unique inputs to debates on the mind/brain interaction. PMID:23754437
NASA Astrophysics Data System (ADS)
Yang, Hong-Yong; Lu, Lan; Cao, Ke-Cai; Zhang, Si-Ying
2010-04-01
In this paper, the relations of the network topology and the moving consensus of multi-agent systems are studied. A consensus-prestissimo scale-free network model with the static preferential-consensus attachment is presented on the rewired link of the regular network. The effects of the static preferential-consensus BA network on the algebraic connectivity of the topology graph are compared with the regular network. The robustness gain to delay is analyzed for variable network topology with the same scale. The time to reach the consensus is studied for the dynamic network with and without communication delays. By applying the computer simulations, it is validated that the speed of the convergence of multi-agent systems can be greatly improved in the preferential-consensus BA network model with different configuration.
Charge transport network dynamics in molecular aggregates
DOE Office of Scientific and Technical Information (OSTI.GOV)
Jackson, Nicholas E.; Chen, Lin X.; Ratner, Mark A.
2016-07-20
Due to the nonperiodic nature of charge transport in disordered systems, generating insight into static charge transport networks, as well as analyzing the network dynamics, can be challenging. Here, we apply time-dependent network analysis to scrutinize the charge transport networks of two representative molecular semiconductors: a rigid n-type molecule, perylenediimide, and a flexible p-type molecule, bBDT(TDPP)2. Simulations reveal the relevant timescale for local transfer integral decorrelation to be ~100 fs, which is shown to be faster than that of a crystalline morphology of the same molecule. Using a simple graph metric, global network changes are observed over timescales competitive withmore » charge carrier lifetimes. These insights demonstrate that static charge transport networks are qualitatively inadequate, whereas average networks often overestimate network connectivity. Finally, a simple methodology for tracking dynamic charge transport properties is proposed.« less
Daianu, Madelaine; Jahanshad, Neda; Nir, Talia M.; Jack, Clifford R.; Weiner, Michael W.; Bernstein, Matthew; Thompson, Paul M.
2015-01-01
Diffusion imaging can assess the white matter connections within the brain, revealing how neural pathways break down in Alzheimer's disease (AD). We analyzed 3-Tesla whole-brain diffusion-weighted images from 202 participants scanned by the Alzheimer's Disease Neuroimaging Initiative – 50 healthy controls, 110 with mild cognitive impairment (MCI) and 42 AD patients. From whole-brain tractography, we reconstructed structural brain connectivity networks to map connections between cortical regions. We tested whether AD disrupts the ‘rich-club’ – a network property where high-degree network nodes are more interconnected than expected by chance. We calculated the rich-club properties at a range of degree thresholds, as well as other network topology measures including global degree, clustering coefficient, path length and efficiency. Network disruptions predominated in the low-degree regions of the connectome in patients, relative to controls. The other metrics also showed alterations, suggesting a distinctive pattern of disruption in AD, less pronounced in MCI, targeting global brain connectivity, and focusing on more remotely connected nodes rather than the central core of the network. AD involves severely reduced structural connectivity; our step-wise rich club coefficients analyze points to disruptions predominantly in the peripheral network components; other modalities of data are needed to know if this indicates impaired communication among non rich-club regions. The highly connected core was relatively preserved, offering new evidence on the neural basis of progressive risk for cognitive decline. PMID:26037224
Wu, Xiuyong; Wu, Xiaoming; Peng, Hongjun; Ning, Yuping; Wu, Kai
2016-06-01
This paper is aimed to analyze the topological properties of structural brain networks in depressive patients with and without anxiety and to explore the neuropath logical mechanisms of depression comorbid with anxiety.Diffusion tensor imaging and deterministic tractography were applied to map the white matter structural networks.We collected 20 depressive patients with anxiety(DPA),18 depressive patients without anxiety(DP),and 28 normal controls(NC)as comparative groups.The global and nodal properties of the structural brain networks in the three groups were analyzed with graph theoretical methods.The result showed that1 the structural brain networks in three groups showed small-world properties and highly connected global hubs predominately from association cortices;2DP group showed lower local efficiency and global efficiency compared to NC group,whereas DPA group showed higher local efficiency and global efficiency compared to NC group;3significant differences of network properties(clustering coefficient,characteristic path lengths,local efficiency,global efficiency)were found between DPA and DP groups;4DP group showed significant changes of nodal efficiency in the brain areas primarily in the temporal lobe and bilateral frontal gyrus,compared to DPA and NC groups.The analysis indicated that the DP and DPA groups showed nodal properties of the structural brain networks,compared to NC group.Moreover,the two diseased groups indicated an opposite trend in the network properties.The results of this study may provide a new imaging index for clinical diagnosis for depression comorbid with anxiety.
A framework for analyzing contagion in assortative banking networks
Hurd, Thomas R.; Gleeson, James P.; Melnik, Sergey
2017-01-01
We introduce a probabilistic framework that represents stylized banking networks with the aim of predicting the size of contagion events. Most previous work on random financial networks assumes independent connections between banks, whereas our framework explicitly allows for (dis)assortative edge probabilities (i.e., a tendency for small banks to link to large banks). We analyze default cascades triggered by shocking the network and find that the cascade can be understood as an explicit iterated mapping on a set of edge probabilities that converges to a fixed point. We derive a cascade condition, analogous to the basic reproduction number R0 in epidemic modelling, that characterizes whether or not a single initially defaulted bank can trigger a cascade that extends to a finite fraction of the infinite network. This cascade condition is an easily computed measure of the systemic risk inherent in a given banking network topology. We use percolation theory for random networks to derive a formula for the frequency of global cascades. These analytical results are shown to provide limited quantitative agreement with Monte Carlo simulation studies of finite-sized networks. We show that edge-assortativity, the propensity of nodes to connect to similar nodes, can have a strong effect on the level of systemic risk as measured by the cascade condition. However, the effect of assortativity on systemic risk is subtle, and we propose a simple graph theoretic quantity, which we call the graph-assortativity coefficient, that can be used to assess systemic risk. PMID:28231324
NASA Astrophysics Data System (ADS)
Hong, Jae Weon; Hong, Won Eui; Kwak, Yoon Sik
This study attempts to shed light on the factors that influence the locations of bank branches in establishing a bank's distribution network from the angle of the network analysis. Whereas the previous studies analyzed the locations of bank branches on the basis of their geographical characteristics and image, the significance of this study rests upon the fact that it endeavors to explore the location factors from a new perspective of the movement path of financial customers. For this analysis, the network between administrative districts, which form the fundamental unit of a location, was analyzed based on the financial transactional data. The important findings of this study are as follows. First, in conformity with the previous studies, the income level, the spending level, the number of businesses, and the size of workforce in the pertinent region were all found to influence the size of a bank's market. Second, the centrality index extracted from the analysis of the network was found to have a significant effect on the locations of bank branches. In particular, the degree centrality was revealed to have a greater influence on the size of a bank's market than does the closeness centrality. Such results of this study clearly suggest the needs for a new approach from the perspective of network in furtherance of other factors that have been considered important in the previous studies of the distribution network strategies.
A Crowdsensing Based Analytical Framework for Perceptional Degradation of OTT Web Browsing.
Li, Ke; Wang, Hai; Xu, Xiaolong; Du, Yu; Liu, Yuansheng; Ahmad, M Omair
2018-05-15
Service perception analysis is crucial for understanding both user experiences and network quality as well as for maintaining and optimizing of mobile networks. Given the rapid development of mobile Internet and over-the-top (OTT) services, the conventional network-centric mode of network operation and maintenance is no longer effective. Therefore, developing an approach to evaluate and optimizing users' service perceptions has become increasingly important. Meanwhile, the development of a new sensing paradigm, mobile crowdsensing (MCS), makes it possible to evaluate and analyze the user's OTT service perception from end-user's point of view other than from the network side. In this paper, the key factors that impact users' end-to-end OTT web browsing service perception are analyzed by monitoring crowdsourced user perceptions. The intrinsic relationships among the key factors and the interactions between key quality indicators (KQI) are evaluated from several perspectives. Moreover, an analytical framework of perceptional degradation and a detailed algorithm are proposed whose goal is to identify the major factors that impact the perceptional degradation of web browsing service as well as their significance of contribution. Finally, a case study is presented to show the effectiveness of the proposed method using a dataset crowdsensed from a large number of smartphone users in a real mobile network. The proposed analytical framework forms a valuable solution for mobile network maintenance and optimization and can help improve web browsing service perception and network quality.
A framework for analyzing contagion in assortative banking networks.
Hurd, Thomas R; Gleeson, James P; Melnik, Sergey
2017-01-01
We introduce a probabilistic framework that represents stylized banking networks with the aim of predicting the size of contagion events. Most previous work on random financial networks assumes independent connections between banks, whereas our framework explicitly allows for (dis)assortative edge probabilities (i.e., a tendency for small banks to link to large banks). We analyze default cascades triggered by shocking the network and find that the cascade can be understood as an explicit iterated mapping on a set of edge probabilities that converges to a fixed point. We derive a cascade condition, analogous to the basic reproduction number R0 in epidemic modelling, that characterizes whether or not a single initially defaulted bank can trigger a cascade that extends to a finite fraction of the infinite network. This cascade condition is an easily computed measure of the systemic risk inherent in a given banking network topology. We use percolation theory for random networks to derive a formula for the frequency of global cascades. These analytical results are shown to provide limited quantitative agreement with Monte Carlo simulation studies of finite-sized networks. We show that edge-assortativity, the propensity of nodes to connect to similar nodes, can have a strong effect on the level of systemic risk as measured by the cascade condition. However, the effect of assortativity on systemic risk is subtle, and we propose a simple graph theoretic quantity, which we call the graph-assortativity coefficient, that can be used to assess systemic risk.
How People Interact in Evolving Online Affiliation Networks
NASA Astrophysics Data System (ADS)
Gallos, Lazaros K.; Rybski, Diego; Liljeros, Fredrik; Havlin, Shlomo; Makse, Hernán A.
2012-07-01
The study of human interactions is of central importance for understanding the behavior of individuals, groups, and societies. Here, we observe the formation and evolution of networks by monitoring the addition of all new links, and we analyze quantitatively the tendencies used to create ties in these evolving online affiliation networks. We show that an accurate estimation of these probabilistic tendencies can be achieved only by following the time evolution of the network. Inferences about the reason for the existence of links using statistical analysis of network snapshots must therefore be made with great caution. Here, we start by characterizing every single link when the tie was established in the network. This information allows us to describe the probabilistic tendencies of tie formation and extract meaningful sociological conclusions. We also find significant differences in behavioral traits in the social tendencies among individuals according to their degree of activity, gender, age, popularity, and other attributes. For instance, in the particular data sets analyzed here, we find that women reciprocate connections 3 times as much as men and that this difference increases with age. Men tend to connect with the most popular people more often than women do, across all ages. On the other hand, triangular tie tendencies are similar, independent of gender, and show an increase with age. These results require further validation in other social settings. Our findings can be useful to build models of realistic social network structures and to discover the underlying laws that govern establishment of ties in evolving social networks.
Small worlds in space: Synchronization, spatial and relational modularity
NASA Astrophysics Data System (ADS)
Brede, M.
2010-06-01
In this letter we investigate networks that have been optimized to realize a trade-off between enhanced synchronization and cost of wire to connect the nodes in space. Analyzing the evolved arrangement of nodes in space and their corresponding network topology, a class of small-world networks characterized by spatial and network modularity is found. More precisely, for low cost of wire optimal configurations are characterized by a division of nodes into two spatial groups with maximum distance from each other, whereas network modularity is low. For high cost of wire, the nodes organize into several distinct groups in space that correspond to network modules connected on a ring. In between, spatially and relationally modular small-world networks are found.
Design of microstrip patch antennas using knowledge insertion through retraining
NASA Astrophysics Data System (ADS)
Divakar, T. V. S.; Sudhakar, A.
2018-04-01
The traditional way of analyzing/designing neural network is to collect experimental data and train neural network. Then, the trained neural network acts as global approximate function. The network is then used to calculate parameters for unknown configurations. The main drawback of this method is one does not have enough experimental data, cost of prototypes being a major factor [1-4]. Therefore, in this method the author collected training data from available approximate formulas with in full design range and trained the network with it. After successful training, the network is retrained with available measured results. This simple way inserts experimental knowledge into the network [5]. This method is tested for rectangular microstrip antenna and circular microstrip antenna.
Research on social communication network evolution based on topology potential distribution
NASA Astrophysics Data System (ADS)
Zhao, Dongjie; Jiang, Jian; Li, Deyi; Zhang, Haisu; Chen, Guisheng
2011-12-01
Aiming at the problem of social communication network evolution, first, topology potential is introduced to measure the local influence among nodes in networks. Second, from the perspective of topology potential distribution the method of network evolution description based on topology potential distribution is presented, which takes the artificial intelligence with uncertainty as basic theory and local influence among nodes as essentiality. Then, a social communication network is constructed by enron email dataset, the method presented is used to analyze the characteristic of the social communication network evolution and some useful conclusions are got, implying that the method is effective, which shows that topology potential distribution can effectively describe the characteristic of sociology and detect the local changes in social communication network.
Student trajectories in physics: the need for analysis through a socio-cultural lens
NASA Astrophysics Data System (ADS)
Zapata, Mara
2010-09-01
An analysis of student connections through time and space relative to the core discipline of physics is attempted, as viewed through the lens of actor-network-theory, by Antonia Candela. Using lenses of cultural realities, networks, and perceived power in the discourse of one specific university in the capital city of Mexico and one undergraduate physics classroom, the trajectories and itineraries of students are analyzed, relative to a physics professor's pedagogical practices. This ethnographic study then yields comparisons between Mexican undergraduate students and students from the United States. Actor network theory recognizes that the symbiotic relationship existing between an actor and a continuum of space and time is defined by the symbiotic yet interdependent relationships and networks of practice (Lemke in Downward causation: Minds, bodies, and matter 2000). As part of this study and in line with actor-network-theory, human actors and non-human participants were viewed in relation to how subjects acted and were acted upon within networks of practice. Through this forum I reflect on this work with particular focus on the issues of situatedness of actors from a sociocultural perspective and how established networks viewed within this perspective frame and subsequently impact student trajectories and itineraries. In essence I argue for a need to look at a myriad of further complexities driving the symbiotic relationships being analyzed.
NASA Astrophysics Data System (ADS)
Wang, Rong; Wang, Li; Yang, Yong; Li, Jiajia; Wu, Ying; Lin, Pan
2016-11-01
Attention deficit hyperactivity disorder (ADHD) is the most common childhood neuropsychiatric disorder and affects approximately 6 -7 % of children worldwide. Here, we investigate the statistical properties of undirected and directed brain functional networks in ADHD patients based on random matrix theory (RMT), in which the undirected functional connectivity is constructed based on correlation coefficient and the directed functional connectivity is measured based on cross-correlation coefficient and mutual information. We first analyze the functional connectivity and the eigenvalues of the brain functional network. We find that ADHD patients have increased undirected functional connectivity, reflecting a higher degree of linear dependence between regions, and increased directed functional connectivity, indicating stronger causality and more transmission of information among brain regions. More importantly, we explore the randomness of the undirected and directed functional networks using RMT. We find that for ADHD patients, the undirected functional network is more orderly than that for normal subjects, which indicates an abnormal increase in undirected functional connectivity. In addition, we find that the directed functional networks are more random, which reveals greater disorder in causality and more chaotic information flow among brain regions in ADHD patients. Our results not only further confirm the efficacy of RMT in characterizing the intrinsic properties of brain functional networks but also provide insights into the possibilities RMT offers for improving clinical diagnoses and treatment evaluations for ADHD patients.
Integration of Spatial and Social Network Analysis in Disease Transmission Studies.
Emch, Michael; Root, Elisabeth D; Giebultowicz, Sophia; Ali, Mohammad; Perez-Heydrich, Carolina; Yunus, Mohammad
2012-01-01
This study presents a case study of how social network and spatial analytical methods can be used simultaneously for disease transmission modeling. The paper first reviews strategies employed in previous studies and then offers the example of transmission of two bacterial diarrheal diseases in rural Bangladesh. The goal is to understand how diseases vary socially above and beyond the effects of the local neighborhood context. Patterns of cholera and shigellosis incidence are analyzed in space and within kinship-based social networks in Matlab, Bangladesh. Data include a spatially referenced longitudinal demographic database which consists of approximately 200,000 people and laboratory-confirmed cholera and shigellosis cases from 1983 to 2003. Matrices are created of kinship ties between households using a complete network design and distance matrices are also created to model spatial relationships. Moran's I statistics are calculated to measure clustering within both social and spatial matrices. Combined spatial effects-spatial disturbance models are built to simultaneously analyze spatial and social effects while controlling for local environmental context. Results indicate that cholera and shigellosis always clusters in space and only sometimes within social networks. This suggests that the local environment is most important for understanding transmission of both diseases however kinship-based social networks also influence their transmission. Simultaneous spatial and social network analysis can help us better understand disease transmission and this study has offered several strategies on how.
Integration of Spatial and Social Network Analysis in Disease Transmission Studies
Root, Elisabeth D; Giebultowicz, Sophia; Ali, Mohammad; Perez-Heydrich, Carolina; Yunus, Mohammad
2013-01-01
This study presents a case study of how social network and spatial analytical methods can be used simultaneously for disease transmission modeling. The paper first reviews strategies employed in previous studies and then offers the example of transmission of two bacterial diarrheal diseases in rural Bangladesh. The goal is to understand how diseases vary socially above and beyond the effects of the local neighborhood context. Patterns of cholera and shigellosis incidence are analyzed in space and within kinship-based social networks in Matlab, Bangladesh. Data include a spatially referenced longitudinal demographic database which consists of approximately 200,000 people and laboratory-confirmed cholera and shigellosis cases from 1983 to 2003. Matrices are created of kinship ties between households using a complete network design and distance matrices are also created to model spatial relationships. Moran's I statistics are calculated to measure clustering within both social and spatial matrices. Combined spatial effects-spatial disturbance models are built to simultaneously analyze spatial and social effects while controlling for local environmental context. Results indicate that cholera and shigellosis always clusters in space and only sometimes within social networks. This suggests that the local environment is most important for understanding transmission of both diseases however kinship-based social networks also influence their transmission. Simultaneous spatial and social network analysis can help us better understand disease transmission and this study has offered several strategies on how. PMID:24163443
Optimal topologies for maximizing network transmission capacity
NASA Astrophysics Data System (ADS)
Chen, Zhenhao; Wu, Jiajing; Rong, Zhihai; Tse, Chi K.
2018-04-01
It has been widely demonstrated that the structure of a network is a major factor that affects its traffic dynamics. In this work, we try to identify the optimal topologies for maximizing the network transmission capacity, as well as to build a clear relationship between structural features of a network and the transmission performance in terms of traffic delivery. We propose an approach for designing optimal network topologies against traffic congestion by link rewiring and apply them on the Barabási-Albert scale-free, static scale-free and Internet Autonomous System-level networks. Furthermore, we analyze the optimized networks using complex network parameters that characterize the structure of networks, and our simulation results suggest that an optimal network for traffic transmission is more likely to have a core-periphery structure. However, assortative mixing and the rich-club phenomenon may have negative impacts on network performance. Based on the observations of the optimized networks, we propose an efficient method to improve the transmission capacity of large-scale networks.
A Novel Characterization of Amalgamated Networks in Natural Systems
Barranca, Victor J.; Zhou, Douglas; Cai, David
2015-01-01
Densely-connected networks are prominent among natural systems, exhibiting structural characteristics often optimized for biological function. To reveal such features in highly-connected networks, we introduce a new network characterization determined by a decomposition of network-connectivity into low-rank and sparse components. Based on these components, we discover a new class of networks we define as amalgamated networks, which exhibit large functional groups and dense connectivity. Analyzing recent experimental findings on cerebral cortex, food-web, and gene regulatory networks, we establish the unique importance of amalgamated networks in fostering biologically advantageous properties, including rapid communication among nodes, structural stability under attacks, and separation of network activity into distinct functional modules. We further observe that our network characterization is scalable with network size and connectivity, thereby identifying robust features significant to diverse physical systems, which are typically undetectable by conventional characterizations of connectivity. We expect that studying the amalgamation properties of biological networks may offer new insights into understanding their structure-function relationships. PMID:26035066
Chen, Bor-Sen; Lin, Ying-Po
2013-01-01
In ecological networks, network robustness should be large enough to confer intrinsic robustness for tolerating intrinsic parameter fluctuations, as well as environmental robustness for resisting environmental disturbances, so that the phenotype stability of ecological networks can be maintained, thus guaranteeing phenotype robustness. However, it is difficult to analyze the network robustness of ecological systems because they are complex nonlinear partial differential stochastic systems. This paper develops a unifying mathematical framework for investigating the principles of both robust stabilization and environmental disturbance sensitivity in ecological networks. We found that the phenotype robustness criterion for ecological networks is that if intrinsic robustness + environmental robustness ≦ network robustness, then the phenotype robustness can be maintained in spite of intrinsic parameter fluctuations and environmental disturbances. These results in robust ecological networks are similar to that in robust gene regulatory networks and evolutionary networks even they have different spatial-time scales. PMID:23515112
Intrinsic brain connectivity in fibromyalgia is associated with chronic pain intensity.
Napadow, Vitaly; LaCount, Lauren; Park, Kyungmo; As-Sanie, Sawsan; Clauw, Daniel J; Harris, Richard E
2010-08-01
Fibromyalgia (FM) is considered to be the prototypical central chronic pain syndrome and is associated with widespread pain that fluctuates spontaneously. Multiple studies have demonstrated altered brain activity in these patients. The objective of this study was to investigate the degree of connectivity between multiple brain networks in patients with FM, as well as how activity in these networks correlates with the level of spontaneous pain. Resting-state functional magnetic resonance imaging (FMRI) data from 18 patients with FM and 18 age-matched healthy control subjects were analyzed using dual-regression independent components analysis, which is a data-driven approach for the identification of independent brain networks. Intrinsic, or resting-state, connectivity was evaluated in multiple brain networks: the default mode network (DMN), the executive attention network (EAN), and the medial visual network (MVN), with the MVN serving as a negative control. Spontaneous pain levels were also analyzed for covariance with intrinsic connectivity. Patients with FM had greater connectivity within the DMN and right EAN (corrected P [P(corr)] < 0.05 versus controls), and greater connectivity between the DMN and the insular cortex, which is a brain region known to process evoked pain. Furthermore, greater intensity of spontaneous pain at the time of the FMRI scan correlated with greater intrinsic connectivity between the insula and both the DMN and right EAN (P(corr) < 0.05). These findings indicate that resting brain activity within multiple networks is associated with spontaneous clinical pain in patients with FM. These findings may also have broader implications for how subjective experiences such as pain arise from a complex interplay among multiple brain networks.
Minimum spanning tree analysis of the human connectome.
van Dellen, Edwin; Sommer, Iris E; Bohlken, Marc M; Tewarie, Prejaas; Draaisma, Laurijn; Zalesky, Andrew; Di Biase, Maria; Brown, Jesse A; Douw, Linda; Otte, Willem M; Mandl, René C W; Stam, Cornelis J
2018-06-01
One of the challenges of brain network analysis is to directly compare network organization between subjects, irrespective of the number or strength of connections. In this study, we used minimum spanning tree (MST; a unique, acyclic subnetwork with a fixed number of connections) analysis to characterize the human brain network to create an empirical reference network. Such a reference network could be used as a null model of connections that form the backbone structure of the human brain. We analyzed the MST in three diffusion-weighted imaging datasets of healthy adults. The MST of the group mean connectivity matrix was used as the empirical null-model. The MST of individual subjects matched this reference MST for a mean 58%-88% of connections, depending on the analysis pipeline. Hub nodes in the MST matched with previously reported locations of hub regions, including the so-called rich club nodes (a subset of high-degree, highly interconnected nodes). Although most brain network studies have focused primarily on cortical connections, cortical-subcortical connections were consistently present in the MST across subjects. Brain network efficiency was higher when these connections were included in the analysis, suggesting that these tracts may be utilized as the major neural communication routes. Finally, we confirmed that MST characteristics index the effects of brain aging. We conclude that the MST provides an elegant and straightforward approach to analyze structural brain networks, and to test network topological features of individual subjects in comparison to empirical null models. © 2018 The Authors Human Brain Mapping Published by Wiley Periodicals, Inc.
Multi-parametric centrality method for graph network models
NASA Astrophysics Data System (ADS)
Ivanov, Sergei Evgenievich; Gorlushkina, Natalia Nikolaevna; Ivanova, Lubov Nikolaevna
2018-04-01
The graph model networks are investigated to determine centrality, weights and the significance of vertices. For centrality analysis appliesa typical method that includesany one of the properties of graph vertices. In graph theory, methods of analyzing centrality are used: in terms by degree, closeness, betweenness, radiality, eccentricity, page-rank, status, Katz and eigenvector. We have proposed a new method of multi-parametric centrality, which includes a number of basic properties of the network member. The mathematical model of multi-parametric centrality method is developed. Comparison of results for the presented method with the centrality methods is carried out. For evaluate the results for the multi-parametric centrality methodthe graph model with hundreds of vertices is analyzed. The comparative analysis showed the accuracy of presented method, includes simultaneously a number of basic properties of vertices.
Potential of OFDM for next generation optical access
NASA Astrophysics Data System (ADS)
Fritzsche, Daniel; Weis, Erik; Breuer, Dirk
2011-01-01
This paper shows the requirements for next generation optical access (NGOA) networks and analyzes the potential of OFDM (orthogonal frequency division multiplexing) for the use in such network scenarios. First, we show the motivation for NGOA systems based on the future requirements on FTTH access systems and list the advantages of OFDM in such scenarios. In the next part, the basics of OFDM and different methods to generate and detect optical OFDM signals are explained and analyzed. At the transmitter side the options include intensity modulation and the more advanced field modulation of the optical OFDM signal. At the receiver there is the choice between direct detection and coherent detection. As the result of this discussion we show our vision of the future use of OFDM in optical access networks.
Analyzing the causation of a railway accident based on a complex network
NASA Astrophysics Data System (ADS)
Ma, Xin; Li, Ke-Ping; Luo, Zi-Yan; Zhou, Jin
2014-02-01
In this paper, a new model is constructed for the causation analysis of railway accident based on the complex network theory. In the model, the nodes are defined as various manifest or latent accident causal factors. By employing the complex network theory, especially its statistical indicators, the railway accident as well as its key causations can be analyzed from the overall perspective. As a case, the “7.23” China—Yongwen railway accident is illustrated based on this model. The results show that the inspection of signals and the checking of line conditions before trains run played an important role in this railway accident. In conclusion, the constructed model gives a theoretical clue for railway accident prediction and, hence, greatly reduces the occurrence of railway accidents.
NASA Astrophysics Data System (ADS)
Li, Li; Zhang, Yunwei; Chen, Ling
2018-03-01
In order to solve the problem of selecting positioning technology for inspection robot in underground pipeline environment, the wireless network signal strength and GPS positioning signal testing are carried out in the actual underground pipeline environment. Firstly, the strength variation of the 3G wireless network signal and Wi-Fi wireless signal provided by China Telecom and China Unicom ground base stations are tested, and the attenuation law of these wireless signals along the pipeline is analyzed quantitatively and described. Then, the receiving data of the GPS satellite signal in the pipeline are tested, and the attenuation of GPS satellite signal under underground pipeline is analyzed. The testing results may be reference for other related research which need to consider positioning in pipeline.
NASA Astrophysics Data System (ADS)
Siejka, Zbigniew
2017-09-01
GNSS systems are currently the basic tools for determination of the highest precision station coordinates (e.g. basic control network stations or stations used in the networks for geodynamic studies) as well as for land, maritime and air navigation. All of these tasks are carried out using active, large scale, satellite geodetic networks which are complex, intelligent teleinformatic systems offering post processing services along with corrections delivered in real-time for kinematic measurements. Many countries in the world, also in Europe, have built their own multifunctional networks and enhance them with their own GNSS augmentation systems. Nowadays however, in the era of international integration, there is a necessity to consider collective actions in order to build a unified system, covering e.g. the whole Europe or at least some of its regions. Such actions have already been undertaken in many regions of the world. In Europe such an example is the development for EUPOS which consists of active national networks built in central eastern European countries. So far experience and research show, that the critical areas for connecting these networks are border areas, in which the positioning accuracy decreases (Krzeszowski and Bosy, 2011). This study attempts to evaluate the border area compatibility of Polish ASG-EUPOS (European Position Determination System) reference stations and Ukrainian GeoTerrace system reference stations in the context of their future incorporation into the EUPOS. The two networks analyzed in work feature similar hardware parameters. In the ASG-EUPOS reference stations network, during the analyzed period, 2 stations (WLDW and CHEL) used only one system (GPS), while, in the GeoTerrace network, all the stations were equipped with both GPS and GLONASS receivers. The ASG EUPOS reference station network (95.6%) has its average completeness greater by about 6% when compared to the GeoTerrace network (89.8%).
Global Electricity Trade Network: Structures and Implications
Ji, Ling; Jia, Xiaoping; Chiu, Anthony S. F.; Xu, Ming
2016-01-01
Nations increasingly trade electricity, and understanding the structure of the global power grid can help identify nations that are critical for its reliability. This study examines the global grid as a network with nations as nodes and international electricity trade as links. We analyze the structure of the global electricity trade network and find that the network consists of four sub-networks, and provide a detailed analysis of the largest network, Eurasia. Russia, China, Ukraine, and Azerbaijan have high betweenness measures in the Eurasian sub-network, indicating the degrees of centrality of the positions they hold. The analysis reveals that the Eurasian sub-network consists of seven communities based on the network structure. We find that the communities do not fully align with geographical proximity, and that the present international electricity trade in the Eurasian sub-network causes an approximately 11 million additional tons of CO2 emissions. PMID:27504825
Global Electricity Trade Network: Structures and Implications.
Ji, Ling; Jia, Xiaoping; Chiu, Anthony S F; Xu, Ming
2016-01-01
Nations increasingly trade electricity, and understanding the structure of the global power grid can help identify nations that are critical for its reliability. This study examines the global grid as a network with nations as nodes and international electricity trade as links. We analyze the structure of the global electricity trade network and find that the network consists of four sub-networks, and provide a detailed analysis of the largest network, Eurasia. Russia, China, Ukraine, and Azerbaijan have high betweenness measures in the Eurasian sub-network, indicating the degrees of centrality of the positions they hold. The analysis reveals that the Eurasian sub-network consists of seven communities based on the network structure. We find that the communities do not fully align with geographical proximity, and that the present international electricity trade in the Eurasian sub-network causes an approximately 11 million additional tons of CO2 emissions.
Analyzing Human Communication Networks in Organizations: Applications to Management Problems.
ERIC Educational Resources Information Center
Farace, Richard V.; Danowski, James A.
Investigating the networks of communication in organizations leads to an understanding of efficient and inefficient information dissemination as practiced in large systems. Most important in organizational communication is the role of the "liaison person"--the coordinator of intercommunication. When functioning efficiently, coordinators maintain…
Semantic network analysis of vaccine sentiment in online social media.
Kang, Gloria J; Ewing-Nelson, Sinclair R; Mackey, Lauren; Schlitt, James T; Marathe, Achla; Abbas, Kaja M; Swarup, Samarth
2017-06-22
To examine current vaccine sentiment on social media by constructing and analyzing semantic networks of vaccine information from highly shared websites of Twitter users in the United States; and to assist public health communication of vaccines. Vaccine hesitancy continues to contribute to suboptimal vaccination coverage in the United States, posing significant risk of disease outbreaks, yet remains poorly understood. We constructed semantic networks of vaccine information from internet articles shared by Twitter users in the United States. We analyzed resulting network topology, compared semantic differences, and identified the most salient concepts within networks expressing positive, negative, and neutral vaccine sentiment. The semantic network of positive vaccine sentiment demonstrated greater cohesiveness in discourse compared to the larger, less-connected network of negative vaccine sentiment. The positive sentiment network centered around parents and focused on communicating health risks and benefits, highlighting medical concepts such as measles, autism, HPV vaccine, vaccine-autism link, meningococcal disease, and MMR vaccine. In contrast, the negative network centered around children and focused on organizational bodies such as CDC, vaccine industry, doctors, mainstream media, pharmaceutical companies, and United States. The prevalence of negative vaccine sentiment was demonstrated through diverse messaging, framed around skepticism and distrust of government organizations that communicate scientific evidence supporting positive vaccine benefits. Semantic network analysis of vaccine sentiment in online social media can enhance understanding of the scope and variability of current attitudes and beliefs toward vaccines. Our study synthesizes quantitative and qualitative evidence from an interdisciplinary approach to better understand complex drivers of vaccine hesitancy for public health communication, to improve vaccine confidence and vaccination coverage in the United States. Copyright © 2017. Published by Elsevier Ltd.
Top-Down Network Effective Connectivity in Abstinent Substance Dependent Individuals
Regner, Michael F.; Saenz, Naomi; Maharajh, Keeran; Yamamoto, Dorothy J.; Mohl, Brianne; Wylie, Korey; Tregellas, Jason; Tanabe, Jody
2016-01-01
Objective We hypothesized that compared to healthy controls, long-term abstinent substance dependent individuals (SDI) will differ in their effective connectivity between large-scale brain networks and demonstrate increased directional information from executive control to interoception-, reward-, and habit-related networks. In addition, using graph theory to compare network efficiencies we predicted decreased small-worldness in SDI compared to controls. Methods 50 SDI and 50 controls of similar sex and age completed psychological surveys and resting state fMRI. fMRI results were analyzed using group independent component analysis; 14 networks-of-interest (NOI) were selected using template matching to a canonical set of resting state networks. The number, direction, and strength of connections between NOI were analyzed with Granger Causality. Within-group thresholds were p<0.005 using a bootstrap permutation. Between group thresholds were p<0.05, FDR-corrected for multiple comparisons. NOI were correlated with behavioral measures, and group-level graph theory measures were compared. Results Compared to controls, SDI showed significantly greater Granger causal connectivity from right executive control network (RECN) to dorsal default mode network (dDMN) and from dDMN to basal ganglia network (BGN). RECN was negatively correlated with impulsivity, behavioral approach, and negative affect; dDMN was positively correlated with impulsivity. Among the 14 NOI, SDI showed greater bidirectional connectivity; controls showed more unidirectional connectivity. SDI demonstrated greater global efficiency and lower local efficiency. Conclusions Increased effective connectivity in long-term abstinent drug users may reflect improved cognitive control over habit and reward processes. Higher global and lower local efficiency across all networks in SDI compared to controls may reflect connectivity changes associated with drug dependence or remission and requires future, longitudinal studies to confirm. PMID:27776135
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.
Whose stress is making me sick? Network-stress and emotional distress in African-American women.
Woods-Giscombé, Cheryl L; Lobel, Marci; Zimmer, Catherine; Wiley Cené, Crystal; Corbie-Smith, Giselle
2015-01-01
Research on stress-related health outcomes in African-American women often neglects "network-stress": stress related to events that occur to family, friends, or loved ones. Data from the African-American Women's Well-Being Study were analyzed to examine self-stress and network-stress for occurrence, perceived stressfulness, and association with symptoms of psychological distress. Women reported a higher number of network-stress events compared with self-stress events. Occurrences of network-stress were perceived as undesirable and bothersome as self-stress. Both types of stress were significantly associated with psychological distress symptoms. Including network-stress may provide a more complete picture of the stress experiences of African-American women.
Network centrality measures and systemic risk: An application to the Turkish financial crisis
NASA Astrophysics Data System (ADS)
Kuzubaş, Tolga Umut; Ömercikoğlu, Inci; Saltoğlu, Burak
2014-07-01
In this paper, we analyze the performance of several network centrality measures in detecting systemically important financial institutions (SIFI) using data from the Turkish Interbank market during the financial crisis in 2000. We employ various network investigation tools such as volume, transactions, links, connectivity and reciprocity to gain a clearer picture of the network topology of the interbank market. We study the main borrower role of Demirbank in the crash of the banking system with network centrality measures which are extensively used in the network theory. This ex-post analysis of the crisis shows that centrality measures perform well in identifying and monitoring systemically important financial institutions which provide useful insights for financial regulations.
Title: Chimeras in small, globally coupled networks: Experiments and stability analysis
NASA Astrophysics Data System (ADS)
Hart, Joseph D.; Bansal, Kanika; Murphy, Thomas E.; Roy, Rajarshi
Since the initial observation of chimera states, there has been much discussion of the conditions under which these states emerge. The emphasis thus far has mainly been to analyze large networks of coupled oscillators; however, recent studies have begun to focus on the opposite limit: what is the smallest system of coupled oscillators in which chimeras can exist? We experimentally observe chimeras and other partially synchronous patterns in a network of four globally-coupled chaotic opto-electronic oscillators. By examining the equations of motion, we demonstrate that symmetries in the network topology allow a variety of synchronous states to exist, including cluster synchronous states and a chimera state. Using the group theoretical approach recently developed for analyzing cluster synchronization, we show how to derive the variational equations for these synchronous patterns and calculate their linear stability. The stability analysis gives good agreement with our experimental results. Both experiments and simulations suggest that these chimera states often appear in regions of multistability between global, cluster, and desynchronized states.
The signal extraction of fetal heart rate based on wavelet transform and BP neural network
NASA Astrophysics Data System (ADS)
Yang, Xiao Hong; Zhang, Bang-Cheng; Fu, Hu Dai
2005-04-01
This paper briefly introduces the collection and recognition of bio-medical signals, designs the method to collect FM signals. A detailed discussion on the system hardware, structure and functions is also given. Under LabWindows/CVI,the hardware and the driver do compatible, the hardware equipment work properly actively. The paper adopts multi threading technology for real-time analysis and makes use of latency time of CPU effectively, expedites program reflect speed, improves the program to perform efficiency. One threading is collecting data; the other threading is analyzing data. Using the method, it is broaden to analyze the signal in real-time. Wavelet transform to remove the main interference in the FM and by adding time-window to recognize with BP network; Finally the results of collecting signals and BP networks are discussed. 8 pregnant women's signals of FM were collected successfully by using the sensor. The correctness rate of BP network recognition is about 83.3% by using the above measure.
Computer-aided design of biological circuits using TinkerCell.
Chandran, Deepak; Bergmann, Frank T; Sauro, Herbert M
2010-01-01
Synthetic biology is an engineering discipline that builds on modeling practices from systems biology and wet-lab techniques from genetic engineering. As synthetic biology advances, efficient procedures will be developed that will allow a synthetic biologist to design, analyze, and build biological networks. In this idealized pipeline, computer-aided design (CAD) is a necessary component. The role of a CAD application would be to allow efficient transition from a general design to a final product. TinkerCell is a design tool for serving this purpose in synthetic biology. In TinkerCell, users build biological networks using biological parts and modules. The network can be analyzed using one of several functions provided by TinkerCell or custom programs from third-party sources. Since best practices for modeling and constructing synthetic biology networks have not yet been established, TinkerCell is designed as a flexible and extensible application that can adjust itself to changes in the field. © 2010 Landes Bioscience
A Framework for Analyzing and Testing the Performance of Software Services
NASA Astrophysics Data System (ADS)
Bertolino, Antonia; de Angelis, Guglielmo; di Marco, Antinisca; Inverardi, Paola; Sabetta, Antonino; Tivoli, Massimo
Networks "Beyond the 3rd Generation" (B3G) are characterized by mobile and resource-limited devices that communicate through different kinds of network interfaces. Software services deployed in such networks shall adapt themselves according to possible execution contexts and requirement changes. At the same time, software services have to be competitive in terms of the Quality of Service (QoS) provided, or perceived by the end user.
Fiber to the home: next generation network
NASA Astrophysics Data System (ADS)
Yang, Chengxin; Guo, Baoping
2006-07-01
Next generation networks capable of carrying converged telephone, television (TV), very high-speed internet, and very high-speed bi-directional data services (like video-on-demand (VOD), Game etc.) strategy for Fiber To The Home (FTTH) is presented. The potential market is analyzed. The barriers and some proper strategy are also discussed. Several technical problems like various powering methods, optical fiber cables, and different network architecture are discussed too.
Random Resistor Network Model of Minimal Conductivity in Graphene
NASA Astrophysics Data System (ADS)
Cheianov, Vadim V.; Fal'Ko, Vladimir I.; Altshuler, Boris L.; Aleiner, Igor L.
2007-10-01
Transport in undoped graphene is related to percolating current patterns in the networks of n- and p-type regions reflecting the strong bipolar charge density fluctuations. Finite transparency of the p-n junctions is vital in establishing the macroscopic conductivity. We propose a random resistor network model to analyze scaling dependencies of the conductance on the doping and disorder, the quantum magnetoresistance and the corresponding dephasing rate.
Learning to Predict Social Influence in Complex Networks
2012-03-29
03/2010 – 17/03/2012 Abstract: First, we addressed the problem of analyzing information diffusion process in a social network using two kinds...algorithm which avoids the inner loop optimization during the search. We tested the performance using the structures of four real world networks, and...result of information diffusion that starts from the node. 2 We use “infected” and “activated” interchangeably. Efficient Discovery of Influential
ERIC Educational Resources Information Center
Asselin, Martha Jo
2012-01-01
With the rising number of major crises on college campuses today (Security on Campus Inc., 2009), institutions of higher education can benefit from understanding of how social networks may be used in times of emergency. What is currently known about the usage of social networks is not integral to the current practices of crisis management that are…
A recurrence network approach to analyzing forced synchronization in hydrodynamic systems
NASA Astrophysics Data System (ADS)
Murugesan, Meenatchidevi; Zhu, Yuanhang; Li, Larry K. B.
2016-11-01
Hydrodynamically self-excited systems can lock into external forcing, but their lock-in boundaries and the specific bifurcations through which they lock in can be difficult to detect. We propose using recurrence networks to analyze forced synchronization in a hydrodynamic system: a low-density jet. We find that as the jet bifurcates from periodicity (unforced) to quasiperiodicity (weak forcing) and then to lock-in (strong forcing), its recurrence network changes from a regular distribution of links between nodes (unforced) to a disordered topology (weak forcing) and then to a regular distribution again at lock-in (strong forcing). The emergence of order at lock-in can be either smooth or abrupt depending on the specific lock-in route taken. Furthermore, we find that before lock-in, the probability distribution of links in the network is a function of the characteristic scales of the system, which can be quantified with network measures and used to estimate the proximity to the lock-in boundaries. This study shows that recurrence networks can be used (i) to detect lock-in, (ii) to distinguish between different routes to lock-in, and (iii) as an early warning indicator of the proximity of a system to its lock-in boundaries. This work was supported by the Research Grants Council of Hong Kong (Project No. 16235716 and 26202815).
Iturri, Peio López; Nazábal, Juan Antonio; Azpilicueta, Leire; Rodriguez, Pablo; Beruete, Miguel; Fernández-Valdivielso, Carlos; Falcone, Francisco
2012-01-01
In this work, the impact of radiofrequency radiation leakage from microwave ovens and its effect on 802.15.4 ZigBee-compliant wireless sensor networks operating in the 2.4 GHz Industrial Scientific Medical (ISM) band is analyzed. By means of a novel radioplanning approach, based on electromagnetic field simulation of a microwave oven and determination of equivalent radiation sources applied to an in-house developed 3D ray launching algorithm, estimation of the microwave oven's power leakage is obtained for the complete volume of an indoor scenario. The magnitude and the variable nature of the interference is analyzed and the impact in the radio link quality in operating wireless sensors is estimated and compared with radio channel measurements as well as packet measurements. The measurement results reveal the importance of selecting an adequate 802.15.4 channel, as well as the Wireless Sensor Network deployment strategy within this type of environment, in order to optimize energy consumption and increase the overall network performance. The proposed method enables one to estimate potential interference effects in devices operating within the 2.4 GHz band in the complete scenario, prior to wireless sensor network deployment, which can aid in achieving the most optimal network topology. PMID:23202228
Decreased Functional Brain Connectivity in Adolescents with Internet Addiction
Hong, Soon-Beom; Zalesky, Andrew; Cocchi, Luca; Fornito, Alex; Choi, Eun-Jung; Kim, Ho-Hyun; Suh, Jeong-Eun; Kim, Chang-Dai; Kim, Jae-Won; Yi, Soon-Hyung
2013-01-01
Background Internet addiction has become increasingly recognized as a mental disorder, though its neurobiological basis is unknown. This study used functional neuroimaging to investigate whole-brain functional connectivity in adolescents diagnosed with internet addiction. Based on neurobiological changes seen in other addiction related disorders, it was predicted that connectivity disruptions in adolescents with internet addiction would be most prominent in cortico-striatal circuitry. Methods Participants were 12 adolescents diagnosed with internet addiction and 11 healthy comparison subjects. Resting-state functional magnetic resonance images were acquired, and group differences in brain functional connectivity were analyzed using the network-based statistic. We also analyzed network topology, testing for between-group differences in key graph-based network measures. Results Adolescents with internet addiction showed reduced functional connectivity spanning a distributed network. The majority of impaired connections involved cortico-subcortical circuits (∼24% with prefrontal and ∼27% with parietal cortex). Bilateral putamen was the most extensively involved subcortical brain region. No between-group difference was observed in network topological measures, including the clustering coefficient, characteristic path length, or the small-worldness ratio. Conclusions Internet addiction is associated with a widespread and significant decrease of functional connectivity in cortico-striatal circuits, in the absence of global changes in brain functional network topology. PMID:23451272
Detecting and analyzing research communities in longitudinal scientific networks.
Leone Sciabolazza, Valerio; Vacca, Raffaele; Kennelly Okraku, Therese; McCarty, Christopher
2017-01-01
A growing body of evidence shows that collaborative teams and communities tend to produce the highest-impact scientific work. This paper proposes a new method to (1) Identify collaborative communities in longitudinal scientific networks, and (2) Evaluate the impact of specific research institutes, services or policies on the interdisciplinary collaboration between these communities. First, we apply community-detection algorithms to cross-sectional scientific collaboration networks and analyze different types of co-membership in the resulting subgroups over time. This analysis summarizes large amounts of longitudinal network data to extract sets of research communities whose members have consistently collaborated or shared collaborators over time. Second, we construct networks of cross-community interactions and estimate Exponential Random Graph Models to predict the formation of interdisciplinary collaborations between different communities. The method is applied to longitudinal data on publication and grant collaborations at the University of Florida. Results show that similar institutional affiliation, spatial proximity, transitivity effects, and use of the same research services predict higher degree of interdisciplinary collaboration between research communities. Our application also illustrates how the identification of research communities in longitudinal data and the analysis of cross-community network formation can be used to measure the growth of interdisciplinary team science at a research university, and to evaluate its association with research policies, services or institutes.
NASA Astrophysics Data System (ADS)
Xi, Huixing
2017-03-01
With the continuous development of network technology and the rapid spread of the Internet, computer networks have been around the world every corner. However, the network attacks frequently occur. The ARP protocol vulnerability is one of the most common vulnerabilities in the TCP / IP four-layer architecture. The network protocol vulnerabilities can lead to the intrusion and attack of the information system, and disable or disable the normal defense function of the system [1]. At present, ARP spoofing Trojans spread widely in the LAN, the network security to run a huge hidden danger, is the primary threat to LAN security. In this paper, the author summarizes the research status and the key technologies involved in ARP protocol, analyzes the formation mechanism of ARP protocol vulnerability, and analyzes the feasibility of the attack technique. Based on the summary of the common defensive methods, the advantages and disadvantages of each defense method. At the same time, the current defense method is improved, and the advantage of the improved defense algorithm is given. At the end of this paper, the appropriate test method is selected and the test environment is set up. Experiment and test are carried out for each proposed improved defense algorithm.
Detecting and analyzing research communities in longitudinal scientific networks
Vacca, Raffaele; Kennelly Okraku, Therese; McCarty, Christopher
2017-01-01
A growing body of evidence shows that collaborative teams and communities tend to produce the highest-impact scientific work. This paper proposes a new method to (1) Identify collaborative communities in longitudinal scientific networks, and (2) Evaluate the impact of specific research institutes, services or policies on the interdisciplinary collaboration between these communities. First, we apply community-detection algorithms to cross-sectional scientific collaboration networks and analyze different types of co-membership in the resulting subgroups over time. This analysis summarizes large amounts of longitudinal network data to extract sets of research communities whose members have consistently collaborated or shared collaborators over time. Second, we construct networks of cross-community interactions and estimate Exponential Random Graph Models to predict the formation of interdisciplinary collaborations between different communities. The method is applied to longitudinal data on publication and grant collaborations at the University of Florida. Results show that similar institutional affiliation, spatial proximity, transitivity effects, and use of the same research services predict higher degree of interdisciplinary collaboration between research communities. Our application also illustrates how the identification of research communities in longitudinal data and the analysis of cross-community network formation can be used to measure the growth of interdisciplinary team science at a research university, and to evaluate its association with research policies, services or institutes. PMID:28797047
Low-rank network decomposition reveals structural characteristics of small-world networks
NASA Astrophysics Data System (ADS)
Barranca, Victor J.; Zhou, Douglas; Cai, David
2015-12-01
Small-world networks occur naturally throughout biological, technological, and social systems. With their prevalence, it is particularly important to prudently identify small-world networks and further characterize their unique connection structure with respect to network function. In this work we develop a formalism for classifying networks and identifying small-world structure using a decomposition of network connectivity matrices into low-rank and sparse components, corresponding to connections within clusters of highly connected nodes and sparse interconnections between clusters, respectively. We show that the network decomposition is independent of node indexing and define associated bounded measures of connectivity structure, which provide insight into the clustering and regularity of network connections. While many existing network characterizations rely on constructing benchmark networks for comparison or fail to describe the structural properties of relatively densely connected networks, our classification relies only on the intrinsic network structure and is quite robust with respect to changes in connection density, producing stable results across network realizations. Using this framework, we analyze several real-world networks and reveal new structural properties, which are often indiscernible by previously established characterizations of network connectivity.
Saqr, Mohammed; Fors, Uno; Tedre, Matti
2018-02-06
Collaborative learning facilitates reflection, diversifies understanding and stimulates skills of critical and higher-order thinking. Although the benefits of collaborative learning have long been recognized, it is still rarely studied by social network analysis (SNA) in medical education, and the relationship of parameters that can be obtained via SNA with students' performance remains largely unknown. The aim of this work was to assess the potential of SNA for studying online collaborative clinical case discussions in a medical course and to find out which activities correlate with better performance and help predict final grade or explain variance in performance. Interaction data were extracted from the learning management system (LMS) forum module of the Surgery course in Qassim University, College of Medicine. The data were analyzed using social network analysis. The analysis included visual as well as a statistical analysis. Correlation with students' performance was calculated, and automatic linear regression was used to predict students' performance. By using social network analysis, we were able to analyze a large number of interactions in online collaborative discussions and gain an overall insight of the course social structure, track the knowledge flow and the interaction patterns, as well as identify the active participants and the prominent discussion moderators. When augmented with calculated network parameters, SNA offered an accurate view of the course network, each user's position, and level of connectedness. Results from correlation coefficients, linear regression, and logistic regression indicated that a student's position and role in information relay in online case discussions, combined with the strength of that student's network (social capital), can be used as predictors of performance in relevant settings. By using social network analysis, researchers can analyze the social structure of an online course and reveal important information about students' and teachers' interactions that can be valuable in guiding teachers, improve students' engagement, and contribute to learning analytics insights.
An interactive web-based system using cloud for large-scale visual analytics
NASA Astrophysics Data System (ADS)
Kaseb, Ahmed S.; Berry, Everett; Rozolis, Erik; McNulty, Kyle; Bontrager, Seth; Koh, Youngsol; Lu, Yung-Hsiang; Delp, Edward J.
2015-03-01
Network cameras have been growing rapidly in recent years. Thousands of public network cameras provide tremendous amount of visual information about the environment. There is a need to analyze this valuable information for a better understanding of the world around us. This paper presents an interactive web-based system that enables users to execute image analysis and computer vision techniques on a large scale to analyze the data from more than 65,000 worldwide cameras. This paper focuses on how to use both the system's website and Application Programming Interface (API). Given a computer program that analyzes a single frame, the user needs to make only slight changes to the existing program and choose the cameras to analyze. The system handles the heterogeneity of the geographically distributed cameras, e.g. different brands, resolutions. The system allocates and manages Amazon EC2 and Windows Azure cloud resources to meet the analysis requirements.
The Deep Space Network stability analyzer
NASA Technical Reports Server (NTRS)
Breidenthal, Julian C.; Greenhall, Charles A.; Hamell, Robert L.; Kuhnle, Paul F.
1995-01-01
A stability analyzer for testing NASA Deep Space Network installations during flight radio science experiments is described. The stability analyzer provides realtime measurements of signal properties of general experimental interest: power, phase, and amplitude spectra; Allan deviation; and time series of amplitude, phase shift, and differential phase shift. Input ports are provided for up to four 100 MHz frequency standards and eight baseband analog (greater than 100 kHz bandwidth) signals. Test results indicate the following upper bounds to noise floors when operating on 100 MHz signals: -145 dBc/Hz for phase noise spectrum further than 200 Hz from carrier, 2.5 x 10(exp -15) (tau =1 second) and 1.5 x 10(exp -17) (tau =1000 seconds) for Allan deviation, and 1 x 10(exp -4) degrees for 1-second averages of phase deviation. Four copies of the stability analyzer have been produced, plus one transportable unit for use at non-NASA observatories.
Current-flow efficiency of networks
NASA Astrophysics Data System (ADS)
Liu, Kai; Yan, Xiaoyong
2018-02-01
Many real-world networks, from infrastructure networks to social and communication networks, can be formulated as flow networks. How to realistically measure the transport efficiency of these networks is of fundamental importance. The shortest-path-based efficiency measurement has limitations, as it assumes that flow travels only along those shortest paths. Here, we propose a new metric named current-flow efficiency, in which we calculate the average reciprocal effective resistance between all pairs of nodes in the network. This metric takes the multipath effect into consideration and is more suitable for measuring the efficiency of many real-world flow equilibrium networks. Moreover, this metric can handle a disconnected graph and can thus be used to identify critical nodes and edges from the efficiency-loss perspective. We further analyze how the topological structure affects the current-flow efficiency of networks based on some model and real-world networks. Our results enable a better understanding of flow networks and shed light on the design and improvement of such networks with higher transport efficiency.
NASA Astrophysics Data System (ADS)
Wuensche, Andrew
DDLab is interactive graphics software for creating, visualizing, and analyzing many aspects of Cellular Automata, Random Boolean Networks, and Discrete Dynamical Networks in general and studying their behavior, both from the time-series perspective — space-time patterns, and from the state-space perspective — attractor basins. DDLab is relevant to research, applications, and education in the fields of complexity, self-organization, emergent phenomena, chaos, collision-based computing, neural networks, content addressable memory, genetic regulatory networks, dynamical encryption, generative art and music, and the study of the abstract mathematical/physical/dynamical phenomena in their own right.
Robust autoassociative memory with coupled networks of Kuramoto-type oscillators
NASA Astrophysics Data System (ADS)
Heger, Daniel; Krischer, Katharina
2016-08-01
Uncertain recognition success, unfavorable scaling of connection complexity, or dependence on complex external input impair the usefulness of current oscillatory neural networks for pattern recognition or restrict technical realizations to small networks. We propose a network architecture of coupled oscillators for pattern recognition which shows none of the mentioned flaws. Furthermore we illustrate the recognition process with simulation results and analyze the dynamics analytically: Possible output patterns are isolated attractors of the system. Additionally, simple criteria for recognition success are derived from a lower bound on the basins of attraction.
Optimal multi-community network modularity for information diffusion
NASA Astrophysics Data System (ADS)
Wu, Jiaocan; Du, Ruping; Zheng, Yingying; Liu, Dong
2016-02-01
Studies demonstrate that community structure plays an important role in information spreading recently. In this paper, we investigate the impact of multi-community structure on information diffusion with linear threshold model. We utilize extended GN network that contains four communities and analyze dynamic behaviors of information that spreads on it. And we discover the optimal multi-community network modularity for information diffusion based on the social reinforcement. Results show that, within the appropriate range, multi-community structure will facilitate information diffusion instead of hindering it, which accords with the results derived from two-community network.
NASA Astrophysics Data System (ADS)
Frolov, Nikita S.; Goremyko, Mikhail V.; Makarov, Vladimir V.; Maksimenko, Vladimir A.; Hramov, Alexander E.
2017-03-01
In this paper we study the conditions of chimera states excitation in ensemble of non-locally coupled Kuramoto-Sakaguchi (KS) oscillators. In the framework of current research we analyze the dynamics of the homogeneous network containing identical oscillators. We show the chimera state formation process is sensitive to the parameters of coupling kernel and to the KS network initial state. To perform the analysis we have used the Ott-Antonsen (OA) ansatz to consider the behavior of infinitely large KS network.
Chimera states in networks of logistic maps with hierarchical connectivities
NASA Astrophysics Data System (ADS)
zur Bonsen, Alexander; Omelchenko, Iryna; Zakharova, Anna; Schöll, Eckehard
2018-04-01
Chimera states are complex spatiotemporal patterns consisting of coexisting domains of coherence and incoherence. We study networks of nonlocally coupled logistic maps and analyze systematically how the dilution of the network links influences the appearance of chimera patterns. The network connectivities are constructed using an iterative Cantor algorithm to generate fractal (hierarchical) connectivities. Increasing the hierarchical level of iteration, we compare the resulting spatiotemporal patterns. We demonstrate that a high clustering coefficient and symmetry of the base pattern promotes chimera states, and asymmetric connectivities result in complex nested chimera patterns.
Analytic method for calculating properties of random walks on networks
NASA Technical Reports Server (NTRS)
Goldhirsch, I.; Gefen, Y.
1986-01-01
A method for calculating the properties of discrete random walks on networks is presented. The method divides complex networks into simpler units whose contribution to the mean first-passage time is calculated. The simplified network is then further iterated. The method is demonstrated by calculating mean first-passage times on a segment, a segment with a single dangling bond, a segment with many dangling bonds, and a looplike structure. The results are analyzed and related to the applicability of the Einstein relation between conductance and diffusion.
Effects of Vertex Activity and Self-organized Criticality Behavior on a Weighted Evolving Network
NASA Astrophysics Data System (ADS)
Zhang, Gui-Qing; Yang, Qiu-Ying; Chen, Tian-Lun
2008-08-01
Effects of vertex activity have been analyzed on a weighted evolving network. The network is characterized by the probability distribution of vertex strength, each edge weight and evolution of the strength of vertices with different vertex activities. The model exhibits self-organized criticality behavior. The probability distribution of avalanche size for different network sizes is also shown. In addition, there is a power law relation between the size and the duration of an avalanche and the average of avalanche size has been studied for different vertex activities.
2015-01-01
Prescribed by ANSI Std. Z39.18 4 1 | P a g e Network Science Center, West Point www.netscience.usma.edu 845.938.0804 January 2015...in detail in our 2 | P a g e Network Science Center, West Point www.netscience.usma.edu 845.938.0804 previous methodology paper. Based on...one of the leading universities in Sub-Saharan Africa. The student body is energetic and tech savvy. 3 | P a g e Network Science Center, West Point
Statistical significance of the rich-club phenomenon in complex networks
NASA Astrophysics Data System (ADS)
Jiang, Zhi-Qiang; Zhou, Wei-Xing
2008-04-01
We propose that the rich-club phenomenon in complex networks should be defined in the spirit of bootstrapping, in which a null model is adopted to assess the statistical significance of the rich-club detected. Our method can serve as a definition of the rich-club phenomenon and is applied to analyze three real networks and three model networks. The results show significant improvement compared with previously reported results. We report a dilemma with an exceptional example, showing that there does not exist an omnipotent definition for the rich-club phenomenon.
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.
Pan, Yue; Lu, Lingyun; Chen, Junquan; Zhong, Yong; Dai, Zhehao
2018-01-01
This study aimed to identify potential crucial genes and construction of microRNA-mRNA negative regulatory networks in osteosarcoma by comprehensive bioinformatics analysis. Data of gene expression profiles (GSE28424) and miRNA expression profiles (GSE28423) were downloaded from GEO database. The differentially expressed genes (DEGs) and miRNAs (DEMIs) were obtained by R Bioconductor packages. Functional and enrichment analyses of selected genes were performed using DAVID database. Protein-protein interaction (PPI) network was constructed by STRING and visualized in Cytoscape. The relationships among the DEGs and module in PPI network were analyzed by plug-in NetworkAnalyzer and MCODE seperately. Through the TargetScan and comparing target genes with DEGs, the miRNA-mRNA regulation network was established. Totally 346 DEGs and 90 DEMIs were found to be differentially expressed. These DEGs were enriched in biological processes and KEGG pathway of inflammatory immune response. 25 genes in the PPI network were selected as hub genes. Top 10 hub genes were TYROBP, HLA-DRA, VWF, PPBP, SERPING1, HLA-DPA1, SERPINA1, KIF20A, FERMT3, HLA-E. PPI network of DEGs followed a pattern of power law network and met the characteristics of small-world network. MCODE analysis identified 4 clusters and the most significant cluster consisted of 11 nodes and 55 edges. SEPP1, CKS2, TCAP, BPI were identified as the seed genes in their own clusters, respectively. The miRNA-mRNA regulation network which was composed of 89 pairs was established. MiR-210 had the highest connectivity with 12 target genes. Among the predicted target of MiR-96, HLA-DPA1 and TYROBP were the hub genes. Our study indicated possible differentially expressed genes and miRNA, and microRNA-mRNA negative regulatory networks in osteosarcoma by bioinformatics analysis, which may provide novel insights for unraveling pathogenesis of osteosarcoma.
Ontology- and graph-based similarity assessment in biological networks.
Wang, Haiying; Zheng, Huiru; Azuaje, Francisco
2010-10-15
A standard systems-based approach to biomarker and drug target discovery consists of placing putative biomarkers in the context of a network of biological interactions, followed by different 'guilt-by-association' analyses. The latter is typically done based on network structural features. Here, an alternative analysis approach in which the networks are analyzed on a 'semantic similarity' space is reported. Such information is extracted from ontology-based functional annotations. We present SimTrek, a Cytoscape plugin for ontology-based similarity assessment in biological networks. http://rosalind.infj.ulst.ac.uk/SimTrek.html francisco.azuaje@crp-sante.lu Supplementary data are available at Bioinformatics online.
Robustness of the p53 network and biological hackers.
Dartnell, Lewis; Simeonidis, Evangelos; Hubank, Michael; Tsoka, Sophia; Bogle, I David L; Papageorgiou, Lazaros G
2005-06-06
The p53 protein interaction network is crucial in regulating the metazoan cell cycle and apoptosis. Here, the robustness of the p53 network is studied by analyzing its degeneration under two modes of attack. Linear Programming is used to calculate average path lengths among proteins and the network diameter as measures of functionality. The p53 network is found to be robust to random loss of nodes, but vulnerable to a targeted attack against its hubs, as a result of its architecture. The significance of the results is considered with respect to mutational knockouts of proteins and the directed attacks mounted by tumour inducing viruses.
The guitar chord-generating algorithm based on complex network
NASA Astrophysics Data System (ADS)
Ren, Tao; Wang, Yi-fan; Du, Dan; Liu, Miao-miao; Siddiqi, Awais
2016-02-01
This paper aims to generate chords for popular songs automatically based on complex network. Firstly, according to the characteristics of guitar tablature, six chord networks of popular songs by six pop singers are constructed and the properties of all networks are concluded. By analyzing the diverse chord networks, the accompaniment regulations and features are shown, with which the chords can be generated automatically. Secondly, in terms of the characteristics of popular songs, a two-tiered network containing a verse network and a chorus network is constructed. With this network, the verse and chorus can be composed respectively with the random walk algorithm. Thirdly, the musical motif is considered for generating chords, with which the bad chord progressions can be revised. This method can make the accompaniments sound more melodious. Finally, a popular song is chosen for generating chords and the new generated accompaniment sounds better than those done by the composers.
Emergence, evolution and scaling of online social networks.
Wang, Le-Zhi; Huang, Zi-Gang; Rong, Zhi-Hai; Wang, Xiao-Fan; Lai, Ying-Cheng
2014-01-01
Online social networks have become increasingly ubiquitous and understanding their structural, dynamical, and scaling properties not only is of fundamental interest but also has a broad range of applications. Such networks can be extremely dynamic, generated almost instantaneously by, for example, breaking-news items. We investigate a common class of online social networks, the user-user retweeting networks, by analyzing the empirical data collected from Sina Weibo (a massive twitter-like microblogging social network in China) with respect to the topic of the 2011 Japan earthquake. We uncover a number of algebraic scaling relations governing the growth and structure of the network and develop a probabilistic model that captures the basic dynamical features of the system. The model is capable of reproducing all the empirical results. Our analysis not only reveals the basic mechanisms underlying the dynamics of the retweeting networks, but also provides general insights into the control of information spreading on such networks.
The development of Human Functional Brain Networks
Power, Jonathan D; Fair, Damien A; Schlaggar, Bradley L
2010-01-01
Recent advances in MRI technology have enabled precise measurements of correlated activity throughout the brain, leading to the first comprehensive descriptions of functional brain networks in humans. This article reviews the growing literature on the development of functional networks, from infancy through adolescence, as measured by resting state functional connectivity MRI. We note several limitations of traditional approaches to describing brain networks, and describe a powerful framework for analyzing networks, called graph theory. We argue that characterization of the development of brain systems (e.g. the default mode network) should be comprehensive, considering not only relationships within a given system, but also how these relationships are situated within wider network contexts. We note that, despite substantial reorganization of functional connectivity, several large-scale network properties appear to be preserved across development, suggesting that functional brain networks, even in children, are organized in manners similar to other complex systems. PMID:20826306
Network architecture in a converged optical + IP network
NASA Astrophysics Data System (ADS)
Wakim, Walid; Zottmann, Harald
2012-01-01
As demands on Provider Networks continue to grow at exponential rates, providers are forced to evaluate how to continue to grow the network while increasing service velocity, enhancing resiliency while decreasing the total cost of ownership (TCO). The bandwidth growth that networks are experiencing is in the form packet based multimedia services such as video, video conferencing, gaming, etc... mixed with Over the Top (OTT) content providers such as Netflix, and the customer's expectations that best effort is not enough you end up with a situation that forces the provider to analyze how to gain more out of the network with less cost. In this paper we will discuss changes in the network that are driving us to a tighter integration between packet and optical layers and how to improve on today's multi - layer inefficiencies to drive down network TCO and provide for a fully integrated and dynamic network that will decrease time to revenue.
Bassett, Danielle S; Sporns, Olaf
2017-01-01
Despite substantial recent progress, our understanding of the principles and mechanisms underlying complex brain function and cognition remains incomplete. Network neuroscience proposes to tackle these enduring challenges. Approaching brain structure and function from an explicitly integrative perspective, network neuroscience pursues new ways to map, record, analyze and model the elements and interactions of neurobiological systems. Two parallel trends drive the approach: the availability of new empirical tools to create comprehensive maps and record dynamic patterns among molecules, neurons, brain areas and social systems; and the theoretical framework and computational tools of modern network science. The convergence of empirical and computational advances opens new frontiers of scientific inquiry, including network dynamics, manipulation and control of brain networks, and integration of network processes across spatiotemporal domains. We review emerging trends in network neuroscience and attempt to chart a path toward a better understanding of the brain as a multiscale networked system. PMID:28230844
Active distribution network planning considering linearized system loss
NASA Astrophysics Data System (ADS)
Li, Xiao; Wang, Mingqiang; Xu, Hao
2018-02-01
In this paper, various distribution network planning techniques with DGs are reviewed, and a new distribution network planning method is proposed. It assumes that the location of DGs and the topology of the network are fixed. The proposed model optimizes the capacities of DG and the optimal distribution line capacity simultaneously by a cost/benefit analysis and the benefit is quantified by the reduction of the expected interruption cost. Besides, the network loss is explicitly analyzed in the paper. For simplicity, the network loss is appropriately simplified as a quadratic function of difference of voltage phase angle. Then it is further piecewise linearized. In this paper, a piecewise linearization technique with different segment lengths is proposed. To validate its effectiveness and superiority, the proposed distribution network planning model with elaborate linearization technique is tested on the IEEE 33-bus distribution network system.
Protocol vulnerability detection based on network traffic analysis and binary reverse engineering.
Wen, Shameng; Meng, Qingkun; Feng, Chao; Tang, Chaojing
2017-01-01
Network protocol vulnerability detection plays an important role in many domains, including protocol security analysis, application security, and network intrusion detection. In this study, by analyzing the general fuzzing method of network protocols, we propose a novel approach that combines network traffic analysis with the binary reverse engineering method. For network traffic analysis, the block-based protocol description language is introduced to construct test scripts, while the binary reverse engineering method employs the genetic algorithm with a fitness function designed to focus on code coverage. This combination leads to a substantial improvement in fuzz testing for network protocols. We build a prototype system and use it to test several real-world network protocol implementations. The experimental results show that the proposed approach detects vulnerabilities more efficiently and effectively than general fuzzing methods such as SPIKE.
Evolution of cooperation under social pressure in multiplex networks
NASA Astrophysics Data System (ADS)
Pereda, María
2016-09-01
In this work, we aim to contribute to the understanding of human prosocial behavior by studying the influence that a particular form of social pressure, "being watched," has on the evolution of cooperative behavior. We study how cooperation emerges in multiplex complex topologies by analyzing a particular bidirectionally coupled dynamics on top of a two-layer multiplex network (duplex). The coupled dynamics appears between the prisoner's dilemma game in a network and a threshold cascade model in the other. The threshold model is intended to abstract the behavior of a network of vigilant nodes that impose the pressure of being observed altering hence the temptation to defect of the dilemma. Cooperation or defection in the game also affects the state of a node of being vigilant. We analyze these processes on different duplex networks structures and assess the influence of the topology, average degree and correlated multiplexity, on the outcome of cooperation. Interestingly, we find that the social pressure of vigilance may impact cooperation positively or negatively, depending on the duplex structure, specifically the degree correlations between layers is determinant. Our results give further quantitative insights in the promotion of cooperation under social pressure.
Wang, Xin; Birch, Stephen; Ma, Huifen; Zhu, Weiming; Meng, Qingyue
2016-08-12
Facing the challenges of aging populations, increasing chronic diseases prevalence and health system fragmentation, there have been several pilots of integrated health systems in China. But little is known about their structure, mechanism and effectiveness. The aim of this paper is to analyze health system integration and develop recommendations for achieving integration. Huangzhong and Hualong counties in Qinghai province were studied as study sites, with only Huangzhong having implemented health system integration. Questionnaires, interviews, and health insurance records were sources of data. Social network analysis was employed to analyze integration, through structure measurement and effectiveness evaluation. Health system integration in Huangzhong is higher than in Hualong, so is system effectiveness. The patient referral network in Hualong has more "leapfrog" referrals. The information sharing networks in both counties are larger than the other types of networks. The average distance in the joint training network of Huangzhong is less than in Hualong. Meanwhile, there are deficiencies common to both systems. Both county health systems have strengths and limitations regarding system integration. The use of medical consortia in Huangzhong has contributed to system effectiveness. Future research might consider alternative more context specific models of health system integration.
Proteome reference map and regulation network of neonatal rat cardiomyocyte
Li, Zi-jian; Liu, Ning; Han, Qi-de; Zhang, You-yi
2011-01-01
Aim: To study and establish a proteome reference map and regulation network of neonatal rat cardiomyocyte. Methods: Cultured cardiomyocytes of neonatal rats were used. All proteins expressed in the cardiomyocytes were separated and identified by two-dimensional polyacrylamide gel electrophoresis (2-DE) and matrix-assisted laser desorption/ionization-time of flight mass spectrometry (MALDI-TOF MS). Biological networks and pathways of the neonatal rat cardiomyocytes were analyzed using the Ingenuity Pathway Analysis (IPA) program (www.ingenuity.com). A 2-DE database was made accessible on-line by Make2ddb package on a web server. Results: More than 1000 proteins were separated on 2D gels, and 148 proteins were identified. The identified proteins were used for the construction of an extensible markup language-based database. Biological networks and pathways were constructed to analyze the functions associate with cardiomyocyte proteins in the database. The 2-DE database of rat cardiomyocyte proteins can be accessed at http://2d.bjmu.edu.cn. Conclusion: A proteome reference map and regulation network of the neonatal rat cardiomyocytes have been established, which may serve as an international platform for storage, analysis and visualization of cardiomyocyte proteomic data. PMID:21841810
Investigating Driver Fatigue versus Alertness Using the Granger Causality Network.
Kong, Wanzeng; Lin, Weicheng; Babiloni, Fabio; Hu, Sanqing; Borghini, Gianluca
2015-08-05
Driving fatigue has been identified as one of the main factors affecting drivers' safety. The aim of this study was to analyze drivers' different mental states, such as alertness and drowsiness, and find out a neurometric indicator able to detect drivers' fatigue level in terms of brain networks. Twelve young, healthy subjects were recruited to take part in a driver fatigue experiment under different simulated driving conditions. The Electroencephalogram (EEG) signals of the subjects were recorded during the whole experiment and analyzed by using Granger-Causality-based brain effective networks. It was that the topology of the brain networks and the brain's ability to integrate information changed when subjects shifted from the alert to the drowsy stage. In particular, there was a significant difference in terms of strength of Granger causality (GC) in the frequency domain and the properties of the brain effective network i.e., causal flow, global efficiency and characteristic path length between such conditions. Also, some changes were more significant over the frontal brain lobes for the alpha frequency band. These findings might be used to detect drivers' fatigue levels, and as reference work for future studies.
Investigating Driver Fatigue versus Alertness Using the Granger Causality Network
Kong, Wanzeng; Lin, Weicheng; Babiloni, Fabio; Hu, Sanqing; Borghini, Gianluca
2015-01-01
Driving fatigue has been identified as one of the main factors affecting drivers’ safety. The aim of this study was to analyze drivers’ different mental states, such as alertness and drowsiness, and find out a neurometric indicator able to detect drivers’ fatigue level in terms of brain networks. Twelve young, healthy subjects were recruited to take part in a driver fatigue experiment under different simulated driving conditions. The Electroencephalogram (EEG) signals of the subjects were recorded during the whole experiment and analyzed by using Granger-Causality-based brain effective networks. It was that the topology of the brain networks and the brain’s ability to integrate information changed when subjects shifted from the alert to the drowsy stage. In particular, there was a significant difference in terms of strength of Granger causality (GC) in the frequency domain and the properties of the brain effective network i.e., causal flow, global efficiency and characteristic path length between such conditions. Also, some changes were more significant over the frontal brain lobes for the alpha frequency band. These findings might be used to detect drivers’ fatigue levels, and as reference work for future studies. PMID:26251909
Maximal qubit violation of n-locality inequalities in a star-shaped quantum network
NASA Astrophysics Data System (ADS)
Andreoli, Francesco; Carvacho, Gonzalo; Santodonato, Luca; Chaves, Rafael; Sciarrino, Fabio
2017-11-01
Bell's theorem was a cornerstone for our understanding of quantum theory and the establishment of Bell non-locality played a crucial role in the development of quantum information. Recently, its extension to complex networks has been attracting growing attention, but a deep characterization of quantum behavior is still missing for this novel context. In this work we analyze quantum correlations arising in the bilocality scenario, that is a tripartite quantum network where the correlations between the parties are mediated by two independent sources of states. First, we prove that non-bilocal correlations witnessed through a Bell-state measurement in the central node of the network form a subset of those obtainable by means of a local projective measurement. This leads us to derive the maximal violation of the bilocality inequality that can be achieved by arbitrary two-qubit quantum states and arbitrary local projective measurements. We then analyze in details the relation between the violation of the bilocality inequality and the CHSH inequality. Finally, we show how our method can be extended to the n-locality scenario consisting of n two-qubit quantum states distributed among n+1 nodes of a star-shaped network.
Evolution of cooperation under social pressure in multiplex networks.
Pereda, María
2016-09-01
In this work, we aim to contribute to the understanding of human prosocial behavior by studying the influence that a particular form of social pressure, "being watched," has on the evolution of cooperative behavior. We study how cooperation emerges in multiplex complex topologies by analyzing a particular bidirectionally coupled dynamics on top of a two-layer multiplex network (duplex). The coupled dynamics appears between the prisoner's dilemma game in a network and a threshold cascade model in the other. The threshold model is intended to abstract the behavior of a network of vigilant nodes that impose the pressure of being observed altering hence the temptation to defect of the dilemma. Cooperation or defection in the game also affects the state of a node of being vigilant. We analyze these processes on different duplex networks structures and assess the influence of the topology, average degree and correlated multiplexity, on the outcome of cooperation. Interestingly, we find that the social pressure of vigilance may impact cooperation positively or negatively, depending on the duplex structure, specifically the degree correlations between layers is determinant. Our results give further quantitative insights in the promotion of cooperation under social pressure.
Cai, Shanqing; Tourville, Jason A.; Beal, Deryk S.; Perkell, Joseph S.; Guenther, Frank H.; Ghosh, Satrajit S.
2013-01-01
Deficits in brain white matter have been a main focus of recent neuroimaging studies on stuttering. However, no prior study has examined brain connectivity on the global level of the cerebral cortex in persons who stutter (PWS). In the current study, we analyzed the results from probabilistic tractography between regions comprising the cortical speech network. An anatomical parcellation scheme was used to define 28 speech production-related ROIs in each hemisphere. We used network-based statistic (NBS) and graph theory to analyze the connectivity patterns obtained from tractography. At the network-level, the probabilistic corticocortical connectivity from the PWS group were significantly weaker than that from persons with fluent speech (PFS). NBS analysis revealed significant components in the bilateral speech networks with negative correlations with stuttering severity. To facilitate comparison with previous studies, we also performed tract-based spatial statistics (TBSS) and regional fractional anisotropy (FA) averaging. Results from tractography, TBSS and regional FA averaging jointly highlight the importance of several regions in the left peri-Rolandic sensorimotor and premotor areas, most notably the left ventral premotor cortex (vPMC) and middle primary motor cortex, in the neuroanatomical basis of stuttering. PMID:24611042
Cai, Shanqing; Tourville, Jason A; Beal, Deryk S; Perkell, Joseph S; Guenther, Frank H; Ghosh, Satrajit S
2014-01-01
Deficits in brain white matter have been a main focus of recent neuroimaging studies on stuttering. However, no prior study has examined brain connectivity on the global level of the cerebral cortex in persons who stutter (PWS). In the current study, we analyzed the results from probabilistic tractography between regions comprising the cortical speech network. An anatomical parcellation scheme was used to define 28 speech production-related ROIs in each hemisphere. We used network-based statistic (NBS) and graph theory to analyze the connectivity patterns obtained from tractography. At the network-level, the probabilistic corticocortical connectivity from the PWS group were significantly weaker than that from persons with fluent speech (PFS). NBS analysis revealed significant components in the bilateral speech networks with negative correlations with stuttering severity. To facilitate comparison with previous studies, we also performed tract-based spatial statistics (TBSS) and regional fractional anisotropy (FA) averaging. Results from tractography, TBSS and regional FA averaging jointly highlight the importance of several regions in the left peri-Rolandic sensorimotor and premotor areas, most notably the left ventral premotor cortex (vPMC) and middle primary motor cortex, in the neuroanatomical basis of stuttering.
Analysis of metro network performance from a complex network perspective
NASA Astrophysics Data System (ADS)
Wu, Xingtang; Dong, Hairong; Tse, Chi Kong; Ho, Ivan W. H.; Lau, Francis C. M.
2018-02-01
In this paper, the performance of metro networks is studied from a network science perspective. We review the structural efficiency of metro networks on the basis of a passenger's intuitive routing strategy that optimizes the number of transfers and the distance traveled.A new node centrality measure, called node occupying probability, is introduced for evaluating the level of utilization of stations. The robustness of a metro network is analyzed under several attack scenarios. Six metro networks (Beijing, London, Paris, Hong Kong, Tokyo and New York) are compared in terms of the node occupying probability and a few other performance parameters. Simulation results show that the New York metro system has better topological efficiency, the Tokyo and Hong Kong systems are the most robust under random attack and target attack, respectively.
Introduction to Social Network Analysis
NASA Astrophysics Data System (ADS)
Zaphiris, Panayiotis; Ang, Chee Siang
Social Network analysis focuses on patterns of relations between and among people, organizations, states, etc. It aims to describe networks of relations as fully as possible, identify prominent patterns in such networks, trace the flow of information through them, and discover what effects these relations and networks have on people and organizations. Social network analysis offers a very promising potential for analyzing human-human interactions in online communities (discussion boards, newsgroups, virtual organizations). This Tutorial provides an overview of this analytic technique and demonstrates how it can be used in Human Computer Interaction (HCI) research and practice, focusing especially on Computer Mediated Communication (CMC). This topic acquires particular importance these days, with the increasing popularity of social networking websites (e.g., youtube, myspace, MMORPGs etc.) and the research interest in studying them.
Petrovskaya, Olga V; Petrovskiy, Evgeny D; Lavrik, Inna N; Ivanisenko, Vladimir A
2017-04-01
Gene network modeling is one of the widely used approaches in systems biology. It allows for the study of complex genetic systems function, including so-called mosaic gene networks, which consist of functionally interacting subnetworks. We conducted a study of a mosaic gene networks modeling method based on integration of models of gene subnetworks by linear control functionals. An automatic modeling of 10,000 synthetic mosaic gene regulatory networks was carried out using computer experiments on gene knockdowns/knockouts. Structural analysis of graphs of generated mosaic gene regulatory networks has revealed that the most important factor for building accurate integrated mathematical models, among those analyzed in the study, is data on expression of genes corresponding to the vertices with high properties of centrality.
Autonomous distributed self-organization for mobile wireless sensor networks.
Wen, Chih-Yu; Tang, Hung-Kai
2009-01-01
This paper presents an adaptive combined-metrics-based clustering scheme for mobile wireless sensor networks, which manages the mobile sensors by utilizing the hierarchical network structure and allocates network resources efficiently A local criteria is used to help mobile sensors form a new cluster or join a current cluster. The messages transmitted during hierarchical clustering are applied to choose distributed gateways such that communication for adjacent clusters and distributed topology control can be achieved. In order to balance the load among clusters and govern the topology change, a cluster reformation scheme using localized criterions is implemented. The proposed scheme is simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithm provides efficient network topology management and achieves high scalability in mobile sensor networks.
Automated detection of videotaped neonatal seizures of epileptic origin.
Karayiannis, Nicolaos B; Xiong, Yaohua; Tao, Guozhi; Frost, James D; Wise, Merrill S; Hrachovy, Richard A; Mizrahi, Eli M
2006-06-01
This study aimed at the development of a seizure-detection system by training neural networks with quantitative motion information extracted from short video segments of neonatal seizures of the myoclonic and focal clonic types and random infant movements. The motion of the infants' body parts was quantified by temporal motion-strength signals extracted from video segments by motion-segmentation methods based on optical flow computation. The area of each frame occupied by the infants' moving body parts was segmented by clustering the motion parameters obtained by fitting an affine model to the pixel velocities. The motion of the infants' body parts also was quantified by temporal motion-trajectory signals extracted from video recordings by robust motion trackers based on block-motion models. These motion trackers were developed to adjust autonomously to illumination and contrast changes that may occur during the video-frame sequence. Video segments were represented by quantitative features obtained by analyzing motion-strength and motion-trajectory signals in both the time and frequency domains. Seizure recognition was performed by conventional feed-forward neural networks, quantum neural networks, and cosine radial basis function neural networks, which were trained to detect neonatal seizures of the myoclonic and focal clonic types and to distinguish them from random infant movements. The computational tools and procedures developed for automated seizure detection were evaluated on a set of 240 video segments of 54 patients exhibiting myoclonic seizures (80 segments), focal clonic seizures (80 segments), and random infant movements (80 segments). Regardless of the decision scheme used for interpreting the responses of the trained neural networks, all the neural network models exhibited sensitivity and specificity>90%. For one of the decision schemes proposed for interpreting the responses of the trained neural networks, the majority of the trained neural-network models exhibited sensitivity>90% and specificity>95%. In particular, cosine radial basis function neural networks achieved the performance targets of this phase of the project (i.e., sensitivity>95% and specificity>95%). The best among the motion segmentation and tracking methods developed in this study produced quantitative features that constitute a reliable basis for detecting neonatal seizures. The performance targets of this phase of the project were achieved by combining the quantitative features obtained by analyzing motion-strength signals with those produced by analyzing motion-trajectory signals. The computational procedures and tools developed in this study to perform off-line analysis of short video segments will be used in the next phase of this project, which involves the integration of these procedures and tools into a system that can process and analyze long video recordings of infants monitored for seizures in real time.
PNNI Performance Validation Test Report
NASA Technical Reports Server (NTRS)
Dimond, Robert P.
1999-01-01
Two Private Network-Network Interface (PNNI) neighboring peers were monitored with a protocol analyzer to understand and document how PNNI works with regards to initialization and recovery processes. With the processes documented, pertinent events were found and measured to determine the protocols behavior in several environments, which consisted of congestion and/or delay. Subsequent testing of the protocol in these environments was conducted to determine the protocol's suitability for use in satellite-terrestrial network architectures.
Image watermarking capacity analysis based on Hopfield neural network
NASA Astrophysics Data System (ADS)
Zhang, Fan; Zhang, Hongbin
2004-11-01
In watermarking schemes, watermarking can be viewed as a form of communication problems. Almost all of previous works on image watermarking capacity are based on information theory, using Shannon formula to calculate the capacity of watermarking. In this paper, we present a blind watermarking algorithm using Hopfield neural network, and analyze watermarking capacity based on neural network. In our watermarking algorithm, watermarking capacity is decided by attraction basin of associative memory.
Neural network post-processing of grayscale optical correlator
NASA Technical Reports Server (NTRS)
Lu, Thomas T; Hughlett, Casey L.; Zhoua, Hanying; Chao, Tien-Hsin; Hanan, Jay C.
2005-01-01
In this paper we present the use of a radial basis function neural network (RBFNN) as a post-processor to assist the optical correlator to identify the objects and to reject false alarms. Image plane features near the correlation peaks are extracted and fed to the neural network for analysis. The approach is capable of handling large number of object variations and filter sets. Preliminary experimental results are presented and the performance is analyzed.
Autocatalytic polymerization generates persistent random walk of crawling cells.
Sambeth, R; Baumgaertner, A
2001-05-28
The autocatalytic polymerization kinetics of the cytoskeletal actin network provides the basic mechanism for a persistent random walk of a crawling cell. It is shown that network remodeling by branching processes near the cell membrane is essential for the bimodal spatial stability of the network which induces a spontaneous breaking of isotropic cell motion. Details of the phenomena are analyzed using a simple polymerization model studied by analytical and simulation methods.
The CTD2 Dashboard hosts analyzed data and other evidence generated by the CTD2 Network. It is a web interface for the research community to browse and search CTD2 Network data related to genes, proteins, and compounds from individual CTD2 Centers, or explore observations across multiple Centers.
2005-05-01
made. 4. Do military decision makers identify / analyze adverse consequences presently? Few do based on this research and most don’t do it effectively ...A HEURISTIC DECISION MAKING MODEL TO MITIGATE ADVERSE CONSEQUENCES IN A NETWORK CENTRIC WARFARE / SENSE AND RESPOND SYSTEM...ENS/05-01 A HEURISTIC DECISION MAKING MODEL TO MITIGATE ADVERSE CONSEQUENCES IN A NETWORK CENTRIC WARFARE / SENSE AND RESPOND SYSTEM
Sierakowiak, Adam; Monnot, Cyril; Aski, Sahar Nikkhou; Uppman, Martin; Li, Tie-Qiang; Damberg, Peter; Brené, Stefan
2015-01-01
Rodent models are developed to enhance understanding of the underlying biology of different brain disorders. However, before interpreting findings from animal models in a translational aspect to understand human disease, a fundamental step is to first have knowledge of similarities and differences of the biological systems studied. In this study, we analyzed and verified four known networks termed: default mode network, motor network, dorsal basal ganglia network, and ventral basal ganglia network using resting state functional MRI (rsfMRI) in humans and rats. Our work supports the notion that humans and rats have common robust resting state brain networks and that rsfMRI can be used as a translational tool when validating animal models of brain disorders. In the future, rsfMRI may be used, in addition to short-term interventions, to characterize longitudinal effects on functional brain networks after long-term intervention in humans and rats.
Sierakowiak, Adam; Monnot, Cyril; Aski, Sahar Nikkhou; Uppman, Martin; Li, Tie-Qiang; Damberg, Peter; Brené, Stefan
2015-01-01
Rodent models are developed to enhance understanding of the underlying biology of different brain disorders. However, before interpreting findings from animal models in a translational aspect to understand human disease, a fundamental step is to first have knowledge of similarities and differences of the biological systems studied. In this study, we analyzed and verified four known networks termed: default mode network, motor network, dorsal basal ganglia network, and ventral basal ganglia network using resting state functional MRI (rsfMRI) in humans and rats. Our work supports the notion that humans and rats have common robust resting state brain networks and that rsfMRI can be used as a translational tool when validating animal models of brain disorders. In the future, rsfMRI may be used, in addition to short-term interventions, to characterize longitudinal effects on functional brain networks after long-term intervention in humans and rats. PMID:25789862
Old boys' network in general practitioners' referral behavior?
Hackl, Franz; Hummer, Michael; Pruckner, Gerald J
2015-09-01
We analyzed the impact of social networks on general practitioners' (GPs) referral behavior based on administrative panel data from 2,684,273 referrals to specialists made between 1998 and 2007. For the definition of social networks, we used information on the doctors' place and time of study and their hospital work history. We found that GPs referred more patients to specialists within their personal networks and that patients referred within a social network had fewer follow-up consultations and less inpatient days thereafter. The effects on patient outcomes (e.g. waiting periods, days in hospital) of referrals within personal networks and affinity-based networks differed. Specifically, whereas empirical evidence showed a concentration on high-quality specialists for referrals within the personal network, suggesting that referrals within personal networks overcome information asymmetry with respect to specialists' abilities, the empirical evidence for affinity-based networks was different and less clear. Same-gender networks tended to refer patients to low-quality specialists. Copyright © 2015 Elsevier B.V. All rights reserved.
Globalization and International Student Mobility: A Network Analysis
ERIC Educational Resources Information Center
Shields, Robin
2013-01-01
This article analyzes changes to the network of international student mobility in higher education over a 10-year period (1999-2008). International student flows have increased rapidly, exceeding 3 million in 2009, and extensive data on mobility provide unique insight into global educational processes. The analysis is informed by three theoretical…
Role Modelling in MOOC Discussion Forums
ERIC Educational Resources Information Center
Hecking, Tobias; Chounta, Irene-Angelica; Hoppe, H. Ulrich
2017-01-01
To further develop rich and expressive ways of modelling roles of contributors in discussion forums of online courses, particularly in MOOCs, networks of forum users are analyzed based on the relations of information-giving and information-seeking. Specific connection patterns that appear in the information exchange networks of forum users are…
Building a Virtual Learning Network for Teachers in a Suburban School District
ERIC Educational Resources Information Center
Kurtzworth-Keen, Kristin A.
2011-01-01
Emerging research indicates that learning management systems such as Moodle can function as virtual, collaborative environments, where collegial interactions promote professional learning opportunities. This study deployed a mixed methods design in order to describe and analyze teacher participation in a virtual learning network (VLN) that was…
USDA-ARS?s Scientific Manuscript database
Gelatin films prepared with or without transglutaminase (TGase) and dried at 15, 25 and 35 °C were analyzed for polymeric network structure, chemical composition and physical properties. Differences in protein network structure were observed by optical microscopy analysis in freeze-dried film-formin...
2009-07-01
simulation. The pilot described in this paper used this two-step approach within a Define, Measure, Analyze, Improve, and Control ( DMAIC ) framework to...networks, BBN, Monte Carlo simulation, DMAIC , Six Sigma, business case 15. NUMBER OF PAGES 35 16. PRICE CODE 17. SECURITY CLASSIFICATION OF
Mapping the Structure of Semantic Memory
ERIC Educational Resources Information Center
Morais, Ana Sofia; Olsson, Henrik; Schooler, Lael J.
2013-01-01
Aggregating snippets from the semantic memories of many individuals may not yield a good map of an individual's semantic memory. The authors analyze the structure of semantic networks that they sampled from individuals through a new snowball sampling paradigm during approximately 6 weeks of 1-hr daily sessions. The semantic networks of individuals…
The 30/20 GHZ net market assessment
NASA Technical Reports Server (NTRS)
Rogers, J. C.; Reiner, P.
1980-01-01
By creating a number of market scenarios variations dealing with network types, network sizes, and service price levels were analyzed for their impact on market demand. Each market scenario represents a market demand forecast with results for voice, data, and video service traffic expressed in peak load megabits per second.
Correlation analysis on real-time tab-delimited network monitoring data
Pan, Aditya; Majumdar, Jahin; Bansal, Abhay; ...
2016-01-01
End-End performance monitoring in the Internet, also called PingER is a part of SLAC National Accelerator Laboratory’s research project. It was created to answer the growing need to monitor network both to analyze current performance and to designate resources to optimize execution between research centers, and the universities and institutes co-operating on present and future operations. The monitoring support reflects the broad geographical area of the collaborations and requires a comprehensive number of research and financial channels. The data architecture retrieval and methodology of the interpretation have emerged over numerous years. Analyzing this data is the main challenge due tomore » its high volume. Finally, by using correlation analysis, we can make crucial conclusions about how the network data affects the performance of the hosts and how it depends from countries to countries.« less
Real-time determination of fringe pattern frequencies: An application to pressure measurement
NASA Astrophysics Data System (ADS)
Sciammarella, Cesar A.; Piroozan, Parham
2007-05-01
Retrieving information in real time from fringe patterns is a topic of a great deal of interest in scientific and engineering applications of optical methods. This paper presents a method for fringe frequency determination based on the capability of neural networks to recognize signals that are similar but not identical to signals used to train the neural network. Sampled patterns are generated by calibration and stored in memory. Incoming patterns are analyzed by a back-propagation neural network at the speed of the recording device, a CCD camera. This method of information retrieval is utilized to measure pressures on a boundary layer flow. The sensor combines optics and electronics to analyze dynamic pressure distributions and to feed information to a control system that is capable to preserve the stability of the flow.
Strategies of psychological terrorism perpetrated by ETA's network: delimitation and classification.
Martín-Peña, Javier; Rodríguez-Carballeira, Alvaro; Escartín Solanelles, Jordi; Porrúa García, Clara; Willem Winkel, Frans
2010-02-01
This paper defines and analyzes the harassment perpetrated by ETA's terrorist network in the Basque Country, providing a taxonomy of its strategies of psychological violence. The usefulness of this taxonomy has been tested and contrasted by means of a content analysis of 19 testimonies of persons who were the victims of violence by the terrorist network. The taxonomy of strategies of psychological violence is made up of four dimensions that emphasize the actions on the context of the persons affected, and on their emotional state, cognitions, and behaviour. Results show the predominance of emotional and cognitive strategies. Intra-observer and inter-observer reliability analysis in coding showed a Cohen's Kappa coefficient of .92 and .87, respectively. The psychological violence analyzed in this study reflects a form of psychological terrorism that harasses and persecutes a specific sector of the population.
NASA Astrophysics Data System (ADS)
Immanuel, Y.; Pullepu, Bapuji; Sambath, P.
2018-04-01
A two dimensional mathematical model is formulated for the transitive laminar free convective, incompressible viscous fluid flow over vertical cone with variable surface heat flux combined with the effects of heat generation and absorption is considered . using a powerful computational method based on thermoelectric analogy called Network Simulation Method (NSM0, the solutions of governing nondimensionl coupled, unsteady and nonlinear partial differential conservation equations of the flow that are obtained. The numerical technique is always stable and convergent which establish high efficiency and accuracy by employing network simulator computer code Pspice. The effects of velocity and temperature profiles have been analyzed for various factors, namely Prandtl number Pr, heat flux power law exponent n and heat generation/absorption parameter Δ are analyzed graphically.
Identification of Human Disease Genes from Interactome Network Using Graphlet Interaction
Yang, Lun; Wei, Dong-Qing; Qi, Ying-Xin; Jiang, Zong-Lai
2014-01-01
Identifying genes related to human diseases, such as cancer and cardiovascular disease, etc., is an important task in biomedical research because of its applications in disease diagnosis and treatment. Interactome networks, especially protein-protein interaction networks, had been used to disease genes identification based on the hypothesis that strong candidate genes tend to closely relate to each other in some kinds of measure on the network. We proposed a new measure to analyze the relationship between network nodes which was called graphlet interaction. The graphlet interaction contained 28 different isomers. The results showed that the numbers of the graphlet interaction isomers between disease genes in interactome networks were significantly larger than random picked genes, while graphlet signatures were not. Then, we designed a new type of score, based on the network properties, to identify disease genes using graphlet interaction. The genes with higher scores were more likely to be disease genes, and all candidate genes were ranked according to their scores. Then the approach was evaluated by leave-one-out cross-validation. The precision of the current approach achieved 90% at about 10% recall, which was apparently higher than the previous three predominant algorithms, random walk, Endeavour and neighborhood based method. Finally, the approach was applied to predict new disease genes related to 4 common diseases, most of which were identified by other independent experimental researches. In conclusion, we demonstrate that the graphlet interaction is an effective tool to analyze the network properties of disease genes, and the scores calculated by graphlet interaction is more precise in identifying disease genes. PMID:24465923
On the effect of networks of cycle-tracks on the risk of cycling. The case of Seville.
Marqués, R; Hernández-Herrador, V
2017-05-01
We analyze the evolution of the risk of cycling in Seville before and after the implementation of a network of segregated cycle tracks in the city. Specifically, we study the evolution of the risk for cyclists of being involved in a collision with a motor vehicle, using data reported by the traffic police along the period 2000-2013, i.e. seven years before and after the network was built. A sudden drop of such risk was observed after the implementation of the network of bikeways. We study, through a multilinear regression analysis, the evolution of the risk by means of explanatory variables representing changes in the built environment, specifically the length of the bikeways and a stepwise jump variable taking the values 0/1 before/after the network was implemented. We found that this last variable has a high value as explanatory variable, even higher than the length of the network, thus suggesting that networking the bikeways has a substantial effect on cycling safety by itself and beyond the mere increase in the length of the bikeways. We also analyze safety in numbers through a non-linear regression analysis. Our results fully agree qualitatively and quantitatively with the results previously reported by Jacobsen (2003), thus providing an independent confirmation of Jacobsen's results. Finally, the mutual causal relationships between the increase in safety, the increase in the number of cyclists and the presence of the network of bikeways are discussed. Copyright © 2017 Elsevier Ltd. All rights reserved.
2010-01-01
Background In a recent study, two-dimensional (2D) network layouts were used to visualize and quantitatively analyze the relationship between chronic renal diseases and regulated genes. The results revealed complex relationships between disease type, gene specificity, and gene regulation type, which led to important insights about the underlying biological pathways. Here we describe an attempt to extend our understanding of these complex relationships by reanalyzing the data using three-dimensional (3D) network layouts, displayed through 2D and 3D viewing methods. Findings The 3D network layout (displayed through the 3D viewing method) revealed that genes implicated in many diseases (non-specific genes) tended to be predominantly down-regulated, whereas genes regulated in a few diseases (disease-specific genes) tended to be up-regulated. This new global relationship was quantitatively validated through comparison to 1000 random permutations of networks of the same size and distribution. Our new finding appeared to be the result of using specific features of the 3D viewing method to analyze the 3D renal network. Conclusions The global relationship between gene regulation and gene specificity is the first clue from human studies that there exist common mechanisms across several renal diseases, which suggest hypotheses for the underlying mechanisms. Furthermore, the study suggests hypotheses for why the 3D visualization helped to make salient a new regularity that was difficult to detect in 2D. Future research that tests these hypotheses should enable a more systematic understanding of when and how to use 3D network visualizations to reveal complex regularities in biological networks. PMID:21070623
Structural analysis of health-relevant policy-making information exchange networks in Canada.
Contandriopoulos, Damien; Benoît, François; Bryant-Lukosius, Denise; Carrier, Annie; Carter, Nancy; Deber, Raisa; Duhoux, Arnaud; Greenhalgh, Trisha; Larouche, Catherine; Leclerc, Bernard-Simon; Levy, Adrian; Martin-Misener, Ruth; Maximova, Katerina; McGrail, Kimberlyn; Nykiforuk, Candace; Roos, Noralou; Schwartz, Robert; Valente, Thomas W; Wong, Sabrina; Lindquist, Evert; Pullen, Carolyn; Lardeux, Anne; Perroux, Melanie
2017-09-20
Health systems worldwide struggle to identify, adopt, and implement in a timely and system-wide manner the best-evidence-informed-policy-level practices. Yet, there is still only limited evidence about individual and institutional best practices for fostering the use of scientific evidence in policy-making processes The present project is the first national-level attempt to (1) map and structurally analyze-quantitatively-health-relevant policy-making networks that connect evidence production, synthesis, interpretation, and use; (2) qualitatively investigate the interaction patterns of a subsample of actors with high centrality metrics within these networks to develop an in-depth understanding of evidence circulation processes; and (3) combine these findings in order to assess a policy network's "absorptive capacity" regarding scientific evidence and integrate them into a conceptually sound and empirically grounded framework. The project is divided into two research components. The first component is based on quantitative analysis of ties (relationships) that link nodes (participants) in a network. Network data will be collected through a multi-step snowball sampling strategy. Data will be analyzed structurally using social network mapping and analysis methods. The second component is based on qualitative interviews with a subsample of the Web survey participants having central, bridging, or atypical positions in the network. Interviews will focus on the process through which evidence circulates and enters practice. Results from both components will then be integrated through an assessment of the network's and subnetwork's effectiveness in identifying, capturing, interpreting, sharing, reframing, and recodifying scientific evidence in policy-making processes. Knowledge developed from this project has the potential both to strengthen the scientific understanding of how policy-level knowledge transfer and exchange functions and to provide significantly improved advice on how to ensure evidence plays a more prominent role in public policies.
Armour, Cherie; Fried, Eiko I; Deserno, Marie K; Tsai, Jack; Pietrzak, Robert H
2017-01-01
Recent developments in psychometrics enable the application of network models to analyze psychological disorders, such as PTSD. Instead of understanding symptoms as indicators of an underlying common cause, this approach suggests symptoms co-occur in syndromes due to causal interactions. The current study has two goals: (1) examine the network structure among the 20 DSM-5 PTSD symptoms, and (2) incorporate clinically relevant variables to the network to investigate whether PTSD symptoms exhibit differential relationships with suicidal ideation, depression, anxiety, physical functioning/quality of life (QoL), mental functioning/QoL, age, and sex. We utilized a nationally representative U.S. military veteran's sample; and analyzed the data from a subsample of 221 veterans who reported clinically significant DSM-5 PTSD symptoms. Networks were estimated using state-of-the-art regularized partial correlation models. Data and code are published along with the paper. The 20-item DSM-5 PTSD network revealed that symptoms were positively connected within the network. Especially strong connections emerged between nightmares and flashbacks; blame of self or others and negative trauma-related emotions, detachment and restricted affect; and hypervigilance and exaggerated startle response. The most central symptoms were negative trauma-related emotions, flashbacks, detachment, and physiological cue reactivity. Incorporation of clinically relevant covariates into the network revealed paths between self-destructive behavior and suicidal ideation; concentration difficulties and anxiety, depression, and mental QoL; and depression and restricted affect. These results demonstrate the utility of a network approach in modeling the structure of DSM-5 PTSD symptoms, and suggest differential associations between specific DSM-5 PTSD symptoms and clinical outcomes in trauma survivors. Implications of these results for informing the assessment and treatment of this disorder, are discussed. Copyright © 2016 Elsevier Ltd. All rights reserved.
Modeling the propagation of mobile malware on complex networks
NASA Astrophysics Data System (ADS)
Liu, Wanping; Liu, Chao; Yang, Zheng; Liu, Xiaoyang; Zhang, Yihao; Wei, Zuxue
2016-08-01
In this paper, the spreading behavior of malware across mobile devices is addressed. By introducing complex networks to model mobile networks, which follows the power-law degree distribution, a novel epidemic model for mobile malware propagation is proposed. The spreading threshold that guarantees the dynamics of the model is calculated. Theoretically, the asymptotic stability of the malware-free equilibrium is confirmed when the threshold is below the unity, and the global stability is further proved under some sufficient conditions. The influences of different model parameters as well as the network topology on malware propagation are also analyzed. Our theoretical studies and numerical simulations show that networks with higher heterogeneity conduce to the diffusion of malware, and complex networks with lower power-law exponents benefit malware spreading.
Modelling the public opinion transmission on social networks under opinion leaders
NASA Astrophysics Data System (ADS)
Li, Zuozhi; Li, Meng; Ji, Wanwan
2017-06-01
In this paper, based on Social Network Analysis (SNA), the social network model of opinion leaders influencing the public opinion transmission is explored. The hot event, A Female Driver Was Beaten Due To Lane Change, has characteristics of individual short-term and non-government intervention, which is used to data extraction, and formed of the network structure on opinion leaders influencing the public opinion transmission. And the evolution mechanism are analyzed in the three evolutionary situations. Opinion leaders influence micro-blogging public opinion on social network evolution model shows that this type of network public opinion transmission is largely constrained by opinion leaders, so the opinion leaders behavior supervising on the spread of this public opinion is pivotal, and which has a guiding significance.
On securing wireless sensor network--novel authentication scheme against DOS attacks.
Raja, K Nirmal; Beno, M Marsaline
2014-10-01
Wireless sensor networks are generally deployed for collecting data from various environments. Several applications specific sensor network cryptography algorithms have been proposed in research. However WSN's has many constrictions, including low computation capability, less memory, limited energy resources, vulnerability to physical capture, which enforce unique security challenges needs to make a lot of improvements. This paper presents a novel security mechanism and algorithm for wireless sensor network security and also an application of this algorithm. The proposed scheme is given to strong authentication against Denial of Service Attacks (DOS). The scheme is simulated using network simulator2 (NS2). Then this scheme is analyzed based on the network packet delivery ratio and found that throughput has improved.
Driving Innovation in Optical Networking
NASA Astrophysics Data System (ADS)
Colizzi, Ernesto
Over the past 30 years, network applications have changed with the advent of innovative services spanning from high-speed broadband access to mobile data communications and to video signal distribution. To support this service evolution, optical transport infrastructures have changed their role. Innovations in optical networking have not only allowed the pure "bandwidth per fiber" increase, but also the realization of highly dependable and easy-to-manage networks. This article analyzes the innovations that have characterized the optical networking solutions from different perspectives, with a specific focus on the advancements introduced by Alcatel-Lucent's research and development laboratories located in Italy. The advancements of optical networking will be explored and discussed through Alcatel-Lucent's optical products to contextualize each innovation with the market evolution.
NASA Technical Reports Server (NTRS)
Collazo, Carlimar
2011-01-01
The statement of purpose is to analyze network monitoring logs to support the computer incident response team. Specifically, gain a clear understanding of the Uniform Resource Locator (URL) and its structure, and provide a way to breakdown a URL based on protocol, host name domain name, path, and other attributes. Finally, provide a method to perform data reduction by identifying the different types of advertisements shown on a webpage for incident data analysis. The procedures used for analysis and data reduction will be a computer program which would analyze the URL and identify and advertisement links from the actual content links.
NASA Astrophysics Data System (ADS)
Zhang, Min; He, Weiyi
2018-06-01
Under the guidance of principal-agent theory and modular theory, the collaborative innovation of green technology-based companies, design contractors and project builders based on united agency will provide direction for the development of green construction supply chain in the future. After analyzing the existing independent agencies, this paper proposes the industry-university-research bilateral collaborative innovation network architecture and modularization with the innovative function of engineering design in the context of non-standard transformation interfaces, analyzes the innovation responsibility center, and gives some countermeasures and suggestions to promote the performance of bilateral cooperative innovation network.
Network analysis reveals multiscale controls on streamwater chemistry
McGuire, Kevin J.; Torgersen, Christian E.; Likens, Gene E.; Buso, Donald C.; Lowe, Winsor H.; Bailey, Scott W.
2014-01-01
By coupling synoptic data from a basin-wide assessment of streamwater chemistry with network-based geostatistical analysis, we show that spatial processes differentially affect biogeochemical condition and pattern across a headwater stream network. We analyzed a high-resolution dataset consisting of 664 water samples collected every 100 m throughout 32 tributaries in an entire fifth-order stream network. These samples were analyzed for an exhaustive suite of chemical constituents. The fine grain and broad extent of this study design allowed us to quantify spatial patterns over a range of scales by using empirical semivariograms that explicitly incorporated network topology. Here, we show that spatial structure, as determined by the characteristic shape of the semivariograms, differed both among chemical constituents and by spatial relationship (flow-connected, flow-unconnected, or Euclidean). Spatial structure was apparent at either a single scale or at multiple nested scales, suggesting separate processes operating simultaneously within the stream network and surrounding terrestrial landscape. Expected patterns of spatial dependence for flow-connected relationships (e.g., increasing homogeneity with downstream distance) occurred for some chemical constituents (e.g., dissolved organic carbon, sulfate, and aluminum) but not for others (e.g., nitrate, sodium). By comparing semivariograms for the different chemical constituents and spatial relationships, we were able to separate effects on streamwater chemistry of (i) fine-scale versus broad-scale processes and (ii) in-stream processes versus landscape controls. These findings provide insight on the hierarchical scaling of local, longitudinal, and landscape processes that drive biogeochemical patterns in stream networks.
Network analysis reveals multiscale controls on streamwater chemistry
McGuire, Kevin J.; Torgersen, Christian E.; Likens, Gene E.; Buso, Donald C.; Lowe, Winsor H.; Bailey, Scott W.
2014-01-01
By coupling synoptic data from a basin-wide assessment of streamwater chemistry with network-based geostatistical analysis, we show that spatial processes differentially affect biogeochemical condition and pattern across a headwater stream network. We analyzed a high-resolution dataset consisting of 664 water samples collected every 100 m throughout 32 tributaries in an entire fifth-order stream network. These samples were analyzed for an exhaustive suite of chemical constituents. The fine grain and broad extent of this study design allowed us to quantify spatial patterns over a range of scales by using empirical semivariograms that explicitly incorporated network topology. Here, we show that spatial structure, as determined by the characteristic shape of the semivariograms, differed both among chemical constituents and by spatial relationship (flow-connected, flow-unconnected, or Euclidean). Spatial structure was apparent at either a single scale or at multiple nested scales, suggesting separate processes operating simultaneously within the stream network and surrounding terrestrial landscape. Expected patterns of spatial dependence for flow-connected relationships (e.g., increasing homogeneity with downstream distance) occurred for some chemical constituents (e.g., dissolved organic carbon, sulfate, and aluminum) but not for others (e.g., nitrate, sodium). By comparing semivariograms for the different chemical constituents and spatial relationships, we were able to separate effects on streamwater chemistry of (i) fine-scale versus broad-scale processes and (ii) in-stream processes versus landscape controls. These findings provide insight on the hierarchical scaling of local, longitudinal, and landscape processes that drive biogeochemical patterns in stream networks. PMID:24753575
Network analysis reveals multiscale controls on streamwater chemistry.
McGuire, Kevin J; Torgersen, Christian E; Likens, Gene E; Buso, Donald C; Lowe, Winsor H; Bailey, Scott W
2014-05-13
By coupling synoptic data from a basin-wide assessment of streamwater chemistry with network-based geostatistical analysis, we show that spatial processes differentially affect biogeochemical condition and pattern across a headwater stream network. We analyzed a high-resolution dataset consisting of 664 water samples collected every 100 m throughout 32 tributaries in an entire fifth-order stream network. These samples were analyzed for an exhaustive suite of chemical constituents. The fine grain and broad extent of this study design allowed us to quantify spatial patterns over a range of scales by using empirical semivariograms that explicitly incorporated network topology. Here, we show that spatial structure, as determined by the characteristic shape of the semivariograms, differed both among chemical constituents and by spatial relationship (flow-connected, flow-unconnected, or Euclidean). Spatial structure was apparent at either a single scale or at multiple nested scales, suggesting separate processes operating simultaneously within the stream network and surrounding terrestrial landscape. Expected patterns of spatial dependence for flow-connected relationships (e.g., increasing homogeneity with downstream distance) occurred for some chemical constituents (e.g., dissolved organic carbon, sulfate, and aluminum) but not for others (e.g., nitrate, sodium). By comparing semivariograms for the different chemical constituents and spatial relationships, we were able to separate effects on streamwater chemistry of (i) fine-scale versus broad-scale processes and (ii) in-stream processes versus landscape controls. These findings provide insight on the hierarchical scaling of local, longitudinal, and landscape processes that drive biogeochemical patterns in stream networks.
EEGNET: An Open Source Tool for Analyzing and Visualizing M/EEG Connectome.
Hassan, Mahmoud; Shamas, Mohamad; Khalil, Mohamad; El Falou, Wassim; Wendling, Fabrice
2015-01-01
The brain is a large-scale complex network often referred to as the "connectome". Exploring the dynamic behavior of the connectome is a challenging issue as both excellent time and space resolution is required. In this context Magneto/Electroencephalography (M/EEG) are effective neuroimaging techniques allowing for analysis of the dynamics of functional brain networks at scalp level and/or at reconstructed sources. However, a tool that can cover all the processing steps of identifying brain networks from M/EEG data is still missing. In this paper, we report a novel software package, called EEGNET, running under MATLAB (Math works, inc), and allowing for analysis and visualization of functional brain networks from M/EEG recordings. EEGNET is developed to analyze networks either at the level of scalp electrodes or at the level of reconstructed cortical sources. It includes i) Basic steps in preprocessing M/EEG signals, ii) the solution of the inverse problem to localize / reconstruct the cortical sources, iii) the computation of functional connectivity among signals collected at surface electrodes or/and time courses of reconstructed sources and iv) the computation of the network measures based on graph theory analysis. EEGNET is the unique tool that combines the M/EEG functional connectivity analysis and the computation of network measures derived from the graph theory. The first version of EEGNET is easy to use, flexible and user friendly. EEGNET is an open source tool and can be freely downloaded from this webpage: https://sites.google.com/site/eegnetworks/.
EEGNET: An Open Source Tool for Analyzing and Visualizing M/EEG Connectome
Hassan, Mahmoud; Shamas, Mohamad; Khalil, Mohamad; El Falou, Wassim; Wendling, Fabrice
2015-01-01
The brain is a large-scale complex network often referred to as the “connectome”. Exploring the dynamic behavior of the connectome is a challenging issue as both excellent time and space resolution is required. In this context Magneto/Electroencephalography (M/EEG) are effective neuroimaging techniques allowing for analysis of the dynamics of functional brain networks at scalp level and/or at reconstructed sources. However, a tool that can cover all the processing steps of identifying brain networks from M/EEG data is still missing. In this paper, we report a novel software package, called EEGNET, running under MATLAB (Math works, inc), and allowing for analysis and visualization of functional brain networks from M/EEG recordings. EEGNET is developed to analyze networks either at the level of scalp electrodes or at the level of reconstructed cortical sources. It includes i) Basic steps in preprocessing M/EEG signals, ii) the solution of the inverse problem to localize / reconstruct the cortical sources, iii) the computation of functional connectivity among signals collected at surface electrodes or/and time courses of reconstructed sources and iv) the computation of the network measures based on graph theory analysis. EEGNET is the unique tool that combines the M/EEG functional connectivity analysis and the computation of network measures derived from the graph theory. The first version of EEGNET is easy to use, flexible and user friendly. EEGNET is an open source tool and can be freely downloaded from this webpage: https://sites.google.com/site/eegnetworks/. PMID:26379232
Wirsich, Jonathan; Perry, Alistair; Ridley, Ben; Proix, Timothée; Golos, Mathieu; Bénar, Christian; Ranjeva, Jean-Philippe; Bartolomei, Fabrice; Breakspear, Michael; Jirsa, Viktor; Guye, Maxime
2016-01-01
The in vivo structure-function relationship is key to understanding brain network reorganization due to pathologies. This relationship is likely to be particularly complex in brain network diseases such as temporal lobe epilepsy, in which disturbed large-scale systems are involved in both transient electrical events and long-lasting functional and structural impairments. Herein, we estimated this relationship by analyzing the correlation between structural connectivity and functional connectivity in terms of analytical network communication parameters. As such, we targeted the gradual topological structure-function reorganization caused by the pathology not only at the whole brain scale but also both in core and peripheral regions of the brain. We acquired diffusion (dMRI) and resting-state fMRI (rsfMRI) data in seven right-lateralized TLE (rTLE) patients and fourteen healthy controls and analyzed the structure-function relationship by using analytical network communication metrics derived from the structural connectome. In rTLE patients, we found a widespread hypercorrelated functional network. Network communication analysis revealed greater unspecific branching of the shortest path (search information) in the structural connectome and a higher global correlation between the structural and functional connectivity for the patient group. We also found evidence for a preserved structural rich-club in the patient group. In sum, global augmentation of structure-function correlation might be linked to a smaller functional repertoire in rTLE patients, while sparing the central core of the brain which may represent a pathway that facilitates the spread of seizures.
Meyer-Bäse, Anke; Roberts, Rodney G.; Illan, Ignacio A.; Meyer-Bäse, Uwe; Lobbes, Marc; Stadlbauer, Andreas; Pinker-Domenig, Katja
2017-01-01
Neuroimaging in combination with graph theory has been successful in analyzing the functional connectome. However almost all analysis are performed based on static graph theory. The derived quantitative graph measures can only describe a snap shot of the disease over time. Neurodegenerative disease evolution is poorly understood and treatment strategies are consequently only of limited efficiency. Fusing modern dynamic graph network theory techniques and modeling strategies at different time scales with pinning observability of complex brain networks will lay the foundation for a transformational paradigm in neurodegnerative diseases research regarding disease evolution at the patient level, treatment response evaluation and revealing some central mechanism in a network that drives alterations in these diseases. We model and analyze brain networks as two-time scale sparse dynamic graph networks with hubs (clusters) representing the fast sub-system and the interconnections between hubs the slow sub-system. Alterations in brain function as seen in dementia can be dynamically modeled by determining the clusters in which disturbance inputs have entered and the impact they have on the large-scale dementia dynamic system. Observing a small fraction of specific nodes in dementia networks such that the others can be recovered is accomplished by the novel concept of pinning observability. In addition, how to control this complex network seems to be crucial in understanding the progressive abnormal neural circuits in many neurodegenerative diseases. Detecting the controlling regions in the networks, which serve as key nodes to control the aberrant dynamics of the networks to a desired state and thus influence the progressive abnormal behavior, will have a huge impact in understanding and developing therapeutic solutions and also will provide useful information about the trajectory of the disease. In this paper, we present the theoretical framework and derive the necessary conditions for (1) area aggregation and time-scale modeling in brain networks and for (2) pinning observability of nodes in dynamic graph networks. Simulation examples are given to illustrate the theoretical concepts. PMID:29051730
Meyer-Bäse, Anke; Roberts, Rodney G; Illan, Ignacio A; Meyer-Bäse, Uwe; Lobbes, Marc; Stadlbauer, Andreas; Pinker-Domenig, Katja
2017-01-01
Neuroimaging in combination with graph theory has been successful in analyzing the functional connectome. However almost all analysis are performed based on static graph theory. The derived quantitative graph measures can only describe a snap shot of the disease over time. Neurodegenerative disease evolution is poorly understood and treatment strategies are consequently only of limited efficiency. Fusing modern dynamic graph network theory techniques and modeling strategies at different time scales with pinning observability of complex brain networks will lay the foundation for a transformational paradigm in neurodegnerative diseases research regarding disease evolution at the patient level, treatment response evaluation and revealing some central mechanism in a network that drives alterations in these diseases. We model and analyze brain networks as two-time scale sparse dynamic graph networks with hubs (clusters) representing the fast sub-system and the interconnections between hubs the slow sub-system. Alterations in brain function as seen in dementia can be dynamically modeled by determining the clusters in which disturbance inputs have entered and the impact they have on the large-scale dementia dynamic system. Observing a small fraction of specific nodes in dementia networks such that the others can be recovered is accomplished by the novel concept of pinning observability. In addition, how to control this complex network seems to be crucial in understanding the progressive abnormal neural circuits in many neurodegenerative diseases. Detecting the controlling regions in the networks, which serve as key nodes to control the aberrant dynamics of the networks to a desired state and thus influence the progressive abnormal behavior, will have a huge impact in understanding and developing therapeutic solutions and also will provide useful information about the trajectory of the disease. In this paper, we present the theoretical framework and derive the necessary conditions for (1) area aggregation and time-scale modeling in brain networks and for (2) pinning observability of nodes in dynamic graph networks. Simulation examples are given to illustrate the theoretical concepts.