Dynamic Task Allocation in Multi-Hop Multimedia Wireless Sensor Networks with Low Mobility

PubMed Central

Jin, Yichao; Vural, Serdar; Gluhak, Alexander; Moessner, Klaus

2013-01-01

This paper presents a task allocation-oriented framework to enable efficient in-network processing and cost-effective multi-hop resource sharing for dynamic multi-hop multimedia wireless sensor networks with low node mobility, e.g., pedestrian speeds. The proposed system incorporates a fast task reallocation algorithm to quickly recover from possible network service disruptions, such as node or link failures. An evolutional self-learning mechanism based on a genetic algorithm continuously adapts the system parameters in order to meet the desired application delay requirements, while also achieving a sufficiently long network lifetime. Since the algorithm runtime incurs considerable time delay while updating task assignments, we introduce an adaptive window size to limit the delay periods and ensure an up-to-date solution based on node mobility patterns and device processing capabilities. To the best of our knowledge, this is the first study that yields multi-objective task allocation in a mobile multi-hop wireless environment under dynamic conditions. Simulations are performed in various settings, and the results show considerable performance improvement in extending network lifetime compared to heuristic mechanisms. Furthermore, the proposed framework provides noticeable reduction in the frequency of missing application deadlines. PMID:24135992

Enhanced Communication Network Solution for Positive Train Control Implementation

NASA Technical Reports Server (NTRS)

Fatehi, M. T.; Simon, J.; Chang, W.; Chow, E. T.; Burleigh, S. C.

2011-01-01

The commuter and freight railroad industry is required to implement Positive Train Control (PTC) by 2015 (2012 for Metrolink), a challenging network communications problem. This paper will discuss present technologies developed by the National Aeronautics and Space Administration (NASA) to overcome comparable communication challenges encountered in deep space mission operations. PTC will be based on a new cellular wireless packet Internet Protocol (IP) network. However, ensuring reliability in such a network is difficult due to the "dead zones" and transient disruptions we commonly experience when we lose calls in commercial cellular networks. These disruptions make it difficult to meet PTC s stringent reliability (99.999%) and safety requirements, deployment deadlines, and budget. This paper proposes innovative solutions based on space-proven technologies that would help meet these challenges: (1) Delay Tolerant Networking (DTN) technology, designed for use in resource-constrained, embedded systems and currently in use on the International Space Station, enables reliable communication over networks in which timely data acknowledgments might not be possible due to transient link outages. (2) Policy-Based Management (PBM) provides dynamic management capabilities, allowing vital data to be exchanged selectively (with priority) by utilizing alternative communication resources. The resulting network may help railroads implement PTC faster, cheaper, and more reliably.

Third Advances in Solar Physics Euroconference: Magnetic Fields and Oscillations

NASA Astrophysics Data System (ADS)

Schmieder, B.; Hofmann, A.; Staude, J.

The third Advances in Solar Physics Euroconference (ASPE) "Magnetic Fields and Oscillations"concluded a series of three Euroconferences sponsored by the European Union. The meeting took place in Caputh near Potsdam, Germany, on September 22-25, 1998, followed by the JOSO (Joint Organization for Solar Observations) 30th Annual Board Meeting on September 26, 1998. The ASPE formula is attractive and compares well with other meetings with "show-and-tell" character. This meeting had 122 participants coming from 26 countries; 36 participants came from countries formerly behind the Iron Curtain; a "politically incorrect" estimate says that 48 participants were below 35 years of age, with an unusually large female-to-male ratio. This characteristic of youngness is the more striking since solar physics is a perhaps overly established field exhibiting an overly senior age profile. It was a good opportunity to train this young generation in Solar Physics. The conference topic "Magnetic Fields and Oscillations" obviously was wide enough to cater to many an interest. These proceedings are organized according to the structure of the meeting. They include the topics 'High resolution spectropolarimetry and magnetometry', 'Flux-tube dynamics', 'Modelling of the 3-D magnetic field structure', 'Mass motions and magnetic fields in sunspot penumbral structures', 'Sunspot oscillations', 'Oscillations in active regions - diagnostics and seismology', 'Network and intranetwork structure and dynamics', and 'Waves in magnetic structures'. These topics covered the first 2.5 days of the conference. The reviews, oral contributions, and poster presentations were by no means all of the meeting. The ASPE formula also adds extensive plenary sessions of JOSO Working groups on topics that involve planning of Europe-wide collaboration. At this meeting these concerned solar observing techniques, solar data bases, coordination between SOHO and ground-based observing, and preparations for August 11, 1999 when more Europeans will be eclipsed than ever before. The contributions to these sessions have been included into the present volume as well. The participants of the EU-TMR Research Network 'Solar Magnetometry Network' came together to discuss in a special working group session questions of their future collaboration.

The Effects of a Dynamic Spectrum Access Overlay in LTE-Advanced Networks

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

Juan D. Deaton; Ryan E. Irwin; Luiz A. DaSilva

As early as 2014, mobile network operators’ spectral capacity will be overwhelmed by the demand brought on by new devices and applications. To augment capacity and meet this demand, operators may choose to deploy a Dynamic Spectrum Access (DSA) overlay. The signaling and functionality required by such an overlay have not yet been fully considered in the architecture of the planned Long Term Evolution Advanced (LTE+) networks. This paper presents a Spectrum Accountability framework to be integrated into LTE+ architectures, defining specific element functionality, protocol interfaces, and signaling flow diagrams required to enforce the rights and responsibilities of primary andmore » secondary users. We also quantify, through integer programs, the benefits of using DSA channels to augment capacity under a scenario in which LTE+ network can opportunistically use TV and GSM spectrum. The framework proposed here may serve as a guide in the development of future LTE+ network standards that account for DSA.« less

An algebra-based method for inferring gene regulatory networks

PubMed Central

2014-01-01

Background The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used. Results This paper contains a novel inference algorithm using the algebraic framework of Boolean polynomial dynamical systems (BPDS), meeting all these requirements. The algorithm takes as input time series data, including those from network perturbations, such as knock-out mutant strains and RNAi experiments. It allows for the incorporation of prior biological knowledge while being robust to significant levels of noise in the data used for inference. It uses an evolutionary algorithm for local optimization with an encoding of the mathematical models as BPDS. The BPDS framework allows an effective representation of the search space for algebraic dynamic models that improves computational performance. The algorithm is validated with both simulated and experimental microarray expression profile data. Robustness to noise is tested using a published mathematical model of the segment polarity gene network in Drosophila melanogaster. Benchmarking of the algorithm is done by comparison with a spectrum of state-of-the-art network inference methods on data from the synthetic IRMA network to demonstrate that our method has good precision and recall for the network reconstruction task, while also predicting several of the dynamic patterns present in the network. Conclusions Boolean polynomial dynamical systems provide a powerful modeling framework for the reverse engineering of gene regulatory networks, that enables a rich mathematical structure on the model search space. A C++ implementation of the method, distributed under LPGL license, is available, together with the source code, at http://www.paola-vera-licona.net/Software/EARevEng/REACT.html. PMID:24669835

QoS-Oriented High Dynamic Resource Allocation in Vehicular Communication Networks

PubMed Central

2014-01-01

Vehicular ad hoc networks (VANETs) are emerging as new research area and attracting an increasing attention from both industry and research communities. In this context, a dynamic resource allocation policy that maximizes the use of available resources and meets the quality of service (QoS) requirement of constraining applications is proposed. It is a combination of a fair packet scheduling policy and a new adaptive QoS oriented call admission control (CAC) scheme based on the vehicle density variation. This scheme decides whether the connection request is to be admitted into the system, while providing fair access and guaranteeing the desired throughput. The proposed algorithm showed good performance in testing in real world environment. PMID:24616639

Self-organizing radial basis function networks for adaptive flight control and aircraft engine state estimation

NASA Astrophysics Data System (ADS)

Shankar, Praveen

The performance of nonlinear control algorithms such as feedback linearization and dynamic inversion is heavily dependent on the fidelity of the dynamic model being inverted. Incomplete or incorrect knowledge of the dynamics results in reduced performance and may lead to instability. Augmenting the baseline controller with approximators which utilize a parametrization structure that is adapted online reduces the effect of this error between the design model and actual dynamics. However, currently existing parameterizations employ a fixed set of basis functions that do not guarantee arbitrary tracking error performance. To address this problem, we develop a self-organizing parametrization structure that is proven to be stable and can guarantee arbitrary tracking error performance. The training algorithm to grow the network and adapt the parameters is derived from Lyapunov theory. In addition to growing the network of basis functions, a pruning strategy is incorporated to keep the size of the network as small as possible. This algorithm is implemented on a high performance flight vehicle such as F-15 military aircraft. The baseline dynamic inversion controller is augmented with a Self-Organizing Radial Basis Function Network (SORBFN) to minimize the effect of the inversion error which may occur due to imperfect modeling, approximate inversion or sudden changes in aircraft dynamics. The dynamic inversion controller is simulated for different situations including control surface failures, modeling errors and external disturbances with and without the adaptive network. A performance measure of maximum tracking error is specified for both the controllers a priori. Excellent tracking error minimization to a pre-specified level using the adaptive approximation based controller was achieved while the baseline dynamic inversion controller failed to meet this performance specification. The performance of the SORBFN based controller is also compared to a fixed RBF network based adaptive controller. While the fixed RBF network based controller which is tuned to compensate for control surface failures fails to achieve the same performance under modeling uncertainty and disturbances, the SORBFN is able to achieve good tracking convergence under all error conditions.

Toward a Dynamically Reconfigurable Computing and Communication System for Small Spacecraft

NASA Technical Reports Server (NTRS)

Kifle, Muli; Andro, Monty; Tran, Quang K.; Fujikawa, Gene; Chu, Pong P.

2003-01-01

Future science missions will require the use of multiple spacecraft with multiple sensor nodes autonomously responding and adapting to a dynamically changing space environment. The acquisition of random scientific events will require rapidly changing network topologies, distributed processing power, and a dynamic resource management strategy. Optimum utilization and configuration of spacecraft communications and navigation resources will be critical in meeting the demand of these stringent mission requirements. There are two important trends to follow with respect to NASA's (National Aeronautics and Space Administration) future scientific missions: the use of multiple satellite systems and the development of an integrated space communications network. Reconfigurable computing and communication systems may enable versatile adaptation of a spacecraft system's resources by dynamic allocation of the processor hardware to perform new operations or to maintain functionality due to malfunctions or hardware faults. Advancements in FPGA (Field Programmable Gate Array) technology make it possible to incorporate major communication and network functionalities in FPGA chips and provide the basis for a dynamically reconfigurable communication system. Advantages of higher computation speeds and accuracy are envisioned with tremendous hardware flexibility to ensure maximum survivability of future science mission spacecraft. This paper discusses the requirements, enabling technologies, and challenges associated with dynamically reconfigurable space communications systems.

Optimal Power Control in Wireless Powered Sensor Networks: A Dynamic Game-Based Approach

PubMed Central

Xu, Haitao; Guo, Chao; Zhang, Long

2017-01-01

In wireless powered sensor networks (WPSN), it is essential to research uplink transmit power control in order to achieve throughput performance balancing and energy scheduling. Each sensor should have an optimal transmit power level for revenue maximization. In this paper, we discuss a dynamic game-based algorithm for optimal power control in WPSN. The main idea is to use the non-cooperative differential game to control the uplink transmit power of wireless sensors in WPSN, to extend their working hours and to meet QoS (Quality of Services) requirements. Subsequently, the Nash equilibrium solutions are obtained through Bellman dynamic programming. At the same time, an uplink power control algorithm is proposed in a distributed manner. Through numerical simulations, we demonstrate that our algorithm can obtain optimal power control and reach convergence for an infinite horizon. PMID:28282945

MEMS-based beam-steerable free-space optical communication link for reconfigurable wireless data center

NASA Astrophysics Data System (ADS)

Deng, Peng; Kavehrad, Mohsen; Lou, Yan

2017-01-01

Flexible wireless datacenter networks based on free space optical communication (FSO) links are being considered as promising solutions to meet the future datacenter demands of high throughput, robustness to dynamic traffic patterns, cabling complexity and energy efficiency. Robust and precise steerable FSO links over dynamic traffic play a key role in the reconfigurable optical wireless datacenter inter-rack network. In this work, we propose and demonstrate a reconfigurable 10Gbps FSO system incorporated with smart beam acquisition and tracking mechanism based on gimballess two-axis MEMS micro-mirror and retro-reflective film marked aperture. The fast MEMS-based beam acquisition switches laser beam of FSO terminal from one rack to the next for reconfigurable networks, and the precise beam tracking makes FSO device auto-correct the misalignment in real-time. We evaluate the optical power loss and bit error rate performance of steerable FSO links at various directions. Experimental results suggest that the MEMS based beam steerable FSO links hold considerable promise for the future reconfigurable wireless datacenter networks.

Thermal energy storage to minimize cost and improve efficiency of a polygeneration district energy system in a real-time electricity market

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

Powell, Kody M.; Kim, Jong Suk; Cole, Wesley J.

2016-10-01

District energy systems can produce low-cost utilities for large energy networks, but can also be a resource for the electric grid by their ability to ramp production or to store thermal energy by responding to real-time market signals. In this work, dynamic optimization exploits the flexibility of thermal energy storage by determining optimal times to store and extract excess energy. This concept is applied to a polygeneration distributed energy system with combined heat and power, district heating, district cooling, and chilled water thermal energy storage. The system is a university campus responsible for meeting the energy needs of tens ofmore » thousands of people. The objective for the dynamic optimization problem is to minimize cost over a 24-h period while meeting multiple loads in real time. The paper presents a novel algorithm to solve this dynamic optimization problem with energy storage by decomposing the problem into multiple static mixed-integer nonlinear programming (MINLP) problems. Another innovative feature of this work is the study of a large, complex energy network which includes the interrelations of a wide variety of energy technologies. Results indicate that a cost savings of 16.5% is realized when the system can participate in the wholesale electricity market.« less

Pollution source localization in an urban water supply network based on dynamic water demand.

PubMed

Yan, Xuesong; Zhu, Zhixin; Li, Tian

2017-10-27

Urban water supply networks are susceptible to intentional, accidental chemical, and biological pollution, which pose a threat to the health of consumers. In recent years, drinking-water pollution incidents have occurred frequently, seriously endangering social stability and security. The real-time monitoring for water quality can be effectively implemented by placing sensors in the water supply network. However, locating the source of pollution through the data detection obtained by water quality sensors is a challenging problem. The difficulty lies in the limited number of sensors, large number of water supply network nodes, and dynamic user demand for water, which leads the pollution source localization problem to an uncertainty, large-scale, and dynamic optimization problem. In this paper, we mainly study the dynamics of the pollution source localization problem. Previous studies of pollution source localization assume that hydraulic inputs (e.g., water demand of consumers) are known. However, because of the inherent variability of urban water demand, the problem is essentially a fluctuating dynamic problem of consumer's water demand. In this paper, the water demand is considered to be stochastic in nature and can be described using Gaussian model or autoregressive model. On this basis, an optimization algorithm is proposed based on these two dynamic water demand change models to locate the pollution source. The objective of the proposed algorithm is to find the locations and concentrations of pollution sources that meet the minimum between the analogue and detection values of the sensor. Simulation experiments were conducted using two different sizes of urban water supply network data, and the experimental results were compared with those of the standard genetic algorithm.

Evaluating complementary networks of restoration plantings for landscape-scale occurrence of temporally dynamic species.

PubMed

Ikin, Karen; Tulloch, Ayesha; Gibbons, Philip; Ansell, Dean; Seddon, Julian; Lindenmayer, David

2016-10-01

Multibillion dollar investments in land restoration make it critical that conservation goals are achieved cost-effectively. Approaches developed for systematic conservation planning offer opportunities to evaluate landscape-scale, temporally dynamic biodiversity outcomes from restoration and improve on traditional approaches that focus on the most species-rich plantings. We investigated whether it is possible to apply a complementarity-based approach to evaluate the extent to which an existing network of restoration plantings meets representation targets. Using a case study of woodland birds of conservation concern in southeastern Australia, we compared complementarity-based selections of plantings based on temporally dynamic species occurrences with selections based on static species occurrences and selections based on ranking plantings by species richness. The dynamic complementarity approach, which incorporated species occurrences over 5 years, resulted in higher species occurrences and proportion of targets met compared with the static complementarity approach, in which species occurrences were taken at a single point in time. For equivalent cost, the dynamic complementarity approach also always resulted in higher average minimum percent occurrence of species maintained through time and a higher proportion of the bird community meeting representation targets compared with the species-richness approach. Plantings selected under the complementarity approaches represented the full range of planting attributes, whereas those selected under the species-richness approach were larger in size. Our results suggest that future restoration policy should not attempt to achieve all conservation goals within individual plantings, but should instead capitalize on restoration opportunities as they arise to achieve collective value of multiple plantings across the landscape. Networks of restoration plantings with complementary attributes of age, size, vegetation structure, and landscape context lead to considerably better outcomes than conventional restoration objectives of site-scale species richness and are crucial for allocating restoration investment wisely to reach desired conservation goals. © 2016 Society for Conservation Biology.

Dynamic quality of service model for improving performance of multimedia real-time transmission in industrial networks.

PubMed

Gopalakrishnan, Ravichandran C; Karunakaran, Manivannan

2014-01-01

Nowadays, quality of service (QoS) is very popular in various research areas like distributed systems, multimedia real-time applications and networking. The requirements of these systems are to satisfy reliability, uptime, security constraints and throughput as well as application specific requirements. The real-time multimedia applications are commonly distributed over the network and meet various time constraints across networks without creating any intervention over control flows. In particular, video compressors make variable bit-rate streams that mismatch the constant-bit-rate channels typically provided by classical real-time protocols, severely reducing the efficiency of network utilization. Thus, it is necessary to enlarge the communication bandwidth to transfer the compressed multimedia streams using Flexible Time Triggered- Enhanced Switched Ethernet (FTT-ESE) protocol. FTT-ESE provides automation to calculate the compression level and change the bandwidth of the stream. This paper focuses on low-latency multimedia transmission over Ethernet with dynamic quality-of-service (QoS) management. This proposed framework deals with a dynamic QoS for multimedia transmission over Ethernet with FTT-ESE protocol. This paper also presents distinct QoS metrics based both on the image quality and network features. Some experiments with recorded and live video streams show the advantages of the proposed framework. To validate the solution we have designed and implemented a simulator based on the Matlab/Simulink, which is a tool to evaluate different network architecture using Simulink blocks.

Mapping dynamic social networks in real life using participants' own smartphones.

PubMed

Boonstra, Tjeerd W; E Larsen, Mark; Christensen, Helen

2015-11-01

Interpersonal relationships are vital for our daily functioning and wellbeing. Social networks may form the primary means by which environmental influences determine individual traits. Several studies have shown the influence of social networks on decision-making, behaviors and wellbeing. Smartphones have great potential for measuring social networks in a real world setting. Here we tested the feasibility of using people's own smartphones as a data collection platform for face-to-face interactions. We developed an application for iOS and Android to collect Bluetooth data and acquired one week of data from 14 participants in our organization. The Bluetooth scanning statistics were used to quantify the time-resolved connection strength between participants and define the weights of a dynamic social network. We used network metrics to quantify changes in network topology over time and non-negative matrix factorization to identify cliques or subgroups that reoccurred during the week. The scanning rate varied considerably between smartphones running Android and iOS and egocentric networks metrics were correlated with the scanning rate. The time courses of two identified subgroups matched with two meetings that took place that week. These findings demonstrate the feasibility of using participants' own smartphones to map social network, whilst identifying current limitations of using generic smartphones. The bias introduced by variations in scanning rate and missing data is an important limitation that needs to be addressed in future studies.

Application of system dynamics for developing financially self-sustaining management policies for water and wastewater systems.

PubMed

Rehan, R; Knight, M A; Haas, C T; Unger, A J A

2011-10-15

Recently enacted regulations in Canada and elsewhere require water utilities to be financially self-sustaining over the long-term. This implies full cost recovery for providing water and wastewater services to users. This study proposes a new approach to help water utilities plan to meet the requirements of the new regulations. A causal loop diagram is developed for a financially self-sustaining water utility which frames water and wastewater network management as a complex system with multiple interconnections and feedback loops. The novel System Dynamics approach is used to develop a demonstration model for water and wastewater network management. This is the first known application of System Dynamics to water and wastewater network management. The network simulated is that of a typical Canadian water utility that has under invested in maintenance. Model results show that with no proactive rehabilitation strategy the utility will need to substantially increase its user fees to achieve financial sustainability. This increase is further exacerbated when price elasticity of water demand is considered. When the utility pursues proactive rehabilitation, financial sustainability is achieved with lower user fees. Having demonstrated the significance of feedback loops for financial management of water and wastewater networks, the paper makes the case for a more complete utility model that considers the complexity of the system by incorporating all feedback loops. Crown Copyright © 2011. Published by Elsevier Ltd. All rights reserved.

78 FR 57621 - First Responder Network Authority Board Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-09-19

... Network Authority Board Meeting AGENCY: National Telecommunications and Information Administration, U.S. Department of Commerce. ACTION: Notice of special meeting of the First Responder Network Authority. SUMMARY: The Board of the First Responder Network Authority (FirstNet) will hold a Special Board meeting via...

78 FR 72667 - First Responder Network Authority Board Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-12-03

... Network Authority Board Meeting AGENCY: National Telecommunications and Information Administration, U.S. Department of Commerce. ACTION: Notice of Open Public Meeting of the First Responder Network Authority. SUMMARY: The Board of the First Responder Network Authority (FirstNet) will convene an open public meeting...

78 FR 2660 - First Responder Network Authority Board Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-14

... Network Authority Board Meeting AGENCY: National Telecommunications and Information Administration, U.S... meeting of the Board of the First Responder Network Authority (FirstNet). DATES: The meeting will be held... network. The FirstNet Board is responsible for making strategic decisions regarding FirstNet's operations...

78 FR 57843 - First Responder Network Authority Board Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-09-20

... Network Authority Board Meeting AGENCY: National Telecommunications and Information Administration, U.S... Network Authority (FirstNet). DATES: The meeting will be held on October 17, 2013, from 9 a.m. to 12:30 p... October 15, 2013, in Washington, DC See First Responder Network Authority Board Meeting, Notice of Open...

A spread willingness computing-based information dissemination model.

PubMed

Huang, Haojing; Cui, Zhiming; Zhang, Shukui

2014-01-01

This paper constructs a kind of spread willingness computing based on information dissemination model for social network. The model takes into account the impact of node degree and dissemination mechanism, combined with the complex network theory and dynamics of infectious diseases, and further establishes the dynamical evolution equations. Equations characterize the evolutionary relationship between different types of nodes with time. The spread willingness computing contains three factors which have impact on user's spread behavior: strength of the relationship between the nodes, views identity, and frequency of contact. Simulation results show that different degrees of nodes show the same trend in the network, and even if the degree of node is very small, there is likelihood of a large area of information dissemination. The weaker the relationship between nodes, the higher probability of views selection and the higher the frequency of contact with information so that information spreads rapidly and leads to a wide range of dissemination. As the dissemination probability and immune probability change, the speed of information dissemination is also changing accordingly. The studies meet social networking features and can help to master the behavior of users and understand and analyze characteristics of information dissemination in social network.

A Spread Willingness Computing-Based Information Dissemination Model

PubMed Central

Cui, Zhiming; Zhang, Shukui

2014-01-01

This paper constructs a kind of spread willingness computing based on information dissemination model for social network. The model takes into account the impact of node degree and dissemination mechanism, combined with the complex network theory and dynamics of infectious diseases, and further establishes the dynamical evolution equations. Equations characterize the evolutionary relationship between different types of nodes with time. The spread willingness computing contains three factors which have impact on user's spread behavior: strength of the relationship between the nodes, views identity, and frequency of contact. Simulation results show that different degrees of nodes show the same trend in the network, and even if the degree of node is very small, there is likelihood of a large area of information dissemination. The weaker the relationship between nodes, the higher probability of views selection and the higher the frequency of contact with information so that information spreads rapidly and leads to a wide range of dissemination. As the dissemination probability and immune probability change, the speed of information dissemination is also changing accordingly. The studies meet social networking features and can help to master the behavior of users and understand and analyze characteristics of information dissemination in social network. PMID:25110738

Global synchronization of complex dynamical networks through digital communication with limited data rate.

PubMed

Wang, Yan-Wu; Bian, Tao; Xiao, Jiang-Wen; Wen, Changyun

2015-10-01

This paper studies the global synchronization of complex dynamical network (CDN) under digital communication with limited bandwidth. To realize the digital communication, the so-called uniform-quantizer-sets are introduced to quantize the states of nodes, which are then encoded and decoded by newly designed encoders and decoders. To meet the requirement of the bandwidth constraint, a scaling function is utilized to guarantee the quantizers having bounded inputs and thus achieving bounded real-time quantization levels. Moreover, a new type of vector norm is introduced to simplify the expression of the bandwidth limit. Through mathematical induction, a sufficient condition is derived to ensure global synchronization of the CDNs. The lower bound on the sum of the real-time quantization levels is analyzed for different cases. Optimization method is employed to relax the requirements on the network topology and to determine the minimum of such lower bound for each case, respectively. Simulation examples are also presented to illustrate the established results.

Two-dimensional priority-based dynamic resource allocation algorithm for QoS in WDM/TDM PON networks

NASA Astrophysics Data System (ADS)

Sun, Yixin; Liu, Bo; Zhang, Lijia; Xin, Xiangjun; Zhang, Qi; Rao, Lan

2018-01-01

Wavelength division multiplexing/time division multiplexing (WDM/TDM) passive optical networks (PON) is being viewed as a promising solution for delivering multiple services and applications. The hybrid WDM / TDM PON uses the wavelength and bandwidth allocation strategy to control the distribution of the wavelength channels in the uplink direction, so that it can ensure the high bandwidth requirements of multiple Optical Network Units (ONUs) while improving the wavelength resource utilization. Through the investigation of the presented dynamic bandwidth allocation algorithms, these algorithms can't satisfy the requirements of different levels of service very well while adapting to the structural characteristics of mixed WDM / TDM PON system. This paper introduces a novel wavelength and bandwidth allocation algorithm to efficiently utilize the bandwidth and support QoS (Quality of Service) guarantees in WDM/TDM PON. Two priority based polling subcycles are introduced in order to increase system efficiency and improve system performance. The fixed priority polling subcycle and dynamic priority polling subcycle follow different principles to implement wavelength and bandwidth allocation according to the priority of different levels of service. A simulation was conducted to study the performance of the priority based polling in dynamic resource allocation algorithm in WDM/TDM PON. The results show that the performance of delay-sensitive services is greatly improved without degrading QoS guarantees for other services. Compared with the traditional dynamic bandwidth allocation algorithms, this algorithm can meet bandwidth needs of different priority traffic class, achieve low loss rate performance, and ensure real-time of high priority traffic class in terms of overall traffic on the network.

Energy Efficient, Cross-Layer Enabled, Dynamic Aggregation Networks for Next Generation Internet

NASA Astrophysics Data System (ADS)

Wang, Michael S.

Today, the Internet traffic is growing at a near exponential rate, driven predominately by data center-based applications and Internet-of-Things services. This fast-paced growth in Internet traffic calls into question the ability of the existing optical network infrastructure to support this continued growth. The overall optical networking equipment efficiency has not been able to keep up with the traffic growth, creating a energy gap that makes energy and cost expenditures scale linearly with the traffic growth. The implication of this energy gap is that it is infeasible to continue using existing networking equipment to meet the growing bandwidth demand. A redesign of the optical networking platform is needed. The focus of this dissertation is on the design and implementation of energy efficient, cross-layer enabled, dynamic optical networking platforms, which is a promising approach to address the exponentially growing Internet bandwidth demand. Chapter 1 explains the motivation for this work by detailing the huge Internet traffic growth and the unsustainable energy growth of today's networking equipment. Chapter 2 describes the challenges and objectives of enabling agile, dynamic optical networking platforms and the vision of the Center for Integrated Access Networks (CIAN) to realize these objectives; the research objectives of this dissertation and the large body of related work in this field is also summarized. Chapter 3 details the design and implementation of dynamic networking platforms that support wavelength switching granularity. The main contribution of this work involves the experimental validation of deep cross-layer communication across the optical performance monitoring (OPM), data, and control planes. The first experiment shows QoS-aware video streaming over a metro-scale test-bed through optical power monitoring of the transmission wavelength and cross-layer feedback control of the power level. The second experiment extends the performance monitoring capabilities to include real-time monitoring of OSNR and polarization mode dispersion (PMD) to enable dynamic wavelength switching and selective restoration. Chapter 4 explains the author?s contributions in designing dynamic networking at the sub-wavelength switching granularity, which can provide greater network efficiency due to its finer granularity. To support dynamic switching, regeneration, adding/dropping, and control decisions on each individual packet, the cross-layer enabled node architecture is enhanced with a FPGA controller that brings much more precise timing and control to the switching, OPM, and control planes. Furthermore, QoS-aware packet protection and dynamic switching, dropping, and regeneration functionalities were experimentally demonstrated in a multi-node network. Chapter 5 describes a technique to perform optical grooming, a process of optically combining multiple incoming data streams into a single data stream, which can simultaneously achieve greater bandwidth utilization and increased spectral efficiency. In addition, an experimental demonstration highlighting a fully functioning multi-node, agile optical networking platform is detailed. Finally, a summary and discussion of future work is provided in Chapter 6. The future of the Internet is very exciting, filled with not-yet-invented applications and services driven by cloud computing and Internet-of-Things. The author is cautiously optimistic that agile, dynamically reconfigurable optical networking is the solution to realizing this future.

High-risk sexual activity in the House and Ball community: influence of social networks.

PubMed

Schrager, Sheree M; Latkin, Carl A; Weiss, George; Kubicek, Katrina; Kipke, Michele D

2014-02-01

We investigated the roles of House membership and the influence of social and sexual network members on the sexual risk behavior of men in the Los Angeles House and Ball community. From February 2009 to January 2010, male participants (n = 233) completed interviewer-assisted surveys during a House meeting or Ball event. We used logistic regression to model the effects of sexual network size, influence of sexual network members, House membership status, and their interactions on high-risk sex. Significant predictors of high-risk sex included number of sexual partners in the nominated social network, multiethnicity, and previous diagnosis of sexually transmitted infection. House membership was protective against high-risk sex. Additionally, a 3-way interaction emerged between number of sexual partners in the network, influence, and network members' House membership. Future research should assess network members' attitudes and behavior in detail to provide a greater understanding of the dynamics of social influence and to identify additional avenues for intervention.

Building a collaborative network to understand regional forest dynamics and advance forestry initiatives in the Caribbean

Treesearch

Grizelle Gonzalez; Tamara Heartsill Scalley

2016-01-01

Herein we provide concluding remarks drawn from and inspired by the discussions of the 5 working groups of the 16th Caribbean Foresters Meeting (CFM) about the needs, challenges, and recommendations to advance forestry in the Caribbean region. We also list key considerations and potential future research directions as presented in the various manuscripts contained in...

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

Aderholdt, Ferrol; Caldwell, Blake A.; Hicks, Susan Elaine

High performance computing environments are often used for a wide variety of workloads ranging from simulation, data transformation and analysis, and complex workflows to name just a few. These systems may process data at various security levels but in so doing are often enclaved at the highest security posture. This approach places significant restrictions on the users of the system even when processing data at a lower security level and exposes data at higher levels of confidentiality to a much broader population than otherwise necessary. The traditional approach of isolation, while effective in establishing security enclaves poses significant challenges formore » the use of shared infrastructure in HPC environments. This report details current state-of-the-art in reconfigurable network enclaving through Software Defined Networking (SDN) and Network Function Virtualization (NFV) and their applicability to secure enclaves in HPC environments. SDN and NFV methods are based on a solid foundation of system wide virtualization. The purpose of which is very straight forward, the system administrator can deploy networks that are more amenable to customer needs, and at the same time achieve increased scalability making it easier to increase overall capacity as needed without negatively affecting functionality. The network administration of both the server system and the virtual sub-systems is simplified allowing control of the infrastructure through well-defined APIs (Application Programming Interface). While SDN and NFV technologies offer significant promise in meeting these goals, they also provide the ability to address a significant component of the multi-tenant challenge in HPC environments, namely resource isolation. Traditional HPC systems are built upon scalable high-performance networking technologies designed to meet specific application requirements. Dynamic isolation of resources within these environments has remained difficult to achieve. SDN and NFV methodology provide us with relevant concepts and available open standards based APIs that isolate compute and storage resources within an otherwise common networking infrastructure. Additionally, the integration of the networking APIs within larger system frameworks such as OpenStack provide the tools necessary to establish isolated enclaves dynamically allowing the benefits of HPC while providing a controlled security structure surrounding these systems.« less

Multi-layer service function chaining scheduling based on auxiliary graph in IP over optical network

NASA Astrophysics Data System (ADS)

Li, Yixuan; Li, Hui; Liu, Yuze; Ji, Yuefeng

2017-10-01

Software Defined Optical Network (SDON) can be considered as extension of Software Defined Network (SDN) in optical networks. SDON offers a unified control plane and makes optical network an intelligent transport network with dynamic flexibility and service adaptability. For this reason, a comprehensive optical transmission service, able to achieve service differentiation all the way down to the optical transport layer, can be provided to service function chaining (SFC). IP over optical network, as a promising networking architecture to interconnect data centers, is the most widely used scenarios of SFC. In this paper, we offer a flexible and dynamic resource allocation method for diverse SFC service requests in the IP over optical network. To do so, we firstly propose the concept of optical service function (OSF) and a multi-layer SFC model. OSF represents the comprehensive optical transmission service (e.g., multicast, low latency, quality of service, etc.), which can be achieved in multi-layer SFC model. OSF can also be considered as a special SF. Secondly, we design a resource allocation algorithm, which we call OSF-oriented optical service scheduling algorithm. It is able to address multi-layer SFC optical service scheduling and provide comprehensive optical transmission service, while meeting multiple optical transmission requirements (e.g., bandwidth, latency, availability). Moreover, the algorithm exploits the concept of Auxiliary Graph. Finally, we compare our algorithm with the Baseline algorithm in simulation. And simulation results show that our algorithm achieves superior performance than Baseline algorithm in low traffic load condition.

Neural-tree call admission controller for ATM networks

NASA Astrophysics Data System (ADS)

Rughooputh, Harry C. S.

1999-03-01

Asynchronous Transfer Mode (ATM) has been recommended by ITU-T as the transport method for broadband integrated services digital networks. In high-speed ATM networks different types of multimedia traffic streams with widely varying traffic characteristics and Quality of Service (QoS) are asynchronously multiplexed on transmission links and switched without window flow control as found in X.25. In such an environment, a traffic control scheme is required to manage the required QoS of each class individually. To meet the QoS requirements, Bandwidth Allocation and Call Admission Control (CAC) in ATM networks must be able to adapt gracefully to the dynamic behavior of traffic and the time-varying nature of the network condition. In this paper, a Neural Network approach for CAC is proposed. The call admission problem is addressed by designing controllers based on Neural Tree Networks. Simulations reveal that the proposed scheme is not only simple but it also offers faster response than conventional neural/neuro-fuzzy controllers.

Microscopic to Macroscopic Dynamical Models of Sociality

NASA Astrophysics Data System (ADS)

Solis Salas, Citlali; Woolley, Thomas; Pearce, Eiluned; Dunbar, Robin; Maini, Philip; Social; Evolutionary Neuroscience Research Group (Senrg) Collaboration

To help them survive, social animals, such as humans, need to share knowledge and responsibilities with other members of the species. The larger their social network, the bigger the pool of knowledge available to them. Since time is a limited resource, a way of optimising its use is meeting amongst individuals whilst fulfilling other necessities. In this sense it is useful to know how many, and how often, early humans could meet during a given period of time whilst performing other necessary tasks, such as food gathering. Using a simplified model of these dynamics, which comprehend encounter and memory, we aim at producing a lower-bound to the number of meetings hunter-gatherers could have during a year. We compare the stochastic agent-based model to its mean-field approximation and explore some of the features necessary for the difference between low population dynamics and its continuum limit. We observe an emergent property that could have an inference in the layered structure seen in each person's social organisation. This could give some insight into hunter-gatherer's lives and the development of the social layered structure we have today. With support from the Mexican Council for Science and Technology (CONACyT), the Public Education Secretariat (SEP), and the Mexican National Autonomous University's Foundation (Fundacion UNAM).

78 FR 34665 - Homeland Security Information Network Advisory Committee (HSINAC); Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-06-10

... DEPARTMENT OF HOMELAND SECURITY [DHS-2013-0037] Homeland Security Information Network Advisory... Committee Meeting. SUMMARY: The Homeland Security Information Network Advisory Committee (HSINAC) will meet... posted beforehand at this link: http://www.dhs.gov/homeland-security-information-network-advisory...

Optimum Sensors Integration for Multi-Sensor Multi-Target Environment for Ballistic Missile Defense Applications

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

Imam, Neena; Barhen, Jacob; Glover, Charles Wayne

2012-01-01

Multi-sensor networks may face resource limitations in a dynamically evolving multiple target tracking scenario. It is necessary to task the sensors efficiently so that the overall system performance is maximized within the system constraints. The central sensor resource manager may control the sensors to meet objective functions that are formulated to meet system goals such as minimization of track loss, maximization of probability of target detection, and minimization of track error. This paper discusses the variety of techniques that may be utilized to optimize sensor performance for either near term gain or future reward over a longer time horizon.

Fashion, Cooperation, and Social Interactions

PubMed Central

Cao, Zhigang; Gao, Haoyu; Qu, Xinglong; Yang, Mingmin; Yang, Xiaoguang

2013-01-01

Fashion plays such a crucial rule in the evolution of culture and society that it is regarded as a second nature to the human being. Also, its impact on economy is quite nontrivial. On what is fashionable, interestingly, there are two viewpoints that are both extremely widespread but almost opposite: conformists think that what is popular is fashionable, while rebels believe that being different is the essence. Fashion color is fashionable in the first sense, and Lady Gaga in the second. We investigate a model where the population consists of the afore-mentioned two groups of people that are located on social networks (a spatial cellular automata network and small-world networks). This model captures two fundamental kinds of social interactions (coordination and anti-coordination) simultaneously, and also has its own interest to game theory: it is a hybrid model of pure competition and pure cooperation. This is true because when a conformist meets a rebel, they play the zero sum matching pennies game, which is pure competition. When two conformists (rebels) meet, they play the (anti-) coordination game, which is pure cooperation. Simulation shows that simple social interactions greatly promote cooperation: in most cases people can reach an extraordinarily high level of cooperation, through a selfish, myopic, naive, and local interacting dynamic (the best response dynamic). We find that degree of synchronization also plays a critical role, but mostly on the negative side. Four indices, namely cooperation degree, average satisfaction degree, equilibrium ratio and complete ratio, are defined and applied to measure people’s cooperation levels from various angles. Phase transition, as well as emergence of many interesting geographic patterns in the cellular automata network, is also observed. PMID:23382799

77 FR 67342 - First Responder Network Authority Board Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2012-11-09

... Network Authority Board Meeting AGENCY: National Telecommunications and Information Administration, U.S... Responder Network Authority (FirstNet). DATES: The meetings will be held on December 11, 2012; April 23... safety broadband network. The FirstNet Board is responsible for making strategic decisions regarding...

78 FR 15357 - First Responder Network Authority Board Special Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-03-11

... Network Authority Board Special Meeting AGENCY: National Telecommunications and Information Administration, U.S. Department of Commerce. ACTION: Notice of Public Meeting of the First Responder Network Authority. SUMMARY: The Board of the First Responder Network Authority (FirstNet) will hold a Special...

78 FR 38014 - First Responder Network Authority Board Special Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-06-25

... Network Authority Board Special Meeting AGENCY: National Telecommunications and Information Administration, U.S. Department of Commerce. ACTION: Notice of Public Meeting of the First Responder Network Authority. SUMMARY: The Board of the First Responder Network Authority (FirstNet) will hold a Special...

78 FR 5422 - First Responder Network Authority Board Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-25

... Network Authority Board Meeting AGENCY: National Telecommunications and Information Administration, U.S... information regarding the public meeting of the Board of the First Responder Network Authority (FirstNet) to... confidential, to discuss personnel matters, or to discuss legal matters affecting the First Responder Network...

78 FR 54241 - First Responder Network Authority Board Special Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-09-03

... Network Authority Board Special Meeting AGENCY: National Telecommunications and Information Administration, U.S. Department of Commerce. ACTION: Notice of Public Meeting of the First Responder Network Authority. SUMMARY: The Board of the First Responder Network Authority (FirstNet) will hold a Special...

78 FR 26323 - First Responder Network Authority Board Special Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-05-06

... Network Authority Board Special Meeting AGENCY: National Telecommunications and Information Administration, U.S. Department of Commerce. ACTION: Notice of Public Meeting of the First Responder Network Authority. SUMMARY: The Board of the First Responder Network Authority (FirstNet) will hold a Special...

78 FR 63168 - First Responder Network Authority Board Special Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-10-23

... Network Authority Board Special Meeting AGENCY: National Telecommunications and Information Administration, U.S. Department of Commerce. ACTION: Notice of Public Meeting of the First Responder Network Authority. SUMMARY: The Board of the First Responder Network Authority (FirstNet) will hold a Special...

Capacity planning of link restorable optical networks under dynamic change of traffic

NASA Astrophysics Data System (ADS)

Ho, Kwok Shing; Cheung, Kwok Wai

2005-11-01

Future backbone networks shall require full-survivability and support dynamic changes of traffic demands. The Generalized Survivable Networks (GSN) was proposed to meet these challenges. GSN is fully-survivable under dynamic traffic demand changes, so it offers a practical and guaranteed characterization framework for ASTN / ASON survivable network planning and bandwidth-on-demand resource allocation 4. The basic idea of GSN is to incorporate the non-blocking network concept into the survivable network models. In GSN, each network node must specify its I/O capacity bound which is taken as constraints for any allowable traffic demand matrix. In this paper, we consider the following generic GSN network design problem: Given the I/O bounds of each network node, find a routing scheme (and the corresponding rerouting scheme under failure) and the link capacity assignment (both working and spare) which minimize the cost, such that any traffic matrix consistent with the given I/O bounds can be feasibly routed and it is single-fault tolerant under the link restoration scheme. We first show how the initial, infeasible formal mixed integer programming formulation can be transformed into a more feasible problem using the duality transformation of the linear program. Then we show how the problem can be simplified using the Lagrangian Relaxation approach. Previous work has outlined a two-phase approach for solving this problem where the first phase optimizes the working capacity assignment and the second phase optimizes the spare capacity assignment. In this paper, we present a jointly optimized framework for dimensioning the survivable optical network with the GSN model. Experiment results show that the jointly optimized GSN can bring about on average of 3.8% cost savings when compared with the separate, two-phase approach. Finally, we perform a cost comparison and show that GSN can be deployed with a reasonable cost.

75 FR 44800 - Notice of Meeting of the Homeland Security Information Network Advisory Committee, Tuesday...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-07-29

... DEPARTMENT OF HOMELAND SECURITY Notice of Meeting of the Homeland Security Information Network... Security. ACTION: Notice of open meeting. SUMMARY: The Homeland Security Information Network Advisory... (Pub. L. 92-463). The mission of the Homeland Security Information Network Advisory Committee is to...

Review of Literature on Mentorship Networks in Medicine: Where Are We Now and Where Are We Going?

NASA Astrophysics Data System (ADS)

Mickelson, Jennifer Judith

Mentorship is imperative in medical training and conceptual frameworks for mentoring continue to evolve. This study is an integrated review of the literature on mentoring networks. A systematic review of the literature on mentoring networks identified 943 articles from multiple databases. 24 relevant articles under went qualitative analysis. An iterative approach was taken to formulate themes, subthemes and codes. Three major themes were identified. The first theme was that group or peer networks meet evolving and dynamic or changing needs through training and career development. A prominent subtheme was identified which was the need for mentees to be the architects or directors of their evolving mentorship networks. The second theme identified was that mentorship networks offered a solution to barriers associated with the dyad model of mentorship. The third theme was the importance of the informality or "voluntary marriages", as distinguished from structured formal programs, to create meaningful mentorship networks. Future directions of study include examining how to empower mentees to facilitate and direct their mentorship networks.

Optimization of an electromagnetic linear actuator using a network and a finite element model

NASA Astrophysics Data System (ADS)

Neubert, Holger; Kamusella, Alfred; Lienig, Jens

2011-03-01

Model based design optimization leads to robust solutions only if the statistical deviations of design, load and ambient parameters from nominal values are considered. We describe an optimization methodology that involves these deviations as stochastic variables for an exemplary electromagnetic actuator used to drive a Braille printer. A combined model simulates the dynamic behavior of the actuator and its non-linear load. It consists of a dynamic network model and a stationary magnetic finite element (FE) model. The network model utilizes lookup tables of the magnetic force and the flux linkage computed by the FE model. After a sensitivity analysis using design of experiment (DoE) methods and a nominal optimization based on gradient methods, a robust design optimization is performed. Selected design variables are involved in form of their density functions. In order to reduce the computational effort we use response surfaces instead of the combined system model obtained in all stochastic analysis steps. Thus, Monte-Carlo simulations can be applied. As a result we found an optimum system design meeting our requirements with regard to function and reliability.

The YES Network: IYPE's Motto 'Earth Sciences for Society

NASA Astrophysics Data System (ADS)

Gonzales, Leila; Keane, Christopher

2010-05-01

The YES Network is an international association of early-career geoscientists who are primarily under the age of 35 years and are currently engaged in the geosciences in organizations from across the world. The YES Network was formed as a result of the International Year of Planet Earth in 2007. The YES Network aims to establish an interdisciplinary global network of individuals committed to solving these challenges, and furthering the IYPE motto of "Earth Sciences for Society". In 2009, in collaboration with the IYPE and under the patronage of UNESCO, the YES Network organized its first international Congress at the China University of Geosciences in Beijing, China. The Congress focused on climate, environmental and geoscience challenges facing today's society, as well as career and academic pathway challenges faced by early-career geoscientists. More than 300 young geoscientists from across the world attended the conference to present their research and participate in the oral, poster, and roundtable symposia. The roundtable symposia engaged senior and early-career geoscientists via presentations, panel discussions, and working group sessions. These symposia were broadcast as ‘live' webinars to increase international participation. As a result, 41 "virtual" participants from 10 countries and 16 "virtual" speakers from 5 countries were able to participate in these discussions. Since October, the YES Network has continued to expand its membership and develop more projects aligned with the "Earth Sciences for Society" motto. The YES Network is continuing to develop its website and social media networks to increase communication between YES Network members on local, regional and international scales, and it is developing resources to aid early-career geoscientists with opportunities for professional development, international collaboration, and involvement in outreach activities. Members of the YES Network are actively forming connections between the YES Network and the major international geoscience associations. The YES Network presented talks about the development of YES Network and about the October meeting at the American Geophysical Union's Fall Meeting. At the EGU 2010 meeting, the YES Network has organized symposia on ocean acidification and the "OneGeology" initiative. In 2011, the YES Network will be organizing poster, oral and roundtable sessions at the CAG23 meeting in Johannesburg. In 2012, the second international YES Congress will be held in conjunction with the 34th IGC. Other YES Network projects currently underway include a survey of the international community of young and early-career geoscientists pertaining to decision points in their academic and career paths, and a research project pertaining to mineral resources in Africa. The YES Network is able to function as a dynamic association because of several factors. It is comprised of young geoscientists who use technology to communicate and collaborate in ways that were not available to previous generations. Second, the YES Network has built its mission around the IYPE motto "Earth Sciences for Society.". The YES Network, via its use of web-based technologies, is able to progressively influence society's focus on geoscience issues because of the YES Network's ability to easily and effectively collaborate internationally on projects, build linkages within the international geoscience community, and create outreach activist that inform the general public.

National Biocontainment Training Center

DTIC Science & Technology

2015-08-01

this year, including representatives from within the NBL -RBL Network, UTMB students, and representatives from other biocontainment laboratories and...following the annual NBL /RBL Network meeting in Galveston, the Biosafety Officer from the Regional Biocontainment Laboratory at Colorado State...Biocontainment Laboratory Network Meeting - Miguel Grimaldo participated in the steering committee and planning efforts for the two-day NBL /RBL Network Meeting

On-board B-ISDN fast packet switching architectures. Phase 1: Study

NASA Technical Reports Server (NTRS)

Faris, Faris; Inukai, Thomas; Lee, Fred; Paul, Dilip; Shyy, Dong-Jye

1993-01-01

The broadband integrate services digital network (B-ISDN) is an emerging telecommunications technology that will meet most of the telecommunications networking needs in the mid-1990's to early next century. The satellite-based system is well positioned for providing B-ISDN service with its inherent capabilities of point-to-multipoint and broadcast transmission, virtually unlimited connectivity between any two points within a beam coverage, short deployment time of communications facility, flexible and dynamic reallocation of space segment capacity, and distance insensitive cost. On-board processing satellites, particularly in a multiple spot beam environment, will provide enhanced connectivity, better performance, optimized access and transmission link design, and lower user service cost. The following are described: the user and network aspects of broadband services; the current development status in broadband services; various satellite network architectures including system design issues; and various fast packet switch architectures and their detail designs.

Intelligent control and adaptive systems; Proceedings of the Meeting, Philadelphia, PA, Nov. 7, 8, 1989

NASA Technical Reports Server (NTRS)

Rodriguez, Guillermo (Editor)

1990-01-01

Various papers on intelligent control and adaptive systems are presented. Individual topics addressed include: control architecture for a Mars walking vehicle, representation for error detection and recovery in robot task plans, real-time operating system for robots, execution monitoring of a mobile robot system, statistical mechanics models for motion and force planning, global kinematics for manipulator planning and control, exploration of unknown mechanical assemblies through manipulation, low-level representations for robot vision, harmonic functions for robot path construction, simulation of dual behavior of an autonomous system. Also discussed are: control framework for hand-arm coordination, neural network approach to multivehicle navigation, electronic neural networks for global optimization, neural network for L1 norm linear regression, planning for assembly with robot hands, neural networks in dynamical systems, control design with iterative learning, improved fuzzy process control of spacecraft autonomous rendezvous using a genetic algorithm.

Library Service, A Statement of Policy and Proposed Action by the Regents of the University of the State of New York.

ERIC Educational Resources Information Center

New York State Education Dept., Albany.

A plan of action by which library service and development in New York State can respond to rapid and dynamic changes in society is outlined. The program is based on the principles that any state resident has a right to convenient access to local libraries to meet his needs, that statewide library networks constitute the most efficient means to…

Donges Receives 2013 Donald L. Turcotte Award

NASA Astrophysics Data System (ADS)

2014-07-01

Jonathan F. Donges was awarded the 2013 Donald L. Turcotte Award, given annually to recent Ph.D. recipients for outstanding dissertation research that contributes directly to the field of nonlinear geophysics. Donges's Ph.D. thesis is entitled "Functional network macroscopes for probing past and present Earth system dynamics." He gave an invited talk and was formally presented with the award at the 2013 AGU Fall Meeting, held 9-13 December in San Francisco, Calif.

SDN-Enabled Dynamic Feedback Control and Sensing in Agile Optical Networks

NASA Astrophysics Data System (ADS)

Lin, Likun

Fiber optic networks are no longer just pipelines for transporting data in the long haul backbone. Exponential growth in traffic in metro-regional areas has pushed higher capacity fiber toward the edge of the network, and highly dynamic patterns of heterogeneous traffic have emerged that are often bursty, severely stressing the historical "fat and dumb pipe" static optical network, which would need to be massively over-provisioned to deal with these loads. What is required is a more intelligent network with a span of control over the optical as well as electrical transport mechanisms which enables handling of service requests in a fast and efficient way that guarantees quality of service (QoS) while optimizing capacity efficiency. An "agile" optical network is a reconfigurable optical network comprised of high speed intelligent control system fed by real-time in situ network sensing. It provides fast response in the control and switching of optical signals in response to changing traffic demands and network conditions. This agile control of optical signals is enabled by pushing switching decisions downward in the network stack to the physical layer. Implementing such agility is challenging due to the response dynamics and interactions of signals in the physical layer. Control schemes must deal with issues such as dynamic power equalization, EDFA transients and cascaded noise effects, impairments due to self-phase modulation and dispersion, and channel-to-channel cross talk. If these issues are not properly predicted and mitigated, attempts at dynamic control can drive the optical network into an unstable state. In order to enable high speed actuation of signal modulators and switches, the network controller must be able to make decisions based on predictive models. In this thesis, we consider how to take advantage of Software Defined Networking (SDN) capabilities for network reconfiguration, combined with embedded models that access updates from deployed network monitoring sensors. In order to maintain signal quality while optimizing network resources, we find that it is essential to model and update estimates of the physical link impairments in real-time. In this thesis, we consider the key elements required to enable an agile optical network, with contributions as follows: • Control Framework: extended the SDN concept to include the optical transport network through extensions to the OpenFlow (OF) protocol. A unified SDN control plane is built to facilitate control and management capability across the electrical/packet-switched and optical/circuit-switched portions of the network seamlessly. The SDN control plane serves as a platform to abstract the resources of multilayer/multivendor networks. Through this platform, applications can dynamically request the network resources to meet their service requirements. • Use of In-situ Monitors: enabled real-time physical impairment sensing in the control plane using in-situ Optical Performance Monitoring (OPM) and bit error rate (BER) analyzers. OPM and BER values are used as quantitative indicators of the link status and are fed to the control plane through a high-speed data collection interface to form a closed-loop feedback system to enable adaptive resource allocation. • Predictive Network Model: used a network model embedded in the control layer to study the link status. The estimated results of network status is fed into the control decisions to precompute the network resources. The performance of the network model can be enhanced by the sensing results. • Real-Time Control Algorithms: investigated various dynamic resource allocation mechanisms supporting an agile optical network. Intelligent routing and wavelength switching for recovering from traffic impairments is achieved experimentally in the agile optical network within one second. A distance-adaptive spectrum allocation scheme to address transmission impairments caused by cascaded Wavelength Selective Switches (WSS) is proposed and evaluated for improving network spectral efficiency.

Paleoclimate networks: a concept meeting central challenges in the reconstruction of paleoclimate dynamics

NASA Astrophysics Data System (ADS)

Rehfeld, Kira; Goswami, Bedartha; Marwan, Norbert; Breitenbach, Sebastian; Kurths, Jürgen

2013-04-01

Statistical analysis of dependencies amongst paleoclimate data helps to infer on the climatic processes they reflect. Three key challenges have to be addressed, however: the datasets are heterogeneous in time (i) and space (ii), and furthermore time itself is a variable that needs to be reconstructed, which (iii) introduces additional uncertainties. To address these issues in a flexible way we developed the paleoclimate network framework, inspired by the increasing application of complex networks in climate research. Nodes in the paleoclimate network represent a paleoclimate archive, and an associated time series. Links between these nodes are assigned, if these time series are significantly similar. Therefore, the base of the paleoclimate network is formed by linear and nonlinear estimators for Pearson correlation, mutual information and event synchronization, which quantify similarity from irregularly sampled time series. Age uncertainties are propagated into the final network analysis using time series ensembles which reflect the uncertainty. We discuss how spatial heterogeneity influences the results obtained from network measures, and demonstrate the power of the approach by inferring teleconnection variability of the Asian summer monsoon for the past 1000 years.

78 FR 55064 - First Responder Network Authority Board Special Review Committee Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-09-09

... Network Authority Board Special Review Committee Meeting AGENCY: National Telecommunications and... Responder Network Authority Special Review Committee. SUMMARY: The First Responder Network Authority (First... nationwide, interoperable public safety broadband network. The FirstNet Board is responsible for making...

Enabling information management systems in tactical network environments

NASA Astrophysics Data System (ADS)

Carvalho, Marco; Uszok, Andrzej; Suri, Niranjan; Bradshaw, Jeffrey M.; Ceccio, Philip J.; Hanna, James P.; Sinclair, Asher

2009-05-01

Net-Centric Information Management (IM) and sharing in tactical environments promises to revolutionize forward command and control capabilities by providing ubiquitous shared situational awareness to the warfighter. This vision can be realized by leveraging the tactical and Mobile Ad hoc Networks (MANET) which provide the underlying communications infrastructure, but, significant technical challenges remain. Enabling information management in these highly dynamic environments will require multiple support services and protocols which are affected by, and highly dependent on, the underlying capabilities and dynamics of the tactical network infrastructure. In this paper we investigate, discuss, and evaluate the effects of realistic tactical and mobile communications network environments on mission-critical information management systems. We motivate our discussion by introducing the Advanced Information Management System (AIMS) which is targeted for deployment in tactical sensor systems. We present some operational requirements for AIMS and highlight how critical IM support services such as discovery, transport, federation, and Quality of Service (QoS) management are necessary to meet these requirements. Our goal is to provide a qualitative analysis of the impact of underlying assumptions of availability and performance of some of the critical services supporting tactical information management. We will also propose and describe a number of technologies and capabilities that have been developed to address these challenges, providing alternative approaches for transport, service discovery, and federation services for tactical networks.

An intelligent anti-jamming network system of data link

NASA Astrophysics Data System (ADS)

Fan, Xiangrui; Lin, Jingyong; Liu, Jiarun; Zhou, Chunmei

2017-10-01

Data link is the key information system for the cooperation of weapons, single physical layer anti-jamming technology has been unable to meet its requirements. High dynamic precision-guided weapon nodes like missiles, anti-jamming design of data link system need to have stronger pertinence and effectiveness: the best anti-jamming communication mode can be selected intelligently in combat environment, in real time, guarantee the continuity of communication. We discuss an anti-jamming intelligent networking technology of data link based on interference awareness, put forward a model of intelligent anti-jamming system, and introduces the cognitive node protocol stack model and intelligent anti-jamming method, in order to improve the data chain of intelligent anti-jamming ability.

Two-photon imaging and analysis of neural network dynamics

NASA Astrophysics Data System (ADS)

Lütcke, Henry; Helmchen, Fritjof

2011-08-01

The glow of a starry night sky, the smell of a freshly brewed cup of coffee or the sound of ocean waves breaking on the beach are representations of the physical world that have been created by the dynamic interactions of thousands of neurons in our brains. How the brain mediates perceptions, creates thoughts, stores memories and initiates actions remains one of the most profound puzzles in biology, if not all of science. A key to a mechanistic understanding of how the nervous system works is the ability to measure and analyze the dynamics of neuronal networks in the living organism in the context of sensory stimulation and behavior. Dynamic brain properties have been fairly well characterized on the microscopic level of individual neurons and on the macroscopic level of whole brain areas largely with the help of various electrophysiological techniques. However, our understanding of the mesoscopic level comprising local populations of hundreds to thousands of neurons (so-called 'microcircuits') remains comparably poor. Predominantly, this has been due to the technical difficulties involved in recording from large networks of neurons with single-cell spatial resolution and near-millisecond temporal resolution in the brain of living animals. In recent years, two-photon microscopy has emerged as a technique which meets many of these requirements and thus has become the method of choice for the interrogation of local neural circuits. Here, we review the state-of-research in the field of two-photon imaging of neuronal populations, covering the topics of microscope technology, suitable fluorescent indicator dyes, staining techniques, and in particular analysis techniques for extracting relevant information from the fluorescence data. We expect that functional analysis of neural networks using two-photon imaging will help to decipher fundamental operational principles of neural microcircuits.

The Information Economy in the U.S.: Its Effect on Libraries and Library Networks. Proceedings of the Library of Congress Network Advisory Committee Meeting (Washington, D.C., November 14-16, 1984). Network Planning Paper No. 10.

ERIC Educational Resources Information Center

Library of Congress, Washington, DC. Network Development Office.

At a 2-day meeting in November 1984, the Library of Congress Network Advisory Committee (NAC) discussed the information economy in the United States and its effect on libraries and library networks. Material presented at the meeting is included in the form of summaries of three papers on the program theme presented by Ronald F. Miller, Kenneth W.…

Understanding the Fundamental Principles Underlying the Survival and Efficient Recovery of Multi-Scale Techno-Social Networks Following a WMD Event (A)

DTIC Science & Technology

2016-07-01

Influenza H1N1 modeling working group meeting, European Center for Disease Control ECDC, Stockholm, 19 October 2010 (A.Vespignani, Panelist). We...dynamics and assessing non -pharmaceutical control interventions. METHODS: We modelled the movements of individuals, including patients not infected with...classification of urban areas according to quantitative risk assessment metrics of secondary E-WMD threats. 2. Optimal mobility control strategies informed by

Dynamic Construction Scheme for Virtualization Security Service in Software-Defined Networks

PubMed Central

Lin, Zhaowen; Tao, Dan; Wang, Zhenji

2017-01-01

For a Software Defined Network (SDN), security is an important factor affecting its large-scale deployment. The existing security solutions for SDN mainly focus on the controller itself, which has to handle all the security protection tasks by using the programmability of the network. This will undoubtedly involve a heavy burden for the controller. More devastatingly, once the controller itself is attacked, the entire network will be paralyzed. Motivated by this, this paper proposes a novel security protection architecture for SDN. We design a security service orchestration center in the control plane of SDN, and this center physically decouples from the SDN controller and constructs SDN security services. We adopt virtualization technology to construct a security meta-function library, and propose a dynamic security service composition construction algorithm based on web service composition technology. The rule-combining method is used to combine security meta-functions to construct security services which meet the requirements of users. Moreover, the RETE algorithm is introduced to improve the efficiency of the rule-combining method. We evaluate our solutions in a realistic scenario based on OpenStack. Substantial experimental results demonstrate the effectiveness of our solutions that contribute to achieve the effective security protection with a small burden of the SDN controller. PMID:28430155

Dynamic Construction Scheme for Virtualization Security Service in Software-Defined Networks.

PubMed

Lin, Zhaowen; Tao, Dan; Wang, Zhenji

2017-04-21

For a Software Defined Network (SDN), security is an important factor affecting its large-scale deployment. The existing security solutions for SDN mainly focus on the controller itself, which has to handle all the security protection tasks by using the programmability of the network. This will undoubtedly involve a heavy burden for the controller. More devastatingly, once the controller itself is attacked, the entire network will be paralyzed. Motivated by this, this paper proposes a novel security protection architecture for SDN. We design a security service orchestration center in the control plane of SDN, and this center physically decouples from the SDN controller and constructs SDN security services. We adopt virtualization technology to construct a security meta-function library, and propose a dynamic security service composition construction algorithm based on web service composition technology. The rule-combining method is used to combine security meta-functions to construct security services which meet the requirements of users. Moreover, the RETE algorithm is introduced to improve the efficiency of the rule-combining method. We evaluate our solutions in a realistic scenario based on OpenStack. Substantial experimental results demonstrate the effectiveness of our solutions that contribute to achieve the effective security protection with a small burden of the SDN controller.

75 FR 10860 - Announcement of a Meeting of the International Telecommunication Advisory Committee

Federal Register 2010, 2011, 2012, 2013, 2014

2010-03-09

... (ITU) Telecommunication Standardization Sector (ITU-T) Study Group 13 (Future networks including mobile and Next Generation Networks). The ITAC will meet by conference call to prepare advice for the U.S. government for the meeting of ITU-T Study Group 13 (Future networks including mobile and Next Generation...

78 FR 52605 - Announcing the Twenty First Public Meeting of the Crash Injury Research and Engineering Network...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-08-23

... First Public Meeting of the Crash Injury Research and Engineering Network (CIREN) AGENCY: National... announces the Twenty First Public Meeting of members of the Crash Injury Research and Engineering Network... of centers, medical and engineering. Medical centers are based at Level I Trauma Centers that admit...

76 FR 46359 - Announcing the Nineteenth Public Meeting of the Crash Injury Research and Engineering Network...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-08-02

... Nineteenth Public Meeting of the Crash Injury Research and Engineering Network (CIREN) AGENCY: National... announces the Nineteenth Public Meeting of members of the Crash Injury Research and Engineering Network... of centers, medical and engineering. Medical centers are based at Level I Trauma Centers that admit...

77 FR 46154 - Announcing the Twentieth Public Meeting of the Crash Injury Research and Engineering Network (CIREN)

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-02

... Twentieth Public Meeting of the Crash Injury Research and Engineering Network (CIREN) AGENCY: National... announces the Twentieth Public Meeting of members of the Crash Injury Research and Engineering Network... of centers, medical and engineering. Medical centers are based at Level I Trauma Centers that admit...

Advanced algorithms for distributed fusion

NASA Astrophysics Data System (ADS)

Gelfand, A.; Smith, C.; Colony, M.; Bowman, C.; Pei, R.; Huynh, T.; Brown, C.

2008-03-01

The US Military has been undergoing a radical transition from a traditional "platform-centric" force to one capable of performing in a "Network-Centric" environment. This transformation will place all of the data needed to efficiently meet tactical and strategic goals at the warfighter's fingertips. With access to this information, the challenge of fusing data from across the batttlespace into an operational picture for real-time Situational Awareness emerges. In such an environment, centralized fusion approaches will have limited application due to the constraints of real-time communications networks and computational resources. To overcome these limitations, we are developing a formalized architecture for fusion and track adjudication that allows the distribution of fusion processes over a dynamically created and managed information network. This network will support the incorporation and utilization of low level tracking information within the Army Distributed Common Ground System (DCGS-A) or Future Combat System (FCS). The framework is based on Bowman's Dual Node Network (DNN) architecture that utilizes a distributed network of interlaced fusion and track adjudication nodes to build and maintain a globally consistent picture across all assets.

78 FR 20619 - First Responder Network Authority Board Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-04-05

... Network Authority (FirstNet). DATES: The meeting will be held on June 4, 2013, from 8:30 a.m. to 11:30 a.m.... SUPPLEMENTARY INFORMATION: This notice informs the public that the FirstNet Board has scheduled a meeting on... the nationwide public safety broadband network. For information on the conference, please visit http...

77 FR 3544 - Meeting and Webinar on the Active Traffic and Demand Management and Intelligent Network Flow...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-01-24

... Intelligent Network Flow Optimization Operational Concepts; Notice of Public Meeting AGENCY: Research and... Demand Management (ADTM) and Intelligent Network Flow Optimization (INFLO) operational concepts. The ADTM... February 8, 2012, 8:30 to 4:30 p.m. The location for both meetings is the Hall of States, 444 North Capitol...

78 FR 7797 - Homeland Security Information Network Advisory Committee (HSINAC)

Federal Register 2010, 2011, 2012, 2013, 2014

2013-02-04

... DEPARTMENT OF HOMELAND SECURITY [Docket No. DHS-2013-0005] Homeland Security Information Network... Committee Meeting. SUMMARY: The Homeland Security Information Network Advisory Committee (HSIN AC) will meet... received by the (Homeland Security Information Network Advisory Committee), go to http://www.regulations...

78 FR 72666 - First Responder Network Authority Board Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-12-03

... Network Authority Board Meeting AGENCY: National Telecommunications and Information Administration, U.S... Authority. SUMMARY: The Board of the First Responder Network Authority (FirstNet) will convene open public... single nationwide, interoperable public safety broadband network. The FirstNet Board is responsible for...

Network Randomization and Dynamic Defense for Critical Infrastructure Systems

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

Chavez, Adrian R.; Martin, Mitchell Tyler; Hamlet, Jason

2015-04-01

Critical Infrastructure control systems continue to foster predictable communication paths, static configurations, and unpatched systems that allow easy access to our nation's most critical assets. This makes them attractive targets for cyber intrusion. We seek to address these attack vectors by automatically randomizing network settings, randomizing applications on the end devices themselves, and dynamically defending these systems against active attacks. Applying these protective measures will convert control systems into moving targets that proactively defend themselves against attack. Sandia National Laboratories has led this effort by gathering operational and technical requirements from Tennessee Valley Authority (TVA) and performing research and developmentmore » to create a proof-of-concept solution. Our proof-of-concept has been tested in a laboratory environment with over 300 nodes. The vision of this project is to enhance control system security by converting existing control systems into moving targets and building these security measures into future systems while meeting the unique constraints that control systems face.« less

Mobilization and Adaptation of a Rural Cradle-to-Career Network

ERIC Educational Resources Information Center

Zuckerman, Sarah J.

2016-01-01

This case study explored the development of a rural cradle-to-career network with a dual focus on the initial mobilization of network members and subsequent adaptations made to maintain mobilization, while meeting local needs. Data sources included interviews with network members, observations of meetings, and documentary evidence. Network-based…

Evaluation of the streamflow-gaging network of Texas and a proposed core network

USGS Publications Warehouse

Slade, Raymond M.; Howard, Teresa; Anaya, Roberto

2001-01-01

The U.S. Geological Survey streamflowgaging network in Texas is operated as part of the National Streamgaging Program and is jointly funded by the Geological Survey and Federal, State, and local agencies. This report documents an evaluation of the existing (as of October 1, 1999) network with regard to four major objectives of streamflow data; and on the basis of that evaluation, proposes a core network of streamflowgaging stations that best meets those objectives. The objectives are (1) regionalization (estimate flows or flow characteristics at ungaged sites in 11 hydrologically similar regions), (2) major flow (obtain flow rates and volumes in large streams), (3) outflow from the State (account for streamflow leaving the State), and (4) streamflow conditions assessment (assess current conditions with regard to long-term data, and define temporal trends in flow). The network analysis resulted in a proposed core network of 263 stations. Of those 263 stations, 43 were discontinued as of October 1, 1999, and 15 were partial-record stations. Fifty-five of the proposed core-network stations meet two of the four major objectives, 16 stations meet three objectives, and 1 station meets all four. One-hundred eighty-five stations with a median record length of 33 years were selected to meet the regionalization objective. Ninety-two stations with a median record length of about 62 years were selected to meet the major-flow objective. Twenty-six stations with a median record length of 59 years were selected to meet the outflow from the State objective. Fifty stations with a median record length of 53 years were selected to meet the streamflow conditions assessment objective.

Public health educational comprehensiveness: The strategic rationale in establishing networks among schools of public health.

PubMed

Otok, Robert; Czabanowska, Katarzyna; Foldspang, Anders

2017-11-01

The establishment and continuing development of a sufficient and competent public health workforce is fundamental for the planning, implementation, evaluation, effect and ethical validity of public health strategies and policies and, thus, for the development of the population's health and the cost-effectiveness of health and public health systems and interventions. Professional public health strategy-making demands a background of a comprehensive multi-disciplinary curriculum including mutually, dynamically coherent competences - not least, competences in sociology and other behavioural sciences and their interaction with, for example, epidemiology, biostatistics, qualitative methods and health promotion and disease prevention. The size of schools and university departments of public health varies, and smaller entities may run into problems if seeking to meet the comprehensive curriculum challenge entirely by use of in-house resources. This commentary discusses the relevance and strength of establishing comprehensive curriculum development networks between schools and university departments of public health, as one means to meet the comprehensiveness challenge. This commentary attempts to consider a two-stage strategy to develop complete curricula at the bachelor and master's as well as PhD levels.

MAX - An advanced parallel computer for space applications

NASA Technical Reports Server (NTRS)

Lewis, Blair F.; Bunker, Robert L.

1991-01-01

MAX is a fault-tolerant multicomputer hardware and software architecture designed to meet the needs of NASA spacecraft systems. It consists of conventional computing modules (computers) connected via a dual network topology. One network is used to transfer data among the computers and between computers and I/O devices. This network's topology is arbitrary. The second network operates as a broadcast medium for operating system synchronization messages and supports the operating system's Byzantine resilience. A fully distributed operating system supports multitasking in an asynchronous event and data driven environment. A large grain dataflow paradigm is used to coordinate the multitasking and provide easy control of concurrency. It is the basis of the system's fault tolerance and allows both static and dynamical location of tasks. Redundant execution of tasks with software voting of results may be specified for critical tasks. The dataflow paradigm also supports simplified software design, test and maintenance. A unique feature is a method for reliably patching code in an executing dataflow application.

Supply and demand: How does variation in atmospheric oxygen during development affect insect tracheal and mitochondrial networks?

PubMed

VandenBrooks, John M; Gstrein, Gregory; Harmon, Jason; Friedman, Jessica; Olsen, Matthew; Ward, Anna; Parker, Gregory

2018-04-01

Atmospheric oxygen is one of the most important atmospheric component for all terrestrial organisms. Variation in atmospheric oxygen has wide ranging effects on animal physiology, development, and evolution. This variation in oxygen has the potential to affect both respiratory systems (the supply side) and mitochondrial networks (the demand side) in animals. Insect respiratory systems supplying oxygen to tissues in the gas phase through blind ended tracheal systems are particularly susceptible to this variation. While the large conducting tracheae have previously been shown to respond developmentally to changes in rearing oxygen, the effect of oxygen on the tracheolar network has been relatively unexplored, especially in adult insects. Similarly, mitochondrial networks that meet energy demand in insects and other animals are dynamic and their enzyme activities have been shown to vary in the presence of oxygen. These two systems together should be under selective pressure to meet the aerobic metabolic requirements of insects. To test this hypothesis, we reared Mito-YFP Drosophila under three different oxygen concentrations hypoxia (12%), normoxia (21%), and hyperoxia (31%) and imaged their tracheolar and mitochondrial networks within their flight muscle using confocal microscopy. In terms of oxygen supply, hypoxia increased mean (mid-length) tracheolar diameters, tracheolar tip diameters, the number of tracheoles per main branch and affected tracheal branching patterns, while the opposite was observed in hyperoxia. In terms of oxygen demand, hypoxia increased mitochondrial investment and mitochondrial to tracheolar volume ratios; while the opposite was observed in hyperoxia. Generally, hypoxia had a stronger effect on both systems than hyperoxia. These results show that insects are capable of developmentally changing investment in both their supply and demand networks to increase overall fitness. Copyright © 2017 Elsevier Ltd. All rights reserved.

SOM neural network fault diagnosis method of polymerization kettle equipment optimized by improved PSO algorithm.

PubMed

Wang, Jie-sheng; Li, Shu-xia; Gao, Jie

2014-01-01

For meeting the real-time fault diagnosis and the optimization monitoring requirements of the polymerization kettle in the polyvinyl chloride resin (PVC) production process, a fault diagnosis strategy based on the self-organizing map (SOM) neural network is proposed. Firstly, a mapping between the polymerization process data and the fault pattern is established by analyzing the production technology of polymerization kettle equipment. The particle swarm optimization (PSO) algorithm with a new dynamical adjustment method of inertial weights is adopted to optimize the structural parameters of SOM neural network. The fault pattern classification of the polymerization kettle equipment is to realize the nonlinear mapping from symptom set to fault set according to the given symptom set. Finally, the simulation experiments of fault diagnosis are conducted by combining with the industrial on-site historical data of the polymerization kettle and the simulation results show that the proposed PSO-SOM fault diagnosis strategy is effective.

The Tumor Microenvironment at a Turning Point Knowledge Gained Over The Last Decade, and Challenges and Opportunities Ahead: A White Paper from the NCI TME Network

PubMed Central

DeClerck, Yves A.; Pienta, Kenneth J.; Woodhouse, Elisa C.; Singer, Dinah S.; Mohla, Suresh

2017-01-01

Over the past 10 years, the Tumor Microenvironment Network (TMEN), supported by the NCI (Bethesda, MD), has promoted collaborative research with the explicit goal of fostering multi-institutional and transdisciplinary groups that are capable of addressing complex issues involving the tumor microenvironment. The main goal of the TMEN was to generate novel information about the dynamic complexity of tumor–host interactions in different organ systems with emphasis on using human tissues and supplemented by experimental models. As this initiative comes to a close, members of the TMEN took time to examine what has been accomplished by the Network and importantly to identify the challenges and opportunities ahead. This consensus document summarizes for the broader scientific community discussions that occurred at the two final meetings of the TMEN in 2015 and 2016. PMID:28209610

Specification goals for a Mars seismic network

NASA Technical Reports Server (NTRS)

Davis, Paul M.

1990-01-01

A seismic network on Mars should have enough stations (e.g., 24) to characterize the seismicity of the planet for comparison with a diversity of structural features; be comprised of low noise stations, preferably underground, 3 to 4 orders of magnitude more sensitive than those used on Viking; record over a sufficient band-width (DC-30 Hz) to detect micro-earthquakes to normal modes; and record for a sufficient duration (10 years) and data rate (10(exp 8) Mb/day/station) to obtain a data set comparable to that from the Apollo mission to the Moon so that locations of major internal boundaries can be inferred, such as those in the Earth, i.e., crust - lithosphere - asthenosphere - upper - lower phase transitions - outer - inner core. The proposed Mars Global Network Mission provides an opportunity to sense the dynamics and probe the interior of the planet. The seismic objectives, the availability of the instrumentation and trade-offs to meet them are discussed.

The US nuclear reaction data network. Summary of the first meeting, March 13 & 14 1996

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

NONE

1996-03-01

The first meeting of the US Nuclear Reaction Data Network (USNRDN) was held at the Colorado School of Mines, March 13-14, 1996 chaired by F. Edward Cecil. The Agenda of the meeting is attached. The Network, its mission, products and services; related nuclear data and data networks, members, and organization are described in Attachment 1. The following progress reports from the members of the USNRDN were distributed prior to the meeting and are given as Attachment 2. (1) Measurements and Development of Analytic Techniques for Basic Nuclear Physics and Nuclear Applications; (2) Nuclear Reaction Data Activities at the National Nuclearmore » Data Center; (3) Studies of nuclear reactions at very low energies; (4) Nuclear Reaction Data Activities, Nuclear Data Group; (5) Progress in Neutron Physics at Los Alamos - Experiments; (6) Nuclear Reaction Data Activities in Group T2; (7) Progress Report for the US Nuclear Reaction Data Network Meeting; (8) Nuclear Astrophysics Research Group (ORNL); (9) Progress Report from Ohio University; (10) Exciton Model Phenomenology; and (11) Progress Report for Coordination Meeting USNRDN.« less

All-optical VPN utilizing DSP-based digital orthogonal filters access for PONs

NASA Astrophysics Data System (ADS)

Zhang, Xiaoling; Zhang, Chongfu; Chen, Chen; Jin, Wei; Qiu, Kun

2018-04-01

Utilizing digital filtering-enabled signal multiplexing and de-multiplexing, a cost-effective all-optical virtual private network (VPN) system is proposed, for the first time to our best knowledge, in digital filter multiple access passive optical networks (DFMA-PONs). Based on the DFMA technology, the proposed system can be easily designed to meet the requirements of next generation network's flexibility, elasticity, adaptability and compatibility. Through dynamic digital filter allocation and recycling, the proposed all-optical VPN system can provide dynamic establishments and cancellations of multiple VPN communications with arbitrary traffic volumes. More importantly, due to the employment of DFMA technology, the system is not limited to a fixed signal format and different signal formats such as pulse amplitude modulation (PAM), quadrature amplitude modulation (QAM) and orthogonal frequency division multiplexing (OFDM) can be used. Moreover, one transceiver is sufficient to simultaneously transmit upstream (US)/VPN data to optical line terminal (OLT) or other VPN optical network units (ONUs), thus leading to great reduction in network constructions and operation expenditures. The proposed all-optical VPN system is demonstrated with the transceiver incorporating the formats of QAM and OFDM, which can be made transparent to downstream (DS), US and VPN communications. The bit error rates (BERs) of DS, US and VPN for OFDM signals are below the forward-error-correction (FEC) limit of 3 . 8 × 10-3 when the received optical powers are about -16.8 dBm, -14.5 dBm and -15.7 dBm, respectively.

The performance evaluation of a new neural network based traffic management scheme for a satellite communication network

NASA Technical Reports Server (NTRS)

Ansari, Nirwan; Liu, Dequan

1991-01-01

A neural-network-based traffic management scheme for a satellite communication network is described. The scheme consists of two levels of management. The front end of the scheme is a derivation of Kohonen's self-organization model to configure maps for the satellite communication network dynamically. The model consists of three stages. The first stage is the pattern recognition task, in which an exemplar map that best meets the current network requirements is selected. The second stage is the analysis of the discrepancy between the chosen exemplar map and the state of the network, and the adaptive modification of the chosen exemplar map to conform closely to the network requirement (input data pattern) by means of Kohonen's self-organization. On the basis of certain performance criteria, whether a new map is generated to replace the original chosen map is decided in the third stage. A state-dependent routing algorithm, which arranges the incoming call to some proper path, is used to make the network more efficient and to lower the call block rate. Simulation results demonstrate that the scheme, which combines self-organization and the state-dependent routing mechanism, provides better performance in terms of call block rate than schemes that only have either the self-organization mechanism or the routing mechanism.

Cost- and reliability-oriented aggregation point association in long-term evolution and passive optical network hybrid access infrastructure for smart grid neighborhood area network

NASA Astrophysics Data System (ADS)

Cheng, Xiao; Feng, Lei; Zhou, Fanqin; Wei, Lei; Yu, Peng; Li, Wenjing

2018-02-01

With the rapid development of the smart grid, the data aggregation point (AP) in the neighborhood area network (NAN) is becoming increasingly important for forwarding the information between the home area network and wide area network. Due to limited budget, it is unable to use one-single access technology to meet the ongoing requirements on AP coverage. This paper first introduces the wired and wireless hybrid access network with the integration of long-term evolution (LTE) and passive optical network (PON) system for NAN, which allows a good trade-off among cost, flexibility, and reliability. Then, based on the already existing wireless LTE network, an AP association optimization model is proposed to make the PON serve as many APs as possible, considering both the economic efficiency and network reliability. Moreover, since the features of the constraints and variables of this NP-hard problem, a hybrid intelligent optimization algorithm is proposed, which is achieved by the mixture of the genetic, ant colony and dynamic greedy algorithm. By comparing with other published methods, simulation results verify the performance of the proposed method in improving the AP coverage and the performance of the proposed algorithm in terms of convergence.

Algebraic and adaptive learning in neural control systems

NASA Astrophysics Data System (ADS)

Ferrari, Silvia

A systematic approach is developed for designing adaptive and reconfigurable nonlinear control systems that are applicable to plants modeled by ordinary differential equations. The nonlinear controller comprising a network of neural networks is taught using a two-phase learning procedure realized through novel techniques for initialization, on-line training, and adaptive critic design. A critical observation is that the gradients of the functions defined by the neural networks must equal corresponding linear gain matrices at chosen operating points. On-line training is based on a dual heuristic adaptive critic architecture that improves control for large, coupled motions by accounting for actual plant dynamics and nonlinear effects. An action network computes the optimal control law; a critic network predicts the derivative of the cost-to-go with respect to the state. Both networks are algebraically initialized based on prior knowledge of satisfactory pointwise linear controllers and continue to adapt on line during full-scale simulations of the plant. On-line training takes place sequentially over discrete periods of time and involves several numerical procedures. A backpropagating algorithm called Resilient Backpropagation is modified and successfully implemented to meet these objectives, without excessive computational expense. This adaptive controller is as conservative as the linear designs and as effective as a global nonlinear controller. The method is successfully implemented for the full-envelope control of a six-degree-of-freedom aircraft simulation. The results show that the on-line adaptation brings about improved performance with respect to the initialization phase during aircraft maneuvers that involve large-angle and coupled dynamics, and parameter variations.

Architecting Communication Network of Networks for Space System of Systems

NASA Technical Reports Server (NTRS)

Bhasin, Kul B.; Hayden, Jeffrey L.

2008-01-01

The National Aeronautics and Space Administration (NASA) and the Department of Defense (DoD) are planning Space System of Systems (SoS) to address the new challenges of space exploration, defense, communications, navigation, Earth observation, and science. In addition, these complex systems must provide interoperability, enhanced reliability, common interfaces, dynamic operations, and autonomy in system management. Both NASA and the DoD have chosen to meet the new demands with high data rate communication systems and space Internet technologies that bring Internet Protocols (IP), routers, servers, software, and interfaces to space networks to enable as much autonomous operation of those networks as possible. These technologies reduce the cost of operations and, with higher bandwidths, support the expected voice, video, and data needed to coordinate activities at each stage of an exploration mission. In this paper, we discuss, in a generic fashion, how the architectural approaches and processes are being developed and used for defining a hypothetical communication and navigation networks infrastructure to support lunar exploration. Examples are given of the products generated by the architecture development process.

Review of optical wireless communications for data centers

NASA Astrophysics Data System (ADS)

Arnon, Shlomi

2017-10-01

A data center (DC) is a facility either physical or virtual, for running applications, searching, storage, management and dissemination of information known as cloud computing, which consume a huge amount of energy. A DC includes thousands of servers, communication and storage equipment and a support system including an air conditioning system, security, monitoring equipment and electricity regulator units. Data center operators face the challenges of meeting exponentially increasing demands for network bandwidth without unreasonable increases in operation and infrastructure cost. In order to meet the requirements of moderate increase in operation and infrastructure cost technology, a revolution is required. One way to overcome the shortcomings of traditional static (wired) data center architectures is use of a hybrid network based on fiber and optical wireless communication (OWC) or free space optics (FSO). The OWC link could be deployed on top of the existing cable/fiber network layer, so that live migration could be done easily and dynamically. In that case the network topology is flexible and adapts quickly to changes in traffic, heat distribution, power consumption and characteristics of the applications. In addition, OWC could provide an easy way to maintain and scale up data centers. As a result total cost of ownership could be reduced and the return on investment could be increased. In this talk we will review the main OWC technologies applicable for data centers, indicate how energy could be saved using OWC multichannel communication and discuss the issue of OWC pointing accuracy for data center scenario.

Cellular automata with object-oriented features for parallel molecular network modeling.

PubMed

Zhu, Hao; Wu, Yinghui; Huang, Sui; Sun, Yan; Dhar, Pawan

2005-06-01

Cellular automata are an important modeling paradigm for studying the dynamics of large, parallel systems composed of multiple, interacting components. However, to model biological systems, cellular automata need to be extended beyond the large-scale parallelism and intensive communication in order to capture two fundamental properties characteristic of complex biological systems: hierarchy and heterogeneity. This paper proposes extensions to a cellular automata language, Cellang, to meet this purpose. The extended language, with object-oriented features, can be used to describe the structure and activity of parallel molecular networks within cells. Capabilities of this new programming language include object structure to define molecular programs within a cell, floating-point data type and mathematical functions to perform quantitative computation, message passing capability to describe molecular interactions, as well as new operators, statements, and built-in functions. We discuss relevant programming issues of these features, including the object-oriented description of molecular interactions with molecule encapsulation, message passing, and the description of heterogeneity and anisotropy at the cell and molecule levels. By enabling the integration of modeling at the molecular level with system behavior at cell, tissue, organ, or even organism levels, the program will help improve our understanding of how complex and dynamic biological activities are generated and controlled by parallel functioning of molecular networks. Index Terms-Cellular automata, modeling, molecular network, object-oriented.

Performative family: homosexuality, marriage and intergenerational dynamics in China.

PubMed

Choi, Susanne Yp; Luo, Ming

2016-06-01

Using in-depth interview data on nominal marriages - legal marriages between a gay man and a lesbian to give the appearance of heterosexuality - this paper develops the concept of performative family to explain the processes through which parents and their adult children negotiate and resolve disagreements in relation to marriage decisions in post-socialist China. We identify three mechanisms - network pressure, a revised discourse of filial piety and resource leverage - through which parents influence their gay offspring's decision to turn to nominal marriage. We also delineate six strategies, namely minimizing network participation, changing expectations, making partial concessions, drawing the line, delaying decisions and ending the marriage, by which gay people in nominal marriages attempt to meet parental expectations while simultaneously retaining a degree of autonomy. Through these interactions, we argue that Chinese parents and their gay adult children implicitly and explicitly collaborate to perform family, emphasizing the importance of formally meeting society's expectations about marriage rather than substantively yielding to its demands. We also argue that the performative family is a pragmatic response to the tension between the persistent centrality of family and marriage and the rising tide of individualism in post-socialist China. We believe that our findings highlight the specific predicament of homosexual people. They also shed light on the more general dynamics of intergenerational negotiation because there is evidence that the mechanisms used by parents to exert influence may well be similar between gay and non-gay people. © London School of Economics and Political Science 2016.

The Internet As a Large-Scale Complex System

NASA Astrophysics Data System (ADS)

Park, Kihong; Willinger, Walter

2005-06-01

The Internet may be viewed as a "complex system" with diverse features and many components that can give rise to unexpected emergent phenomena, revealing much about its own engineering. This book brings together chapter contributions from a workshop held at the Santa Fe Institute in March 2001. This volume captures a snapshot of some features of the Internet that may be fruitfully approached using a complex systems perspective, meaning using interdisciplinary tools and methods to tackle the subject area. The Internet penetrates the socioeconomic fabric of everyday life; a broader and deeper grasp of the Internet may be needed to meet the challenges facing the future. The resulting empirical data have already proven to be invaluable for gaining novel insights into the network's spatio-temporal dynamics, and can be expected to become even more important when tryin to explain the Internet's complex and emergent behavior in terms of elementary networking-based mechanisms. The discoveries of fractal or self-similar network traffic traces, power-law behavior in network topology and World Wide Web connectivity are instances of unsuspected, emergent system traits. Another important factor at the heart of fair, efficient, and stable sharing of network resources is user behavior. Network systems, when habited by selfish or greedy users, take on the traits of a noncooperative multi-party game, and their stability and efficiency are integral to understanding the overall system and its dynamics. Lastly, fault-tolerance and robustness of large-scale network systems can exhibit spatial and temporal correlations whose effective analysis and management may benefit from rescaling techniques applied in certain physical and biological systems. The present book will bring together several of the leading workers involved in the analysis of complex systems with the future development of the Internet.

Spatial-spectral flexible optical networking: enabling switching solutions for a simplified and efficient SDM network platform

NASA Astrophysics Data System (ADS)

Tomkos, I.; Zakynthinos, P.; Klonidis, D.; Marom, D.; Sygletos, S.; Ellis, A.; Salvadori, E.; Siracusa, D.; Angelou, M.; Papastergiou, G.; Psaila, N.; Ferran, J. F.; Ben-Ezra, S.; Jimenez, F.; Fernández-Palacios, J. P.

2013-12-01

The traffic carried by core optical networks grows at a steady but remarkable pace of 30-40% year-over-year. Optical transmissions and networking advancements continue to satisfy the traffic requirements by delivering the content over the network infrastructure in a cost and energy efficient manner. Such core optical networks serve the information traffic demands in a dynamic way, in response to requirements for shifting of traffics demands, both temporally (day/night) and spatially (business district/residential). However as we are approaching fundamental spectral efficiency limits of singlemode fibers, the scientific community is pursuing recently the development of an innovative, all-optical network architecture introducing the spatial degree of freedom when designing/operating future transport networks. Spacedivision- multiplexing through the use of bundled single mode fibers, and/or multi-core fibers and/or few-mode fibers can offer up to 100-fold capacity increase in future optical networks. The EU INSPACE project is working on the development of a complete spatial-spectral flexible optical networking solution, offering the network ultra-high capacity, flexibility and energy efficiency required to meet the challenges of delivering exponentially growing traffic demands in the internet over the next twenty years. In this paper we will present the motivation and main research activities of the INSPACE consortium towards the realization of the overall project solution.

Achieving fast and stable failure detection in WDM Networks

NASA Astrophysics Data System (ADS)

Gao, Donghui; Zhou, Zhiyu; Zhang, Hanyi

2005-02-01

In dynamic networks, the failure detection time takes a major part of the convergence time, which is an important network performance index. To detect a node or link failure in the network, traditional protocols, like Hello protocol in OSPF or RSVP, exchanges keep-alive messages between neighboring nodes to keep track of the link/node state. But by default settings, it can get a minimum detection time in the measure of dozens of seconds, which can not meet the demands of fast network convergence and failure recovery. When configuring the related parameters to reduce the detection time, there will be notable instability problems. In this paper, we analyzed the problem and designed a new failure detection algorithm to reduce the network overhead of detection signaling. Through our experiment we found it is effective to enhance the stability by implicitly acknowledge other signaling messages as keep-alive messages. We conducted our proposal and the previous approaches on the ASON test-bed. The experimental results show that our algorithm gives better performances than previous schemes in about an order magnitude reduction of both false failure alarms and queuing delay to other messages, especially under light traffic load.

Adaptive dynamical networks

NASA Astrophysics Data System (ADS)

Maslennikov, O. V.; Nekorkin, V. I.

2017-10-01

Dynamical networks are systems of active elements (nodes) interacting with each other through links. Examples are power grids, neural structures, coupled chemical oscillators, and communications networks, all of which are characterized by a networked structure and intrinsic dynamics of their interacting components. If the coupling structure of a dynamical network can change over time due to nodal dynamics, then such a system is called an adaptive dynamical network. The term ‘adaptive’ implies that the coupling topology can be rewired; the term ‘dynamical’ implies the presence of internal node and link dynamics. The main results of research on adaptive dynamical networks are reviewed. Key notions and definitions of the theory of complex networks are given, and major collective effects that emerge in adaptive dynamical networks are described.

Physical Therapists' Perceptions of School-Based Practices.

PubMed

Holt, Sheryl L; Kuperstein, Janice; Effgen, Susan K

2015-01-01

Surveys have reported that most school-based physical therapists perceive ideal practices are not commonly implemented in their settings. Our aim was to obtain a more in-depth understanding of these perceptions through open-ended inquiry. Qualitative data were derived from voluntary open-ended responses provided upon completion of a survey regarding school-based physical therapy practice. Of the survey's 561 participants, 250 provided open-ended commentaries that were analyzed using interpretive phenomenology. Six qualitative themes emerged from the open-ended responses, including: In quest: Meeting students' school-based needs via physical therapy; Seeking relatedness: Finding working teams in the school system; Building understanding: Developing a voice/identity in the school context; Stretched beyond limits: Managing workloads; Networking: Coordinating services outside school to meet student needs; Defying definition: What does working in an educational model mean? School-based physical therapists seek to meet educationally relevant physical therapy needs of students, ages 3 to 21 years. Successes appear woven of a multitude of factors such as therapist expertise, team dynamics, and district supports.

Graph Theory Meets Ab Initio Molecular Dynamics: Atomic Structures and Transformations at the Nanoscale

NASA Astrophysics Data System (ADS)

Pietrucci, Fabio; Andreoni, Wanda

2011-08-01

Social permutation invariant coordinates are introduced describing the bond network around a given atom. They originate from the largest eigenvalue and the corresponding eigenvector of the contact matrix, are invariant under permutation of identical atoms, and bear a clear signature of an order-disorder transition. Once combined with ab initio metadynamics, these coordinates are shown to be a powerful tool for the discovery of low-energy isomers of molecules and nanoclusters as well as for a blind exploration of isomerization, association, and dissociation reactions.

Criticality meets learning: Criticality signatures in a self-organizing recurrent neural network

PubMed Central

Del Papa, Bruno; Priesemann, Viola

2017-01-01

Many experiments have suggested that the brain operates close to a critical state, based on signatures of criticality such as power-law distributed neuronal avalanches. In neural network models, criticality is a dynamical state that maximizes information processing capacities, e.g. sensitivity to input, dynamical range and storage capacity, which makes it a favorable candidate state for brain function. Although models that self-organize towards a critical state have been proposed, the relation between criticality signatures and learning is still unclear. Here, we investigate signatures of criticality in a self-organizing recurrent neural network (SORN). Investigating criticality in the SORN is of particular interest because it has not been developed to show criticality. Instead, the SORN has been shown to exhibit spatio-temporal pattern learning through a combination of neural plasticity mechanisms and it reproduces a number of biological findings on neural variability and the statistics and fluctuations of synaptic efficacies. We show that, after a transient, the SORN spontaneously self-organizes into a dynamical state that shows criticality signatures comparable to those found in experiments. The plasticity mechanisms are necessary to attain that dynamical state, but not to maintain it. Furthermore, onset of external input transiently changes the slope of the avalanche distributions – matching recent experimental findings. Interestingly, the membrane noise level necessary for the occurrence of the criticality signatures reduces the model’s performance in simple learning tasks. Overall, our work shows that the biologically inspired plasticity and homeostasis mechanisms responsible for the SORN’s spatio-temporal learning abilities can give rise to criticality signatures in its activity when driven by random input, but these break down under the structured input of short repeating sequences. PMID:28552964

A Dynamic Programming Approach for Base Station Sleeping in Cellular Networks

NASA Astrophysics Data System (ADS)

Gong, Jie; Zhou, Sheng; Niu, Zhisheng

The energy consumption of the information and communication technology (ICT) industry, which has become a serious problem, is mostly due to the network infrastructure rather than the mobile terminals. In this paper, we focus on reducing the energy consumption of base stations (BSs) by adjusting their working modes (active or sleep). Specifically, the objective is to minimize the energy consumption while satisfying quality of service (QoS, e.g., blocking probability) requirement and, at the same time, avoiding frequent mode switching to reduce signaling and delay overhead. The problem is modeled as a dynamic programming (DP) problem, which is NP-hard in general. Based on cooperation among neighboring BSs, a low-complexity algorithm is proposed to reduce the size of state space as well as that of action space. Simulations demonstrate that, with the proposed algorithm, the active BS pattern well meets the time variation and the non-uniform spatial distribution of system traffic. Moreover, the tradeoff between the energy saving from BS sleeping and the cost of switching is well balanced by the proposed scheme.

Hybrid Fiber/Copper LAN Meets School's 25-Year Networking Requirements.

ERIC Educational Resources Information Center

Petruso, Sam; Humes, Vince

1994-01-01

Describes an innovative new curriculum being implemented at Walnut Creek Middle School (Pennsylvania) and an advanced networked computer environment that supports it now and will also meet future needs. Topics addressed include physical facilities; networking goals, both short-term and long-term; fiber-optic cable versus copper; and future…

Mixed Integer Programming and Heuristic Scheduling for Space Communication

NASA Technical Reports Server (NTRS)

Lee, Charles H.; Cheung, Kar-Ming

2013-01-01

Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.

Getting to the Root of Things: Spatiotemporal Regulatory Networks (JGI Seventh Annual User Meeting 2012: Genomics of Energy and Environment)

ScienceCinema

Brady, Siobhan

2018-02-12

Siobhan Brady from University of California, Davis, gives a talk titled "Getting to the Root of things: Spatiotemporal Regulatory Networks" at the JGI 7th Annual Users Meeting: Genomics of Energy & Environment Meeting on March 22, 2012 in Walnut Creek, California.

Getting to the Root of Things: Spatiotemporal Regulatory Networks (JGI Seventh Annual User Meeting 2012: Genomics of Energy and Environment)

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

Brady, Siobhan

2012-03-22

Siobhan Brady from University of California, Davis, gives a talk titled "Getting to the Root of things: Spatiotemporal Regulatory Networks" at the JGI 7th Annual Users Meeting: Genomics of Energy & Environment Meeting on March 22, 2012 in Walnut Creek, California.

77 FR 56622 - First Responder Network Authority Board Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2012-09-13

... on September 25, 2012, from 9 a.m. to 12:30 p.m. Eastern Time. ADDRESSES: Board members will meet in... FirstNet to establish a single nationwide, interoperable public safety broadband network. The FirstNet... will hold its first public meeting on September 25, 2012. Matters to Be Considered: The FirstNet Board...

78 FR 59929 - Sunshine Act Meeting; Open Commission Meeting; Thursday, September 26, 2013

Federal Register 2010, 2011, 2012, 2013, 2014

2013-09-30

... the HOMELAND SECURITY. Resiliency of Mobile Wireless Communications Networks SUMMARY: The Commission... choice and facilitate improvements to the resiliency of mobile wireless networks during emergencies. 5...

Robustness of Oscillatory Behavior in Correlated Networks

PubMed Central

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

Lessons Learned from the Young Breast Cancer Survivorship Network.

PubMed

Gisiger-Camata, Silvia; Nolan, Timiya S; Vo, Jacqueline B; Bail, Jennifer R; Lewis, Kayla A; Meneses, Karen

2017-11-30

The Young Breast Cancer Survivors Network (Network) is an academic and community-based partnership dedicated to education, support, and networking. The Network used a multi-pronged approach via monthly support and networking, annual education seminars, website networking, and individual survivor consultation. Formative and summative evaluations were conducted using group survey and individual survivor interviews for monthly gatherings, annual education meetings, and individual consultation. Google Analytics was applied to evaluate website use. The Network began with 4 initial partnerships and grew to 38 in the period from 2011 to 2017. During this 5-year period, 5 annual meetings (598 attendees), 23 support and networking meetings (373), and 115 individual survivor consultations were conducted. The Network website had nearly 12,000 individual users and more than 25,000 page views. Lessons learned include active community engagement, survivor empowerment, capacity building, social media outreach, and network sustainability. The 5-year experiences with the Network demonstrated that a regional program dedicated to the education, support, networking, and needs of young breast cancer survivors and their families can become a vital part of cancer survivorship services in a community. Strong community support, engagement, and encouragement were vital components to sustain the program.

Coping with Aging and Amputation

MedlinePlus

... Find Support Certified Peer Visitor (CPV) Program Support Group Network Support Group Meeting Calendar Hospital/Rehab Facility Partners ... Find Support Certified Peer Visitor (CPV) Program Support Group Network Support Group Meeting Calendar Hospital/Rehab Facility Partners ...

Regulatory Networks Controlling Plant Cold Acclimation or Low Temperature Regulatory Networks Controlling Cold Acclimation in Arabidopsis (2011 JGI User Meeting)

ScienceCinema

Thomashow, Mike

2018-02-06

The U.S. Department of Energy Joint Genome Institute (JGI) invited scientists interested in the application of genomics to bioenergy and environmental issues, as well as all current and prospective users and collaborators, to attend the annual DOE JGI Genomics of Energy & Environment Meeting held March 22-24, 2011 in Walnut Creek, Calif. The emphasis of this meeting was on the genomics of renewable energy strategies, carbon cycling, environmental gene discovery, and engineering of fuel-producing organisms. The meeting features presentations by leading scientists advancing these topics. Mike Thomashow of Michigan State University gives a presentation on on "Low Temperature Regulatory Networks Controlling Cold Acclimation in Arabidopsis" at the 6th annual Genomics of Energy & Environment Meeting on March 23, 2011."

Performance evaluation of data center service localization based on virtual resource migration in software defined elastic optical network.

PubMed

Yang, Hui; Zhang, Jie; Ji, Yuefeng; Tan, Yuanlong; Lin, Yi; Han, Jianrui; Lee, Young

2015-09-07

Data center interconnection with elastic optical network is a promising scenario to meet the high burstiness and high-bandwidth requirements of data center services. In our previous work, we implemented cross stratum optimization of optical network and application stratums resources that allows to accommodate data center services. In view of this, this study extends the data center resources to user side to enhance the end-to-end quality of service. We propose a novel data center service localization (DCSL) architecture based on virtual resource migration in software defined elastic data center optical network. A migration evaluation scheme (MES) is introduced for DCSL based on the proposed architecture. The DCSL can enhance the responsiveness to the dynamic end-to-end data center demands, and effectively reduce the blocking probability to globally optimize optical network and application resources. The overall feasibility and efficiency of the proposed architecture are experimentally verified on the control plane of our OpenFlow-based enhanced SDN testbed. The performance of MES scheme under heavy traffic load scenario is also quantitatively evaluated based on DCSL architecture in terms of path blocking probability, provisioning latency and resource utilization, compared with other provisioning scheme.

Dynamically rich, yet parameter-sparse models for spatial epidemiology. Comment on "Coupled disease-behavior dynamics on complex networks: A review" by Z. Wang et al.

NASA Astrophysics Data System (ADS)

Jusup, Marko; Iwami, Shingo; Podobnik, Boris; Stanley, H. Eugene

2015-12-01

Since the very inception of mathematical modeling in epidemiology, scientists exploited the simplicity ingrained in the assumption of a well-mixed population. For example, perhaps the earliest susceptible-infectious-recovered (SIR) model developed by L. Reed and W.H. Frost in the 1920s [1], included the well-mixed assumption such that any two individuals in the population could meet each other. The problem was that, unlike many other simplifying assumptions used in epidemiological modeling whose validity holds in one situation or the other, well-mixed populations are almost non-existent in reality because the nature of human socio-economic interactions is, for the most part, highly heterogeneous (e.g. [2-6]).

Computer network environment planning and analysis

NASA Technical Reports Server (NTRS)

Dalphin, John F.

1989-01-01

The GSFC Computer Network Environment provides a broadband RF cable between campus buildings and ethernet spines in buildings for the interlinking of Local Area Networks (LANs). This system provides terminal and computer linkage among host and user systems thereby providing E-mail services, file exchange capability, and certain distributed computing opportunities. The Environment is designed to be transparent and supports multiple protocols. Networking at Goddard has a short history and has been under coordinated control of a Network Steering Committee for slightly more than two years; network growth has been rapid with more than 1500 nodes currently addressed and greater expansion expected. A new RF cable system with a different topology is being installed during summer 1989; consideration of a fiber optics system for the future will begin soon. Summmer study was directed toward Network Steering Committee operation and planning plus consideration of Center Network Environment analysis and modeling. Biweekly Steering Committee meetings were attended to learn the background of the network and the concerns of those managing it. Suggestions for historical data gathering have been made to support future planning and modeling. Data Systems Dynamic Simulator, a simulation package developed at NASA and maintained at GSFC was studied as a possible modeling tool for the network environment. A modeling concept based on a hierarchical model was hypothesized for further development. Such a model would allow input of newly updated parameters and would provide an estimation of the behavior of the network.

77 FR 1779 - Meeting and Webinar on Integrated Dynamic Transit Operations; Notice of Public Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2012-01-11

.... Transit- oriented Connected Vehicle for Mobility applications support dynamic system operations and... DEPARTMENT OF TRANSPORTATION Meeting and Webinar on Integrated Dynamic Transit Operations; Notice... Transportation. ACTION: Notice. The U.S. Department of Transportation (USDOT) Intelligent Transportation System...

Simultaneous Visualization of Different Utility Networks for Disaster Management

NASA Astrophysics Data System (ADS)

Semm, S.; Becker, T.; Kolbe, T. H.

2012-07-01

Cartographic visualizations of crises are used to create a Common Operational Picture (COP) and enforce Situational Awareness by presenting and representing relevant information. As nearly all crises affect geospatial entities, geo-data representations have to support location-specific decision-making throughout the crises. Since, Operator's attention span and their working memory are limiting factors for the process of getting and interpreting information; the cartographic presentation has to support individuals in coordinating their activities and with handling highly dynamic situations. The Situational Awareness of operators in conjunction with a COP are key aspects of the decision making process and essential for coming to appropriate decisions. Utility networks are one of the most complex and most needed systems within a city. The visualization of utility infrastructure in crisis situations is addressed in this paper. The paper will provide a conceptual approach on how to simplify, aggregate, and visualize multiple utility networks and their components to meet the requirements of the decision-making process and to support Situational Awareness.

Online Learning Flight Control for Intelligent Flight Control Systems (IFCS)

NASA Technical Reports Server (NTRS)

Niewoehner, Kevin R.; Carter, John (Technical Monitor)

2001-01-01

The research accomplishments for the cooperative agreement 'Online Learning Flight Control for Intelligent Flight Control Systems (IFCS)' include the following: (1) previous IFC program data collection and analysis; (2) IFC program support site (configured IFC systems support network, configured Tornado/VxWorks OS development system, made Configuration and Documentation Management Systems Internet accessible); (3) Airborne Research Test Systems (ARTS) II Hardware (developed hardware requirements specification, developing environmental testing requirements, hardware design, and hardware design development); (4) ARTS II software development laboratory unit (procurement of lab style hardware, configured lab style hardware, and designed interface module equivalent to ARTS II faceplate); (5) program support documentation (developed software development plan, configuration management plan, and software verification and validation plan); (6) LWR algorithm analysis (performed timing and profiling on algorithm); (7) pre-trained neural network analysis; (8) Dynamic Cell Structures (DCS) Neural Network Analysis (performing timing and profiling on algorithm); and (9) conducted technical interchange and quarterly meetings to define IFC research goals.

Intellectual Property Issues in the Library Network Context. Proceedings of the Library of Congress Network Advisory Committee Meeting (Washington, D.C., March 23-25, 1988). Network Planning Paper Number 17.

ERIC Educational Resources Information Center

Library of Congress, Washington, DC. Network Development and MARC Standards Office.

The first half of the proceedings consists of three papers presented during the program session of a Library of Congress Network Advisory Committee (NAC) meeting. The first, a background paper by Robert L. Oakley, identifies some of the problems that modern information technology has created for the intellectual property system in the United…

Web catalog of oceanographic data using GeoNetwork

NASA Astrophysics Data System (ADS)

Marinova, Veselka; Stefanov, Asen

2017-04-01

Most of the data collected, analyzed and used by Bulgarian oceanographic data center (BgODC) from scientific cruises, argo floats, ferry boxes and real time operating systems are spatially oriented and need to be displayed on the map. The challenge is to make spatial information more accessible to users, decision makers and scientists. In order to meet this challenge, BgODC concentrate its efforts on improving dynamic and standardized access to their geospatial data as well as those from various related organizations and institutions. BgODC currently is implementing a project to create a geospatial portal for distributing metadata and search, exchange and harvesting spatial data. There are many open source software solutions able to create such spatial data infrastructure (SDI). Finally, the GeoNetwork open source is chosen, as it is already widespread. This software is free, effective and "cheap" solution for implementing SDI at organization level. It is platform independent and runs under many operating systems. Filling of the catalog goes through these practical steps: • Managing and storing data reliably within MS SQL spatial data base; • Registration of maps and data of various formats and sources in GeoServer (most popular open source geospatial server embedded with GeoNetwork) ; • Filling added meta data and publishing geospatial data at the desktop of GeoNetwork. GeoServer and GeoNetwork are based on Java so they require installing of a servlet engine like Tomcat. The experience gained from the use of GeoNetwork Open Source confirms that the catalog meets the requirements for data management and is flexible enough to customize. Building the catalog facilitates sustainable data exchange between end users. The catalog is a big step towards implementation of the INSPIRE directive due to availability of many features necessary for producing "INSPIRE compliant" metadata records. The catalog now contains all available GIS data provided by BgODC for Internet access. Searching data within the catalog is based upon geographic extent, theme type and free text search.

The 2011 Dynamics of Molecular Collisions Conference

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

Nesbitt, David J.

The Dynamics of Molecular Collisions Conference focuses on all aspects of molecular collisions--experimental & theoretical studies of elastic, inelastic, & reactive encounters involving atoms, molecules, ions, clusters, & surfaces--as well as half collisions--photodissociation, photo-induced reaction, & photodesorption. The scientific program for the meeting in 2011 included exciting advances in both the core & multidisciplinary forefronts of the study of molecular collision processes. Following the format of the 2009 meeting, we also invited sessions in special topics that involve interfacial dynamics, novel emerging spectroscopies, chemical dynamics in atmospheric, combustion & interstellar environments, as well as a session devoted to theoretical &more » experimental advances in ultracold molecular samples. Researchers working inside & outside the traditional core topics of the meeting are encouraged to join the conference. We invite contributions of work that seeks understanding of how inter & intra-molecular forces determine the dynamics of the phenomena under study. In addition to invited oral sessions & contributed poster sessions, the scientific program included a formal session consisting of five contributed talks selected from the submitted poster abstracts. The DMC has distinguished itself by having the Herschbach Medal Symposium as part of the meeting format. This tradition of the Herschbach Medal was first started in the 2007 meeting chaired by David Chandler, based on a generous donation of funds & artwork design by Professor Dudley Herschbach himself. There are two such awards made, one for experimental & one for theoretical contributions to the field of Molecular Collision Dynamics, broadly defined. The symposium is always held on the last night of the meeting & has the awardees are asked to deliver an invited lecture on their work. The 2011 Herschbach Medal was dedicated to the contributions of two long standing leaders in Chemical Physics, Professor Yuan T. Lee & Professor George Schatz. Professor Lee’s research has been based on the development & use of advanced chemical kinetics & molecular beams to investigate & manipulate the behavior of fundamental chemical reactions. Lee’s work has been recognized by many awards, including the Nobel Prize for Chemistry in 1986, as well as Sloan Fellow, Dreyfus Scholar, Fellowship in the American Academy of Arts & Sciences, Fellowship in the American Physical Society, Guggenheim Fellow, Member National Academy of Sciences, Member Academia Sinica, E.O. Lawrence Award, Miller Professor, Berkeley, Fairchild Distinguished Scholar, Harrison Howe Award, Peter Debye Award, & the National Medal of Science. Lee also has served as the President of the Academia Sinica in Taiwan (ROC). Professor Schatz’s research group is interested in using theory & computation to describe physical phenomena in a broad range of applications relevant to chemistry, physics, biology & engineering. Among the types of applications that we interested are: optical properties of nanoparticles & nanoparticle assemblies; using theory to model polymer properties; DNA structure, thermodynamics & dynamics; modeling self assembly & nanopatterning; & gas phase reaction dynamics. Among his many awards & distinctions have been appointment as an Alfred P. Sloan Research Fellow, Camille & Henry Dreyfus Teacher-Scholar, the Fresenius Award, Fellow of the American Physical Society, the Max Planck Research Award, Fellowship in the American Association for the Advancement of Science, & election to the International Academy of Quantum Molecular Sciences & the American Academy of Arts & Sciences. Dr Schatz is also lauded for his highly successful work as Editor for the Journal of Physical Chemistry. We requested $10,000 from DOE in support of this meeting. The money was distributed widely among the student & post doctoral fellows & some used to attract the very best scientists in the field. The organizers were committed to encouraging women & minorities as well as encourage the field of Chemical Physics in scientifically developing countries. For example, it has been a tradition of the DMC meeting to offer of order 40 scholarships for students & postdocs to defray registration & travel costs. The benefits of increased graduate student & post doctoral attendance at the meeting cannot be over emphasized. First, these young scientists have the opportunity to present their work by means of the poster session & to a gathering of experts in their field. Secondly the limited size of the meeting allows student & young postdocs to meet & interact directly with experts in their area, to network with their peers at other institutions & become aware of career opportunities. Graduate students & post doctoral fellows are the life blood of our field. Support of their attendance at this & other similar meetings will ensure a continued flow of young talent into many areas of research represented by the DMC meeting & important to DOE.« less

Group Colocation Behavior in Technological Social Networks

PubMed Central

Brown, Chloë; Lathia, Neal; Mascolo, Cecilia; Noulas, Anastasios; Blondel, Vincent

2014-01-01

We analyze two large datasets from technological networks with location and social data: user location records from an online location-based social networking service, and anonymized telecommunications data from a European cellphone operator, in order to investigate the differences between individual and group behavior with respect to physical location. We discover agreements between the two datasets: firstly, that individuals are more likely to meet with one friend at a place they have not visited before, but tend to meet at familiar locations when with a larger group. We also find that groups of individuals are more likely to meet at places that their other friends have visited, and that the type of a place strongly affects the propensity for groups to meet there. These differences between group and solo mobility has potential technological applications, for example, in venue recommendation in location-based social networks. PMID:25148037

Hybrid function projective synchronization in complex dynamical networks

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

Wei, Qiang; Wang, Xing-yuan, E-mail: wangxy@dlut.edu.cn; Hu, Xiao-peng

2014-02-15

This paper investigates hybrid function projective synchronization in complex dynamical networks. When the complex dynamical networks could be synchronized up to an equilibrium or periodic orbit, a hybrid feedback controller is designed to realize the different component of vector of node could be synchronized up to different desired scaling function in complex dynamical networks with time delay. Hybrid function projective synchronization (HFPS) in complex dynamical networks with constant delay and HFPS in complex dynamical networks with time-varying coupling delay are researched, respectively. Finally, the numerical simulations show the effectiveness of theoretical analysis.

Network cosmology.

PubMed

Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S; Rideout, David; Meyer, David; Boguñá, Marián

2012-01-01

Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology.

Network Cosmology

PubMed Central

Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S.; Rideout, David; Meyer, David; Boguñá, Marián

2012-01-01

Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology. PMID:23162688

Proteome complexity and the forces that drive proteome imbalance.

PubMed

Harper, J Wade; Bennett, Eric J

2016-09-15

The cellular proteome is a complex microcosm of structural and regulatory networks that requires continuous surveillance and modification to meet the dynamic needs of the cell. It is therefore crucial that the protein flux of the cell remains in balance to ensure proper cell function. Genetic alterations that range from chromosome imbalance to oncogene activation can affect the speed, fidelity and capacity of protein biogenesis and degradation systems, which often results in proteome imbalance. An improved understanding of the causes and consequences of proteome imbalance is helping to reveal how these systems can be targeted to treat diseases such as cancer.

Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics

NASA Astrophysics Data System (ADS)

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.

Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics.

PubMed

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.

DSGRN: Examining the Dynamics of Families of Logical Models.

PubMed

Cummins, Bree; Gedeon, Tomas; Harker, Shaun; Mischaikow, Konstantin

2018-01-01

We present a computational tool DSGRN for exploring the dynamics of a network by computing summaries of the dynamics of switching models compatible with the network across all parameters. The network can arise directly from a biological problem, or indirectly as the interaction graph of a Boolean model. This tool computes a finite decomposition of parameter space such that for each region, the state transition graph that describes the coarse dynamical behavior of a network is the same. Each of these parameter regions corresponds to a different logical description of the network dynamics. The comparison of dynamics across parameters with experimental data allows the rejection of parameter regimes or entire networks as viable models for representing the underlying regulatory mechanisms. This in turn allows a search through the space of perturbations of a given network for networks that robustly fit the data. These are the first steps toward discovering a network that optimally matches the observed dynamics by searching through the space of networks.

Co-ordination of the International Network of Nuclear Structure and Decay Data Evaluators; Summary Report of an IAEA Technical Meeting

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

Abriola, D.; Tuli, J.

The IAEA Nuclear Data Section convened the 18th meeting of the International Network of Nuclear Structure and Decay Data Evaluators at the IAEA Headquarters, Vienna, 23 to 27 March 2009. This meeting was attended by 22 scientists from 14 Member States, plus IAEA staff, concerned with the compilation, evaluation and dissemination of nuclear structure and decay data. A summary of the meeting, recommendations/conclusions, data centre reports, and various proposals considered, modified and agreed by the participants are contained within this document. The International Network of Nuclear Structure and Decay Data (NSDD) Evaluators holds biennial meetings under the auspices of themore » IAEA, and consists of evaluation groups and data service centres in several countries. This network has the objective of providing up-to-date nuclear structure and decay data for all known nuclides by evaluating all existing experimental data. Data resulting from this international evaluation collaboration is included in the Evaluated Nuclear Structure Data File (ENSDF) and published in the journals Nuclear Physics A and Nuclear Data Sheets (NDS).« less

Theorising big IT programmes in healthcare: strong structuration theory meets actor-network theory.

PubMed

Greenhalgh, Trisha; Stones, Rob

2010-05-01

The UK National Health Service is grappling with various large and controversial IT programmes. We sought to develop a sharper theoretical perspective on the question "What happens - at macro-, meso- and micro-level - when government tries to modernise a health service with the help of big IT?" Using examples from data fragments at the micro-level of clinical work, we considered how structuration theory and actor-network theory (ANT) might be combined to inform empirical investigation. Giddens (1984) argued that social structures and human agency are recursively linked and co-evolve. ANT studies the relationships that link people and technologies in dynamic networks. It considers how discourses become inscribed in data structures and decision models of software, making certain network relations irreversible. Stones' (2005) strong structuration theory (SST) is a refinement of Giddens' work, systematically concerned with empirical research. It views human agents as linked in dynamic networks of position-practices. A quadripartite approcach considers [a] external social structures (conditions for action); [b] internal social structures (agents' capabilities and what they 'know' about the social world); [c] active agency and actions and [d] outcomes as they feed back on the position-practice network. In contrast to early structuration theory and ANT, SST insists on disciplined conceptual methodology and linking this with empirical evidence. In this paper, we adapt SST for the study of technology programmes, integrating elements from material interactionism and ANT. We argue, for example, that the position-practice network can be a socio-technical one in which technologies in conjunction with humans can be studied as 'actants'. Human agents, with their complex socio-cultural frames, are required to instantiate technology in social practices. Structurally relevant properties inscribed and embedded in technological artefacts constrain and enable human agency. The fortunes of healthcare IT programmes might be studied in terms of the interplay between these factors. Copyright 2010 Elsevier Ltd. All rights reserved.

DAWN: Dynamic Ad-hoc Wireless Network

DTIC Science & Technology

2016-06-19

DAWN: Dynamic Ad-hoc Wireless Network The DAWN (Dynamic Ad-hoc Wireless Networks) project is developing a general theory of complex and dynamic... wireless communication networks. To accomplish this, DAWN adopts a very different approach than those followed in the past and summarized above. DAWN... wireless communication networks. The members of DAWN investigated difference aspects of wireless mobile ad hoc networks (MANET). The views, opinions and/or

Verifying the secure setup of UNIX client/servers and detection of network intrusion

NASA Astrophysics Data System (ADS)

Feingold, Richard; Bruestle, Harry R.; Bartoletti, Tony; Saroyan, R. A.; Fisher, John M.

1996-03-01

This paper describes our technical approach to developing and delivering Unix host- and network-based security products to meet the increasing challenges in information security. Today's global `Infosphere' presents us with a networked environment that knows no geographical, national, or temporal boundaries, and no ownership, laws, or identity cards. This seamless aggregation of computers, networks, databases, applications, and the like store, transmit, and process information. This information is now recognized as an asset to governments, corporations, and individuals alike. This information must be protected from misuse. The Security Profile Inspector (SPI) performs static analyses of Unix-based clients and servers to check on their security configuration. SPI's broad range of security tests and flexible usage options support the needs of novice and expert system administrators alike. SPI's use within the Department of Energy and Department of Defense has resulted in more secure systems, less vulnerable to hostile intentions. Host-based information protection techniques and tools must also be supported by network-based capabilities. Our experience shows that a weak link in a network of clients and servers presents itself sooner or later, and can be more readily identified by dynamic intrusion detection techniques and tools. The Network Intrusion Detector (NID) is one such tool. NID is designed to monitor and analyze activity on the Ethernet broadcast Local Area Network segment and product transcripts of suspicious user connections. NID's retrospective and real-time modes have proven invaluable to security officers faced with ongoing attacks to their systems and networks.

77 FR 74674 - National Center for Advancing Translational Sciences; Notice of Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2012-12-17

... Network Review Board. The meeting will be open to the public, with attendance limited to space available... Committee: Cures Acceleration Network Review Board. Date: January 23, 2013. Time: 8:30 a.m. to 2:45 p.m...

The ENCCA-WP7/EuroSarc/EEC/PROVABES/EURAMOS 3rd European Bone Sarcoma Networking Meeting/Joint Workshop of EU Bone Sarcoma Translational Research Networks; Vienna, Austria, September 24-25, 2015. Workshop Report.

PubMed

Kager, Leo; Whelan, Jeremy; Dirksen, Uta; Hassan, Bass; Anninga, Jakob; Bennister, Lindsey; Bovée, Judith V M G; Brennan, Bernadette; Broto, Javier M; Brugières, Laurence; Cleton-Jansen, Anne-Marie; Copland, Christopher; Dutour, Aurélie; Fagioli, Franca; Ferrari, Stefano; Fiocco, Marta; Fleuren, Emmy; Gaspar, Nathalie; Gelderblom, Hans; Gerrand, Craig; Gerß, Joachim; Gonzato, Ornella; van der Graaf, Winette; Hecker-Nolting, Stefanie; Herrero-Martín, David; Klco-Brosius, Stephanie; Kovar, Heinrich; Ladenstein, Ruth; Lancia, Carlo; LeDeley, Marie-Cecile; McCabe, Martin G; Metzler, Markus; Myklebost, Ola; Nathrath, Michaela; Picci, Piero; Potratz, Jenny; Redini, Françoise; Richter, Günther H S; Reinke, Denise; Rutkowski, Piotr; Scotlandi, Katia; Strauss, Sandra; Thomas, David; Tirado, Oscar M; Tirode, Franck; Vassal, Gilles; Bielack, Stefan S

2016-01-01

This report summarizes the results of the 3rd Joint ENCCA-WP7, EuroSarc, EEC, PROVABES, and EURAMOS European Bone Sarcoma Network Meeting, which was held at the Children's Cancer Research Institute in Vienna, Austria on September 24-25, 2015. The joint bone sarcoma network meetings bring together European bone sarcoma researchers to present and discuss current knowledge on bone sarcoma biology, genetics, immunology, as well as results from preclinical investigations and clinical trials, to generate novel hypotheses for collaborative biological and clinical investigations. The ultimate goal is to further improve therapy and outcome in patients with bone sarcomas.

Toward a Mexican eddy covariance network for carbon cycle science

NASA Astrophysics Data System (ADS)

Vargas, Rodrigo; Yépez, Enrico A.

2011-09-01

First Annual MexFlux Principal Investigators Meeting; Hermosillo, Sonora, Mexico, 4-8 May 2011; The carbon cycle science community has organized a global network, called FLUXNET, to measure the exchange of energy, water, and carbon dioxide (CO2) between the ecosystems and the atmosphere using the eddy covariance technique. This network has provided unprecedented information for carbon cycle science and global climate change but is mostly represented by study sites in the United States and Europe. Thus, there is an important gap in measurements and understanding of ecosystem dynamics in other regions of the world that are seeing a rapid change in land use. Researchers met under the sponsorship of Red Temática de Ecosistemas and Consejo Nacional de Ciencia y Tecnologia (CONACYT) to discuss strategies to establish a Mexican eddy covariance network (MexFlux) by identifying researchers, study sites, and scientific goals. During the meeting, attendees noted that 10 study sites have been established in Mexico with more than 30 combined years of information. Study sites span from new sites installed during 2011 to others with 9 to 6 years of measurements. Sites with the longest span measurements are located in Baja California Sur (established by Walter Oechel in 2002) and Sonora (established by Christopher Watts in 2005); both are semiarid ecosystems. MexFlux sites represent a variety of ecosystem types, including Mediterranean and sarcocaulescent shrublands in Baja California; oak woodland, subtropical shrubland, tropical dry forest, and a grassland in Sonora; tropical dry forests in Jalisco and Yucatan; a managed grassland in San Luis Potosi; and a managed pine forest in Hidalgo. Sites are maintained with an individual researcher's funds from Mexican government agencies (e.g., CONACYT) and international collaborations, but no coordinated funding exists for a long-term program.

Feasibility and perceived benefits of a framework for physician-parent follow-up meetings after a child's death in the PICU.

PubMed

Meert, Kathleen L; Eggly, Susan; Berg, Robert A; Wessel, David L; Newth, Christopher J L; Shanley, Thomas P; Harrison, Rick; Dalton, Heidi; Clark, Amy E; Dean, J Michael; Doctor, Allan; Nicholson, Carol E

2014-01-01

To evaluate the feasibility and perceived benefits of conducting physician-parent follow-up meetings after a child's death in the PICU according to a framework developed by the Collaborative Pediatric Critical Care Research Network. Prospective observational study. Seven Collaborative Pediatric Critical Care Research Network-affiliated children's hospitals. Critical care attending physicians, bereaved parents, and meeting guests (i.e., parent support persons, other health professionals). Physician-parent follow-up meetings using the Collaborative Pediatric Critical Care Research Network framework. Forty-six critical care physicians were trained to conduct follow-up meetings using the framework. All meetings were video recorded. Videos were evaluated for the presence or absence of physician behaviors consistent with the framework. Present behaviors were evaluated for performance quality using a 5-point scale (1 = low, 5 = high). Participants completed meeting evaluation surveys. Parents of 194 deceased children were mailed an invitation to a follow-up meeting. Of these, one or both parents from 39 families (20%) agreed to participate, 80 (41%) refused, and 75 (39%) could not be contacted. Of 39 who initially agreed, three meetings were canceled due to conflicting schedules. Thirty-six meetings were conducted including 54 bereaved parents, 17 parent support persons, 23 critical care physicians, and 47 other health professionals. Physician adherence to the framework was high; 79% of behaviors consistent with the framework were rated as present with a quality score of 4.3 ± 0.2. Of 50 evaluation surveys completed by parents, 46 (92%) agreed or strongly agreed the meeting was helpful to them and 40 (89%) to others they brought with them. Of 36 evaluation surveys completed by critical care physicians (i.e., one per meeting), 33 (92%) agreed or strongly agreed the meeting was beneficial to parents and 31 (89%) to them. Follow-up meetings using the Collaborative Pediatric Critical Care Research Network framework are feasible and viewed as beneficial by meeting participants. Future research should evaluate the effects of follow-up meetings on bereaved parents' health outcomes.

Electronic Information Delivery Systems. Proceedings of the Library of Congress Network Advisory Committee Meeting (Washington, D.C., April 18-20, 1984). Network Planning Paper Number 9.

ERIC Educational Resources Information Center

Library of Congress, Washington, DC.

The Program Session of the April 1984 meeting of the Library of Congress Network Advisory Committee (NAC) was devoted to discussion of electronic information delivery systems. Recent developments in six areas were covered: (1) electronic manuscript generation and transmission; (2) online full-text searching and retrieval; (3) online database…

GSFC network operations with Tracking and Data Relay Satellites

NASA Astrophysics Data System (ADS)

Spearing, R.; Perreten, D. E.

The Tracking and Data Relay Satellite System (TDRSS) Network (TN) has been developed to provide services to all NASA User spacecraft in near-earth orbits. Three inter-relating entities will provide these services. The TN has been transformed from a network continuously changing to meet User specific requirements to a network which is flexible to meet future needs without significant changes in operational concepts. Attention is given to the evolution of the TN network, the TN capabilities-space segment, forward link services, tracking services, return link services, the three basic capabilities, single access services, multiple access services, simulation services, the White Sands Ground Terminal, the NASA communications network, and the network control center.

GSFC network operations with Tracking and Data Relay Satellites

NASA Technical Reports Server (NTRS)

Spearing, R.; Perreten, D. E.

1984-01-01

The Tracking and Data Relay Satellite System (TDRSS) Network (TN) has been developed to provide services to all NASA User spacecraft in near-earth orbits. Three inter-relating entities will provide these services. The TN has been transformed from a network continuously changing to meet User specific requirements to a network which is flexible to meet future needs without significant changes in operational concepts. Attention is given to the evolution of the TN network, the TN capabilities-space segment, forward link services, tracking services, return link services, the three basic capabilities, single access services, multiple access services, simulation services, the White Sands Ground Terminal, the NASA communications network, and the network control center.

Highly designable phenotypes and mutational buffers emerge from a systematic mapping between network topology and dynamic output.

PubMed

Nochomovitz, Yigal D; Li, Hao

2006-03-14

Deciphering the design principles for regulatory networks is fundamental to an understanding of biological systems. We have explored the mapping from the space of network topologies to the space of dynamical phenotypes for small networks. Using exhaustive enumeration of a simple model of three- and four-node networks, we demonstrate that certain dynamical phenotypes can be generated by an atypically broad spectrum of network topologies. Such dynamical outputs are highly designable, much like certain protein structures can be designed by an unusually broad spectrum of sequences. The network topologies that encode a highly designable dynamical phenotype possess two classes of connections: a fully conserved core of dedicated connections that encodes the stable dynamical phenotype and a partially conserved set of variable connections that controls the transient dynamical flow. By comparing the topologies and dynamics of the three- and four-node network ensembles, we observe a large number of instances of the phenomenon of "mutational buffering," whereby addition of a fourth node suppresses phenotypic variation amongst a set of three-node networks.

Synthetic biology and regulatory networks: where metabolic systems biology meets control engineering

PubMed Central

He, Fei; Murabito, Ettore; Westerhoff, Hans V.

2016-01-01

Metabolic pathways can be engineered to maximize the synthesis of various products of interest. With the advent of computational systems biology, this endeavour is usually carried out through in silico theoretical studies with the aim to guide and complement further in vitro and in vivo experimental efforts. Clearly, what counts is the result in vivo, not only in terms of maximal productivity but also robustness against environmental perturbations. Engineering an organism towards an increased production flux, however, often compromises that robustness. In this contribution, we review and investigate how various analytical approaches used in metabolic engineering and synthetic biology are related to concepts developed by systems and control engineering. While trade-offs between production optimality and cellular robustness have already been studied diagnostically and statically, the dynamics also matter. Integration of the dynamic design aspects of control engineering with the more diagnostic aspects of metabolic, hierarchical control and regulation analysis is leading to the new, conceptual and operational framework required for the design of robust and productive dynamic pathways. PMID:27075000

Unsupervised Discovery of Demixed, Low-Dimensional Neural Dynamics across Multiple Timescales through Tensor Component Analysis.

PubMed

Williams, Alex H; Kim, Tony Hyun; Wang, Forea; Vyas, Saurabh; Ryu, Stephen I; Shenoy, Krishna V; Schnitzer, Mark; Kolda, Tamara G; Ganguli, Surya

2018-06-27

Perceptions, thoughts, and actions unfold over millisecond timescales, while learned behaviors can require many days to mature. While recent experimental advances enable large-scale and long-term neural recordings with high temporal fidelity, it remains a formidable challenge to extract unbiased and interpretable descriptions of how rapid single-trial circuit dynamics change slowly over many trials to mediate learning. We demonstrate a simple tensor component analysis (TCA) can meet this challenge by extracting three interconnected, low-dimensional descriptions of neural data: neuron factors, reflecting cell assemblies; temporal factors, reflecting rapid circuit dynamics mediating perceptions, thoughts, and actions within each trial; and trial factors, describing both long-term learning and trial-to-trial changes in cognitive state. We demonstrate the broad applicability of TCA by revealing insights into diverse datasets derived from artificial neural networks, large-scale calcium imaging of rodent prefrontal cortex during maze navigation, and multielectrode recordings of macaque motor cortex during brain machine interface learning. Copyright © 2018 Elsevier Inc. All rights reserved.

Advanced Polymer Network Structures

DTIC Science & Technology

2016-02-01

double networks in a single step was identified from coarse-grained molecular dynamics simulations of polymer solvents bearing rigid side chains dissolved...in a polymer network. Coarse-grained molecular dynamics simulations also explored the mechanical behavior of traditional double networks and...DRI), polymer networks, polymer gels, molecular dynamics simulations , double networks 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF

Dynamic Trust Management for Mobile Networks and Its Applications

ERIC Educational Resources Information Center

Bao, Fenye

2013-01-01

Trust management in mobile networks is challenging due to dynamically changing network environments and the lack of a centralized trusted authority. In this dissertation research, we "design" and "validate" a class of dynamic trust management protocols for mobile networks, and demonstrate the utility of dynamic trust management…

Patterning vascular networks in vivo for tissue engineering applications.

PubMed

Chaturvedi, Ritika R; Stevens, Kelly R; Solorzano, Ricardo D; Schwartz, Robert E; Eyckmans, Jeroen; Baranski, Jan D; Stapleton, Sarah Chase; Bhatia, Sangeeta N; Chen, Christopher S

2015-05-01

The ultimate design of functionally therapeutic engineered tissues and organs will rely on our ability to engineer vasculature that can meet tissue-specific metabolic needs. We recently introduced an approach for patterning the formation of functional spatially organized vascular architectures within engineered tissues in vivo. Here, we now explore the design parameters of this approach and how they impact the vascularization of an engineered tissue construct after implantation. We used micropatterning techniques to organize endothelial cells (ECs) into geometrically defined "cords," which in turn acted as a template after implantation for the guided formation of patterned capillaries integrated with the host tissue. We demonstrated that the diameter of the cords before implantation impacts the location and density of the resultant capillary network. Inclusion of mural cells to the vascularization response appears primarily to impact the dynamics of vascularization. We established that clinically relevant endothelial sources such as induced pluripotent stem cell-derived ECs and human microvascular endothelial cells can drive vascularization within this system. Finally, we demonstrated the ability to control the juxtaposition of parenchyma with perfused vasculature by implanting cords containing a mixture of both a parenchymal cell type (hepatocytes) and ECs. These findings define important characteristics that will ultimately impact the design of vasculature structures that meet tissue-specific needs.

78 FR 66021 - National Center for Advancing Translational Sciences; Notice of Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-04

... Network Review Board. The meeting will be open to the public, viewing virtually by WebEx. Individuals can... Network Review Board. Date: December 12, 2013. Time: 11:00 a.m. to 2:00 p.m. Agenda: The CAN Review Board...

Consultative meeting considers past successes and future programmes for subregional network.

PubMed

1999-01-01

This article presents the proceedings of the consultative meeting held in Beijing during October 18-19, 1999. Representatives from the population information (POPIN) centers in China, Indonesia, Lao People's Democratic Republic, Malaysia, Mongolia, Myanmar, Philippines, Republic of Korea, Thailand, and Vietnam participated in the meeting. The major objectives were to exchange and share experiences among the network members and to draw up a cooperative work plan for carrying out information activities more effectively in the coming year and beyond. Highlights of the meeting include the presentation of the results of an Asia-Pacific POPIN survey, which evaluated information technology (IT) capabilities among members and evaluation of the 1999 IT-focused training workshop; a review of POPIN activities conducted by the subregional network's members in the past year; and a discussion of major topics for cooperative activities. Moreover, a work plan was formulated for the East and South-East Asia POPIN subregional network for October 1999-October 2000.

A Standard-Compliant Virtual Meeting System with Active Video Object Tracking

NASA Astrophysics Data System (ADS)

Lin, Chia-Wen; Chang, Yao-Jen; Wang, Chih-Ming; Chen, Yung-Chang; Sun, Ming-Ting

2002-12-01

This paper presents an H.323 standard compliant virtual video conferencing system. The proposed system not only serves as a multipoint control unit (MCU) for multipoint connection but also provides a gateway function between the H.323 LAN (local-area network) and the H.324 WAN (wide-area network) users. The proposed virtual video conferencing system provides user-friendly object compositing and manipulation features including 2D video object scaling, repositioning, rotation, and dynamic bit-allocation in a 3D virtual environment. A reliable, and accurate scheme based on background image mosaics is proposed for real-time extracting and tracking foreground video objects from the video captured with an active camera. Chroma-key insertion is used to facilitate video objects extraction and manipulation. We have implemented a prototype of the virtual conference system with an integrated graphical user interface to demonstrate the feasibility of the proposed methods.

Cross stratum resources protection in fog-computing-based radio over fiber networks for 5G services

NASA Astrophysics Data System (ADS)

Guo, Shaoyong; Shao, Sujie; Wang, Yao; Yang, Hui

2017-09-01

In order to meet the requirement of internet of things (IoT) and 5G, the cloud radio access network is a paradigm which converges all base stations computational resources into a cloud baseband unit (BBU) pool, while the distributed radio frequency signals are collected by remote radio head (RRH). A precondition for centralized processing in the BBU pool is an interconnection fronthaul network with high capacity and low delay. However, it has become more complex and frequent in the interaction between RRH and BBU and resource scheduling among BBUs in cloud. Cloud radio over fiber network has been proposed in our previous work already. In order to overcome the complexity and latency, in this paper, we first present a novel cross stratum resources protection (CSRP) architecture in fog-computing-based radio over fiber networks (F-RoFN) for 5G services. Additionally, a cross stratum protection (CSP) scheme considering the network survivability is introduced in the proposed architecture. The CSRP with CSP scheme can effectively pull the remote processing resource locally to implement the cooperative radio resource management, enhance the responsiveness and resilience to the dynamic end-to-end 5G service demands, and globally optimize optical network, wireless and fog resources. The feasibility and efficiency of the proposed architecture with CSP scheme are verified on our software defined networking testbed in terms of service latency, transmission success rate, resource occupation rate and blocking probability.

Generalized Cartographic and Simultaneous Representation of Utility Networks for Decision-Support Systems and Crisis Management in Urban Environments

NASA Astrophysics Data System (ADS)

Becker, T.; König, G.

2015-10-01

Cartographic visualizations of crises are used to create a Common Operational Picture (COP) and enforce Situational Awareness by presenting relevant information to the involved actors. As nearly all crises affect geospatial entities, geo-data representations have to support location-specific analysis throughout the decision-making process. Meaningful cartographic presentation is needed for coordinating the activities of crisis manager in a highly dynamic situation, since operators' attention span and their spatial memories are limiting factors during the perception and interpretation process. Situational Awareness of operators in conjunction with a COP are key aspects in decision-making process and essential for making well thought-out and appropriate decisions. Considering utility networks as one of the most complex and particularly frequent required systems in urban environment, meaningful cartographic presentation of multiple utility networks with respect to disaster management do not exist. Therefore, an optimized visualization of utility infrastructure for emergency response procedures is proposed. The article will describe a conceptual approach on how to simplify, aggregate, and visualize multiple utility networks and their components to meet the requirements of the decision-making process and to support Situational Awareness.

Cacades: A reliable dissemination protocol for data collection sensor network

USGS Publications Warehouse

Peng, Y.; Song, W.; Huang, R.; Xu, M.; Shirazi, B.; LaHusen, R.; Pei, G.

2009-01-01

In this paper, we propose a fast and reliable data dissemination protocol Cascades to disseminate data from the sink(base station) to all or a subset of nodes in a data collection sensor network. Cascades makes use of the parentmonitor-children analogy to ensure reliable dissemination. Each node monitors whether or not its children have received the broadcast messages through snooping children's rebroadcasts or waiting for explicit ACKs. If a node detects a gap in its message sequences, it can fetch the missing messages from its neighbours reactively. Cascades also considers many practical issues for field deployment, such as dynamic topology, link/node failure, etc.. It therefore guarantees that a disseminated message from the sink will reach all intended receivers and the dissemination is terminated in a short time period. Notice that, all existing dissemination protocols either do not guarantee reliability or do not terminate [1, 2], which does not meet the requirement of real-time command control. We conducted experiment evaluations in both TOSSIM simulator and a sensor network testbed to compare Cascades with those existing dissemination protocols in TinyOS sensor networks, which show that Cascades achieves a higher degree of reliability, lower communication cost, and less delivery delay. ??2009 IEEE.

Detailed analysis of routing protocols with different network limitations

NASA Astrophysics Data System (ADS)

Masood, Mohsin; Abuhelala, Mohamed; Glesk, Ivan

2016-12-01

In network communication field, routing protocols have got a significant role which are not only used in networks to handle the user data but also to monitor the different network environments. Dynamic routing protocols such as OSPF, EIGRP and RIP are used for forwarding user data to its destination by instantly detecting the dynamic changes across the network. The dynamic changes in the network can be in the form of topological changes, congestions, links failure etc. Therefore, it becomes a challenge to develop and implement dynamic routing protocols that fulfills the network requirements. Hence, each routing protocol has its own characteristics such as convergence activity, routing metric, routing table etc. and will perform differently in various network environments. This paper presents a comprehensive study of static and dynamic routing, along with dynamic routing protocols. Experiments that are conducted under various network limitations are presented using the OPNET tool. The performance of each of dynamic routing protocols are monitored and explained in the form of simulated results using network parameters. The results are analyzed, in order to provide a clear understanding of each protocol performance for the selection of the proper protocol for a given network environment.

Minimum requirements for predictive pore-network modeling of solute transport in micromodels

NASA Astrophysics Data System (ADS)

Mehmani, Yashar; Tchelepi, Hamdi A.

2017-10-01

Pore-scale models are now an integral part of analyzing fluid dynamics in porous materials (e.g., rocks, soils, fuel cells). Pore network models (PNM) are particularly attractive due to their computational efficiency. However, quantitative predictions with PNM have not always been successful. We focus on single-phase transport of a passive tracer under advection-dominated regimes and compare PNM with high-fidelity direct numerical simulations (DNS) for a range of micromodel heterogeneities. We identify the minimum requirements for predictive PNM of transport. They are: (a) flow-based network extraction, i.e., discretizing the pore space based on the underlying velocity field, (b) a Lagrangian (particle tracking) simulation framework, and (c) accurate transfer of particles from one pore throat to the next. We develop novel network extraction and particle tracking PNM methods that meet these requirements. Moreover, we show that certain established PNM practices in the literature can result in first-order errors in modeling advection-dominated transport. They include: all Eulerian PNMs, networks extracted based on geometric metrics only, and flux-based nodal transfer probabilities. Preliminary results for a 3D sphere pack are also presented. The simulation inputs for this work are made public to serve as a benchmark for the research community.

Optimal Objective-Based Experimental Design for Uncertain Dynamical Gene Networks with Experimental Error.

PubMed

Mohsenizadeh, Daniel N; Dehghannasiri, Roozbeh; Dougherty, Edward R

2018-01-01

In systems biology, network models are often used to study interactions among cellular components, a salient aim being to develop drugs and therapeutic mechanisms to change the dynamical behavior of the network to avoid undesirable phenotypes. Owing to limited knowledge, model uncertainty is commonplace and network dynamics can be updated in different ways, thereby giving multiple dynamic trajectories, that is, dynamics uncertainty. In this manuscript, we propose an experimental design method that can effectively reduce the dynamics uncertainty and improve performance in an interaction-based network. Both dynamics uncertainty and experimental error are quantified with respect to the modeling objective, herein, therapeutic intervention. The aim of experimental design is to select among a set of candidate experiments the experiment whose outcome, when applied to the network model, maximally reduces the dynamics uncertainty pertinent to the intervention objective.

Faculty Meetings: Hidden Conversational Dynamics

ERIC Educational Resources Information Center

Bowman, Richard F.

2015-01-01

In the everydayness of faculty meetings, collegial conversations mirror distinctive dynamics and practices, which either enhance or undercut organizational effectiveness. A cluster of conversational practices affect how colleagues connect, engage, interact, and influence others during faculty meetings in diverse educational settings. The…

Organization of excitable dynamics in hierarchical biological networks.

PubMed

Müller-Linow, Mark; Hilgetag, Claus C; Hütt, Marc-Thorsten

2008-09-26

This study investigates the contributions of network topology features to the dynamic behavior of hierarchically organized excitable networks. Representatives of different types of hierarchical networks as well as two biological neural networks are explored with a three-state model of node activation for systematically varying levels of random background network stimulation. The results demonstrate that two principal topological aspects of hierarchical networks, node centrality and network modularity, correlate with the network activity patterns at different levels of spontaneous network activation. The approach also shows that the dynamic behavior of the cerebral cortical systems network in the cat is dominated by the network's modular organization, while the activation behavior of the cellular neuronal network of Caenorhabditis elegans is strongly influenced by hub nodes. These findings indicate the interaction of multiple topological features and dynamic states in the function of complex biological networks.

Minor positive effects of health-promoting senior meetings for older community-dwelling persons on loneliness, social network, and social support.

PubMed

Gustafsson, Susanne; Berglund, Helene; Faronbi, Joel; Barenfeld, Emmelie; Ottenvall Hammar, Isabelle

2017-01-01

The aim of this study was to evaluate the 1-year effect of the health-promoting intervention "senior meetings" for older community-dwelling persons regarding loneliness, social network, and social support. Secondary analysis of data was carried out from two randomized controlled studies: Elderly Persons in the Risk Zone and Promoting Aging Migrants' Capabilities. Data from 416 participants who attended the senior meetings and the control group at baseline and the 1-year follow-up in the respective studies were included. Data were aggregated and analyzed with chi-square test and odds ratio (OR) to determine the intervention effect. The senior meetings had a positive effect on social support regarding someone to turn to when in need of advice and backing (OR 1.72, p =0.01). No positive intervention effect could be identified for loneliness, social network, or other aspects of social support. Health-promoting senior meetings for older community-dwelling persons have a minor positive effect on social support. The senior meetings might benefit from a revision to reinforce content focused on loneliness, social network, and social support. However, the modest effect could also depend on the lack of accessible social resources to meet participants' identified needs, a possible hindrance for a person's capability. This makes it necessary to conduct further research to evaluate the effect of the senior meetings and other health-promoting initiatives on social aspects of older community-dwelling people's lives, since these aspects are of high importance for life satisfaction and well-being in old age.

75 FR 34459 - Converged Communications and Health Care Devices Impact on Regulation; Public Meeting; Request...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-06-17

... established commercial communications networks such as Internet connectivity to communicate with care... stimulate muscle movement. Examples of devices and applications that use commercial communications networks...] Converged Communications and Health Care Devices Impact on Regulation; Public Meeting; Request for Comments...

Proceedings of the Second Annual NASA Science Internet User Working Group Conference

NASA Technical Reports Server (NTRS)

Jackson, Lenore A. (Editor); Gary, J. Patrick (Editor)

1991-01-01

Copies of the agenda, list of attendees, meeting summaries, and all presentations and exhibit material are contained. Included are plenary sessions, exhibits of advanced networking applications, and user subgroup meetings on NASA Science Internet policy, networking, security, and user services and applications topics.

Dynamic neural networks based on-line identification and control of high performance motor drives

NASA Technical Reports Server (NTRS)

Rubaai, Ahmed; Kotaru, Raj

1995-01-01

In the automated and high-tech industries of the future, there wil be a need for high performance motor drives both in the low-power range and in the high-power range. To meet very straight demands of tracking and regulation in the two quadrants of operation, advanced control technologies are of a considerable interest and need to be developed. In response a dynamics learning control architecture is developed with simultaneous on-line identification and control. the feature of the proposed approach, to efficiently combine the dual task of system identification (learning) and adaptive control of nonlinear motor drives into a single operation is presented. This approach, therefore, not only adapts to uncertainties of the dynamic parameters of the motor drives but also learns about their inherent nonlinearities. In fact, most of the neural networks based adaptive control approaches in use have an identification phase entirely separate from the control phase. Because these approaches separate the identification and control modes, it is not possible to cope with dynamic changes in a controlled process. Extensive simulation studies have been conducted and good performance was observed. The robustness characteristics of neuro-controllers to perform efficiently in a noisy environment is also demonstrated. With this initial success, the principal investigator believes that the proposed approach with the suggested neural structure can be used successfully for the control of high performance motor drives. Two identification and control topologies based on the model reference adaptive control technique are used in this present analysis. No prior knowledge of load dynamics is assumed in either topology while the second topology also assumes no knowledge of the motor parameters.

Automatically assessing properties of dynamic cameras for camera selection and rapid deployment of video content analysis tasks in large-scale ad-hoc networks

NASA Astrophysics Data System (ADS)

den Hollander, Richard J. M.; Bouma, Henri; van Rest, Jeroen H. C.; ten Hove, Johan-Martijn; ter Haar, Frank B.; Burghouts, Gertjan J.

2017-10-01

Video analytics is essential for managing large quantities of raw data that are produced by video surveillance systems (VSS) for the prevention, repression and investigation of crime and terrorism. Analytics is highly sensitive to changes in the scene, and for changes in the optical chain so a VSS with analytics needs careful configuration and prompt maintenance to avoid false alarms. However, there is a trend from static VSS consisting of fixed CCTV cameras towards more dynamic VSS deployments over public/private multi-organization networks, consisting of a wider variety of visual sensors, including pan-tilt-zoom (PTZ) cameras, body-worn cameras and cameras on moving platforms. This trend will lead to more dynamic scenes and more frequent changes in the optical chain, creating structural problems for analytics. If these problems are not adequately addressed, analytics will not be able to continue to meet end users' developing needs. In this paper, we present a three-part solution for managing the performance of complex analytics deployments. The first part is a register containing meta data describing relevant properties of the optical chain, such as intrinsic and extrinsic calibration, and parameters of the scene such as lighting conditions or measures for scene complexity (e.g. number of people). A second part frequently assesses these parameters in the deployed VSS, stores changes in the register, and signals relevant changes in the setup to the VSS administrator. A third part uses the information in the register to dynamically configure analytics tasks based on VSS operator input. In order to support the feasibility of this solution, we give an overview of related state-of-the-art technologies for autocalibration (self-calibration), scene recognition and lighting estimation in relation to person detection. The presented solution allows for rapid and robust deployment of Video Content Analysis (VCA) tasks in large scale ad-hoc networks.

Data analysis-based autonomic bandwidth adjustment in software defined multi-vendor optical transport networks.

PubMed

Li, Yajie; Zhao, Yongli; Zhang, Jie; Yu, Xiaosong; Jing, Ruiquan

2017-11-27

Network operators generally provide dedicated lightpaths for customers to meet the demand for high-quality transmission. Considering the variation of traffic load, customers usually rent peak bandwidth that exceeds the practical average traffic requirement. In this case, bandwidth provisioning is unmetered and customers have to pay according to peak bandwidth. Supposing that network operators could keep track of traffic load and allocate bandwidth dynamically, bandwidth can be provided as a metered service and customers would pay for the bandwidth that they actually use. To achieve cost-effective bandwidth provisioning, this paper proposes an autonomic bandwidth adjustment scheme based on data analysis of traffic load. The scheme is implemented in a software defined networking (SDN) controller and is demonstrated in the field trial of multi-vendor optical transport networks. The field trial shows that the proposed scheme can track traffic load and realize autonomic bandwidth adjustment. In addition, a simulation experiment is conducted to evaluate the performance of the proposed scheme. We also investigate the impact of different parameters on autonomic bandwidth adjustment. Simulation results show that the step size and adjustment period have significant influences on bandwidth savings and packet loss. A small value of step size and adjustment period can bring more benefits by tracking traffic variation with high accuracy. For network operators, the scheme can serve as technical support of realizing bandwidth as metered service in the future.

Dynamic vs. static social networks in models of parasite transmission: predicting Cryptosporidium spread in wild lemurs.

PubMed

Springer, Andrea; Kappeler, Peter M; Nunn, Charles L

2017-05-01

Social networks provide an established tool to implement heterogeneous contact structures in epidemiological models. Dynamic temporal changes in contact structure and ranging behaviour of wildlife may impact disease dynamics. A consensus has yet to emerge, however, concerning the conditions in which network dynamics impact model outcomes, as compared to static approximations that average contact rates over longer time periods. Furthermore, as many pathogens can be transmitted both environmentally and via close contact, it is important to investigate the relative influence of both transmission routes in real-world populations. Here, we use empirically derived networks from a population of wild primates, Verreaux's sifakas (Propithecus verreauxi), and simulated networks to investigate pathogen spread in dynamic vs. static social networks. First, we constructed a susceptible-exposed-infected-recovered model of Cryptosporidium spread in wild Verreaux's sifakas. We incorporated social and environmental transmission routes and parameterized the model for two different climatic seasons. Second, we used simulated networks and greater variation in epidemiological parameters to investigate the conditions in which dynamic networks produce larger outbreak sizes than static networks. We found that average outbreak size of Cryptosporidium infections in sifakas was larger when the disease was introduced in the dry season than in the wet season, driven by an increase in home range overlap towards the end of the dry season. Regardless of season, dynamic networks always produced larger average outbreak sizes than static networks. Larger outbreaks in dynamic models based on simulated networks occurred especially when the probability of transmission and recovery were low. Variation in tie strength in the dynamic networks also had a major impact on outbreak size, while network modularity had a weaker influence than epidemiological parameters that determine transmission and recovery. Our study adds to emerging evidence that dynamic networks can change predictions of disease dynamics, especially if the disease shows low transmissibility and a long infectious period, and when environmental conditions lead to enhanced between-group contact after an infectious agent has been introduced. © 2016 The Authors. Journal of Animal Ecology published by John Wiley & Sons Ltd on behalf of British Ecological Society.

Report on DOE support for GSC13 travel award

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

Gilbert, Jack Anthony

2012-04-18

Consortium. The 3-day conference was held at the Kingkey Palace Hotel, Shenzhen, China, on March 5-7th, 2012, and was hosted by the Beijing Genomics Institute (BGI). The meeting was entitled ‘From Genomes to Interactions to Communities to Models’ and aimed to be a scientific meeting that highlighted the role of data standards associated with genomic, metagenomic and amplicon sequence data, and the contextual information associated with the sample that data was generated from. To this end the meeting focused on genomic projects for animals, plants, fungi and viruses, metagenomic studies in host-microbe interactions, and community dynamics in microbial communities. Inmore » addition the meeting hosted a Genomic Observatories Network session, a GSC biodiversity working group session, and a Microbiology of the Built Environment session sponsored by the Alfred P. Sloan Foundation. The meeting was very well organized by the local hosts at BGI, and all attendees reported that they were very happy with the outcome, service and quality of the science presented. Highlights were keynotes by Rita Colwell, Mitch Sogin and Jim Tiedje. The 5 attendees paid for by the DOE award were Daniel Smith and Jared Wilkening (University of Chicago); Patrick Chain (Los Alamos National Laboratory), Austin Davis-Richardson (University of Florida) and Greg Caporoaso (University of Northern Arizona). Each attendee was able to either present or become involved with the attending scientists, and each reported that they had got something significant out of the meeting. Here are detailed their personal accounts of the GSC13 meeting. We thank DOE for the helping to fund this valuable outreach initiative, and for supporting the attendance of these bright young scientists at this important meeting.« less

78 FR 33428 - National Institute of Allergy and Infectious Diseases; Notice of Closed Meetings

Federal Register 2010, 2011, 2012, 2013, 2014

2013-06-04

... Infectious Diseases Special Emphasis Panel; ``Clinical Trials Units for NIAID Networks'' (Meeting 3). Date... Institute of Allergy and Infectious Diseases Special Emphasis Panel; Clinical Trials Units for NIAID... Diseases Special Emphasis Panel; Clinical Trials Units for NIAID Networks. Date: June 28, 2013. Time: 10:00...

We'll Meet Again: Revealing Distributional and Temporal Patterns of Social Contact

PubMed Central

Pachur, Thorsten; Schooler, Lael J.; Stevens, Jeffrey R.

2014-01-01

What are the dynamics and regularities underlying social contact, and how can contact with the people in one's social network be predicted? In order to characterize distributional and temporal patterns underlying contact probability, we asked 40 participants to keep a diary of their social contacts for 100 consecutive days. Using a memory framework previously used to study environmental regularities, we predicted that the probability of future contact would follow in systematic ways from the frequency, recency, and spacing of previous contact. The distribution of contact probability across the members of a person's social network was highly skewed, following an exponential function. As predicted, it emerged that future contact scaled linearly with frequency of past contact, proportionally to a power function with recency of past contact, and differentially according to the spacing of past contact. These relations emerged across different contact media and irrespective of whether the participant initiated or received contact. We discuss how the identification of these regularities might inspire more realistic analyses of behavior in social networks (e.g., attitude formation, cooperation). PMID:24475073

Research on dynamic routing mechanisms in wireless sensor networks.

PubMed

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.

Networking: the view from HEP

NASA Astrophysics Data System (ADS)

McKee, Shawn

2017-10-01

Networks have played a critical role in high-energy physics (HEP), enabling us to access and effectively utilize globally distributed resources to meet the needs of our physicists. National and global-scale collaborations that characterize HEP would not be feasible without ubiquitous capable networks. Because of their importance in enabling our grid computing infrastructure many physicists have taken leading roles in research and education (R&E) networking, participating in, and even convening, network related meetings and research programs with the broader networking community worldwide. This has led to HEP benefiting from excellent global networking capabilities for little to no direct cost. However, as other science domains ramp-up their need for similar networking it becomes less clear that this situation will continue unchanged. This paper will briefly discuss the history of networking in HEP, the current activities and challenges we are facing, and try to provide some understanding of where networking may be going in the next 5 to 10 years.

An approximate dynamic programming approach to resource management in multi-cloud scenarios

NASA Astrophysics Data System (ADS)

Pietrabissa, Antonio; Priscoli, Francesco Delli; Di Giorgio, Alessandro; Giuseppi, Alessandro; Panfili, Martina; Suraci, Vincenzo

2017-03-01

The programmability and the virtualisation of network resources are crucial to deploy scalable Information and Communications Technology (ICT) services. The increasing demand of cloud services, mainly devoted to the storage and computing, requires a new functional element, the Cloud Management Broker (CMB), aimed at managing multiple cloud resources to meet the customers' requirements and, simultaneously, to optimise their usage. This paper proposes a multi-cloud resource allocation algorithm that manages the resource requests with the aim of maximising the CMB revenue over time. The algorithm is based on Markov decision process modelling and relies on reinforcement learning techniques to find online an approximate solution.

Proteome complexity and the forces that drive proteome imbalance

PubMed Central

Harper, J. Wade; Bennett, Eric J.

2016-01-01

Summary The cellular proteome is a complex microcosm of structural and regulatory networks that requires continuous surveillance and modification to meet the dynamic needs of the cell. It is therefore crucial that the protein flux of the cell remains in balance to ensure proper cell function. Genetic alterations that range from chromosome imbalance to oncogene activation can affect the speed, fidelity and capacity of protein biogenesis and degradation systems, which often results in proteome imbalance. An improved understanding of the causes and consequences of proteome imbalance is helping to reveal how these systems can be targeted to treat diseases such as cancer. PMID:27629639

Reconstruction of network topology using status-time-series data

NASA Astrophysics Data System (ADS)

Pandey, Pradumn Kumar; Badarla, Venkataramana

2018-01-01

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

Verifying the secure setup of Unix client/servers and detection of network intrusion

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

Feingold, R.; Bruestle, H.R.; Bartoletti, T.

1995-07-01

This paper describes our technical approach to developing and delivering Unix host- and network-based security products to meet the increasing challenges in information security. Today`s global ``Infosphere`` presents us with a networked environment that knows no geographical, national, or temporal boundaries, and no ownership, laws, or identity cards. This seamless aggregation of computers, networks, databases, applications, and the like store, transmit, and process information. This information is now recognized as an asset to governments, corporations, and individuals alike. This information must be protected from misuse. The Security Profile Inspector (SPI) performs static analyses of Unix-based clients and servers to checkmore » on their security configuration. SPI`s broad range of security tests and flexible usage options support the needs of novice and expert system administrators alike. SPI`s use within the Department of Energy and Department of Defense has resulted in more secure systems, less vulnerable to hostile intentions. Host-based information protection techniques and tools must also be supported by network-based capabilities. Our experience shows that a weak link in a network of clients and servers presents itself sooner or later, and can be more readily identified by dynamic intrusion detection techniques and tools. The Network Intrusion Detector (NID) is one such tool. NID is designed to monitor and analyze activity on an Ethernet broadcast Local Area Network segment and produce transcripts of suspicious user connections. NID`s retrospective and real-time modes have proven invaluable to security officers faced with ongoing attacks to their systems and networks.« less

Dynamic tubulation of mitochondria drives mitochondrial network formation.

PubMed

Wang, Chong; Du, Wanqing; Su, Qian Peter; Zhu, Mingli; Feng, Peiyuan; Li, Ying; Zhou, Yichen; Mi, Na; Zhu, Yueyao; Jiang, Dong; Zhang, Senyan; Zhang, Zerui; Sun, Yujie; Yu, Li

2015-10-01

Mitochondria form networks. Formation of mitochondrial networks is important for maintaining mitochondrial DNA integrity and interchanging mitochondrial material, whereas disruption of the mitochondrial network affects mitochondrial functions. According to the current view, mitochondrial networks are formed by fusion of individual mitochondria. Here, we report a new mechanism for formation of mitochondrial networks through KIF5B-mediated dynamic tubulation of mitochondria. We found that KIF5B pulls thin, highly dynamic tubules out of mitochondria. Fusion of these dynamic tubules, which is mediated by mitofusins, gives rise to the mitochondrial network. We further demonstrated that dynamic tubulation and fusion is sufficient for mitochondrial network formation, by reconstituting mitochondrial networks in vitro using purified fusion-competent mitochondria, recombinant KIF5B, and polymerized microtubules. Interestingly, KIF5B only controls network formation in the peripheral zone of the cell, indicating that the mitochondrial network is divided into subzones, which may be constructed by different mechanisms. Our data not only uncover an essential mechanism for mitochondrial network formation, but also reveal that different parts of the mitochondrial network are formed by different mechanisms.

Graph fibrations and symmetries of network dynamics

NASA Astrophysics Data System (ADS)

Nijholt, Eddie; Rink, Bob; Sanders, Jan

2016-11-01

Dynamical systems with a network structure can display remarkable phenomena such as synchronisation and anomalous synchrony breaking. A methodology for classifying patterns of synchrony in networks was developed by Golubitsky and Stewart. They showed that the robustly synchronous dynamics of a network is determined by its quotient networks. This result was recently reformulated by DeVille and Lerman, who pointed out that the reduction from a network to a quotient is an example of a graph fibration. The current paper exploits this observation and demonstrates the importance of self-fibrations of network graphs. Self-fibrations give rise to symmetries in the dynamics of a network. We show that every network admits a lift with a semigroup or semigroupoid of self-fibrations. The resulting symmetries impact the global dynamics of the network and can therefore be used to explain and predict generic scenarios for synchrony breaking. Also, when the network has a trivial symmetry groupoid, then every robust synchrony in the lift is determined by symmetry. We finish this paper with a discussion of networks with interior symmetries and nonhomogeneous networks.

Asynchronous networks: modularization of dynamics theorem

NASA Astrophysics Data System (ADS)

Bick, Christian; Field, Michael

2017-02-01

Building on the first part of this paper, we develop the theory of functional asynchronous networks. We show that a large class of functional asynchronous networks can be (uniquely) represented as feedforward networks connecting events or dynamical modules. For these networks we can give a complete description of the network function in terms of the function of the events comprising the network: the modularization of dynamics theorem. We give examples to illustrate the main results.

A Distributed Dynamic Programming-Based Solution for Load Management in Smart Grids

NASA Astrophysics Data System (ADS)

Zhang, Wei; Xu, Yinliang; Li, Sisi; Zhou, MengChu; Liu, Wenxin; Xu, Ying

2018-03-01

Load management is being recognized as an important option for active user participation in the energy market. Traditional load management methods usually require a centralized powerful control center and a two-way communication network between the system operators and energy end-users. The increasing user participation in smart grids may limit their applications. In this paper, a distributed solution for load management in emerging smart grids is proposed. The load management problem is formulated as a constrained optimization problem aiming at maximizing the overall utility of users while meeting the requirement for load reduction requested by the system operator, and is solved by using a distributed dynamic programming algorithm. The algorithm is implemented via a distributed framework and thus can deliver a highly desired distributed solution. It avoids the required use of a centralized coordinator or control center, and can achieve satisfactory outcomes for load management. Simulation results with various test systems demonstrate its effectiveness.

A Chemical Engineer's Perspective on Health and Disease

PubMed Central

Androulakis, Ioannis P.

2014-01-01

Chemical process systems engineering considers complex supply chains which are coupled networks of dynamically interacting systems. The quest to optimize the supply chain while meeting robustness and flexibility constraints in the face of ever changing environments necessitated the development of theoretical and computational tools for the analysis, synthesis and design of such complex engineered architectures. However, it was realized early on that optimality is a complex characteristic required to achieve proper balance between multiple, often competing, objectives. As we begin to unravel life's intricate complexities, we realize that that living systems share similar structural and dynamic characteristics; hence much can be learned about biological complexity from engineered systems. In this article, we draw analogies between concepts in process systems engineering and conceptual models of health and disease; establish connections between these concepts and physiologic modeling; and describe how these mirror onto the physiological counterparts of engineered systems. PMID:25506103

Engineering Inertial and Primary-Frequency Response for Distributed Energy Resources: Preprint

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

Dall-Anese, Emiliano; Zhao, Changhong; Guggilam, Swaroop

We propose a framework to engineer synthetic-inertia and droop-control parameters for distributed energy resources (DERs) so that the system frequency in a network composed of DERs and synchronous generators conforms to prescribed transient and steady-state performance specifications. Our approach is grounded in a second-order lumped-parameter model that captures the dynamics of synchronous generators and frequency-responsive DERs endowed with inertial and droop control. A key feature of this reduced-order model is that its parameters can be related to those of the originating higher-order dynamical model. This allows one to systematically design the DER inertial and droop-control coefficients leveraging classical frequency-domain responsemore » characteristics of second-order systems. Time-domain simulations validate the accuracy of the model-reduction method and demonstrate how DER controllers can be designed to meet steady-state-regulation and transient-performance specifications.« less

Engineering Inertial and Primary-Frequency Response for Distributed Energy Resources

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

Dall-Anese, Emiliano; Zhao, Changhong; Guggilam, Swaroop

We propose a framework to engineer synthetic-inertia and droop-control parameters for distributed energy resources (DERs) so that the system frequency in a network composed of DERs and synchronous generators conforms to prescribed transient and steady-state performance specifications. Our approach is grounded in a second-order lumped-parameter model that captures the dynamics of synchronous generators and frequency-responsive DERs endowed with inertial and droop control. A key feature of this reduced-order model is that its parameters can be related to those of the originating higherorder dynamical model. This allows one to systematically design the DER inertial and droop-control coefficients leveraging classical frequency-domain responsemore » characteristics of second-order systems. Time-domain simulations validate the accuracy of the model-reduction method and demonstrate how DER controllers can be designed to meet steady-state-regulation and transient-performance specifications.« less

Seismic anisotropy and slab dynamics from SKS splitting recorded in Colombia

NASA Astrophysics Data System (ADS)

Porritt, Robert W.; Becker, Thorsten W.; Monsalve, Gaspar

2014-12-01

The Nazca, Caribbean, and South America plates meet in northwestern South America where the northern end of the Andean volcanic arc and Wadati-Benioff zone seismicity indicate ongoing subduction. However, the termination of Quaternary volcanism at ~5.5°N and eastward offset in seismicity underneath Colombia suggest the presence of complex slab geometry. To help link geometry to dynamics, we analyze SKS splitting for 38 broadband stations of the Colombian national network. Measurements of fast polarization axes in western Colombia close to the trench show dominantly trench-perpendicular orientations. Orientations measured at stations in the back arc, farther to the east, however, abruptly change to roughly trench parallel anisotropy. This may indicate along-arc mantle flow, possibly related to the suggested "Caldas" slab tear, or a lithospheric signature, but smaller-scale variations in anisotropy remain to be explained. Our observations are atypical globally and challenge our understanding of the complexities of subduction zone seismic anisotropy.

Dynamic reconfiguration of frontal brain networks during executive cognition in humans

PubMed Central

Braun, Urs; Schäfer, Axel; Walter, Henrik; Erk, Susanne; Romanczuk-Seiferth, Nina; Haddad, Leila; Schweiger, Janina I.; Grimm, Oliver; Heinz, Andreas; Tost, Heike; Meyer-Lindenberg, Andreas; Bassett, Danielle S.

2015-01-01

The brain is an inherently dynamic system, and executive cognition requires dynamically reconfiguring, highly evolving networks of brain regions that interact in complex and transient communication patterns. However, a precise characterization of these reconfiguration processes during cognitive function in humans remains elusive. Here, we use a series of techniques developed in the field of “dynamic network neuroscience” to investigate the dynamics of functional brain networks in 344 healthy subjects during a working-memory challenge (the “n-back” task). In contrast to a control condition, in which dynamic changes in cortical networks were spread evenly across systems, the effortful working-memory condition was characterized by a reconfiguration of frontoparietal and frontotemporal networks. This reconfiguration, which characterizes “network flexibility,” employs transient and heterogeneous connectivity between frontal systems, which we refer to as “integration.” Frontal integration predicted neuropsychological measures requiring working memory and executive cognition, suggesting that dynamic network reconfiguration between frontal systems supports those functions. Our results characterize dynamic reconfiguration of large-scale distributed neural circuits during executive cognition in humans and have implications for understanding impaired cognitive function in disorders affecting connectivity, such as schizophrenia or dementia. PMID:26324898

NASA Satellite Laser Ranging Network

NASA Technical Reports Server (NTRS)

Carter, David L.

2004-01-01

I will be participating in the International Workshop on Laser Ranging. I will be presenting to the International Laser Ranging Service (ILRS) general body meeting on the recent accomplishments and status of the NASA Satellite Laser Ranging (SLR) Network. The recent accomplishments and NASA's future plans will be outlined and the benefits to the scientific community will be addressed. I am member of the ILRS governing board, the Missions working group, and the Networks & Engineering working group. I am the chairman of the Missions Working and will be hosting a meeting during the week of the workshop. I will also represent the NASA SLR program at the ILRS governing board and other working group meetings.

Modeling Reservoir-River Networks in Support of Optimizing Seasonal-Scale Reservoir Operations

NASA Astrophysics Data System (ADS)

Villa, D. L.; Lowry, T. S.; Bier, A.; Barco, J.; Sun, A.

2011-12-01

HydroSCOPE (Hydropower Seasonal Concurrent Optimization of Power and the Environment) is a seasonal time-scale tool for scenario analysis and optimization of reservoir-river networks. Developed in MATLAB, HydroSCOPE is an object-oriented model that simulates basin-scale dynamics with an objective of optimizing reservoir operations to maximize revenue from power generation, reliability in the water supply, environmental performance, and flood control. HydroSCOPE is part of a larger toolset that is being developed through a Department of Energy multi-laboratory project. This project's goal is to provide conventional hydropower decision makers with better information to execute their day-ahead and seasonal operations and planning activities by integrating water balance and operational dynamics across a wide range of spatial and temporal scales. This presentation details the modeling approach and functionality of HydroSCOPE. HydroSCOPE consists of a river-reservoir network model and an optimization routine. The river-reservoir network model simulates the heat and water balance of river-reservoir networks for time-scales up to one year. The optimization routine software, DAKOTA (Design Analysis Kit for Optimization and Terascale Applications - dakota.sandia.gov), is seamlessly linked to the network model and is used to optimize daily volumetric releases from the reservoirs to best meet a set of user-defined constraints, such as maximizing revenue while minimizing environmental violations. The network model uses 1-D approximations for both the reservoirs and river reaches and is able to account for surface and sediment heat exchange as well as ice dynamics for both models. The reservoir model also accounts for inflow, density, and withdrawal zone mixing, and diffusive heat exchange. Routing for the river reaches is accomplished using a modified Muskingum-Cunge approach that automatically calculates the internal timestep and sub-reach lengths to match the conditions of each timestep and minimize computational overhead. Power generation for each reservoir is estimated using a 2-dimensional regression that accounts for both the available head and turbine efficiency. The object-oriented architecture makes run configuration easy to update. The dynamic model inputs include inflow and meteorological forecasts while static inputs include bathymetry data, reservoir and power generation characteristics, and topological descriptors. Ensemble forecasts of hydrological and meteorological conditions are supplied in real-time by Pacific Northwest National Laboratory and are used as a proxy for uncertainty, which is carried through the simulation and optimization process to produce output that describes the probability that different operational scenario's will be optimal. The full toolset, which includes HydroSCOPE, is currently being tested on the Feather River system in Northern California and the Upper Colorado Storage Project.

Self-organization of complex networks as a dynamical system

NASA Astrophysics Data System (ADS)

Aoki, Takaaki; Yawata, Koichiro; Aoyagi, Toshio

2015-01-01

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

Dynamic information routing in complex networks

PubMed Central

Kirst, Christoph; Timme, Marc; Battaglia, Demian

2016-01-01

Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this mechanism specifically for oscillatory dynamics and analyse how individual unit properties, the network topology and external inputs co-act to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine nonlocal network-wide communication. These results help understanding and designing information routing patterns across systems where collective dynamics co-occurs with a communication function. PMID:27067257

Self-organization of complex networks as a dynamical system.

PubMed

Aoki, Takaaki; Yawata, Koichiro; Aoyagi, Toshio

2015-01-01

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

Dynamics of Intersubject Brain Networks during Anxious Anticipation

PubMed Central

Najafi, Mahshid; Kinnison, Joshua; Pessoa, Luiz

2017-01-01

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

Minimal Increase Network Coding for Dynamic Networks.

PubMed

Zhang, Guoyin; Fan, Xu; Wu, Yanxia

2016-01-01

Because of the mobility, computing power and changeable topology of dynamic networks, it is difficult for random linear network coding (RLNC) in static networks to satisfy the requirements of dynamic networks. To alleviate this problem, a minimal increase network coding (MINC) algorithm is proposed. By identifying the nonzero elements of an encoding vector, it selects blocks to be encoded on the basis of relationship between the nonzero elements that the controls changes in the degrees of the blocks; then, the encoding time is shortened in a dynamic network. The results of simulations show that, compared with existing encoding algorithms, the MINC algorithm provides reduced computational complexity of encoding and an increased probability of delivery.

Minimal Increase Network Coding for Dynamic Networks

PubMed Central

Wu, Yanxia

2016-01-01

Because of the mobility, computing power and changeable topology of dynamic networks, it is difficult for random linear network coding (RLNC) in static networks to satisfy the requirements of dynamic networks. To alleviate this problem, a minimal increase network coding (MINC) algorithm is proposed. By identifying the nonzero elements of an encoding vector, it selects blocks to be encoded on the basis of relationship between the nonzero elements that the controls changes in the degrees of the blocks; then, the encoding time is shortened in a dynamic network. The results of simulations show that, compared with existing encoding algorithms, the MINC algorithm provides reduced computational complexity of encoding and an increased probability of delivery. PMID:26867211

Major component analysis of dynamic networks of physiologic organ interactions

NASA Astrophysics Data System (ADS)

Liu, Kang K. L.; Bartsch, Ronny P.; Ma, Qianli D. Y.; Ivanov, Plamen Ch

2015-09-01

The human organism is a complex network of interconnected organ systems, where the behavior of one system affects the dynamics of other systems. Identifying and quantifying dynamical networks of diverse physiologic systems under varied conditions is a challenge due to the complexity in the output dynamics of the individual systems and the transient and nonlinear characteristics of their coupling. We introduce a novel computational method based on the concept of time delay stability and major component analysis to investigate how organ systems interact as a network to coordinate their functions. We analyze a large database of continuously recorded multi-channel physiologic signals from healthy young subjects during night-time sleep. We identify a network of dynamic interactions between key physiologic systems in the human organism. Further, we find that each physiologic state is characterized by a distinct network structure with different relative contribution from individual organ systems to the global network dynamics. Specifically, we observe a gradual decrease in the strength of coupling of heart and respiration to the rest of the network with transition from wake to deep sleep, and in contrast, an increased relative contribution to network dynamics from chin and leg muscle tone and eye movement, demonstrating a robust association between network topology and physiologic function.

Network Flows

DTIC Science & Technology

1988-12-01

production or service activity over time. In these instances it is often convenient to formulate a network flow problem on a "space—time network" with several...planning model in production planning, the economic lot size problem, is an important example. In this problem context, we wish to meet prescribed...demands d^ for a product in each of the T time periods. In each period, we can produce at level Xj and /or we can meet the demand by drav^g upon inventory I

Modeling Endoplasmic Reticulum Network Maintenance in a Plant Cell.

PubMed

Lin, Congping; White, Rhiannon R; Sparkes, Imogen; Ashwin, Peter

2017-07-11

The endoplasmic reticulum (ER) in plant cells forms a highly dynamic network of complex geometry. ER network morphology and dynamics are influenced by a number of biophysical processes, including filament/tubule tension, viscous forces, Brownian diffusion, and interactions with many other organelles and cytoskeletal elements. Previous studies have indicated that ER networks can be thought of as constrained minimal-length networks acted on by a variety of forces that perturb and/or remodel the network. Here, we study two specific biophysical processes involved in remodeling. One is the dynamic relaxation process involving a combination of tubule tension and viscous forces. The other is the rapid creation of cross-connection tubules by direct or indirect interactions with cytoskeletal elements. These processes are able to remodel the ER network: the first reduces network length and complexity whereas the second increases both. Using live cell imaging of ER network dynamics in tobacco leaf epidermal cells, we examine these processes on ER network dynamics. Away from regions of cytoplasmic streaming, we suggest that the dynamic network structure is a balance between the two processes, and we build an integrative model of the two processes for network remodeling. This model produces quantitatively similar ER networks to those observed in experiments. We use the model to explore the effect of parameter variation on statistical properties of the ER network. Copyright © 2017 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Resilience and Controllability of Dynamic Collective Behaviors

PubMed Central

Komareji, Mohammad; Bouffanais, Roland

2013-01-01

The network paradigm is used to gain insight into the structural root causes of the resilience of consensus in dynamic collective behaviors, and to analyze the controllability of the swarm dynamics. Here we devise the dynamic signaling network which is the information transfer channel underpinning the swarm dynamics of the directed interagent connectivity based on a topological neighborhood of interactions. The study of the connectedness of the swarm signaling network reveals the profound relationship between group size and number of interacting neighbors, which is found to be in good agreement with field observations on flock of starlings [Ballerini et al. (2008) Proc. Natl. Acad. Sci. USA, 105: 1232]. Using a dynamical model, we generate dynamic collective behaviors enabling us to uncover that the swarm signaling network is a homogeneous clustered small-world network, thus facilitating emergent outcomes if connectedness is maintained. Resilience of the emergent consensus is tested by introducing exogenous environmental noise, which ultimately stresses how deeply intertwined are the swarm dynamics in the physical and network spaces. The availability of the signaling network allows us to analytically establish for the first time the number of driver agents necessary to fully control the swarm dynamics. PMID:24358209

On the number of different dynamics in Boolean networks with deterministic update schedules.

PubMed

Aracena, J; Demongeot, J; Fanchon, E; Montalva, M

2013-04-01

Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction diagraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. Copyright © 2013 Elsevier Inc. All rights reserved.

78 FR 7464 - Large Scale Networking (LSN)-Middleware And Grid Interagency Coordination (MAGIC) Team

Federal Register 2010, 2011, 2012, 2013, 2014

2013-02-01

... Coordination (MAGIC) Team AGENCY: The Networking and Information Technology Research and Development (NITRD... (703) 292-4873. Date/Location: The MAGIC Team meetings are held on the first Wednesday of each month, 2... basis. WebEx participation is available for each meeting. Please reference the MAGIC Team Web site for...

Entropy of dynamical social networks

NASA Astrophysics Data System (ADS)

Zhao, Kun; Karsai, Marton; Bianconi, Ginestra

2012-02-01

Dynamical social networks are evolving rapidly and are highly adaptive. Characterizing the information encoded in social networks is essential to gain insight into the structure, evolution, adaptability and dynamics. Recently entropy measures have been used to quantify the information in email correspondence, static networks and mobility patterns. Nevertheless, we still lack methods to quantify the information encoded in time-varying dynamical social networks. In this talk we present a model to quantify the entropy of dynamical social networks and use this model to analyze the data of phone-call communication. We show evidence that the entropy of the phone-call interaction network changes according to circadian rhythms. Moreover we show that social networks are extremely adaptive and are modified by the use of technologies such as mobile phone communication. Indeed the statistics of duration of phone-call is described by a Weibull distribution and is significantly different from the distribution of duration of face-to-face interactions in a conference. Finally we investigate how much the entropy of dynamical social networks changes in realistic models of phone-call or face-to face interactions characterizing in this way different type human social behavior.

Heteronormativity and Sexual Partnering Among Bisexual Latino Men

PubMed Central

Garcia, Jonathan; Wilson, Patrick A.; Parker, Richard G.; Severson, Nicolette

2015-01-01

Our analyses address the question of how bisexual Latino men organize their sexual partnerships. Heteronormativity can be understood as the set of social norms and normative structures that guide sexual partnering among men and women. We provide descriptive statistics to describe bisexual Latino men’s sexual partnerships. Logistic and linear regression modeling were used to explore bivariate and multivariate relationships. Of our total sample (N = 142), 41.6% had unprotected vaginal intercourse 2 months prior to the interview; 21.8 % had unprotected anal intercourse with female partners; 37.5 % had unprotected insertive anal intercourse with male partners; and 22.5 % had unprotected receptive anal intercourse with male partners. In our multivariate model, machismo was directly associated with meeting female partners through formal spaces (workplace, school, and/or church), but inversely associated with meeting male partners in formal spaces. Machismo was positively associated with meeting male sex partners through social networks (i.e., friendship and kinship networks). The more comfortable men were with homosexuality the less likely they were to meet men online and the more likely they were to meet men through social networks of friends and kinship. Interventions to reduce sexually transmitted diseases that target bisexual behavior as an epidemiological “bridge” of transmission from homosexual to heterosexual networks might very well benefit from a more complex understanding of how Latino bisexuality is patterned. Thus, this exploratory analysis might lead to a rethinking of how to address risk and vulnerability among Latino bisexual men and their sexual networks. PMID:25128415

Heteronormativity and sexual partnering among bisexual Latino men.

PubMed

Muñoz-Laboy, Miguel; Garcia, Jonathan; Wilson, Patrick A; Parker, Richard G; Severson, Nicolette

2015-05-01

Our analyses address the question of how bisexual Latino men organize their sexual partnerships. Heteronormativity can be understood as the set of social norms and normative structures that guide sexual partnering among men and women. We provide descriptive statistics to describe bisexual Latino men's sexual partnerships. Logistic and linear regression modeling were used to explore bivariate and multivariate relationships. Of our total sample (N = 142), 41.6 % had unprotected vaginal intercourse 2 months prior to the interview; 21.8 % had unprotected anal intercourse with female partners; 37.5 % had unprotected insertive anal intercourse with male partners; and 22.5 % had unprotected receptive anal intercourse with male partners. In our multivariate model, machismo was directly associated with meeting female partners through formal spaces (workplace, school, and/or church), but inversely associated with meeting male partners in formal spaces. Machismo was positively associated with meeting male sex partners through social networks (i.e., friendship and kinship networks). The more comfortable men were with homosexuality the less likely they were to meet men online and the more likely they were to meet men through social networks of friends and kinship. Interventions to reduce sexually transmitted diseases that target bisexual behavior as an epidemiological "bridge" of transmission from homosexual to heterosexual networks might very well benefit from a more complex understanding of how Latino bisexuality is patterned. Thus, this exploratory analysis might lead to a rethinking of how to address risk and vulnerability among Latino bisexual men and their sexual networks.

The effects of computer-based mindfulness training on Self-control and Mindfulness within Ambulatorily assessed network Systems across Health-related domains in a healthy student population (SMASH): study protocol for a randomized controlled trial.

PubMed

Rowland, Zarah; Wenzel, Mario; Kubiak, Thomas

2016-12-01

Self-control is an important ability in everyday life, showing associations with health-related outcomes. The aim of the Self-control and Mindfulness within Ambulatorily assessed network Systems across Health-related domains (SMASH) study is twofold: first, the effectiveness of a computer-based mindfulness training will be evaluated in a randomized controlled trial. Second, the SMASH study implements a novel network approach in order to investigate complex temporal interdependencies of self-control networks across several domains. The SMASH study is a two-armed, 6-week, non-blinded randomized controlled trial that combines seven weekly laboratory meetings and 40 days of electronic diary assessments with six prompts per day in a healthy undergraduate student population at the Johannes Gutenberg University Mainz, Germany. Participants will be randomly assigned to (1) receive a computer-based mindfulness intervention or (2) to a wait-list control condition. Primary outcomes are self-reported momentary mindfulness and self-control assessed via electronic diaries. Secondary outcomes are habitual mindfulness and habitual self-control. Further measures include self-reported behaviors in specific self-control domains: emotion regulation, alcohol consumption and eating behaviors. The effects of mindfulness training on primary and secondary outcomes are explored using three-level mixed models. Furthermore, networks will be computed with vector autoregressive mixed models to investigate the dynamics at participant and group level. This study was approved by the local ethics committee (reference code 2015_JGU_psychEK_011) and follows the standards laid down in the Declaration of Helsinki (2013). This randomized controlled trial combines an intensive Ambulatory Assessment of 40 consecutive days and seven laboratory meetings. By implementing a novel network approach, underlying processes of self-control within different health domains will be identified. These results will deepen the understanding of self-control performance and will guide to just-in-time individual interventions for several health-related behaviors. ClinicalTrials.gov, NCT02647801 . Registered on 15 December 2015 (registered retrospectively). .

An Analysis of the Abstracts Presented at the Annual Meetings of the Society for Neuroscience from 2001 to 2006

PubMed Central

Lin, John M.; Bohland, Jason W.; Andrews, Peter; Burns, Gully A. P. C.; Allen, Cara B.; Mitra, Partha P.

2008-01-01

Annual meeting abstracts published by scientific societies often contain rich arrays of information that can be computationally mined and distilled to elucidate the state and dynamics of the subject field. We extracted and processed abstract data from the Society for Neuroscience (SFN) annual meeting abstracts during the period 2001–2006 in order to gain an objective view of contemporary neuroscience. An important first step in the process was the application of data cleaning and disambiguation methods to construct a unified database, since the data were too noisy to be of full utility in the raw form initially available. Using natural language processing, text mining, and other data analysis techniques, we then examined the demographics and structure of the scientific collaboration network, the dynamics of the field over time, major research trends, and the structure of the sources of research funding. Some interesting findings include a high geographical concentration of neuroscience research in the north eastern United States, a surprisingly large transient population (66% of the authors appear in only one out of the six studied years), the central role played by the study of neurodegenerative disorders in the neuroscience community, and an apparent growth of behavioral/systems neuroscience with a corresponding shrinkage of cellular/molecular neuroscience over the six year period. The results from this work will prove useful for scientists, policy makers, and funding agencies seeking to gain a complete and unbiased picture of the community structure and body of knowledge encapsulated by a specific scientific domain. PMID:18446237

Predicting the evolution of complex networks via similarity dynamics

NASA Astrophysics Data System (ADS)

Wu, Tao; Chen, Leiting; Zhong, Linfeng; Xian, Xingping

2017-01-01

Almost all real-world networks are subject to constant evolution, and plenty of them have been investigated empirically to uncover the underlying evolution mechanism. However, the evolution prediction of dynamic networks still remains a challenging problem. The crux of this matter is to estimate the future network links of dynamic networks. This paper studies the evolution prediction of dynamic networks with link prediction paradigm. To estimate the likelihood of the existence of links more accurate, an effective and robust similarity index is presented by exploiting network structure adaptively. Moreover, most of the existing link prediction methods do not make a clear distinction between future links and missing links. In order to predict the future links, the networks are regarded as dynamic systems in this paper, and a similarity updating method, spatial-temporal position drift model, is developed to simulate the evolutionary dynamics of node similarity. Then the updated similarities are used as input information for the future links' likelihood estimation. Extensive experiments on real-world networks suggest that the proposed similarity index performs better than baseline methods and the position drift model performs well for evolution prediction in real-world evolving networks.

Alignment of dynamic networks.

PubMed

Vijayan, V; Critchlow, D; Milenkovic, T

2017-07-15

Network alignment (NA) aims to find a node mapping that conserves similar regions between compared networks. NA is applicable to many fields, including computational biology, where NA can guide the transfer of biological knowledge from well- to poorly-studied species across aligned network regions. Existing NA methods can only align static networks. However, most complex real-world systems evolve over time and should thus be modeled as dynamic networks. We hypothesize that aligning dynamic network representations of evolving systems will produce superior alignments compared to aligning the systems' static network representations, as is currently done. For this purpose, we introduce the first ever dynamic NA method, DynaMAGNA ++. This proof-of-concept dynamic NA method is an extension of a state-of-the-art static NA method, MAGNA++. Even though both MAGNA++ and DynaMAGNA++ optimize edge as well as node conservation across the aligned networks, MAGNA++ conserves static edges and similarity between static node neighborhoods, while DynaMAGNA++ conserves dynamic edges (events) and similarity between evolving node neighborhoods. For this purpose, we introduce the first ever measure of dynamic edge conservation and rely on our recent measure of dynamic node conservation. Importantly, the two dynamic conservation measures can be optimized with any state-of-the-art NA method and not just MAGNA++. We confirm our hypothesis that dynamic NA is superior to static NA, on synthetic and real-world networks, in computational biology and social domains. DynaMAGNA++ is parallelized and has a user-friendly graphical interface. http://nd.edu/∼cone/DynaMAGNA++/ . tmilenko@nd.edu. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

Alignment of dynamic networks

PubMed Central

Vijayan, V.; Critchlow, D.; Milenković, T.

2017-01-01

Abstract Motivation: Network alignment (NA) aims to find a node mapping that conserves similar regions between compared networks. NA is applicable to many fields, including computational biology, where NA can guide the transfer of biological knowledge from well- to poorly-studied species across aligned network regions. Existing NA methods can only align static networks. However, most complex real-world systems evolve over time and should thus be modeled as dynamic networks. We hypothesize that aligning dynamic network representations of evolving systems will produce superior alignments compared to aligning the systems’ static network representations, as is currently done. Results: For this purpose, we introduce the first ever dynamic NA method, DynaMAGNA ++. This proof-of-concept dynamic NA method is an extension of a state-of-the-art static NA method, MAGNA++. Even though both MAGNA++ and DynaMAGNA++ optimize edge as well as node conservation across the aligned networks, MAGNA++ conserves static edges and similarity between static node neighborhoods, while DynaMAGNA++ conserves dynamic edges (events) and similarity between evolving node neighborhoods. For this purpose, we introduce the first ever measure of dynamic edge conservation and rely on our recent measure of dynamic node conservation. Importantly, the two dynamic conservation measures can be optimized with any state-of-the-art NA method and not just MAGNA++. We confirm our hypothesis that dynamic NA is superior to static NA, on synthetic and real-world networks, in computational biology and social domains. DynaMAGNA++ is parallelized and has a user-friendly graphical interface. Availability and implementation: http://nd.edu/∼cone/DynaMAGNA++/. Contact: tmilenko@nd.edu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:28881980

Dynamic range in small-world networks of Hodgkin-Huxley neurons with chemical synapses

NASA Astrophysics Data System (ADS)

Batista, C. A. S.; Viana, R. L.; Lopes, S. R.; Batista, A. M.

2014-09-01

According to Stevens' law the relationship between stimulus and response is a power-law within an interval called the dynamic range. The dynamic range of sensory organs is found to be larger than that of a single neuron, suggesting that the network structure plays a key role in the behavior of both the scaling exponent and the dynamic range of neuron assemblies. In order to verify computationally the relationships between stimulus and response for spiking neurons, we investigate small-world networks of neurons described by the Hodgkin-Huxley equations connected by chemical synapses. We found that the dynamic range increases with the network size, suggesting that the enhancement of the dynamic range observed in sensory organs, with respect to single neurons, is an emergent property of complex network dynamics.

Coevolution of dynamical states and interactions in dynamic networks

NASA Astrophysics Data System (ADS)

Zimmermann, Martín G.; Eguíluz, Víctor M.; San Miguel, Maxi

2004-06-01

We explore the coupled dynamics of the internal states of a set of interacting elements and the network of interactions among them. Interactions are modeled by a spatial game and the network of interaction links evolves adapting to the outcome of the game. As an example, we consider a model of cooperation in which the adaptation is shown to facilitate the formation of a hierarchical interaction network that sustains a highly cooperative stationary state. The resulting network has the characteristics of a small world network when a mechanism of local neighbor selection is introduced in the adaptive network dynamics. The highly connected nodes in the hierarchical structure of the network play a leading role in the stability of the network. Perturbations acting on the state of these special nodes trigger global avalanches leading to complete network reorganization.

Boolean dynamics of genetic regulatory networks inferred from microarray time series data

DOE PAGES

Martin, Shawn; Zhang, Zhaoduo; Martino, Anthony; ...

2007-01-31

Methods available for the inference of genetic regulatory networks strive to produce a single network, usually by optimizing some quantity to fit the experimental observations. In this paper we investigate the possibility that multiple networks can be inferred, all resulting in similar dynamics. This idea is motivated by theoretical work which suggests that biological networks are robust and adaptable to change, and that the overall behavior of a genetic regulatory network might be captured in terms of dynamical basins of attraction. We have developed and implemented a method for inferring genetic regulatory networks for time series microarray data. Our methodmore » first clusters and discretizes the gene expression data using k-means and support vector regression. We then enumerate Boolean activation–inhibition networks to match the discretized data. In conclusion, the dynamics of the Boolean networks are examined. We have tested our method on two immunology microarray datasets: an IL-2-stimulated T cell response dataset and a LPS-stimulated macrophage response dataset. In both cases, we discovered that many networks matched the data, and that most of these networks had similar dynamics.« less

Mean-field equations for neuronal networks with arbitrary degree distributions.

PubMed

Nykamp, Duane Q; Friedman, Daniel; Shaker, Sammy; Shinn, Maxwell; Vella, Michael; Compte, Albert; Roxin, Alex

2017-04-01

The emergent dynamics in networks of recurrently coupled spiking neurons depends on the interplay between single-cell dynamics and network topology. Most theoretical studies on network dynamics have assumed simple topologies, such as connections that are made randomly and independently with a fixed probability (Erdös-Rényi network) (ER) or all-to-all connected networks. However, recent findings from slice experiments suggest that the actual patterns of connectivity between cortical neurons are more structured than in the ER random network. Here we explore how introducing additional higher-order statistical structure into the connectivity can affect the dynamics in neuronal networks. Specifically, we consider networks in which the number of presynaptic and postsynaptic contacts for each neuron, the degrees, are drawn from a joint degree distribution. We derive mean-field equations for a single population of homogeneous neurons and for a network of excitatory and inhibitory neurons, where the neurons can have arbitrary degree distributions. Through analysis of the mean-field equations and simulation of networks of integrate-and-fire neurons, we show that such networks have potentially much richer dynamics than an equivalent ER network. Finally, we relate the degree distributions to so-called cortical motifs.

Mean-field equations for neuronal networks with arbitrary degree distributions

NASA Astrophysics Data System (ADS)

Nykamp, Duane Q.; Friedman, Daniel; Shaker, Sammy; Shinn, Maxwell; Vella, Michael; Compte, Albert; Roxin, Alex

2017-04-01

The emergent dynamics in networks of recurrently coupled spiking neurons depends on the interplay between single-cell dynamics and network topology. Most theoretical studies on network dynamics have assumed simple topologies, such as connections that are made randomly and independently with a fixed probability (Erdös-Rényi network) (ER) or all-to-all connected networks. However, recent findings from slice experiments suggest that the actual patterns of connectivity between cortical neurons are more structured than in the ER random network. Here we explore how introducing additional higher-order statistical structure into the connectivity can affect the dynamics in neuronal networks. Specifically, we consider networks in which the number of presynaptic and postsynaptic contacts for each neuron, the degrees, are drawn from a joint degree distribution. We derive mean-field equations for a single population of homogeneous neurons and for a network of excitatory and inhibitory neurons, where the neurons can have arbitrary degree distributions. Through analysis of the mean-field equations and simulation of networks of integrate-and-fire neurons, we show that such networks have potentially much richer dynamics than an equivalent ER network. Finally, we relate the degree distributions to so-called cortical motifs.

Dynamic Evolution Model Based on Social Network Services

NASA Astrophysics Data System (ADS)

Xiong, Xi; Gou, Zhi-Jian; Zhang, Shi-Bin; Zhao, Wen

2013-11-01

Based on the analysis of evolutionary characteristics of public opinion in social networking services (SNS), in the paper we propose a dynamic evolution model, in which opinions are coupled with topology. This model shows the clustering phenomenon of opinions in dynamic network evolution. The simulation results show that the model can fit the data from a social network site. The dynamic evolution of networks accelerates the opinion, separation and aggregation. The scale and the number of clusters are influenced by confidence limit and rewiring probability. Dynamic changes of the topology reduce the number of isolated nodes, while the increased confidence limit allows nodes to communicate more sufficiently. The two effects make the distribution of opinion more neutral. The dynamic evolution of networks generates central clusters with high connectivity and high betweenness, which make it difficult to control public opinions in SNS.

Tracking Data Certification for the Lunar Reconnaissance Orbiter

NASA Technical Reports Server (NTRS)

Morinelli, Patrick J.; Socoby, Joseph; Hendry, Steve; Campion, Richard

2010-01-01

This paper details the National Aeronautics and Space Administration (NASA) Goddard Space Flight Center (GSFC) Flight Dynamics Facility (FDF) tracking data certification effort of the Lunar Reconnaissance Orbiter (LRO) Space Communications Network (SCN) complement of tracking stations consisting of the NASA White Sands 1 antenna (WS1), and the commercial provider Universal Space Network (USN) antennas at South Point, Hawaii; Dongara Australia; Weilheim, Germany; and Kiruna, Sweden. Certification assessment required the cooperation and coordination of parties not under the control of either the LRO project or ground stations as uplinks on cooperating spacecraft were necessary. The LRO range-tracking requirement of 10m 1 sigma could be satisfactorily demonstrated using any typical spacecraft capable of range tracking. Though typical Low Earth Orbiting (LEO) or Geosynchronous Earth Orbiting (GEO) spacecraft may be adequate for range certification, their measurement dynamics and noise would be unacceptable for proper Doppler certification of 1-3mm/sec 1 sigma. As LRO will orbit the Moon, it was imperative that a suitable target spacecraft be utilized which can closely mimic the expected lunar orbital Doppler dynamics of +/-1.6km/sec and +/-1.5m/sq sec to +/-0.15m/sq sec, is in view of the ground stations, supports coherent S-Band Doppler tracking measurements, and can be modeled by the FDF. In order to meet the LRO metric tracking data specifications, the SCN ground stations employed previously uncertified numerically controlled tracking receivers. Initial certification testing revealed certain characteristics of the units that required resolution before being granted certification.

Calculation method of water injection forward modeling and inversion process in oilfield water injection network

NASA Astrophysics Data System (ADS)

Liu, Long; Liu, Wei

2018-04-01

A forward modeling and inversion algorithm is adopted in order to determine the water injection plan in the oilfield water injection network. The main idea of the algorithm is shown as follows: firstly, the oilfield water injection network is inversely calculated. The pumping station demand flow is calculated. Then, forward modeling calculation is carried out for judging whether all water injection wells meet the requirements of injection allocation or not. If all water injection wells meet the requirements of injection allocation, calculation is stopped, otherwise the demand injection allocation flow rate of certain step size is reduced aiming at water injection wells which do not meet requirements, and next iterative operation is started. It is not necessary to list the algorithm into water injection network system algorithm, which can be realized easily. Iterative method is used, which is suitable for computer programming. Experimental result shows that the algorithm is fast and accurate.

Building Service Delivery Networks: Partnership Evolution Among Children's Behavioral Health Agencies in Response to New Funding.

PubMed

Bunger, Alicia C; Doogan, Nathan J; Cao, Yiwen

2014-12-01

Meeting the complex needs of youth with behavioral health problems requires a coordinated network of community-based agencies. Although fiscal scarcity or retrenchment can limit coordinated services, munificence can stimulate service delivery partnerships as agencies expand programs, hire staff, and spend more time coordinating services. This study examines the 2-year evolution of referral and staff expertise sharing networks in response to substantial new funding for services within a regional network of children's mental health organizations. Quantitative network survey data were collected from directors of 22 nonprofit organizations that receive funding from a county government-based behavioral health service fund. Both referral and staff expertise sharing networks changed over time, but results of a stochastic actor-oriented model of network dynamics suggest the nature of this change varies for these networks. Agencies with higher numbers of referral and staff expertise sharing partners tend to maintain these ties and/or develop new relationships over the 2 years. Agencies tend to refer to agencies they trust, but trust was not associated with staff expertise sharing ties. However, agencies maintain or form staff expertise sharing ties with referral partners, or with organizations that provide similar services. In addition, agencies tend to reciprocate staff expertise sharing, but not referrals. Findings suggest that during periods of resource munificence and service expansion, behavioral health organizations build service delivery partnerships in complex ways that build upon prior collaborative history and coordinate services among similar types of providers. Referral partnerships can pave the way for future information sharing relationships.

Building Service Delivery Networks: Partnership Evolution Among Children’s Behavioral Health Agencies in Response to New Funding

PubMed Central

Bunger, Alicia C.; Doogan, Nathan J.; Cao, Yiwen

2014-01-01

Meeting the complex needs of youth with behavioral health problems requires a coordinated network of community-based agencies. Although fiscal scarcity or retrenchment can limit coordinated services, munificence can stimulate service delivery partnerships as agencies expand programs, hire staff, and spend more time coordinating services. This study examines the 2-year evolution of referral and staff expertise sharing networks in response to substantial new funding for services within a regional network of children’s mental health organizations. Quantitative network survey data were collected from directors of 22 nonprofit organizations that receive funding from a county government-based behavioral health service fund. Both referral and staff expertise sharing networks changed over time, but results of a stochastic actor-oriented model of network dynamics suggest the nature of this change varies for these networks. Agencies with higher numbers of referral and staff expertise sharing partners tend to maintain these ties and/or develop new relationships over the 2 years. Agencies tend to refer to agencies they trust, but trust was not associated with staff expertise sharing ties. However, agencies maintain or form staff expertise sharing ties with referral partners, or with organizations that provide similar services. In addition, agencies tend to reciprocate staff expertise sharing, but not referrals. Findings suggest that during periods of resource munificence and service expansion, behavioral health organizations build service delivery partnerships in complex ways that build upon prior collaborative history and coordinate services among similar types of providers. Referral partnerships can pave the way for future information sharing relationships. PMID:25574359

Diminished neural network dynamics after moderate and severe traumatic brain injury.

PubMed

Gilbert, Nicholas; Bernier, Rachel A; Calhoun, Vincent D; Brenner, Einat; Grossner, Emily; Rajtmajer, Sarah M; Hillary, Frank G

2018-01-01

Over the past decade there has been increasing enthusiasm in the cognitive neurosciences around using network science to understand the system-level changes associated with brain disorders. A growing literature has used whole-brain fMRI analysis to examine changes in the brain's subnetworks following traumatic brain injury (TBI). Much of network modeling in this literature has focused on static network mapping, which provides a window into gross inter-nodal relationships, but is insensitive to more subtle fluctuations in network dynamics, which may be an important predictor of neural network plasticity. In this study, we examine the dynamic connectivity with focus on state-level connectivity (state) and evaluate the reliability of dynamic network states over the course of two runs of intermittent task and resting data. The goal was to examine the dynamic properties of neural networks engaged periodically with task stimulation in order to determine: 1) the reliability of inter-nodal and network-level characteristics over time and 2) the transitions between distinct network states after traumatic brain injury. To do so, we enrolled 23 individuals with moderate and severe TBI at least 1-year post injury and 19 age- and education-matched healthy adults using functional MRI methods, dynamic connectivity modeling, and graph theory. The results reveal several distinct network "states" that were reliably evident when comparing runs; the overall frequency of dynamic network states are highly reproducible (r-values>0.8) for both samples. Analysis of movement between states resulted in fewer state transitions in the TBI sample and, in a few cases, brain injury resulted in the appearance of states not exhibited by the healthy control (HC) sample. Overall, the findings presented here demonstrate the reliability of observable dynamic mental states during periods of on-task performance and support emerging evidence that brain injury may result in diminished network dynamics.

Diminished neural network dynamics after moderate and severe traumatic brain injury

PubMed Central

Gilbert, Nicholas; Bernier, Rachel A.; Calhoun, Vincent D.; Brenner, Einat; Grossner, Emily; Rajtmajer, Sarah M.

2018-01-01

Over the past decade there has been increasing enthusiasm in the cognitive neurosciences around using network science to understand the system-level changes associated with brain disorders. A growing literature has used whole-brain fMRI analysis to examine changes in the brain’s subnetworks following traumatic brain injury (TBI). Much of network modeling in this literature has focused on static network mapping, which provides a window into gross inter-nodal relationships, but is insensitive to more subtle fluctuations in network dynamics, which may be an important predictor of neural network plasticity. In this study, we examine the dynamic connectivity with focus on state-level connectivity (state) and evaluate the reliability of dynamic network states over the course of two runs of intermittent task and resting data. The goal was to examine the dynamic properties of neural networks engaged periodically with task stimulation in order to determine: 1) the reliability of inter-nodal and network-level characteristics over time and 2) the transitions between distinct network states after traumatic brain injury. To do so, we enrolled 23 individuals with moderate and severe TBI at least 1-year post injury and 19 age- and education-matched healthy adults using functional MRI methods, dynamic connectivity modeling, and graph theory. The results reveal several distinct network “states” that were reliably evident when comparing runs; the overall frequency of dynamic network states are highly reproducible (r-values>0.8) for both samples. Analysis of movement between states resulted in fewer state transitions in the TBI sample and, in a few cases, brain injury resulted in the appearance of states not exhibited by the healthy control (HC) sample. Overall, the findings presented here demonstrate the reliability of observable dynamic mental states during periods of on-task performance and support emerging evidence that brain injury may result in diminished network dynamics. PMID:29883447

Qualitative dynamics semantics for SBGN process description.

PubMed

Rougny, Adrien; Froidevaux, Christine; Calzone, Laurence; Paulevé, Loïc

2016-06-16

Qualitative dynamics semantics provide a coarse-grain modeling of networks dynamics by abstracting away kinetic parameters. They allow to capture general features of systems dynamics, such as attractors or reachability properties, for which scalable analyses exist. The Systems Biology Graphical Notation Process Description language (SBGN-PD) has become a standard to represent reaction networks. However, no qualitative dynamics semantics taking into account all the main features available in SBGN-PD had been proposed so far. We propose two qualitative dynamics semantics for SBGN-PD reaction networks, namely the general semantics and the stories semantics, that we formalize using asynchronous automata networks. While the general semantics extends standard Boolean semantics of reaction networks by taking into account all the main features of SBGN-PD, the stories semantics allows to model several molecules of a network by a unique variable. The obtained qualitative models can be checked against dynamical properties and therefore validated with respect to biological knowledge. We apply our framework to reason on the qualitative dynamics of a large network (more than 200 nodes) modeling the regulation of the cell cycle by RB/E2F. The proposed semantics provide a direct formalization of SBGN-PD networks in dynamical qualitative models that can be further analyzed using standard tools for discrete models. The dynamics in stories semantics have a lower dimension than the general one and prune multiple behaviors (which can be considered as spurious) by enforcing the mutual exclusiveness between the activity of different nodes of a same story. Overall, the qualitative semantics for SBGN-PD allow to capture efficiently important dynamical features of reaction network models and can be exploited to further refine them.

Dynamics analysis of SIR epidemic model with correlation coefficients and clustering coefficient in networks.

PubMed

Zhang, Juping; Yang, Chan; Jin, Zhen; Li, Jia

2018-07-14

In this paper, the correlation coefficients between nodes in states are used as dynamic variables, and we construct SIR epidemic dynamic models with correlation coefficients by using the pair approximation method in static networks and dynamic networks, respectively. Considering the clustering coefficient of the network, we analytically investigate the existence and the local asymptotic stability of each equilibrium of these models and derive threshold values for the prevalence of diseases. Additionally, we obtain two equivalent epidemic thresholds in dynamic networks, which are compared with the results of the mean field equations. Copyright © 2018 Elsevier Ltd. All rights reserved.

Incorporating spatial constraint in co-activation pattern analysis to explore the dynamics of resting-state networks: An application to Parkinson's disease.

PubMed

Zhuang, Xiaowei; Walsh, Ryan R; Sreenivasan, Karthik; Yang, Zhengshi; Mishra, Virendra; Cordes, Dietmar

2018-05-15

The dynamics of the brain's intrinsic networks have been recently studied using co-activation pattern (CAP) analysis. The CAP method relies on few model assumptions and CAP-based measurements provide quantitative information of network temporal dynamics. One limitation of existing CAP-related methods is that the computed CAPs share considerable spatial overlap that may or may not be functionally distinct relative to specific network dynamics. To more accurately describe network dynamics with spatially distinct CAPs, and to compare network dynamics between different populations, a novel data-driven CAP group analysis method is proposed in this study. In the proposed method, a dominant-CAP (d-CAP) set is synthesized across CAPs from multiple clustering runs for each group with the constraint of low spatial similarities among d-CAPs. Alternating d-CAPs with less overlapping spatial patterns can better capture overall network dynamics. The number of d-CAPs, the temporal fraction and spatial consistency of each d-CAP, and the subject-specific switching probability among all d-CAPs are then calculated for each group and used to compare network dynamics between groups. The spatial dissimilarities among d-CAPs computed with the proposed method were first demonstrated using simulated data. High consistency between simulated ground-truth and computed d-CAPs was achieved, and detailed comparisons between the proposed method and existing CAP-based methods were conducted using simulated data. In an effort to physiologically validate the proposed technique and investigate network dynamics in a relevant brain network disorder, the proposed method was then applied to data from the Parkinson's Progression Markers Initiative (PPMI) database to compare the network dynamics in Parkinson's disease (PD) and normal control (NC) groups. Fewer d-CAPs, skewed distribution of temporal fractions of d-CAPs, and reduced switching probabilities among final d-CAPs were found in most networks in the PD group, as compared to the NC group. Furthermore, an overall negative association between switching probability among d-CAPs and disease severity was observed in most networks in the PD group as well. These results expand upon previous findings from in vivo electrophysiological recording studies in PD. Importantly, this novel analysis also demonstrates that changes in network dynamics can be measured using resting-state fMRI data from subjects with early stage PD. Copyright © 2018 Elsevier Inc. All rights reserved.

77 FR 58416 - Large Scale Networking (LSN); Middleware and Grid Interagency Coordination (MAGIC) Team

Federal Register 2010, 2011, 2012, 2013, 2014

2012-09-20

... Coordination (MAGIC) Team AGENCY: The Networking and Information Technology Research and Development (NITRD.... Dates/Location: The MAGIC Team meetings are held on the first Wednesday of each month, 2:00-4:00pm, at... participation is available for each meeting. Please reference the MAGIC Team Web site for updates. Magic Web...

78 FR 70076 - Large Scale Networking (LSN)-Middleware and Grid Interagency Coordination (MAGIC) Team

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-22

... Coordination (MAGIC) Team AGENCY: The Networking and Information Technology Research and Development (NITRD... MAGIC Team meetings are held on the first Wednesday of each month, 2:00-4:00 p.m., at the National... for each meeting. Please reference the MAGIC Team Web site for updates. Magic Web site: The agendas...

78 FR 63196 - Sunshine Act Meeting; Open Commission Meeting; Monday, October, 28, 2013

Federal Register 2010, 2011, 2012, 2013, 2014

2013-10-23

...: Implementing HOMELAND SECURITY. Public Safety Broadband Provisions of the Middle Class Tax Relief and Job... Safety Network in the 700 MHz Band (PS Docket No. 06-229); Service Rules for the 698-746, 747-762 and 777... adopting technical rules for the 700 MHz broadband spectrum licensed to the First Responder Network...

SparkMed: a framework for dynamic integration of multimedia medical data into distributed m-Health systems.

PubMed

Constantinescu, Liviu; Kim, Jinman; Feng, David Dagan

2012-01-01

With the advent of 4G and other long-term evolution (LTE) wireless networks, the traditional boundaries of patient record propagation are diminishing as networking technologies extend the reach of hospital infrastructure and provide on-demand mobile access to medical multimedia data. However, due to legacy and proprietary software, storage and decommissioning costs, and the price of centralization and redevelopment, it remains complex, expensive, and often unfeasible for hospitals to deploy their infrastructure for online and mobile use. This paper proposes the SparkMed data integration framework for mobile healthcare (m-Health), which significantly benefits from the enhanced network capabilities of LTE wireless technologies, by enabling a wide range of heterogeneous medical software and database systems (such as the picture archiving and communication systems, hospital information system, and reporting systems) to be dynamically integrated into a cloud-like peer-to-peer multimedia data store. Our framework allows medical data applications to share data with mobile hosts over a wireless network (such as WiFi and 3G), by binding to existing software systems and deploying them as m-Health applications. SparkMed integrates techniques from multimedia streaming, rich Internet applications (RIA), and remote procedure call (RPC) frameworks to construct a Self-managing, Pervasive Automated netwoRK for Medical Enterprise Data (SparkMed). Further, it is resilient to failure, and able to use mobile and handheld devices to maintain its network, even in the absence of dedicated server devices. We have developed a prototype of the SparkMed framework for evaluation on a radiological workflow simulation, which uses SparkMed to deploy a radiological image viewer as an m-Health application for telemedical use by radiologists and stakeholders. We have evaluated our prototype using ten devices over WiFi and 3G, verifying that our framework meets its two main objectives: 1) interactive delivery of medical multimedia data to mobile devices; and 2) attaching to non-networked medical software processes without significantly impacting their performance. Consistent response times of under 500 ms and graphical frame rates of over 5 frames per second were observed under intended usage conditions. Further, overhead measurements displayed linear scalability and low resource requirements.

A general stochastic model for studying time evolution of transition networks

NASA Astrophysics Data System (ADS)

Zhan, Choujun; Tse, Chi K.; Small, Michael

2016-12-01

We consider a class of complex networks whose nodes assume one of several possible states at any time and may change their states from time to time. Such networks represent practical networks of rumor spreading, disease spreading, language evolution, and so on. Here, we derive a model describing the dynamics of this kind of network and a simulation algorithm for studying the network evolutionary behavior. This model, derived at a microscopic level, can reveal the transition dynamics of every node. A numerical simulation is taken as an ;experiment; or ;realization; of the model. We use this model to study the disease propagation dynamics in four different prototypical networks, namely, the regular nearest-neighbor (RN) network, the classical Erdös-Renyí (ER) random graph, the Watts-Strogátz small-world (SW) network, and the Barabási-Albert (BA) scalefree network. We find that the disease propagation dynamics in these four networks generally have different properties but they do share some common features. Furthermore, we utilize the transition network model to predict user growth in the Facebook network. Simulation shows that our model agrees with the historical data. The study can provide a useful tool for a more thorough understanding of the dynamics networks.

Revealing networks from dynamics: an introduction

NASA Astrophysics Data System (ADS)

Timme, Marc; Casadiego, Jose

2014-08-01

What can we learn from the collective dynamics of a complex network about its interaction topology? Taking the perspective from nonlinear dynamics, we briefly review recent progress on how to infer structural connectivity (direct interactions) from accessing the dynamics of the units. Potential applications range from interaction networks in physics, to chemical and metabolic reactions, protein and gene regulatory networks as well as neural circuits in biology and electric power grids or wireless sensor networks in engineering. Moreover, we briefly mention some standard ways of inferring effective or functional connectivity.

Biologically plausible learning in recurrent neural networks reproduces neural dynamics observed during cognitive tasks

PubMed Central

Miconi, Thomas

2017-01-01

Neural activity during cognitive tasks exhibits complex dynamics that flexibly encode task-relevant variables. Chaotic recurrent networks, which spontaneously generate rich dynamics, have been proposed as a model of cortical computation during cognitive tasks. However, existing methods for training these networks are either biologically implausible, and/or require a continuous, real-time error signal to guide learning. Here we show that a biologically plausible learning rule can train such recurrent networks, guided solely by delayed, phasic rewards at the end of each trial. Networks endowed with this learning rule can successfully learn nontrivial tasks requiring flexible (context-dependent) associations, memory maintenance, nonlinear mixed selectivities, and coordination among multiple outputs. The resulting networks replicate complex dynamics previously observed in animal cortex, such as dynamic encoding of task features and selective integration of sensory inputs. We conclude that recurrent neural networks offer a plausible model of cortical dynamics during both learning and performance of flexible behavior. DOI: http://dx.doi.org/10.7554/eLife.20899.001 PMID:28230528

Biologically plausible learning in recurrent neural networks reproduces neural dynamics observed during cognitive tasks.

PubMed

Miconi, Thomas

2017-02-23

Neural activity during cognitive tasks exhibits complex dynamics that flexibly encode task-relevant variables. Chaotic recurrent networks, which spontaneously generate rich dynamics, have been proposed as a model of cortical computation during cognitive tasks. However, existing methods for training these networks are either biologically implausible, and/or require a continuous, real-time error signal to guide learning. Here we show that a biologically plausible learning rule can train such recurrent networks, guided solely by delayed, phasic rewards at the end of each trial. Networks endowed with this learning rule can successfully learn nontrivial tasks requiring flexible (context-dependent) associations, memory maintenance, nonlinear mixed selectivities, and coordination among multiple outputs. The resulting networks replicate complex dynamics previously observed in animal cortex, such as dynamic encoding of task features and selective integration of sensory inputs. We conclude that recurrent neural networks offer a plausible model of cortical dynamics during both learning and performance of flexible behavior.

Complex Dynamical Networks Constructed with Fully Controllable Nonlinear Nanomechanical Oscillators.

PubMed

Fon, Warren; Matheny, Matthew H; Li, Jarvis; Krayzman, Lev; Cross, Michael C; D'Souza, Raissa M; Crutchfield, James P; Roukes, Michael L

2017-10-11

Control of the global parameters of complex networks has been explored experimentally in a variety of contexts. Yet, the more difficult prospect of realizing arbitrary network architectures, especially analog physical networks that provide dynamical control of individual nodes and edges, has remained elusive. Given the vast hierarchy of time scales involved, it also proves challenging to measure a complex network's full internal dynamics. These span from the fastest nodal dynamics to very slow epochs over which emergent global phenomena, including network synchronization and the manifestation of exotic steady states, eventually emerge. Here, we demonstrate an experimental system that satisfies these requirements. It is based upon modular, fully controllable, nonlinear radio frequency nanomechanical oscillators, designed to form the nodes of complex dynamical networks with edges of arbitrary topology. The dynamics of these oscillators and their surrounding network are analog and continuous-valued and can be fully interrogated in real time. They comprise a piezoelectric nanomechanical membrane resonator, which serves as the frequency-determining element within an electrical feedback circuit. This embodiment permits network interconnections entirely within the electrical domain and provides unprecedented node and edge control over a vast region of parameter space. Continuous measurement of the instantaneous amplitudes and phases of every constituent oscillator node are enabled, yielding full and detailed network data without reliance upon statistical quantities. We demonstrate the operation of this platform through the real-time capture of the dynamics of a three-node ring network as it evolves from the uncoupled state to full synchronization.

Sierra Stars Observatory Network: An Accessible Global Network

NASA Astrophysics Data System (ADS)

Williams, Richard; Beshore, Edward

2011-03-01

The Sierra Stars Observatory Network (SSON) is a unique partnership among professional observatories that provides its users with affordable high-quality calibrated image data. SSON comprises observatories in the Northern and Southern Hemisphere and is in the process of expanding to a truly global network capable of covering the entire sky 24 hours a day in the near future. The goal of SSON is to serve the needs of science-based projects and programs. Colleges, universities, institutions, and individuals use SSON for their education and research projects. The mission of SSON is to promote and expand the use of its facilities among the thousands of colleges and schools worldwide that do not have access to professional-quality automated observatory systems to use for astronomy education and research. With appropriate leadership and guidance educators can use SSON to help teach astronomy and do meaningful scientific projects. The relatively small cost of using SSON for this type of work makes it affordable and accessible for educators to start using immediately. Remote observatory services like SSON need to evolve to better support education and research initiatives of colleges, institutions and individual investigators. To meet these needs, SSON is developing a sophisticated interactive scheduling system to integrate among the nodes of the observatory network. This will enable more dynamic observations, including immediate priority interrupts, acquiring moving objects using ephemeris data, and more.

Why do electricity policy and competitive markets fail to use advanced PV systems to improve distribution power quality?

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

McHenry, Mark P.; Johnson, Jay; Hightower, Mike

The increasing pressure for network operators to meet distribution network power quality standards with increasing peak loads, renewable energy targets, and advances in automated distributed power electronics and communications is forcing policy-makers to understand new means to distribute costs and benefits within electricity markets. Discussions surrounding how distributed generation (DG) exhibits active voltage regulation and power factor/reactive power control and other power quality capabilities are complicated by uncertainties of baseline local distribution network power quality and to whom and how costs and benefits of improved electricity infrastructure will be allocated. DG providing ancillary services that dynamically respond to the networkmore » characteristics could lead to major network improvements. With proper market structures renewable energy systems could greatly improve power quality on distribution systems with nearly no additional cost to the grid operators. Renewable DG does have variability challenges, though this issue can be overcome with energy storage, forecasting, and advanced inverter functionality. This paper presents real data from a large-scale grid-connected PV array with large-scale storage and explores effective mitigation measures for PV system variability. As a result, we discuss useful inverter technical knowledge for policy-makers to mitigate ongoing inflation of electricity network tariff components by new DG interconnection requirements or electricity markets which value power quality and control.« less

Why do electricity policy and competitive markets fail to use advanced PV systems to improve distribution power quality?

DOE PAGES

McHenry, Mark P.; Johnson, Jay; Hightower, Mike

2016-01-01

The increasing pressure for network operators to meet distribution network power quality standards with increasing peak loads, renewable energy targets, and advances in automated distributed power electronics and communications is forcing policy-makers to understand new means to distribute costs and benefits within electricity markets. Discussions surrounding how distributed generation (DG) exhibits active voltage regulation and power factor/reactive power control and other power quality capabilities are complicated by uncertainties of baseline local distribution network power quality and to whom and how costs and benefits of improved electricity infrastructure will be allocated. DG providing ancillary services that dynamically respond to the networkmore » characteristics could lead to major network improvements. With proper market structures renewable energy systems could greatly improve power quality on distribution systems with nearly no additional cost to the grid operators. Renewable DG does have variability challenges, though this issue can be overcome with energy storage, forecasting, and advanced inverter functionality. This paper presents real data from a large-scale grid-connected PV array with large-scale storage and explores effective mitigation measures for PV system variability. As a result, we discuss useful inverter technical knowledge for policy-makers to mitigate ongoing inflation of electricity network tariff components by new DG interconnection requirements or electricity markets which value power quality and control.« less

Synthetic biology and regulatory networks: where metabolic systems biology meets control engineering.

PubMed

He, Fei; Murabito, Ettore; Westerhoff, Hans V

2016-04-01

Metabolic pathways can be engineered to maximize the synthesis of various products of interest. With the advent of computational systems biology, this endeavour is usually carried out through in silico theoretical studies with the aim to guide and complement further in vitro and in vivo experimental efforts. Clearly, what counts is the result in vivo, not only in terms of maximal productivity but also robustness against environmental perturbations. Engineering an organism towards an increased production flux, however, often compromises that robustness. In this contribution, we review and investigate how various analytical approaches used in metabolic engineering and synthetic biology are related to concepts developed by systems and control engineering. While trade-offs between production optimality and cellular robustness have already been studied diagnostically and statically, the dynamics also matter. Integration of the dynamic design aspects of control engineering with the more diagnostic aspects of metabolic, hierarchical control and regulation analysis is leading to the new, conceptual and operational framework required for the design of robust and productive dynamic pathways. © 2016 The Author(s).

77 FR 19408 - Dynamic Mobility Applications and Data Capture Management Programs; Notice of Public Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2012-03-30

... DEPARTMENT OF TRANSPORTATION Dynamic Mobility Applications and Data Capture Management Programs...) Intelligent Transportation System Joint Program Office (ITS JPO) will host a free public meeting to provide stakeholders an update on the Data Capture and Management (DCM) and Dynamic Mobility Applications (DMA...

Synthesis of recurrent neural networks for dynamical system simulation.

PubMed

Trischler, Adam P; D'Eleuterio, Gabriele M T

2016-08-01

We review several of the most widely used techniques for training recurrent neural networks to approximate dynamical systems, then describe a novel algorithm for this task. The algorithm is based on an earlier theoretical result that guarantees the quality of the network approximation. We show that a feedforward neural network can be trained on the vector-field representation of a given dynamical system using backpropagation, then recast it as a recurrent network that replicates the original system's dynamics. After detailing this algorithm and its relation to earlier approaches, we present numerical examples that demonstrate its capabilities. One of the distinguishing features of our approach is that both the original dynamical systems and the recurrent networks that simulate them operate in continuous time. Copyright © 2016 Elsevier Ltd. All rights reserved.

LOGISTIC NETWORK REGRESSION FOR SCALABLE ANALYSIS OF NETWORKS WITH JOINT EDGE/VERTEX DYNAMICS

PubMed Central

Almquist, Zack W.; Butts, Carter T.

2015-01-01

Change in group size and composition has long been an important area of research in the social sciences. Similarly, interest in interaction dynamics has a long history in sociology and social psychology. However, the effects of endogenous group change on interaction dynamics are a surprisingly understudied area. One way to explore these relationships is through social network models. Network dynamics may be viewed as a process of change in the edge structure of a network, in the vertex set on which edges are defined, or in both simultaneously. Although early studies of such processes were primarily descriptive, recent work on this topic has increasingly turned to formal statistical models. Although showing great promise, many of these modern dynamic models are computationally intensive and scale very poorly in the size of the network under study and/or the number of time points considered. Likewise, currently used models focus on edge dynamics, with little support for endogenously changing vertex sets. Here, the authors show how an existing approach based on logistic network regression can be extended to serve as a highly scalable framework for modeling large networks with dynamic vertex sets. The authors place this approach within a general dynamic exponential family (exponential-family random graph modeling) context, clarifying the assumptions underlying the framework (and providing a clear path for extensions), and they show how model assessment methods for cross-sectional networks can be extended to the dynamic case. Finally, the authors illustrate this approach on a classic data set involving interactions among windsurfers on a California beach. PMID:26120218

LOGISTIC NETWORK REGRESSION FOR SCALABLE ANALYSIS OF NETWORKS WITH JOINT EDGE/VERTEX DYNAMICS.

PubMed

Almquist, Zack W; Butts, Carter T

2014-08-01

Change in group size and composition has long been an important area of research in the social sciences. Similarly, interest in interaction dynamics has a long history in sociology and social psychology. However, the effects of endogenous group change on interaction dynamics are a surprisingly understudied area. One way to explore these relationships is through social network models. Network dynamics may be viewed as a process of change in the edge structure of a network, in the vertex set on which edges are defined, or in both simultaneously. Although early studies of such processes were primarily descriptive, recent work on this topic has increasingly turned to formal statistical models. Although showing great promise, many of these modern dynamic models are computationally intensive and scale very poorly in the size of the network under study and/or the number of time points considered. Likewise, currently used models focus on edge dynamics, with little support for endogenously changing vertex sets. Here, the authors show how an existing approach based on logistic network regression can be extended to serve as a highly scalable framework for modeling large networks with dynamic vertex sets. The authors place this approach within a general dynamic exponential family (exponential-family random graph modeling) context, clarifying the assumptions underlying the framework (and providing a clear path for extensions), and they show how model assessment methods for cross-sectional networks can be extended to the dynamic case. Finally, the authors illustrate this approach on a classic data set involving interactions among windsurfers on a California beach.

Studies on the population dynamics of a rumor-spreading model in online social networks

NASA Astrophysics Data System (ADS)

Dong, Suyalatu; Fan, Feng-Hua; Huang, Yong-Chang

2018-02-01

This paper sets up a rumor spreading model in online social networks based on the European fox rabies SIR model. The model considers the impact of changing number of online social network users, combines the transmission dynamics to set up a population dynamics of rumor spreading model in online social networks. Simulation is carried out on online social network, and results show that the new rumor spreading model is in accordance with the real propagation characteristics in online social networks.

47 CFR 27.1305 - Shared wireless broadband network.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 2 2010-10-01 2010-10-01 false Shared wireless broadband network. 27.1305... broadband network. The Shared Wireless Broadband Network developed by the 700 MHz Public/Private Partnership must be designed to meet requirements associated with a nationwide, public safety broadband network. At...

47 CFR 90.1405 - Shared wireless broadband network.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 5 2011-10-01 2011-10-01 false Shared wireless broadband network. 90.1405... broadband network. The Shared Wireless Broadband Network developed by the 700 MHz Public/Private Partnership must be designed to meet requirements associated with a nationwide, public safety broadband network. At...

47 CFR 27.1305 - Shared wireless broadband network.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 2 2011-10-01 2011-10-01 false Shared wireless broadband network. 27.1305... broadband network. The Shared Wireless Broadband Network developed by the 700 MHz Public/Private Partnership must be designed to meet requirements associated with a nationwide, public safety broadband network. At...

47 CFR 90.1405 - Shared wireless broadband network.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 5 2010-10-01 2010-10-01 false Shared wireless broadband network. 90.1405... broadband network. The Shared Wireless Broadband Network developed by the 700 MHz Public/Private Partnership must be designed to meet requirements associated with a nationwide, public safety broadband network. At...

47 CFR 27.1305 - Shared wireless broadband network.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 2 2012-10-01 2012-10-01 false Shared wireless broadband network. 27.1305... broadband network. The Shared Wireless Broadband Network developed by the 700 MHz Public/Private Partnership must be designed to meet requirements associated with a nationwide, public safety broadband network. At...

47 CFR 90.1405 - Shared wireless broadband network.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 5 2012-10-01 2012-10-01 false Shared wireless broadband network. 90.1405... broadband network. The Shared Wireless Broadband Network developed by the 700 MHz Public/Private Partnership must be designed to meet requirements associated with a nationwide, public safety broadband network. At...

Temporal node centrality in complex networks

NASA Astrophysics Data System (ADS)

Kim, Hyoungshick; Anderson, Ross

2012-02-01

Many networks are dynamic in that their topology changes rapidly—on the same time scale as the communications of interest between network nodes. Examples are the human contact networks involved in the transmission of disease, ad hoc radio networks between moving vehicles, and the transactions between principals in a market. While we have good models of static networks, so far these have been lacking for the dynamic case. In this paper we present a simple but powerful model, the time-ordered graph, which reduces a dynamic network to a static network with directed flows. This enables us to extend network properties such as vertex degree, closeness, and betweenness centrality metrics in a very natural way to the dynamic case. We then demonstrate how our model applies to a number of interesting edge cases, such as where the network connectivity depends on a small number of highly mobile vertices or edges, and show that our centrality definition allows us to track the evolution of connectivity. Finally we apply our model and techniques to two real-world dynamic graphs of human contact networks and then discuss the implication of temporal centrality metrics in the real world.

Minor positive effects of health-promoting senior meetings for older community-dwelling persons on loneliness, social network, and social support

PubMed Central

Gustafsson, Susanne; Berglund, Helene; Faronbi, Joel; Barenfeld, Emmelie; Ottenvall Hammar, Isabelle

2017-01-01

Objective The aim of this study was to evaluate the 1-year effect of the health-promoting intervention “senior meetings” for older community-dwelling persons regarding loneliness, social network, and social support. Methods Secondary analysis of data was carried out from two randomized controlled studies: Elderly Persons in the Risk Zone and Promoting Aging Migrants’ Capabilities. Data from 416 participants who attended the senior meetings and the control group at baseline and the 1-year follow-up in the respective studies were included. Data were aggregated and analyzed with chi-square test and odds ratio (OR) to determine the intervention effect. Results The senior meetings had a positive effect on social support regarding someone to turn to when in need of advice and backing (OR 1.72, p=0.01). No positive intervention effect could be identified for loneliness, social network, or other aspects of social support. Conclusion Health-promoting senior meetings for older community-dwelling persons have a minor positive effect on social support. The senior meetings might benefit from a revision to reinforce content focused on loneliness, social network, and social support. However, the modest effect could also depend on the lack of accessible social resources to meet participants’ identified needs, a possible hindrance for a person’s capability. This makes it necessary to conduct further research to evaluate the effect of the senior meetings and other health-promoting initiatives on social aspects of older community-dwelling people’s lives, since these aspects are of high importance for life satisfaction and well-being in old age. PMID:29158669

Creative-Dynamics Approach To Neural Intelligence

NASA Technical Reports Server (NTRS)

Zak, Michail A.

1992-01-01

Paper discusses approach to mathematical modeling of artificial neural networks exhibiting complicated behaviors reminiscent of creativity and intelligence of biological neural networks. Neural network treated as non-Lipschitzian dynamical system - as described in "Non-Lipschitzian Dynamics For Modeling Neural Networks" (NPO-17814). System serves as tool for modeling of temporal-pattern memories and recognition of complicated spatial patterns.

Multistability, local pattern formation, and global collective firing in a small-world network of nonleaky integrate-and-fire neurons.

PubMed

Rothkegel, Alexander; Lehnertz, Klaus

2009-03-01

We investigate numerically the collective dynamical behavior of pulse-coupled nonleaky integrate-and-fire neurons that are arranged on a two-dimensional small-world network. To ensure ongoing activity, we impose a probability for spontaneous firing for each neuron. We study network dynamics evolving from different sets of initial conditions in dependence on coupling strength and rewiring probability. Besides a homogeneous equilibrium state for low coupling strength, we observe different local patterns including cyclic waves, spiral waves, and turbulentlike patterns, which-depending on network parameters-interfere with the global collective firing of the neurons. We attribute the various network dynamics to distinct regimes in the parameter space. For the same network parameters different network dynamics can be observed depending on the set of initial conditions only. Such a multistable behavior and the interplay between local pattern formation and global collective firing may be attributable to the spatiotemporal dynamics of biological networks.

Noise-induced relations between network connectivity and dynamics

NASA Astrophysics Data System (ADS)

Ching, Emily Sc

Many biological systems of interest can be represented as networks of many nodes that are interacting with one another. Often these systems are subject to external influence or noise. One of the central issues is to understand the relation between dynamics and the interaction pattern of the system or the connectivity structure of the network. In particular, a challenging problem is to infer the network connectivity structure from the dynamics. In this talk, we show that for stochastic dynamical systems subjected to noise, the presence of noise gives rise to mathematical relations between the network connectivity structure and quantities that can be calculated using solely the time-series measurements of the dynamics of the nodes. We present these relations for both undirected networks with bidirectional coupling and directed networks with directional coupling and discuss how such relations can be utilized to infer the network connectivity structure of the systems. Work supported by the Hong Kong Research Grants Council under Grant No. CUHK 14300914.

Active influence in dynamical models of structural balance in social networks

NASA Astrophysics Data System (ADS)

Summers, Tyler H.; Shames, Iman

2013-07-01

We consider a nonlinear dynamical system on a signed graph, which can be interpreted as a mathematical model of social networks in which the links can have both positive and negative connotations. In accordance with a concept from social psychology called structural balance, the negative links play a key role in both the structure and dynamics of the network. Recent research has shown that in a nonlinear dynamical system modeling the time evolution of “friendliness levels” in the network, two opposing factions emerge from almost any initial condition. Here we study active external influence in this dynamical model and show that any agent in the network can achieve any desired structurally balanced state from any initial condition by perturbing its own local friendliness levels. Based on this result, we also introduce a new network centrality measure for signed networks. The results are illustrated in an international-relations network using United Nations voting record data from 1946 to 2008 to estimate friendliness levels amongst various countries.

Conflict and convention in dynamic networks.

PubMed

Foley, Michael; Forber, Patrick; Smead, Rory; Riedl, Christoph

2018-03-01

An important way to resolve games of conflict (snowdrift, hawk-dove, chicken) involves adopting a convention: a correlated equilibrium that avoids any conflict between aggressive strategies. Dynamic networks allow individuals to resolve conflict via their network connections rather than changing their strategy. Exploring how behavioural strategies coevolve with social networks reveals new dynamics that can help explain the origins and robustness of conventions. Here, we model the emergence of conventions as correlated equilibria in dynamic networks. Our results show that networks have the tendency to break the symmetry between the two conventional solutions in a strongly biased way. Rather than the correlated equilibrium associated with ownership norms (play aggressive at home, not away), we usually see the opposite host-guest norm (play aggressive away, not at home) evolve on dynamic networks, a phenomenon common to human interaction. We also show that learning to avoid conflict can produce realistic network structures in a way different than preferential attachment models. © 2017 The Author(s).

Building New Bridges between In Vitro and In Vivo in Early Drug Discovery: Where Molecular Modeling Meets Systems Biology.

PubMed

Pearlstein, Robert A; McKay, Daniel J J; Hornak, Viktor; Dickson, Callum; Golosov, Andrei; Harrison, Tyler; Velez-Vega, Camilo; Duca, José

2017-01-01

Cellular drug targets exist within networked function-generating systems whose constituent molecular species undergo dynamic interdependent non-equilibrium state transitions in response to specific perturbations (i.e.. inputs). Cellular phenotypic behaviors are manifested through the integrated behaviors of such networks. However, in vitro data are frequently measured and/or interpreted with empirical equilibrium or steady state models (e.g. Hill, Michaelis-Menten, Briggs-Haldane) relevant to isolated target populations. We propose that cells act as analog computers, "solving" sets of coupled "molecular differential equations" (i.e. represented by populations of interacting species)via "integration" of the dynamic state probability distributions among those populations. Disconnects between biochemical and functional/phenotypic assays (cellular/in vivo) may arise with targetcontaining systems that operate far from equilibrium, and/or when coupled contributions (including target-cognate partner binding and drug pharmacokinetics) are neglected in the analysis of biochemical results. The transformation of drug discovery from a trial-and-error endeavor to one based on reliable design criteria depends on improved understanding of the dynamic mechanisms powering cellular function/dysfunction at the systems level. Here, we address the general mechanisms of molecular and cellular function and pharmacological modulation thereof. We outline a first principles theory on the mechanisms by which free energy is stored and transduced into biological function, and by which biological function is modulated by drug-target binding. We propose that cellular function depends on dynamic counter-balanced molecular systems necessitated by the exponential behavior of molecular state transitions under non-equilibrium conditions, including positive versus negative mass action kinetics and solute-induced perturbations to the hydrogen bonds of solvating water versus kT. Copyright© Bentham Science Publishers; For any queries, please email at epub@benthamscience.org.

Measurement correction method for force sensor used in dynamic pressure calibration based on artificial neural network optimized by genetic algorithm

NASA Astrophysics Data System (ADS)

Gu, Tingwei; Kong, Deren; Shang, Fei; Chen, Jing

2017-12-01

We present an optimization algorithm to obtain low-uncertainty dynamic pressure measurements from a force-transducer-based device. In this paper, the advantages and disadvantages of the methods that are commonly used to measure the propellant powder gas pressure, the applicable scope of dynamic pressure calibration devices, and the shortcomings of the traditional comparison calibration method based on the drop-weight device are firstly analysed in detail. Then, a dynamic calibration method for measuring pressure using a force sensor based on a drop-weight device is introduced. This method can effectively save time when many pressure sensors are calibrated simultaneously and extend the life of expensive reference sensors. However, the force sensor is installed between the drop-weight and the hammerhead by transition pieces through the connection mode of bolt fastening, which causes adverse effects such as additional pretightening and inertia forces. To solve these effects, the influence mechanisms of the pretightening force, the inertia force and other influence factors on the force measurement are theoretically analysed. Then a measurement correction method for the force measurement is proposed based on an artificial neural network optimized by a genetic algorithm. The training and testing data sets are obtained from calibration tests, and the selection criteria for the key parameters of the correction model is discussed. The evaluation results for the test data show that the correction model can effectively improve the force measurement accuracy of the force sensor. Compared with the traditional high-accuracy comparison calibration method, the percentage difference of the impact-force-based measurement is less than 0.6% and the relative uncertainty of the corrected force value is 1.95%, which can meet the requirements of engineering applications.

Meeting report from the first meetings of the Computational Modeling in Biology Network (COMBINE)

PubMed Central

Le Novère, Nicolas; Hucka, Michael; Anwar, Nadia; Bader, Gary D; Demir, Emek; Moodie, Stuart; Sorokin, Anatoly

2011-01-01

The Computational Modeling in Biology Network (COMBINE), is an initiative to coordinate the development of the various community standards and formats in computational systems biology and related fields. This report summarizes the activities pursued at the first annual COMBINE meeting held in Edinburgh on October 6-9 2010 and the first HARMONY hackathon, held in New York on April 18-22 2011. The first of those meetings hosted 81 attendees. Discussions covered both official COMBINE standards-(BioPAX, SBGN and SBML), as well as emerging efforts and interoperability between different formats. The second meeting, oriented towards software developers, welcomed 59 participants and witnessed many technical discussions, development of improved standards support in community software systems and conversion between the standards. Both meetings were resounding successes and showed that the field is now mature enough to develop representation formats and related standards in a coordinated manner. PMID:22180826

Meeting report from the first meetings of the Computational Modeling in Biology Network (COMBINE).

PubMed

Le Novère, Nicolas; Hucka, Michael; Anwar, Nadia; Bader, Gary D; Demir, Emek; Moodie, Stuart; Sorokin, Anatoly

2011-11-30

The Computational Modeling in Biology Network (COMBINE), is an initiative to coordinate the development of the various community standards and formats in computational systems biology and related fields. This report summarizes the activities pursued at the first annual COMBINE meeting held in Edinburgh on October 6-9 2010 and the first HARMONY hackathon, held in New York on April 18-22 2011. The first of those meetings hosted 81 attendees. Discussions covered both official COMBINE standards-(BioPAX, SBGN and SBML), as well as emerging efforts and interoperability between different formats. The second meeting, oriented towards software developers, welcomed 59 participants and witnessed many technical discussions, development of improved standards support in community software systems and conversion between the standards. Both meetings were resounding successes and showed that the field is now mature enough to develop representation formats and related standards in a coordinated manner.

Complex networks repair strategies: Dynamic models

NASA Astrophysics Data System (ADS)

Fu, Chaoqi; Wang, Ying; Gao, Yangjun; Wang, Xiaoyang

2017-09-01

Network repair strategies are tactical methods that restore the efficiency of damaged networks; however, unreasonable repair strategies not only waste resources, they are also ineffective for network recovery. Most extant research on network repair focuses on static networks, but results and findings on static networks cannot be applied to evolutionary dynamic networks because, in dynamic models, complex network repair has completely different characteristics. For instance, repaired nodes face more severe challenges, and require strategic repair methods in order to have a significant effect. In this study, we propose the Shell Repair Strategy (SRS) to minimize the risk of secondary node failures due to the cascading effect. Our proposed method includes the identification of a set of vital nodes that have a significant impact on network repair and defense. Our identification of these vital nodes reduces the number of switching nodes that face the risk of secondary failures during the dynamic repair process. This is positively correlated with the size of the average degree 〈 k 〉 and enhances network invulnerability.

Simple deterministic models and applications. Comment on "Coupled disease-behavior dynamics on complex networks: A review" by Z. Wang et al.

NASA Astrophysics Data System (ADS)

Yang, Hyun Mo

2015-12-01

Currently, discrete modellings are largely accepted due to the access to computers with huge storage capacity and high performance processors and easy implementation of algorithms, allowing to develop and simulate increasingly sophisticated models. Wang et al. [7] present a review of dynamics in complex networks, focusing on the interaction between disease dynamics and human behavioral and social dynamics. By doing an extensive review regarding to the human behavior responding to disease dynamics, the authors briefly describe the complex dynamics found in the literature: well-mixed populations networks, where spatial structure can be neglected, and other networks considering heterogeneity on spatially distributed populations. As controlling mechanisms are implemented, such as social distancing due 'social contagion', quarantine, non-pharmaceutical interventions and vaccination, adaptive behavior can occur in human population, which can be easily taken into account in the dynamics formulated by networked populations.

Emergence, evolution and scaling of online social networks.

PubMed

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.

A geometrical approach to control and controllability of nonlinear dynamical networks

PubMed Central

Wang, Le-Zhi; Su, Ri-Qi; Huang, Zi-Gang; Wang, Xiao; Wang, Wen-Xu; Grebogi, Celso; Lai, Ying-Cheng

2016-01-01

In spite of the recent interest and advances in linear controllability of complex networks, controlling nonlinear network dynamics remains an outstanding problem. Here we develop an experimentally feasible control framework for nonlinear dynamical networks that exhibit multistability. The control objective is to apply parameter perturbation to drive the system from one attractor to another, assuming that the former is undesired and the latter is desired. To make our framework practically meaningful, we consider restricted parameter perturbation by imposing two constraints: it must be experimentally realizable and applied only temporarily. We introduce the concept of attractor network, which allows us to formulate a quantifiable controllability framework for nonlinear dynamical networks: a network is more controllable if the attractor network is more strongly connected. We test our control framework using examples from various models of experimental gene regulatory networks and demonstrate the beneficial role of noise in facilitating control. PMID:27076273

Risk assessment by dynamic representation of vulnerability, exploitation, and impact

NASA Astrophysics Data System (ADS)

Cam, Hasan

2015-05-01

Assessing and quantifying cyber risk accurately in real-time is essential to providing security and mission assurance in any system and network. This paper presents a modeling and dynamic analysis approach to assessing cyber risk of a network in real-time by representing dynamically its vulnerabilities, exploitations, and impact using integrated Bayesian network and Markov models. Given the set of vulnerabilities detected by a vulnerability scanner in a network, this paper addresses how its risk can be assessed by estimating in real-time the exploit likelihood and impact of vulnerability exploitation on the network, based on real-time observations and measurements over the network. The dynamic representation of the network in terms of its vulnerabilities, sensor measurements, and observations is constructed dynamically using the integrated Bayesian network and Markov models. The transition rates of outgoing and incoming links of states in hidden Markov models are used in determining exploit likelihood and impact of attacks, whereas emission rates help quantify the attack states of vulnerabilities. Simulation results show the quantification and evolving risk scores over time for individual and aggregated vulnerabilities of a network.

Counting and classifying attractors in high dimensional dynamical systems.

PubMed

Bagley, R J; Glass, L

1996-12-07

Randomly connected Boolean networks have been used as mathematical models of neural, genetic, and immune systems. A key quantity of such networks is the number of basins of attraction in the state space. The number of basins of attraction changes as a function of the size of the network, its connectivity and its transition rules. In discrete networks, a simple count of the number of attractors does not reveal the combinatorial structure of the attractors. These points are illustrated in a reexamination of dynamics in a class of random Boolean networks considered previously by Kauffman. We also consider comparisons between dynamics in discrete networks and continuous analogues. A continuous analogue of a discrete network may have a different number of attractors for many different reasons. Some attractors in discrete networks may be associated with unstable dynamics, and several different attractors in a discrete network may be associated with a single attractor in the continuous case. Special problems in determining attractors in continuous systems arise when there is aperiodic dynamics associated with quasiperiodicity of deterministic chaos.

Representing perturbed dynamics in biological network models

NASA Astrophysics Data System (ADS)

Stoll, Gautier; Rougemont, Jacques; Naef, Felix

2007-07-01

We study the dynamics of gene activities in relatively small size biological networks (up to a few tens of nodes), e.g., the activities of cell-cycle proteins during the mitotic cell-cycle progression. Using the framework of deterministic discrete dynamical models, we characterize the dynamical modifications in response to structural perturbations in the network connectivities. In particular, we focus on how perturbations affect the set of fixed points and sizes of the basins of attraction. Our approach uses two analytical measures: the basin entropy H and the perturbation size Δ , a quantity that reflects the distance between the set of fixed points of the perturbed network and that of the unperturbed network. Applying our approach to the yeast-cell-cycle network introduced by Li [Proc. Natl. Acad. Sci. U.S.A. 101, 4781 (2004)] provides a low-dimensional and informative fingerprint of network behavior under large classes of perturbations. We identify interactions that are crucial for proper network function, and also pinpoint functionally redundant network connections. Selected perturbations exemplify the breadth of dynamical responses in this cell-cycle model.

Exploring complex networks.

PubMed

Strogatz, S H

2001-03-08

The study of networks pervades all of science, from neurobiology to statistical physics. The most basic issues are structural: how does one characterize the wiring diagram of a food web or the Internet or the metabolic network of the bacterium Escherichia coli? Are there any unifying principles underlying their topology? From the perspective of nonlinear dynamics, we would also like to understand how an enormous network of interacting dynamical systems-be they neurons, power stations or lasers-will behave collectively, given their individual dynamics and coupling architecture. Researchers are only now beginning to unravel the structure and dynamics of complex networks.

INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: Estimating Topology of Discrete Dynamical Networks

NASA Astrophysics Data System (ADS)

Guo, Shu-Juan; Fu, Xin-Chu

2010-07-01

In this paper, by applying Lasalle's invariance principle and some results about the trace of a matrix, we propose a method for estimating the topological structure of a discrete dynamical network based on the dynamical evolution of the network. The network concerned can be directed or undirected, weighted or unweighted, and the local dynamics of each node can be nonidentical. The connections among the nodes can be all unknown or partially known. Finally, two examples, including a Hénon map and a central network, are illustrated to verify the theoretical results.

Neural Networks for Rapid Design and Analysis

NASA Technical Reports Server (NTRS)

Sparks, Dean W., Jr.; Maghami, Peiman G.

1998-01-01

Artificial neural networks have been employed for rapid and efficient dynamics and control analysis of flexible systems. Specifically, feedforward neural networks are designed to approximate nonlinear dynamic components over prescribed input ranges, and are used in simulations as a means to speed up the overall time response analysis process. To capture the recursive nature of dynamic components with artificial neural networks, recurrent networks, which use state feedback with the appropriate number of time delays, as inputs to the networks, are employed. Once properly trained, neural networks can give very good approximations to nonlinear dynamic components, and by their judicious use in simulations, allow the analyst the potential to speed up the analysis process considerably. To illustrate this potential speed up, an existing simulation model of a spacecraft reaction wheel system is executed, first conventionally, and then with an artificial neural network in place.

Framework based on communicability and flow to analyze complex network dynamics

NASA Astrophysics Data System (ADS)

Gilson, M.; Kouvaris, N. E.; Deco, G.; Zamora-López, G.

2018-05-01

Graph theory constitutes a widely used and established field providing powerful tools for the characterization of complex networks. The intricate topology of networks can also be investigated by means of the collective dynamics observed in the interactions of self-sustained oscillations (synchronization patterns) or propagationlike processes such as random walks. However, networks are often inferred from real-data-forming dynamic systems, which are different from those employed to reveal their topological characteristics. This stresses the necessity for a theoretical framework dedicated to the mutual relationship between the structure and dynamics in complex networks, as the two sides of the same coin. Here we propose a rigorous framework based on the network response over time (i.e., Green function) to study interactions between nodes across time. For this purpose we define the flow that describes the interplay between the network connectivity and external inputs. This multivariate measure relates to the concepts of graph communicability and the map equation. We illustrate our theory using the multivariate Ornstein-Uhlenbeck process, which describes stable and non-conservative dynamics, but the formalism can be adapted to other local dynamics for which the Green function is known. We provide applications to classical network examples, such as small-world ring and hierarchical networks. Our theory defines a comprehensive framework that is canonically related to directed and weighted networks, thus paving a way to revise the standards for network analysis, from the pairwise interactions between nodes to the global properties of networks including community detection.

Concurrency-Induced Transitions in Epidemic Dynamics on Temporal Networks.

PubMed

Onaga, Tomokatsu; Gleeson, James P; Masuda, Naoki

2017-09-08

Social contact networks underlying epidemic processes in humans and animals are highly dynamic. The spreading of infections on such temporal networks can differ dramatically from spreading on static networks. We theoretically investigate the effects of concurrency, the number of neighbors that a node has at a given time point, on the epidemic threshold in the stochastic susceptible-infected-susceptible dynamics on temporal network models. We show that network dynamics can suppress epidemics (i.e., yield a higher epidemic threshold) when the node's concurrency is low, but can also enhance epidemics when the concurrency is high. We analytically determine different phases of this concurrency-induced transition, and confirm our results with numerical simulations.

Concurrency-Induced Transitions in Epidemic Dynamics on Temporal Networks

NASA Astrophysics Data System (ADS)

Onaga, Tomokatsu; Gleeson, James P.; Masuda, Naoki

2017-09-01

Social contact networks underlying epidemic processes in humans and animals are highly dynamic. The spreading of infections on such temporal networks can differ dramatically from spreading on static networks. We theoretically investigate the effects of concurrency, the number of neighbors that a node has at a given time point, on the epidemic threshold in the stochastic susceptible-infected-susceptible dynamics on temporal network models. We show that network dynamics can suppress epidemics (i.e., yield a higher epidemic threshold) when the node's concurrency is low, but can also enhance epidemics when the concurrency is high. We analytically determine different phases of this concurrency-induced transition, and confirm our results with numerical simulations.

Feasibility of solid oxide fuel cell dynamic hydrogen coproduction to meet building demand

NASA Astrophysics Data System (ADS)

Shaffer, Brendan; Brouwer, Jacob

2014-02-01

A dynamic internal reforming-solid oxide fuel cell system model is developed and used to simulate the coproduction of electricity and hydrogen while meeting the measured dynamic load of a typical southern California commercial building. The simulated direct internal reforming-solid oxide fuel cell (DIR-SOFC) system is controlled to become an electrical load following device that well follows the measured building load data (3-s resolution). The feasibility of the DIR-SOFC system to meet the dynamic building demand while co-producing hydrogen is demonstrated. The resulting thermal responses of the system to the electrical load dynamics as well as those dynamics associated with the filling of a hydrogen collection tank are investigated. The DIR-SOFC system model also allows for resolution of the fuel cell species and temperature distributions during these dynamics since thermal gradients are a concern for DIR-SOFC.

Temporal networks

NASA Astrophysics Data System (ADS)

Holme, Petter; Saramäki, Jari

2012-10-01

A great variety of systems in nature, society and technology-from the web of sexual contacts to the Internet, from the nervous system to power grids-can be modeled as graphs of vertices coupled by edges. The network structure, describing how the graph is wired, helps us understand, predict and optimize the behavior of dynamical systems. In many cases, however, the edges are not continuously active. As an example, in networks of communication via e-mail, text messages, or phone calls, edges represent sequences of instantaneous or practically instantaneous contacts. In some cases, edges are active for non-negligible periods of time: e.g., the proximity patterns of inpatients at hospitals can be represented by a graph where an edge between two individuals is on throughout the time they are at the same ward. Like network topology, the temporal structure of edge activations can affect dynamics of systems interacting through the network, from disease contagion on the network of patients to information diffusion over an e-mail network. In this review, we present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamical systems. In the light of traditional network theory, one can see this framework as moving the information of when things happen from the dynamical system on the network, to the network itself. Since fundamental properties, such as the transitivity of edges, do not necessarily hold in temporal networks, many of these methods need to be quite different from those for static networks. The study of temporal networks is very interdisciplinary in nature. Reflecting this, even the object of study has many names-temporal graphs, evolving graphs, time-varying graphs, time-aggregated graphs, time-stamped graphs, dynamic networks, dynamic graphs, dynamical graphs, and so on. This review covers different fields where temporal graphs are considered, but does not attempt to unify related terminology-rather, we want to make papers readable across disciplines.

Temporal efficiency evaluation and small-worldness characterization in temporal networks

PubMed Central

Dai, Zhongxiang; Chen, Yu; Li, Junhua; Fam, Johnson; Bezerianos, Anastasios; Sun, Yu

2016-01-01

Numerous real-world systems can be modeled as networks. To date, most network studies have been conducted assuming stationary network characteristics. Many systems, however, undergo topological changes over time. Temporal networks, which incorporate time into conventional network models, are therefore more accurate representations of such dynamic systems. Here, we introduce a novel generalized analytical framework for temporal networks, which enables 1) robust evaluation of the efficiency of temporal information exchange using two new network metrics and 2) quantitative inspection of the temporal small-worldness. Specifically, we define new robust temporal network efficiency measures by incorporating the time dependency of temporal distance. We propose a temporal regular network model, and based on this plus the redefined temporal efficiency metrics and widely used temporal random network models, we introduce a quantitative approach for identifying temporal small-world architectures (featuring high temporal network efficiency both globally and locally). In addition, within this framework, we can uncover network-specific dynamic structures. Applications to brain networks, international trade networks, and social networks reveal prominent temporal small-world properties with distinct dynamic network structures. We believe that the framework can provide further insight into dynamic changes in the network topology of various real-world systems and significantly promote research on temporal networks. PMID:27682314

Temporal efficiency evaluation and small-worldness characterization in temporal networks

NASA Astrophysics Data System (ADS)

Dai, Zhongxiang; Chen, Yu; Li, Junhua; Fam, Johnson; Bezerianos, Anastasios; Sun, Yu

2016-09-01

Numerous real-world systems can be modeled as networks. To date, most network studies have been conducted assuming stationary network characteristics. Many systems, however, undergo topological changes over time. Temporal networks, which incorporate time into conventional network models, are therefore more accurate representations of such dynamic systems. Here, we introduce a novel generalized analytical framework for temporal networks, which enables 1) robust evaluation of the efficiency of temporal information exchange using two new network metrics and 2) quantitative inspection of the temporal small-worldness. Specifically, we define new robust temporal network efficiency measures by incorporating the time dependency of temporal distance. We propose a temporal regular network model, and based on this plus the redefined temporal efficiency metrics and widely used temporal random network models, we introduce a quantitative approach for identifying temporal small-world architectures (featuring high temporal network efficiency both globally and locally). In addition, within this framework, we can uncover network-specific dynamic structures. Applications to brain networks, international trade networks, and social networks reveal prominent temporal small-world properties with distinct dynamic network structures. We believe that the framework can provide further insight into dynamic changes in the network topology of various real-world systems and significantly promote research on temporal networks.

Spectrum of Lyapunov exponents of non-smooth dynamical systems of integrate-and-fire type.

PubMed

Zhou, Douglas; Sun, Yi; Rangan, Aaditya V; Cai, David

2010-04-01

We discuss how to characterize long-time dynamics of non-smooth dynamical systems, such as integrate-and-fire (I&F) like neuronal network, using Lyapunov exponents and present a stable numerical method for the accurate evaluation of the spectrum of Lyapunov exponents for this large class of dynamics. These dynamics contain (i) jump conditions as in the firing-reset dynamics and (ii) degeneracy such as in the refractory period in which voltage-like variables of the network collapse to a single constant value. Using the networks of linear I&F neurons, exponential I&F neurons, and I&F neurons with adaptive threshold, we illustrate our method and discuss the rich dynamics of these networks.

Hamiltonian dynamics for complex food webs

NASA Astrophysics Data System (ADS)

Kozlov, Vladimir; Vakulenko, Sergey; Wennergren, Uno

2016-03-01

We investigate stability and dynamics of large ecological networks by introducing classical methods of dynamical system theory from physics, including Hamiltonian and averaging methods. Our analysis exploits the topological structure of the network, namely the existence of strongly connected nodes (hubs) in the networks. We reveal new relations between topology, interaction structure, and network dynamics. We describe mechanisms of catastrophic phenomena leading to sharp changes of dynamics and hence completely altering the ecosystem. We also show how these phenomena depend on the structure of interaction between species. We can conclude that a Hamiltonian structure of biological interactions leads to stability and large biodiversity.

75 FR 82135 - Agency Information Collection Activities: Notice of Request for Approval of a New Information...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-12-29

... off of the success of three meeting-place based dynamic ridesharing systems that exist in Houston, San... dynamic ridesharing systems operate by having drivers and riders meet at central, easily accessible... they are a critical component to these robust dynamic ridesharing systems which serve thousands of...

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

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

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

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

Propagation, cascades, and agreement dynamics in complex communication and social networks

NASA Astrophysics Data System (ADS)

Lu, Qiming

Many modern and important technological, social, information and infrastructure systems can be viewed as complex systems with a large number of interacting components. Models of complex networks and dynamical interactions, as well as their applications are of fundamental interests in many aspects. Here, several stylized models of multiplex propagation and opinion dynamics are investigated on complex and empirical social networks. We first investigate cascade dynamics in threshold-controlled (multiplex) propagation on random geometric networks. We find that such local dynamics can serve as an efficient, robust, and reliable prototypical activation protocol in sensor networks in responding to various alarm scenarios. We also consider the same dynamics on a modified network by adding a few long-range communication links, resulting in a small-world network. We find that such construction can further enhance and optimize the speed of the network's response, while keeping energy consumption at a manageable level. We also investigate a prototypical agent-based model, the Naming Game, on two-dimensional random geometric networks. The Naming Game [A. Baronchelli et al., J. Stat. Mech.: Theory Exp. (2006) P06014.] is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the Naming Games with local broadcasts on random geometric graphs, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially-embedded autonomous agents. Among the relevant observables capturing the temporal properties of the agreement process, we investigate the cluster-size distribution and the distribution of the agreement times, both exhibiting dynamic scaling. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a "small-world"-like network and yielding a significantly reduced time to reach global agreement. We construct a finite-size scaling analysis for the agreement times in this case. When applying the model of Naming Game on empirical social networks, this stylized agent-based model captures essential features of agreement dynamics in a network of autonomous agents, corresponding to the development of shared classification schemes in a network of artificial agents or opinion spreading and social dynamics in social networks. Our study focuses on the impact that communities in the underlying social graphs have on the outcome of the agreement process. We find that networks with strong community structure hinder the system from reaching global agreement; the evolution of the Naming Game in these networks maintains clusters of coexisting opinions indefinitely. Further, we investigate agent-based network strategies to facilitate convergence to global consensus.

Engaging stakeholders: lessons from the use of participatory tools for improving maternal and child care health services.

PubMed

Ekirapa-Kiracho, Elizabeth; Ghosh, Upasona; Brahmachari, Rittika; Paina, Ligia

2017-12-28

Effective stakeholder engagement in research and implementation is important for improving the development and implementation of policies and programmes. A varied number of tools have been employed for stakeholder engagement. In this paper, we discuss two participatory methods for engaging with stakeholders - participatory social network analysis (PSNA) and participatory impact pathways analysis (PIPA). Based on our experience, we derive lessons about when and how to apply these tools. This paper was informed by a review of project reports and documents in addition to reflection meetings with the researchers who applied the tools. These reports were synthesised and used to make thick descriptions of the applications of the methods while highlighting key lessons. PSNA and PIPA both allowed a deep understanding of how the system actors are interconnected and how they influence maternal health and maternal healthcare services. The findings from the PSNA provided guidance on how stakeholders of a health system are interconnected and how they can stimulate more positive interaction between the stakeholders by exposing existing gaps. The PIPA meeting enabled the participants to envision how they could expand their networks and resources by mentally thinking about the contributions that they could make to the project. The processes that were considered critical for successful application of the tools and achievement of outcomes included training of facilitators, language used during the facilitation, the number of times the tool is applied, length of the tools, pretesting of the tools, and use of quantitative and qualitative methods. Whereas both tools allowed the identification of stakeholders and provided a deeper understanding of the type of networks and dynamics within the network, PIPA had a higher potential for promoting collaboration between stakeholders, likely due to allowing interaction between them. Additionally, it was implemented within a participatory action research project. PIPA also allowed participatory evaluation of the project from the perspective of the community. This paper provides lessons about the use of these participatory tools.

Multi-mode energy management strategy for fuel cell electric vehicles based on driving pattern identification using learning vector quantization neural network algorithm

NASA Astrophysics Data System (ADS)

Song, Ke; Li, Feiqiang; Hu, Xiao; He, Lin; Niu, Wenxu; Lu, Sihao; Zhang, Tong

2018-06-01

The development of fuel cell electric vehicles can to a certain extent alleviate worldwide energy and environmental issues. While a single energy management strategy cannot meet the complex road conditions of an actual vehicle, this article proposes a multi-mode energy management strategy for electric vehicles with a fuel cell range extender based on driving condition recognition technology, which contains a patterns recognizer and a multi-mode energy management controller. This paper introduces a learning vector quantization (LVQ) neural network to design the driving patterns recognizer according to a vehicle's driving information. This multi-mode strategy can automatically switch to the genetic algorithm optimized thermostat strategy under specific driving conditions in the light of the differences in condition recognition results. Simulation experiments were carried out based on the model's validity verification using a dynamometer test bench. Simulation results show that the proposed strategy can obtain better economic performance than the single-mode thermostat strategy under dynamic driving conditions.

Accurate modeling of switched reluctance machine based on hybrid trained WNN

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

Song, Shoujun, E-mail: sunnyway@nwpu.edu.cn; Ge, Lefei; Ma, Shaojie

2014-04-15

According to the strong nonlinear electromagnetic characteristics of switched reluctance machine (SRM), a novel accurate modeling method is proposed based on hybrid trained wavelet neural network (WNN) which combines improved genetic algorithm (GA) with gradient descent (GD) method to train the network. In the novel method, WNN is trained by GD method based on the initial weights obtained per improved GA optimization, and the global parallel searching capability of stochastic algorithm and local convergence speed of deterministic algorithm are combined to enhance the training accuracy, stability and speed. Based on the measured electromagnetic characteristics of a 3-phase 12/8-pole SRM, themore » nonlinear simulation model is built by hybrid trained WNN in Matlab. The phase current and mechanical characteristics from simulation under different working conditions meet well with those from experiments, which indicates the accuracy of the model for dynamic and static performance evaluation of SRM and verifies the effectiveness of the proposed modeling method.« less

Multiport power router and its impact on future smart grids

NASA Astrophysics Data System (ADS)

Kado, Yuichi; Shichijo, Daiki; Wada, Keiji; Iwatsuki, Katsumi

2016-07-01

We propose a Y configuration power router as a unit cell to easily construct a power delivery system that can meet many types of user requirements. The Y configuration power router controls the direction and magnitude of power flows between three ports regardless of DC or AC. We constructed a prototype three-way isolated DC/DC converter that is the core unit of the Y configuration power router. The electrical insulation between three ports assures safety and reliability for power network systems. We then tested the operation of power flow control. The experimental results revealed that our methodology based on a governing equation was appropriate to control the power flow of the three-way DC/DC converter. In addition, a distribution network composed of power routers had the ability to easily enable interchanges of electrical power between autonomous microgrid cells. We also explored the requirements for communication between energy routers to achieve dynamic adjustments of energy flows in a coordinated manner and their impact on resilient power grid systems.

Negative autoregulation matches production and demand in synthetic transcriptional networks.

PubMed

Franco, Elisa; Giordano, Giulia; Forsberg, Per-Ola; Murray, Richard M

2014-08-15

We propose a negative feedback architecture that regulates activity of artificial genes, or "genelets", to meet their output downstream demand, achieving robustness with respect to uncertain open-loop output production rates. In particular, we consider the case where the outputs of two genelets interact to form a single assembled product. We show with analysis and experiments that negative autoregulation matches the production and demand of the outputs: the magnitude of the regulatory signal is proportional to the "error" between the circuit output concentration and its actual demand. This two-device system is experimentally implemented using in vitro transcriptional networks, where reactions are systematically designed by optimizing nucleic acid sequences with publicly available software packages. We build a predictive ordinary differential equation (ODE) model that captures the dynamics of the system and can be used to numerically assess the scalability of this architecture to larger sets of interconnected genes. Finally, with numerical simulations we contrast our negative autoregulation scheme with a cross-activation architecture, which is less scalable and results in slower response times.

Highly dynamic animal contact network and implications on disease transmission

PubMed Central

Chen, Shi; White, Brad J.; Sanderson, Michael W.; Amrine, David E.; Ilany, Amiyaal; Lanzas, Cristina

2014-01-01

Contact patterns among hosts are considered as one of the most critical factors contributing to unequal pathogen transmission. Consequently, networks have been widely applied in infectious disease modeling. However most studies assume static network structure due to lack of accurate observation and appropriate analytic tools. In this study we used high temporal and spatial resolution animal position data to construct a high-resolution contact network relevant to infectious disease transmission. The animal contact network aggregated at hourly level was highly variable and dynamic within and between days, for both network structure (network degree distribution) and individual rank of degree distribution in the network (degree order). We integrated network degree distribution and degree order heterogeneities with a commonly used contact-based, directly transmitted disease model to quantify the effect of these two sources of heterogeneity on the infectious disease dynamics. Four conditions were simulated based on the combination of these two heterogeneities. Simulation results indicated that disease dynamics and individual contribution to new infections varied substantially among these four conditions under both parameter settings. Changes in the contact network had a greater effect on disease dynamics for pathogens with smaller basic reproduction number (i.e. R0 < 2). PMID:24667241

Linking dynamics of the inhibitory network to the input structure

PubMed Central

Komarov, Maxim

2017-01-01

Networks of inhibitory interneurons are found in many distinct classes of biological systems. Inhibitory interneurons govern the dynamics of principal cells and are likely to be critically involved in the coding of information. In this theoretical study, we describe the dynamics of a generic inhibitory network in terms of low-dimensional, simplified rate models. We study the relationship between the structure of external input applied to the network and the patterns of activity arising in response to that stimulation. We found that even a minimal inhibitory network can generate a great diversity of spatio-temporal patterning including complex bursting regimes with non-trivial ratios of burst firing. Despite the complexity of these dynamics, the network’s response patterns can be predicted from the rankings of the magnitudes of external inputs to the inhibitory neurons. This type of invariant dynamics is robust to noise and stable in densely connected networks with strong inhibitory coupling. Our study predicts that the response dynamics generated by an inhibitory network may provide critical insights about the temporal structure of the sensory input it receives. PMID:27650865

78 FR 71631 - Committee Name: Homeland Security Information Network Advisory Committee (HSINAC)

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-29

... Network Advisory Committee (HSINAC) AGENCY: Operation Coordination and Planning/Office of Chief.... SUMMARY: The Homeland Security Information Network Advisory Council (HSINAC) will meet December 17, 2013... , Phone: 202-343-4212. SUPPLEMENTARY INFORMATION: The Homeland Security Information Network Advisory...

Dynamics of social balance on networks

NASA Astrophysics Data System (ADS)

Antal, T.; Krapivsky, P. L.; Redner, S.

2005-09-01

We study the evolution of social networks that contain both friendly and unfriendly pairwise links between individual nodes. The network is endowed with dynamics in which the sense of a link in an imbalanced triad—a triangular loop with one or three unfriendly links—is reversed to make the triad balanced. With this dynamics, an infinite network undergoes a dynamic phase transition from a steady state to “paradise”—all links are friendly—as the propensity p for friendly links in an update event passes through 1/2 . A finite network always falls into a socially balanced absorbing state where no imbalanced triads remain. If the additional constraint that the number of imbalanced triads in the network not increase in an update is imposed, then the network quickly reaches a balanced final state.

Bellman Ford algorithm - in Routing Information Protocol (RIP)

NASA Astrophysics Data System (ADS)

Krianto Sulaiman, Oris; Mahmud Siregar, Amir; Nasution, Khairuddin; Haramaini, Tasliyah

2018-04-01

In a large scale network need a routing that can handle a lot number of users, one of the solutions to cope with large scale network is by using a routing protocol, There are 2 types of routing protocol that is static and dynamic, Static routing is manually route input based on network admin, while dynamic routing is automatically route input formed based on existing network. Dynamic routing is efficient used to network extensively because of the input of route automatic formed, Routing Information Protocol (RIP) is one of dynamic routing that uses the bellman-ford algorithm where this algorithm will search for the best path that traversed the network by leveraging the value of each link, so with the bellman-ford algorithm owned by RIP can optimize existing networks.

Accurate detection of hierarchical communities in complex networks based on nonlinear dynamical evolution

NASA Astrophysics Data System (ADS)

Zhuo, Zhao; Cai, Shi-Min; Tang, Ming; Lai, Ying-Cheng

2018-04-01

One of the most challenging problems in network science is to accurately detect communities at distinct hierarchical scales. Most existing methods are based on structural analysis and manipulation, which are NP-hard. We articulate an alternative, dynamical evolution-based approach to the problem. The basic principle is to computationally implement a nonlinear dynamical process on all nodes in the network with a general coupling scheme, creating a networked dynamical system. Under a proper system setting and with an adjustable control parameter, the community structure of the network would "come out" or emerge naturally from the dynamical evolution of the system. As the control parameter is systematically varied, the community hierarchies at different scales can be revealed. As a concrete example of this general principle, we exploit clustered synchronization as a dynamical mechanism through which the hierarchical community structure can be uncovered. In particular, for quite arbitrary choices of the nonlinear nodal dynamics and coupling scheme, decreasing the coupling parameter from the global synchronization regime, in which the dynamical states of all nodes are perfectly synchronized, can lead to a weaker type of synchronization organized as clusters. We demonstrate the existence of optimal choices of the coupling parameter for which the synchronization clusters encode accurate information about the hierarchical community structure of the network. We test and validate our method using a standard class of benchmark modular networks with two distinct hierarchies of communities and a number of empirical networks arising from the real world. Our method is computationally extremely efficient, eliminating completely the NP-hard difficulty associated with previous methods. The basic principle of exploiting dynamical evolution to uncover hidden community organizations at different scales represents a "game-change" type of approach to addressing the problem of community detection in complex networks.

Dynamic model of time-dependent complex networks.

PubMed

Hill, Scott A; Braha, Dan

2010-10-01

The characterization of the "most connected" nodes in static or slowly evolving complex networks has helped in understanding and predicting the behavior of social, biological, and technological networked systems, including their robustness against failures, vulnerability to deliberate attacks, and diffusion properties. However, recent empirical research of large dynamic networks (characterized by irregular connections that evolve rapidly) has demonstrated that there is little continuity in degree centrality of nodes over time, even when their degree distributions follow a power law. This unexpected dynamic centrality suggests that the connections in these systems are not driven by preferential attachment or other known mechanisms. We present an approach to explain real-world dynamic networks and qualitatively reproduce these dynamic centrality phenomena. This approach is based on a dynamic preferential attachment mechanism, which exhibits a sharp transition from a base pure random walk scheme.

Application of dynamic recurrent neural networks in nonlinear system identification

NASA Astrophysics Data System (ADS)

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

2006-11-01

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

Recovery time after localized perturbations in complex dynamical networks

NASA Astrophysics Data System (ADS)

Mitra, Chiranjit; Kittel, Tim; Choudhary, Anshul; Kurths, Jürgen; Donner, Reik V.

2017-10-01

Maintaining the synchronous motion of dynamical systems interacting on complex networks is often critical to their functionality. However, real-world networked dynamical systems operating synchronously are prone to random perturbations driving the system to arbitrary states within the corresponding basin of attraction, thereby leading to epochs of desynchronized dynamics with a priori unknown durations. Thus, it is highly relevant to have an estimate of the duration of such transient phases before the system returns to synchrony, following a random perturbation to the dynamical state of any particular node of the network. We address this issue here by proposing the framework of single-node recovery time (SNRT) which provides an estimate of the relative time scales underlying the transient dynamics of the nodes of a network during its restoration to synchrony. We utilize this in differentiating the particularly slow nodes of the network from the relatively fast nodes, thus identifying the critical nodes which when perturbed lead to significantly enlarged recovery time of the system before resuming synchronized operation. Further, we reveal explicit relationships between the SNRT values of a network, and its global relaxation time when starting all the nodes from random initial conditions. Earlier work on relaxation time generally focused on investigating its dependence on macroscopic topological properties of the respective network. However, we employ the proposed concept for deducing microscopic relationships between topological features of nodes and their respective SNRT values. The framework of SNRT is further extended to a measure of resilience of the different nodes of a networked dynamical system. We demonstrate the potential of SNRT in networks of Rössler oscillators on paradigmatic topologies and a model of the power grid of the United Kingdom with second-order Kuramoto-type nodal dynamics illustrating the conceivable practical applicability of the proposed concept.

Models, Entropy and Information of Temporal Social Networks

NASA Astrophysics Data System (ADS)

Zhao, Kun; Karsai, Márton; Bianconi, Ginestra

Temporal social networks are characterized by heterogeneous duration of contacts, which can either follow a power-law distribution, such as in face-to-face interactions, or a Weibull distribution, such as in mobile-phone communication. Here we model the dynamics of face-to-face interaction and mobile phone communication by a reinforcement dynamics, which explains the data observed in these different types of social interactions. We quantify the information encoded in the dynamics of these networks by the entropy of temporal networks. Finally, we show evidence that human dynamics is able to modulate the information present in social network dynamics when it follows circadian rhythms and when it is interfacing with a new technology such as the mobile-phone communication technology.

A network of networks.

PubMed

Iedema, Rick; Verma, Raj; Wutzke, Sonia; Lyons, Nigel; McCaughan, Brian

2017-04-10

Purpose To further our insight into the role of networks in health system reform, the purpose of this paper is to investigate how one agency, the NSW Agency for Clinical Innovation (ACI), and the multiple networks and enabling resources that it encompasses, govern, manage and extend the potential of networks for healthcare practice improvement. Design/methodology/approach This is a case study investigation which took place over ten months through the first author's participation in network activities and discussions with the agency's staff about their main objectives, challenges and achievements, and with selected services around the state of New South Wales to understand the agency's implementation and large system transformation activities. Findings The paper demonstrates that ACI accommodates multiple networks whose oversight structures, self-organisation and systems change approaches combined in dynamic ways, effectively yield a diversity of network governances. Further, ACI bears out a paradox of "centralised decentralisation", co-locating agents of innovation with networks of implementation and evaluation expertise. This arrangement strengthens and legitimates the role of the strategic hybrid - the healthcare professional in pursuit of change and improvement, and enhances their influence and impact on the wider system. Research limitations/implications While focussing the case study on one agency only, this study is unique as it highlights inter-network connections. Contributing to the literature on network governance, this paper identifies ACI as a "network of networks" through which resources, expectations and stakeholder dynamics are dynamically and flexibly mediated and enhanced. Practical implications The co-location of and dynamic interaction among clinical networks may create synergies among networks, nurture "strategic hybrids", and enhance the impact of network activities on health system reform. Social implications Network governance requires more from network members than participation in a single network, as it involves health service professionals and consumers in a multi-network dynamic. This dynamic requires deliberations and collaborations to be flexible, and it increasingly positions members as "strategic hybrids" - people who have moved on from singular taken-as-given stances and identities, towards hybrid positionings and flexible perspectives. Originality/value This paper is novel in that it identifies a critical feature of health service reform and large system transformation: network governance is empowered through the dynamic co-location of and collaboration among healthcare networks, particularly when complemented with "enabler" teams of people specialising in programme implementation and evaluation.

Synchronization transition in neuronal networks composed of chaotic or non-chaotic oscillators.

PubMed

Xu, Kesheng; Maidana, Jean Paul; Castro, Samy; Orio, Patricio

2018-05-30

Chaotic dynamics has been shown in the dynamics of neurons and neural networks, in experimental data and numerical simulations. Theoretical studies have proposed an underlying role of chaos in neural systems. Nevertheless, whether chaotic neural oscillators make a significant contribution to network behaviour and whether the dynamical richness of neural networks is sensitive to the dynamics of isolated neurons, still remain open questions. We investigated synchronization transitions in heterogeneous neural networks of neurons connected by electrical coupling in a small world topology. The nodes in our model are oscillatory neurons that - when isolated - can exhibit either chaotic or non-chaotic behaviour, depending on conductance parameters. We found that the heterogeneity of firing rates and firing patterns make a greater contribution than chaos to the steepness of the synchronization transition curve. We also show that chaotic dynamics of the isolated neurons do not always make a visible difference in the transition to full synchrony. Moreover, macroscopic chaos is observed regardless of the dynamics nature of the neurons. However, performing a Functional Connectivity Dynamics analysis, we show that chaotic nodes can promote what is known as multi-stable behaviour, where the network dynamically switches between a number of different semi-synchronized, metastable states.

Nuclear charge radii: density functional theory meets Bayesian neural networks

NASA Astrophysics Data System (ADS)

Utama, R.; Chen, Wei-Chia; Piekarewicz, J.

2016-11-01

The distribution of electric charge in atomic nuclei is fundamental to our understanding of the complex nuclear dynamics and a quintessential observable to validate nuclear structure models. The aim of this study is to explore a novel approach that combines sophisticated models of nuclear structure with Bayesian neural networks (BNN) to generate predictions for the charge radii of thousands of nuclei throughout the nuclear chart. A class of relativistic energy density functionals is used to provide robust predictions for nuclear charge radii. In turn, these predictions are refined through Bayesian learning for a neural network that is trained using residuals between theoretical predictions and the experimental data. Although predictions obtained with density functional theory provide a fairly good description of experiment, our results show significant improvement (better than 40%) after BNN refinement. Moreover, these improved results for nuclear charge radii are supplemented with theoretical error bars. We have successfully demonstrated the ability of the BNN approach to significantly increase the accuracy of nuclear models in the predictions of nuclear charge radii. However, as many before us, we failed to uncover the underlying physics behind the intriguing behavior of charge radii along the calcium isotopic chain.

Electron Heat Flux in Pressure Balance Structures at Ulysses

NASA Technical Reports Server (NTRS)

Yamauchi, Yohei; Suess, Steven T.; Sakurai, Takashi; Whitaker, Ann F. (Technical Monitor)

2001-01-01

Pressure balance structures (PBSs) are a common feature in the high-latitude solar wind near solar minimum. Rom previous studies, PBSs are believed to be remnants of coronal plumes and be related to network activity such as magnetic reconnection in the photosphere. We investigated the magnetic structures of the PBSs, applying a minimum variance analysis to Ulysses/Magnetometer data. At 2001 AGU Spring meeting, we reported that PBSs have structures like current sheets or plasmoids, and suggested that they are associated with network activity at the base of polar plumes. In this paper, we have analyzed high-energy electron data at Ulysses/SWOOPS to see whether bi-directional electron flow exists and confirm the conclusions more precisely. As a result, although most events show a typical flux directed away from the Sun, we have obtained evidence that some PBSs show bi-directional electron flux and others show an isotropic distribution of electron pitch angles. The evidence shows that plasmoids are flowing away from the Sun, changing their flow direction dynamically in a way not caused by Alfven waves. From this, we have concluded that PBSs are generated due to network activity at the base of polar plumes and their magnetic structures axe current sheets or plasmoids.

Controllability of flow-conservation networks

NASA Astrophysics Data System (ADS)

Zhao, Chen; Zeng, An; Jiang, Rui; Yuan, Zhengzhong; Wang, Wen-Xu

2017-07-01

The ultimate goal of exploring complex networks is to control them. As such, controllability of complex networks has been intensively investigated. Despite recent advances in studying the impact of a network's topology on its controllability, a comprehensive understanding of the synergistic impact of network topology and dynamics on controllability is still lacking. Here, we explore the controllability of flow-conservation networks, trying to identify the minimal number of driver nodes that can guide the network to any desirable state. We develop a method to analyze the controllability on flow-conservation networks based on exact controllability theory, transforming the original analysis on adjacency matrix to Laplacian matrix. With this framework, we systematically investigate the impact of some key factors of networks, including link density, link directionality, and link polarity, on the controllability of these networks. We also obtain the analytical equations by investigating the network's structural properties approximatively and design the efficient tools. Finally, we consider some real networks with flow dynamics, finding that their controllability is significantly different from that predicted by only considering the topology. These findings deepen our understanding of network controllability with flow-conservation dynamics and provide a general framework to incorporate real dynamics in the analysis of network controllability.

BioJazz: in silico evolution of cellular networks with unbounded complexity using rule-based modeling.

PubMed

Feng, Song; Ollivier, Julien F; Swain, Peter S; Soyer, Orkun S

2015-10-30

Systems biologists aim to decipher the structure and dynamics of signaling and regulatory networks underpinning cellular responses; synthetic biologists can use this insight to alter existing networks or engineer de novo ones. Both tasks will benefit from an understanding of which structural and dynamic features of networks can emerge from evolutionary processes, through which intermediary steps these arise, and whether they embody general design principles. As natural evolution at the level of network dynamics is difficult to study, in silico evolution of network models can provide important insights. However, current tools used for in silico evolution of network dynamics are limited to ad hoc computer simulations and models. Here we introduce BioJazz, an extendable, user-friendly tool for simulating the evolution of dynamic biochemical networks. Unlike previous tools for in silico evolution, BioJazz allows for the evolution of cellular networks with unbounded complexity by combining rule-based modeling with an encoding of networks that is akin to a genome. We show that BioJazz can be used to implement biologically realistic selective pressures and allows exploration of the space of network architectures and dynamics that implement prescribed physiological functions. BioJazz is provided as an open-source tool to facilitate its further development and use. Source code and user manuals are available at: http://oss-lab.github.io/biojazz and http://osslab.lifesci.warwick.ac.uk/BioJazz.aspx. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

Exploring the structure and function of temporal networks with dynamic graphlets

PubMed Central

Hulovatyy, Y.; Chen, H.; Milenković, T.

2015-01-01

Motivation: With increasing availability of temporal real-world networks, how to efficiently study these data? One can model a temporal network as a single aggregate static network, or as a series of time-specific snapshots, each being an aggregate static network over the corresponding time window. Then, one can use established methods for static analysis on the resulting aggregate network(s), but losing in the process valuable temporal information either completely, or at the interface between different snapshots, respectively. Here, we develop a novel approach for studying a temporal network more explicitly, by capturing inter-snapshot relationships. Results: We base our methodology on well-established graphlets (subgraphs), which have been proven in numerous contexts in static network research. We develop new theory to allow for graphlet-based analyses of temporal networks. Our new notion of dynamic graphlets is different from existing dynamic network approaches that are based on temporal motifs (statistically significant subgraphs). The latter have limitations: their results depend on the choice of a null network model that is required to evaluate the significance of a subgraph, and choosing a good null model is non-trivial. Our dynamic graphlets overcome the limitations of the temporal motifs. Also, when we aim to characterize the structure and function of an entire temporal network or of individual nodes, our dynamic graphlets outperform the static graphlets. Clearly, accounting for temporal information helps. We apply dynamic graphlets to temporal age-specific molecular network data to deepen our limited knowledge about human aging. Availability and implementation: http://www.nd.edu/∼cone/DG. Contact: tmilenko@nd.edu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:26072480

Representing Micro-Macro Linkages by Actor-Based Dynamic Network Models

PubMed Central

Snijders, Tom A.B.; Steglich, Christian E.G.

2014-01-01

Stochastic actor-based models for network dynamics have the primary aim of statistical inference about processes of network change, but may be regarded as a kind of agent-based models. Similar to many other agent-based models, they are based on local rules for actor behavior. Different from many other agent-based models, by including elements of generalized linear statistical models they aim to be realistic detailed representations of network dynamics in empirical data sets. Statistical parallels to micro-macro considerations can be found in the estimation of parameters determining local actor behavior from empirical data, and the assessment of goodness of fit from the correspondence with network-level descriptives. This article studies several network-level consequences of dynamic actor-based models applied to represent cross-sectional network data. Two examples illustrate how network-level characteristics can be obtained as emergent features implied by micro-specifications of actor-based models. PMID:25960578

Using Network Dynamical Influence to Drive Consensus

NASA Astrophysics Data System (ADS)

Punzo, Giuliano; Young, George F.; MacDonald, Malcolm; Leonard, Naomi E.

2016-05-01

Consensus and decision-making are often analysed in the context of networks, with many studies focusing attention on ranking the nodes of a network depending on their relative importance to information routing. Dynamical influence ranks the nodes with respect to their ability to influence the evolution of the associated network dynamical system. In this study it is shown that dynamical influence not only ranks the nodes, but also provides a naturally optimised distribution of effort to steer a network from one state to another. An example is provided where the “steering” refers to the physical change in velocity of self-propelled agents interacting through a network. Distinct from other works on this subject, this study looks at directed and hence more general graphs. The findings are presented with a theoretical angle, without targeting particular applications or networked systems; however, the framework and results offer parallels with biological flocks and swarms and opportunities for design of technological networks.

Dynamic defense and network randomization for computer systems

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

Chavez, Adrian R.; Stout, William M. S.; Hamlet, Jason R.

The various technologies presented herein relate to determining a network attack is taking place, and further to adjust one or more network parameters such that the network becomes dynamically configured. A plurality of machine learning algorithms are configured to recognize an active attack pattern. Notification of the attack can be generated, and knowledge gained from the detected attack pattern can be utilized to improve the knowledge of the algorithms to detect a subsequent attack vector(s). Further, network settings and application communications can be dynamically randomized, wherein artificial diversity converts control systems into moving targets that help mitigate the early reconnaissancemore » stages of an attack. An attack(s) based upon a known static address(es) of a critical infrastructure network device(s) can be mitigated by the dynamic randomization. Network parameters that can be randomized include IP addresses, application port numbers, paths data packets navigate through the network, application randomization, etc.« less

April 27 2015 Water Cluster Leaders Meeting Report

EPA Science Inventory

The U.S. Environmental Protection Agency (EPA) partnered with the Water Economy Network (WEN) to host a Water Technology Innovation Cluster Leaders Meeting on April 27, 2015, in Pittsburgh, Pennsylvania. Approximately 75 individuals attended. The meeting was organized to bring to...

78 FR 12060 - Sunshine Act Meeting; Open Commission Meeting Wednesday, February 20, 2013

Federal Register 2010, 2011, 2012, 2013, 2014

2013-02-21

... accelerate the growth and expansion of new Wi-Fi technology offering consumers faster speeds and less network congestion at Wi-Fi hot spots. The meeting site is fully accessible to people using wheelchairs or other...

The U.S. Culture Collection Network Responding to the Requirements of the Nagoya Protocol on Access and Benefit Sharing

Treesearch

Kevin McCluskey; Katharine B. Barker; Hazel A. Barton; Kyria Boundy-Mills; Daniel R. Brown; Jonathan A. Coddington; Kevin Cook; Philippe Desmeth; David Geiser; Jessie A. Glaeser; Stephanie Greene; Seogchan Kang; Michael W. Lomas; Ulrich Melcher; Scott E. Miller; David R. Nobles; Kristina J. Owens; Jerome H. Reichman; Manuela da Silva; John Wertz; Cale Whitworth; David Smith; Steven E. Lindow

2017-01-01

The U.S. Culture Collection Network held a meeting to share information about how culture collections are responding to the requirements of the recently enacted Nagoya Protocol on Access to Genetic Resources and the Fair and Equitable Sharing of Benefits Arising from their Utilization to the Convention on Biological Diversity (CBD). The meeting included representatives...

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

PubMed

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

2018-06-01

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

ChainMail based neural dynamics modeling of soft tissue deformation for surgical simulation.

PubMed

Zhang, Jinao; Zhong, Yongmin; Smith, Julian; Gu, Chengfan

2017-07-20

Realistic and real-time modeling and simulation of soft tissue deformation is a fundamental research issue in the field of surgical simulation. In this paper, a novel cellular neural network approach is presented for modeling and simulation of soft tissue deformation by combining neural dynamics of cellular neural network with ChainMail mechanism. The proposed method formulates the problem of elastic deformation into cellular neural network activities to avoid the complex computation of elasticity. The local position adjustments of ChainMail are incorporated into the cellular neural network as the local connectivity of cells, through which the dynamic behaviors of soft tissue deformation are transformed into the neural dynamics of cellular neural network. Experiments demonstrate that the proposed neural network approach is capable of modeling the soft tissues' nonlinear deformation and typical mechanical behaviors. The proposed method not only improves ChainMail's linear deformation with the nonlinear characteristics of neural dynamics but also enables the cellular neural network to follow the principle of continuum mechanics to simulate soft tissue deformation.

Markov State Models of gene regulatory networks.

PubMed

Chu, Brian K; Tse, Margaret J; Sato, Royce R; Read, Elizabeth L

2017-02-06

Gene regulatory networks with dynamics characterized by multiple stable states underlie cell fate-decisions. Quantitative models that can link molecular-level knowledge of gene regulation to a global understanding of network dynamics have the potential to guide cell-reprogramming strategies. Networks are often modeled by the stochastic Chemical Master Equation, but methods for systematic identification of key properties of the global dynamics are currently lacking. The method identifies the number, phenotypes, and lifetimes of long-lived states for a set of common gene regulatory network models. Application of transition path theory to the constructed Markov State Model decomposes global dynamics into a set of dominant transition paths and associated relative probabilities for stochastic state-switching. In this proof-of-concept study, we found that the Markov State Model provides a general framework for analyzing and visualizing stochastic multistability and state-transitions in gene networks. Our results suggest that this framework-adopted from the field of atomistic Molecular Dynamics-can be a useful tool for quantitative Systems Biology at the network scale.

Disease dynamics in a dynamic social network

NASA Astrophysics Data System (ADS)

Christensen, Claire; Albert, István; Grenfell, Bryan; Albert, Réka

2010-07-01

We develop a framework for simulating a realistic, evolving social network (a city) into which a disease is introduced. We compare our results to prevaccine era measles data for England and Wales, and find that they capture the quantitative and qualitative features of epidemics in populations spanning two orders of magnitude. Our results provide unique insight into how and why the social topology of the contact network influences the propagation of the disease through the population. We argue that network simulation is suitable for concurrently probing contact network dynamics and disease dynamics in ways that prior modeling approaches cannot and it can be extended to the study of less well-documented diseases.

Near real-time traffic routing

NASA Technical Reports Server (NTRS)

Yang, Chaowei (Inventor); Xie, Jibo (Inventor); Zhou, Bin (Inventor); Cao, Ying (Inventor)

2012-01-01

A near real-time physical transportation network routing system comprising: a traffic simulation computing grid and a dynamic traffic routing service computing grid. The traffic simulator produces traffic network travel time predictions for a physical transportation network using a traffic simulation model and common input data. The physical transportation network is divided into a multiple sections. Each section has a primary zone and a buffer zone. The traffic simulation computing grid includes multiple of traffic simulation computing nodes. The common input data includes static network characteristics, an origin-destination data table, dynamic traffic information data and historical traffic data. The dynamic traffic routing service computing grid includes multiple dynamic traffic routing computing nodes and generates traffic route(s) using the traffic network travel time predictions.

Embedding dynamical networks into distributed models

NASA Astrophysics Data System (ADS)

Innocenti, Giacomo; Paoletti, Paolo

2015-07-01

Large networks of interacting dynamical systems are well-known for the complex behaviours they are able to display, even when each node features a quite simple dynamics. Despite examples of such networks being widespread both in nature and in technological applications, the interplay between the local and the macroscopic behaviour, through the interconnection topology, is still not completely understood. Moreover, traditional analytical methods for dynamical response analysis fail because of the intrinsically large dimension of the phase space of the network which makes the general problem intractable. Therefore, in this paper we develop an approach aiming to condense all the information in a compact description based on partial differential equations. By focusing on propagative phenomena, rigorous conditions under which the original network dynamical properties can be successfully analysed within the proposed framework are derived as well. A network of Fitzhugh-Nagumo systems is finally used to illustrate the effectiveness of the proposed method.

Clustering promotes switching dynamics in networks of noisy neurons

NASA Astrophysics Data System (ADS)

Franović, Igor; Klinshov, Vladimir

2018-02-01

Macroscopic variability is an emergent property of neural networks, typically manifested in spontaneous switching between the episodes of elevated neuronal activity and the quiescent episodes. We investigate the conditions that facilitate switching dynamics, focusing on the interplay between the different sources of noise and heterogeneity of the network topology. We consider clustered networks of rate-based neurons subjected to external and intrinsic noise and derive an effective model where the network dynamics is described by a set of coupled second-order stochastic mean-field systems representing each of the clusters. The model provides an insight into the different contributions to effective macroscopic noise and qualitatively indicates the parameter domains where switching dynamics may occur. By analyzing the mean-field model in the thermodynamic limit, we demonstrate that clustering promotes multistability, which gives rise to switching dynamics in a considerably wider parameter region compared to the case of a non-clustered network with sparse random connection topology.

Collective relaxation dynamics of small-world networks

NASA Astrophysics Data System (ADS)

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N , average degree k , and topological randomness q . We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q , including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

Collective relaxation dynamics of small-world networks.

PubMed

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N, average degree k, and topological randomness q. We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q, including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

On-line training of recurrent neural networks with continuous topology adaptation.

PubMed

Obradovic, D

1996-01-01

This paper presents an online procedure for training dynamic neural networks with input-output recurrences whose topology is continuously adjusted to the complexity of the target system dynamics. This is accomplished by changing the number of the elements of the network hidden layer whenever the existing topology cannot capture the dynamics presented by the new data. The training mechanism is based on the suitably altered extended Kalman filter (EKF) algorithm which is simultaneously used for the network parameter adjustment and for its state estimation. The network consists of a single hidden layer with Gaussian radial basis functions (GRBF), and a linear output layer. The choice of the GRBF is induced by the requirements of the online learning. The latter implies the network architecture which permits only local influence of the new data point in order not to forget the previously learned dynamics. The continuous topology adaptation is implemented in our algorithm to avoid memory and computational problems of using a regular grid of GRBF'S which covers the network input space. Furthermore, we show that the resulting parameter increase can be handled "smoothly" without interfering with the already acquired information. If the target system dynamics are changing over time, we show that a suitable forgetting factor can be used to "unlearn" the no longer-relevant dynamics. The quality of the recurrent network training algorithm is demonstrated on the identification of nonlinear dynamic systems.

AMPO Travel Modeling Working Group Meeting on Dynamic Traffic Assignment

DOT National Transportation Integrated Search

2016-03-01

On December 17-18, 2015, the Association of Metropolitan Planning Organizations (AMPO) convened a travel modeling working group meeting for the purpose of discussing Dynamic Traffic Assignment (DTA). Participants discussed the uses of DTA, challenges...

Automatic network coupling analysis for dynamical systems based on detailed kinetic models.

PubMed

Lebiedz, Dirk; Kammerer, Julia; Brandt-Pollmann, Ulrich

2005-10-01

We introduce a numerical complexity reduction method for the automatic identification and analysis of dynamic network decompositions in (bio)chemical kinetics based on error-controlled computation of a minimal model dimension represented by the number of (locally) active dynamical modes. Our algorithm exploits a generalized sensitivity analysis along state trajectories and subsequent singular value decomposition of sensitivity matrices for the identification of these dominant dynamical modes. It allows for a dynamic coupling analysis of (bio)chemical species in kinetic models that can be exploited for the piecewise computation of a minimal model on small time intervals and offers valuable functional insight into highly nonlinear reaction mechanisms and network dynamics. We present results for the identification of network decompositions in a simple oscillatory chemical reaction, time scale separation based model reduction in a Michaelis-Menten enzyme system and network decomposition of a detailed model for the oscillatory peroxidase-oxidase enzyme system.

Flory-Stockmayer analysis on reprocessable polymer networks

NASA Astrophysics Data System (ADS)

Li, Lingqiao; Chen, Xi; Jin, Kailong; Torkelson, John

Reprocessable polymer networks can undergo structure rearrangement through dynamic chemistries under proper conditions, making them a promising candidate for recyclable crosslinked materials, e.g. tires. This research field has been focusing on various chemistries. However, there has been lacking of an essential physical theory explaining the relationship between abundancy of dynamic linkages and reprocessability. Based on the classical Flory-Stockmayer analysis on network gelation, we developed a similar analysis on reprocessable polymer networks to quantitatively predict the critical condition for reprocessability. Our theory indicates that it is unnecessary for all bonds to be dynamic to make the resulting network reprocessable. As long as there is no percolated permanent network in the system, the material can fully rearrange. To experimentally validate our theory, we used a thiol-epoxy network model system with various dynamic linkage compositions. The stress relaxation behavior of resulting materials supports our theoretical prediction: only 50 % of linkages between crosslinks need to be dynamic for a tri-arm network to be reprocessable. Therefore, this analysis provides the first fundamental theoretical platform for designing and evaluating reprocessable polymer networks. We thank McCormick Research Catalyst Award Fund and ISEN cluster fellowship (L. L.) for funding support.

Complete characterization of the stability of cluster synchronization in complex dynamical networks.

PubMed

Sorrentino, Francesco; Pecora, Louis M; Hagerstrom, Aaron M; Murphy, Thomas E; Roy, Rajarshi

2016-04-01

Synchronization is an important and prevalent phenomenon in natural and engineered systems. In many dynamical networks, the coupling is balanced or adjusted to admit global synchronization, a condition called Laplacian coupling. Many networks exhibit incomplete synchronization, where two or more clusters of synchronization persist, and computational group theory has recently proved to be valuable in discovering these cluster states based on the topology of the network. In the important case of Laplacian coupling, additional synchronization patterns can exist that would not be predicted from the group theory analysis alone. Understanding how and when clusters form, merge, and persist is essential for understanding collective dynamics, synchronization, and failure mechanisms of complex networks such as electric power grids, distributed control networks, and autonomous swarming vehicles. We describe a method to find and analyze all of the possible cluster synchronization patterns in a Laplacian-coupled network, by applying methods of computational group theory to dynamically equivalent networks. We present a general technique to evaluate the stability of each of the dynamically valid cluster synchronization patterns. Our results are validated in an optoelectronic experiment on a five-node network that confirms the synchronization patterns predicted by the theory.

Random Evolution of Idiotypic Networks: Dynamics and Architecture

NASA Astrophysics Data System (ADS)

Brede, Markus; Behn, Ulrich

The paper deals with modelling a subsystem of the immune system, the so-called idiotypic network (INW). INWs, conceived by N.K. Jerne in 1974, are functional networks of interacting antibodies and B cells. In principle, Jernes' framework provides solutions to many issues in immunology, such as immunological memory, mechanisms for antigen recognition and self/non-self discrimination. Explaining the interconnection between the elementary components, local dynamics, network formation and architecture, and possible modes of global system function appears to be an ideal playground of statistical mechanics. We present a simple cellular automaton model, based on a graph representation of the system. From a simplified description of idiotypic interactions, rules for the random evolution of networks of occupied and empty sites on these graphs are derived. In certain biologically relevant parameter ranges the resultant dynamics leads to stationary states. A stationary state is found to correspond to a specific pattern of network organization. It turns out that even these very simple rules give rise to a multitude of different kinds of patterns. We characterize these networks by classifying `static' and `dynamic' network-patterns. A type of `dynamic' network is found to display many features of real INWs.

Resumption of dynamism in damaged networks of coupled oscillators

NASA Astrophysics Data System (ADS)

Kundu, Srilena; Majhi, Soumen; Ghosh, Dibakar

2018-05-01

Deterioration in dynamical activities may come up naturally or due to environmental influences in a massive portion of biological and physical systems. Such dynamical degradation may have outright effect on the substantive network performance. This requires us to provide some proper prescriptions to overcome undesired circumstances. In this paper, we present a scheme based on external feedback that can efficiently revive dynamism in damaged networks of active and inactive oscillators and thus enhance the network survivability. Both numerical and analytical investigations are performed in order to verify our claim. We also provide a comparative study on the effectiveness of this mechanism for feedbacks to the inactive group or to the active group only. Most importantly, resurrection of dynamical activity is realized even in time-delayed damaged networks, which are considered to be less persistent against deterioration in the form of inactivity in the oscillators. Furthermore, prominence in our approach is substantiated by providing evidence of enhanced network persistence in complex network topologies taking small-world and scale-free architectures, which makes the proposed remedy quite general. Besides the study in the network of Stuart-Landau oscillators, affirmative influence of external feedback has been justified in the network of chaotic Rössler systems as well.

Dynamical state of the network determines the efficacy of single neuron properties in shaping the network activity

PubMed Central

Sahasranamam, Ajith; Vlachos, Ioannis; Aertsen, Ad; Kumar, Arvind

2016-01-01

Spike patterns are among the most common electrophysiological descriptors of neuron types. Surprisingly, it is not clear how the diversity in firing patterns of the neurons in a network affects its activity dynamics. Here, we introduce the state-dependent stochastic bursting neuron model allowing for a change in its firing patterns independent of changes in its input-output firing rate relationship. Using this model, we show that the effect of single neuron spiking on the network dynamics is contingent on the network activity state. While spike bursting can both generate and disrupt oscillations, these patterns are ineffective in large regions of the network state space in changing the network activity qualitatively. Finally, we show that when single-neuron properties are made dependent on the population activity, a hysteresis like dynamics emerges. This novel phenomenon has important implications for determining the network response to time-varying inputs and for the network sensitivity at different operating points. PMID:27212008

Dynamical state of the network determines the efficacy of single neuron properties in shaping the network activity.

PubMed

Sahasranamam, Ajith; Vlachos, Ioannis; Aertsen, Ad; Kumar, Arvind

2016-05-23

Spike patterns are among the most common electrophysiological descriptors of neuron types. Surprisingly, it is not clear how the diversity in firing patterns of the neurons in a network affects its activity dynamics. Here, we introduce the state-dependent stochastic bursting neuron model allowing for a change in its firing patterns independent of changes in its input-output firing rate relationship. Using this model, we show that the effect of single neuron spiking on the network dynamics is contingent on the network activity state. While spike bursting can both generate and disrupt oscillations, these patterns are ineffective in large regions of the network state space in changing the network activity qualitatively. Finally, we show that when single-neuron properties are made dependent on the population activity, a hysteresis like dynamics emerges. This novel phenomenon has important implications for determining the network response to time-varying inputs and for the network sensitivity at different operating points.

Dynamics of subway networks based on vehicles operation timetable

NASA Astrophysics Data System (ADS)

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

2017-05-01

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

Discrete Dynamics Lab

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.

Generalized priority-queue network dynamics: Impact of team and hierarchy

NASA Astrophysics Data System (ADS)

Cho, Won-Kuk; Min, Byungjoon; Goh, K.-I.; Kim, I.-M.

2010-06-01

We study the effect of team and hierarchy on the waiting-time dynamics of priority-queue networks. To this end, we introduce generalized priority-queue network models incorporating interaction rules based on team-execution and hierarchy in decision making, respectively. It is numerically found that the waiting-time distribution exhibits a power law for long waiting times in both cases, yet with different exponents depending on the team size and the position of queue nodes in the hierarchy, respectively. The observed power-law behaviors have in many cases a corresponding single or pairwise-interacting queue dynamics, suggesting that the pairwise interaction may constitute a major dynamic consequence in the priority-queue networks. It is also found that the reciprocity of influence is a relevant factor for the priority-queue network dynamics.

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.

Spatial-temporal-spectral EEG patterns of BOLD functional network connectivity dynamics

NASA Astrophysics Data System (ADS)

Lamoš, Martin; Mareček, Radek; Slavíček, Tomáš; Mikl, Michal; Rektor, Ivan; Jan, Jiří

2018-06-01

Objective. Growing interest in the examination of large-scale brain network functional connectivity dynamics is accompanied by an effort to find the electrophysiological correlates. The commonly used constraints applied to spatial and spectral domains during electroencephalogram (EEG) data analysis may leave part of the neural activity unrecognized. We propose an approach that blindly reveals multimodal EEG spectral patterns that are related to the dynamics of the BOLD functional network connectivity. Approach. The blind decomposition of EEG spectrogram by parallel factor analysis has been shown to be a useful technique for uncovering patterns of neural activity. The simultaneously acquired BOLD fMRI data were decomposed by independent component analysis. Dynamic functional connectivity was computed on the component’s time series using a sliding window correlation, and between-network connectivity states were then defined based on the values of the correlation coefficients. ANOVA tests were performed to assess the relationships between the dynamics of between-network connectivity states and the fluctuations of EEG spectral patterns. Main results. We found three patterns related to the dynamics of between-network connectivity states. The first pattern has dominant peaks in the alpha, beta, and gamma bands and is related to the dynamics between the auditory, sensorimotor, and attentional networks. The second pattern, with dominant peaks in the theta and low alpha bands, is related to the visual and default mode network. The third pattern, also with peaks in the theta and low alpha bands, is related to the auditory and frontal network. Significance. Our previous findings revealed a relationship between EEG spectral pattern fluctuations and the hemodynamics of large-scale brain networks. In this study, we suggest that the relationship also exists at the level of functional connectivity dynamics among large-scale brain networks when no standard spatial and spectral constraints are applied on the EEG data.

Hydrodynamically induced oscillations and traffic dynamics in 1D microfludic networks

NASA Astrophysics Data System (ADS)

Bartolo, Denis; Jeanneret, Raphael

2011-03-01

We report on the traffic dynamics of particles driven through a minimal microfluidic network. Even in the minimal network consisting in a single loop, the traffic dynamics has proven to yield complex temporal patterns, including periodic, multi-periodic or chaotic sequences. This complex dynamics arises from the strongly nonlinear hydrodynamic interactions between the particles, that takes place at a junction. To better understand the consequences of this nontrivial coupling, we combined theoretical, numerical and experimental efforts and solved the 3-body problem in a 1D loop network. This apparently simple dynamical system revealed a rich and unexpected dynamics, including coherent spontaneous oscillations along closed orbits. Striking similarities between Hamiltonian systems and this driven dissipative system will be explained.

Key Issues in the Networking Field Today. Proceedings of the Library of Congress Network Advisory Committee Meeting (Washington, DC, May 6-8, 1985). Network Planning Paper No. 12.

ERIC Educational Resources Information Center

Library of Congress, Washington, DC. Network Development Office.

The May 1985 program session of the Library of Congress Network Advisory Committee focused on the identification of key issues in the networking field. Presentations included discussions of major network developments in the last two decades, the changing network players, the impact of technology on networks, and library networks and the law. The…

A dynamic network model for interbank market

NASA Astrophysics Data System (ADS)

Xu, Tao; He, Jianmin; Li, Shouwei

2016-12-01

In this paper, a dynamic network model based on agent behavior is introduced to explain the formation mechanism of interbank market network. We investigate the impact of credit lending preference on interbank market network topology, the evolution of interbank market network and stability of interbank market. Experimental results demonstrate that interbank market network is a small-world network and cumulative degree follows the power-law distribution. We find that the interbank network structure keeps dynamic stability in the network evolution process. With the increase of bank credit lending preference, network clustering coefficient increases and average shortest path length decreases monotonously, which improves the stability of the network structure. External shocks are main threats for the interbank market and the reduction of bank external investment yield rate and deposits fluctuations contribute to improve the resilience of the banking system.

Construction and analysis of gene-gene dynamics influence networks based on a Boolean model.

PubMed

Mazaya, Maulida; Trinh, Hung-Cuong; Kwon, Yung-Keun

2017-12-21

Identification of novel gene-gene relations is a crucial issue to understand system-level biological phenomena. To this end, many methods based on a correlation analysis of gene expressions or structural analysis of molecular interaction networks have been proposed. They have a limitation in identifying more complicated gene-gene dynamical relations, though. To overcome this limitation, we proposed a measure to quantify a gene-gene dynamical influence (GDI) using a Boolean network model and constructed a GDI network to indicate existence of a dynamical influence for every ordered pair of genes. It represents how much a state trajectory of a target gene is changed by a knockout mutation subject to a source gene in a gene-gene molecular interaction (GMI) network. Through a topological comparison between GDI and GMI networks, we observed that the former network is denser than the latter network, which implies that there exist many gene pairs of dynamically influencing but molecularly non-interacting relations. In addition, a larger number of hub genes were generated in the GDI network. On the other hand, there was a correlation between these networks such that the degree value of a node was positively correlated to each other. We further investigated the relationships of the GDI value with structural properties and found that there are negative and positive correlations with the length of a shortest path and the number of paths, respectively. In addition, a GDI network could predict a set of genes whose steady-state expression is affected in E. coli gene-knockout experiments. More interestingly, we found that the drug-targets with side-effects have a larger number of outgoing links than the other genes in the GDI network, which implies that they are more likely to influence the dynamics of other genes. Finally, we found biological evidences showing that the gene pairs which are not molecularly interacting but dynamically influential can be considered for novel gene-gene relationships. Taken together, construction and analysis of the GDI network can be a useful approach to identify novel gene-gene relationships in terms of the dynamical influence.

Exploring Social Networking Technologies as Tools for HIV Prevention for Men Who Have Sex With Men.

PubMed

Ramallo, Jorge; Kidder, Thomas; Albritton, Tashuna; Blick, Gary; Pachankis, John; Grandelski, Valen; Grandeleski, Valen; Kershaw, Trace

2015-08-01

Social networking technologies are influential among men who have sex with men (MSM) and may be an important strategy for HIV prevention. We conducted focus groups with HIV positive and negative participants. Almost all participants used social networking sites to meet new friends and sexual partners. The main obstacle to effective HIV prevention campaigns in social networking platforms was stigmatization based on homosexuality as well as HIV status. Persistent stigma associated with HIV status and disclosure was cited as a top reason for avoiding HIV-related conversations while meeting new partners using social technologies. Further, social networking sites have different social etiquettes and rules that may increase HIV risk by discouraging HIV status disclosure. Overall, successful interventions for MSM using social networking technologies must consider aspects of privacy, stigma, and social norms in order to enact HIV reduction among MSM.

EXPLORING SOCIAL NETWORKING TECHNOLOGIES AS TOOLS FOR HIV PREVENTION FOR MEN WHO HAVE SEX WITH MEN

PubMed Central

Ramallo, Jorge; Kidder, Thomas; Albritton, Tashuna; Blick, Gary; Pachankis, John; Grandelski, Valen; Kershaw, Trace

2017-01-01

Social networking technologies are influential among men who have sex with men (MSM) and may be an important strategy for HIV prevention. We conducted focus groups with HIV positive and negative participants. Almost all participants used social networking sites to meet new friends and sexual partners. The main obstacle to effective HIV prevention campaigns in social networking platforms was stigmatization based on homosexuality as well as HIV status. Persistent stigma associated with HIV status and disclosure was cited as a top reason for avoiding HIV-related conversations while meeting new partners using social technologies. Further, social networking sites have different social etiquettes and rules that may increase HIV risk by discouraging HIV status disclosure. Overall, successful interventions for MSM using social networking technologies must consider aspects of privacy, stigma, and social norms in order to enact HIV reduction among MSM. PMID:26241381

Counting motifs in dynamic networks.

PubMed

Mukherjee, Kingshuk; Hasan, Md Mahmudul; Boucher, Christina; Kahveci, Tamer

2018-04-11

A network motif is a sub-network that occurs frequently in a given network. Detection of such motifs is important since they uncover functions and local properties of the given biological network. Finding motifs is however a computationally challenging task as it requires solving the costly subgraph isomorphism problem. Moreover, the topology of biological networks change over time. These changing networks are called dynamic biological networks. As the network evolves, frequency of each motif in the network also changes. Computing the frequency of a given motif from scratch in a dynamic network as the network topology evolves is infeasible, particularly for large and fast evolving networks. In this article, we design and develop a scalable method for counting the number of motifs in a dynamic biological network. Our method incrementally updates the frequency of each motif as the underlying network's topology evolves. Our experiments demonstrate that our method can update the frequency of each motif in orders of magnitude faster than counting the motif embeddings every time the network changes. If the network evolves more frequently, the margin with which our method outperforms the existing static methods, increases. We evaluated our method extensively using synthetic and real datasets, and show that our method is highly accurate(≥ 96%) and that it can be scaled to large dense networks. The results on real data demonstrate the utility of our method in revealing interesting insights on the evolution of biological processes.

Dynamics and control of state-dependent networks for probing genomic organization

PubMed Central

Rajapakse, Indika; Groudine, Mark; Mesbahi, Mehran

2011-01-01

A state-dependent dynamic network is a collection of elements that interact through a network, whose geometry evolves as the state of the elements changes over time. The genome is an intriguing example of a state-dependent network, where chromosomal geometry directly relates to genomic activity, which in turn strongly correlates with geometry. Here we examine various aspects of a genomic state-dependent dynamic network. In particular, we elaborate on one of the important ramifications of viewing genomic networks as being state-dependent, namely, their controllability during processes of genomic reorganization such as in cell differentiation. PMID:21911407

Dynamic burstiness of word-occurrence and network modularity in textbook systems

NASA Astrophysics Data System (ADS)

Cui, Xue-Mei; Yoon, Chang No; Youn, Hyejin; Lee, Sang Hoon; Jung, Jean S.; Han, Seung Kee

2017-12-01

We show that the dynamic burstiness of word occurrence in textbook systems is attributed to the modularity of the word association networks. At first, a measure of dynamic burstiness is introduced to quantify burstiness of word occurrence in a textbook. The advantage of this measure is that the dynamic burstiness is decomposable into two contributions: one coming from the inter-event variance and the other from the memory effects. Comparing network structures of physics textbook systems with those of surrogate random textbooks without the memory or variance effects are absent, we show that the network modularity increases systematically with the dynamic burstiness. The intra-connectivity of individual word representing the strength of a tie with which a node is bound to a module accordingly increases with the dynamic burstiness, suggesting individual words with high burstiness are strongly bound to one module. Based on the frequency and dynamic burstiness, physics terminology is classified into four categories: fundamental words, topical words, special words, and common words. In addition, we test the correlation between the dynamic burstiness of word occurrence and network modularity using a two-state model of burst generation.

A Mathematical Model to study the Dynamics of Epithelial Cellular Networks

PubMed Central

Abate, Alessandro; Vincent, Stéphane; Dobbe, Roel; Silletti, Alberto; Master, Neal; Axelrod, Jeffrey D.; Tomlin, Claire J.

2013-01-01

Epithelia are sheets of connected cells that are essential across the animal kingdom. Experimental observations suggest that the dynamical behavior of many single-layered epithelial tissues has strong analogies with that of specific mechanical systems, namely large networks consisting of point masses connected through spring-damper elements and undergoing the influence of active and dissipating forces. Based on this analogy, this work develops a modeling framework to enable the study of the mechanical properties and of the dynamic behavior of large epithelial cellular networks. The model is built first by creating a network topology that is extracted from the actual cellular geometry as obtained from experiments, then by associating a mechanical structure and dynamics to the network via spring-damper elements. This scalable approach enables running simulations of large network dynamics: the derived modeling framework in particular is predisposed to be tailored to study general dynamics (for example, morphogenesis) of various classes of single-layered epithelial cellular networks. In this contribution we test the model on a case study of the dorsal epithelium of the Drosophila melanogaster embryo during early dorsal closure (and, less conspicuously, germband retraction). PMID:23221083

76 FR 6807 - Notice of Meeting; NIAID Town Hall Meeting on the New National Institute of Allergy and...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-02-08

... Town Hall Meeting on the New National Institute of Allergy and Infectious Diseases (NIAID) Leadership... plans to establish a new NIAID Leadership Group for a Clinical Research Network on Infectious Diseases... not previously available to non-AIDS investigators. At the March 7, 2011 meeting NIAID leadership will...

Functional connectivity dynamics during film viewing reveal common networks for different emotional experiences.

PubMed

Raz, Gal; Touroutoglou, Alexandra; Wilson-Mendenhall, Christine; Gilam, Gadi; Lin, Tamar; Gonen, Tal; Jacob, Yael; Atzil, Shir; Admon, Roee; Bleich-Cohen, Maya; Maron-Katz, Adi; Hendler, Talma; Barrett, Lisa Feldman

2016-08-01

Recent theoretical and empirical work has highlighted the role of domain-general, large-scale brain networks in generating emotional experiences. These networks are hypothesized to process aspects of emotional experiences that are not unique to a specific emotional category (e.g., "sadness," "happiness"), but rather that generalize across categories. In this article, we examined the dynamic interactions (i.e., changing cohesiveness) between specific domain-general networks across time while participants experienced various instances of sadness, fear, and anger. We used a novel method for probing the network connectivity dynamics between two salience networks and three amygdala-based networks. We hypothesized, and found, that the functional connectivity between these networks covaried with the intensity of different emotional experiences. Stronger connectivity between the dorsal salience network and the medial amygdala network was associated with more intense ratings of emotional experience across six different instances of the three emotion categories examined. Also, stronger connectivity between the dorsal salience network and the ventrolateral amygdala network was associated with more intense ratings of emotional experience across five out of the six different instances. Our findings demonstrate that a variety of emotional experiences are associated with dynamic interactions of domain-general neural systems.

Predicting the Lifetime of Dynamic Networks Experiencing Persistent Random Attacks.

PubMed

Podobnik, Boris; Lipic, Tomislav; Horvatic, Davor; Majdandzic, Antonio; Bishop, Steven R; Eugene Stanley, H

2015-09-21

Estimating the critical points at which complex systems abruptly flip from one state to another is one of the remaining challenges in network science. Due to lack of knowledge about the underlying stochastic processes controlling critical transitions, it is widely considered difficult to determine the location of critical points for real-world networks, and it is even more difficult to predict the time at which these potentially catastrophic failures occur. We analyse a class of decaying dynamic networks experiencing persistent failures in which the magnitude of the overall failure is quantified by the probability that a potentially permanent internal failure will occur. When the fraction of active neighbours is reduced to a critical threshold, cascading failures can trigger a total network failure. For this class of network we find that the time to network failure, which is equivalent to network lifetime, is inversely dependent upon the magnitude of the failure and logarithmically dependent on the threshold. We analyse how permanent failures affect network robustness using network lifetime as a measure. These findings provide new methodological insight into system dynamics and, in particular, of the dynamic processes of networks. We illustrate the network model by selected examples from biology, and social science.

Structurally Dynamic Spin Market Networks

NASA Astrophysics Data System (ADS)

Horváth, Denis; Kuscsik, Zoltán

The agent-based model of stock price dynamics on a directed evolving complex network is suggested and studied by direct simulation. The stationary regime is maintained as a result of the balance between the extremal dynamics, adaptivity of strategic variables and reconnection rules. The inherent structure of node agent "brain" is modeled by a recursive neural network with local and global inputs and feedback connections. For specific parametric combination the complex network displays small-world phenomenon combined with scale-free behavior. The identification of a local leader (network hub, agent whose strategies are frequently adapted by its neighbors) is carried out by repeated random walk process through network. The simulations show empirically relevant dynamics of price returns and volatility clustering. The additional emerging aspects of stylized market statistics are Zipfian distributions of fitness.

Network of Women in Higher Education in the Pacific (NetWHEP). Report of Meeting of September 28-October 1, 1996.

ERIC Educational Resources Information Center

Network of Women in Higher Education in the Pacific, Suva (Fiji).

This report of a meeting of the Network of Women in Higher Education in the Pacific (NetWHEP) contains transcripts of major addresses, a copy of the program, statistics and summary information relating to the status of women in higher education for nine countries, and general information about the NetWHEP organization. Included are: a transcript…

Educating the Adult Educator: Quality Provision and Assessment in Europe. ESREA|ReNAdET e-Book Conference Proceedings (1st, Thessaloniki, Greece, November 6-8, 2009)

ERIC Educational Resources Information Center

Papastamatis, Adamantios, Ed; Valkanos, Efthymios, Ed.; Zarifis, Georgios K., Ed.; Panitsidou, Eugenia, Ed.

2009-01-01

This e-book contains the proceedings of the inaugural meeting of the ESREA Network on Adult Educators, Trainers and their Professional Development (ReNAdET): Educating the adult educator - Quality provision and assessment in Europe. The network's first conference meeting was held in Thessaloniki, Greece (6-8 November 2009) at the University of…

Improving resolution of dynamic communities in human brain networks through targeted node removal

PubMed Central

Turner, Benjamin O.; Miller, Michael B.; Carlson, Jean M.

2017-01-01

Current approaches to dynamic community detection in complex networks can fail to identify multi-scale community structure, or to resolve key features of community dynamics. We propose a targeted node removal technique to improve the resolution of community detection. Using synthetic oscillator networks with well-defined “ground truth” communities, we quantify the community detection performance of a common modularity maximization algorithm. We show that the performance of the algorithm on communities of a given size deteriorates when these communities are embedded in multi-scale networks with communities of different sizes, compared to the performance in a single-scale network. We demonstrate that targeted node removal during community detection improves performance on multi-scale networks, particularly when removing the most functionally cohesive nodes. Applying this approach to network neuroscience, we compare dynamic functional brain networks derived from fMRI data taken during both repetitive single-task and varied multi-task experiments. After the removal of regions in visual cortex, the most coherent functional brain area during the tasks, community detection is better able to resolve known functional brain systems into communities. In addition, node removal enables the algorithm to distinguish clear differences in brain network dynamics between these experiments, revealing task-switching behavior that was not identified with the visual regions present in the network. These results indicate that targeted node removal can improve spatial and temporal resolution in community detection, and they demonstrate a promising approach for comparison of network dynamics between neuroscientific data sets with different resolution parameters. PMID:29261662

Linking Behavior in the Physics Education Research Coauthorship Network

ERIC Educational Resources Information Center

Anderson, Katharine A.; Crespi, Matthew; Sayre, Eleanor C.

2017-01-01

There is considerable long-term interest in understanding the dynamics of collaboration networks, and how these networks form and evolve over time. Most of the work done on the dynamics of social networks focuses on well-established communities. Work examining emerging social networks is rarer, simply because data are difficult to obtain in real…

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.

Implantable fiber-optic interface for parallel multisite long-term optical dynamic brain interrogation in freely moving mice

PubMed Central

Doronina-Amitonova, L. V.; Fedotov, I. V.; Ivashkina, O. I.; Zots, M. A.; Fedotov, A. B.; Anokhin, K. V.; Zheltikov, A. M.

2013-01-01

Seeing the big picture of functional responses within large neural networks in a freely functioning brain is crucial for understanding the cellular mechanisms behind the higher nervous activity, including the most complex brain functions, such as cognition and memory. As a breakthrough toward meeting this challenge, implantable fiber-optic interfaces integrating advanced optogenetic technologies and cutting-edge fiber-optic solutions have been demonstrated, enabling a long-term optogenetic manipulation of neural circuits in freely moving mice. Here, we show that a specifically designed implantable fiber-optic interface provides a powerful tool for parallel long-term optical interrogation of distinctly separate, functionally different sites in the brain of freely moving mice. This interface allows the same groups of neurons lying deeply in the brain of a freely behaving mouse to be reproducibly accessed and optically interrogated over many weeks, providing a long-term dynamic detection of genome activity in response to a broad variety of pharmacological and physiological stimuli. PMID:24253232

Autophagy meets fused in sarcoma-positive stress granules.

PubMed

Matus, Soledad; Bosco, Daryl A; Hetz, Claudio

2014-12-01

Mutations in fused in sarcoma and/or translocated in liposarcoma (FUS, TLS or FUS) are linked to familial cases of amyotrophic lateral sclerosis (ALS). Mutant FUS selectively accumulates into discrete cytosolic structures known as stress granules under various stress conditions. In addition, mutant FUS expression can alter the dynamics and morphology of stress granules. Although the link between mutant FUS and stress granules is well established, the mechanisms modulating stress granule formation and disassembly in the context of ALS are poorly understood. In this issue of Neurobiology of Aging, Ryu et al. uncover the impact of autophagy on the potential toxicity of mutant FUS-positive stress granules. The authors provide evidence indicating that enhanced autophagy activity reduces the number of stress granules, which in the case of cells containing mutant FUS-positive stress granules, is neuroprotective. Overall, this study identifies an intersection between the proteostasis network and alterations in RNA metabolism in ALS through the dynamic assembly and disassembly of stress granules. Copyright © 2014 Elsevier Inc. All rights reserved.

BMI cyberworkstation: enabling dynamic data-driven brain-machine interface research through cyberinfrastructure.

PubMed

Zhao, Ming; Rattanatamrong, Prapaporn; DiGiovanna, Jack; Mahmoudi, Babak; Figueiredo, Renato J; Sanchez, Justin C; Príncipe, José C; Fortes, José A B

2008-01-01

Dynamic data-driven brain-machine interfaces (DDDBMI) have great potential to advance the understanding of neural systems and improve the design of brain-inspired rehabilitative systems. This paper presents a novel cyberinfrastructure that couples in vivo neurophysiology experimentation with massive computational resources to provide seamless and efficient support of DDDBMI research. Closed-loop experiments can be conducted with in vivo data acquisition, reliable network transfer, parallel model computation, and real-time robot control. Behavioral experiments with live animals are supported with real-time guarantees. Offline studies can be performed with various configurations for extensive analysis and training. A Web-based portal is also provided to allow users to conveniently interact with the cyberinfrastructure, conducting both experimentation and analysis. New motor control models are developed based on this approach, which include recursive least square based (RLS) and reinforcement learning based (RLBMI) algorithms. The results from an online RLBMI experiment shows that the cyberinfrastructure can successfully support DDDBMI experiments and meet the desired real-time requirements.

Implantable fiber-optic interface for parallel multisite long-term optical dynamic brain interrogation in freely moving mice

NASA Astrophysics Data System (ADS)

Doronina-Amitonova, L. V.; Fedotov, I. V.; Ivashkina, O. I.; Zots, M. A.; Fedotov, A. B.; Anokhin, K. V.; Zheltikov, A. M.

2013-11-01

Seeing the big picture of functional responses within large neural networks in a freely functioning brain is crucial for understanding the cellular mechanisms behind the higher nervous activity, including the most complex brain functions, such as cognition and memory. As a breakthrough toward meeting this challenge, implantable fiber-optic interfaces integrating advanced optogenetic technologies and cutting-edge fiber-optic solutions have been demonstrated, enabling a long-term optogenetic manipulation of neural circuits in freely moving mice. Here, we show that a specifically designed implantable fiber-optic interface provides a powerful tool for parallel long-term optical interrogation of distinctly separate, functionally different sites in the brain of freely moving mice. This interface allows the same groups of neurons lying deeply in the brain of a freely behaving mouse to be reproducibly accessed and optically interrogated over many weeks, providing a long-term dynamic detection of genome activity in response to a broad variety of pharmacological and physiological stimuli.

Due Date Assignment in a Dynamic Job Shop with the Orthogonal Kernel Least Squares Algorithm

NASA Astrophysics Data System (ADS)

Yang, D. H.; Hu, L.; Qian, Y.

2017-06-01

Meeting due dates is a key goal in the manufacturing industries. This paper proposes a method for due date assignment (DDA) by using the Orthogonal Kernel Least Squares Algorithm (OKLSA). A simulation model is built to imitate the production process of a highly dynamic job shop. Several factors describing job characteristics and system state are extracted as attributes to predict job flow-times. A number of experiments under conditions of varying dispatching rules and 90% shop utilization level have been carried out to evaluate the effectiveness of OKLSA applied for DDA. The prediction performance of OKLSA is compared with those of five conventional DDA models and back-propagation neural network (BPNN). The experimental results indicate that OKLSA is statistically superior to other DDA models in terms of mean absolute lateness and root mean squares lateness in most cases. The only exception occurs when the shortest processing time rule is used for dispatching jobs, the difference between OKLSA and BPNN is not statistically significant.

Systematic optimization of fed-batch simultaneous saccharification and fermentation at high-solid loading based on enzymatic hydrolysis and dynamic metabolic modeling of Saccharomyces cerevisiae.

PubMed

Unrean, Pornkamol; Khajeeram, Sutamat; Laoteng, Kobkul

2016-03-01

An integrative simultaneous saccharification and fermentation (SSF) modeling is a useful guiding tool for rapid process optimization to meet the techno-economic requirement of industrial-scale lignocellulosic ethanol production. In this work, we have developed the SSF model composing of a metabolic network of a Saccharomyces cerevisiae cell associated with fermentation kinetics and enzyme hydrolysis model to quantitatively capture dynamic responses of yeast cell growth and fermentation during SSF. By using model-based design of feeding profiles for substrate and yeast cell in the fed-batch SSF process, an efficient ethanol production with high titer of up to 65 g/L and high yield of 85 % of theoretical yield was accomplished. The ethanol titer and productivity was increased by 47 and 41 %, correspondingly, in optimized fed-batch SSF as compared to batch process. The developed integrative SSF model is, therefore, considered as a promising approach for systematic design of economical and sustainable SSF bioprocessing of lignocellulose.

An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

PubMed Central

Cabessa, Jérémie; Villa, Alessandro E. P.

2014-01-01

We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866

Meeting the memory challenges of brain-scale network simulation.

PubMed

Kunkel, Susanne; Potjans, Tobias C; Eppler, Jochen M; Plesser, Hans Ekkehard; Morrison, Abigail; Diesmann, Markus

2011-01-01

The development of high-performance simulation software is crucial for studying the brain connectome. Using connectome data to generate neurocomputational models requires software capable of coping with models on a variety of scales: from the microscale, investigating plasticity, and dynamics of circuits in local networks, to the macroscale, investigating the interactions between distinct brain regions. Prior to any serious dynamical investigation, the first task of network simulations is to check the consistency of data integrated in the connectome and constrain ranges for yet unknown parameters. Thanks to distributed computing techniques, it is possible today to routinely simulate local cortical networks of around 10(5) neurons with up to 10(9) synapses on clusters and multi-processor shared-memory machines. However, brain-scale networks are orders of magnitude larger than such local networks, in terms of numbers of neurons and synapses as well as in terms of computational load. Such networks have been investigated in individual studies, but the underlying simulation technologies have neither been described in sufficient detail to be reproducible nor made publicly available. Here, we discover that as the network model sizes approach the regime of meso- and macroscale simulations, memory consumption on individual compute nodes becomes a critical bottleneck. This is especially relevant on modern supercomputers such as the Blue Gene/P architecture where the available working memory per CPU core is rather limited. We develop a simple linear model to analyze the memory consumption of the constituent components of neuronal simulators as a function of network size and the number of cores used. This approach has multiple benefits. The model enables identification of key contributing components to memory saturation and prediction of the effects of potential improvements to code before any implementation takes place. As a consequence, development cycles can be shorter and less expensive. Applying the model to our freely available Neural Simulation Tool (NEST), we identify the software components dominant at different scales, and develop general strategies for reducing the memory consumption, in particular by using data structures that exploit the sparseness of the local representation of the network. We show that these adaptations enable our simulation software to scale up to the order of 10,000 processors and beyond. As memory consumption issues are likely to be relevant for any software dealing with complex connectome data on such architectures, our approach and our findings should be useful for researchers developing novel neuroinformatics solutions to the challenges posed by the connectome project.

Heterogeneous delivering capability promotes traffic efficiency in complex networks

NASA Astrophysics Data System (ADS)

Zhu, Yan-Bo; Guan, Xiang-Min; Zhang, Xue-Jun

2015-12-01

Traffic is one of the most fundamental dynamical processes in networked systems. With the homogeneous delivery capability of nodes, the global dynamic routing strategy proposed by Ling et al. [Phys. Rev. E81, 016113 (2010)] adequately uses the dynamic information during the process and thus it can reach a quite high network capacity. In this paper, based on the global dynamic routing strategy, we proposed a heterogeneous delivery allocation strategy of nodes on scale-free networks with consideration of nodes degree. It is found that the network capacity as well as some other indexes reflecting transportation efficiency are further improved. Our work may be useful for the design of more efficient routing strategies in communication or transportation systems.

Dynamics of Bacterial Gene Regulatory Networks.

PubMed

Shis, David L; Bennett, Matthew R; Igoshin, Oleg A

2018-05-20

The ability of bacterial cells to adjust their gene expression program in response to environmental perturbation is often critical for their survival. Recent experimental advances allowing us to quantitatively record gene expression dynamics in single cells and in populations coupled with mathematical modeling enable mechanistic understanding on how these responses are shaped by the underlying regulatory networks. Here, we review how the combination of local and global factors affect dynamical responses of gene regulatory networks. Our goal is to discuss the general principles that allow extrapolation from a few model bacteria to less understood microbes. We emphasize that, in addition to well-studied effects of network architecture, network dynamics are shaped by global pleiotropic effects and cell physiology.

Dynamic properties of epidemic spreading on finite size complex networks

NASA Astrophysics Data System (ADS)

Li, Ying; Liu, Yang; Shan, Xiu-Ming; Ren, Yong; Jiao, Jian; Qiu, Ben

2005-11-01

The Internet presents a complex topological structure, on which computer viruses can easily spread. By using theoretical analysis and computer simulation methods, the dynamic process of disease spreading on finite size networks with complex topological structure is investigated. On the finite size networks, the spreading process of SIS (susceptible-infected-susceptible) model is a finite Markov chain with an absorbing state. Two parameters, the survival probability and the conditional infecting probability, are introduced to describe the dynamic properties of disease spreading on finite size networks. Our results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks. Also, knowledge about the dynamic character of virus spreading is helpful for adopting immunity policy.

77 FR 5775 - Caribbean Fishery Management Council; Public Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2012-02-06

... Caribbean Fishery Management Council's (Council) Outreach and Education Advisory Panel (OEAP) will hold a...--Miguel Rol[oacute]n --Goals and Objectives of the CFMC Outreach and Education Advisory Panel (OEAP... --Bulletin/Newsletter --Social Network Pages --Streaming of Council Meetings --Other Business The meeting is...

A Network Optimization Approach for Improving Organizational Design

DTIC Science & Technology

2004-01-01

functions, Dynamic Network Analysis, Social Network Analysis Abstract Organizations are frequently designed and redesigned, often in...links between sites on the web. Hence a change in any one of the four networks in which people are involved can potentially result in a cascade of...in terms of a set of networks that open the possibility of using all networks (both social and dynamic network measures) as indicators of potential

Reconstructing networks from dynamics with correlated noise

NASA Astrophysics Data System (ADS)

Tam, H. C.; Ching, Emily S. C.; Lai, Pik-Yin

2018-07-01

Reconstructing the structure of complex networks from measurements of the nodes is a challenge in many branches of science. External influences are always present and act as a noise to the networks of interest. In this paper, we present a method for reconstructing networks from measured dynamics of the nodes subjected to correlated noise that cannot be approximated by a white noise. This method can reconstruct the links of both bidirectional and directed networks, the correlation time and strength of the noise, and also the relative coupling strength of the links when the coupling functions have certain properties. Our method is built upon theoretical relations between network structure and measurable quantities from the dynamics that we have derived for systems that have fixed point dynamics in the noise-free limit. Using these theoretical results, we can further explain the shortcomings of two common practices of inferring links for bidirectional networks using the Pearson correlation coefficient and the partial correlation coefficient.

On investigating social dynamics in tactical opportunistic mobile networks

NASA Astrophysics Data System (ADS)

Gao, Wei; Li, Yong

2014-06-01

The efficiency of military mobile network operations at the tactical edge is challenging due to the practical Disconnected, Intermittent, and Limited (DIL) environments at the tactical edge which make it hard to maintain persistent end-to-end wireless network connectivity. Opportunistic mobile networks are hence devised to depict such tactical networking scenarios. Social relations among warfighters in tactical opportunistic mobile networks are implicitly represented by their opportunistic contacts via short-range radios, but were inappropriately considered as stationary over time by the conventional wisdom. In this paper, we develop analytical models to probabilistically investigate the temporal dynamics of this social relationship, which is critical to efficient mobile communication in the battlespace. We propose to formulate such dynamics by developing various sociological metrics, including centrality and community, with respect to the opportunistic mobile network contexts. These metrics investigate social dynamics based on the experimentally validated skewness of users' transient contact distributions over time.

The third international meeting on genetic disorders in the RAS/MAPK pathway: towards a therapeutic approach.

PubMed

Korf, Bruce; Ahmadian, Reza; Allanson, Judith; Aoki, Yoko; Bakker, Annette; Wright, Emma Burkitt; Denger, Brian; Elgersma, Ype; Gelb, Bruce D; Gripp, Karen W; Kerr, Bronwyn; Kontaridis, Maria; Lazaro, Conxi; Linardic, Corinne; Lozano, Reymundo; MacRae, Calum A; Messiaen, Ludwine; Mulero-Navarro, Sonia; Neel, Benjamin; Plotkin, Scott; Rauen, Katherine A; Roberts, Amy; Silva, Alcino J; Sittampalam, Sitta G; Zhang, Chao; Schoyer, Lisa

2015-08-01

"The Third International Meeting on Genetic Disorders in the RAS/MAPK Pathway: Towards a Therapeutic Approach" was held at the Renaissance Orlando at SeaWorld Hotel (August 2-4, 2013). Seventy-one physicians and scientists attended the meeting, and parallel meetings were held by patient advocacy groups (CFC International, Costello Syndrome Family Network, NF Network and Noonan Syndrome Foundation). Parent and patient advocates opened the meeting with a panel discussion to set the stage regarding their hopes and expectations for therapeutic advances. In keeping with the theme on therapeutic development, the sessions followed a progression from description of the phenotype and definition of therapeutic endpoints, to definition of genomic changes, to identification of therapeutic targets in the RAS/MAPK pathway, to preclinical drug development and testing, to clinical trials. These proceedings will review the major points of discussion. © 2015 Wiley Periodicals, Inc.

NGSPN @ BNL

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

Pepper, S. E.; Bachner, K.; Gomera, J.

Brookhaven National Laboratory’s (BNL’s) Nonproliferation and National Security Department hosted the Next Generation Safeguards Professional Network (NGSPN) at BNL September 6-9, 2016. Thirteen representatives from seven Department of Energy National Laboratories, including two from BNL, participated in the four-day meeting. The NGSPN meeting was sponsored by the Office of International Nuclear Safeguards (NA-241) of the National Nuclear Security Administration, which provided funding for BNL’s development and conduct of the meeting program and the participant’s labor and travel. NGSPN meetings were previously held at Savannah River National Laboratory, Oak Ridge National Laboratory, Idaho National Laboratory, Sandia National Laboratories, and Los Alamosmore » National Laboratory. The purpose of NGSPN is to provide a forum for early-career international safeguards practitioners to network with their peers, to meet international safeguards experts from other institutions and to learn about organizations other than their employers who contribute to international safeguards.« less

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.

Salience network dynamics underlying successful resistance of temptation

PubMed Central

Nomi, Jason S; Calhoun, Vince D; Stelzel, Christine; Paschke, Lena M; Gaschler, Robert; Goschke, Thomas; Walter, Henrik; Uddin, Lucina Q

2017-01-01

Abstract Self-control and the ability to resist temptation are critical for successful completion of long-term goals. Contemporary models in cognitive neuroscience emphasize the primary role of prefrontal cognitive control networks in aligning behavior with such goals. Here, we use gaze pattern analysis and dynamic functional connectivity fMRI data to explore how individual differences in the ability to resist temptation are related to intrinsic brain dynamics of the cognitive control and salience networks. Behaviorally, individuals exhibit greater gaze distance from target location (e.g. higher distractibility) during presentation of tempting erotic images compared with neutral images. Individuals whose intrinsic dynamic functional connectivity patterns gravitate toward configurations in which salience detection systems are less strongly coupled with visual systems resist tempting distractors more effectively. The ability to resist tempting distractors was not significantly related to intrinsic dynamics of the cognitive control network. These results suggest that susceptibility to temptation is governed in part by individual differences in salience network dynamics and provide novel evidence for involvement of brain systems outside canonical cognitive control networks in contributing to individual differences in self-control. PMID:29048582

Contagion of Cooperation in Static and Fluid Social Networks.

PubMed

Jordan, Jillian J; Rand, David G; Arbesman, Samuel; Fowler, James H; Christakis, Nicholas A

2013-01-01

Cooperation is essential for successful human societies. Thus, understanding how cooperative and selfish behaviors spread from person to person is a topic of theoretical and practical importance. Previous laboratory experiments provide clear evidence of social contagion in the domain of cooperation, both in fixed networks and in randomly shuffled networks, but leave open the possibility of asymmetries in the spread of cooperative and selfish behaviors. Additionally, many real human interaction structures are dynamic: we often have control over whom we interact with. Dynamic networks may differ importantly in the goals and strategic considerations they promote, and thus the question of how cooperative and selfish behaviors spread in dynamic networks remains open. Here, we address these questions with data from a social dilemma laboratory experiment. We measure the contagion of both cooperative and selfish behavior over time across three different network structures that vary in the extent to which they afford individuals control over their network ties. We find that in relatively fixed networks, both cooperative and selfish behaviors are contagious. In contrast, in more dynamic networks, selfish behavior is contagious, but cooperative behavior is not: subjects are fairly likely to switch to cooperation regardless of the behavior of their neighbors. We hypothesize that this insensitivity to the behavior of neighbors in dynamic networks is the result of subjects' desire to attract new cooperative partners: even if many of one's current neighbors are defectors, it may still make sense to switch to cooperation. We further hypothesize that selfishness remains contagious in dynamic networks because of the well-documented willingness of cooperators to retaliate against selfishness, even when doing so is costly. These results shed light on the contagion of cooperative behavior in fixed and fluid networks, and have implications for influence-based interventions aiming at increasing cooperative behavior.

A Markov model for the temporal dynamics of balanced random networks of finite size

PubMed Central

Lagzi, Fereshteh; Rotter, Stefan

2014-01-01

The balanced state of recurrent networks of excitatory and inhibitory spiking neurons is characterized by fluctuations of population activity about an attractive fixed point. Numerical simulations show that these dynamics are essentially nonlinear, and the intrinsic noise (self-generated fluctuations) in networks of finite size is state-dependent. Therefore, stochastic differential equations with additive noise of fixed amplitude cannot provide an adequate description of the stochastic dynamics. The noise model should, rather, result from a self-consistent description of the network dynamics. Here, we consider a two-state Markovian neuron model, where spikes correspond to transitions from the active state to the refractory state. Excitatory and inhibitory input to this neuron affects the transition rates between the two states. The corresponding nonlinear dependencies can be identified directly from numerical simulations of networks of leaky integrate-and-fire neurons, discretized at a time resolution in the sub-millisecond range. Deterministic mean-field equations, and a noise component that depends on the dynamic state of the network, are obtained from this model. The resulting stochastic model reflects the behavior observed in numerical simulations quite well, irrespective of the size of the network. In particular, a strong temporal correlation between the two populations, a hallmark of the balanced state in random recurrent networks, are well represented by our model. Numerical simulations of such networks show that a log-normal distribution of short-term spike counts is a property of balanced random networks with fixed in-degree that has not been considered before, and our model shares this statistical property. Furthermore, the reconstruction of the flow from simulated time series suggests that the mean-field dynamics of finite-size networks are essentially of Wilson-Cowan type. We expect that this novel nonlinear stochastic model of the interaction between neuronal populations also opens new doors to analyze the joint dynamics of multiple interacting networks. PMID:25520644

Cable-telco architectures

NASA Astrophysics Data System (ADS)

McGrath, Carl J.

1994-11-01

Continued evolution of consumer broadband services such as digital video and digital multimedia has placed renewed emphasis on the need for network solutions to the broadband connectivity challenge. Although still important to architectural planners, connection oriented broadband services based on ISDN concepts must now compete with a wider array of broadcast and highly asymmetrical services for bandwidth on the network. For network operators, the business imperative is to identify and execute a network rebuild plan that will meet the capacity and flexibility needs of these services and compete with the inevitable alternate paths into the home. This paper focuses on some of the key issues facing broadband network planners as they search for the best architecture to meet the business and operations goals in their segment of the market. It will be apparent that no single optimum solution exists for all deployment scenarios, emphasizing the need for flexible and modular sources (such as servers) and network interfaces (such as set tops) which preserve the value of content, the ultimate driver in this round of network revolution.

Structure-based control of complex networks with nonlinear dynamics.

PubMed

Zañudo, Jorge Gomez Tejeda; Yang, Gang; Albert, Réka

2017-07-11

What can we learn about controlling a system solely from its underlying network structure? Here we adapt a recently developed framework for control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic models of biological, technological, and social processes. This feedback-based framework provides realizable node overrides that steer a system toward any of its natural long-term dynamic behaviors, regardless of the specific functional forms and system parameters. We use this framework on several real networks, identify the topological characteristics that underlie the predicted node overrides, and compare its predictions to those of structural controllability in control theory. Finally, we demonstrate this framework's applicability in dynamic models of gene regulatory networks and identify nodes whose override is necessary for control in the general case but not in specific model instances.

A discrete mathematical model of the dynamic evolution of a transportation network

NASA Astrophysics Data System (ADS)

Malinetskii, G. G.; Stepantsov, M. E.

2009-09-01

A dynamic model of the evolution of a transportation network is proposed. The main feature of this model is that the evolution of the transportation network is not a process of centralized transportation optimization. Rather, its dynamic behavior is a result of the system self-organization that occurs in the course of the satisfaction of needs in goods transportation and the evolution of the infrastructure of the network nodes. Nonetheless, the possibility of soft control of the network evolution direction is taken into account.

A coevolving model based on preferential triadic closure for social media networks

PubMed Central

Li, Menghui; Zou, Hailin; Guan, Shuguang; Gong, Xiaofeng; Li, Kun; Di, Zengru; Lai, Choy-Heng

2013-01-01

The dynamical origin of complex networks, i.e., the underlying principles governing network evolution, is a crucial issue in network study. In this paper, by carrying out analysis to the temporal data of Flickr and Epinions–two typical social media networks, we found that the dynamical pattern in neighborhood, especially the formation of triadic links, plays a dominant role in the evolution of networks. We thus proposed a coevolving dynamical model for such networks, in which the evolution is only driven by the local dynamics–the preferential triadic closure. Numerical experiments verified that the model can reproduce global properties which are qualitatively consistent with the empirical observations. PMID:23979061

Technical evaluation report of AGARD Technical Evaluation Meeting on Unsteady Aerodynamics: Fundamentals and Applications to Aircraft Dynamics

NASA Technical Reports Server (NTRS)

Mabey, D. G.; Chambers, J. R.

1986-01-01

From May 6 to 9, 1985, the Fluid Dynamics Panel and Flight Mechanics Panel of AGARD jointly arranged a Symposium on Unsteady Aerodynamics-Fundamentals and Applications to Aircraft Dynamics at the Stadthall, Goettingen, West Germany. This Symposium was organized by an international program committee chaired by Dr. K. J. Orlik-Ruckemann of the Fluid Dynamics Panel. The program consisted of five sessions grouped in two parts: (1) Fundamentals of Unsteady Aerodynamics; and (2) Applications to Aircraft Dynamics. The 35 papers presented at the 4 day meeting are published in AGARD CP 386 and listed in the Appendix. As the papers are already available and cover a very wide field, the evaluators have offered brief comments on every paper, followed by an overall evaluation of the meeting, together with some general conclusions and recommendations.

Model Of Neural Network With Creative Dynamics

NASA Technical Reports Server (NTRS)

Zak, Michail; Barhen, Jacob

1993-01-01

Paper presents analysis of mathematical model of one-neuron/one-synapse neural network featuring coupled activation and learning dynamics and parametrical periodic excitation. Demonstrates self-programming, partly random behavior of suitable designed neural network; believed to be related to spontaneity and creativity of biological neural networks.

Fractional quantum mechanics on networks: Long-range dynamics and quantum transport

NASA Astrophysics Data System (ADS)

Riascos, A. P.; Mateos, José L.

2015-11-01

In this paper we study the quantum transport on networks with a temporal evolution governed by the fractional Schrödinger equation. We generalize the dynamics based on continuous-time quantum walks, with transitions to nearest neighbors on the network, to the fractional case that allows long-range displacements. By using the fractional Laplacian matrix of a network, we establish a formalism that combines a long-range dynamics with the quantum superposition of states; this general approach applies to any type of connected undirected networks, including regular, random, and complex networks, and can be implemented from the spectral properties of the Laplacian matrix. We study the fractional dynamics and its capacity to explore the network by means of the transition probability, the average probability of return, and global quantities that characterize the efficiency of this quantum process. As a particular case, we explore analytically these quantities for circulant networks such as rings, interacting cycles, and complete graphs.

Interaction Control to Synchronize Non-synchronizable Networks.

PubMed

Schröder, Malte; Chakraborty, Sagar; Witthaut, Dirk; Nagler, Jan; Timme, Marc

2016-11-17

Synchronization constitutes one of the most fundamental collective dynamics across networked systems and often underlies their function. Whether a system may synchronize depends on the internal unit dynamics as well as the topology and strength of their interactions. For chaotic units with certain interaction topologies synchronization might be impossible across all interaction strengths, meaning that these networks are non-synchronizable. Here we propose the concept of interaction control, generalizing transient uncoupling, to induce desired collective dynamics in complex networks and apply it to synchronize even such non-synchronizable systems. After highlighting that non-synchronizability prevails for a wide range of networks of arbitrary size, we explain how a simple binary control may localize interactions in state space and thereby synchronize networks. Intriguingly, localizing interactions by a fixed control scheme enables stable synchronization across all connected networks regardless of topological constraints. Interaction control may thus ease the design of desired collective dynamics even without knowledge of the networks' exact interaction topology and consequently have implications for biological and self-organizing technical systems.

Spontaneous scale-free structure in adaptive networks with synchronously dynamical linking

NASA Astrophysics Data System (ADS)

Yuan, Wu-Jie; Zhou, Jian-Fang; Li, Qun; Chen, De-Bao; Wang, Zhen

2013-08-01

Inspired by the anti-Hebbian learning rule in neural systems, we study how the feedback from dynamical synchronization shapes network structure by adding new links. Through extensive numerical simulations, we find that an adaptive network spontaneously forms scale-free structure, as confirmed in many real systems. Moreover, the adaptive process produces two nontrivial power-law behaviors of deviation strength from mean activity of the network and negative degree correlation, which exists widely in technological and biological networks. Importantly, these scalings are robust to variation of the adaptive network parameters, which may have meaningful implications in the scale-free formation and manipulation of dynamical networks. Our study thus suggests an alternative adaptive mechanism for the formation of scale-free structure with negative degree correlation, which means that nodes of high degree tend to connect, on average, with others of low degree and vice versa. The relevance of the results to structure formation and dynamical property in neural networks is briefly discussed as well.

Fractional quantum mechanics on networks: Long-range dynamics and quantum transport.

PubMed

Riascos, A P; Mateos, José L

2015-11-01

In this paper we study the quantum transport on networks with a temporal evolution governed by the fractional Schrödinger equation. We generalize the dynamics based on continuous-time quantum walks, with transitions to nearest neighbors on the network, to the fractional case that allows long-range displacements. By using the fractional Laplacian matrix of a network, we establish a formalism that combines a long-range dynamics with the quantum superposition of states; this general approach applies to any type of connected undirected networks, including regular, random, and complex networks, and can be implemented from the spectral properties of the Laplacian matrix. We study the fractional dynamics and its capacity to explore the network by means of the transition probability, the average probability of return, and global quantities that characterize the efficiency of this quantum process. As a particular case, we explore analytically these quantities for circulant networks such as rings, interacting cycles, and complete graphs.

A fast community detection method in bipartite networks by distance dynamics

NASA Astrophysics Data System (ADS)

Sun, Hong-liang; Ch'ng, Eugene; Yong, Xi; Garibaldi, Jonathan M.; See, Simon; Chen, Duan-bing

2018-04-01

Many real bipartite networks are found to be divided into two-mode communities. In this paper, we formulate a new two-mode community detection algorithm BiAttractor. It is based on distance dynamics model Attractor proposed by Shao et al. with extension from unipartite to bipartite networks. Since Jaccard coefficient of distance dynamics model is incapable to measure distances of different types of vertices in bipartite networks, our main contribution is to extend distance dynamics model from unipartite to bipartite networks using a novel measure Local Jaccard Distance (LJD). Furthermore, distances between different types of vertices are not affected by common neighbors in the original method. This new idea makes clear assumptions and yields interpretable results in linear time complexity O(| E |) in sparse networks, where | E | is the number of edges. Experiments on synthetic networks demonstrate it is capable to overcome resolution limit compared with existing other methods. Further research on real networks shows that this model can accurately detect interpretable community structures in a short time.

Intrinsically-generated fluctuating activity in excitatory-inhibitory networks.

PubMed

Mastrogiuseppe, Francesca; Ostojic, Srdjan

2017-04-01

Recurrent networks of non-linear units display a variety of dynamical regimes depending on the structure of their synaptic connectivity. A particularly remarkable phenomenon is the appearance of strongly fluctuating, chaotic activity in networks of deterministic, but randomly connected rate units. How this type of intrinsically generated fluctuations appears in more realistic networks of spiking neurons has been a long standing question. To ease the comparison between rate and spiking networks, recent works investigated the dynamical regimes of randomly-connected rate networks with segregated excitatory and inhibitory populations, and firing rates constrained to be positive. These works derived general dynamical mean field (DMF) equations describing the fluctuating dynamics, but solved these equations only in the case of purely inhibitory networks. Using a simplified excitatory-inhibitory architecture in which DMF equations are more easily tractable, here we show that the presence of excitation qualitatively modifies the fluctuating activity compared to purely inhibitory networks. In presence of excitation, intrinsically generated fluctuations induce a strong increase in mean firing rates, a phenomenon that is much weaker in purely inhibitory networks. Excitation moreover induces two different fluctuating regimes: for moderate overall coupling, recurrent inhibition is sufficient to stabilize fluctuations; for strong coupling, firing rates are stabilized solely by the upper bound imposed on activity, even if inhibition is stronger than excitation. These results extend to more general network architectures, and to rate networks receiving noisy inputs mimicking spiking activity. Finally, we show that signatures of the second dynamical regime appear in networks of integrate-and-fire neurons.

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.

Intrinsically-generated fluctuating activity in excitatory-inhibitory networks

PubMed Central

Mastrogiuseppe, Francesca; Ostojic, Srdjan

2017-01-01

Recurrent networks of non-linear units display a variety of dynamical regimes depending on the structure of their synaptic connectivity. A particularly remarkable phenomenon is the appearance of strongly fluctuating, chaotic activity in networks of deterministic, but randomly connected rate units. How this type of intrinsically generated fluctuations appears in more realistic networks of spiking neurons has been a long standing question. To ease the comparison between rate and spiking networks, recent works investigated the dynamical regimes of randomly-connected rate networks with segregated excitatory and inhibitory populations, and firing rates constrained to be positive. These works derived general dynamical mean field (DMF) equations describing the fluctuating dynamics, but solved these equations only in the case of purely inhibitory networks. Using a simplified excitatory-inhibitory architecture in which DMF equations are more easily tractable, here we show that the presence of excitation qualitatively modifies the fluctuating activity compared to purely inhibitory networks. In presence of excitation, intrinsically generated fluctuations induce a strong increase in mean firing rates, a phenomenon that is much weaker in purely inhibitory networks. Excitation moreover induces two different fluctuating regimes: for moderate overall coupling, recurrent inhibition is sufficient to stabilize fluctuations; for strong coupling, firing rates are stabilized solely by the upper bound imposed on activity, even if inhibition is stronger than excitation. These results extend to more general network architectures, and to rate networks receiving noisy inputs mimicking spiking activity. Finally, we show that signatures of the second dynamical regime appear in networks of integrate-and-fire neurons. PMID:28437436

Dynamical influence processes on networks: general theory and applications to social contagion.

PubMed

Harris, Kameron Decker; Danforth, Christopher M; Dodds, Peter Sheridan

2013-08-01

We study binary state dynamics on a network where each node acts in response to the average state of its neighborhood. By allowing varying amounts of stochasticity in both the network and node responses, we find different outcomes in random and deterministic versions of the model. In the limit of a large, dense network, however, we show that these dynamics coincide. We construct a general mean-field theory for random networks and show this predicts that the dynamics on the network is a smoothed version of the average response function dynamics. Thus, the behavior of the system can range from steady state to chaotic depending on the response functions, network connectivity, and update synchronicity. As a specific example, we model the competing tendencies of imitation and nonconformity by incorporating an off-threshold into standard threshold models of social contagion. In this way, we attempt to capture important aspects of fashions and societal trends. We compare our theory to extensive simulations of this "limited imitation contagion" model on Poisson random graphs, finding agreement between the mean-field theory and stochastic simulations.

What's in a crowd? Analysis of face-to-face behavioral networks.

PubMed

Isella, Lorenzo; Stehlé, Juliette; Barrat, Alain; Cattuto, Ciro; Pinton, Jean-François; Van den Broeck, Wouter

2011-02-21

The availability of new data sources on human mobility is opening new avenues for investigating the interplay of social networks, human mobility and dynamical processes such as epidemic spreading. Here we analyze data on the time-resolved face-to-face proximity of individuals in large-scale real-world scenarios. We compare two settings with very different properties, a scientific conference and a long-running museum exhibition. We track the behavioral networks of face-to-face proximity, and characterize them from both a static and a dynamic point of view, exposing differences and similarities. We use our data to investigate the dynamics of a susceptible-infected model for epidemic spreading that unfolds on the dynamical networks of human proximity. The spreading patterns are markedly different for the conference and the museum case, and they are strongly impacted by the causal structure of the network data. A deeper study of the spreading paths shows that the mere knowledge of static aggregated networks would lead to erroneous conclusions about the transmission paths on the dynamical networks. Copyright © 2010 Elsevier Ltd. All rights reserved.

A compositional framework for reaction networks

NASA Astrophysics Data System (ADS)

Baez, John C.; Pollard, Blake S.

Reaction networks, or equivalently Petri nets, are a general framework for describing processes in which entities of various kinds interact and turn into other entities. In chemistry, where the reactions are assigned ‘rate constants’, any reaction network gives rise to a nonlinear dynamical system called its ‘rate equation’. Here we generalize these ideas to ‘open’ reaction networks, which allow entities to flow in and out at certain designated inputs and outputs. We treat open reaction networks as morphisms in a category. Composing two such morphisms connects the outputs of the first to the inputs of the second. We construct a functor sending any open reaction network to its corresponding ‘open dynamical system’. This provides a compositional framework for studying the dynamics of reaction networks. We then turn to statics: that is, steady state solutions of open dynamical systems. We construct a ‘black-boxing’ functor that sends any open dynamical system to the relation that it imposes between input and output variables in steady states. This extends our earlier work on black-boxing for Markov processes.

Projective-anticipating, projective, and projective-lag synchronization of time-delayed chaotic systems on random networks.

PubMed

Feng, Cun-Fang; Xu, Xin-Jian; Wang, Sheng-Jun; Wang, Ying-Hai

2008-06-01

We study projective-anticipating, projective, and projective-lag synchronization of time-delayed chaotic systems on random networks. We relax some limitations of previous work, where projective-anticipating and projective-lag synchronization can be achieved only on two coupled chaotic systems. In this paper, we realize projective-anticipating and projective-lag synchronization on complex dynamical networks composed of a large number of interconnected components. At the same time, although previous work studied projective synchronization on complex dynamical networks, the dynamics of the nodes are coupled partially linear chaotic systems. In this paper, the dynamics of the nodes of the complex networks are time-delayed chaotic systems without the limitation of the partial linearity. Based on the Lyapunov stability theory, we suggest a generic method to achieve the projective-anticipating, projective, and projective-lag synchronization of time-delayed chaotic systems on random dynamical networks, and we find both its existence and sufficient stability conditions. The validity of the proposed method is demonstrated and verified by examining specific examples using Ikeda and Mackey-Glass systems on Erdos-Renyi networks.

Capturing the Interplay of Dynamics and Networks through Parameterizations of Laplacian Operators

DTIC Science & Technology

2016-08-24

important vertices and communities in the network. Specifically, for each dynamical process in this framework, we define a centrality measure that...vertices as a potential cluster (or community ) with respect to this process. We show that the subset-quality function generalizes the traditional conductance...compare the different perspectives they create on network structure. Subjects Network Science and Online Social Networks Keywords Network, Community

Dynamical Graph Theory Networks Methods for the Analysis of Sparse Functional Connectivity Networks and for Determining Pinning Observability in Brain Networks

PubMed Central

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

Dynamical Graph Theory Networks Methods for the Analysis of Sparse Functional Connectivity Networks and for Determining Pinning Observability in Brain Networks.

PubMed

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.

An epidermal plakin that integrates actin and microtubule networks at cellular junctions.

PubMed

Karakesisoglou, I; Yang, Y; Fuchs, E

2000-04-03

Plakins are cytoskeletal linker proteins initially thought to interact exclusively with intermediate filaments (IFs), but recently were found to associate additionally with actin and microtubule networks. Here, we report on ACF7, a mammalian orthologue of the Drosophila kakapo plakin genetically involved in epidermal-muscle adhesion and neuromuscular junctions. While ACF7/kakapo is divergent from other plakins in its IF-binding domain, it has at least one actin (K(d) = 0.35 microM) and one microtubule (K(d) approximately 6 microM) binding domain. Similar to its fly counterpart, ACF7 is expressed in the epidermis. In well spread epidermal keratinocytes, ACF7 discontinuously decorates the cytoskeleton at the cell periphery, including microtubules (MTs) and actin filaments (AFs) that are aligned in parallel converging at focal contacts. Upon calcium induction of intercellular adhesion, ACF7 and the cytoskeleton reorganize at cell-cell borders but with different kinetics from adherens junctions and desmosomes. Treatments with cytoskeletal depolymerizing drugs reveal that ACF7's cytoskeletal association is dependent upon the microtubule network, but ACF7 also appears to stabilize actin at sites where microtubules and microfilaments meet. We posit that ACF7 may function in microtubule dynamics to facilitate actin-microtubule interactions at the cell periphery and to couple the microtubule network to cellular junctions. These attributes provide a clear explanation for the kakapo mutant phenotype in flies.

Maximal switchability of centralized networks

NASA Astrophysics Data System (ADS)

Vakulenko, Sergei; Morozov, Ivan; Radulescu, Ovidiu

2016-08-01

We consider continuous time Hopfield-like recurrent networks as dynamical models for gene regulation and neural networks. We are interested in networks that contain n high-degree nodes preferably connected to a large number of N s weakly connected satellites, a property that we call n/N s -centrality. If the hub dynamics is slow, we obtain that the large time network dynamics is completely defined by the hub dynamics. Moreover, such networks are maximally flexible and switchable, in the sense that they can switch from a globally attractive rest state to any structurally stable dynamics when the response time of a special controller hub is changed. In particular, we show that a decrease of the controller hub response time can lead to a sharp variation in the network attractor structure: we can obtain a set of new local attractors, whose number can increase exponentially with N, the total number of nodes of the nework. These new attractors can be periodic or even chaotic. We provide an algorithm, which allows us to design networks with the desired switching properties, or to learn them from time series, by adjusting the interactions between hubs and satellites. Such switchable networks could be used as models for context dependent adaptation in functional genetics or as models for cognitive functions in neuroscience.

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

PubMed

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

2014-07-01

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

Dynamic Functional Connectivity States Between the Dorsal and Ventral Sensorimotor Networks Revealed by Dynamic Conditional Correlation Analysis of Resting-State Functional Magnetic Resonance Imaging.

PubMed

Syed, Maleeha F; Lindquist, Martin A; Pillai, Jay J; Agarwal, Shruti; Gujar, Sachin K; Choe, Ann S; Caffo, Brian; Sair, Haris I

2017-12-01

Functional connectivity in resting-state functional magnetic resonance imaging (rs-fMRI) has received substantial attention since the initial findings of Biswal et al. Traditional network correlation metrics assume that the functional connectivity in the brain remains stationary over time. However, recent studies have shown that robust temporal fluctuations of functional connectivity among as well as within functional networks exist, challenging this assumption. In this study, these dynamic correlation differences were investigated between the dorsal and ventral sensorimotor networks by applying the dynamic conditional correlation model to rs-fMRI data of 20 healthy subjects. k-Means clustering was used to determine an optimal number of discrete connectivity states (k = 10) of the sensorimotor system across all subjects. Our analysis confirms the existence of differences in dynamic correlation between the dorsal and ventral networks, with highest connectivity found within the ventral motor network.

Dynamic Evolution of Financial Network and its Relation to Economic Crises

NASA Astrophysics Data System (ADS)

Gao, Ya-Chun; Wei, Zong-Wen; Wang, Bing-Hong

2013-02-01

The static topology properties of financial networks have been widely investigated since the work done by Mantegna, yet their dynamic evolution with time is little considered. In this paper, we comprehensively study the dynamic evolution of financial network by a sliding window technique. The vertices and edges of financial network are represented by the stocks from S&P500 components and correlations between pairs of daily returns of price fluctuation, respectively. Furthermore, the duration of stock price fluctuation, spanning from January 4, 1985 to September 14, 2009, makes us to carefully observe the relation between the dynamic topological properties and big financial crashes. The empirical results suggest that the financial network has the robust small-world property when the time evolves, and the topological structure drastically changes when the big financial crashes occur. This correspondence between the dynamic evolution of financial network and big financial crashes may provide a novel view to understand the origin of economic crisis.

Dynamic Processes in Network Goods: Modeling, Analysis and Applications

ERIC Educational Resources Information Center

Paothong, Arnut

2013-01-01

The network externality function plays a very important role in the study of economic network industries. Moreover, the consumer group dynamic interactions coupled with network externality concept is going to play a dominant role in the network goods in the 21st century. The existing literature is stemmed on a choice of externality function with…

RICA: a reliable and image configurable arena for cyborg bumblebee based on CAN bus.

PubMed

Gong, Fan; Zheng, Nenggan; Xue, Lei; Xu, Kedi; Zheng, Xiaoxiang

2014-01-01

In this paper, we designed a reliable and image configurable flight arena, RICA, for developing cyborg bumblebees. To meet the spatial and temporal requirements of bumblebees, the Controller Area Network (CAN) bus is adopted to interconnect the LED display modules to ensure the reliability and real-time performance of the arena system. Easily-configurable interfaces on a desktop computer implemented by python scripts are provided to transmit the visual patterns to the LED distributor online and configure RICA dynamically. The new arena system will be a power tool to investigate the quantitative relationship between the visual inputs and induced flight behaviors and also will be helpful to the visual-motor research in other related fields.

Local multipoint distribution system (LDMS) versus free-space optical (FSO) networks

NASA Astrophysics Data System (ADS)

Willebrand, Heinz A.; Clark, Gerald R.; Willson, Bryan; Andreu von Euw, Christian G.; Roy, Joe; Mayhew, Laurel M.

2001-11-01

This paper compares two emerging broadband access methodologies, Free Space Optics (FSO) and Local Multipoint Distribution System (LMDS) and the atmospheric propagation characteristics of each when exposed to a dynamically changing channel. The comparison focuses on bandwidth, availability, and distance requirements for the new broadband market and how LMDS and FSO can be used to meet these requirements. Possible network topologies and their associated costs are examined. This comparison takes into account the total cost of deployment, including equipment costs, installation fees, access fees, and spectrum licensing fees. LMDS and FSO are compared on speed of deployment, scalability, aggregate bandwidth, and bandwidth per customer. Present and projected capabilities of each technology are considered for their suitability in different locations in the network, from the Wide Area Network (WAN), to the Metropolitan Area Network (MAN), all the way to Last Mile Access. There is a discussion on the relative performance of LMDS and FSO, focusing on the different factors that can affect link availability. Since network design is a large factor in assuring overall reliability, the flexibility of each technology with regard to network design is compared. LMDS and FSO are both line of sight, space-propagated technologies, and as such, they are both susceptible to path impediments and atmospheric attenuation, dispersion, scattering, and absorption. LMDS and FSO are affected very differently by different meteorological phenomena. Problematic atmospheric conditions are, specifically scintillation, rainfall, and fog, are examined. In addition to a discussion of these conditions, various techniques for minimizing atmospheric and environmental effects are investigated. The paper concludes with a summary of findings and recommendations for a number of broadband wireless applications.

The Complexity of Dynamics in Small Neural Circuits

PubMed Central

Panzeri, Stefano

2016-01-01

Mean-field approximations are a powerful tool for studying large neural networks. However, they do not describe well the behavior of networks composed of a small number of neurons. In this case, major differences between the mean-field approximation and the real behavior of the network can arise. Yet, many interesting problems in neuroscience involve the study of mesoscopic networks composed of a few tens of neurons. Nonetheless, mathematical methods that correctly describe networks of small size are still rare, and this prevents us to make progress in understanding neural dynamics at these intermediate scales. Here we develop a novel systematic analysis of the dynamics of arbitrarily small networks composed of homogeneous populations of excitatory and inhibitory firing-rate neurons. We study the local bifurcations of their neural activity with an approach that is largely analytically tractable, and we numerically determine the global bifurcations. We find that for strong inhibition these networks give rise to very complex dynamics, caused by the formation of multiple branching solutions of the neural dynamics equations that emerge through spontaneous symmetry-breaking. This qualitative change of the neural dynamics is a finite-size effect of the network, that reveals qualitative and previously unexplored differences between mesoscopic cortical circuits and their mean-field approximation. The most important consequence of spontaneous symmetry-breaking is the ability of mesoscopic networks to regulate their degree of functional heterogeneity, which is thought to help reducing the detrimental effect of noise correlations on cortical information processing. PMID:27494737

The Budapest Meeting 2005 intensified networking on ethics of science: the case of reproductive cloning, germline gene therapy and human dignity.

PubMed

Van Steendam, Guido; Dinnyés, András; Mallet, Jacques; Meloni, Rolando; Casabona, Carlos Romeo; González, Jorge Guerra; Kure, Josef; Szathmáry, Eörs; Vorstenbosch, Jan; Molnár, Péter; Edbrooke, David; Sándor, Judit; Oberfrank, Ferenc; Cole-Turner, Ron; Hargittai, István; Littig, Beate; Ladikas, Miltos; Mordini, Emilio; Roosendaal, Hans E; Salvi, Maurizio; Gulyás, Balázs; Malpede, Diana

2006-10-01

This paper reports on the meeting of the Sounding Board of the EU Reprogenetics Project that was held in Budapest, Hungary, 6-9 November 2005. The Reprogenetics Project runs from 2004 until 2007 and has a brief to study the ethical aspects of human reproductive cloning and germline gene therapy. Discussions during The Budapest Meeting are reported in depth in this paper as well as the initiatives to involve the participating groups and others in ongoing collaborations with the goal of forming an integrated network of European resources in the fields of ethics of science.

Modeling and control of magnetorheological fluid dampers using neural networks

NASA Astrophysics Data System (ADS)

Wang, D. H.; Liao, W. H.

2005-02-01

Due to the inherent nonlinear nature of magnetorheological (MR) fluid dampers, one of the challenging aspects for utilizing these devices to achieve high system performance is the development of accurate models and control algorithms that can take advantage of their unique characteristics. In this paper, the direct identification and inverse dynamic modeling for MR fluid dampers using feedforward and recurrent neural networks are studied. The trained direct identification neural network model can be used to predict the damping force of the MR fluid damper on line, on the basis of the dynamic responses across the MR fluid damper and the command voltage, and the inverse dynamic neural network model can be used to generate the command voltage according to the desired damping force through supervised learning. The architectures and the learning methods of the dynamic neural network models and inverse neural network models for MR fluid dampers are presented, and some simulation results are discussed. Finally, the trained neural network models are applied to predict and control the damping force of the MR fluid damper. Moreover, validation methods for the neural network models developed are proposed and used to evaluate their performance. Validation results with different data sets indicate that the proposed direct identification dynamic model using the recurrent neural network can be used to predict the damping force accurately and the inverse identification dynamic model using the recurrent neural network can act as a damper controller to generate the command voltage when the MR fluid damper is used in a semi-active mode.

Competing dynamic phases of active polymer networks

NASA Astrophysics Data System (ADS)

Freedman, Simon; Banerjee, Shiladitya; Dinner, Aaron R.

Recent experiments on in-vitro reconstituted assemblies of F-actin, myosin-II motors, and cross-linking proteins show that tuning local network properties can changes the fundamental biomechanical behavior of the system. For example, by varying cross-linker density and actin bundle rigidity, one can switch between contractile networks useful for reshaping cells, polarity sorted networks ideal for directed molecular transport, and frustrated networks with robust structural properties. To efficiently investigate the dynamic phases of actomyosin networks, we developed a coarse grained non-equilibrium molecular dynamics simulation of model semiflexible filaments, molecular motors, and cross-linkers with phenomenologically defined interactions. The simulation's accuracy was verified by benchmarking the mechanical properties of its individual components and collective behavior against experimental results at the molecular and network scales. By adjusting the model's parameters, we can reproduce the qualitative phases observed in experiment and predict the protein characteristics where phase crossovers could occur in collective network dynamics. Our model provides a framework for understanding cells' multiple uses of actomyosin networks and their applicability in materials research. Supported by the Department of Defense (DoD) through the National Defense Science & Engineering Graduate Fellowship (NDSEG) Program.

Coarse-Grained Molecular Dynamics Simulation of Ionic Polymer Networks

DTIC Science & Technology

2008-07-01

AFRL-RX-WP-TP-2009-4198 COARSE-GRAINED MOLECULAR DYNAMICS SIMULATION OF IONIC POLYMER NETWORKS (Postprint) T.E. Dirama, V. Varshney, K.L...GRAINED MOLECULAR DYNAMICS SIMULATION OF IONIC POLYMER NETWORKS (Postprint) 5a. CONTRACT NUMBER FA8650-05-D-5807-0052 5b. GRANT NUMBER 5c...We studied two types of networks which differ only by one containing ionic pairs that amount to 7% of the total number of bonds present. The stress

Discrete dynamic modeling of cellular signaling networks.

PubMed

Albert, Réka; Wang, Rui-Sheng

2009-01-01

Understanding signal transduction in cellular systems is a central issue in systems biology. Numerous experiments from different laboratories generate an abundance of individual components and causal interactions mediating environmental and developmental signals. However, for many signal transduction systems there is insufficient information on the overall structure and the molecular mechanisms involved in the signaling network. Moreover, lack of kinetic and temporal information makes it difficult to construct quantitative models of signal transduction pathways. Discrete dynamic modeling, combined with network analysis, provides an effective way to integrate fragmentary knowledge of regulatory interactions into a predictive mathematical model which is able to describe the time evolution of the system without the requirement for kinetic parameters. This chapter introduces the fundamental concepts of discrete dynamic modeling, particularly focusing on Boolean dynamic models. We describe this method step-by-step in the context of cellular signaling networks. Several variants of Boolean dynamic models including threshold Boolean networks and piecewise linear systems are also covered, followed by two examples of successful application of discrete dynamic modeling in cell biology.

Structure-based control of complex networks with nonlinear dynamics

NASA Astrophysics Data System (ADS)

Zanudo, Jorge G. T.; Yang, Gang; Albert, Reka

What can we learn about controlling a system solely from its underlying network structure? Here we use a framework for control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic models of biological, technological, and social processes. This feedback-based framework provides realizable node overrides that steer a system towards any of its natural long term dynamic behaviors, regardless of the dynamic details and system parameters. We use this framework on several real networks, identify the topological characteristics that underlie the predicted node overrides, and compare its predictions to those of classical structural control theory. Finally, we demonstrate this framework's applicability in dynamic models of gene regulatory networks and identify nodes whose override is necessary for control in the general case, but not in specific model instances. This work was supported by NSF Grants PHY 1205840 and IIS 1160995. JGTZ is a recipient of a Stand Up To Cancer - The V Foundation Convergence Scholar Award.

First comes social networking, then comes marriage? Characteristics of Americans married 2005-2012 who met through social networking sites.

PubMed

Hall, Jeffrey A

2014-05-01

Abstract Although social networking sites (SNS) have become increasingly prevalent and integrated into the lives of users, the role of SNS in courtship is relatively unknown. The present manuscript reports on the characteristics of Americans married between 2005 and 2012 who met through SNS drawn from a weighted national sample (N=18,527). Compared to other online meetings (i.e., dating sites, online communities, one-on-one communication), individuals who met through SNS were younger, married more recently, and were more likely to be African American. Compared with offline meetings, individuals who met through SNS were more likely to be younger, male, African American and Hispanic, married more recently, and frequent Internet users with higher incomes. Trends suggest an increasing proportion of individuals are meeting using SNS, necessitating further research on factors that influence romantic relational development through SNS.

Uncertainty and operational considerations in mass prophylaxis workforce planning.

PubMed

Hupert, Nathaniel; Xiong, Wei; King, Kathleen; Castorena, Michelle; Hawkins, Caitlin; Wu, Cindie; Muckstadt, John A

2009-12-01

The public health response to an influenza pandemic or other large-scale health emergency may include mass prophylaxis using multiple points of dispensing (PODs) to deliver countermeasures rapidly to affected populations. Computer models created to date to determine "optimal" staffing levels at PODs typically assume stable patient demand for service. The authors investigated POD function under dynamic and uncertain operational environments. The authors constructed a Monte Carlo simulation model of mass prophylaxis (the Dynamic POD Simulator, or D-PODS) to assess the consequences of nonstationary patient arrival patterns on POD function under a variety of POD layouts and staffing plans. Compared are the performance of a standard POD layout under steady-state and variable patient arrival rates that may mimic real-life variation in patient demand. To achieve similar performance, PODs functioning under nonstationary patient arrival rates require higher staffing levels than would be predicted using the assumption of stationary arrival rates. Furthermore, PODs may develop severe bottlenecks unless staffing levels vary over time to meet changing patient arrival patterns. Efficient POD networks therefore require command and control systems capable of dynamically adjusting intra- and inter-POD staff levels to meet demand. In addition, under real-world operating conditions of heightened uncertainty, fewer large PODs will require a smaller total staff than many small PODs to achieve comparable performance. Modeling environments that capture the effects of fundamental uncertainties in public health disasters are essential for the realistic evaluation of response mechanisms and policies. D-PODS quantifies POD operational efficiency under more realistic conditions than have been modeled previously. The authors' experiments demonstrate that effective POD staffing plans must be responsive to variation and uncertainty in POD arrival patterns. These experiments highlight the need for command and control systems to be created to manage emergency response successfully.

Spectra of random networks in the weak clustering regime

NASA Astrophysics Data System (ADS)

Peron, Thomas K. DM.; Ji, Peng; Kurths, Jürgen; Rodrigues, Francisco A.

2018-03-01

The asymptotic behavior of dynamical processes in networks can be expressed as a function of spectral properties of the corresponding adjacency and Laplacian matrices. Although many theoretical results are known for the spectra of traditional configuration models, networks generated through these models fail to describe many topological features of real-world networks, in particular non-null values of the clustering coefficient. Here we study effects of cycles of order three (triangles) in network spectra. By using recent advances in random matrix theory, we determine the spectral distribution of the network adjacency matrix as a function of the average number of triangles attached to each node for networks without modular structure and degree-degree correlations. Implications to network dynamics are discussed. Our findings can shed light in the study of how particular kinds of subgraphs influence network dynamics.

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

Marital satisfaction and break-ups differ across on-line and off-line meeting venues

PubMed Central

Cacioppo, John T.; Cacioppo, Stephanie; Gonzaga, Gian C.; Ogburn, Elizabeth L.; VanderWeele, Tyler J.

2013-01-01

Marital discord is costly to children, families, and communities. The advent of the Internet, social networking, and on-line dating has affected how people meet future spouses, but little is known about the prevalence or outcomes of these marriages or the demographics of those involved. We addressed these questions in a nationally representative sample of 19,131 respondents who married between 2005 and 2012. Results indicate that more than one-third of marriages in America now begin on-line. In addition, marriages that began on-line, when compared with those that began through traditional off-line venues, were slightly less likely to result in a marital break-up (separation or divorce) and were associated with slightly higher marital satisfaction among those respondents who remained married. Demographic differences were identified between respondents who met their spouse through on-line vs. traditional off-line venues, but the findings for marital break-up and marital satisfaction remained significant after statistically controlling for these differences. These data suggest that the Internet may be altering the dynamics and outcomes of marriage itself. PMID:23733955

The Telecommunications Review

DOT National Transportation Integrated Search

1991-01-01

TELECOMMUNICATION NETWORKS ARE BECOMING INCREASINGLY COMPLEX. THEY MUST MEET THE NEEDS OF SOPHISTICATED USERS WHO DEMAND A HIGH-LEVEL OF FUNCTIONALITY, HIGH PERFORMANCE, AND LOW COST. : TELECOMMUNICATIONS TECHNOLOGY IS CHANGING RAPIDLY TO MEET THA...

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

NASA Astrophysics Data System (ADS)

Jablonski, Piotr; Poe, Gina; Zochowski, Michal

2007-03-01

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

Structural network heterogeneities and network dynamics: A possible dynamical mechanism for hippocampal memory reactivation

NASA Astrophysics Data System (ADS)

Jablonski, Piotr; Poe, Gina R.; Zochowski, Michal

2007-01-01

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

Design of a ground-water-quality monitoring network for the Salinas River basin, California

USGS Publications Warehouse

Showalter, P.K.; Akers, J.P.; Swain, L.A.

1984-01-01

A regional ground-water quality monitoring network for the entire Salinas River drainage basin was designed to meet the needs of the California State Water Resources Control Board. The project included phase 1--identifying monitoring networks that exist in the region; phase 2--collecting information about the wells in each network; and phase 3--studying the factors--such as geology, land use, hydrology, and geohydrology--that influence the ground-water quality, and designing a regional network. This report is the major product of phase 3. Based on the authors ' understanding of the ground-water-quality monitoring system and input from local offices, an ideal network was designed. The proposed network includes 317 wells and 8 stream-gaging stations. Because limited funds are available to implement the monitoring network, the proposed network is designed to correspond to the ideal network insofar as practicable, and is composed mainly of 214 wells that are already being monitored by a local agency. In areas where network wells are not available, arrangements will be made to add wells to local networks. The data collected by this network will be used to assess the ground-water quality of the entire Salinas River drainage basin. After 2 years of data are collected, the network will be evaluated to test whether it is meeting the network objectives. Subsequent network evaluations will be done very 5 years. (USGS)

78 FR 41088 - Solicitation for a Cooperative Agreement-Support Services for Community Services Division Networks

Federal Register 2010, 2011, 2012, 2013, 2014

2013-07-09

...--Support Services for Community Services Division Networks AGENCY: National Institute of Corrections, U.S... cooperative agreement will provide support services to NIC Community Services Division sponsored networks. The networks are designed for NIC to assist in meeting the needs of the field of community corrections by...

Networked Improvement Communities: The Discipline of Improvement Science Meets the Power of Networks

ERIC Educational Resources Information Center

LeMahieu, Paul G.; Grunow, Alicia; Baker, Laura; Nordstrum, Lee E.; Gomez, Louis M.

2017-01-01

Purpose: The purpose of this paper is to delineate an approach to quality assurance in education called networked improvement communities (NICs) that focused on integrating the methodologies of improvement science with few of the networks. Quality improvement, the science and practice of continuously improving programs, practices, processes,…

Enzyme Sequestration as a Tuning Point in Controlling Response Dynamics of Signalling Networks

PubMed Central

Ollivier, Julien F.; Soyer, Orkun S.

2016-01-01

Signalling networks result from combinatorial interactions among many enzymes and scaffolding proteins. These complex systems generate response dynamics that are often essential for correct decision-making in cells. Uncovering biochemical design principles that underpin such response dynamics is a prerequisite to understand evolved signalling networks and to design synthetic ones. Here, we use in silico evolution to explore the possible biochemical design space for signalling networks displaying ultrasensitive and adaptive response dynamics. By running evolutionary simulations mimicking different biochemical scenarios, we find that enzyme sequestration emerges as a key mechanism for enabling such dynamics. Inspired by these findings, and to test the role of sequestration, we design a generic, minimalist model of a signalling cycle, featuring two enzymes and a single scaffolding protein. We show that this simple system is capable of displaying both ultrasensitive and adaptive response dynamics. Furthermore, we find that tuning the concentration or kinetics of the sequestering protein can shift system dynamics between these two response types. These empirical results suggest that enzyme sequestration through scaffolding proteins is exploited by evolution to generate diverse response dynamics in signalling networks and could provide an engineering point in synthetic biology applications. PMID:27163612

Dynamic Network Logistic Regression: A Logistic Choice Analysis of Inter- and Intra-Group Blog Citation Dynamics in the 2004 US Presidential Election

PubMed Central

2013-01-01

Methods for analysis of network dynamics have seen great progress in the past decade. This article shows how Dynamic Network Logistic Regression techniques (a special case of the Temporal Exponential Random Graph Models) can be used to implement decision theoretic models for network dynamics in a panel data context. We also provide practical heuristics for model building and assessment. We illustrate the power of these techniques by applying them to a dynamic blog network sampled during the 2004 US presidential election cycle. This is a particularly interesting case because it marks the debut of Internet-based media such as blogs and social networking web sites as institutionally recognized features of the American political landscape. Using a longitudinal sample of all Democratic National Convention/Republican National Convention–designated blog citation networks, we are able to test the influence of various strategic, institutional, and balance-theoretic mechanisms as well as exogenous factors such as seasonality and political events on the propensity of blogs to cite one another over time. Using a combination of deviance-based model selection criteria and simulation-based model adequacy tests, we identify the combination of processes that best characterizes the choice behavior of the contending blogs. PMID:24143060

A network dynamics approach to chemical reaction networks

NASA Astrophysics Data System (ADS)

van der Schaft, A. J.; Rao, S.; Jayawardhana, B.

2016-04-01

A treatment of a chemical reaction network theory is given from the perspective of nonlinear network dynamics, in particular of consensus dynamics. By starting from the complex-balanced assumption, the reaction dynamics governed by mass action kinetics can be rewritten into a form which allows for a very simple derivation of a number of key results in the chemical reaction network theory, and which directly relates to the thermodynamics and port-Hamiltonian formulation of the system. Central in this formulation is the definition of a balanced Laplacian matrix on the graph of chemical complexes together with a resulting fundamental inequality. This immediately leads to the characterisation of the set of equilibria and their stability. Furthermore, the assumption of complex balancedness is revisited from the point of view of Kirchhoff's matrix tree theorem. Both the form of the dynamics and the deduced behaviour are very similar to consensus dynamics, and provide additional perspectives to the latter. Finally, using the classical idea of extending the graph of chemical complexes by a 'zero' complex, a complete steady-state stability analysis of mass action kinetics reaction networks with constant inflows and mass action kinetics outflows is given, and a unified framework is provided for structure-preserving model reduction of this important class of open reaction networks.

Extracting neuronal functional network dynamics via adaptive Granger causality analysis.

PubMed

Sheikhattar, Alireza; Miran, Sina; Liu, Ji; Fritz, Jonathan B; Shamma, Shihab A; Kanold, Patrick O; Babadi, Behtash

2018-04-24

Quantifying the functional relations between the nodes in a network based on local observations is a key challenge in studying complex systems. Most existing time series analysis techniques for this purpose provide static estimates of the network properties, pertain to stationary Gaussian data, or do not take into account the ubiquitous sparsity in the underlying functional networks. When applied to spike recordings from neuronal ensembles undergoing rapid task-dependent dynamics, they thus hinder a precise statistical characterization of the dynamic neuronal functional networks underlying adaptive behavior. We develop a dynamic estimation and inference paradigm for extracting functional neuronal network dynamics in the sense of Granger, by integrating techniques from adaptive filtering, compressed sensing, point process theory, and high-dimensional statistics. We demonstrate the utility of our proposed paradigm through theoretical analysis, algorithm development, and application to synthetic and real data. Application of our techniques to two-photon Ca 2+ imaging experiments from the mouse auditory cortex reveals unique features of the functional neuronal network structures underlying spontaneous activity at unprecedented spatiotemporal resolution. Our analysis of simultaneous recordings from the ferret auditory and prefrontal cortical areas suggests evidence for the role of rapid top-down and bottom-up functional dynamics across these areas involved in robust attentive behavior.

[Report of the third meeting of the coordinators of the regional MRP networks in Germany on 15 and 16 December 2011 at the Robert Koch Institute].

PubMed

Mielke, M

2012-11-01

Since 2004 the Robert Koch-Institute has supported the formation of regional networks for prevention of the spread of methicillin-resistant Staphylococcus aureus and multiresistant pathogens (MRSA/MRP, EpiBull 5/2005)). The third meeting of the coordinators of the regional MRP networks in Germany took place on 15 and 16 December 2011. A total of 60 representatives of the Public Health Services from 12 states participated. It must be emphasized that in the meantime many successfully established networks are active and not all coordinators of existing networks could participate merely due to the organizational format. Interested parties can obtain a good overview via a link to the corresponding internet homepage of each state under http://www.rki.de → Infektionsschutz → Krankenhaushygiene → Regionale Netzwerke. In summary it was clear that the number and the activity of regional MRP networks in Germany have further increased. The networks can synergistically benefit from important experiences through the different individual focal points of each network and a corresponding exchange of ideas.

Toward a Common Vision in Library Networking. Proceedings of the Library of Congress Network Advisory Committee Meeting (Washington, D.C., December 9-11, 1985). Network Planning Paper No. 13.

ERIC Educational Resources Information Center

Harriman, Sigrid G., Ed.

The December 1985 program session of the Library of Congress Network Advisory Committee (NAC) focused on determining the effectiveness of networking, identifying a common vision or goal, and developing a strategy to accomplish that goal. The program session included remarks on the role of the regional networks in national networking by Louella V.…

Strengthening and sustainability of national immunization technical advisory groups (NITAGs) globally: Lessons and recommendations from the founding meeting of the global NITAG network.

PubMed

Adjagba, Alex; MacDonald, Noni E; Ortega-Pérez, Inmaculada; Duclos, Philippe

2017-05-25

National Immunization Technical Advisory Groups (NITAGs) provide independent, evidence-informed advice to assist their governments in immunization policy formation. However, many NITAGs face challenges in fulfilling their roles. Hence the many requests for formation of a network linking NITAGs together so they can learn from each other. To address this request, the Health Policy and Institutional Development (HPID) Center (a WHO Collaborating Center at the Agence de Médecine Préventive - AMP), in collaboration with WHO, organized a meeting in Veyrier-du-Lac, France, on 11 and 12 May 2016, to establish a Global NITAG Network (GNN). The meeting focused on two areas: the requirements for (a) the establishment of a global NITAG collaborative network; and (b) the global assessment/evaluation of the performance of NITAGs. 35 participants from 26 countries reviewed the proposed GNN framework documents and NITAG performance evaluation. Participants recommended that a GNN should be established, agreed on its governance, function, scope and a proposed work plan as well as setting a framework for NITAG evaluation. Copyright © 2017.

A reduction for spiking integrate-and-fire network dynamics ranging from homogeneity to synchrony.

PubMed

Zhang, J W; Rangan, A V

2015-04-01

In this paper we provide a general methodology for systematically reducing the dynamics of a class of integrate-and-fire networks down to an augmented 4-dimensional system of ordinary-differential-equations. The class of integrate-and-fire networks we focus on are homogeneously-structured, strongly coupled, and fluctuation-driven. Our reduction succeeds where most current firing-rate and population-dynamics models fail because we account for the emergence of 'multiple-firing-events' involving the semi-synchronous firing of many neurons. These multiple-firing-events are largely responsible for the fluctuations generated by the network and, as a result, our reduction faithfully describes many dynamic regimes ranging from homogeneous to synchronous. Our reduction is based on first principles, and provides an analyzable link between the integrate-and-fire network parameters and the relatively low-dimensional dynamics underlying the 4-dimensional augmented ODE.

Modeling the dynamical interaction between epidemics on overlay networks

NASA Astrophysics Data System (ADS)

Marceau, Vincent; Noël, Pierre-André; Hébert-Dufresne, Laurent; Allard, Antoine; Dubé, Louis J.

2011-08-01

Epidemics seldom occur as isolated phenomena. Typically, two or more viral agents spread within the same host population and may interact dynamically with each other. We present a general model where two viral agents interact via an immunity mechanism as they propagate simultaneously on two networks connecting the same set of nodes. By exploiting a correspondence between the propagation dynamics and a dynamical process performing progressive network generation, we develop an analytical approach that accurately captures the dynamical interaction between epidemics on overlay networks. The formalism allows for overlay networks with arbitrary joint degree distribution and overlap. To illustrate the versatility of our approach, we consider a hypothetical delayed intervention scenario in which an immunizing agent is disseminated in a host population to hinder the propagation of an undesirable agent (e.g., the spread of preventive information in the context of an emerging infectious disease).

Effect of memory in non-Markovian Boolean networks illustrated with a case study: A cell cycling process

NASA Astrophysics Data System (ADS)

Ebadi, H.; Saeedian, M.; Ausloos, M.; Jafari, G. R.

2016-11-01

The Boolean network is one successful model to investigate discrete complex systems such as the gene interacting phenomenon. The dynamics of a Boolean network, controlled with Boolean functions, is usually considered to be a Markovian (memory-less) process. However, both self-organizing features of biological phenomena and their intelligent nature should raise some doubt about ignoring the history of their time evolution. Here, we extend the Boolean network Markovian approach: we involve the effect of memory on the dynamics. This can be explored by modifying Boolean functions into non-Markovian functions, for example, by investigating the usual non-Markovian threshold function —one of the most applied Boolean functions. By applying the non-Markovian threshold function on the dynamical process of the yeast cell cycle network, we discover a power-law-like memory with a more robust dynamics than the Markovian dynamics.

75 FR 18512 - National Institute of Mental Health; Notice of Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2010-04-12

... U.S.C. App.), notice is hereby given of an Interagency Autism Coordinating Committee (IACC) meeting... several presentations on a variety of topics: the Autism Treatment Network, changes in the DSM-V related to autism, stem cell research, non-verbal autism and comparative effectiveness research. The meeting...

The kinematic response of Petermann Glacier, Greenland to ice shelf perturbation

NASA Astrophysics Data System (ADS)

Hubbard, A.; Box, J. E.; Bates, R.; Nick, F.; Luckman, A. J.; van de Wal, R.; Doyle, S. H.

2010-12-01

The acceleration and dynamic thinning of interior zones of the polar ice sheets due to outlet/ice shelf retreat has been identified as a factor hastening their demise and contribution to global sea-level rise. The detachment of a 275 square km area of the Petermann Glacier ice shelf in August, 2010 presents a natural experiment to investigate the timing, mechanisms and efficacy of upstream dynamic feedbacks resulting from a singular but potentially significant frontal perturbation. In 2009, a permanent geodetic/differential GPS strain network logging every 10 seconds was deployed along a 200 km longitudinal profile from the ice front across the grounding line extending into the interior of Petermann Glacier to characterize the system’s state before, during and after any such event. We present an overview of the geophysical measurements conducted and analyze the kinematics of the shelf detachment in relation to local environmental forcing. Finally, we discuss the postulated instantaneous and ongoing evolution in force-balance and concomitant dynamic response resulting from the perturbation along with its implications for Petermann's ongoing stability. Petermann Glacier GNSS base & telemetric GPS facility: community AA & rehab meet point. On ice geodetic-GPS station flat out & reading 0 Volts

Signalling networks and dynamics of allosteric transitions in bacterial chaperonin GroEL: implications for iterative annealing of misfolded proteins.

PubMed

Thirumalai, D; Hyeon, Changbong

2018-06-19

Signal transmission at the molecular level in many biological complexes occurs through allosteric transitions. Allostery describes the responses of a complex to binding of ligands at sites that are spatially well separated from the binding region. We describe the structural perturbation method, based on phonon propagation in solids, which can be used to determine the signal-transmitting allostery wiring diagram (AWD) in large but finite-sized biological complexes. Application to the bacterial chaperonin GroEL-GroES complex shows that the AWD determined from structures also drives the allosteric transitions dynamically. From both a structural and dynamical perspective these transitions are largely determined by formation and rupture of salt-bridges. The molecular description of allostery in GroEL provides insights into its function, which is quantitatively described by the iterative annealing mechanism. Remarkably, in this complex molecular machine, a deep connection is established between the structures, reaction cycle during which GroEL undergoes a sequence of allosteric transitions, and function, in a self-consistent manner.This article is part of a discussion meeting issue 'Allostery and molecular machines'. © 2018 The Author(s).

Psychology and social networks: a dynamic network theory perspective.

PubMed

Westaby, James D; Pfaff, Danielle L; Redding, Nicholas

2014-04-01

Research on social networks has grown exponentially in recent years. However, despite its relevance, the field of psychology has been relatively slow to explain the underlying goal pursuit and resistance processes influencing social networks in the first place. In this vein, this article aims to demonstrate how a dynamic network theory perspective explains the way in which social networks influence these processes and related outcomes, such as goal achievement, performance, learning, and emotional contagion at the interpersonal level of analysis. The theory integrates goal pursuit, motivation, and conflict conceptualizations from psychology with social network concepts from sociology and organizational science to provide a taxonomy of social network role behaviors, such as goal striving, system supporting, goal preventing, system negating, and observing. This theoretical perspective provides psychologists with new tools to map social networks (e.g., dynamic network charts), which can help inform the development of change interventions. Implications for social, industrial-organizational, and counseling psychology as well as conflict resolution are discussed, and new opportunities for research are highlighted, such as those related to dynamic network intelligence (also known as cognitive accuracy), levels of analysis, methodological/ethical issues, and the need to theoretically broaden the study of social networking and social media behavior. (PsycINFO Database Record (c) 2014 APA, all rights reserved).

The many faces of graph dynamics

NASA Astrophysics Data System (ADS)

Pignolet, Yvonne Anne; Roy, Matthieu; Schmid, Stefan; Tredan, Gilles

2017-06-01

The topological structure of complex networks has fascinated researchers for several decades, resulting in the discovery of many universal properties and reoccurring characteristics of different kinds of networks. However, much less is known today about the network dynamics: indeed, complex networks in reality are not static, but rather dynamically evolve over time. Our paper is motivated by the empirical observation that network evolution patterns seem far from random, but exhibit structure. Moreover, the specific patterns appear to depend on the network type, contradicting the existence of a ‘one fits it all’ model. However, we still lack observables to quantify these intuitions, as well as metrics to compare graph evolutions. Such observables and metrics are needed for extrapolating or predicting evolutions, as well as for interpolating graph evolutions. To explore the many faces of graph dynamics and to quantify temporal changes, this paper suggests to build upon the concept of centrality, a measure of node importance in a network. In particular, we introduce the notion of centrality distance, a natural similarity measure for two graphs which depends on a given centrality, characterizing the graph type. Intuitively, centrality distances reflect the extent to which (non-anonymous) node roles are different or, in case of dynamic graphs, have changed over time, between two graphs. We evaluate the centrality distance approach for five evolutionary models and seven real-world social and physical networks. Our results empirically show the usefulness of centrality distances for characterizing graph dynamics compared to a null-model of random evolution, and highlight the differences between the considered scenarios. Interestingly, our approach allows us to compare the dynamics of very different networks, in terms of scale and evolution speed.

Dynamic social networks promote cooperation in experiments with humans

PubMed Central

Rand, David G.; Arbesman, Samuel; Christakis, Nicholas A.

2011-01-01

Human populations are both highly cooperative and highly organized. Human interactions are not random but rather are structured in social networks. Importantly, ties in these networks often are dynamic, changing in response to the behavior of one's social partners. This dynamic structure permits an important form of conditional action that has been explored theoretically but has received little empirical attention: People can respond to the cooperation and defection of those around them by making or breaking network links. Here, we present experimental evidence of the power of using strategic link formation and dissolution, and the network modification it entails, to stabilize cooperation in sizable groups. Our experiments explore large-scale cooperation, where subjects’ cooperative actions are equally beneficial to all those with whom they interact. Consistent with previous research, we find that cooperation decays over time when social networks are shuffled randomly every round or are fixed across all rounds. We also find that, when networks are dynamic but are updated only infrequently, cooperation again fails. However, when subjects can update their network connections frequently, we see a qualitatively different outcome: Cooperation is maintained at a high level through network rewiring. Subjects preferentially break links with defectors and form new links with cooperators, creating an incentive to cooperate and leading to substantial changes in network structure. Our experiments confirm the predictions of a set of evolutionary game theoretic models and demonstrate the important role that dynamic social networks can play in supporting large-scale human cooperation. PMID:22084103

Practical synchronization on complex dynamical networks via optimal pinning control

NASA Astrophysics Data System (ADS)

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

2015-07-01

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

Estimating spatio-temporal dynamics of stream total phosphate concentration by soft computing techniques.

PubMed

Chang, Fi-John; Chen, Pin-An; Chang, Li-Chiu; Tsai, Yu-Hsuan

2016-08-15

This study attempts to model the spatio-temporal dynamics of total phosphate (TP) concentrations along a river for effective hydro-environmental management. We propose a systematical modeling scheme (SMS), which is an ingenious modeling process equipped with a dynamic neural network and three refined statistical methods, for reliably predicting the TP concentrations along a river simultaneously. Two different types of artificial neural network (BPNN-static neural network; NARX network-dynamic neural network) are constructed in modeling the dynamic system. The Dahan River in Taiwan is used as a study case, where ten-year seasonal water quality data collected at seven monitoring stations along the river are used for model training and validation. Results demonstrate that the NARX network can suitably capture the important dynamic features and remarkably outperforms the BPNN model, and the SMS can effectively identify key input factors, suitably overcome data scarcity, significantly increase model reliability, satisfactorily estimate site-specific TP concentration at seven monitoring stations simultaneously, and adequately reconstruct seasonal TP data into a monthly scale. The proposed SMS can reliably model the dynamic spatio-temporal water pollution variation in a river system for missing, hazardous or costly data of interest. Copyright © 2016 Elsevier B.V. All rights reserved.

Inner-City Networking: Models and Opportunities.

ERIC Educational Resources Information Center

Sparrow, Judith; Vedantham, Anu

1995-01-01

Explores possibilities of inner-city networking, and provides a description of the federal government's Telecommunications and Information Infrastructure Assistance Program (TIIAP). The authors also enumerate the challenges faced by inner-city communities establishing such networks and describes TIIAP-funded programs meeting those challenges that…

Heteroclinic switching between chimeras

NASA Astrophysics Data System (ADS)

Bick, Christian

2018-05-01

Functional oscillator networks, such as neuronal networks in the brain, exhibit switching between metastable states involving many oscillators. We give exact results how such global dynamics can arise in paradigmatic phase oscillator networks: Higher-order network interactions give rise to metastable chimeras—localized frequency synchrony patterns—which are joined by heteroclinic connections. Moreover, we illuminate the mechanisms that underly the switching dynamics in these experimentally accessible networks.

A New View of Dynamic River Networks

NASA Astrophysics Data System (ADS)

Perron, J. T.; Willett, S.; McCoy, S. W.

2014-12-01

River networks are the main conduits that transport water, sediment, and nutrients from continental interiors to the oceans. They also shape topography as they erode through bedrock. These hierarchical networks are dynamic: there are numerous examples of apparent changes in the topology of river networks through geologic time. But these examples are geographically scattered, the evidence can be ambiguous, and the mechanisms that drive changes in river networks are poorly understood. This makes it difficult to assess how pervasive river network reorganization is, how it operates, and how the interlocking river basins that compose a given landscape are changing through time. Recent progress has improved the situation. We describe three developments that have dramatically advanced our understanding of dynamic river networks. First, new topographic, geophysical and geochronological measurement techniques are revealing the rate and extent of river network adjustment. Second, laboratory experiments and computational models are clarifying how river networks respond to tectonic and climatic perturbations at scales ranging from local to continental. Third, spatial analysis of genetic data is exposing links between landscape evolution, biological evolution, and the development of biodiversity. We highlight key problems that remain unsolved, and suggest ways to build on recent advances that will bring dynamic river networks into even sharper focus.

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by dynamically adjusting local routing strategies

DOEpatents

Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

2010-03-16

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Each node implements a respective routing strategy for routing data through the network, the routing strategies not necessarily being the same in every node. The routing strategies implemented in the nodes are dynamically adjusted during application execution to shift network workload as required. Preferably, adjustment of routing policies in selective nodes is performed at synchronization points. The network may be dynamically monitored, and routing strategies adjusted according to detected network conditions.

Networked dynamical systems with linear coupling: synchronisation patterns, coherence and other behaviours.

PubMed

Judd, Kevin

2013-12-01

Many physical and biochemical systems are well modelled as a network of identical non-linear dynamical elements with linear coupling between them. An important question is how network structure affects chaotic dynamics, for example, by patterns of synchronisation and coherence. It is shown that small networks can be characterised precisely into patterns of exact synchronisation and large networks characterised by partial synchronisation at the local and global scale. Exact synchronisation modes are explained using tools of symmetry groups and invariance, and partial synchronisation is explained by finite-time shadowing of exact synchronisation modes.

Communication Dynamics of Blog Networks

NASA Astrophysics Data System (ADS)

Goldberg, Mark; Kelley, Stephen; Magdon-Ismail, Malik; Mertsalov, Konstantin; Wallace, William (Al)

We study the communication dynamics of Blog networks, focusing on the Russian section of LiveJournal as a case study. Communication (blogger-to-blogger links) in such online communication networks is very dynamic: over 60% of the links in the network are new from one week to the next, though the set of bloggers remains approximately constant. Two fundamental questions are: (i) what models adequately describe such dynamic communication behavior; and (ii) how does one detect the phase transitions, i.e. the changes that go beyond the standard high-level dynamics? We approach these questions through the notion of stable statistics. We give strong experimental evidence to the fact that, despite the extreme amount of communication dynamics, several aggregate statistics are remarkably stable. We use stable statistics to test our models of communication dynamics postulating that any good model should produce values for these statistics which are both stable and close to the observed ones. Stable statistics can also be used to identify phase transitions, since any change in a normally stable statistic indicates a substantial change in the nature of the communication dynamics. We describe models of the communication dynamics in large social networks based on the principle of locality of communication: a node's communication energy is spent mostly within its own "social area," the locality of the node.

The influential role of personal advice networks on general practitioners' performance: a social capital perspective.

PubMed

Calciolari, Stefano; González-Ortiz, Laura G; Lega, Federico

2017-08-08

In several health systems of advanced countries, reforms have changed primary care in the last two decades. The literature has assessed the effects of a variety of interventions and individual factors on the behavior of general practitioners (GPs). However, there has been a lack of investigation concerning the influence of the resources embedded in the GPs' personal advice networks (i.e., social capital) on GPs' capacity to meet defined objectives. The present study has two goals: (a) to assess the GPs' personal advice networks according to the social capital framework and (b) to test the influence of such relationships on GPs' capacity to accomplish organizational goals. The data collection relied on administrative data provided by an Italian local health authority (LHA) and a survey administered to the GPs of the selected LHA. The GPs' personal advice networks were assessed through an ad-hoc instrument and interpreted as egocentric networks. Multivariate regression analyses assessed two different performance measures. Social capital may influence the GPs' capacity to meet targets, though the influence differs according to the objective considered. In particular, the higher the professional heterogeneity of a GP personal advice network, the lower her/his capacity is to meet targets of prescriptive appropriateness. Our findings might help to design more effective primary care reforms depending on the pursued goals. However, further research is needed.

Antisynchronization of Two Complex Dynamical Networks

NASA Astrophysics Data System (ADS)

Banerjee, Ranjib; Grosu, Ioan; Dana, Syamal K.

A nonlinear type open-plus-closed-loop (OPCL) coupling is investi-gated for antisynchronization of two complex networks under unidirectional and bidirectional interactions where each node of the networks is considered as a continuous dynamical system. We present analytical results for antisynchroni-zation in identical networks. A numerical example is given for unidirectional coupling with each node represented by a spiking-bursting type Hindmarsh-Rose neuron model. Antisynchronization for mutual interaction is allowed only to inversion symmetric dynamical systems as chosen nodes.

Spatiotemporal Dynamics of a Network of Coupled Time-Delay Digital Tanlock Loops

NASA Astrophysics Data System (ADS)

Paul, Bishwajit; Banerjee, Tanmoy; Sarkar, B. C.

The time-delay digital tanlock loop (TDTLs) is an important class of phase-locked loop that is widely used in electronic communication systems. Although nonlinear dynamics of an isolated TDTL has been studied in the past but the collective behavior of TDTLs in a network is an important topic of research and deserves special attention as in practical communication systems separate entities are rarely isolated. In this paper, we carry out the detailed analysis and numerical simulations to explore the spatiotemporal dynamics of a network of a one-dimensional ring of coupled TDTLs with nearest neighbor coupling. The equation representing the network is derived and we carry out analytical calculations using the circulant matrix formalism to obtain the stability criteria. An extensive numerical simulation reveals that with the variation of gain parameter and coupling strength the network shows a variety of spatiotemporal dynamics such as frozen random pattern, pattern selection, spatiotemporal intermittency and fully developed spatiotemporal chaos. We map the distinct dynamical regions of the system in two-parameter space. Finally, we quantify the spatiotemporal dynamics by using quantitative measures like Lyapunov exponent and the average quadratic deviation of the full network.

Multivariate machine learning distinguishes cross-network dynamic functional connectivity patterns in state and trait neuropathic pain.

PubMed

Cheng, J C; Rogachov, A; Hemington, K S; Kucyi, A; Bosma, R L; Lindquist, M A; Inman, R D; Davis, K D

2018-04-26

Communication within the brain is dynamic. Chronic pain can also be dynamic, with varying intensities experienced over time. Little is known of how brain dynamics are disrupted in chronic pain, or relates to patients' pain assessed at various time-scales (e.g., short-term state versus long-term trait). Patients experience pain "traits" indicative of their general condition, but also pain "states" that vary day to day. Here, we used network-based multivariate machine learning to determine how patterns in dynamic and static brain communication are related to different characteristics and timescales of chronic pain. Our models were based on resting state dynamic and static functional connectivity (dFC, sFC) in patients with chronic neuropathic pain (NP) or non-NP. The most prominent networks in the models were the default mode, salience, and executive control networks. We also found that cross-network measures of dFC rather than sFC were better associated with patients' pain, but only in those with NP features. These associations were also more highly and widely associated with measures of trait rather than state pain. Furthermore, greater dynamic connectivity with executive control networks was associated with milder neuropathic pain, but greater dynamic connectivity with limbic networks was associated greater neuropathic pain. Compared with healthy individuals, the dFC features most highly related to trait neuropathic pain were also more abnormal in patients with greater pain. Our findings indicate that dFC reflects patients' overall pain condition (i.e., trait pain), not just their current state, and is impacted by complexities in pain features beyond intensity.

Phylogenetic investigation of a statewide HIV-1 epidemic reveals ongoing and active transmission networks among men who have sex with men

PubMed Central

Chan, Philip A.; Hogan, Joseph W.; Huang, Austin; DeLong, Allison; Salemi, Marco; Mayer, Kenneth H.; Kantor, Rami

2015-01-01

Background Molecular epidemiologic evaluation of HIV-1 transmission networks can elucidate behavioral components of transmission that can be targets for intervention. Methods We combined phylogenetic and statistical approaches using pol sequences from patients diagnosed 2004-2011 at a large HIV center in Rhode Island, following 75% of the state’s HIV population. Phylogenetic trees were constructed using maximum likelihood and putative transmission clusters were evaluated using latent class analyses (LCA) to determine association of cluster size with underlying demographic/behavioral characteristics. A logistic growth model was used to assess intra-cluster dynamics over time and predict “active” clusters that were more likely to harbor undiagnosed infections. Results Of 1,166 HIV-1 subtype B sequences, 31% were distributed among 114 statistically-supported, monophyletic clusters (range: 2-15 sequences/cluster). Sequences from men who have sex with men (MSM) formed 52% of clusters. LCA demonstrated that sequences from recently diagnosed (2008-2011) MSM with primary HIV infection (PHI) and other sexually transmitted infections (STIs) were more likely to form larger clusters (Odds Ratio 1.62-11.25, p<0.01). MSM in clusters were more likely to have anonymous partners and meet partners at sex clubs and pornographic stores. Four large clusters with 38 sequences (100% male, 89% MSM) had a high-probability of harboring undiagnosed infections and included younger MSM with PHI and STIs. Conclusions In this first large-scale molecular epidemiologic investigation of HIV-1 transmission in New England, sexual networks among recently diagnosed MSM with PHI and concomitant STIs contributed to ongoing transmission. Characterization of transmission dynamics revealed actively growing clusters which may be targets for intervention. PMID:26258569

The dynamics of transmission and the dynamics of networks.

PubMed

Farine, Damien

2017-05-01

A toy example depicted here highlighting the results of a study in this issue of the Journal of Animal Ecology that investigates the impact of network dynamics on potential disease outbreaks. Infections (stars) that spread by contact only (left) reduce the predicted outbreak size compared to situations where individuals can become infected by moving through areas that previously contained infected individuals (right). This is potentially important in species where individuals, or in this case groups, have overlapping ranges (as depicted on the top right). Incorporating network dynamics that maintain information about the ordering of contacts (central blocks; including the ordering of spatial overlap as noted by the arrows that highlight the blue group arriving after the red group in top-right of the figure) is important for capturing how a disease might not have the opportunity to spread to all individuals. By contrast, a static or 'average' network (lower blocks) does not capture any of these dynamics. Interestingly, although static networks generally predict larger outbreak sizes, the authors find that in cases when transmission probability is low, this prediction can switch as a result of changes in the estimated intensity of contacts among individuals. [Colour figure can be viewed at wileyonlinelibrary.com]. Springer, A., Kappeler, P.M. & Nunn, C.L. (2017) Dynamic vs. static social networks in models of parasite transmission: Predicting Cryptosporidium spread in wild lemurs. Journal of Animal Ecology, 86, 419-433. The spread of disease or information through networks can be affected by several factors. Whether and how these factors are accounted for can fundamentally change the predicted impact of a spreading epidemic. Springer, Kappeler & Nunn () investigate the role of different modes of transmission and network dynamics on the predicted size of a disease outbreak across several groups of Verreaux's sifakas, a group-living species of lemur. While some factors, such as seasonality, led to consistent differences in the structure of social networks, using dynamic vs. static representations of networks generated differences in the predicted outbreak size of an emergent disease. These findings highlight some of the challenges associated with studying disease dynamics in animal populations, and the importance of continuing efforts to develop the network tools needed to study disease spread. © 2017 The Author. Journal of Animal Ecology © 2017 British Ecological Society.

Heterogeneous network promotes species coexistence: metapopulation model for rock-paper-scissors game.

PubMed

Nagatani, Takashi; Ichinose, Genki; Tainaka, Kei-Ichi

2018-05-04

Understanding mechanisms of biodiversity has been a central question in ecology. The coexistence of three species in rock-paper-scissors (RPS) systems are discussed by many authors; however, the relation between coexistence and network structure is rarely discussed. Here we present a metapopulation model for RPS game. The total population is assumed to consist of three subpopulations (nodes). Each individual migrates by random walk; the destination of migration is randomly determined. From reaction-migration equations, we obtain the population dynamics. It is found that the dynamic highly depends on network structures. When a network is homogeneous, the dynamics are neutrally stable: each node has a periodic solution, and the oscillations synchronize in all nodes. However, when a network is heterogeneous, the dynamics approach stable focus and all nodes reach equilibriums with different densities. Hence, the heterogeneity of the network promotes biodiversity.

From network heterogeneities to familiarity detection and hippocampal memory management

PubMed Central

Wang, Jane X.; Poe, Gina; Zochowski, Michal

2009-01-01

Hippocampal-neocortical interactions are key to the rapid formation of novel associative memories in the hippocampus and consolidation to long term storage sites in the neocortex. We investigated the role of network correlates during information processing in hippocampal-cortical networks. We found that changes in the intrinsic network dynamics due to the formation of structural network heterogeneities alone act as a dynamical and regulatory mechanism for stimulus novelty and familiarity detection, thereby controlling memory management in the context of memory consolidation. This network dynamic, coupled with an anatomically established feedback between the hippocampus and the neocortex, recovered heretofore unexplained properties of neural activity patterns during memory management tasks which we observed during sleep in multiunit recordings from behaving animals. Our simple dynamical mechanism shows an experimentally matched progressive shift of memory activation from the hippocampus to the neocortex and thus provides the means to achieve an autonomous off-line progression of memory consolidation. PMID:18999453

Optimal forwarding ratio on dynamical networks with heterogeneous mobility

NASA Astrophysics Data System (ADS)

Gan, Yu; Tang, Ming; Yang, Hanxin

2013-05-01

Since the discovery of non-Poisson statistics of human mobility trajectories, more attention has been paid to understand the role of these patterns in different dynamics. In this study, we first introduce the heterogeneous mobility of mobile agents into dynamical networks, and then investigate packet forwarding strategy on the heterogeneous dynamical networks. We find that the faster speed and the higher proportion of high-speed agents can enhance the network throughput and reduce the mean traveling time in random forwarding. A hierarchical structure in the dependence of high-speed is observed: the network throughput remains unchanged at small and large high-speed value. It is also interesting to find that a slightly preferential forwarding to high-speed agents can maximize the network capacity. Through theoretical analysis and numerical simulations, we show that the optimal forwarding ratio stems from the local structural heterogeneity of low-speed agents.

Sponsorship networks. A new model for preserving congregations' presence in the Catholic healthcare ministry.

PubMed

Gillis, V

1993-04-01

A renewal of vision is necessary today as healthcare shifts from an acute care to a community health focus. In regions where there are multiple sponsors, they can foster this renewed vision by forming sponsorship networks. A sponsorship network begins when sponsors in a region come together to discuss collaboration and explore ways to motivate the leaders of their institutions to better meet their community's healthcare needs. A sponsorship network would focus on community health through more effective resource use and integration of resources among providers. Such a network encourages providers to assess community needs and collaborate to meet them, provides criteria for maintaining quality and mission, and explores sponsorship responsibilities within institutions and beyond. The collaborative process involves five stages: preplanning, foundation building, problem setting, implementing, and assessing. A group of sponsors in St. Louis provides an example of how sponsors can initiate such a process.

77 FR 55799 - Sunshine Act Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2012-09-11

... East Broadcasting Networks. The public may attend this meeting in person at BBG headquarters in DC as... http://bbgboardmeetingsept2012.eventbrite.com by 10 a.m. (EDT) on September 12. For more information...

Passivity of Directed and Undirected Complex Dynamical Networks With Adaptive Coupling Weights.

PubMed

Wang, Jin-Liang; Wu, Huai-Ning; Huang, Tingwen; Ren, Shun-Yan; Wu, Jigang

2017-08-01

A complex dynamical network consisting of N identical neural networks with reaction-diffusion terms is considered in this paper. First, several passivity definitions for the systems with different dimensions of input and output are given. By utilizing some inequality techniques, several criteria are presented, ensuring the passivity of the complex dynamical network under the designed adaptive law. Then, we discuss the relationship between the synchronization and output strict passivity of the proposed network model. Furthermore, these results are extended to the case when the topological structure of the network is undirected. Finally, two examples with numerical simulations are provided to illustrate the correctness and effectiveness of the proposed results.

Competition-Driven Network Dynamics: Emergence of a Scale-Free Leadership Structure and Collective Efficiency

NASA Astrophysics Data System (ADS)

Anghel, M.; Toroczkai, Zoltán; Bassler, Kevin E.; Korniss, G.

2004-02-01

Using the minority game as a model for competition dynamics, we investigate the effects of interagent communications across a network on the global evolution of the game. Agent communication across this network leads to the formation of an influence network, which is dynamically coupled to the evolution of the game, and it is responsible for the information flow driving the agents' actions. We show that the influence network spontaneously develops hubs with a broad distribution of in-degrees, defining a scale-free robust leadership structure. Furthermore, in realistic parameter ranges, facilitated by information exchange on the network, agents can generate a high degree of cooperation making the collective almost maximally efficient.

Generalized master equations for non-Poisson dynamics on networks.

PubMed

Hoffmann, Till; Porter, Mason A; Lambiotte, Renaud

2012-10-01

The traditional way of studying temporal networks is to aggregate the dynamics of the edges to create a static weighted network. This implicitly assumes that the edges are governed by Poisson processes, which is not typically the case in empirical temporal networks. Accordingly, we examine the effects of non-Poisson inter-event statistics on the dynamics of edges, and we apply the concept of a generalized master equation to the study of continuous-time random walks on networks. We show that this equation reduces to the standard rate equations when the underlying process is Poissonian and that its stationary solution is determined by an effective transition matrix whose leading eigenvector is easy to calculate. We conduct numerical simulations and also derive analytical results for the stationary solution under the assumption that all edges have the same waiting-time distribution. We discuss the implications of our work for dynamical processes on temporal networks and for the construction of network diagnostics that take into account their nontrivial stochastic nature.

Generalized master equations for non-Poisson dynamics on networks

NASA Astrophysics Data System (ADS)

Hoffmann, Till; Porter, Mason A.; Lambiotte, Renaud

2012-10-01

The traditional way of studying temporal networks is to aggregate the dynamics of the edges to create a static weighted network. This implicitly assumes that the edges are governed by Poisson processes, which is not typically the case in empirical temporal networks. Accordingly, we examine the effects of non-Poisson inter-event statistics on the dynamics of edges, and we apply the concept of a generalized master equation to the study of continuous-time random walks on networks. We show that this equation reduces to the standard rate equations when the underlying process is Poissonian and that its stationary solution is determined by an effective transition matrix whose leading eigenvector is easy to calculate. We conduct numerical simulations and also derive analytical results for the stationary solution under the assumption that all edges have the same waiting-time distribution. We discuss the implications of our work for dynamical processes on temporal networks and for the construction of network diagnostics that take into account their nontrivial stochastic nature.

Complex networks under dynamic repair model

NASA Astrophysics Data System (ADS)

Chaoqi, Fu; Ying, Wang; Kun, Zhao; Yangjun, Gao

2018-01-01

Invulnerability is not the only factor of importance when considering complex networks' security. It is also critical to have an effective and reasonable repair strategy. Existing research on network repair is confined to the static model. The dynamic model makes better use of the redundant capacity of repaired nodes and repairs the damaged network more efficiently than the static model; however, the dynamic repair model is complex and polytropic. In this paper, we construct a dynamic repair model and systematically describe the energy-transfer relationships between nodes in the repair process of the failure network. Nodes are divided into three types, corresponding to three structures. We find that the strong coupling structure is responsible for secondary failure of the repaired nodes and propose an algorithm that can select the most suitable targets (nodes or links) to repair the failure network with minimal cost. Two types of repair strategies are identified, with different effects under the two energy-transfer rules. The research results enable a more flexible approach to network repair.

Dynamic Network Drivers of Seizure Generation, Propagation and Termination in Human Neocortical Epilepsy

PubMed Central

Khambhati, Ankit N.; Davis, Kathryn A.; Oommen, Brian S.; Chen, Stephanie H.; Lucas, Timothy H.; Litt, Brian; Bassett, Danielle S.

2015-01-01

The epileptic network is characterized by pathologic, seizure-generating ‘foci’ embedded in a web of structural and functional connections. Clinically, seizure foci are considered optimal targets for surgery. However, poor surgical outcome suggests a complex relationship between foci and the surrounding network that drives seizure dynamics. We developed a novel technique to objectively track seizure states from dynamic functional networks constructed from intracranial recordings. Each dynamical state captures unique patterns of network connections that indicate synchronized and desynchronized hubs of neural populations. Our approach suggests that seizures are generated when synchronous relationships near foci work in tandem with rapidly changing desynchronous relationships from the surrounding epileptic network. As seizures progress, topographical and geometrical changes in network connectivity strengthen and tighten synchronous connectivity near foci—a mechanism that may aid seizure termination. Collectively, our observations implicate distributed cortical structures in seizure generation, propagation and termination, and may have practical significance in determining which circuits to modulate with implantable devices. PMID:26680762

Interaction Control to Synchronize Non-synchronizable Networks

PubMed Central

Schröder, Malte; Chakraborty, Sagar; Witthaut, Dirk; Nagler, Jan; Timme, Marc

2016-01-01

Synchronization constitutes one of the most fundamental collective dynamics across networked systems and often underlies their function. Whether a system may synchronize depends on the internal unit dynamics as well as the topology and strength of their interactions. For chaotic units with certain interaction topologies synchronization might be impossible across all interaction strengths, meaning that these networks are non-synchronizable. Here we propose the concept of interaction control, generalizing transient uncoupling, to induce desired collective dynamics in complex networks and apply it to synchronize even such non-synchronizable systems. After highlighting that non-synchronizability prevails for a wide range of networks of arbitrary size, we explain how a simple binary control may localize interactions in state space and thereby synchronize networks. Intriguingly, localizing interactions by a fixed control scheme enables stable synchronization across all connected networks regardless of topological constraints. Interaction control may thus ease the design of desired collective dynamics even without knowledge of the networks’ exact interaction topology and consequently have implications for biological and self-organizing technical systems. PMID:27853266

Dynamic network expansion, contraction, and connectivity in the river corridor of mountain stream network

NASA Astrophysics Data System (ADS)

Ward, A. S.; Schmadel, N.; Wondzell, S. M.

2017-12-01

River networks are broadly recognized to expand and contract in response to hydrologic forcing. Additionally, the individual controls on river corridor dynamics of hydrologic forcing and geologic setting are well recognized. However, we currently lack tools to integrate our understanding of process dynamics in the river corridor and make predictions at the scale of river networks. In this study, we develop a perceptual model of the river corridor in mountain river networks, translate this into a reduced-complexity mechanistic model, and implement the model in a well-studied headwater catchment. We found that the river network was most sensitive to hydrologic dynamics under the lowest discharges (Qgauge < 1 L s-1). We also demonstrate a discharge-dependence on the dominant controls on network expansion, contraction, and river corridor exchange. Finally, we suggest this parsimonious model will be useful to managers of water resources who need to estimate connectivity and flow initiation location along the river corridor over broad, unstudied catchments.

A dynamical framework for integrated corridor management.

DOT National Transportation Integrated Search

2016-01-11

We develop analysis and control synthesis tools for dynamic traffic flow over networks. Our analysis : relies on exploiting monotonicity properties of the dynamics, and on adapting relevant tools from : stochastic queuing networks. We develop proport...

The relationship between structure and function in locally observed complex networks

NASA Astrophysics Data System (ADS)

Comin, Cesar H.; Viana, Matheus P.; Costa, Luciano da F.

2013-01-01

Recently, studies looking at the small scale interactions taking place in complex networks have started to unveil the wealth of interactions that occur between groups of nodes. Such findings make the claim for a new systematic methodology to quantify, at node level, how dynamics are influenced (or differentiated) by the structure of the underlying system. Here we define a new measure that, based on the dynamical characteristics obtained for a large set of initial conditions, compares the dynamical behavior of the nodes present in the system. Through this measure, we find that the geographic and Barabási-Albert models have a high capacity for generating networks that exhibit groups of nodes with distinct dynamics compared to the rest of the network. The application of our methodology is illustrated with respect to two real systems. In the first we use the neuronal network of the nematode Caenorhabditis elegans to show that the interneurons of the ventral cord of the nematode present a very large dynamical differentiation when compared to the rest of the network. The second application concerns the SIS epidemic model on an airport network, where we quantify how different the distribution of infection times of high and low degree nodes can be, when compared to the expected value for the network.

Learning State Space Dynamics in Recurrent Networks

NASA Astrophysics Data System (ADS)

Simard, Patrice Yvon

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

Topological Principles of Control in Dynamical Networks

NASA Astrophysics Data System (ADS)

Kim, Jason; Pasqualetti, Fabio; Bassett, Danielle

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

Optimal interdependence enhances the dynamical robustness of complex systems.

PubMed

Singh, Rishu Kumar; Sinha, Sitabhra

2017-08-01

Although interdependent systems have usually been associated with increased fragility, we show that strengthening the interdependence between dynamical processes on different networks can make them more likely to survive over long times. By coupling the dynamics of networks that in isolation exhibit catastrophic collapse with extinction of nodal activity, we demonstrate system-wide persistence of activity for an optimal range of interdependence between the networks. This is related to the appearance of attractors of the global dynamics comprising disjoint sets ("islands") of stable activity.

Optimal interdependence enhances the dynamical robustness of complex systems

NASA Astrophysics Data System (ADS)

Singh, Rishu Kumar; Sinha, Sitabhra

2017-08-01

Although interdependent systems have usually been associated with increased fragility, we show that strengthening the interdependence between dynamical processes on different networks can make them more likely to survive over long times. By coupling the dynamics of networks that in isolation exhibit catastrophic collapse with extinction of nodal activity, we demonstrate system-wide persistence of activity for an optimal range of interdependence between the networks. This is related to the appearance of attractors of the global dynamics comprising disjoint sets ("islands") of stable activity.

Source and Size of Emotional and Financial-Related Social Support Network on Physical Activity Behavior Among Older Adults.

PubMed

Loprinzi, Paul D; Joyner, Chelsea

2016-07-01

To examine the association of source of emotional- and financial-related social support and size of social support network on physical activity behavior among older adults. Data from the 1999-2006 NHANES were used (N = 5616; 60 to 85 yrs). Physical activity and emotional- and financial-related social support were assessed via self-report. Older adults with perceived having emotional social support had a 41% increased odds of meeting physical activity guidelines (OR = 1.41; 95% CI: 1.01-1.97). The only specific sources of social support that were associated with meeting physical activity guidelines was friend emotional support (OR = 1.19; 95% CI: 1.01-1.41) and financial support (OR = 1.28; 95% CI: 1.09-1.49). With regard to size of social support network, a dose-response relationship was observed. Compared with those with 0 close friends, those with 1 to 2, 3 to 4, 5, and 6+ close friends, respectively, had a 1.70-, 2.38-, 2.57-, and 2.71-fold increased odds of meeting physical activity guidelines. There was some evidence of gender- and age-specific associations between social support and physical activity. Emotional- and financial-related social support and size of social support network are associated with higher odds of meeting physical activity guidelines among older adults.

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

PubMed

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

2015-08-01

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

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

PubMed Central

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

2015-01-01

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

Simulating market dynamics: interactions between consumer psychology and social networks.

PubMed

Janssen, Marco A; Jager, Wander

2003-01-01

Markets can show different types of dynamics, from quiet markets dominated by one or a few products, to markets with continual penetration of new and reintroduced products. In a previous article we explored the dynamics of markets from a psychological perspective using a multi-agent simulation model. The main results indicated that the behavioral rules dominating the artificial consumer's decision making determine the resulting market dynamics, such as fashions, lock-in, and unstable renewal. Results also show the importance of psychological variables like social networks, preferences, and the need for identity to explain the dynamics of markets. In this article we extend this work in two directions. First, we will focus on a more systematic investigation of the effects of different network structures. The previous article was based on Watts and Strogatz's approach, which describes the small-world and clustering characteristics in networks. More recent research demonstrated that many large networks display a scale-free power-law distribution for node connectivity. In terms of market dynamics this may imply that a small proportion of consumers may have an exceptional influence on the consumptive behavior of others (hubs, or early adapters). We show that market dynamics is a self-organized property depending on the interaction between the agents' decision-making process (heuristics), the product characteristics (degree of satisfaction of unit of consumption, visibility), and the structure of interactions between agents (size of network and hubs in a social network).

Asymptotic theory of time-varying social networks with heterogeneous activity and tie allocation.

PubMed

Ubaldi, Enrico; Perra, Nicola; Karsai, Márton; Vezzani, Alessandro; Burioni, Raffaella; Vespignani, Alessandro

2016-10-24

The dynamic of social networks is driven by the interplay between diverse mechanisms that still challenge our theoretical and modelling efforts. Amongst them, two are known to play a central role in shaping the networks evolution, namely the heterogeneous propensity of individuals to i) be socially active and ii) establish a new social relationships with their alters. Here, we empirically characterise these two mechanisms in seven real networks describing temporal human interactions in three different settings: scientific collaborations, Twitter mentions, and mobile phone calls. We find that the individuals' social activity and their strategy in choosing ties where to allocate their social interactions can be quantitatively described and encoded in a simple stochastic network modelling framework. The Master Equation of the model can be solved in the asymptotic limit. The analytical solutions provide an explicit description of both the system dynamic and the dynamical scaling laws characterising crucial aspects about the evolution of the networks. The analytical predictions match with accuracy the empirical observations, thus validating the theoretical approach. Our results provide a rigorous dynamical system framework that can be extended to include other processes shaping social dynamics and to generate data driven predictions for the asymptotic behaviour of social networks.

Asymptotic theory of time-varying social networks with heterogeneous activity and tie allocation

NASA Astrophysics Data System (ADS)

Ubaldi, Enrico; Perra, Nicola; Karsai, Márton; Vezzani, Alessandro; Burioni, Raffaella; Vespignani, Alessandro

2016-10-01

The dynamic of social networks is driven by the interplay between diverse mechanisms that still challenge our theoretical and modelling efforts. Amongst them, two are known to play a central role in shaping the networks evolution, namely the heterogeneous propensity of individuals to i) be socially active and ii) establish a new social relationships with their alters. Here, we empirically characterise these two mechanisms in seven real networks describing temporal human interactions in three different settings: scientific collaborations, Twitter mentions, and mobile phone calls. We find that the individuals’ social activity and their strategy in choosing ties where to allocate their social interactions can be quantitatively described and encoded in a simple stochastic network modelling framework. The Master Equation of the model can be solved in the asymptotic limit. The analytical solutions provide an explicit description of both the system dynamic and the dynamical scaling laws characterising crucial aspects about the evolution of the networks. The analytical predictions match with accuracy the empirical observations, thus validating the theoretical approach. Our results provide a rigorous dynamical system framework that can be extended to include other processes shaping social dynamics and to generate data driven predictions for the asymptotic behaviour of social networks.

Genomic analysis reveals a tight link between transcription factor dynamics and regulatory network architecture.

PubMed

Jothi, Raja; Balaji, S; Wuster, Arthur; Grochow, Joshua A; Gsponer, Jörg; Przytycka, Teresa M; Aravind, L; Babu, M Madan

2009-01-01

Although several studies have provided important insights into the general principles of biological networks, the link between network organization and the genome-scale dynamics of the underlying entities (genes, mRNAs, and proteins) and its role in systems behavior remain unclear. Here we show that transcription factor (TF) dynamics and regulatory network organization are tightly linked. By classifying TFs in the yeast regulatory network into three hierarchical layers (top, core, and bottom) and integrating diverse genome-scale datasets, we find that the TFs have static and dynamic properties that are similar within a layer and different across layers. At the protein level, the top-layer TFs are relatively abundant, long-lived, and noisy compared with the core- and bottom-layer TFs. Although variability in expression of top-layer TFs might confer a selective advantage, as this permits at least some members in a clonal cell population to initiate a response to changing conditions, tight regulation of the core- and bottom-layer TFs may minimize noise propagation and ensure fidelity in regulation. We propose that the interplay between network organization and TF dynamics could permit differential utilization of the same underlying network by distinct members of a clonal cell population.

Dynamic recruitment of resting state sub-networks

PubMed Central

O'Neill, George C.; Bauer, Markus; Woolrich, Mark W.; Morris, Peter G.; Barnes, Gareth R.; Brookes, Matthew J.

2015-01-01

Resting state networks (RSNs) are of fundamental importance in human systems neuroscience with evidence suggesting that they are integral to healthy brain function and perturbed in pathology. Despite rapid progress in this area, the temporal dynamics governing the functional connectivities that underlie RSN structure remain poorly understood. Here, we present a framework to help further our understanding of RSN dynamics. We describe a methodology which exploits the direct nature and high temporal resolution of magnetoencephalography (MEG). This technique, which builds on previous work, extends from solving fundamental confounds in MEG (source leakage) to multivariate modelling of transient connectivity. The resulting processing pipeline facilitates direct (electrophysiological) measurement of dynamic functional networks. Our results show that, when functional connectivity is assessed in small time windows, the canonical sensorimotor network can be decomposed into a number of transiently synchronising sub-networks, recruitment of which depends on current mental state. These rapidly changing sub-networks are spatially focal with, for example, bilateral primary sensory and motor areas resolved into two separate sub-networks. The likely interpretation is that the larger canonical sensorimotor network most often seen in neuroimaging studies reflects only a temporal aggregate of these transient sub-networks. Our approach opens new frontiers to study RSN dynamics, showing that MEG is capable of revealing the spatial, temporal and spectral signature of the human connectome in health and disease. PMID:25899137

Model-free inference of direct network interactions from nonlinear collective dynamics.

PubMed

Casadiego, Jose; Nitzan, Mor; Hallerberg, Sarah; Timme, Marc

2017-12-19

The topology of interactions in network dynamical systems fundamentally underlies their function. Accelerating technological progress creates massively available data about collective nonlinear dynamics in physical, biological, and technological systems. Detecting direct interaction patterns from those dynamics still constitutes a major open problem. In particular, current nonlinear dynamics approaches mostly require to know a priori a model of the (often high dimensional) system dynamics. Here we develop a model-independent framework for inferring direct interactions solely from recording the nonlinear collective dynamics generated. Introducing an explicit dependency matrix in combination with a block-orthogonal regression algorithm, the approach works reliably across many dynamical regimes, including transient dynamics toward steady states, periodic and non-periodic dynamics, and chaos. Together with its capabilities to reveal network (two point) as well as hypernetwork (e.g., three point) interactions, this framework may thus open up nonlinear dynamics options of inferring direct interaction patterns across systems where no model is known.

Dynamic Creative Interaction Networks and Team Creativity Evolution: A Longitudinal Study

ERIC Educational Resources Information Center

Jiang, Hui; Zhang, Qing-Pu; Zhou, Yang

2018-01-01

To assess the dynamical effects of creative interaction networks on team creativity evolution, this paper elaborates a theoretical framework that links the key elements of creative interaction networks, including node, edge and network structure, to creativity in teams. The process of team creativity evolution is divided into four phases,…

Failure and recovery in dynamical networks.

PubMed

Böttcher, L; Luković, M; Nagler, J; Havlin, S; Herrmann, H J

2017-02-03

Failure, damage spread and recovery crucially underlie many spatially embedded networked systems ranging from transportation structures to the human body. Here we study the interplay between spontaneous damage, induced failure and recovery in both embedded and non-embedded networks. In our model the network's components follow three realistic processes that capture these features: (i) spontaneous failure of a component independent of the neighborhood (internal failure), (ii) failure induced by failed neighboring nodes (external failure) and (iii) spontaneous recovery of a component. We identify a metastable domain in the global network phase diagram spanned by the model's control parameters where dramatic hysteresis effects and random switching between two coexisting states are observed. This dynamics depends on the characteristic link length of the embedded system. For the Euclidean lattice in particular, hysteresis and switching only occur in an extremely narrow region of the parameter space compared to random networks. We develop a unifying theory which links the dynamics of our model to contact processes. Our unifying framework may help to better understand controllability in spatially embedded and random networks where spontaneous recovery of components can mitigate spontaneous failure and damage spread in dynamical networks.

Costs for switching partners reduce network dynamics but not cooperative behaviour

PubMed Central

Bednarik, Peter; Fehl, Katrin; Semmann, Dirk

2014-01-01

Social networks represent the structuring of interactions between group members. Above all, many interactions are profoundly cooperative in humans and other animals. In accordance with this natural observation, theoretical work demonstrates that certain network structures favour the evolution of cooperation. Yet, recent experimental evidence suggests that static networks do not enhance cooperative behaviour in humans. By contrast, dynamic networks do foster cooperation. However, costs associated with dynamism such as time or resource investments in finding and establishing new partnerships have been neglected so far. Here, we show that human participants are much less likely to break links when costs arise for building new links. Especially, when costs were high, the network was nearly static. Surprisingly, cooperation levels in Prisoner's Dilemma games were not affected by reduced dynamism in social networks. We conclude that the mere potential to quit collaborations is sufficient in humans to reach high levels of cooperative behaviour. Effects of self-structuring processes or assortment on the network played a minor role: participants simply adjusted their cooperative behaviour in response to the threats of losing a partner or of being expelled. PMID:25122233

Impact of constrained rewiring on network structure and node dynamics

NASA Astrophysics Data System (ADS)

Rattana, P.; Berthouze, L.; Kiss, I. Z.

2014-11-01

In this paper, we study an adaptive spatial network. We consider a susceptible-infected-susceptible (SIS) epidemic on the network, with a link or contact rewiring process constrained by spatial proximity. In particular, we assume that susceptible nodes break links with infected nodes independently of distance and reconnect at random to susceptible nodes available within a given radius. By systematically manipulating this radius we investigate the impact of rewiring on the structure of the network and characteristics of the epidemic. We adopt a step-by-step approach whereby we first study the impact of rewiring on the network structure in the absence of an epidemic, then with nodes assigned a disease status but without disease dynamics, and finally running network and epidemic dynamics simultaneously. In the case of no labeling and no epidemic dynamics, we provide both analytic and semianalytic formulas for the value of clustering achieved in the network. Our results also show that the rewiring radius and the network's initial structure have a pronounced effect on the endemic equilibrium, with increasingly large rewiring radiuses yielding smaller disease prevalence.

Markets on Networks

NASA Astrophysics Data System (ADS)

Toroczkai, Zoltan; Anghel, Marian; Bassler, Kevin; Korniss, Gyorgy

2003-03-01

The dynamics of human, and most biological populations is characterized by competition for resources. By its own nature, this dynamics creates the group of "elites", formed by those agents who have strategies that are the most successful in the given situation, and therefore the rest of the agents will tend to follow, imitate, or interact with them, creating a social structure of leadership in the agent society. These inter-agent communications generate a complex social network with small-world character which itself forms the substrate for a second network, the action network. The latter is a highly dynamic, adaptive, directed network, defined by those inter-agent communication links on the substrate along which the passed information /prediction is acted upon by the other agents. By using the minority game for competition dynamics, here we show that when the substrate network is highly connected, the action network spontaneously develops hubs with a broad distribution of out-degrees, defining a robust leadership structure that is scale-free. Furthermore, in certain, realistic parameter ranges, facilitated by information passing on the action network, agents can spontaneously generate a high degree of cooperation making the collective almost maximally efficient.

Local Difference Measures between Complex Networks for Dynamical System Model Evaluation

PubMed Central

Lange, Stefan; Donges, Jonathan F.; Volkholz, Jan; Kurths, Jürgen

2015-01-01

A faithful modeling of real-world dynamical systems necessitates model evaluation. A recent promising methodological approach to this problem has been based on complex networks, which in turn have proven useful for the characterization of dynamical systems. In this context, we introduce three local network difference measures and demonstrate their capabilities in the field of climate modeling, where these measures facilitate a spatially explicit model evaluation. Building on a recent study by Feldhoff et al. [1] we comparatively analyze statistical and dynamical regional climate simulations of the South American monsoon system. Three types of climate networks representing different aspects of rainfall dynamics are constructed from the modeled precipitation space-time series. Specifically, we define simple graphs based on positive as well as negative rank correlations between rainfall anomaly time series at different locations, and such based on spatial synchronizations of extreme rain events. An evaluation against respective networks built from daily satellite data provided by the Tropical Rainfall Measuring Mission 3B42 V7 reveals far greater differences in model performance between network types for a fixed but arbitrary climate model than between climate models for a fixed but arbitrary network type. We identify two sources of uncertainty in this respect. Firstly, climate variability limits fidelity, particularly in the case of the extreme event network; and secondly, larger geographical link lengths render link misplacements more likely, most notably in the case of the anticorrelation network; both contributions are quantified using suitable ensembles of surrogate networks. Our model evaluation approach is applicable to any multidimensional dynamical system and especially our simple graph difference measures are highly versatile as the graphs to be compared may be constructed in whatever way required. Generalizations to directed as well as edge- and node-weighted graphs are discussed. PMID:25856374

Local difference measures between complex networks for dynamical system model evaluation.

PubMed

Lange, Stefan; Donges, Jonathan F; Volkholz, Jan; Kurths, Jürgen

2015-01-01

A faithful modeling of real-world dynamical systems necessitates model evaluation. A recent promising methodological approach to this problem has been based on complex networks, which in turn have proven useful for the characterization of dynamical systems. In this context, we introduce three local network difference measures and demonstrate their capabilities in the field of climate modeling, where these measures facilitate a spatially explicit model evaluation.Building on a recent study by Feldhoff et al. [8] we comparatively analyze statistical and dynamical regional climate simulations of the South American monsoon system [corrected]. types of climate networks representing different aspects of rainfall dynamics are constructed from the modeled precipitation space-time series. Specifically, we define simple graphs based on positive as well as negative rank correlations between rainfall anomaly time series at different locations, and such based on spatial synchronizations of extreme rain events. An evaluation against respective networks built from daily satellite data provided by the Tropical Rainfall Measuring Mission 3B42 V7 reveals far greater differences in model performance between network types for a fixed but arbitrary climate model than between climate models for a fixed but arbitrary network type. We identify two sources of uncertainty in this respect. Firstly, climate variability limits fidelity, particularly in the case of the extreme event network; and secondly, larger geographical link lengths render link misplacements more likely, most notably in the case of the anticorrelation network; both contributions are quantified using suitable ensembles of surrogate networks. Our model evaluation approach is applicable to any multidimensional dynamical system and especially our simple graph difference measures are highly versatile as the graphs to be compared may be constructed in whatever way required. Generalizations to directed as well as edge- and node-weighted graphs are discussed.

A novel multilayer model for missing link prediction and future link forecasting in dynamic complex networks

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.

Connectivity, excitability and activity patterns in neuronal networks

NASA Astrophysics Data System (ADS)

le Feber, Joost; Stoyanova, Irina I.; Chiappalone, Michela

2014-06-01

Extremely synchronized firing patterns such as those observed in brain diseases like epilepsy may result from excessive network excitability. Although network excitability is closely related to (excitatory) connectivity, a direct measure for network excitability remains unavailable. Several methods currently exist for estimating network connectivity, most of which are related to cross-correlation. An example is the conditional firing probability (CFP) analysis which calculates the pairwise probability (CFPi,j) that electrode j records an action potential at time t = τ, given that electrode i recorded a spike at t = 0. However, electrode i often records multiple spikes within the analysis interval, and CFP values are biased by the on-going dynamic state of the network. Here we show that in a linear approximation this bias may be removed by deconvoluting CFPi,j with the autocorrelation of i (i.e. CFPi,i), to obtain the single pulse response (SPRi,j)—the average response at electrode j to a single spike at electrode i. Thus, in a linear system SPRs would be independent of the dynamic network state. Nonlinear components of synaptic transmission, such as facilitation and short term depression, will however still affect SPRs. Therefore SPRs provide a clean measure of network excitability. We used carbachol and ghrelin to moderately activate cultured cortical networks to affect their dynamic state. Both neuromodulators transformed the bursting firing patterns of the isolated networks into more dispersed firing. We show that the influence of the dynamic state on SPRs is much smaller than the effect on CFPs, but not zero. The remaining difference reflects the alteration in network excitability. We conclude that SPRs are less contaminated by the dynamic network state and that mild excitation may decrease network excitability, possibly through short term synaptic depression.

Elastic Network Models For Biomolecular Dynamics: Theory and Application to Membrane Proteins and Viruses

NASA Astrophysics Data System (ADS)

Lezon, Timothy R.; Shrivastava, Indira H.; Yang, Zheng; Bahar, Ivet

The following sections are included: * Introduction * Theory and Assumptions * Statistical mechanical foundations * Anisotropic network models * Gaussian network model * Rigid block models * Treatment of perturbations * Langevin dynamics * Applications * Membrane proteins * Viruses * Conclusion * References

Dynamical graph theory networks techniques for the analysis of sparse connectivity networks in dementia

NASA Astrophysics Data System (ADS)

Tahmassebi, Amirhessam; Pinker-Domenig, Katja; Wengert, Georg; Lobbes, Marc; Stadlbauer, Andreas; Romero, Francisco J.; Morales, Diego P.; Castillo, Encarnacion; Garcia, Antonio; Botella, Guillermo; Meyer-Bäse, Anke

2017-05-01

Graph network models in dementia have become an important computational technique in neuroscience to study fundamental organizational principles of brain structure and function of neurodegenerative diseases such as dementia. The graph connectivity is reflected in the connectome, the complete set of structural and functional connections of the graph network, which is mostly based on simple Pearson correlation links. In contrast to simple Pearson correlation networks, the partial correlations (PC) only identify direct correlations while indirect associations are eliminated. In addition to this, the state-of-the-art techniques in brain research are based on static graph theory, which is unable to capture the dynamic behavior of the brain connectivity, as it alters with disease evolution. We propose a new research avenue in neuroimaging connectomics based on combining dynamic graph network theory and modeling strategies at different time scales. We present the theoretical framework for area aggregation and time-scale modeling in brain networks as they pertain to disease evolution in dementia. This novel paradigm is extremely powerful, since we can derive both static parameters pertaining to node and area parameters, as well as dynamic parameters, such as system's eigenvalues. By implementing and analyzing dynamically both disease driven PC-networks and regular concentration networks, we reveal differences in the structure of these network that play an important role in the temporal evolution of this disease. The described research is key to advance biomedical research on novel disease prediction trajectories and dementia therapies.

Public/Private Sector Interactions: The Implications for Networking. A Discussion Report Prepared by the Network Advisory Committee.

ERIC Educational Resources Information Center

Network Planning Paper, 1983

1983-01-01

At a 2-day meeting in October 1982, the Library of Congress Network Advisory Committee (NAC) members discussed the complex issues involved in public and private sector interactions and their relationship to networking activities. The report, "Public Sector/Private Sector Interaction in Providing Information Services," prepared by the…

Quantifying the spatio-temporal pattern of the ground impact of space weather events using dynamical networks formed from the SuperMAG database of ground based magnetometer stations.

NASA Astrophysics Data System (ADS)

Dods, Joe; Chapman, Sandra; Gjerloev, Jesper

2016-04-01

Quantitative understanding of the full spatial-temporal pattern of space weather is important in order to estimate the ground impact. Geomagnetic indices such as AE track the peak of a geomagnetic storm or substorm, but cannot capture the full spatial-temporal pattern. Observations by the ~100 ground based magnetometers in the northern hemisphere have the potential to capture the detailed evolution of a given space weather event. We present the first analysis of the full available set of ground based magnetometer observations of substorms using dynamical networks. SuperMAG offers a database containing ground station magnetometer data at a cadence of 1min from 100s stations situated across the globe. We use this data to form dynamic networks which capture spatial dynamics on timescales from the fast reconfiguration seen in the aurora, to that of the substorm cycle. Windowed linear cross-correlation between pairs of magnetometer time series along with a threshold is used to determine which stations are correlated and hence connected in the network. Variations in ground conductivity and differences in the response functions of magnetometers at individual stations are overcome by normalizing to long term averages of the cross-correlation. These results are tested against surrogate data in which phases have been randomised. The network is then a collection of connected points (ground stations); the structure of the network and its variation as a function of time quantify the detailed dynamical processes of the substorm. The network properties can be captured quantitatively in time dependent dimensionless network parameters and we will discuss their behaviour for examples of 'typical' substorms and storms. The network parameters provide a detailed benchmark to compare data with models of substorm dynamics, and can provide new insights on the similarities and differences between substorms and how they correlate with external driving and the internal state of the magnetosphere. We can also investigate the solar wind control of the magnetospheric-ionospheric convection system using dynamical networks. The dynamical networks are first interpolated onto a regular grid. Statistically averaged network responses are then formed for a variety of solar wind conditions, including investigating the network response to southward turnings. [1] Dods, J., S. C. Chapman, and J. W. Gjerloev (2015), Network analysis of geomagnetic substorms using the SuperMAG database of ground-based magnetometer stations, J. Geophys. Res. Space Physics, 120, 7774-7784, doi:10.1002/2015JA021456

Scaling properties in time-varying networks with memory

NASA Astrophysics Data System (ADS)

Kim, Hyewon; Ha, Meesoon; Jeong, Hawoong

2015-12-01

The formation of network structure is mainly influenced by an individual node's activity and its memory, where activity can usually be interpreted as the individual inherent property and memory can be represented by the interaction strength between nodes. In our study, we define the activity through the appearance pattern in the time-aggregated network representation, and quantify the memory through the contact pattern of empirical temporal networks. To address the role of activity and memory in epidemics on time-varying networks, we propose temporal-pattern coarsening of activity-driven growing networks with memory. In particular, we focus on the relation between time-scale coarsening and spreading dynamics in the context of dynamic scaling and finite-size scaling. Finally, we discuss the universality issue of spreading dynamics on time-varying networks for various memory-causality tests.