WorldWideScience

Sample records for multiple network paths

  1. DMP: Detouring Using Multiple Paths against Jamming Attack for Ubiquitous Networking System

    Directory of Open Access Journals (Sweden)

    Mihui Kim

    2010-04-01

    Full Text Available To successfully realize the ubiquitous network environment including home automation or industrial control systems, it is important to be able to resist a jamming attack. This has recently been considered as an extremely threatening attack because it can collapse the entire network, despite the existence of basic security protocols such as encryption and authentication. In this paper, we present a method of jamming attack tolerant routing using multiple paths based on zones. The proposed scheme divides the network into zones, and manages the candidate forward nodes of neighbor zones. After detecting an attack, detour nodes decide zones for rerouting, and detour packets destined for victim nodes through forward nodes in the decided zones. Simulation results show that our scheme increases the PDR (Packet Delivery Ratio and decreases the delay significantly in comparison with rerouting by a general routing protocol on sensor networks, AODV (Ad hoc On Demand Distance Vector, and a conventional JAM (Jammed Area Mapping service with one reroute.

  2. DMP: detouring using multiple paths against jamming attack for ubiquitous networking system.

    Science.gov (United States)

    Kim, Mihui; Chae, Kijoon

    2010-01-01

    To successfully realize the ubiquitous network environment including home automation or industrial control systems, it is important to be able to resist a jamming attack. This has recently been considered as an extremely threatening attack because it can collapse the entire network, despite the existence of basic security protocols such as encryption and authentication. In this paper, we present a method of jamming attack tolerant routing using multiple paths based on zones. The proposed scheme divides the network into zones, and manages the candidate forward nodes of neighbor zones. After detecting an attack, detour nodes decide zones for rerouting, and detour packets destined for victim nodes through forward nodes in the decided zones. Simulation results show that our scheme increases the PDR (Packet Delivery Ratio) and decreases the delay significantly in comparison with rerouting by a general routing protocol on sensor networks, AODV (Ad hoc On Demand Distance Vector), and a conventional JAM (Jammed Area Mapping) service with one reroute.

  3. A path finding implementation for multi-layer networks

    NARCIS (Netherlands)

    Dijkstra, F.; van der Ham, J.; Grosso, P.; de Laat, C.

    2009-01-01

    The goal of the OptIPuter project is to tightly couple research applications with dynamically allocated paths. Since OptIPuter is a multi-disciplinary project, the paths through the network often span multiple network domains, and the applications are challenged to find valid network connections

  4. A path finding implementation for multi-layer network

    NARCIS (Netherlands)

    Dijkstra, F.; Ham, J.J. van der; Grosso, P.; Laat, C. de

    2009-01-01

    The goal of the OptIPuter project is to tightly couple research applications with dynamically allocated paths. Since OptIPuter is a multi-disciplinary project, the paths through the network often span multiple network domains, and the applications are challenged to find valid network connections

  5. Spreading paths in partially observed social networks

    Science.gov (United States)

    Onnela, Jukka-Pekka; Christakis, Nicholas A.

    2012-03-01

    Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.

  6. Spreading paths in partially observed social networks.

    Science.gov (United States)

    Onnela, Jukka-Pekka; Christakis, Nicholas A

    2012-03-01

    Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.

  7. Formation of multiple networks

    DEFF Research Database (Denmark)

    Magnani, Matteo; Rossi, Luca

    2013-01-01

    we introduce the first network formation model for multiple networks. Network formation models are among the most popular tools in traditional network studies, because of both their practical and theoretical impact. However, existing models are not sufficient to describe the generation of multiple...

  8. Spreading paths in partially observed social networks

    OpenAIRE

    Onnela, Jukka-Pekka; Christakis, Nicholas A.

    2012-01-01

    Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using a static, s...

  9. Epidemic extinction paths in complex networks

    Science.gov (United States)

    Hindes, Jason; Schwartz, Ira B.

    2017-05-01

    We study the extinction of long-lived epidemics on finite complex networks induced by intrinsic noise. Applying analytical techniques to the stochastic susceptible-infected-susceptible model, we predict the distribution of large fluctuations, the most probable or optimal path through a network that leads to a disease-free state from an endemic state, and the average extinction time in general configurations. Our predictions agree with Monte Carlo simulations on several networks, including synthetic weighted and degree-distributed networks with degree correlations, and an empirical high school contact network. In addition, our approach quantifies characteristic scaling patterns for the optimal path and distribution of large fluctuations, both near and away from the epidemic threshold, in networks with heterogeneous eigenvector centrality and degree distributions.

  10. Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

    Directory of Open Access Journals (Sweden)

    Zhenghao Xi

    2014-01-01

    Full Text Available To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.

  11. Search for minimal paths in modified networks

    International Nuclear Information System (INIS)

    Yeh, W.-C.

    2002-01-01

    The problem of searching for all minimal paths (MPs) in a network obtained by modifying the original network, e.g. for network expansion or reinforcement, is discussed and solved in this study. The existing best-known method to solve this problem was a straightforward approach. It needed extensive comparison and verification, and failed to solve some special but important cases. Therefore, a more efficient, intuitive and generalized method to search for all MPs without an extensive research procedure is proposed. In this presentation, first we develop an intuitive algorithm based upon the reformation of all MPs in the original network to search for all MPs in a modified network. Next, the computational complexity of the proposed algorithm is analyzed and compared with the existing methods. Finally, examples illustrate how all MPs are generated in a modified network based upon the reformation of all of the MPs in the corresponding original network

  12. Compact wireless control network protocol with fast path switching

    Directory of Open Access Journals (Sweden)

    Yasutaka Kawamoto

    2017-08-01

    Full Text Available Sensor network protocol stacks require the addition or adjustment of functions based on customer requirements. Sensor network protocols that require low delay and low packet error rate (PER, such as wireless control networks, often adopt time division multiple access (TDMA. However, it is difficult to add or adjust functions in protocol stacks that use TDMA methods. Therefore, to add or adjust functions easily, we propose NES-SOURCE, a compact wireless control network protocol with a fast path-switching function. NES-SOURCE is implemented using carrier sense multiple access/collision avoidance (CSMA/CA rather than TDMA. Wireless control networks that use TDMA prevent communication failure by duplicating the communication path. If CSMA/CA networks use duplicate paths, collisions occur frequently, and communication will fail. NES-SOURCE switches paths quickly when communication fails, which reduces the effect of communication failures. Since NES-SOURCE is implemented using CSMA/CA rather than TDMA, the implementation scale is less than one-half that of existing network stacks. Furthermore, since NES-SOURCE’s code complexity is low, functions can be added or adjusted easily and quickly. Communication failures occur owing to changes in the communication environment and collisions. Experimental results demonstrate that the proposed NES-SOURCE’s path-switching function reduces the amount of communication failures when the communication environment changes owing to human movement and others. Furthermore, we clarify the relationships among the probability of a changing communication environment, the collision occurrence rate, and the PER of NES-SOURCE.

  13. Walking path-planning method for multiple radiation areas

    International Nuclear Information System (INIS)

    Liu, Yong-kuo; Li, Meng-kun; Peng, Min-jun; Xie, Chun-li; Yuan, Cheng-qian; Wang, Shuang-yu; Chao, Nan

    2016-01-01

    Highlights: • Radiation environment modeling method is designed. • Path-evaluating method and segmented path-planning method are proposed. • Path-planning simulation platform for radiation environment is built. • The method avoids to be misled by minimum dose path in single area. - Abstract: Based on minimum dose path-searching method, walking path-planning method for multiple radiation areas was designed to solve minimum dose path problem in single area and find minimum dose path in the whole space in this paper. Path-planning simulation platform was built using C# programming language and DirectX engine. The simulation platform was used in simulations dealing with virtual nuclear facilities. Simulation results indicated that the walking-path planning method is effective in providing safety for people walking in nuclear facilities.

  14. Pareto-path multitask multiple kernel learning.

    Science.gov (United States)

    Li, Cong; Georgiopoulos, Michael; Anagnostopoulos, Georgios C

    2015-01-01

    A traditional and intuitively appealing Multitask Multiple Kernel Learning (MT-MKL) method is to optimize the sum (thus, the average) of objective functions with (partially) shared kernel function, which allows information sharing among the tasks. We point out that the obtained solution corresponds to a single point on the Pareto Front (PF) of a multiobjective optimization problem, which considers the concurrent optimization of all task objectives involved in the Multitask Learning (MTL) problem. Motivated by this last observation and arguing that the former approach is heuristic, we propose a novel support vector machine MT-MKL framework that considers an implicitly defined set of conic combinations of task objectives. We show that solving our framework produces solutions along a path on the aforementioned PF and that it subsumes the optimization of the average of objective functions as a special case. Using the algorithms we derived, we demonstrate through a series of experimental results that the framework is capable of achieving a better classification performance, when compared with other similar MTL approaches.

  15. Evaluation of Shortest Paths in Road Network

    Directory of Open Access Journals (Sweden)

    Farrukh Shehzad

    2009-06-01

    Full Text Available Optimization is a key factor in almost all the topics of operations research / management science and economics.The road networks can be optimized within different constraints like time, distance, cost and traffic running onthe roads.This study is based on optimization of real road network by means of distances. Two main objectives arepursued in this research: 1 road distances among different routes are composed in detail; 2 two standardalgorithms (Dijkstra and Floyd-Warshall algoritms are applied to optimize/minimize these distances for bothsingle-source and all-pairs shortest path problems.

  16. Meta-path based heterogeneous combat network link prediction

    Science.gov (United States)

    Li, Jichao; Ge, Bingfeng; Yang, Kewei; Chen, Yingwu; Tan, Yuejin

    2017-09-01

    The combat system-of-systems in high-tech informative warfare, composed of many interconnected combat systems of different types, can be regarded as a type of complex heterogeneous network. Link prediction for heterogeneous combat networks (HCNs) is of significant military value, as it facilitates reconfiguring combat networks to represent the complex real-world network topology as appropriate with observed information. This paper proposes a novel integrated methodology framework called HCNMP (HCN link prediction based on meta-path) to predict multiple types of links simultaneously for an HCN. More specifically, the concept of HCN meta-paths is introduced, through which the HCNMP can accumulate information by extracting different features of HCN links for all the six defined types. Next, an HCN link prediction model, based on meta-path features, is built to predict all types of links of the HCN simultaneously. Then, the solution algorithm for the HCN link prediction model is proposed, in which the prediction results are obtained by iteratively updating with the newly predicted results until the results in the HCN converge or reach a certain maximum iteration number. Finally, numerical experiments on the dataset of a real HCN are conducted to demonstrate the feasibility and effectiveness of the proposed HCNMP, in comparison with 30 baseline methods. The results show that the performance of the HCNMP is superior to those of the baseline methods.

  17. Multiple-Ring Digital Communication Network

    Science.gov (United States)

    Kirkham, Harold

    1992-01-01

    Optical-fiber digital communication network to support data-acquisition and control functions of electric-power-distribution networks. Optical-fiber links of communication network follow power-distribution routes. Since fiber crosses open power switches, communication network includes multiple interconnected loops with occasional spurs. At each intersection node is needed. Nodes of communication network include power-distribution substations and power-controlling units. In addition to serving data acquisition and control functions, each node acts as repeater, passing on messages to next node(s). Multiple-ring communication network operates on new AbNET protocol and features fiber-optic communication.

  18. Networks amid multiple logics

    DEFF Research Database (Denmark)

    Bergenholtz, Carsten; Bjerregaard, Toke

    The present study investigates how a high-tech-small-firm (HTSF) can carry out an inter-organizational search of actors located at universities. Responding to calls to study how firms navigate multiple institutional norms, this research examines the different strategies used by a HTSF to balance...... adopted academic norm-sets, commercial imperatives and formal regulations to support formation of networks and collaborations with universities. The findings show how the significance of weak and strong ties for the formation of collaborations and networks with universities is relative...

  19. Structural equation models from paths to networks

    CERN Document Server

    Westland, J Christopher

    2015-01-01

    This compact reference surveys the full range of available structural equation modeling (SEM) methodologies.  It reviews applications in a broad range of disciplines, particularly in the social sciences where many key concepts are not directly observable.  This is the first book to present SEM’s development in its proper historical context–essential to understanding the application, strengths and weaknesses of each particular method.  This book also surveys the emerging path and network approaches that complement and enhance SEM, and that will grow in importance in the near future.  SEM’s ability to accommodate unobservable theory constructs through latent variables is of significant importance to social scientists.  Latent variable theory and application are comprehensively explained, and methods are presented for extending their power, including guidelines for data preparation, sample size calculation, and the special treatment of Likert scale data.  Tables of software, methodologies and fit st...

  20. Estimation of network path segment delays

    Science.gov (United States)

    Nichols, Kathleen Marie

    2018-05-01

    A method for estimation of a network path segment delay includes determining a scaled time stamp for each packet of a plurality of packets by scaling a time stamp for each respective packet to minimize a difference of at least one of a frequency and a frequency drift between a transport protocol clock of a host and a monitoring point. The time stamp for each packet is provided by the transport protocol clock of the host. A corrected time stamp for each packet is determined by removing from the scaled time stamp for each respective packet, a temporal offset between the transport protocol clock and the monitoring clock by minimizing a temporal delay variation of the plurality of packets traversing a segment between the host and the monitoring point.

  1. Evaluation of Network Reliability for Computer Networks with Multiple Sources

    Directory of Open Access Journals (Sweden)

    Yi-Kuei Lin

    2012-01-01

    Full Text Available Evaluating the reliability of a network with multiple sources to multiple sinks is a critical issue from the perspective of quality management. Due to the unrealistic definition of paths of network models in previous literature, existing models are not appropriate for real-world computer networks such as the Taiwan Advanced Research and Education Network (TWAREN. This paper proposes a modified stochastic-flow network model to evaluate the network reliability of a practical computer network with multiple sources where data is transmitted through several light paths (LPs. Network reliability is defined as being the probability of delivering a specified amount of data from the sources to the sink. It is taken as a performance index to measure the service level of TWAREN. This paper studies the network reliability of the international portion of TWAREN from two sources (Taipei and Hsinchu to one sink (New York that goes through a submarine and land surface cable between Taiwan and the United States.

  2. Efficient Routing in Wireless Sensor Networks with Multiple Sessions

    OpenAIRE

    Dianjie Lu; Guijuan Zhang; Ren Han; Xiangwei Zheng; Hong Liu

    2014-01-01

    Wireless Sensor Networks (WSNs) are subject to node failures because of limited energy and link unreliability which makes the design of routing protocols in such networks a challenging task. The multipath routing scheme is an optimal alternative to address this problem which splits the traffic across multiple paths instead of routing all the traffic along a single path. However, using more paths introduces more contentions which degrade energy efficiency. The problem becomes even more difficu...

  3. Low Complexity Transmission Scheme with Full Diversity for Two-Path Relay Networks

    KAUST Repository

    Fareed, Muhammad Mehboob

    2014-01-06

    In this work, we present a new low complexity scheme for two-path relay network to harvest maximum achievable diversity. We analyze the performance of the newly proposed two-path relay network by calculating the symbol error rate (SER) for arbitrary location of relays. It is shown that with this newly proposed scheme, two-path relay networks can mimic a 2x2 multiple-input mulitple-output (MIMO) system and achieve full diversity order of four. Simulations results are provided to verify and illustrate the analytical results.

  4. Low Complexity Transmission Scheme with Full Diversity for Two-Path Relay Networks

    KAUST Repository

    Fareed, Muhammad Mehboob; Yang, Hong-Chuan; Alouini, Mohamed-Slim

    2014-01-01

    In this work, we present a new low complexity scheme for two-path relay network to harvest maximum achievable diversity. We analyze the performance of the newly proposed two-path relay network by calculating the symbol error rate (SER) for arbitrary location of relays. It is shown that with this newly proposed scheme, two-path relay networks can mimic a 2x2 multiple-input mulitple-output (MIMO) system and achieve full diversity order of four. Simulations results are provided to verify and illustrate the analytical results.

  5. A collaborative network middleware project by Lambda Station, TeraPaths, and Phoebus

    International Nuclear Information System (INIS)

    Bobyshev, A.; Bradley, S.; Crawford, M.; DeMar, P.; Katramatos, D.; Shroff, K.; Swany, M.; Yu, D.

    2010-01-01

    The TeraPaths, Lambda Station, and Phoebus projects, funded by the US Department of Energy, have successfully developed network middleware services that establish on-demand and manage true end-to-end, Quality-of-Service (QoS) aware, virtual network paths across multiple administrative network domains, select network paths and gracefully reroute traffic over these dynamic paths, and streamline traffic between packet and circuit networks using transparent gateways. These services improve network QoS and performance for applications, playing a critical role in the effective use of emerging dynamic circuit network services. They provide interfaces to applications, such as dCache SRM, translate network service requests into network device configurations, and coordinate with each other to setup up end-to-end network paths. The End Site Control Plane Subsystem (ESCPS) builds upon the success of the three projects by combining their individual capabilities into the next generation of network middleware. ESCPS addresses challenges such as cross-domain control plane signalling and interoperability, authentication and authorization in a Grid environment, topology discovery, and dynamic status tracking. The new network middleware will take full advantage of the perfSONAR monitoring infrastructure and the Inter-Domain Control plane efforts and will be deployed and fully vetted in the Large Hadron Collider data movement environment.

  6. Experimental demonstration of spectrum-sliced elastic optical path network (SLICE).

    Science.gov (United States)

    Kozicki, Bartłomiej; Takara, Hidehiko; Tsukishima, Yukio; Yoshimatsu, Toshihide; Yonenaga, Kazushige; Jinno, Masahiko

    2010-10-11

    We describe experimental demonstration of spectrum-sliced elastic optical path network (SLICE) architecture. We employ optical orthogonal frequency-division multiplexing (OFDM) modulation format and bandwidth-variable optical cross-connects (OXC) to generate, transmit and receive optical paths with bandwidths of up to 1 Tb/s. We experimentally demonstrate elastic optical path setup and spectrally-efficient transmission of multiple channels with bit rates ranging from 40 to 140 Gb/s between six nodes of a mesh network. We show dynamic bandwidth scalability for optical paths with bit rates of 40 to 440 Gb/s. Moreover, we demonstrate multihop transmission of a 1 Tb/s optical path over 400 km of standard single-mode fiber (SMF). Finally, we investigate the filtering properties and the required guard band width for spectrally-efficient allocation of optical paths in SLICE.

  7. Networks in Buildings: Which Path Forward?

    Energy Technology Data Exchange (ETDEWEB)

    Nordman, Bruce

    2008-08-17

    To date, digital networks have principally been installed for connecting information technology devices, with more modest use in consumer electronics, security, and large building control systems. The next 20 years will see much greater deployment of networks in buildings of all types, and across all end uses. Most of these are likely to be introduced primarily for reasons other than energy efficiency, and add energy use for network interfaces and network products. Widespread networking could easily lead to increased energy use, and experience with IT and CE networks suggests this may be likely. Active engagement by energy efficiency professionals in the architecture and design of future networks could lead to their being a large and highly cost-effective tool for efficiency. However, network standards are complex and take many years to develop and negotiate so that lack of action on this in the near term may foreclose important opportunities for years or decades to come. Digital networks need to be common globally, providing another challenge to building systems and elements that are more commonly designed only for national or regional markets. Key future networks are lighting, climate control, and security/presence. This paper reviews some examples of past network designs and use and the lessons they hold for future building networks. It also highlights key needed areas for research, policy, and standards development.

  8. Differential neural network configuration during human path integration

    Science.gov (United States)

    Arnold, Aiden E. G. F; Burles, Ford; Bray, Signe; Levy, Richard M.; Iaria, Giuseppe

    2014-01-01

    Path integration is a fundamental skill for navigation in both humans and animals. Despite recent advances in unraveling the neural basis of path integration in animal models, relatively little is known about how path integration operates at a neural level in humans. Previous attempts to characterize the neural mechanisms used by humans to visually path integrate have suggested a central role of the hippocampus in allowing accurate performance, broadly resembling results from animal data. However, in recent years both the central role of the hippocampus and the perspective that animals and humans share similar neural mechanisms for path integration has come into question. The present study uses a data driven analysis to investigate the neural systems engaged during visual path integration in humans, allowing for an unbiased estimate of neural activity across the entire brain. Our results suggest that humans employ common task control, attention and spatial working memory systems across a frontoparietal network during path integration. However, individuals differed in how these systems are configured into functional networks. High performing individuals were found to more broadly express spatial working memory systems in prefrontal cortex, while low performing individuals engaged an allocentric memory system based primarily in the medial occipito-temporal region. These findings suggest that visual path integration in humans over short distances can operate through a spatial working memory system engaging primarily the prefrontal cortex and that the differential configuration of memory systems recruited by task control networks may help explain individual biases in spatial learning strategies. PMID:24808849

  9. Path connectivity based spectral defragmentation in flexible bandwidth networks.

    Science.gov (United States)

    Wang, Ying; Zhang, Jie; Zhao, Yongli; Zhang, Jiawei; Zhao, Jie; Wang, Xinbo; Gu, Wanyi

    2013-01-28

    Optical networks with flexible bandwidth provisioning have become a very promising networking architecture. It enables efficient resource utilization and supports heterogeneous bandwidth demands. In this paper, two novel spectrum defragmentation approaches, i.e. Maximum Path Connectivity (MPC) algorithm and Path Connectivity Triggering (PCT) algorithm, are proposed based on the notion of Path Connectivity, which is defined to represent the maximum variation of node switching ability along the path in flexible bandwidth networks. A cost-performance-ratio based profitability model is given to denote the prons and cons of spectrum defragmentation. We compare these two proposed algorithms with non-defragmentation algorithm in terms of blocking probability. Then we analyze the differences of defragmentation profitability between MPC and PCT algorithms.

  10. Path finding using the multi-layer network description language

    NARCIS (Netherlands)

    Dijkstra, F.; van der Ham, J.; Grosso, P.; de Laat, C.

    2008-01-01

    Research networks are providing their users with dedicated network connections. Users want these connects to go through different domains, so the research networks are challenged to find valid network connections through multiple domains. The challenge arises if the different network domains use

  11. Ranking paths in stochastic time-dependent networks

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele D.

    2014-01-01

    In this paper we address optimal routing problems in networks where travel times are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns successors to nodes as a function of time. Nevertheless, in...

  12. Ranking shortest paths in Stochastic time-denpendent networks

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele

    A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the ...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective.......A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks...

  13. K shortest paths in stochastic time-dependent networks

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim Allan

    2004-01-01

    A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the ...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective.......A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks...

  14. Teleconnection Paths via Climate Network Direct Link Detection.

    Science.gov (United States)

    Zhou, Dong; Gozolchiani, Avi; Ashkenazy, Yosef; Havlin, Shlomo

    2015-12-31

    Teleconnections describe remote connections (typically thousands of kilometers) of the climate system. These are of great importance in climate dynamics as they reflect the transportation of energy and climate change on global scales (like the El Niño phenomenon). Yet, the path of influence propagation between such remote regions, and weighting associated with different paths, are only partially known. Here we propose a systematic climate network approach to find and quantify the optimal paths between remotely distant interacting locations. Specifically, we separate the correlations between two grid points into direct and indirect components, where the optimal path is found based on a minimal total cost function of the direct links. We demonstrate our method using near surface air temperature reanalysis data, on identifying cross-latitude teleconnections and their corresponding optimal paths. The proposed method may be used to quantify and improve our understanding regarding the emergence of climate patterns on global scales.

  15. Extended shortest path selection for package routing of complex networks

    Science.gov (United States)

    Ye, Fan; Zhang, Lei; Wang, Bing-Hong; Liu, Lu; Zhang, Xing-Yi

    The routing strategy plays a very important role in complex networks such as Internet system and Peer-to-Peer networks. However, most of the previous work concentrates only on the path selection, e.g. Flooding and Random Walk, or finding the shortest path (SP) and rarely considering the local load information such as SP and Distance Vector Routing. Flow-based Routing mainly considers load balance and still cannot achieve best optimization. Thus, in this paper, we propose a novel dynamic routing strategy on complex network by incorporating the local load information into SP algorithm to enhance the traffic flow routing optimization. It was found that the flow in a network is greatly affected by the waiting time of the network, so we should not consider only choosing optimized path for package transformation but also consider node congestion. As a result, the packages should be transmitted with a global optimized path with smaller congestion and relatively short distance. Analysis work and simulation experiments show that the proposed algorithm can largely enhance the network flow with the maximum throughput within an acceptable calculating time. The detailed analysis of the algorithm will also be provided for explaining the efficiency.

  16. Road networks as collections of minimum cost paths

    Science.gov (United States)

    Wegner, Jan Dirk; Montoya-Zegarra, Javier Alexander; Schindler, Konrad

    2015-10-01

    We present a probabilistic representation of network structures in images. Our target application is the extraction of urban roads from aerial images. Roads appear as thin, elongated, partially curved structures forming a loopy graph, and this complex layout requires a prior that goes beyond standard smoothness and co-occurrence assumptions. In the proposed model the network is represented as a union of 1D paths connecting distant (super-)pixels. A large set of putative candidate paths is constructed in such a way that they include the true network as much as possible, by searching for minimum cost paths in the foreground (road) likelihood. Selecting the optimal subset of candidate paths is posed as MAP inference in a higher-order conditional random field. Each path forms a higher-order clique with a type of clique potential, which attracts the member nodes of cliques with high cumulative road evidence to the foreground label. That formulation induces a robust PN -Potts model, for which a global MAP solution can be found efficiently with graph cuts. Experiments with two road data sets show that the proposed model significantly improves per-pixel accuracies as well as the overall topological network quality with respect to several baselines.

  17. Passage times of asymmetric anomalous walks with multiple paths

    International Nuclear Information System (INIS)

    Caceres, Manuel O; Insua, G Liliana

    2005-01-01

    We investigate the transient and the long-time behaviour of asymmetric anomalous walks in heterogeneous media. Two types of disorder are worked out explicitly: weak and strong disorder; in addition, the occurrence of disordered multiple paths is considered. We calculate the first passage time distribution of the associated stochastic transport process. We discuss the occurrence of the crossover from a power law to an exponential decay for the long-time behaviour of the distribution of the first passage times of disordered biased walks

  18. Task Assignment and Path Planning for Multiple Autonomous Underwater Vehicles Using 3D Dubins Curves †.

    Science.gov (United States)

    Cai, Wenyu; Zhang, Meiyan; Zheng, Yahong Rosa

    2017-07-11

    This paper investigates the task assignment and path planning problem for multiple AUVs in three dimensional (3D) underwater wireless sensor networks where nonholonomic motion constraints of underwater AUVs in 3D space are considered. The multi-target task assignment and path planning problem is modeled by the Multiple Traveling Sales Person (MTSP) problem and the Genetic Algorithm (GA) is used to solve the MTSP problem with Euclidean distance as the cost function and the Tour Hop Balance (THB) or Tour Length Balance (TLB) constraints as the stop criterion. The resulting tour sequences are mapped to 2D Dubins curves in the X - Y plane, and then interpolated linearly to obtain the Z coordinates. We demonstrate that the linear interpolation fails to achieve G 1 continuity in the 3D Dubins path for multiple targets. Therefore, the interpolated 3D Dubins curves are checked against the AUV dynamics constraint and the ones satisfying the constraint are accepted to finalize the 3D Dubins curve selection. Simulation results demonstrate that the integration of the 3D Dubins curve with the MTSP model is successful and effective for solving the 3D target assignment and path planning problem.

  19. Task Assignment and Path Planning for Multiple Autonomous Underwater Vehicles Using 3D Dubins Curves †

    Directory of Open Access Journals (Sweden)

    Wenyu Cai

    2017-07-01

    Full Text Available This paper investigates the task assignment and path planning problem for multiple AUVs in three dimensional (3D underwater wireless sensor networks where nonholonomic motion constraints of underwater AUVs in 3D space are considered. The multi-target task assignment and path planning problem is modeled by the Multiple Traveling Sales Person (MTSP problem and the Genetic Algorithm (GA is used to solve the MTSP problem with Euclidean distance as the cost function and the Tour Hop Balance (THB or Tour Length Balance (TLB constraints as the stop criterion. The resulting tour sequences are mapped to 2D Dubins curves in the X − Y plane, and then interpolated linearly to obtain the Z coordinates. We demonstrate that the linear interpolation fails to achieve G 1 continuity in the 3D Dubins path for multiple targets. Therefore, the interpolated 3D Dubins curves are checked against the AUV dynamics constraint and the ones satisfying the constraint are accepted to finalize the 3D Dubins curve selection. Simulation results demonstrate that the integration of the 3D Dubins curve with the MTSP model is successful and effective for solving the 3D target assignment and path planning problem.

  20. An improved algorithm for finding all minimal paths in a network

    International Nuclear Information System (INIS)

    Bai, Guanghan; Tian, Zhigang; Zuo, Ming J.

    2016-01-01

    Minimal paths (MPs) play an important role in network reliability evaluation. In this paper, we report an efficient recursive algorithm for finding all MPs in two-terminal networks, which consist of a source node and a sink node. A linked path structure indexed by nodes is introduced, which accepts both directed and undirected form of networks. The distance between each node and the sink node is defined, and a simple recursive algorithm is presented for labeling the distance for each node. Based on the distance between each node and the sink node, additional conditions for backtracking are incorporated to reduce the number of search branches. With the newly introduced linked node structure, the distances between each node and the sink node, and the additional backtracking conditions, an improved backtracking algorithm for searching for all MPs is developed. In addition, the proposed algorithm can be adapted to search for all minimal paths for each source–sink pair in networks consisting of multiple source nodes and/or multiple sink nodes. Through computational experiments, it is demonstrated that the proposed algorithm is more efficient than existing algorithms when the network size is not too small. The proposed algorithm becomes more advantageous as the size of the network grows. - Highlights: • A linked path structure indexed by nodes is introduced to represent networks. • Additional conditions for backtracking are proposed based on the distance of each node. • An efficient algorithm is developed to find all MPs for two-terminal networks. • The computational efficiency of the algorithm for two-terminal networks is investigated. • The computational efficiency of the algorithm for multi-terminal networks is investigated.

  1. Protocol for multiple node network

    Science.gov (United States)

    Kirkham, Harold (Inventor)

    1995-01-01

    The invention is a multiple interconnected network of intelligent message-repeating remote nodes which employs an antibody recognition message termination process performed by all remote nodes and a remote node polling process performed by other nodes which are master units controlling remote nodes in respective zones of the network assigned to respective master nodes. Each remote node repeats only those messages originated in the local zone, to provide isolation among the master nodes.

  2. Advanced path sampling of the kinetic network of small proteins

    NARCIS (Netherlands)

    Du, W.

    2014-01-01

    This thesis is focused on developing advanced path sampling simulation methods to study protein folding and unfolding, and to build kinetic equilibrium networks describing these processes. In Chapter 1 the basic knowledge of protein structure and folding theories were introduced and a brief overview

  3. A low complexity method for the optimization of network path length in spatially embedded networks

    International Nuclear Information System (INIS)

    Chen, Guang; Yang, Xu-Hua; Xu, Xin-Li; Ming, Yong; Chen, Sheng-Yong; Wang, Wan-Liang

    2014-01-01

    The average path length of a network is an important index reflecting the network transmission efficiency. In this paper, we propose a new method of decreasing the average path length by adding edges. A new indicator is presented, incorporating traffic flow demand, to assess the decrease in the average path length when a new edge is added during the optimization process. With the help of the indicator, edges are selected and added into the network one by one. The new method has a relatively small time computational complexity in comparison with some traditional methods. In numerical simulations, the new method is applied to some synthetic spatially embedded networks. The result shows that the method can perform competitively in decreasing the average path length. Then, as an example of an application of this new method, it is applied to the road network of Hangzhou, China. (paper)

  4. Information spread of emergency events: path searching on social networks.

    Science.gov (United States)

    Dai, Weihui; Hu, Hongzhi; Wu, Tunan; Dai, Yonghui

    2014-01-01

    Emergency has attracted global attentions of government and the public, and it will easily trigger a series of serious social problems if it is not supervised effectively in the dissemination process. In the Internet world, people communicate with each other and form various virtual communities based on social networks, which lead to a complex and fast information spread pattern of emergency events. This paper collects Internet data based on data acquisition and topic detection technology, analyzes the process of information spread on social networks, describes the diffusions and impacts of that information from the perspective of random graph, and finally seeks the key paths through an improved IBF algorithm. Application cases have shown that this algorithm can search the shortest spread paths efficiently, which may help us to guide and control the information dissemination of emergency events on early warning.

  5. Information Spread of Emergency Events: Path Searching on Social Networks

    Directory of Open Access Journals (Sweden)

    Weihui Dai

    2014-01-01

    Full Text Available Emergency has attracted global attentions of government and the public, and it will easily trigger a series of serious social problems if it is not supervised effectively in the dissemination process. In the Internet world, people communicate with each other and form various virtual communities based on social networks, which lead to a complex and fast information spread pattern of emergency events. This paper collects Internet data based on data acquisition and topic detection technology, analyzes the process of information spread on social networks, describes the diffusions and impacts of that information from the perspective of random graph, and finally seeks the key paths through an improved IBF algorithm. Application cases have shown that this algorithm can search the shortest spread paths efficiently, which may help us to guide and control the information dissemination of emergency events on early warning.

  6. Defending Tor from Network Adversaries: A Case Study of Network Path Prediction

    Directory of Open Access Journals (Sweden)

    Juen Joshua

    2015-06-01

    Full Text Available The Tor anonymity network has been shown vulnerable to traffic analysis attacks by autonomous systems (ASes and Internet exchanges (IXes, which can observe different overlay hops belonging to the same circuit. We evaluate whether network path prediction techniques provide an accurate picture of the threat from such adversaries, and whether they can be used to avoid this threat. We perform a measurement study by collecting 17.2 million traceroutes from Tor relays to destinations around the Internet. We compare the collected traceroute paths to predicted paths using state-of-the-art path inference techniques. We find that traceroutes present a very different picture, with the set of ASes seen in the traceroute path differing from the predicted path 80% of the time. We also consider the impact that prediction errors have on Tor security. Using a simulator to choose paths over a week, our traceroutes indicate a user has nearly a 100% chance of at least one compromise in a week with 11% of total paths containing an AS compromise and less than 1% containing an IX compromise when using default Tor selection. We find modifying the path selection to choose paths predicted to be safe lowers total paths with an AS compromise to 0.14% but still presents a 5–11% chance of at least one compromise in a week while making 5% of paths fail, with 96% of failures due to false positives in path inferences. Our results demonstrate more measurement and better path prediction is necessary to mitigate the risk of AS and IX adversaries to Tor.

  7. Task Allocation and Path Planning for Collaborative Autonomous Underwater Vehicles Operating through an Underwater Acoustic Network

    Directory of Open Access Journals (Sweden)

    Yueyue Deng

    2013-01-01

    Full Text Available Dynamic and unstructured multiple cooperative autonomous underwater vehicle (AUV missions are highly complex operations, and task allocation and path planning are made significantly more challenging under realistic underwater acoustic communication constraints. This paper presents a solution for the task allocation and path planning for multiple AUVs under marginal acoustic communication conditions: a location-aided task allocation framework (LAAF algorithm for multitarget task assignment and the grid-based multiobjective optimal programming (GMOOP mathematical model for finding an optimal vehicle command decision given a set of objectives and constraints. Both the LAAF and GMOOP algorithms are well suited in poor acoustic network condition and dynamic environment. Our research is based on an existing mobile ad hoc network underwater acoustic simulator and blind flooding routing protocol. Simulation results demonstrate that the location-aided auction strategy performs significantly better than the well-accepted auction algorithm developed by Bertsekas in terms of task-allocation time and network bandwidth consumption. We also demonstrate that the GMOOP path-planning technique provides an efficient method for executing multiobjective tasks by cooperative agents with limited communication capabilities. This is in contrast to existing multiobjective action selection methods that are limited to networks where constant, reliable communication is assumed to be available.

  8. Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

    Science.gov (United States)

    Bai, Weigang; Wang, Haiyan; He, Ke; Zhao, Ruiqin

    2018-04-23

    The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS) and position random candidates selection (PRCS). PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

  9. Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Weigang Bai

    2018-04-01

    Full Text Available The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS and position random candidates selection (PRCS. PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

  10. Multiple Paths of Deuterium Fractionation in Protoplanetary Disks

    Science.gov (United States)

    Aikawa, Yuri; Furuya, Kenji; Hincelin, Ugo; Herbst, Eric

    2018-03-01

    We investigate deuterium chemistry coupled with the nuclear spin-state chemistry of H2 and {{{H}}}3+ in protoplanetary disks. Multiple paths of deuterium fractionation are found; exchange reactions with D atoms, such as HCO+ + D, are effective in addition to those with HD. In a disk model with grain sizes appropriate for dark clouds, the freeze-out of molecules is severe in the outer midplane, while the disk surface is shielded from UV radiation. Gaseous molecules, including DCO+, thus become abundant at the disk surface, which tends to make their column density distribution relatively flat. If the dust grains have grown to millimeter size, the freeze-out rate of neutral species is reduced and the abundances of gaseous molecules, including DCO+ and N2D+, are enhanced in the cold midplane. Turbulent diffusion transports D atoms and radicals at the disk surface to the midplane, and stable ice species in the midplane to the disk surface. The effects of turbulence on chemistry are thus multifold; while DCO+ and N2D+ abundances increase or decrease depending on the regions, HCN and DCN in the gas and ice are greatly reduced at the innermost radii, compared to the model without turbulence. When cosmic rays penetrate the disk, the ortho-to-para ratio (OPR) of H2 is found to be thermal in the disk, except in the cold (≲10 K) midplane. We also analyze the OPR of {{{H}}}3+ and H2D+, as well as the main reactions of H2D+, DCO+, and N2D+, in order to analytically derive their abundances in the cold midplane.

  11. Path searching in switching networks using cellular algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Koczy, L T; Langer, J; Legendi, T

    1981-01-01

    After a survey of the important statements in the paper A Mathematical Model of Path Searching in General Type Switching Networks (see IBID., vol.25, no.1, p.31-43, 1981) the authors consider the possible implementation for cellular automata of the algorithm introduced there. The cellular field used consists of 5 neighbour 8 state cells. Running times required by a traditional serial processor and by the cellular field, respectively, are compared. By parallel processing this running time can be reduced. 5 references.

  12. Low-complexity full-rate transmission scheme with full diversity for two-path relay networks

    KAUST Repository

    Fareed, Muhammad Mehboob; Yang, Hongchuan; Alouini, Mohamed-Slim

    2015-01-01

    Existing full-rate transmission schemes for two-path relay networks typically cannot achieve full diversity while demanding high decoding complexity. In this paper, we present a novel low-complexity full-rate transmission scheme for two-path relay networks to harvest maximum achievable diversity. The proposed scheme adopts block transmission with small block size of four symbols, which greatly reduces the decoding complexity at the receiver. Through the performance analysis of the resulting two-path relay network in terms of the symbol error rate (SER) and diversity order, we show the proposed scheme can achieve full diversity order of four and mimic a 2 \\times 2 multiple-input multiple-output system. Simulations results are provided to validate the mathematical formulation. © 1967-2012 IEEE.

  13. Low-complexity full-rate transmission scheme with full diversity for two-path relay networks

    KAUST Repository

    Fareed, Muhammad Mehboob

    2015-04-01

    Existing full-rate transmission schemes for two-path relay networks typically cannot achieve full diversity while demanding high decoding complexity. In this paper, we present a novel low-complexity full-rate transmission scheme for two-path relay networks to harvest maximum achievable diversity. The proposed scheme adopts block transmission with small block size of four symbols, which greatly reduces the decoding complexity at the receiver. Through the performance analysis of the resulting two-path relay network in terms of the symbol error rate (SER) and diversity order, we show the proposed scheme can achieve full diversity order of four and mimic a 2 \\\\times 2 multiple-input multiple-output system. Simulations results are provided to validate the mathematical formulation. © 1967-2012 IEEE.

  14. Shortest-path network analysis is a useful approach toward identifying genetic determinants of longevity.

    Directory of Open Access Journals (Sweden)

    J R Managbanag

    Full Text Available BACKGROUND: Identification of genes that modulate longevity is a major focus of aging-related research and an area of intense public interest. In addition to facilitating an improved understanding of the basic mechanisms of aging, such genes represent potential targets for therapeutic intervention in multiple age-associated diseases, including cancer, heart disease, diabetes, and neurodegenerative disorders. To date, however, targeted efforts at identifying longevity-associated genes have been limited by a lack of predictive power, and useful algorithms for candidate gene-identification have also been lacking. METHODOLOGY/PRINCIPAL FINDINGS: We have utilized a shortest-path network analysis to identify novel genes that modulate longevity in Saccharomyces cerevisiae. Based on a set of previously reported genes associated with increased life span, we applied a shortest-path network algorithm to a pre-existing protein-protein interaction dataset in order to construct a shortest-path longevity network. To validate this network, the replicative aging potential of 88 single-gene deletion strains corresponding to predicted components of the shortest-path longevity network was determined. Here we report that the single-gene deletion strains identified by our shortest-path longevity analysis are significantly enriched for mutations conferring either increased or decreased replicative life span, relative to a randomly selected set of 564 single-gene deletion strains or to the current data set available for the entire haploid deletion collection. Further, we report the identification of previously unknown longevity genes, several of which function in a conserved longevity pathway believed to mediate life span extension in response to dietary restriction. CONCLUSIONS/SIGNIFICANCE: This work demonstrates that shortest-path network analysis is a useful approach toward identifying genetic determinants of longevity and represents the first application of

  15. Efficient Routing in Wireless Sensor Networks with Multiple Sessions

    Directory of Open Access Journals (Sweden)

    Dianjie Lu

    2014-05-01

    Full Text Available Wireless Sensor Networks (WSNs are subject to node failures because of limited energy and link unreliability which makes the design of routing protocols in such networks a challenging task. The multipath routing scheme is an optimal alternative to address this problem which splits the traffic across multiple paths instead of routing all the traffic along a single path. However, using more paths introduces more contentions which degrade energy efficiency. The problem becomes even more difficult in the scenario of multiple sessions since different source-destination pairs may pass the same link which makes the flow distribution of each link uncertain. Our goal is to minimize the energy cost and provide the robust transmission by choosing the optimal paths. We first study the problem from a theoretical standpoint by mapping it to the multi-commodity network design problem. Since it is hard to build a global addressing scheme due to the great number of sensor nodes, we propose a Distributed Energy Efficient Routing protocol (D2ER. In D2ER, we employ the transportation method which can optimize the flow distribution with minimal energy consumption. Simulation results demonstrate that our optimal algorithm can save energy drastically.

  16. An Optimal Path Computation Architecture for the Cloud-Network on Software-Defined Networking

    Directory of Open Access Journals (Sweden)

    Hyunhun Cho

    2015-05-01

    Full Text Available Legacy networks do not open the precise information of the network domain because of scalability, management and commercial reasons, and it is very hard to compute an optimal path to the destination. According to today’s ICT environment change, in order to meet the new network requirements, the concept of software-defined networking (SDN has been developed as a technological alternative to overcome the limitations of the legacy network structure and to introduce innovative concepts. The purpose of this paper is to propose the application that calculates the optimal paths for general data transmission and real-time audio/video transmission, which consist of the major services of the National Research & Education Network (NREN in the SDN environment. The proposed SDN routing computation (SRC application is designed and applied in a multi-domain network for the efficient use of resources, selection of the optimal path between the multi-domains and optimal establishment of end-to-end connections.

  17. Self-organizing path integration using a linked continuous attractor and competitive network: path integration of head direction.

    Science.gov (United States)

    Stringer, Simon M; Rolls, Edmund T

    2006-12-01

    A key issue is how networks in the brain learn to perform path integration, that is update a represented position using a velocity signal. Using head direction cells as an example, we show that a competitive network could self-organize to learn to respond to combinations of head direction and angular head rotation velocity. These combination cells can then be used to drive a continuous attractor network to the next head direction based on the incoming rotation signal. An associative synaptic modification rule with a short term memory trace enables preceding combination cell activity during training to be associated with the next position in the continuous attractor network. The network accounts for the presence of neurons found in the brain that respond to combinations of head direction and angular head rotation velocity. Analogous networks in the hippocampal system could self-organize to perform path integration of place and spatial view representations.

  18. Spin-orbit-path hybrid Greenberger-Horne-Zeilinger entanglement and open-destination teleportation with multiple degrees of freedom

    International Nuclear Information System (INIS)

    Chen Lixiang; She Weilong

    2011-01-01

    We propose a scheme to generate hybrid Greenberger-Horne-Zeilinger (GHZ) entanglement where multiple photons are entangled in different degrees of freedom of spin, orbital angular momentum (OAM), and path (linear momentum). The generation involves mapping the preliminary OAM entanglement of photon pairs onto their spin-orbit and spin-path degrees of freedom, respectively. Based on the hybrid GHZ entanglement, we demonstrate an open-destination teleportation with multiples degrees of freedom, via which a spin state of a single photon is teleported onto a superposition of multiple photons with the postselection technique and the original information could be read out at any photon in individual spin, OAM, or the linear-momentum state. Our scheme holds promise for asymmetric optical quantum network.

  19. Research on Innovating, Applying Multiple Paths Routing Technique Based on Fuzzy Logic and Genetic Algorithm for Routing Messages in Service - Oriented Routing

    Directory of Open Access Journals (Sweden)

    Nguyen Thanh Long

    2015-02-01

    Full Text Available MANET (short for Mobile Ad-Hoc Network consists of a set of mobile network nodes, network configuration changes very fast. In content based routing, data is transferred from source node to request nodes is not based on destination addresses. Therefore, it is very flexible and reliable, because source node does not need to know destination nodes. If We can find multiple paths that satisfies bandwidth requirement, split the original message into multiple smaller messages to transmit concurrently on these paths. On destination nodes, combine separated messages into the original message. Hence it can utilize better network resources, causes data transfer rate to be higher, load balancing, failover. Service Oriented Routing is inherited from the model of content based routing (CBR, combined with several advanced techniques such as Multicast, multiple path routing, Genetic algorithm to increase the data rate, and data encryption to ensure information security. Fuzzy logic is a logical field study evaluating the accuracy of the results based on the approximation of the components involved, make decisions based on many factors relative accuracy based on experimental or mathematical proof. This article presents some techniques to support multiple path routing from one network node to a set of nodes with guaranteed quality of service. By using these techniques can decrease the network load, congestion, use network resources efficiently.

  20. Validation of Tilt Gain under Realistic Path Loss Model and Network Scenario

    DEFF Research Database (Denmark)

    Nguyen, Huan Cong; Rodriguez, Ignacio; Sørensen, Troels Bundgaard

    2013-01-01

    Despite being a simple and commonly-applied radio optimization technique, the impact on practical network performance from base station antenna downtilt is not well understood. Most published studies based on empirical path loss models report tilt angles and performance gains that are far higher...... than practical experience suggests. We motivate in this paper, based on a practical LTE scenario, that the discrepancy partly lies in the path loss model, and shows that a more detailed semi-deterministic model leads to both lower gains in terms of SINR, outage probability and downlink throughput...... settings, including the use of electrical and/or mechanical antenna downtilt, and therefore it is possible to find multiple optimum tilt profiles in a practical case. A broader implication of this study is that care must be taken when using the 3GPP model to evaluate advanced adaptive antenna techniques...

  1. Concurrent conditional clustering of multiple networks: COCONETS.

    Directory of Open Access Journals (Sweden)

    Sabrina Kleessen

    Full Text Available The accumulation of high-throughput data from different experiments has facilitated the extraction of condition-specific networks over the same set of biological entities. Comparing and contrasting of such multiple biological networks is in the center of differential network biology, aiming at determining general and condition-specific responses captured in the network structure (i.e., included associations between the network components. We provide a novel way for comparison of multiple networks based on determining network clustering (i.e., partition into communities which is optimal across the set of networks with respect to a given cluster quality measure. To this end, we formulate the optimization-based problem of concurrent conditional clustering of multiple networks, termed COCONETS, based on the modularity. The solution to this problem is a clustering which depends on all considered networks and pinpoints their preserved substructures. We present theoretical results for special classes of networks to demonstrate the implications of conditionality captured by the COCONETS formulation. As the problem can be shown to be intractable, we extend an existing efficient greedy heuristic and applied it to determine concurrent conditional clusters on coexpression networks extracted from publically available time-resolved transcriptomics data of Escherichia coli under five stresses as well as on metabolite correlation networks from metabolomics data set from Arabidopsis thaliana exposed to eight environmental conditions. We demonstrate that the investigation of the differences between the clustering based on all networks with that obtained from a subset of networks can be used to quantify the specificity of biological responses. While a comparison of the Escherichia coli coexpression networks based on seminal properties does not pinpoint biologically relevant differences, the common network substructures extracted by COCONETS are supported by

  2. Multiple-Access Quantum-Classical Networks

    Science.gov (United States)

    Razavi, Mohsen

    2011-10-01

    A multi-user network that supports both classical and quantum communication is proposed. By relying on optical code-division multiple access techniques, this system offers simultaneous key exchange between multiple pairs of network users. A lower bound on the secure key generation rate will be derived for decoy-state quantum key distribution protocols.

  3. Capturing cognitive causal paths in human reliability analysis with Bayesian network models

    International Nuclear Information System (INIS)

    Zwirglmaier, Kilian; Straub, Daniel; Groth, Katrina M.

    2017-01-01

    reIn the last decade, Bayesian networks (BNs) have been identified as a powerful tool for human reliability analysis (HRA), with multiple advantages over traditional HRA methods. In this paper we illustrate how BNs can be used to include additional, qualitative causal paths to provide traceability. The proposed framework provides the foundation to resolve several needs frequently expressed by the HRA community. First, the developed extended BN structure reflects the causal paths found in cognitive psychology literature, thereby addressing the need for causal traceability and strong scientific basis in HRA. Secondly, the use of node reduction algorithms allows the BN to be condensed to a level of detail at which quantification is as straightforward as the techniques used in existing HRA. We illustrate the framework by developing a BN version of the critical data misperceived crew failure mode in the IDHEAS HRA method, which is currently under development at the US NRC . We illustrate how the model could be quantified with a combination of expert-probabilities and information from operator performance databases such as SACADA. This paper lays the foundations necessary to expand the cognitive and quantitative foundations of HRA. - Highlights: • A framework for building traceable BNs for HRA, based on cognitive causal paths. • A qualitative BN structure, directly showing these causal paths is developed. • Node reduction algorithms are used for making the BN structure quantifiable. • BN quantified through expert estimates and observed data (Bayesian updating). • The framework is illustrated for a crew failure mode of IDHEAS.

  4. Shortest multiple disconnected path for the analysis of entanglements in two- and three-dimensional polymeric systems

    Science.gov (United States)

    Kröger, Martin

    2005-06-01

    program has been tested: UNIX, Linux Program language used: USANSI Fortran 77 and Fortran 90 Memory required to execute with typical data: 1 MByte No. of lines in distributed program, including test data, etc.: 10 660 No. of bytes in distributed program, including test data, etc.: 119 551 Distribution formet:tar.gz Nature of physical problem: The problem is to obtain primitive paths substantiating a shortest multiple disconnected path (SP) for a given polymer configuration (chains of particles, with or without additional single particles as obstacles for the 2D case). Primitive paths are here defined as in [M. Rubinstein, E. Helfand, J. Chem. Phys. 82 (1985) 2477; R. Everaers, S.K. Sukumaran, G.S. Grest, C. Svaneborg, A. Sivasubramanian, K. Kremer, Science 303 (2004) 823] as the shortest line (path) respecting 'topological' constraints (from neighboring polymers or point obstacles) between ends of polymers. There is a unique solution for the 2D case. For the 3D case it is unique if we construct a primitive path of a single chain embedded within fixed line obstacles [J.S.B. Mitchell, Geometric shortest paths and network optimization, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier, Amsterdam, 2000, pp. 633-701]. For a large 3D configuration made of several chains, short is meant to be the Euclidean shortest multiple disconnected path (SP) where primitive paths are constructed for all chains simultaneously. While the latter problem, in general, does not possess a unique solution, the algorithm must return a locally optimal solution, robust against minor displacements of the disconnected path and chain re-labeling. The problem is solved if the number of kinks (or entanglements Z), explicitly deduced from the SP, is quite insensitive to the exact conformation of the SP which allows to estimate Z with a small error. Efficient method of solution: Primitive paths are constructed from the given polymer configuration (a non-shortest multiple

  5. Algorithms for finding optimal paths in network games with p players

    Directory of Open Access Journals (Sweden)

    R. Boliac

    1997-08-01

    Full Text Available We study the problem of finding optimal paths in network games with p players. Some polynomial-time algorithms for finding optimal paths and optimal by Nash strategies of the players in network games with p players are proposed.

  6. Discovery of path nearby clusters in spatial networks

    KAUST Repository

    Shang, Shuo

    2015-06-01

    The discovery of regions of interest in large cities is an important challenge. We propose and investigate a novel query called the path nearby cluster (PNC) query that finds regions of potential interest (e.g., sightseeing places and commercial districts) with respect to a user-specified travel route. Given a set of spatial objects O (e.g., POIs, geo-tagged photos, or geo-tagged tweets) and a query route q , if a cluster c has high spatial-object density and is spatially close to q , it is returned by the query (a cluster is a circular region defined by a center and a radius). This query aims to bring important benefits to users in popular applications such as trip planning and location recommendation. Efficient computation of the PNC query faces two challenges: how to prune the search space during query processing, and how to identify clusters with high density effectively. To address these challenges, a novel collective search algorithm is developed. Conceptually, the search process is conducted in the spatial and density domains concurrently. In the spatial domain, network expansion is adopted, and a set of vertices are selected from the query route as expansion centers. In the density domain, clusters are sorted according to their density distributions and they are scanned from the maximum to the minimum. A pair of upper and lower bounds are defined to prune the search space in the two domains globally. The performance of the PNC query is studied in extensive experiments based on real and synthetic spatial data. © 2014 IEEE.

  7. Social network analysis using k-Path centrality method

    Science.gov (United States)

    Taniarza, Natya; Adiwijaya; Maharani, Warih

    2018-03-01

    k-Path centrality is deemed as one of the effective methods to be applied in centrality measurement in which the influential node is estimated as the node that is being passed by information path frequently. Regarding this, k-Path centrality has been employed in the analysis of this paper specifically by adapting random-algorithm approach in order to: (1) determine the influential user’s ranking in a social media Twitter; and (2) ascertain the influence of parameter α in the numeration of k-Path centrality. According to the analysis, the findings showed that the method of k-Path centrality with random-algorithm approach can be used to determine user’s ranking which influences in the dissemination of information in Twitter. Furthermore, the findings also showed that parameter α influenced the duration and the ranking results: the less the α value, the longer the duration, yet the ranking results were more stable.

  8. Path Network Recovery Using Remote Sensing Data and Geospatial-Temporal Semantic Graphs

    Energy Technology Data Exchange (ETDEWEB)

    McLendon, William C.,; Brost, Randolph

    2016-05-01

    Remote sensing systems produce large volumes of high-resolution images that are difficult to search. The GeoGraphy (pronounced Geo-Graph-y) framework [2, 20] encodes remote sensing imagery into a geospatial-temporal semantic graph representation to enable high level semantic searches to be performed. Typically scene objects such as buildings and trees tend to be shaped like blocks with few holes, but other shapes generated from path networks tend to have a large number of holes and can span a large geographic region due to their connectedness. For example, we have a dataset covering the city of Philadelphia in which there is a single road network node spanning a 6 mile x 8 mile region. Even a simple question such as "find two houses near the same street" might give unexpected results. More generally, nodes arising from networks of paths (roads, sidewalks, trails, etc.) require additional processing to make them useful for searches in GeoGraphy. We have assigned the term Path Network Recovery to this process. Path Network Recovery is a three-step process involving (1) partitioning the network node into segments, (2) repairing broken path segments interrupted by occlusions or sensor noise, and (3) adding path-aware search semantics into GeoQuestions. This report covers the path network recovery process, how it is used, and some example use cases of the current capabilities.

  9. AN IMPROVEMENT ON GEOMETRY-BASED METHODS FOR GENERATION OF NETWORK PATHS FROM POINTS

    Directory of Open Access Journals (Sweden)

    Z. Akbari

    2014-10-01

    Full Text Available Determining network path is important for different purposes such as determination of road traffic, the average speed of vehicles, and other network analysis. One of the required input data is information about network path. Nevertheless, the data collected by the positioning systems often lead to the discrete points. Conversion of these points to the network path have become one of the challenges which different researchers, presents many ways for solving it. This study aims at investigating geometry-based methods to estimate the network paths from the obtained points and improve an existing point to curve method. To this end, some geometry-based methods have been studied and an improved method has been proposed by applying conditions on the best method after describing and illustrating weaknesses of them.

  10. The shortest path algorithm performance comparison in graph and relational database on a transportation network

    Directory of Open Access Journals (Sweden)

    Mario Miler

    2014-02-01

    Full Text Available In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems. Many applications dealing with transportation network require calculation of the shortest path. The objective of this research is to compare the performance of Dijkstra shortest path calculation in PostgreSQL (with pgRouting and Neo4j graph database for the purpose of determining if there is any difference regarding the speed of the calculation. Benchmarking was done on commodity hardware using OpenStreetMap road network. The first assumption is that Neo4j graph database would be well suited for the shortest path calculation on transportation networks but this does not come without some cost. Memory proved to be an issue in Neo4j setup when dealing with larger transportation networks.

  11. A Novel Dual Separate Paths (DSP) Algorithm Providing Fault-Tolerant Communication for Wireless Sensor Networks.

    Science.gov (United States)

    Tien, Nguyen Xuan; Kim, Semog; Rhee, Jong Myung; Park, Sang Yoon

    2017-07-25

    Fault tolerance has long been a major concern for sensor communications in fault-tolerant cyber physical systems (CPSs). Network failure problems often occur in wireless sensor networks (WSNs) due to various factors such as the insufficient power of sensor nodes, the dislocation of sensor nodes, the unstable state of wireless links, and unpredictable environmental interference. Fault tolerance is thus one of the key requirements for data communications in WSN applications. This paper proposes a novel path redundancy-based algorithm, called dual separate paths (DSP), that provides fault-tolerant communication with the improvement of the network traffic performance for WSN applications, such as fault-tolerant CPSs. The proposed DSP algorithm establishes two separate paths between a source and a destination in a network based on the network topology information. These paths are node-disjoint paths and have optimal path distances. Unicast frames are delivered from the source to the destination in the network through the dual paths, providing fault-tolerant communication and reducing redundant unicast traffic for the network. The DSP algorithm can be applied to wired and wireless networks, such as WSNs, to provide seamless fault-tolerant communication for mission-critical and life-critical applications such as fault-tolerant CPSs. The analyzed and simulated results show that the DSP-based approach not only provides fault-tolerant communication, but also improves network traffic performance. For the case study in this paper, when the DSP algorithm was applied to high-availability seamless redundancy (HSR) networks, the proposed DSP-based approach reduced the network traffic by 80% to 88% compared with the standard HSR protocol, thus improving network traffic performance.

  12. Interactive analysis of geographically distributed population imaging data collections over light-path data networks

    Science.gov (United States)

    van Lew, Baldur; Botha, Charl P.; Milles, Julien R.; Vrooman, Henri A.; van de Giessen, Martijn; Lelieveldt, Boudewijn P. F.

    2015-03-01

    The cohort size required in epidemiological imaging genetics studies often mandates the pooling of data from multiple hospitals. Patient data, however, is subject to strict privacy protection regimes, and physical data storage may be legally restricted to a hospital network. To enable biomarker discovery, fast data access and interactive data exploration must be combined with high-performance computing resources, while respecting privacy regulations. We present a system using fast and inherently secure light-paths to access distributed data, thereby obviating the need for a central data repository. A secure private cloud computing framework facilitates interactive, computationally intensive exploration of this geographically distributed, privacy sensitive data. As a proof of concept, MRI brain imaging data hosted at two remote sites were processed in response to a user command at a third site. The system was able to automatically start virtual machines, run a selected processing pipeline and write results to a user accessible database, while keeping data locally stored in the hospitals. Individual tasks took approximately 50% longer compared to a locally hosted blade server but the cloud infrastructure reduced the total elapsed time by a factor of 40 using 70 virtual machines in the cloud. We demonstrated that the combination light-path and private cloud is a viable means of building an analysis infrastructure for secure data analysis. The system requires further work in the areas of error handling, load balancing and secure support of multiple users.

  13. Discovery of path nearby clusters in spatial networks

    KAUST Repository

    Shang, Shuo; Zheng, Kai; Jensen, Christian S.; Yang, Bin; Kalnis, Panos; Li, Guohe; Wen, Ji Rong

    2015-01-01

    The discovery of regions of interest in large cities is an important challenge. We propose and investigate a novel query called the path nearby cluster (PNC) query that finds regions of potential interest (e.g., sightseeing places and commercial

  14. A Method for Routing Packets Across Multiple Paths in NoCs with In-Order Delivery and Fault-Tolerance Gaurantees

    Directory of Open Access Journals (Sweden)

    Srinivasan Murali

    2007-01-01

    Full Text Available Networks on Chips (NoCs are required to tackle the increasing delay and poor scalability issues of bus-based communication architectures. Many of today's NoC designs are based on single path routing. By utilizing multiple paths for routing, congestion in the network is reduced significantly, which translates to improved network performance or reduced network bandwidth requirements and power consumption. Multiple paths can also be utilized to achieve spatial redundancy, which helps in achieving tolerance against faults or errors in the NoC. A major problem with multipath routing is that packets can reach the destination in an out-of-order fashion, while many applications require in-order packet delivery. In this work, we present a multipath routing strategy that guarantees in-order packet delivery for NoCs. It is based on the idea of routing packets on partially nonintersecting paths and rebuilding packet order at path reconvergent nodes. We present a design methodology that uses the routing strategy to optimally spread the traffic in the NoC to minimize the network bandwidth needs and power consumption. We also integrate support for tolerance against transient and permanent failures in the NoC links in the methodology by utilizing spatial and temporal redundancy for transporting packets. Our experimental studies show large reduction in network bandwidth requirements (36.86% on average and power consumption (30.51% on average compared to single-path systems. The area overhead of the proposed scheme is small (a modest 5% increase in network area. Hence, it is practical to be used in the on-chip domain.

  15. Diversity Performance Analysis on Multiple HAP Networks

    Science.gov (United States)

    Dong, Feihong; Li, Min; Gong, Xiangwu; Li, Hongjun; Gao, Fengyue

    2015-01-01

    One of the main design challenges in wireless sensor networks (WSNs) is achieving a high-data-rate transmission for individual sensor devices. The high altitude platform (HAP) is an important communication relay platform for WSNs and next-generation wireless networks. Multiple-input multiple-output (MIMO) techniques provide the diversity and multiplexing gain, which can improve the network performance effectively. In this paper, a virtual MIMO (V-MIMO) model is proposed by networking multiple HAPs with the concept of multiple assets in view (MAV). In a shadowed Rician fading channel, the diversity performance is investigated. The probability density function (PDF) and cumulative distribution function (CDF) of the received signal-to-noise ratio (SNR) are derived. In addition, the average symbol error rate (ASER) with BPSK and QPSK is given for the V-MIMO model. The system capacity is studied for both perfect channel state information (CSI) and unknown CSI individually. The ergodic capacity with various SNR and Rician factors for different network configurations is also analyzed. The simulation results validate the effectiveness of the performance analysis. It is shown that the performance of the HAPs network in WSNs can be significantly improved by utilizing the MAV to achieve overlapping coverage, with the help of the V-MIMO techniques. PMID:26134102

  16. Diversity Performance Analysis on Multiple HAP Networks

    Directory of Open Access Journals (Sweden)

    Feihong Dong

    2015-06-01

    Full Text Available One of the main design challenges in wireless sensor networks (WSNs is achieving a high-data-rate transmission for individual sensor devices. The high altitude platform (HAP is an important communication relay platform for WSNs and next-generation wireless networks. Multiple-input multiple-output (MIMO techniques provide the diversity and multiplexing gain, which can improve the network performance effectively. In this paper, a virtual MIMO (V-MIMO model is proposed by networking multiple HAPs with the concept of multiple assets in view (MAV. In a shadowed Rician fading channel, the diversity performance is investigated. The probability density function (PDF and cumulative distribution function (CDF of the received signal-to-noise ratio (SNR are derived. In addition, the average symbol error rate (ASER with BPSK and QPSK is given for the V-MIMO model. The system capacity is studied for both perfect channel state information (CSI and unknown CSI individually. The ergodic capacity with various SNR and Rician factors for different network configurations is also analyzed. The simulation results validate the effectiveness of the performance analysis. It is shown that the performance of the HAPs network in WSNs can be significantly improved by utilizing the MAV to achieve overlapping coverage, with the help of the V-MIMO techniques.

  17. Virtual Fiber Networking and Impact of Optical Path Grooming on Creating Efficient Layer One Services

    Science.gov (United States)

    Naruse, Fumisato; Yamada, Yoshiyuki; Hasegawa, Hiroshi; Sato, Ken-Ichi

    This paper presents a novel “virtual fiber” network service that exploits wavebands. This service provides virtual direct tunnels that directly convey wavelength paths to connect customer facilities. To improve the resource utilization efficiency of the service, a network design algorithm is developed that can allow intermediate path grooming at limited nodes and can determine the best node location. Numerical experiments demonstrate the effectiveness of the proposed service architecture.

  18. Alternative Path Communication in Wide-Scale Cluster-Tree Wireless Sensor Networks Using Inactive Periods.

    Science.gov (United States)

    Leão, Erico; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco

    2017-05-06

    The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable technology to deploy wide-scale Wireless Sensor Networks (WSNs). These networks are usually designed to support convergecast traffic, where all communication paths go through the PAN (Personal Area Network) coordinator. Nevertheless, peer-to-peer communication relationships may be also required for different types of WSN applications. That is the typical case of sensor and actuator networks, where local control loops must be closed using a reduced number of communication hops. The use of communication schemes optimised just for the support of convergecast traffic may result in higher network congestion and in a potentially higher number of communication hops. Within this context, this paper proposes an Alternative-Route Definition (ARounD) communication scheme for WSNs. The underlying idea of ARounD is to setup alternative communication paths between specific source and destination nodes, avoiding congested cluster-tree paths. These alternative paths consider shorter inter-cluster paths, using a set of intermediate nodes to relay messages during their inactive periods in the cluster-tree network. Simulation results show that the ARounD communication scheme can significantly decrease the end-to-end communication delay, when compared to the use of standard cluster-tree communication schemes. Moreover, the ARounD communication scheme is able to reduce the network congestion around the PAN coordinator, enabling the reduction of the number of message drops due to queue overflows in the cluster-tree network.

  19. Framework for path finding in multi-layer transport networks

    NARCIS (Netherlands)

    Dijkstra, F.

    2009-01-01

    In only a few decades the use of computer networks has dramatically increased. Today, networks are ubiquitous in society: they are used for surfing, email and financial transactions. The capacity of the network has increased so much, that it is now possible to transfer massive data sets that

  20. Path Diversity Media Streaming over Best Effort Packet Switched Networks

    Science.gov (United States)

    2003-01-01

    intolerable sounds of my violin practice, but my mom was always there to defend and encourage her young violinist. When I left my full-time job for graduate...information can be incomplete or inaccurate. For exam - ple, traceroute can only differentiate between routers and not switches. Two paths with completely

  1. Architecture and design of optical path networks utilizing waveband virtual links

    Science.gov (United States)

    Ito, Yusaku; Mori, Yojiro; Hasegawa, Hiroshi; Sato, Ken-ichi

    2016-02-01

    We propose a novel optical network architecture that uses waveband virtual links, each of which can carry several optical paths, to directly bridge distant node pairs. Future photonic networks should not only transparently cover extended areas but also expand fiber capacity. However, the traversal of many ROADM nodes impairs the optical signal due to spectrum narrowing. To suppress the degradation, the bandwidth of guard bands needs to be increased, which degrades fiber frequency utilization. Waveband granular switching allows us to apply broader pass-band filtering at ROADMs and to insert sufficient guard bands between wavebands with minimum frequency utilization offset. The scheme resolves the severe spectrum narrowing effect. Moreover, the guard band between optical channels in a waveband can be minimized, which increases the number of paths that can be accommodated per fiber. In the network, wavelength path granular routing is done without utilizing waveband virtual links, and it still suffers from spectrum narrowing. A novel network design algorithm that can bound the spectrum narrowing effect by limiting the number of hops (traversed nodes that need wavelength path level routing) is proposed in this paper. This algorithm dynamically changes the waveband virtual link configuration according to the traffic distribution variation, where optical paths that need many node hops are effectively carried by virtual links. Numerical experiments demonstrate that the number of necessary fibers is reduced by 23% compared with conventional optical path networks.

  2. A new multiple robot path planning algorithm: dynamic distributed particle swarm optimization.

    Science.gov (United States)

    Ayari, Asma; Bouamama, Sadok

    2017-01-01

    Multiple robot systems have become a major study concern in the field of robotic research. Their control becomes unreliable and even infeasible if the number of robots increases. In this paper, a new dynamic distributed particle swarm optimization (D 2 PSO) algorithm is proposed for trajectory path planning of multiple robots in order to find collision-free optimal path for each robot in the environment. The proposed approach consists in calculating two local optima detectors, LOD pBest and LOD gBest . Particles which are unable to improve their personal best and global best for predefined number of successive iterations would be replaced with restructured ones. Stagnation and local optima problems would be avoided by adding diversity to the population, without losing the fast convergence characteristic of PSO. Experiments with multiple robots are provided and proved effectiveness of such approach compared with the distributed PSO.

  3. A hybrid path-oriented code assignment CDMA-based MAC protocol for underwater acoustic sensor networks.

    Science.gov (United States)

    Chen, Huifang; Fan, Guangyu; Xie, Lei; Cui, Jun-Hong

    2013-11-04

    Due to the characteristics of underwater acoustic channel, media access control (MAC) protocols designed for underwater acoustic sensor networks (UWASNs) are quite different from those for terrestrial wireless sensor networks. Moreover, in a sink-oriented network with event information generation in a sensor field and message forwarding to the sink hop-by-hop, the sensors near the sink have to transmit more packets than those far from the sink, and then a funneling effect occurs, which leads to packet congestion, collisions and losses, especially in UWASNs with long propagation delays. An improved CDMA-based MAC protocol, named path-oriented code assignment (POCA) CDMA MAC (POCA-CDMA-MAC), is proposed for UWASNs in this paper. In the proposed MAC protocol, both the round-robin method and CDMA technology are adopted to make the sink receive packets from multiple paths simultaneously. Since the number of paths for information gathering is much less than that of nodes, the length of the spreading code used in the POCA-CDMA-MAC protocol is shorter greatly than that used in the CDMA-based protocols with transmitter-oriented code assignment (TOCA) or receiver-oriented code assignment (ROCA). Simulation results show that the proposed POCA-CDMA-MAC protocol achieves a higher network throughput and a lower end-to-end delay compared to other CDMA-based MAC protocols.

  4. A Hybrid Path-Oriented Code Assignment CDMA-Based MAC Protocol for Underwater Acoustic Sensor Networks

    Directory of Open Access Journals (Sweden)

    Huifang Chen

    2013-11-01

    Full Text Available Due to the characteristics of underwater acoustic channel, media access control (MAC protocols designed for underwater acoustic sensor networks (UWASNs are quite different from those for terrestrial wireless sensor networks. Moreover, in a sink-oriented network with event information generation in a sensor field and message forwarding to the sink hop-by-hop, the sensors near the sink have to transmit more packets than those far from the sink, and then a funneling effect occurs, which leads to packet congestion, collisions and losses, especially in UWASNs with long propagation delays. An improved CDMA-based MAC protocol, named path-oriented code assignment (POCA CDMA MAC (POCA-CDMA-MAC, is proposed for UWASNs in this paper. In the proposed MAC protocol, both the round-robin method and CDMA technology are adopted to make the sink receive packets from multiple paths simultaneously. Since the number of paths for information gathering is much less than that of nodes, the length of the spreading code used in the POCA-CDMA-MAC protocol is shorter greatly than that used in the CDMA-based protocols with transmitter-oriented code assignment (TOCA or receiver-oriented code assignment (ROCA. Simulation results show that the proposed POCA-CDMA-MAC protocol achieves a higher network throughput and a lower end-to-end delay compared to other CDMA-based MAC protocols.

  5. Multiple Paths to Mathematics Practice in Al-Kashi's Key to Arithmetic

    Science.gov (United States)

    Taani, Osama

    2014-01-01

    In this paper, I discuss one of the most distinguishing features of Jamshid al-Kashi's pedagogy from his Key to Arithmetic, a well-known Arabic mathematics textbook from the fifteenth century. This feature is the multiple paths that he includes to find a desired result. In the first section light is shed on al-Kashi's life and his contributions to mathematics and astronomy. Section 2 starts with a brief discussion of the contents and pedagogy of the Key to Arithmetic. Al-Kashi's multiple approaches are discussed through four different examples of his versatility in presenting a topic from multiple perspectives. These examples are multiple definitions, multiple algorithms, multiple formulas, and multiple methods for solving word problems. Section 3 is devoted to some benefits that can be gained by implementing al-Kashi's multiple paths approach in modern curricula. For this discussion, examples from two teaching modules taken from the Key to Arithmetic and implemented in Pre-Calculus and mathematics courses for preservice teachers are discussed. Also, the conclusions are supported by some aspects of these modules. This paper is an attempt to help mathematics educators explore more benefits from reading from original sources.

  6. Multiple network alignment on quantum computers

    Science.gov (United States)

    Daskin, Anmer; Grama, Ananth; Kais, Sabre

    2014-12-01

    Comparative analyses of graph-structured datasets underly diverse problems. Examples of these problems include identification of conserved functional components (biochemical interactions) across species, structural similarity of large biomolecules, and recurring patterns of interactions in social networks. A large class of such analyses methods quantify the topological similarity of nodes across networks. The resulting correspondence of nodes across networks, also called node alignment, can be used to identify invariant subgraphs across the input graphs. Given graphs as input, alignment algorithms use topological information to assign a similarity score to each -tuple of nodes, with elements (nodes) drawn from each of the input graphs. Nodes are considered similar if their neighbors are also similar. An alternate, equivalent view of these network alignment algorithms is to consider the Kronecker product of the input graphs and to identify high-ranked nodes in the Kronecker product graph. Conventional methods such as PageRank and HITS (Hypertext-Induced Topic Selection) can be used for this purpose. These methods typically require computation of the principal eigenvector of a suitably modified Kronecker product matrix of the input graphs. We adopt this alternate view of the problem to address the problem of multiple network alignment. Using the phase estimation algorithm, we show that the multiple network alignment problem can be efficiently solved on quantum computers. We characterize the accuracy and performance of our method and show that it can deliver exponential speedups over conventional (non-quantum) methods.

  7. How partnership behaviour evolves in networks : path dependency, social figuration and life events

    NARCIS (Netherlands)

    Romme, A.G.L.; Akkermans, H.A.

    2008-01-01

    Networks have become the dominant life form in many organizational settings. Most studies of relationships in networks focus on the dyadic interaction between two agents. However, work on enactment, sensemaking, path dependency, and social figuration processes (e.g. by Weick and Elias) suggests

  8. Dynamic shortest path problems : hybrid routing policies considering network disruptions

    NARCIS (Netherlands)

    Sever, D.; Dellaert, N.P.; Woensel, van T.; Kok, de A.G.

    2013-01-01

    Traffic network disruptions lead to significant increases in transportation costs. We consider networks in which a number of links are vulnerable to these disruptions leading to a significantly higher travel time on these links. For these vulnerable links, we consider known link disruption

  9. Quantum key distribution network for multiple applications

    Science.gov (United States)

    Tajima, A.; Kondoh, T.; Ochi, T.; Fujiwara, M.; Yoshino, K.; Iizuka, H.; Sakamoto, T.; Tomita, A.; Shimamura, E.; Asami, S.; Sasaki, M.

    2017-09-01

    The fundamental architecture and functions of secure key management in a quantum key distribution (QKD) network with enhanced universal interfaces for smooth key sharing between arbitrary two nodes and enabling multiple secure communication applications are proposed. The proposed architecture consists of three layers: a quantum layer, key management layer and key supply layer. We explain the functions of each layer, the key formats in each layer and the key lifecycle for enabling a practical QKD network. A quantum key distribution-advanced encryption standard (QKD-AES) hybrid system and an encrypted smartphone system were developed as secure communication applications on our QKD network. The validity and usefulness of these systems were demonstrated on the Tokyo QKD Network testbed.

  10. Novel Congestion-Free Alternate Routing Path Scheme using Stackelberg Game Theory Model in Wireless Networks

    Directory of Open Access Journals (Sweden)

    P. Chitra

    2017-04-01

    Full Text Available Recently, wireless network technologies were designed for most of the applications. Congestion raised in the wireless network degrades the performance and reduces the throughput. Congestion-free network is quit essen- tial in the transport layer to prevent performance degradation in a wireless network. Game theory is a branch of applied mathematics and applied sciences that used in wireless network, political science, biology, computer science, philosophy and economics. e great challenges of wireless network are their congestion by various factors. E ective congestion-free alternate path routing is pretty essential to increase network performance. Stackelberg game theory model is currently employed as an e ective tool to design and formulate conges- tion issues in wireless networks. is work uses a Stackelberg game to design alternate path model to avoid congestion. In this game, leaders and followers are selected to select an alternate routing path. e correlated equilibrium is used in Stackelberg game for making better decision between non-cooperation and cooperation. Congestion was continuously monitored to increase the throughput in the network. Simulation results show that the proposed scheme could extensively improve the network performance by reducing congestion with the help of Stackelberg game and thereby enhance throughput.

  11. Applying self-organizing map and modified radial based neural network for clustering and routing optimal path in wireless network

    Science.gov (United States)

    Hoomod, Haider K.; Kareem Jebur, Tuka

    2018-05-01

    Mobile ad hoc networks (MANETs) play a critical role in today’s wireless ad hoc network research and consist of active nodes that can be in motion freely. Because it consider very important problem in this network, we suggested proposed method based on modified radial basis function networks RBFN and Self-Organizing Map SOM. These networks can be improved by the use of clusters because of huge congestion in the whole network. In such a system, the performance of MANET is improved by splitting the whole network into various clusters using SOM. The performance of clustering is improved by the cluster head selection and number of clusters. Modified Radial Based Neural Network is very simple, adaptable and efficient method to increase the life time of nodes, packet delivery ratio and the throughput of the network will increase and connection become more useful because the optimal path has the best parameters from other paths including the best bitrate and best life link with minimum delays. Proposed routing algorithm depends on the group of factors and parameters to select the path between two points in the wireless network. The SOM clustering average time (1-10 msec for stall nodes) and (8-75 msec for mobile nodes). While the routing time range (92-510 msec).The proposed system is faster than the Dijkstra by 150-300%, and faster from the RBFNN (without modify) by 145-180%.

  12. Multiple routes transmitted epidemics on multiplex networks

    International Nuclear Information System (INIS)

    Zhao, Dawei; Li, Lixiang; Peng, Haipeng; Luo, Qun; Yang, Yixian

    2014-01-01

    This letter investigates the multiple routes transmitted epidemic process on multiplex networks. We propose detailed theoretical analysis that allows us to accurately calculate the epidemic threshold and outbreak size. It is found that the epidemic can spread across the multiplex network even if all the network layers are well below their respective epidemic thresholds. Strong positive degree–degree correlation of nodes in multiplex network could lead to a much lower epidemic threshold and a relatively smaller outbreak size. However, the average similarity of neighbors from different layers of nodes has no obvious effect on the epidemic threshold and outbreak size. -- Highlights: •We studies multiple routes transmitted epidemic process on multiplex networks. •SIR model and bond percolation theory are used to analyze the epidemic processes. •We derive equations to accurately calculate the epidemic threshold and outbreak size. •ASN has no effect on the epidemic threshold and outbreak size. •Strong positive DDC leads to a lower epidemic threshold and a smaller outbreak size.

  13. Multiple routes transmitted epidemics on multiplex networks

    Energy Technology Data Exchange (ETDEWEB)

    Zhao, Dawei [Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876 (China); National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Shandong Provincial Key Laboratory of Computer Network, Shandong Computer Science Center, Jinan 250014 (China); Li, Lixiang [Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876 (China); National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Peng, Haipeng, E-mail: penghaipeng@bupt.edu.cn [Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876 (China); National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Luo, Qun; Yang, Yixian [Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876 (China); National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876 (China)

    2014-02-01

    This letter investigates the multiple routes transmitted epidemic process on multiplex networks. We propose detailed theoretical analysis that allows us to accurately calculate the epidemic threshold and outbreak size. It is found that the epidemic can spread across the multiplex network even if all the network layers are well below their respective epidemic thresholds. Strong positive degree–degree correlation of nodes in multiplex network could lead to a much lower epidemic threshold and a relatively smaller outbreak size. However, the average similarity of neighbors from different layers of nodes has no obvious effect on the epidemic threshold and outbreak size. -- Highlights: •We studies multiple routes transmitted epidemic process on multiplex networks. •SIR model and bond percolation theory are used to analyze the epidemic processes. •We derive equations to accurately calculate the epidemic threshold and outbreak size. •ASN has no effect on the epidemic threshold and outbreak size. •Strong positive DDC leads to a lower epidemic threshold and a smaller outbreak size.

  14. Featuring Multiple Local Optima to Assist the User in the Interpretation of Induced Bayesian Network Models

    DEFF Research Database (Denmark)

    Dalgaard, Jens; Pena, Jose; Kocka, Tomas

    2004-01-01

    We propose a method to assist the user in the interpretation of the best Bayesian network model indu- ced from data. The method consists in extracting relevant features from the model (e.g. edges, directed paths and Markov blankets) and, then, assessing the con¯dence in them by studying multiple...

  15. Reliable Path Selection Problem in Uncertain Traffic Network after Natural Disaster

    Directory of Open Access Journals (Sweden)

    Jing Wang

    2013-01-01

    Full Text Available After natural disaster, especially for large-scale disasters and affected areas, vast relief materials are often needed. In the meantime, the traffic networks are always of uncertainty because of the disaster. In this paper, we assume that the edges in the network are either connected or blocked, and the connection probability of each edge is known. In order to ensure the arrival of these supplies at the affected areas, it is important to select a reliable path. A reliable path selection model is formulated, and two algorithms for solving this model are presented. Then, adjustable reliable path selection model is proposed when the edge of the selected reliable path is broken. And the corresponding algorithms are shown to be efficient both theoretically and numerically.

  16. Taking apart the enhanced backscattering cone: Interference fringes from reciprocal paths in multiple light scattering

    International Nuclear Information System (INIS)

    Bret, Boris P. J.; Ferreira, Flavio P.; Nunes-Pereira, Eduardo J.; Belsley, Michael

    2010-01-01

    We report the decomposition of the enhanced backscattering cone into its constitutive interference fringes. These fringes are due to the constructive interference between reciprocal paths of any multiply scattered wave after ensemble averaging. An optical setup combining a two-point continuous-wave illumination and matching detection allows the observation of the fringes and, therefore, the quantitative characterization of the Green's function for light propagation between the two points in a multiple-scattering media.

  17. 77 FR 33486 - Certain Integrated Circuit Packages Provided With Multiple Heat-Conducting Paths and Products...

    Science.gov (United States)

    2012-06-06

    ...Notice is hereby given that the U.S. International Trade Commission has received a complaint entitled Certain Integrated Circuit Packages Provided With Multiple Heat-Conducting Paths and Products Containing Same, DN 2899; the Commission is soliciting comments on any public interest issues raised by the complaint or complainant's filing under section 210.8(b) of the Commission's Rules of Practice and Procedure (19 CFR 210.8(b)).

  18. Graph Regularized Meta-path Based Transductive Regression in Heterogeneous Information Network.

    Science.gov (United States)

    Wan, Mengting; Ouyang, Yunbo; Kaplan, Lance; Han, Jiawei

    2015-01-01

    A number of real-world networks are heterogeneous information networks, which are composed of different types of nodes and links. Numerical prediction in heterogeneous information networks is a challenging but significant area because network based information for unlabeled objects is usually limited to make precise estimations. In this paper, we consider a graph regularized meta-path based transductive regression model ( Grempt ), which combines the principal philosophies of typical graph-based transductive classification methods and transductive regression models designed for homogeneous networks. The computation of our method is time and space efficient and the precision of our model can be verified by numerical experiments.

  19. On intersectoral allocations, factors substitutability and multiple long-run growth paths

    DEFF Research Database (Denmark)

    Poulsen, Odile; Drugeon, Jean-Pierre; Venditti, Alain

    2003-01-01

    This article considers a two-sector model of economic growth with "labour-augmenting" intersectoral external effects stemming from the aggregate capital stock. It is shown that equilibrium balanced growth paths with a non-trivial labour allocation scheme become available. A set of sufficient...... conditions for the existence of multiple equilibrium growth rays is provided and their determinacy properties are then characterised. Finally, examination of a parameterised C.E.S. economy illustrates the central role of non-unitary values for the elasticity of substitution in the multiplicity issue...

  20. Modified multiblock partial least squares path modeling algorithm with backpropagation neural networks approach

    Science.gov (United States)

    Yuniarto, Budi; Kurniawan, Robert

    2017-03-01

    PLS Path Modeling (PLS-PM) is different from covariance based SEM, where PLS-PM use an approach based on variance or component, therefore, PLS-PM is also known as a component based SEM. Multiblock Partial Least Squares (MBPLS) is a method in PLS regression which can be used in PLS Path Modeling which known as Multiblock PLS Path Modeling (MBPLS-PM). This method uses an iterative procedure in its algorithm. This research aims to modify MBPLS-PM with Back Propagation Neural Network approach. The result is MBPLS-PM algorithm can be modified using the Back Propagation Neural Network approach to replace the iterative process in backward and forward step to get the matrix t and the matrix u in the algorithm. By modifying the MBPLS-PM algorithm using Back Propagation Neural Network approach, the model parameters obtained are relatively not significantly different compared to model parameters obtained by original MBPLS-PM algorithm.

  1. An evidential path logic for multi-relational networks

    Energy Technology Data Exchange (ETDEWEB)

    Rodriguez, Marko A [Los Alamos National Laboratory; Geldart, Joe [UNIV OF DURHAM

    2008-01-01

    Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Description Framework (RDF). One of the primary purposes of a knowledge network is to reason; that is, to alter the topology of the network according to an algorithm that uses the existing topological structure as its input. There exist many such reasoning algorithms. With respect to the Semantic Web, the bivalent, axiomatic reasoners of the RDF Schema (RDFS) and the Web Ontology Language (OWL) are the most prevalent. However, nothing prevents other forms of reasoning from existing in the Semantic Web. This article presents a non-bivalent, non-axiomatic, evidential logic and reasoner that is an algebraic ring over a multi-relational network and two binary operations that can be composed to perform various forms of inference. Given its multi-relational grounding, it is possible to use the presented evidential framework as another method for structuring knowledge and reasoning in the Semantic Web. The benefits of this framework are that it works with arbitrary, partial, and contradictory knowledge while, at the same time, supporting a tractable approximate reasoning process.

  2. Optimal Path Choice in Railway Passenger Travel Network Based on Residual Train Capacity

    Directory of Open Access Journals (Sweden)

    Fei Dou

    2014-01-01

    Full Text Available Passenger’s optimal path choice is one of the prominent research topics in the field of railway passenger transport organization. More and more different train types are available, increasing path choices from departure to destination for travelers are unstoppable. However, travelers cannot avoid being confused when they hope to choose a perfect travel plan based on various travel time and cost constraints before departure. In this study, railway passenger travel network is constructed based on train timetable. Both the generalized cost function we developed and the residual train capacity are considered to be the foundation of path searching procedure. The railway passenger travel network topology is analyzed based on residual train capacity. Considering the total travel time, the total travel cost, and the total number of passengers, we propose an optimal path searching algorithm based on residual train capacity in railway passenger travel network. Finally, the rationale of the railway passenger travel network and the optimal path generation algorithm are verified positively by case study.

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

    Directory of Open Access Journals (Sweden)

    Chunlan Yang

    2017-04-01

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

  4. Disordered and Multiple Destinations Path Planning Methods for Mobile Robot in Dynamic Environment

    Directory of Open Access Journals (Sweden)

    Yong-feng Dong

    2016-01-01

    Full Text Available In the smart home environment, aiming at the disordered and multiple destinations path planning, the sequencing rule is proposed to determine the order of destinations. Within each branching process, the initial feasible path set is generated according to the law of attractive destination. A sinusoidal adaptive genetic algorithm is adopted. It can calculate the crossover probability and mutation probability adaptively changing with environment at any time. According to the cultural-genetic algorithm, it introduces the concept of reducing turns by parallelogram and reducing length by triangle in the belief space, which can improve the quality of population. And the fallback strategy can help to jump out of the “U” trap effectively. The algorithm analyses the virtual collision in dynamic environment with obstacles. According to the different collision types, different strategies are executed to avoid obstacles. The experimental results show that cultural-genetic algorithm can overcome the problems of premature and convergence of original algorithm effectively. It can avoid getting into the local optimum. And it is more effective for mobile robot path planning. Even in complex environment with static and dynamic obstacles, it can avoid collision safely and plan an optimal path rapidly at the same time.

  5. Effects of multiple spreaders in community networks

    Science.gov (United States)

    Hu, Zhao-Long; Ren, Zhuo-Ming; Yang, Guang-Yong; Liu, Jian-Guo

    2014-12-01

    Human contact networks exhibit the community structure. Understanding how such community structure affects the epidemic spreading could provide insights for preventing the spreading of epidemics between communities. In this paper, we explore the spreading of multiple spreaders in community networks. A network based on the clustering preferential mechanism is evolved, whose communities are detected by the Girvan-Newman (GN) algorithm. We investigate the spreading effectiveness by selecting the nodes as spreaders in the following ways: nodes with the largest degree in each community (community hubs), the same number of nodes with the largest degree from the global network (global large-degree) and randomly selected one node within each community (community random). The experimental results on the SIR model show that the spreading effectiveness based on the global large-degree and community hubs methods is the same in the early stage of the infection and the method of community random is the worst. However, when the infection rate exceeds the critical value, the global large-degree method embodies the worst spreading effectiveness. Furthermore, the discrepancy of effectiveness for the three methods will decrease as the infection rate increases. Therefore, we should immunize the hubs in each community rather than those hubs in the global network to prevent the outbreak of epidemics.

  6. Software complex for finding the path routings in synchronous digital hierarchy networks

    Directory of Open Access Journals (Sweden)

    V. A. Bulanov

    2014-01-01

    Full Text Available Communication network constructions based on the synchronous digital hierarchy (SDH are widely used in design and operation of telephone networks and data transfer ones on the basis of dedicated links. The providing the link for data transmission from one node to another one is a nontrivial objective. The network equipment vendors, as a rule, may provide also a network system control. However, these systems can be used only with the manufacturer's equipment, but are not intended for finding the optimal paths for the current network operation. They serve for examination to choose a network structure at the stage of its development or modernization for the known in advance matrix of connections. From the practice it is seen that the real networks structures use diverse equipment. Therefore to develop a complex to find the paths in SDH-based network is a challenge.Dijkstra algorithm is implemented to find the shortest network path routings in the complex. The use of the classical algorithm is impossible because of the restrictions in providing main and reserve links. There are multiplex sections with no routes to be expected. Such restriction is due to real arrangement of some multiplex sections in the same cables, but in different fibres. When providing the main link, the appropriate structuring sections should be preferable. For example, the link E3 (34 Mbit/s can pass only across the section of relevant configuration. The reserve link cannot pass across those multiplex sections where the main link has passed. This rule is not 'extra' considering the first restriction since the main and reserve link sections cannot crisscross the node. At the dead ends reserving has no sense, and the reserve link has to coincide with the main one to save a multiplex section resource of terminal switching. In implementation all these restrictions have been taken into consideration.In addition to the path routings, complex enables saving information on the network

  7. Path Planning and Navigation for Mobile Robots in a Hybrid Sensor Network without Prior Location Information

    Directory of Open Access Journals (Sweden)

    Zheng Zhang

    2013-03-01

    Full Text Available In a hybrid wireless sensor network with mobile and static nodes, which have no prior geographical knowledge, successful navigation for mobile robots is one of the main challenges. In this paper, we propose two novel navigation algorithms for outdoor environments, which permit robots to travel from one static node to another along a planned path in the sensor field, namely the RAC and the IMAP algorithms. Using this, the robot can navigate without the help of a map, GPS or extra sensor modules, only using the received signal strength indication (RSSI and odometry. Therefore, our algorithms have the advantage of being cost-effective. In addition, a path planning algorithm to schedule mobile robots' travelling paths is presented, which focuses on shorter distances and robust paths for robots by considering the RSSI-Distance characteristics. The simulations and experiments conducted with an autonomous mobile robot show the effectiveness of the proposed algorithms in an outdoor environment.

  8. Synchronization in networks with multiple interaction layers

    Science.gov (United States)

    del Genio, Charo I.; Gómez-Gardeñes, Jesús; Bonamassa, Ivan; Boccaletti, Stefano

    2016-01-01

    The structure of many real-world systems is best captured by networks consisting of several interaction layers. Understanding how a multilayered structure of connections affects the synchronization properties of dynamical systems evolving on top of it is a highly relevant endeavor in mathematics and physics and has potential applications in several socially relevant topics, such as power grid engineering and neural dynamics. We propose a general framework to assess the stability of the synchronized state in networks with multiple interaction layers, deriving a necessary condition that generalizes the master stability function approach. We validate our method by applying it to a network of Rössler oscillators with a double layer of interactions and show that highly rich phenomenology emerges from this. This includes cases where the stability of synchronization can be induced even if both layers would have individually induced unstable synchrony, an effect genuinely arising from the true multilayer structure of the interactions among the units in the network. PMID:28138540

  9. A new approach to shortest paths on networks based on the quantum bosonic mechanism

    Energy Technology Data Exchange (ETDEWEB)

    Jiang Xin; Wang Hailong; Tang Shaoting; Ma Lili; Zhang Zhanli; Zheng Zhiming, E-mail: jiangxin@ss.buaa.edu.cn [Key Laboratory of Mathematics, Informatics and Behavioral Semantics, Ministry of Education, Beijing University of Aeronautics and Astronautics, 100191 Beijing (China)

    2011-01-15

    This paper presents quantum bosonic shortest path searching (QBSPS), a natural, practical and highly heuristic physical algorithm for reasoning about the recognition of network structure via quantum dynamics. QBSPS is based on an Anderson-like itinerant bosonic system in which a boson's Green function is used as a navigation pointer for one to accurately approach the terminals. QBSPS is demonstrated by rigorous mathematical and physical proofs and plenty of simulations, showing how it can be used as a greedy routing to seek the shortest path between different locations. In methodology, it is an interesting and new algorithm rooted in the quantum mechanism other than combinatorics. In practice, for the all-pairs shortest-path problem in a random scale-free network with N vertices, QBSPS runs in O({mu}(N) ln ln N) time. In application, we suggest that the corresponding experimental realizations are feasible by considering path searching in quantum optical communication networks; in this situation, the method performs a pure local search on networks without requiring the global structure that is necessary for current graph algorithms.

  10. Energy-aware path selection metric for IEEE 802.11s wireless mesh networking

    CSIR Research Space (South Africa)

    Mhlanga, MM

    2009-01-01

    Full Text Available The IEEE 802.11s working group has commenced activities, which would lead to the development of a standard for wireless mesh networks (WMNs). The draft of 802.11s introduces a new path selection metric called airtime link metric. However...

  11. Energy-aware path selection metric for IEEE 802.11s wireless mesh networking

    CSIR Research Space (South Africa)

    Mhlanga, MM

    2009-08-01

    Full Text Available The IEEE 802.11s working group has commenced activities, which would lead to the development of a standard for wireless mesh networks (WMNs). The draft of 802.11s introduces a new path selection metric called airtime link metric. However...

  12. Degree distribution of shortest path trees and bias of network sampling algorithms

    NARCIS (Netherlands)

    Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.

    2013-01-01

    In this article, we explicitly derive the limiting distribution of the degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the power-law exponent of the degree distribution of this tree and compare it to the degree

  13. Degree distribution of shortest path trees and bias of network sampling algorithms

    NARCIS (Netherlands)

    Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.

    2015-01-01

    In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the asymptotics of the degree distribution for large degrees of this tree and compare it to the degree distribution

  14. Path dependence and the geography of infrastructure networks: the case of the European fibre-optic network

    NARCIS (Netherlands)

    Vinciguerra, S.; Frenken, K.

    2015-01-01

    We analyse the path dependent dynamics in the formation of new infrastructure using an augmented gravity model. We observe that the formation of the pan-European telecommunication backbone has been dependent on pre-existent European transportation networks, particularly, the maritime and railway

  15. Lambdastation: a forwarding and admission control service to interface production network facilities with advanced research network paths

    Energy Technology Data Exchange (ETDEWEB)

    DeMar, Philip; Petravick, Don; /Fermilab

    2004-12-01

    Over the past several years, there has been a great deal of research effort and funding put into the deployment of optical-based, advanced technology wide-area networks. Fermilab and CalTech have initiated a project to enable our production network facilities to exploit these advanced research network facilities. Our objective is to forward designated data transfers across these advanced wide area networks on a per-flow basis, making use our capacious production-use storage systems connected to the local campus network. To accomplish this, we intend to develop a dynamically provisioned forwarding service that would provide alternate path forwarding onto available wide area advanced research networks. The service would dynamically reconfigure forwarding of specific flows within our local production-use network facilities, as well as provide an interface to enable applications to utilize the service. We call this service LambdaStation. If one envisions wide area optical network paths as high bandwidth data railways, then LambdaStation would functionally be the railroad terminal that regulates which flows at the local site get directed onto the high bandwidth data railways. LambdaStation is a DOE-funded SciDac research project in its very early stage of development.

  16. Path selection rules for droplet trains in single-lane microfluidic networks

    Science.gov (United States)

    Amon, A.; Schmit, A.; Salkin, L.; Courbin, L.; Panizza, P.

    2013-07-01

    We investigate the transport of periodic trains of droplets through microfluidic networks having one inlet, one outlet, and nodes consisting of T junctions. Variations of the dilution of the trains, i.e., the distance between drops, reveal the existence of various hydrodynamic regimes characterized by the number of preferential paths taken by the drops. As the dilution increases, this number continuously decreases until only one path remains explored. Building on a continuous approach used to treat droplet traffic through a single asymmetric loop, we determine selection rules for the paths taken by the drops and we predict the variations of the fraction of droplets taking these paths with the parameters at play including the dilution. Our results show that as dilution decreases, the paths are selected according to the ascending order of their hydrodynamic resistance in the absence of droplets. The dynamics of these systems controlled by time-delayed feedback is complex: We observe a succession of periodic regimes separated by a wealth of bifurcations as the dilution is varied. In contrast to droplet traffic in single asymmetric loops, the dynamical behavior in networks of loops is sensitive to initial conditions because of extra degrees of freedom.

  17. Benefit of adaptive FEC in shared backup path protected elastic optical network.

    Science.gov (United States)

    Guo, Hong; Dai, Hua; Wang, Chao; Li, Yongcheng; Bose, Sanjay K; Shen, Gangxiang

    2015-07-27

    We apply an adaptive forward error correction (FEC) allocation strategy to an Elastic Optical Network (EON) operated with shared backup path protection (SBPP). To maximize the protected network capacity that can be carried, an Integer Linear Programing (ILP) model and a spectrum window plane (SWP)-based heuristic algorithm are developed. Simulation results show that the FEC coding overhead required by the adaptive FEC scheme is significantly lower than that needed by a fixed FEC allocation strategy resulting in higher network capacity for the adaptive strategy. The adaptive FEC allocation strategy can also significantly outperform the fixed FEC allocation strategy both in terms of the spare capacity redundancy and the average FEC coding overhead needed per optical channel. The proposed heuristic algorithm is efficient and not only performs closer to the ILP model but also does much better than the shortest-path algorithm.

  18. Modeling a Single SEP Event from Multiple Vantage Points Using the iPATH Model

    Science.gov (United States)

    Hu, Junxiang; Li, Gang; Fu, Shuai; Zank, Gary; Ao, Xianzhi

    2018-02-01

    Using the recently extended 2D improved Particle Acceleration and Transport in the Heliosphere (iPATH) model, we model an example gradual solar energetic particle event as observed at multiple locations. Protons and ions that are energized via the diffusive shock acceleration mechanism are followed at a 2D coronal mass ejection-driven shock where the shock geometry varies across the shock front. The subsequent transport of energetic particles, including cross-field diffusion, is modeled by a Monte Carlo code that is based on a stochastic differential equation method. Time intensity profiles and particle spectra at multiple locations and different radial distances, separated in longitudes, are presented. The results shown here are relevant to the upcoming Parker Solar Probe mission.

  19. Shortest path problem on a grid network with unordered intermediate points

    Science.gov (United States)

    Saw, Veekeong; Rahman, Amirah; Eng Ong, Wen

    2017-10-01

    We consider a shortest path problem with single cost factor on a grid network with unordered intermediate points. A two stage heuristic algorithm is proposed to find a feasible solution path within a reasonable amount of time. To evaluate the performance of the proposed algorithm, computational experiments are performed on grid maps of varying size and number of intermediate points. Preliminary results for the problem are reported. Numerical comparisons against brute forcing show that the proposed algorithm consistently yields solutions that are within 10% of the optimal solution and uses significantly less computation time.

  20. Competence-based multiple learning paths: on the road of implementation

    Directory of Open Access Journals (Sweden)

    María Dolores de Prada

    2014-12-01

    Full Text Available This article presents the results of an action-research implementation project based on a system that weaves together five different routes to facilitate the development of competences through the use of multiple learning paths for primary and secondary teachers. The first and initial results that the article deals with relate to the experience of math teachers for ages 11 to 14. Other levels and other fields are in the process of being developed. The article deals briefly with the justification, the background and the fundamental principles that underpin the research methodology and introduces a number of elements such as the method followed by the research, the resources and the materials used as well as the results obtained at the end of the second year of this experience. It also justifies the model chosen and the criteria and strategies selected for its reliability and verification. In addition, it provides significant elements of reflection about a number of burning issues: The development of a new profile of the “teacher” in a studentcentred system and the implementation system to be followed, the importance of multiple but integrated learning paths and the relevance as well as the reflection on real cases of competence evaluation.

  1. Multiple network interface core apparatus and method

    Science.gov (United States)

    Underwood, Keith D [Albuquerque, NM; Hemmert, Karl Scott [Albuquerque, NM

    2011-04-26

    A network interface controller and network interface control method comprising providing a single integrated circuit as a network interface controller and employing a plurality of network interface cores on the single integrated circuit.

  2. Quality-of-Service Routing Using Path and Power Aware Techniques in Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    R. Asokan

    2008-01-01

    Full Text Available Mobile ad hoc network (MANET is a collection of wireless mobile hosts dynamically forming a temporary network without the aid of any existing established infrastructure. Quality of service (QoS is a set of service requirements that needs to be met by the network while transporting a packet stream from a source to its destination. QoS support MANETs is a challenging task due to the dynamic topology and limited resources. The main objective of this paper is to enhance the QoS routing for MANET using temporally ordered routing algorithm (TORA with self-healing and optimized routing techniques (SHORT. SHORT improves routing optimality by monitoring routing paths continuously and redirecting the path whenever a shortcut path is available. In this paper, the performance comparison of TORA and TORA with SHORT has been analyzed using network simulator for various parameters. TORA with SHORT enhances performance of TORA in terms of throughput, packet loss, end-to-end delay, and energy.

  3. Multiple Social Networks, Data Models and Measures for

    DEFF Research Database (Denmark)

    Magnani, Matteo; Rossi, Luca

    2017-01-01

    Multiple Social Network Analysis is a discipline defining models, measures, methodologies, and algorithms to study multiple social networks together as a single social system. It is particularly valuable when the networks are interconnected, e.g., the same actors are present in more than one...

  4. Impact of Beamforming on the Path Connectivity in Cognitive Radio Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Le The Dung

    2017-03-01

    Full Text Available This paper investigates the impact of using directional antennas and beamforming schemes on the connectivity of cognitive radio ad hoc networks (CRAHNs. Specifically, considering that secondary users use two kinds of directional antennas, i.e., uniform linear array (ULA and uniform circular array (UCA antennas, and two different beamforming schemes, i.e., randomized beamforming and center-directed to communicate with each other, we study the connectivity of all combination pairs of directional antennas and beamforming schemes and compare their performances to those of omnidirectional antennas. The results obtained in this paper show that, compared with omnidirectional transmission, beamforming transmission only benefits the connectivity when the density of secondary user is moderate. Moreover, the combination of UCA and randomized beamforming scheme gives the highest path connectivity in all evaluating scenarios. Finally, the number of antenna elements and degree of path loss greatly affect path connectivity in CRAHNs.

  5. Calibration of neural networks using genetic algorithms, with application to optimal path planning

    Science.gov (United States)

    Smith, Terence R.; Pitney, Gilbert A.; Greenwood, Daniel

    1987-01-01

    Genetic algorithms (GA) are used to search the synaptic weight space of artificial neural systems (ANS) for weight vectors that optimize some network performance function. GAs do not suffer from some of the architectural constraints involved with other techniques and it is straightforward to incorporate terms into the performance function concerning the metastructure of the ANS. Hence GAs offer a remarkably general approach to calibrating ANS. GAs are applied to the problem of calibrating an ANS that finds optimal paths over a given surface. This problem involves training an ANS on a relatively small set of paths and then examining whether the calibrated ANS is able to find good paths between arbitrary start and end points on the surface.

  6. Path selection and bandwidth allocation in MPLS networks: a nonlinear programming approach

    Science.gov (United States)

    Burns, J. E.; Ott, Teunis J.; de Kock, Johan M.; Krzesinski, Anthony E.

    2001-07-01

    Multi-protocol Label Switching extends the IPv4 destination-based routing protocols to provide new and scalable routing capabilities in connectionless networks using relatively simple packet forwarding mechanisms. MPLS networks carry traffic on virtual connections called label switched paths. This paper considers path selection and bandwidth allocation in MPLS networks in order to optimize the network quality of service. The optimization is based upon the minimization of a non-linear objective function which under light load simplifies to OSPF routing with link metrics equal to the link propagation delays. The behavior under heavy load depends on the choice of certain parameters: It can essentially be made to minimize maximal expected utilization, or to maximize minimal expected weighted slacks (both over all links). Under certain circumstances it can be made to minimize the probability that a link has an instantaneous offered load larger than its transmission capacity. We present a model of an MPLS network and an algorithm to find and capacitate optimal LSPs. The algorithm is an improvement of the well-known flow deviation non-linear programming method. The algorithm is applied to compute optimal LSPs for several test networks carrying a single traffic class.

  7. A MODIFIED GENETIC ALGORITHM FOR FINDING FUZZY SHORTEST PATHS IN UNCERTAIN NETWORKS

    Directory of Open Access Journals (Sweden)

    A. A. Heidari

    2016-06-01

    Full Text Available In realistic network analysis, there are several uncertainties in the measurements and computation of the arcs and vertices. These uncertainties should also be considered in realizing the shortest path problem (SPP due to the inherent fuzziness in the body of expert's knowledge. In this paper, we investigated the SPP under uncertainty to evaluate our modified genetic strategy. We improved the performance of genetic algorithm (GA to investigate a class of shortest path problems on networks with vague arc weights. The solutions of the uncertain SPP with considering fuzzy path lengths are examined and compared in detail. As a robust metaheuristic, GA algorithm is modified and evaluated to tackle the fuzzy SPP (FSPP with uncertain arcs. For this purpose, first, a dynamic operation is implemented to enrich the exploration/exploitation patterns of the conventional procedure and mitigate the premature convergence of GA technique. Then, the modified GA (MGA strategy is used to resolve the FSPP. The attained results of the proposed strategy are compared to those of GA with regard to the cost, quality of paths and CPU times. Numerical instances are provided to demonstrate the success of the proposed MGA-FSPP strategy in comparison with GA. The simulations affirm that not only the proposed technique can outperform GA, but also the qualities of the paths are effectively improved. The results clarify that the competence of the proposed GA is preferred in view of quality quantities. The results also demonstrate that the proposed method can efficiently be utilized to handle FSPP in uncertain networks.

  8. An efficient hybrid protection scheme with shared/dedicated backup paths on elastic optical networks

    Directory of Open Access Journals (Sweden)

    Nogbou G. Anoh

    2017-02-01

    Full Text Available Fast recovery and minimum utilization of resources are the two main criteria for determining the protection scheme quality. We address the problem of providing a hybrid protection approach on elastic optical networks under contiguity and continuity of available spectrum constraints. Two main hypotheses are used in this paper for backup paths computation. In the first case, it is assumed that backup paths resources are dedicated. In the second case, the assumption is that backup paths resources are available shared resources. The objective of the study is to minimize spectrum utilization to reduce blocking probability on a network. For this purpose, an efficient survivable Hybrid Protection Lightpath (HybPL algorithm is proposed for providing shared or dedicated backup path protection based on the efficient energy calculation and resource availability. Traditional First-Fit and Best-Fit schemes are employed to search and assign the available spectrum resources. The simulation results show that HybPL presents better performance in terms of blocking probability, compared with the Minimum Resources Utilization Dedicated Protection (MRU-DP algorithm which offers better performance than the Dedicated Protection (DP algorithm.

  9. Distribution of shortest path lengths in a class of node duplication network models

    Science.gov (United States)

    Steinbock, Chanania; Biham, Ofer; Katzav, Eytan

    2017-09-01

    We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social networks, acquaintance networks, and scientific citation networks, where duplication mechanisms play a major role. Starting from an initial seed network, at each time step a random node, referred to as a mother node, is selected for duplication. Its daughter node is added to the network, forming a link to the mother node, and with probability p to each one of its neighbors. The degree distribution of the resulting network turns out to follow a power-law distribution, thus the ND network is a scale-free network. To calculate the DSPL we derive a master equation for the time evolution of the probability Pt(L =ℓ ) , ℓ =1 ,2 ,⋯ , where L is the distance between a pair of nodes and t is the time. Finding an exact analytical solution of the master equation, we obtain a closed form expression for Pt(L =ℓ ) . The mean distance 〈L〉 t and the diameter Δt are found to scale like lnt , namely, the ND network is a small-world network. The variance of the DSPL is also found to scale like lnt . Interestingly, the mean distance and the diameter exhibit properties of a small-world network, rather than the ultrasmall-world network behavior observed in other scale-free networks, in which 〈L〉 t˜lnlnt .

  10. A Dynamic Bioinspired Neural Network Based Real-Time Path Planning Method for Autonomous Underwater Vehicles.

    Science.gov (United States)

    Ni, Jianjun; Wu, Liuying; Shi, Pengfei; Yang, Simon X

    2017-01-01

    Real-time path planning for autonomous underwater vehicle (AUV) is a very difficult and challenging task. Bioinspired neural network (BINN) has been used to deal with this problem for its many distinct advantages: that is, no learning process is needed and realization is also easy. However, there are some shortcomings when BINN is applied to AUV path planning in a three-dimensional (3D) unknown environment, including complex computing problem when the environment is very large and repeated path problem when the size of obstacles is bigger than the detection range of sensors. To deal with these problems, an improved dynamic BINN is proposed in this paper. In this proposed method, the AUV is regarded as the core of the BINN and the size of the BINN is based on the detection range of sensors. Then the BINN will move with the AUV and the computing could be reduced. A virtual target is proposed in the path planning method to ensure that the AUV can move to the real target effectively and avoid big-size obstacles automatically. Furthermore, a target attractor concept is introduced to improve the computing efficiency of neural activities. Finally, some experiments are conducted under various 3D underwater environments. The experimental results show that the proposed BINN based method can deal with the real-time path planning problem for AUV efficiently.

  11. Enabling Advanced Path-Finding on Terrains and in Spatial Networks

    DEFF Research Database (Denmark)

    Kaul, Manohar

    traffic updates. The solution assumes that the dynamic real-valued edge weights are bounded in a manner consistent with real-world data, which enables a theoretical guarantee on the travel time. Comprehensive experiments suggest that the proposed methods are accurate, efficient, robust, and scalable....... into the effectiveness and efficiency of the two approaches. Finally, we propose a scalable distributed system that maintains a large number of continuous fastest-path queries on a large spatial network, providing users with guaranteed approximate fastest paths to their destinations, while facing heavy real- time....... The first scans the 3D point-cloud in a single pass and constructs the 3D road network on the fly, while the second approach reads the 3D points as disk blocks in accordance to a locality-preserving space-filling curve. Results from empirical studies with real- world data offer insight...

  12. A note on "Multicriteria adaptive paths in stochastic, time-varying networks"

    DEFF Research Database (Denmark)

    Pretolani, Daniele; Nielsen, Lars Relund; Andersen, Kim Allan

    In a recent paper, Opasanon and Miller-Hooks study multicriteria adaptive paths in stochastic time-varying networks. They propose a label correcting algorithm for finding the full set of efficient strategies. In this note we show that their algorithm is not correct, since it is based on a property...... that does not hold in general. Opasanon and Miller-Hooks also propose an algorithm for solving a parametric problem. We give a simplified algorithm which is linear in the input size....

  13. Optimization of the Critical Diameter and Average Path Length of Social Networks

    Directory of Open Access Journals (Sweden)

    Haifeng Du

    2017-01-01

    Full Text Available Optimizing average path length (APL by adding shortcut edges has been widely discussed in connection with social networks, but the relationship between network diameter and APL is generally ignored in the dynamic optimization of APL. In this paper, we analyze this relationship and transform the problem of optimizing APL into the problem of decreasing diameter to 2. We propose a mathematic model based on a memetic algorithm. Experimental results show that our algorithm can efficiently solve this problem as well as optimize APL.

  14. Employing Multiple Unmanned Aerial Vehicles for Co-Operative Path Planning

    Directory of Open Access Journals (Sweden)

    Durdana Habib

    2013-05-01

    Full Text Available Abstract In this paper, we work to develop a path planning solution for a group of Unmanned Aerial Vehicles (UAVs using a Mixed Integer Linear Programming (MILP approach. Co-operation among team members not only helps reduce mission time, it makes the execution more robust in dynamic environments. However, the problem becomes more challenging as it requires optimal resource allocation and is NP-hard. Since UAVs may be lost or may suffer significant damage during the course of the mission, plans may need to be modified in real-time as the mission proceeds. Therefore, multiple UAVs have a better chance of completing a mission in the face of failures. Such military operations can be treated as a variant of the Multiple Depot Vehicle Routing Problem (MDVRP. The proposed solution must be such that m UAVs start from multiple source locations to visit n targets and return to a set of destination locations such that (1 each target is visited exactly by one of the chosen UAVs (2 the total distance travelled by the group is minimized and (3 the number of targets that each UAV visits may not be less than K or greater than L.

  15. Stability of Intelligent Transportation Network Dynamics: A Daily Path Flow Adjustment considering Travel Time Differentiation

    Directory of Open Access Journals (Sweden)

    Ming-Chorng Hwang

    2015-01-01

    Full Text Available A theoretic formulation on how traffic time information distributed by ITS operations influences the trajectory of network flows is presented in this paper. The interactions between users and ITS operator are decomposed into three parts: (i travel time induced path flow dynamics (PFDTT; (ii demand induced path flow dynamics (PFDD; and (iii predicted travel time dynamics for an origin-destination (OD pair (PTTDOD. PFDTT describes the collective results of user’s daily route selection by pairwise comparison of path travel time provided by ITS services. The other two components, PTTDOD and PFDD, are concentrated on the evolutions of system variables which are predicted and observed, respectively, by ITS operators to act as a benchmark in guiding the target system towards an expected status faster. In addition to the delivered modelings, the stability theorem of the equilibrium solution in the sense of Lyapunov stability is also provided. A Lyapunov function is developed and employed to the proof of stability theorem to show the asymptotic behavior of the aimed system. The information of network flow dynamics plays a key role in traffic control policy-making. The evaluation of ITS-based strategies will not be reasonable without a well-established modeling of network flow evolutions.

  16. Optical image encryption scheme with multiple light paths based on compressive ghost imaging

    Science.gov (United States)

    Zhu, Jinan; Yang, Xiulun; Meng, Xiangfeng; Wang, Yurong; Yin, Yongkai; Sun, Xiaowen; Dong, Guoyan

    2018-02-01

    An optical image encryption method with multiple light paths is proposed based on compressive ghost imaging. In the encryption process, M random phase-only masks (POMs) are generated by means of logistic map algorithm, and these masks are then uploaded to the spatial light modulator (SLM). The collimated laser light is divided into several beams by beam splitters as it passes through the SLM, and the light beams illuminate the secret images, which are converted into sparse images by discrete wavelet transform beforehand. Thus, the secret images are simultaneously encrypted into intensity vectors by ghost imaging. The distances between the SLM and secret images vary and can be used as the main keys with original POM and the logistic map algorithm coefficient in the decryption process. In the proposed method, the storage space can be significantly decreased and the security of the system can be improved. The feasibility, security and robustness of the method are further analysed through computer simulations.

  17. 77 FR 39735 - Certain Integrated Circuit Packages Provided With Multiple Heat-Conducting Paths and Products...

    Science.gov (United States)

    2012-07-05

    ...Notice is hereby given that a complaint was filed with the U.S. International Trade Commission on May 31, 2012, under section 337 of the Tariff Act of 1930, as amended, on behalf of Industrial Technology Research Institute of Taiwan and ITRI International of San Jose, California. The complaint alleges violations of section 337 based upon the importation into the United States, the sale for importation, and the sale within the United States after importation of certain integrated circuit packages provided with multiple heat-conducting paths and products containing same by reason of infringement of certain claims of U.S. Patent No. 5,710,459 (``the `459 patent''). The complaint further alleges that an industry in the United States exists as required by subsection (a)(2) of section 337. The complainants request that the Commission institute an investigation and, after the investigation, issue an exclusion order and cease and desist order.

  18. Lambda Station: Alternate network path forwarding for production SciDAC applications

    International Nuclear Information System (INIS)

    Grigoriev, Maxim; Bobyshev, Andrey; Crawford, Matt; DeMar, Phil; Grigaliunas, Vyto; Moibenko, Alexander; Petravick, Don; Newman, Harvey; Steenberg, Conrad; Thomas, Michael

    2007-01-01

    The LHC era will start very soon, creating immense data volumes capable of demanding allocation of an entire network circuit for task-driven applications. Circuit-based alternate network paths are one solution to meeting the LHC high bandwidth network requirements. The Lambda Station project is aimed at addressing growing requirements for dynamic allocation of alternate network paths. Lambda Station facilitates the rerouting of designated traffic through site LAN infrastructure onto so-called 'high-impact' wide-area networks. The prototype Lambda Station developed with Service Oriented Architecture (SOA) approach in mind will be presented. Lambda Station has been successfully integrated into the production version of the Storage Resource Manager (SRM), and deployed at US CMS Tier1 center at Fermilab, as well as at US-CMS Tier-2 site at Caltech. This paper will discuss experiences using the prototype system with production SciDAC applications for data movement between Fermilab and Caltech. The architecture and design principles of the production version Lambda Station software, currently being implemented as Java based web services, will also be presented in this paper

  19. Identifying influential spreaders in complex networks through local effective spreading paths

    Science.gov (United States)

    Wang, Xiaojie; Zhang, Xue; Yi, Dongyun; Zhao, Chengli

    2017-05-01

    How to effectively identify a set of influential spreaders in complex networks is of great theoretical and practical value, which can help to inhibit the rapid spread of epidemics, promote the sales of products by word-of-mouth advertising, and so on. A naive strategy is to select the top ranked nodes as identified by some centrality indices, and other strategies are mainly based on greedy methods and heuristic methods. However, most of those approaches did not concern the connections between nodes. Usually, the distances between the selected spreaders are very close, leading to a serious overlapping of their influence. As a consequence, the global influence of the spreaders in networks will be greatly reduced, which largely restricts the performance of those methods. In this paper, a simple and efficient method is proposed to identify a set of discrete yet influential spreaders. By analyzing the spreading paths in the network, we present the concept of effective spreading paths and measure the influence of nodes via expectation calculation. The numerical analysis in undirected and directed networks all show that our proposed method outperforms many other centrality-based and heuristic benchmarks, especially in large-scale networks. Besides, experimental results on different spreading models and parameters demonstrates the stability and wide applicability of our method.

  20. A Path Based Model for a Green Liner Shipping Network Design

    DEFF Research Database (Denmark)

    Brouer, Berit Dangaard; Jepsen, Mads Kehlet; Plum, Christian Edinger Munk

    Liner shipping networks are the backbone of international trade providing low transportation cost, which is a major driver of globalization. These networks are under constant pressure to deliver capacity, cost eectiveness and environmentally conscious transport solutions. This article proposes...... a new path based MIP model for the Liner shipping Network Design Problem minimizing the cost of vessels and their fuel consumption facilitating a green network. The proposed model reduces problem size using a novel aggregation of demands. A decomposition method enabling delayed column generation...... is presented. The subproblems have similar structure to Vehicle Routing Problems, which can be solved using dynamic programming. An algorithm has been implemented for this model, unfortunately with discouraging results due to the structure of the subproblem and the lack of proper dominance criteria...

  1. A minimum resource neural network framework for solving multiconstraint shortest path problems.

    Science.gov (United States)

    Zhang, Junying; Zhao, Xiaoxue; He, Xiaotao

    2014-08-01

    Characterized by using minimum hard (structural) and soft (computational) resources, a novel parameter-free minimal resource neural network (MRNN) framework is proposed for solving a wide range of single-source shortest path (SP) problems for various graph types. The problems are the k-shortest time path problems with any combination of three constraints: time, hop, and label constraints, and the graphs can be directed, undirected, or bidirected with symmetric and/or asymmetric traversal time, which can be real and time dependent. Isomorphic to the graph where the SP is to be sought, the network is activated by generating autowave at source neuron and the autowave travels automatically along the paths with the speed of a hop in an iteration. Properties of the network are studied, algorithms are presented, and computation complexity is analyzed. The framework guarantees globally optimal solutions of a series of problems during the iteration process of the network, which provides insight into why even the SP is still too long to be satisfied. The network facilitates very large scale integrated circuit implementation and adapt to very large scale problems due to its massively parallel processing and minimum resource utilization. When implemented in a sequentially processing computer, experiments on synthetic graphs, road maps of cities of the USA, and vehicle routing with time windows indicate that the MRNN is especially efficient for large scale sparse graphs and even dense graphs with some constraints, e.g., the CPU time taken and the iteration number used for the road maps of cities of the USA is even less than  ∼ 2% and 0.5% that of the Dijkstra's algorithm.

  2. Accurate path integration in continuous attractor network models of grid cells.

    Science.gov (United States)

    Burak, Yoram; Fiete, Ila R

    2009-02-01

    Grid cells in the rat entorhinal cortex display strikingly regular firing responses to the animal's position in 2-D space and have been hypothesized to form the neural substrate for dead-reckoning. However, errors accumulate rapidly when velocity inputs are integrated in existing models of grid cell activity. To produce grid-cell-like responses, these models would require frequent resets triggered by external sensory cues. Such inadequacies, shared by various models, cast doubt on the dead-reckoning potential of the grid cell system. Here we focus on the question of accurate path integration, specifically in continuous attractor models of grid cell activity. We show, in contrast to previous models, that continuous attractor models can generate regular triangular grid responses, based on inputs that encode only the rat's velocity and heading direction. We consider the role of the network boundary in the integration performance of the network and show that both periodic and aperiodic networks are capable of accurate path integration, despite important differences in their attractor manifolds. We quantify the rate at which errors in the velocity integration accumulate as a function of network size and intrinsic noise within the network. With a plausible range of parameters and the inclusion of spike variability, our model networks can accurately integrate velocity inputs over a maximum of approximately 10-100 meters and approximately 1-10 minutes. These findings form a proof-of-concept that continuous attractor dynamics may underlie velocity integration in the dorsolateral medial entorhinal cortex. The simulations also generate pertinent upper bounds on the accuracy of integration that may be achieved by continuous attractor dynamics in the grid cell network. We suggest experiments to test the continuous attractor model and differentiate it from models in which single cells establish their responses independently of each other.

  3. Eco-reliable path finding in time-variant and stochastic networks

    International Nuclear Information System (INIS)

    Li, Wenjie; Yang, Lixing; Wang, Li; Zhou, Xuesong; Liu, Ronghui; Gao, Ziyou

    2017-01-01

    This paper addresses a route guidance problem for finding the most eco-reliable path in time-variant and stochastic networks such that travelers can arrive at the destination with the maximum on-time probability while meeting vehicle emission standards imposed by government regulators. To characterize the dynamics and randomness of transportation networks, the link travel times and emissions are assumed to be time-variant random variables correlated over the entire network. A 0–1 integer mathematical programming model is formulated to minimize the probability of late arrival by simultaneously considering the least expected emission constraint. Using the Lagrangian relaxation approach, the primal model is relaxed into a dualized model which is further decomposed into two simple sub-problems. A sub-gradient method is developed to reduce gaps between upper and lower bounds. Three sets of numerical experiments are tested to demonstrate the efficiency and performance of our proposed model and algorithm. - Highlights: • The most eco-reliable path is defined in time-variant and stochastic networks. • The model is developed with on-time arrival probability and emission constraints. • The sub-gradient and label correcting algorithm are integrated to solve the model. • Numerical experiments demonstrate the effectiveness of developed approaches.

  4. Adaptive multi-node multiple input and multiple output (MIMO) transmission for mobile wireless multimedia sensor networks.

    Science.gov (United States)

    Cho, Sunghyun; Choi, Ji-Woong; You, Cheolwoo

    2013-10-02

    Mobile wireless multimedia sensor networks (WMSNs), which consist of mobile sink or sensor nodes and use rich sensing information, require much faster and more reliable wireless links than static wireless sensor networks (WSNs). This paper proposes an adaptive multi-node (MN) multiple input and multiple output (MIMO) transmission to improve the transmission reliability and capacity of mobile sink nodes when they experience spatial correlation. Unlike conventional single-node (SN) MIMO transmission, the proposed scheme considers the use of transmission antennas from more than two sensor nodes. To find an optimal antenna set and a MIMO transmission scheme, a MN MIMO channel model is introduced first, followed by derivation of closed-form ergodic capacity expressions with different MIMO transmission schemes, such as space-time transmit diversity coding and spatial multiplexing. The capacity varies according to the antenna correlation and the path gain from multiple sensor nodes. Based on these statistical results, we propose an adaptive MIMO mode and antenna set switching algorithm that maximizes the ergodic capacity of mobile sink nodes. The ergodic capacity of the proposed scheme is compared with conventional SN MIMO schemes, where the gain increases as the antenna correlation and path gain ratio increase.

  5. Metabolic Network Discovery by Top-Down and Bottom-Up Approaches and Paths for Reconciliation

    Energy Technology Data Exchange (ETDEWEB)

    Çakır, Tunahan, E-mail: tcakir@gyte.edu.tr [Computational Systems Biology Group, Department of Bioengineering, Gebze Technical University (formerly known as Gebze Institute of Technology), Gebze (Turkey); Khatibipour, Mohammad Jafar [Computational Systems Biology Group, Department of Bioengineering, Gebze Technical University (formerly known as Gebze Institute of Technology), Gebze (Turkey); Department of Chemical Engineering, Gebze Technical University (formerly known as Gebze Institute of Technology), Gebze (Turkey)

    2014-12-03

    The primary focus in the network-centric analysis of cellular metabolism by systems biology approaches is to identify the active metabolic network for the condition of interest. Two major approaches are available for the discovery of the condition-specific metabolic networks. One approach starts from genome-scale metabolic networks, which cover all possible reactions known to occur in the related organism in a condition-independent manner, and applies methods such as the optimization-based Flux-Balance Analysis to elucidate the active network. The other approach starts from the condition-specific metabolome data, and processes the data with statistical or optimization-based methods to extract information content of the data such that the active network is inferred. These approaches, termed bottom-up and top-down, respectively, are currently employed independently. However, considering that both approaches have the same goal, they can both benefit from each other paving the way for the novel integrative analysis methods of metabolome data- and flux-analysis approaches in the post-genomic era. This study reviews the strengths of constraint-based analysis and network inference methods reported in the metabolic systems biology field; then elaborates on the potential paths to reconcile the two approaches to shed better light on how the metabolism functions.

  6. A Feedback-Based Secure Path Approach for Wireless Sensor Network Data Collection

    Science.gov (United States)

    Mao, Yuxin; Wei, Guiyi

    2010-01-01

    The unattended nature of wireless sensor networks makes them very vulnerable to malicious attacks. Therefore, how to preserve secure data collection is an important issue to wireless sensor networks. In this paper, we propose a novel approach of secure data collection for wireless sensor networks. We explore secret sharing and multipath routing to achieve secure data collection in wireless sensor network with compromised nodes. We present a novel tracing-feedback mechanism, which makes full use of the routing functionality of wireless sensor networks, to improve the quality of data collection. The major advantage of the approach is that the secure paths are constructed as a by-product of data collection. The process of secure routing causes little overhead to the sensor nodes in the network. Compared with existing works, the algorithms of the proposed approach are easy to implement and execute in resource-constrained wireless sensor networks. According to the result of a simulation experiment, the performance of the approach is better than the recent approaches with a similar purpose. PMID:22163424

  7. A Feedback-Based Secure Path Approach for Wireless Sensor Network Data Collection

    Directory of Open Access Journals (Sweden)

    Guiyi Wei

    2010-10-01

    Full Text Available The unattended nature of wireless sensor networks makes them very vulnerable to malicious attacks. Therefore, how to preserve secure data collection is an important issue to wireless sensor networks. In this paper, we propose a novel approach of secure data collection for wireless sensor networks. We explore secret sharing and multipath routing to achieve secure data collection in wireless sensor network with compromised nodes. We present a novel tracing-feedback mechanism, which makes full use of the routing functionality of wireless sensor networks, to improve the quality of data collection. The major advantage of the approach is that the secure paths are constructed as a by-product of data collection. The process of secure routing causes little overhead to the sensor nodes in the network. Compared with existing works, the algorithms of the proposed approach are easy to implement and execute in resource-constrained wireless sensor networks. According to the result of a simulation experiment, the performance of the approach is better than the recent approaches with a similar purpose.

  8. A feedback-based secure path approach for wireless sensor network data collection.

    Science.gov (United States)

    Mao, Yuxin; Wei, Guiyi

    2010-01-01

    The unattended nature of wireless sensor networks makes them very vulnerable to malicious attacks. Therefore, how to preserve secure data collection is an important issue to wireless sensor networks. In this paper, we propose a novel approach of secure data collection for wireless sensor networks. We explore secret sharing and multipath routing to achieve secure data collection in wireless sensor network with compromised nodes. We present a novel tracing-feedback mechanism, which makes full use of the routing functionality of wireless sensor networks, to improve the quality of data collection. The major advantage of the approach is that the secure paths are constructed as a by-product of data collection. The process of secure routing causes little overhead to the sensor nodes in the network. Compared with existing works, the algorithms of the proposed approach are easy to implement and execute in resource-constrained wireless sensor networks. According to the result of a simulation experiment, the performance of the approach is better than the recent approaches with a similar purpose.

  9. Metabolic Network Discovery by Top-Down and Bottom-Up Approaches and Paths for Reconciliation

    International Nuclear Information System (INIS)

    Çakır, Tunahan; Khatibipour, Mohammad Jafar

    2014-01-01

    The primary focus in the network-centric analysis of cellular metabolism by systems biology approaches is to identify the active metabolic network for the condition of interest. Two major approaches are available for the discovery of the condition-specific metabolic networks. One approach starts from genome-scale metabolic networks, which cover all possible reactions known to occur in the related organism in a condition-independent manner, and applies methods such as the optimization-based Flux-Balance Analysis to elucidate the active network. The other approach starts from the condition-specific metabolome data, and processes the data with statistical or optimization-based methods to extract information content of the data such that the active network is inferred. These approaches, termed bottom-up and top-down, respectively, are currently employed independently. However, considering that both approaches have the same goal, they can both benefit from each other paving the way for the novel integrative analysis methods of metabolome data- and flux-analysis approaches in the post-genomic era. This study reviews the strengths of constraint-based analysis and network inference methods reported in the metabolic systems biology field; then elaborates on the potential paths to reconcile the two approaches to shed better light on how the metabolism functions.

  10. End-to-End Key Exchange through Disjoint Paths in P2P Networks

    Directory of Open Access Journals (Sweden)

    Daouda Ahmat

    2015-01-01

    Full Text Available Due to their inherent features, P2P networks have proven to be effective in the exchange of data between autonomous peers. Unfortunately, these networks are subject to various security threats that cannot be addressed readily since traditional security infrastructures, which are centralized, cannot be applied to them. Furthermore, communication reliability across the Internet is threatened by various attacks, including usurpation of identity, eavesdropping or traffic modification. Thus, in order to overcome these security issues and allow peers to securely exchange data, we propose a new key management scheme over P2P networks. Our approach introduces a new method that enables a secret key exchange through disjoint paths in the absence of a trusted central coordination point which would be required in traditional centralized security systems.

  11. Modelling cointegration and Granger causality network to detect long-term equilibrium and diffusion paths in the financial system.

    Science.gov (United States)

    Gao, Xiangyun; Huang, Shupei; Sun, Xiaoqi; Hao, Xiaoqing; An, Feng

    2018-03-01

    Microscopic factors are the basis of macroscopic phenomena. We proposed a network analysis paradigm to study the macroscopic financial system from a microstructure perspective. We built the cointegration network model and the Granger causality network model based on econometrics and complex network theory and chose stock price time series of the real estate industry and its upstream and downstream industries as empirical sample data. Then, we analysed the cointegration network for understanding the steady long-term equilibrium relationships and analysed the Granger causality network for identifying the diffusion paths of the potential risks in the system. The results showed that the influence from a few key stocks can spread conveniently in the system. The cointegration network and Granger causality network are helpful to detect the diffusion path between the industries. We can also identify and intervene in the transmission medium to curb risk diffusion.

  12. The Use of Digital Technology in Finding Multiple Paths to Solve and Extend an Equilateral Triangle Task

    Science.gov (United States)

    Santos-Trigo, Manuel; Reyes-Rodriguez, Aaron

    2016-01-01

    Mathematical tasks are crucial elements for teachers to orient, foster and assess students' processes to comprehend and develop mathematical knowledge. During the process of working and solving a task, searching for or discussing multiple solution paths becomes a powerful strategy for students to engage in mathematical thinking. A simple task that…

  13. Robustness Analysis of Real Network Topologies Under Multiple Failure Scenarios

    DEFF Research Database (Denmark)

    Manzano, M.; Marzo, J. L.; Calle, E.

    2012-01-01

    on topological characteristics. Recently approaches also consider the services supported by such networks. In this paper we carry out a robustness analysis of five real backbone telecommunication networks under defined multiple failure scenarios, taking into account the consequences of the loss of established......Nowadays the ubiquity of telecommunication networks, which underpin and fulfill key aspects of modern day living, is taken for granted. Significant large-scale failures have occurred in the last years affecting telecommunication networks. Traditionally, network robustness analysis has been focused...... connections. Results show which networks are more robust in response to a specific type of failure....

  14. UMDR: Multi-Path Routing Protocol for Underwater Ad Hoc Networks with Directional Antenna

    Science.gov (United States)

    Yang, Jianmin; Liu, Songzuo; Liu, Qipei; Qiao, Gang

    2018-01-01

    This paper presents a new routing scheme for underwater ad hoc networks based on directional antennas. Ad hoc networks with directional antennas have become a hot research topic because of space reuse may increase networks capacity. At present, researchers have applied traditional self-organizing routing protocols (such as DSR, AODV) [1] [2] on this type of networks, and the routing scheme is based on the shortest path metric. However, such routing schemes often suffer from long transmission delays and frequent link fragmentation along the intermediate nodes of the selected route. This is caused by a unique feature of directional transmission, often called as “deafness”. In this paper, we take a different approach to explore the advantages of space reuse through multipath routing. This paper introduces the validity of the conventional routing scheme in underwater ad hoc networks with directional antennas, and presents a special design of multipath routing algorithm for directional transmission. The experimental results show a significant performance improvement in throughput and latency.

  15. Demonstration of Single-Mode Multicore Fiber Transport Network with Crosstalk-Aware In-Service Optical Path Control

    DEFF Research Database (Denmark)

    Tanaka, Takafumi; Pulverer, Klaus; Häbel, Ulrich

    2017-01-01

    transport network testbed and demonstrate an XT-aware traffic engineering scenario. With the help of a software-defined network (SDN) controller, the modulation format and optical path route are adaptively changed based on the monitored XT values by using programmable devices such as a real-time transponder......-capacity transmission, because inter-core crosstalk (XT) could be the main limiting factor for MCF transmission. In a real MCF network, the inter-core XT in a particular core is likely to change continuously as the optical paths in the adjacent cores are dynamically assigned to match the dynamic nature of the data...

  16. Scan path entropy and Arrow plots: Capturing scanning behavior of multiple observers

    Directory of Open Access Journals (Sweden)

    Ignace T C Hooge

    2013-12-01

    Full Text Available Designers of visual communication material want their material to attract and retain attention. In marketing research, heat maps, dwell time, and time to AOI first hit are often used as evaluation parameters. Here we present two additional measures 1 scan path entropy to quantify gaze guidance and 2 the arrow plot to visualize the average scan path. Both are based on string representations of scan paths. The latter also incorporates transition matrices and time required for 50% of the observers to first hit AOIs (T50. The new measures were tested in an eye tracking study (48 observers, 39 advertisements. Scan path entropy is a sensible measure for gaze guidance and the new visualization method reveals aspects of the average scan path and gives a better indication in what order global scanning takes place.

  17. Space weather and HF propagation along different paths of the Russian chirp sounders network

    Science.gov (United States)

    Kurkin, V. I.; Litovkin, G. I.; Matyushonok, S. M.; Vertogradov, G. G.; Ivanov, V. A.; Poddelsky, I. N.; Rozanov, S. V.; Uryadov, V. P.

    This paper presents experimental data obtained on long paths (from 2200 km to 5700 km range) of Russian frequency modulated continues wave (chirp) sounders network for the period from 1998 to 2003. Four transmitters (near Magadan, Khabarovsk, Irkutsk, Norilsk) and four receivers (near Irkutsk, Yoshkar-Ola, Nizhny Novgorod, Rostov-on-Don) were combined into single network to investigate a influence of geomagnetic storms and substorms on HF propagation in Asian region of Russia. In this region the geographic latitudes are in greatest excess of magnetic latitudes. As a consequence, elements of the large-scale structure, such as the main ionospheric trough, and the zone of auroral ionization, are produced in the ionosphere at the background of a low electron ionization. Coordinated experiments were carried out using 3-day Solar-Geophysical activity forecast presented by NOAA Space Environment Center in Internet. Sounding operations were conducted in the frequency band 4 -- 30 MHz on a round-the-clock basis at 15-min intervals. Oblique-incidence sounding (OIS) ionograms were recorded during 5-7 days every season for some years. The comparison between experimental data and simulation of OIS ionograms using International Reference Ionospheric model (IRI-2001) allowed to estimate the forecast of HF propagation errors both under quiet condition and during geomagnetic disturbances. Strong deviations from median values of maximum observed frequencies on mid-latitude paths in daytime present a real challenge to ionospheric forecast. Subauroral and mid-latitude chirp-sounding paths run, respectively, near the northward and southward walls of the main ionospheric trough. This make sit possible to study the dynamics of the trough's boundaries under different geophysical conditions and assess the influence of ionization gradients and small-scale turbulence on HF signal characteristics. The signals off-great circle propagation were registered over a wide frequency range and for

  18. Using Self-management for Establishing Light Paths in Optical Networks: an Overview

    NARCIS (Netherlands)

    Fioreze, Tiago; Pras, Aiko

    2006-01-01

    Current optical networks are generally composed of multi-service optical switches, which enable forwarding of data at multiple levels. Huge flows at the packet-level (IP-level) may be moved to the optical-level, which is faster than the packet-level. Such move could be beneficial since congested IP

  19. Dual paths to individuals’ network based performance in intra-organizational networks

    DEFF Research Database (Denmark)

    Waldstrøm, Christian; Shah, Neha P.; Parker, Andrew

    Scholars have long been aware of the advantages to performance when colleagues share work information. We know less about the implications of multiplex ties such as when the sharing of work information is combined with that of nonwork information. We contrast social embeddedness theory with that ......Scholars have long been aware of the advantages to performance when colleagues share work information. We know less about the implications of multiplex ties such as when the sharing of work information is combined with that of nonwork information. We contrast social embeddedness theory...... a negative effect on performance. In addition, we find that the path to higher performance differs by the amount of time people have been in an organization. Those with low tenure outperformed colleagues with a moderate number of multiplex ties. Whereas, for their high tenure colleagues, multiplex ties had...... little effect....

  20. Path-Length and the Misperception of Speech: Insights from Network Science and Psycholinguistics

    Science.gov (United States)

    Vitevitch, Michael S.; Goldstein, Rutherford; Johnson, Elizabeth

    Using the analytical methods of network science we examined what could be retrieved from the lexicon when a spoken word is misperceived. To simulate misperceptions in the laboratory, we used a variant of the semantic associates task—the phonological associate task—in which participants heard an English word and responded with the first word that came to mind that sounded like the word they heard, to examine what people actually do retrieve from the lexicon when a spoken word is misperceived. Most responses were 1 link away from the stimulus word in the lexical network. Distant neighbors (words >1 link) were provided more often as responses when the stimulus word had low rather than high degree. Finally, even very distant neighbors tended to be connected to the stimulus word by a path in the lexical network. These findings have implications for the processing of spoken words, and highlight the valuable insights that can be obtained by combining the analytic tools of network science with the experimental tasks of psycholinguistics.

  1. Path planning in GPS-denied environments via collective intelligence of distributed sensor networks

    Science.gov (United States)

    Jha, Devesh K.; Chattopadhyay, Pritthi; Sarkar, Soumik; Ray, Asok

    2016-05-01

    This paper proposes a framework for reactive goal-directed navigation without global positioning facilities in unknown dynamic environments. A mobile sensor network is used for localising regions of interest for path planning of an autonomous mobile robot. The underlying theory is an extension of a generalised gossip algorithm that has been recently developed in a language-measure-theoretic setting. The algorithm has been used to propagate local decisions of target detection over a mobile sensor network and thus, it generates a belief map for the detected target over the network. In this setting, an autonomous mobile robot may communicate only with a few mobile sensing nodes in its own neighbourhood and localise itself relative to the communicating nodes with bounded uncertainties. The robot makes use of the knowledge based on the belief of the mobile sensors to generate a sequence of way-points, leading to a possible goal. The estimated way-points are used by a sampling-based motion planning algorithm to generate feasible trajectories for the robot. The proposed concept has been validated by numerical simulation on a mobile sensor network test-bed and a Dubin's car-like robot.

  2. A novel approach for multiple mobile objects path planning: Parametrization method and conflict resolution strategy

    International Nuclear Information System (INIS)

    Ma, Yong; Wang, Hongwei; Zamirian, M.

    2012-01-01

    We present a new approach containing two steps to determine conflict-free paths for mobile objects in two and three dimensions with moving obstacles. Firstly, the shortest path of each object is set as goal function which is subject to collision-avoidance criterion, path smoothness, and velocity and acceleration constraints. This problem is formulated as calculus of variation problem (CVP). Using parametrization method, CVP is converted to time-varying nonlinear programming problems (TNLPP) and then resolved. Secondly, move sequence of object is assigned by priority scheme; conflicts are resolved by multilevel conflict resolution strategy. Approach efficiency is confirmed by numerical examples. -- Highlights: ► Approach with parametrization method and conflict resolution strategy is proposed. ► Approach fits for multi-object paths planning in two and three dimensions. ► Single object path planning and multi-object conflict resolution are orderly used. ► Path of each object obtained with parameterization method in the first phase. ► Conflict-free paths gained by multi-object conflict resolution in the second phase.

  3. Efficient Cancer Detection Using Multiple Neural Networks.

    Science.gov (United States)

    Shell, John; Gregory, William D

    2017-01-01

    The inspection of live excised tissue specimens to ascertain malignancy is a challenging task in dermatopathology and generally in histopathology. We introduce a portable desktop prototype device that provides highly accurate neural network classification of malignant and benign tissue. The handheld device collects 47 impedance data samples from 1 Hz to 32 MHz via tetrapolar blackened platinum electrodes. The data analysis was implemented with six different backpropagation neural networks (BNN). A data set consisting of 180 malignant and 180 benign breast tissue data files in an approved IRB study at the Aurora Medical Center, Milwaukee, WI, USA, were utilized as a neural network input. The BNN structure consisted of a multi-tiered consensus approach autonomously selecting four of six neural networks to determine a malignant or benign classification. The BNN analysis was then compared with the histology results with consistent sensitivity of 100% and a specificity of 100%. This implementation successfully relied solely on statistical variation between the benign and malignant impedance data and intricate neural network configuration. This device and BNN implementation provides a novel approach that could be a valuable tool to augment current medical practice assessment of the health of breast, squamous, and basal cell carcinoma and other excised tissue without requisite tissue specimen expertise. It has the potential to provide clinical management personnel with a fast non-invasive accurate assessment of biopsied or sectioned excised tissue in various clinical settings.

  4. Optical Multiple Access Network (OMAN) for advanced processing satellite applications

    Science.gov (United States)

    Mendez, Antonio J.; Gagliardi, Robert M.; Park, Eugene; Ivancic, William D.; Sherman, Bradley D.

    1991-01-01

    An OMAN breadboard for exploring advanced processing satellite circuit switch applications is introduced. Network architecture, hardware trade offs, and multiple user interference issues are presented. The breadboard test set up and experimental results are discussed.

  5. Multiple leakage localization and leak size estimation in water networks

    NARCIS (Netherlands)

    Abbasi, N.; Habibi, H.; Hurkens, C.A.J.; Klabbers, M.D.; Tijsseling, A.S.; Eijndhoven, van S.J.L.

    2012-01-01

    Water distribution networks experience considerable losses due to leakage, often at multiple locations simultaneously. Leakage detection and localization based on sensor placement and online pressure monitoring could be fast and economical. Using the difference between estimated and measured

  6. Reliability and Concurrent Validity of the Narrow Path Walking Test in Persons With Multiple Sclerosis.

    Science.gov (United States)

    Rosenblum, Uri; Melzer, Itshak

    2017-01-01

    About 90% of people with multiple sclerosis (PwMS) have gait instability and 50% fall. Reliable and clinically feasible methods of gait instability assessment are needed. The study investigated the reliability and validity of the Narrow Path Walking Test (NPWT) under single-task (ST) and dual-task (DT) conditions for PwMS. Thirty PwMS performed the NPWT on 2 different occasions, a week apart. Number of Steps, Trial Time, Trial Velocity, Step Length, Number of Step Errors, Number of Cognitive Task Errors, and Number of Balance Losses were measured. Intraclass correlation coefficients (ICC2,1) were calculated from the average values of NPWT parameters. Absolute reliability was quantified from standard error of measurement (SEM) and smallest real difference (SRD). Concurrent validity of NPWT with Functional Reach Test, Four Square Step Test (FSST), 12-item Multiple Sclerosis Walking Scale (MSWS-12), and 2 Minute Walking Test (2MWT) was determined using partial correlations. Intraclass correlation coefficients (ICCs) for most NPWT parameters during ST and DT ranged from 0.46-0.94 and 0.55-0.95, respectively. The highest relative reliability was found for Number of Step Errors (ICC = 0.94 and 0.93, for ST and DT, respectively) and Trial Velocity (ICC = 0.83 and 0.86, for ST and DT, respectively). Absolute reliability was high for Number of Step Errors in ST (SEM % = 19.53%) and DT (SEM % = 18.14%) and low for Trial Velocity in ST (SEM % = 6.88%) and DT (SEM % = 7.29%). Significant correlations for Number of Step Errors and Trial Velocity were found with FSST, MSWS-12, and 2MWT. In persons with PwMS performing the NPWT, Number of Step Errors and Trial Velocity were highly reliable parameters. Based on correlations with other measures of gait instability, Number of Step Errors was the most valid parameter of dynamic balance under the conditions of our test.Video Abstract available for more insights from the authors (see Supplemental Digital Content 1, available at: http

  7. Radio Access Sharing Strategies for Multiple Operators in Cellular Networks

    DEFF Research Database (Denmark)

    Popovska Avramova, Andrijana; Iversen, Villy Bæk

    2015-01-01

    deployments (required for coverage enhancement), increased base station utilization, and reduced overall power consumption. Today, network sharing in the radio access part is passive and limited to cell sites. With the introduction of Cloud Radio Access Network and Software Defined Networking adoption...... to the radio access network, the possibility for sharing baseband processing and radio spectrum becomes an important aspect of network sharing. This paper investigates strategies for active sharing of radio access among multiple operators, and analyses the individual benefits depending on the sharing degree...

  8. Rare events via multiple reaction channels sampled by path replica exchange

    NARCIS (Netherlands)

    Bolhuis, P.G.

    2008-01-01

    Transition path sampling (TPS) was developed for studying activated processes in complex systems with unknown reaction coordinate. Transition interface sampling (TIS) allows efficient evaluation of the rate constants. However, when the transition can occur via more than one reaction channel

  9. Sexual networks and social capital: multiple and concurrent sexual ...

    African Journals Online (AJOL)

    Multiple and concurrent sexual partnerships (MCP) are prevalent in southern Africa and have been identified as a primary cause of high HIV prevalence in this region. Sexual liaisons with multiple partners serve to increase the size and diversity of an individual's sexual — and social — network and therefore to increase their ...

  10. A multilevel path analysis of contact frequency between social network members

    Science.gov (United States)

    van den Berg, Pauline; Arentze, Theo; Timmermans, Harry

    2012-04-01

    Recently, there has been an increasing interest in the role of social networks in spatial-choice and travel behavior. It has been acknowledged that social activities and the travel for these activities can emerge from individuals' social networks and that social activities are responsible for an important portion of travel demand. The influence of information and communication technologies (ICT's) is also important in this respect. The purpose of the paper is to examine the effects of characteristics of egos and ego-alter relationships on the frequency of social interaction by different communication modes, using multilevel path analysis. The analyses are based on social network data collected in 2008 in the Eindhoven region in the Netherlands among 116 respondents. The results indicate a complementary relationship between contact frequencies by different modes. The contact frequencies of the different modes, especially face-to-face and telephone, can also be largely explained by the ego's personal characteristics and the type of relationship and the distance between ego and alter.

  11. Collectivism culture, HIV stigma and social network support in Anhui, China: a path analytic model.

    Science.gov (United States)

    Zang, Chunpeng; Guida, Jennifer; Sun, Yehuan; Liu, Hongjie

    2014-08-01

    HIV stigma is rooted in culture and, therefore, it is essential to investigate it within the context of culture. The objective of this study was to examine the interrelationships among individualism-collectivism, HIV stigma, and social network support. A social network study was conducted among 118 people living with HIVAIDS in China, who were infected by commercial plasma donation, a nonstigmatized behavior. The Individualism-Collectivism Interpersonal Assessment Inventory (ICIAI) was used to measure cultural norms and values in the context of three social groups, family members, friends, and neighbors. Path analyses revealed (1) a higher level of family ICIAI was significantly associated with a higher level of HIV self-stigma (β=0.32); (2) a higher level of friend ICIAI was associated with a lower level of self-stigma (β=-035); (3) neighbor ICIAI was associated with public stigma (β=-0.61); (4) self-stigman was associated with social support from neighbors (β=-0.27); and (5) public stigma was associated with social support from neighbors (β=-0.24). This study documents that HIV stigma may mediate the relationship between collectivist culture and social network support, providing an empirical basis for interventions to include aspects of culture into HIV intervention strategies.

  12. Innovation in Multiple Networks and Networks of Networks: The Case of the Fruit Sector in Emilia‐Romagna

    Directory of Open Access Journals (Sweden)

    Davide Viaggi

    2013-02-01

    Full Text Available In the paper we examine the issue of food systems in which farms participate in multiple networks that, for their part, tend also to be members of networks of networks. The issue is addressed through a descriptive analysis of the fruit sector in Emilia‐Romagna (Italy. The farms in the area tend to join a different network for each product/product type. Innovation networks are embedded in commercialization or input provider networks, but separate (parallel networks also exist, particularly for basic research activities. Networks of networks are largely a product of the cooperative system. The paper concludes by emphasising the need for further research in multiple networking strategies and the connection betweencommercialisation networks and innovation.

  13. A Method of Forming the Optimal Set of Disjoint Path in Computer Networks

    Directory of Open Access Journals (Sweden)

    As'ad Mahmoud As'ad ALNASER

    2017-04-01

    Full Text Available This work provides a short analysis of algorithms of multipath routing. The modified algorithm of formation of the maximum set of not crossed paths taking into account their metrics is offered. Optimization of paths is carried out due to their reconfiguration with adjacent deadlock path. Reconfigurations are realized within the subgraphs including only peaks of the main and an adjacent deadlock path. It allows to reduce the field of formation of an optimum path and time complexity of its formation.

  14. Infinite Multiple Membership Relational Modeling for Complex Networks

    DEFF Research Database (Denmark)

    Mørup, Morten; Schmidt, Mikkel Nørgaard; Hansen, Lars Kai

    Learning latent structure in complex networks has become an important problem fueled by many types of networked data originating from practically all fields of science. In this paper, we propose a new non-parametric Bayesian multiplemembership latent feature model for networks. Contrary to existing...... multiplemembership models that scale quadratically in the number of vertices the proposedmodel scales linearly in the number of links admittingmultiple-membership analysis in large scale networks. We demonstrate a connection between the single membership relational model and multiple membership models and show...

  15. Multiplicative Attribute Graph Model of Real-World Networks

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Myunghwan [Stanford Univ., CA (United States); Leskovec, Jure [Stanford Univ., CA (United States)

    2010-10-20

    Large scale real-world network data, such as social networks, Internet andWeb graphs, is ubiquitous in a variety of scientific domains. The study of such social and information networks commonly finds patterns and explain their emergence through tractable models. In most networks, especially in social networks, nodes also have a rich set of attributes (e.g., age, gender) associatedwith them. However, most of the existing network models focus only on modeling the network structure while ignoring the features of nodes in the network. Here we present a class of network models that we refer to as the Multiplicative Attribute Graphs (MAG), which naturally captures the interactions between the network structure and node attributes. We consider a model where each node has a vector of categorical features associated with it. The probability of an edge between a pair of nodes then depends on the product of individual attributeattribute similarities. The model yields itself to mathematical analysis as well as fit to real data. We derive thresholds for the connectivity, the emergence of the giant connected component, and show that the model gives rise to graphs with a constant diameter. Moreover, we analyze the degree distribution to show that the model can produce networks with either lognormal or power-law degree distribution depending on certain conditions.

  16. Predicting Protein Function via Semantic Integration of Multiple Networks.

    Science.gov (United States)

    Yu, Guoxian; Fu, Guangyuan; Wang, Jun; Zhu, Hailong

    2016-01-01

    Determining the biological functions of proteins is one of the key challenges in the post-genomic era. The rapidly accumulated large volumes of proteomic and genomic data drives to develop computational models for automatically predicting protein function in large scale. Recent approaches focus on integrating multiple heterogeneous data sources and they often get better results than methods that use single data source alone. In this paper, we investigate how to integrate multiple biological data sources with the biological knowledge, i.e., Gene Ontology (GO), for protein function prediction. We propose a method, called SimNet, to Semantically integrate multiple functional association Networks derived from heterogenous data sources. SimNet firstly utilizes GO annotations of proteins to capture the semantic similarity between proteins and introduces a semantic kernel based on the similarity. Next, SimNet constructs a composite network, obtained as a weighted summation of individual networks, and aligns the network with the kernel to get the weights assigned to individual networks. Then, it applies a network-based classifier on the composite network to predict protein function. Experiment results on heterogenous proteomic data sources of Yeast, Human, Mouse, and Fly show that, SimNet not only achieves better (or comparable) results than other related competitive approaches, but also takes much less time. The Matlab codes of SimNet are available at https://sites.google.com/site/guoxian85/simnet.

  17. Multiple k Nearest Neighbor Query Processing in Spatial Network Databases

    DEFF Research Database (Denmark)

    Xuegang, Huang; Jensen, Christian Søndergaard; Saltenis, Simonas

    2006-01-01

    This paper concerns the efficient processing of multiple k nearest neighbor queries in a road-network setting. The assumed setting covers a range of scenarios such as the one where a large population of mobile service users that are constrained to a road network issue nearest-neighbor queries...... for points of interest that are accessible via the road network. Given multiple k nearest neighbor queries, the paper proposes progressive techniques that selectively cache query results in main memory and subsequently reuse these for query processing. The paper initially proposes techniques for the case...... where an upper bound on k is known a priori and then extends the techniques to the case where this is not so. Based on empirical studies with real-world data, the paper offers insight into the circumstances under which the different proposed techniques can be used with advantage for multiple k nearest...

  18. Multiple-predators-based capture process on complex networks

    International Nuclear Information System (INIS)

    Sharafat, Rajput Ramiz; Pu Cunlai; Li Jie; Chen Rongbin; Xu Zhongqi

    2017-01-01

    The predator/prey (capture) problem is a prototype of many network-related applications. We study the capture process on complex networks by considering multiple predators from multiple sources. In our model, some lions start from multiple sources simultaneously to capture the lamb by biased random walks, which are controlled with a free parameter α . We derive the distribution of the lamb’s lifetime and the expected lifetime 〈 T 〉. Through simulation, we find that the expected lifetime drops substantially with the increasing number of lions. Moreover, we study how the underlying topological structure affects the capture process, and obtain that locating on small-degree nodes is better than on large-degree nodes to prolong the lifetime of the lamb. The dense or homogeneous network structures are against the survival of the lamb. We also discuss how to improve the capture efficiency in our model. (paper)

  19. Mathematical modeling of a radio-frequency path for IEEE 802.11ah based wireless sensor networks

    Science.gov (United States)

    Tyshchenko, Igor; Cherepanov, Alexander; Dmitrii, Vakhnin; Popova, Mariia

    2017-09-01

    This article discusses the process of creating the mathematical model of a radio-frequency path for an IEEE 802.11ah based wireless sensor networks using M atLab Simulink CAD tools. In addition, it describes occurring perturbing effects and determining the presence of a useful signal in the received mixture.

  20. AC Power Local Network with Multiple Power Routers

    Directory of Open Access Journals (Sweden)

    Ryo Takahashi

    2013-12-01

    Full Text Available Controlling power flow and achieving appropriate matching between power sources and loads according to the quality of energy is expected to be one of the approaches to reduce wasted energy consumption. A power router, proposed recently, has the capability of realizing circuit switching in a power distribution network. This study focuses on the feasibility of an AC power routing network system composed of multiple power routers. To evaluate the feasibility, we experimentally confirm the circuit switching operation of the parallel and series configurations of the power routers, so that the network system can be designed by the combination of parallel and series configurations.

  1. A Novel Randomized Search Technique for Multiple Mobile Robot Paths Planning In Repetitive Dynamic Environment

    Directory of Open Access Journals (Sweden)

    Vahid Behravesh

    2012-08-01

    Full Text Available Presented article is studying the issue of path navigating for numerous robots. Our presented approach is based on both priority and the robust method for path finding in repetitive dynamic. Presented model can be generally implementable and useable: We do not assume any restriction regarding the quantity of levels of freedom for robots, and robots of diverse kinds can be applied at the same time. We proposed a random method and hill-climbing technique in the area based on precedence plans, which is used to determine a solution to a given trajectory planning problem and to make less the extent of total track. Our method plans trajectories for particular robots in the setting-time scope. Therefore, in order to specifying the interval of constant objects similar to other robots and the extent of the tracks which is traversed. For measuring the hazard for robots to conflict with each other it applied a method based on probability of the movements of robots. This algorithm applied to real robots with successful results. The proposed method performed and judged on both real robots and in simulation. We performed sequence of100tests with 8 robots for comparing with coordination method and current performances are effective. However, maximizing the performance is still possible. These performances estimations performed on Windows operating system and 3GHz Intel Pentium IV with and compiles with GCC 3.4. We used our PCGA robot for all experiments.  For a large environment of 19×15m2where we accomplished 40tests, our model is competent to plan high-quality paths in a severely short time (less than a second. Moreover, this article utilized lookup tables to keep expenses the formerly navigated robots made, increasing the number of robots don’t expand computation time.

  2. Using Multiple Methods to teach ASTR 101 students the Path of the Sun and Shadows

    Science.gov (United States)

    D'Cruz, Noella L.

    2015-01-01

    It seems surprising that non-science major introductory astronomy students find the daily path of the Sun and shadows created by the Sun challenging to learn even though both can be easily observed (provided students do not look directly at the Sun). In order for our students to master the relevant concepts, we have usually used lecture, a lecture tutorial (from Prather, et al.) followed by think-pair-share questions, a planetarium presentation and an animation from the Nebraska Astronomy Applet Project to teach these topics. We cover these topics in a lecture-only, one semester introductory astronomy course at Joliet Junior College. Feedback from our Spring 2014 students indicated that the planetarium presentation was the most helpful in learning the path of the Sun while none of the four teaching methods was helpful when learning about shadows cast by the Sun. Our students did not find the lecture tutorial to be much help even though such tutorials have been proven to promote deep conceptual change. In Fall 2014, we continued to use these four methods, but we modified how we teach both topics so our students could gain more from the tutorial. We hoped our modifications would cause students to have a better overall grasp of the concepts. After our regular lecture, we gave a shorter than usual planetarium presentation on the path of the Sun and we asked students to work through a shadow activity from Project Astro materials. Then students completed the lecture tutorial and some think-pair-share questions. After this, we asked students to predict the Sun's path on certain days of the year and we used the planetarium projector to show them how well their predictions matched up. We ended our coverage of these topics by asking students a few more think-pair-share questions. In our poster, we will present our approach to teaching these topics in Fall 2014, how our Fall 2014 students feel about our teaching strategies and how they fared on related test questions.

  3. Optically transparent multiple access networks employing incoherent spectral codes

    NARCIS (Netherlands)

    Huiszoon, B.

    2008-01-01

    This Ph.D. thesis is divided into 7 chapters to provide the reader an overview of the main results achieved in di®erent sub-topics of the study towards optically transparent multiple access networks employing incoherent spectral codes taking into account wireless transmission aspects. The work

  4. Optimal path planning for single and multiple aircraft using a reduced order formulation

    Science.gov (United States)

    Twigg, Shannon S.

    High-flying unmanned reconnaissance and surveillance systems are now being used extensively in the United States military. Current development programs are producing demonstrations of next-generation unmanned flight systems that are designed to perform combat missions. Their use in first-strike combat operations will dictate operations in densely cluttered environments that include unknown obstacles and threats, and will require the use of terrain for masking. The demand for autonomy of operations in such environments dictates the need for advanced trajectory optimization capabilities. In addition, the ability to coordinate the movements of more than one aircraft in the same area is an emerging challenge. This thesis examines using an analytical reduced order formulation for trajectory generation for minimum time and terrain masking cases. First, pseudo-3D constant velocity equations of motion are used for path planning for a single vehicle. In addition, the inclusion of winds, moving targets and moving threats is considered. Then, this formulation is increased to using 3D equations of motion, both with a constant velocity and with a simplified varying velocity model. Next, the constant velocity equations of motion are expanded to include the simultaneous path planning of an unspecified number of vehicles, for both aircraft avoidance situations and formation flight cases.

  5. Perfect quantum multiple-unicast network coding protocol

    Science.gov (United States)

    Li, Dan-Dan; Gao, Fei; Qin, Su-Juan; Wen, Qiao-Yan

    2018-01-01

    In order to realize long-distance and large-scale quantum communication, it is natural to utilize quantum repeater. For a general quantum multiple-unicast network, it is still puzzling how to complete communication tasks perfectly with less resources such as registers. In this paper, we solve this problem. By applying quantum repeaters to multiple-unicast communication problem, we give encoding-decoding schemes for source nodes, internal ones and target ones, respectively. Source-target nodes share EPR pairs by using our encoding-decoding schemes over quantum multiple-unicast network. Furthermore, quantum communication can be accomplished perfectly via teleportation. Compared with existed schemes, our schemes can reduce resource consumption and realize long-distance transmission of quantum information.

  6. Multiple paths of electron flow to current in microbial electrolysis cells fed with low and high concentrations of propionate

    KAUST Repository

    Rao, Hari Ananda

    2016-03-03

    Microbial electrolysis cells (MECs) provide a viable approach for bioenergy generation from fermentable substrates such as propionate. However, the paths of electron flow during propionate oxidation in the anode of MECs are unknown. Here, the paths of electron flow involved in propionate oxidation in the anode of two-chambered MECs were examined at low (4.5 mM) and high (36 mM) propionate concentrations. Electron mass balances and microbial community analysis revealed that multiple paths of electron flow (via acetate/H2 or acetate/formate) to current could occur simultaneously during propionate oxidation regardless of the concentration tested. Current (57–96 %) was the largest electron sink and methane (0–2.3 %) production was relatively unimportant at both concentrations based on electron balances. At a low propionate concentration, reactors supplemented with 2-bromoethanesulfonate had slightly higher coulombic efficiencies than reactors lacking this methanogenesis inhibitor. However, an opposite trend was observed at high propionate concentration, where reactors supplemented with 2-bromoethanesulfonate had a lower coulombic efficiency and there was a greater percentage of electron loss (23.5 %) to undefined sinks compared to reactors without 2-bromoethanesulfonate (11.2 %). Propionate removal efficiencies were 98 % (low propionate concentration) and 78 % (high propionate concentration). Analysis of 16S rRNA gene pyrosequencing revealed the dominance of sequences most similar to Geobacter sulfurreducens PCA and G. sulfurreducens subsp. ethanolicus. Collectively, these results provide new insights on the paths of electron flow during propionate oxidation in the anode of MECs fed with low and high propionate concentrations.

  7. Whitelists Based Multiple Filtering Techniques in SCADA Sensor Networks

    Directory of Open Access Journals (Sweden)

    DongHo Kang

    2014-01-01

    Full Text Available Internet of Things (IoT consists of several tiny devices connected together to form a collaborative computing environment. Recently IoT technologies begin to merge with supervisory control and data acquisition (SCADA sensor networks to more efficiently gather and analyze real-time data from sensors in industrial environments. But SCADA sensor networks are becoming more and more vulnerable to cyber-attacks due to increased connectivity. To safely adopt IoT technologies in the SCADA environments, it is important to improve the security of SCADA sensor networks. In this paper we propose a multiple filtering technique based on whitelists to detect illegitimate packets. Our proposed system detects the traffic of network and application protocol attacks with a set of whitelists collected from normal traffic.

  8. Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

    Science.gov (United States)

    Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

    2016-07-14

    Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

  9. Tools and Models for Integrating Multiple Cellular Networks

    Energy Technology Data Exchange (ETDEWEB)

    Gerstein, Mark [Yale Univ., New Haven, CT (United States). Gerstein Lab.

    2015-11-06

    In this grant, we have systematically investigated the integrated networks, which are responsible for the coordination of activity between metabolic pathways in prokaryotes. We have developed several computational tools to analyze the topology of the integrated networks consisting of metabolic, regulatory, and physical interaction networks. The tools are all open-source, and they are available to download from Github, and can be incorporated in the Knowledgebase. Here, we summarize our work as follow. Understanding the topology of the integrated networks is the first step toward understanding its dynamics and evolution. For Aim 1 of this grant, we have developed a novel algorithm to determine and measure the hierarchical structure of transcriptional regulatory networks [1]. The hierarchy captures the direction of information flow in the network. The algorithm is generally applicable to regulatory networks in prokaryotes, yeast and higher organisms. Integrated datasets are extremely beneficial in understanding the biology of a system in a compact manner due to the conflation of multiple layers of information. Therefore for Aim 2 of this grant, we have developed several tools and carried out analysis for integrating system-wide genomic information. To make use of the structural data, we have developed DynaSIN for protein-protein interactions networks with various dynamical interfaces [2]. We then examined the association between network topology with phenotypic effects such as gene essentiality. In particular, we have organized E. coli and S. cerevisiae transcriptional regulatory networks into hierarchies. We then correlated gene phenotypic effects by tinkering with different layers to elucidate which layers were more tolerant to perturbations [3]. In the context of evolution, we also developed a workflow to guide the comparison between different types of biological networks across various species using the concept of rewiring [4], and Furthermore, we have developed

  10. A Path Loss Model for Non-Line-of-Sight Ultraviolet Multiple Scattering Channels

    Directory of Open Access Journals (Sweden)

    Sadler BrianM

    2010-01-01

    Full Text Available An ultraviolet (UV signal transmission undergoes rich scattering and strong absorption by atmospheric particulates. We develop a path loss model for a Non-Line-of-Sight (NLOS link. The model is built upon probability theory governing random migration of photons in free space, undergoing scattering, in terms of angular direction and distance. The model analytically captures the contributions of different scattering orders. Thus it relaxes the assumptions of single scattering theory and provides more realistic results. This allows us to assess the importance of high-order scattering, such as in a thick atmosphere environment, where short range NLOS UV communication is enhanced by hazy or foggy weather. By simulation, it is shown that the model coincides with a previously developed Monte Carlo model. Additional numerical examples are presented to demonstrate the effects of link geometry and atmospheric conditions. The results indicate the inherent tradeoffs in beamwidth, pointing angles, range, absorption, and scattering and so are valuable for NLOS communication system design.

  11. Computing all hybridization networks for multiple binary phylogenetic input trees.

    Science.gov (United States)

    Albrecht, Benjamin

    2015-07-30

    The computation of phylogenetic trees on the same set of species that are based on different orthologous genes can lead to incongruent trees. One possible explanation for this behavior are interspecific hybridization events recombining genes of different species. An important approach to analyze such events is the computation of hybridization networks. This work presents the first algorithm computing the hybridization number as well as a set of representative hybridization networks for multiple binary phylogenetic input trees on the same set of taxa. To improve its practical runtime, we show how this algorithm can be parallelized. Moreover, we demonstrate the efficiency of the software Hybroscale, containing an implementation of our algorithm, by comparing it to PIRNv2.0, which is so far the best available software computing the exact hybridization number for multiple binary phylogenetic trees on the same set of taxa. The algorithm is part of the software Hybroscale, which was developed specifically for the investigation of hybridization networks including their computation and visualization. Hybroscale is freely available(1) and runs on all three major operating systems. Our simulation study indicates that our approach is on average 100 times faster than PIRNv2.0. Moreover, we show how Hybroscale improves the interpretation of the reported hybridization networks by adding certain features to its graphical representation.

  12. Structural networks involved in attention and executive functions in multiple sclerosis

    Directory of Open Access Journals (Sweden)

    Sara Llufriu

    2017-01-01

    Full Text Available Attention and executive deficits are disabling symptoms in multiple sclerosis (MS that have been related to disconnection mechanisms. We aimed to investigate changes in structural connectivity in MS and their association with attention and executive performance applying an improved framework that combines high order probabilistic tractography and anatomical exclusion criteria postprocessing. We compared graph theory metrics of structural networks and fractional anisotropy (FA of white matter (WM connections or edges between 72 MS subjects and 38 healthy volunteers (HV and assessed their correlation with cognition. Patients displayed decreased network transitivity, global efficiency and increased path length compared with HV (p < 0.05, corrected. Also, nodal strength was decreased in 26 of 84 gray matter regions. The distribution of nodes with stronger connections or hubs of the network was similar among groups except for the right pallidum and left insula, which became hubs in patients. MS subjects presented reduced edge FA widespread in the network, while FA was increased in 24 connections (p < 0.05, corrected. Decreased integrity of frontoparietal networks, deep gray nuclei and insula correlated with worse attention and executive performance (r between 0.38 and 0.55, p < 0.05, corrected. Contrarily, higher strength in the right transverse temporal cortex and increased FA of several connections (mainly from cingulate, frontal and occipital cortices were associated with worse functioning (r between −0.40 and −0.47, p < 0.05 corrected. In conclusion, structural brain connectivity is disturbed in MS due to widespread impairment of WM connections and gray matter structures. The increased edge connectivity suggests the presence of reorganization mechanisms at the structural level. Importantly, attention and executive performance relates to frontoparietal networks, deep gray nuclei and insula. These results support the relevance of

  13. Association between resting-state brain network topological organization and creative ability: Evidence from a multiple linear regression model.

    Science.gov (United States)

    Jiao, Bingqing; Zhang, Delong; Liang, Aiying; Liang, Bishan; Wang, Zengjian; Li, Junchao; Cai, Yuxuan; Gao, Mengxia; Gao, Zhenni; Chang, Song; Huang, Ruiwang; Liu, Ming

    2017-10-01

    Previous studies have indicated a tight linkage between resting-state functional connectivity of the human brain and creative ability. This study aimed to further investigate the association between the topological organization of resting-state brain networks and creativity. Therefore, we acquired resting-state fMRI data from 22 high-creativity participants and 22 low-creativity participants (as determined by their Torrance Tests of Creative Thinking scores). We then constructed functional brain networks for each participant and assessed group differences in network topological properties before exploring the relationships between respective network topological properties and creative ability. We identified an optimized organization of intrinsic brain networks in both groups. However, compared with low-creativity participants, high-creativity participants exhibited increased global efficiency and substantially decreased path length, suggesting increased efficiency of information transmission across brain networks in creative individuals. Using a multiple linear regression model, we further demonstrated that regional functional integration properties (i.e., the betweenness centrality and global efficiency) of brain networks, particularly the default mode network (DMN) and sensorimotor network (SMN), significantly predicted the individual differences in creative ability. Furthermore, the associations between network regional properties and creative performance were creativity-level dependent, where the difference in the resource control component may be important in explaining individual difference in creative performance. These findings provide novel insights into the neural substrate of creativity and may facilitate objective identification of creative ability. Copyright © 2017 Elsevier B.V. All rights reserved.

  14. Cooperative and Adaptive Network Coding for Gradient Based Routing in Wireless Sensor Networks with Multiple Sinks

    Directory of Open Access Journals (Sweden)

    M. E. Migabo

    2017-01-01

    Full Text Available Despite its low computational cost, the Gradient Based Routing (GBR broadcast of interest messages in Wireless Sensor Networks (WSNs causes significant packets duplications and unnecessary packets transmissions. This results in energy wastage, traffic load imbalance, high network traffic, and low throughput. Thanks to the emergence of fast and powerful processors, the development of efficient network coding strategies is expected to enable efficient packets aggregations and reduce packets retransmissions. For multiple sinks WSNs, the challenge consists of efficiently selecting a suitable network coding scheme. This article proposes a Cooperative and Adaptive Network Coding for GBR (CoAdNC-GBR technique which considers the network density as dynamically defined by the average number of neighbouring nodes, to efficiently aggregate interest messages. The aggregation is performed by means of linear combinations of random coefficients of a finite Galois Field of variable size GF(2S at each node and the decoding is performed by means of Gaussian elimination. The obtained results reveal that, by exploiting the cooperation of the multiple sinks, the CoAdNC-GBR not only improves the transmission reliability of links and lowers the number of transmissions and the propagation latency, but also enhances the energy efficiency of the network when compared to the GBR-network coding (GBR-NC techniques.

  15. 3D Filament Network Segmentation with Multiple Active Contours

    Science.gov (United States)

    Xu, Ting; Vavylonis, Dimitrios; Huang, Xiaolei

    2014-03-01

    Fluorescence microscopy is frequently used to study two and three dimensional network structures formed by cytoskeletal polymer fibers such as actin filaments and microtubules. While these cytoskeletal structures are often dilute enough to allow imaging of individual filaments or bundles of them, quantitative analysis of these images is challenging. To facilitate quantitative, reproducible and objective analysis of the image data, we developed a semi-automated method to extract actin networks and retrieve their topology in 3D. Our method uses multiple Stretching Open Active Contours (SOACs) that are automatically initialized at image intensity ridges and then evolve along the centerlines of filaments in the network. SOACs can merge, stop at junctions, and reconfigure with others to allow smooth crossing at junctions of filaments. The proposed approach is generally applicable to images of curvilinear networks with low SNR. We demonstrate its potential by extracting the centerlines of synthetic meshwork images, actin networks in 2D TIRF Microscopy images, and 3D actin cable meshworks of live fission yeast cells imaged by spinning disk confocal microscopy.

  16. Motor network efficiency and disability in multiple sclerosis

    Science.gov (United States)

    Yaldizli, Özgür; Sethi, Varun; Muhlert, Nils; Liu, Zheng; Samson, Rebecca S.; Altmann, Daniel R.; Ron, Maria A.; Wheeler-Kingshott, Claudia A.M.; Miller, David H.; Chard, Declan T.

    2015-01-01

    Objective: To develop a composite MRI-based measure of motor network integrity, and determine if it explains disability better than conventional MRI measures in patients with multiple sclerosis (MS). Methods: Tract density imaging and constrained spherical deconvolution tractography were used to identify motor network connections in 22 controls. Fractional anisotropy (FA), magnetization transfer ratio (MTR), and normalized volume were computed in each tract in 71 people with relapse onset MS. Principal component analysis was used to distill the FA, MTR, and tract volume data into a single metric for each tract, which in turn was used to compute a composite measure of motor network efficiency (composite NE) using graph theory. Associations were investigated between the Expanded Disability Status Scale (EDSS) and the following MRI measures: composite motor NE, NE calculated using FA alone, FA averaged in the combined motor network tracts, brain T2 lesion volume, brain parenchymal fraction, normal-appearing white matter MTR, and cervical cord cross-sectional area. Results: In univariable analysis, composite motor NE explained 58% of the variation in EDSS in the whole MS group, more than twice that of the other MRI measures investigated. In a multivariable regression model, only composite NE and disease duration were independently associated with EDSS. Conclusions: A composite MRI measure of motor NE was able to predict disability substantially better than conventional non-network-based MRI measures. PMID:26320199

  17. On using multiple routing metrics with destination sequenced distance vector protocol for MultiHop wireless ad hoc networks

    Science.gov (United States)

    Mehic, M.; Fazio, P.; Voznak, M.; Partila, P.; Komosny, D.; Tovarek, J.; Chmelikova, Z.

    2016-05-01

    A mobile ad hoc network is a collection of mobile nodes which communicate without a fixed backbone or centralized infrastructure. Due to the frequent mobility of nodes, routes connecting two distant nodes may change. Therefore, it is not possible to establish a priori fixed paths for message delivery through the network. Because of its importance, routing is the most studied problem in mobile ad hoc networks. In addition, if the Quality of Service (QoS) is demanded, one must guarantee the QoS not only over a single hop but over an entire wireless multi-hop path which may not be a trivial task. In turns, this requires the propagation of QoS information within the network. The key to the support of QoS reporting is QoS routing, which provides path QoS information at each source. To support QoS for real-time traffic one needs to know not only minimum delay on the path to the destination but also the bandwidth available on it. Therefore, throughput, end-to-end delay, and routing overhead are traditional performance metrics used to evaluate the performance of routing protocol. To obtain additional information about the link, most of quality-link metrics are based on calculation of the lost probabilities of links by broadcasting probe packets. In this paper, we address the problem of including multiple routing metrics in existing routing packets that are broadcasted through the network. We evaluate the efficiency of such approach with modified version of DSDV routing protocols in ns-3 simulator.

  18. Downlink Non-Orthogonal Multiple Access (NOMA) in Poisson Networks

    KAUST Repository

    Ali, Konpal S.

    2018-03-21

    A network model is considered where Poisson distributed base stations transmit to $N$ power-domain non-orthogonal multiple access (NOMA) users (UEs) each that employ successive interference cancellation (SIC) for decoding. We propose three models for the clustering of NOMA UEs and consider two different ordering techniques for the NOMA UEs: mean signal power-based and instantaneous signal-to-intercell-interference-and-noise-ratio-based. For each technique, we present a signal-to-interference-and-noise ratio analysis for the coverage of the typical UE. We plot the rate region for the two-user case and show that neither ordering technique is consistently superior to the other. We propose two efficient algorithms for finding a feasible resource allocation that maximize the cell sum rate $\\\\mathcal{R}_{\\ m tot}$, for general $N$, constrained to: 1) a minimum rate $\\\\mathcal{T}$ for each UE, 2) identical rates for all UEs. We show the existence of: 1) an optimum $N$ that maximizes the constrained $\\\\mathcal{R}_{\\ m tot}$ given a set of network parameters, 2) a critical SIC level necessary for NOMA to outperform orthogonal multiple access. The results highlight the importance in choosing the network parameters $N$, the constraints, and the ordering technique to balance the $\\\\mathcal{R}_{\\ m tot}$ and fairness requirements. We also show that interference-aware UE clustering can significantly improve performance.

  19. Non-Orthogonal Multiple Access for Ubiquitous Wireless Sensor Networks.

    Science.gov (United States)

    Anwar, Asim; Seet, Boon-Chong; Ding, Zhiguo

    2018-02-08

    Ubiquitous wireless sensor networks (UWSNs) have become a critical technology for enabling smart cities and other ubiquitous monitoring applications. Their deployment, however, can be seriously hampered by the spectrum available to the sheer number of sensors for communication. To support the communication needs of UWSNs without requiring more spectrum resources, the power-domain non-orthogonal multiple access (NOMA) technique originally proposed for 5th Generation (5G) cellular networks is investigated for UWSNs for the first time in this paper. However, unlike 5G networks that operate in the licensed spectrum, UWSNs mostly operate in unlicensed spectrum where sensors also experience cross-technology interferences from other devices sharing the same spectrum. In this paper, we model the interferences from various sources at the sensors using stochastic geometry framework. To evaluate the performance, we derive a theorem and present new closed form expression for the outage probability of the sensors in a downlink scenario under interference limited environment. In addition, diversity analysis for the ordered NOMA users is performed. Based on the derived outage probability, we evaluate the average link throughput and energy consumption efficiency of NOMA against conventional orthogonal multiple access (OMA) technique in UWSNs. Further, the required computational complexity for the NOMA users is presented.

  20. Downlink Non-Orthogonal Multiple Access (NOMA) in Poisson Networks

    KAUST Repository

    Ali, Konpal S.; Haenggi, Martin; Elsawy, Hesham; Chaaban, Anas; Alouini, Mohamed-Slim

    2018-01-01

    A network model is considered where Poisson distributed base stations transmit to $N$ power-domain non-orthogonal multiple access (NOMA) users (UEs) each that employ successive interference cancellation (SIC) for decoding. We propose three models for the clustering of NOMA UEs and consider two different ordering techniques for the NOMA UEs: mean signal power-based and instantaneous signal-to-intercell-interference-and-noise-ratio-based. For each technique, we present a signal-to-interference-and-noise ratio analysis for the coverage of the typical UE. We plot the rate region for the two-user case and show that neither ordering technique is consistently superior to the other. We propose two efficient algorithms for finding a feasible resource allocation that maximize the cell sum rate $\\mathcal{R}_{\\rm tot}$, for general $N$, constrained to: 1) a minimum rate $\\mathcal{T}$ for each UE, 2) identical rates for all UEs. We show the existence of: 1) an optimum $N$ that maximizes the constrained $\\mathcal{R}_{\\rm tot}$ given a set of network parameters, 2) a critical SIC level necessary for NOMA to outperform orthogonal multiple access. The results highlight the importance in choosing the network parameters $N$, the constraints, and the ordering technique to balance the $\\mathcal{R}_{\\rm tot}$ and fairness requirements. We also show that interference-aware UE clustering can significantly improve performance.

  1. Material wealth in 3D: Mapping multiple paths to prosperity in low- and middle- income countries.

    Science.gov (United States)

    Hruschka, Daniel J; Hadley, Craig; Hackman, Joseph

    2017-01-01

    Material wealth is a key factor shaping human development and well-being. Every year, hundreds of studies in social science and policy fields assess material wealth in low- and middle-income countries assuming that there is a single dimension by which households can move from poverty to prosperity. However, a one-dimensional model may miss important kinds of prosperity, particularly in countries where traditional subsistence-based livelihoods coexist with modern cash economies. Using multiple correspondence analysis to analyze representative household data from six countries-Nepal, Bangladesh, Ethiopia, Kenya, Tanzania and Guatemala-across three world regions, we identify a number of independent dimension of wealth, each with a clear link to locally relevant pathways to success in cash and agricultural economies. In all cases, the first dimension identified by this approach replicates standard one-dimensional estimates and captures success in cash economies. The novel dimensions we identify reflect success in different agricultural sectors and are independently associated with key benchmarks of food security and human growth, such as adult body mass index and child height. The multidimensional models of wealth we describe here provide new opportunities for examining the causes and consequences of wealth inequality that go beyond success in cash economies, for tracing the emergence of hybrid pathways to prosperity, and for assessing how these different pathways to economic success carry different health risks and social opportunities.

  2. Material wealth in 3D: Mapping multiple paths to prosperity in low- and middle- income countries.

    Directory of Open Access Journals (Sweden)

    Daniel J Hruschka

    Full Text Available Material wealth is a key factor shaping human development and well-being. Every year, hundreds of studies in social science and policy fields assess material wealth in low- and middle-income countries assuming that there is a single dimension by which households can move from poverty to prosperity. However, a one-dimensional model may miss important kinds of prosperity, particularly in countries where traditional subsistence-based livelihoods coexist with modern cash economies. Using multiple correspondence analysis to analyze representative household data from six countries-Nepal, Bangladesh, Ethiopia, Kenya, Tanzania and Guatemala-across three world regions, we identify a number of independent dimension of wealth, each with a clear link to locally relevant pathways to success in cash and agricultural economies. In all cases, the first dimension identified by this approach replicates standard one-dimensional estimates and captures success in cash economies. The novel dimensions we identify reflect success in different agricultural sectors and are independently associated with key benchmarks of food security and human growth, such as adult body mass index and child height. The multidimensional models of wealth we describe here provide new opportunities for examining the causes and consequences of wealth inequality that go beyond success in cash economies, for tracing the emergence of hybrid pathways to prosperity, and for assessing how these different pathways to economic success carry different health risks and social opportunities.

  3. Multiple paths of electron flow to current in microbial electrolysis cells fed with low and high concentrations of propionate

    KAUST Repository

    Rao, Hari Ananda; Katuri, Krishna; Gorron, Eduardo; Logan, Bruce E.; Saikaly, Pascal

    2016-01-01

    Microbial electrolysis cells (MECs) provide a viable approach for bioenergy generation from fermentable substrates such as propionate. However, the paths of electron flow during propionate oxidation in the anode of MECs are unknown. Here, the paths

  4. Optical code-division multiple-access networks

    Science.gov (United States)

    Andonovic, Ivan; Huang, Wei

    1999-04-01

    This review details the approaches adopted to implement classical code division multiple access (CDMA) principles directly in the optical domain, resulting in all optical derivatives of electronic systems. There are a number of ways of realizing all-optical CDMA systems, classified as incoherent and coherent based on spreading in the time and frequency dimensions. The review covers the basic principles of optical CDMA (OCDMA), the nature of the codes used in these approaches and the resultant limitations on system performance with respect to the number of stations (code cardinality), the number of simultaneous users (correlation characteristics of the families of codes), concluding with consideration of network implementation issues. The latest developments will be presented with respect to the integration of conventional time spread codes, used in the bulk of the demonstrations of these networks to date, with wavelength division concepts, commonplace in optical networking. Similarly, implementations based on coherent correlation with the aid of a local oscillator will be detailed and comparisons between approaches will be drawn. Conclusions regarding the viability of these approaches allowing the goal of a large, asynchronous high capacity optical network to be realized will be made.

  5. Deep convolutional neural network based antenna selection in multiple-input multiple-output system

    Science.gov (United States)

    Cai, Jiaxin; Li, Yan; Hu, Ying

    2018-03-01

    Antenna selection of wireless communication system has attracted increasing attention due to the challenge of keeping a balance between communication performance and computational complexity in large-scale Multiple-Input MultipleOutput antenna systems. Recently, deep learning based methods have achieved promising performance for large-scale data processing and analysis in many application fields. This paper is the first attempt to introduce the deep learning technique into the field of Multiple-Input Multiple-Output antenna selection in wireless communications. First, the label of attenuation coefficients channel matrix is generated by minimizing the key performance indicator of training antenna systems. Then, a deep convolutional neural network that explicitly exploits the massive latent cues of attenuation coefficients is learned on the training antenna systems. Finally, we use the adopted deep convolutional neural network to classify the channel matrix labels of test antennas and select the optimal antenna subset. Simulation experimental results demonstrate that our method can achieve better performance than the state-of-the-art baselines for data-driven based wireless antenna selection.

  6. A path based model for a green liner shipping network design problem

    DEFF Research Database (Denmark)

    Jepsen, Mads Kehlet; Brouer, Berit Dangaard; Plum, Christian Edinger Munk

    2011-01-01

    Liner shipping networks are the backbone of international trade providing low transportation cost, which is a major driver of globalization. These networks are under constant pressure to deliver capacity, cost effectiveness and environmentally conscious transport solutions. This article proposes...

  7. Efficacy of using multiple open-path Fourier transform infrared (OP-FTIR) spectrometers in an odor emission episode investigation at a semiconductor manufacturing plant

    International Nuclear Information System (INIS)

    Tsao, Yung-Chieh; Wu, Chang-Fu; Chang, Pao-Erh; Chen, Shin-Yu; Hwang, Yaw-Huei

    2011-01-01

    This study evaluated the efficacy of simultaneously employing three open-path Fourier transform infrared (OP-FTIR) spectrometers with 3-day consecutive monitoring, using an odor episode as an example. The corresponding monitoring paths were allocated among the possible emission sources of a semiconductor manufacturing plant and the surrounding optoelectronic and electronic-related factories, which were located in a high-tech industrial park. There was a combined total odor rate of 43.9% for the three monitoring paths, each comprised of 736 continuous 5-minute monitoring records and containing detectable odor compounds, such as ammonia, ozone, butyl acetate, and propylene glycol monomethyl ether acetate (PGMEA). The results of the logistic regression model indicated that the prevailing south wind and the OP-FTIR monitoring path closest to the emission source in down-wind direction resulted in a high efficacy for detecting odorous samples with odds ratios (OR) of 3.8 (95% confidence interval (CI): 2.9-5.0) and 5.1 (95% CI: 3.6-7.2), respectively. Meanwhile, the odds ratio for detecting ammonia odorous samples was 7.5 for Path II, which was downwind closer to the possible source, as compared to Path III, downwind far away from the possible source. PGMEA could not be monitored at Path II but could be at Path III, indicating the importance of the monitoring path and flow ejection velocities inside the stacks on the monitoring performance of OP-FTIR. Besides, an odds ratio of 5.1 for odorous sample detection was obtained with south prevailing wind comprising 65.0% of the monitoring time period. In general, it is concluded that OP-FTIR operated with multiple paths simultaneously shall be considered for investigation on relatively complicated episodes such as emergency of chemical release, multiple-source emission and chemical monitoring for odor in a densely populated plant area to enhance the efficacy of OP-FTIR monitoring. - Research highlights: → To conduct multi-path

  8. Efficacy of using multiple open-path Fourier transform infrared (OP-FTIR) spectrometers in an odor emission episode investigation at a semiconductor manufacturing plant

    Energy Technology Data Exchange (ETDEWEB)

    Tsao, Yung-Chieh; Wu, Chang-Fu [Institute of Occupational Medicine and Industrial Hygiene, National Taiwan University College of Public Health, Taipei City 100, Taiwan (China); Chang, Pao-Erh; Chen, Shin-Yu [Green Energy and Environment Research Laboratories, Industrial Technology Research Institute, Hsinchu City 310, Taiwan 310 (China); Hwang, Yaw-Huei, E-mail: yhhwang@ntu.edu.tw [Institute of Occupational Medicine and Industrial Hygiene, National Taiwan University College of Public Health, Taipei City 100, Taiwan (China); Department of Public Health, College of Public Health, National Taiwan University, Taipei City 100, Taiwan (China)

    2011-08-01

    This study evaluated the efficacy of simultaneously employing three open-path Fourier transform infrared (OP-FTIR) spectrometers with 3-day consecutive monitoring, using an odor episode as an example. The corresponding monitoring paths were allocated among the possible emission sources of a semiconductor manufacturing plant and the surrounding optoelectronic and electronic-related factories, which were located in a high-tech industrial park. There was a combined total odor rate of 43.9% for the three monitoring paths, each comprised of 736 continuous 5-minute monitoring records and containing detectable odor compounds, such as ammonia, ozone, butyl acetate, and propylene glycol monomethyl ether acetate (PGMEA). The results of the logistic regression model indicated that the prevailing south wind and the OP-FTIR monitoring path closest to the emission source in down-wind direction resulted in a high efficacy for detecting odorous samples with odds ratios (OR) of 3.8 (95% confidence interval (CI): 2.9-5.0) and 5.1 (95% CI: 3.6-7.2), respectively. Meanwhile, the odds ratio for detecting ammonia odorous samples was 7.5 for Path II, which was downwind closer to the possible source, as compared to Path III, downwind far away from the possible source. PGMEA could not be monitored at Path II but could be at Path III, indicating the importance of the monitoring path and flow ejection velocities inside the stacks on the monitoring performance of OP-FTIR. Besides, an odds ratio of 5.1 for odorous sample detection was obtained with south prevailing wind comprising 65.0% of the monitoring time period. In general, it is concluded that OP-FTIR operated with multiple paths simultaneously shall be considered for investigation on relatively complicated episodes such as emergency of chemical release, multiple-source emission and chemical monitoring for odor in a densely populated plant area to enhance the efficacy of OP-FTIR monitoring. - Research highlights: {yields} To conduct

  9. Improving the Reliability of Optimised Link State Routing in a Smart Grid Neighbour Area Network based Wireless Mesh Network Using Multiple Metrics

    Directory of Open Access Journals (Sweden)

    Yakubu Tsado

    2017-02-01

    Full Text Available Reliable communication is the backbone of advanced metering infrastructure (AMI. Within the AMI, the neighbourhood area network (NAN transports a multitude of traffic, each with unique requirements. In order to deliver an acceptable level of reliability and latency, the underlying network, such as the wireless mesh network(WMN, must provide or guarantee the quality-of-service (QoS level required by the respective application traffic. Existing WMN routing protocols, such as optimised link state routing (OLSR, typically utilise a single metric and do not consider the requirements of individual traffic; hence, packets are delivered on a best-effort basis. This paper presents a QoS-aware WMN routing technique that employs multiple metrics in OLSR optimal path selection for AMI applications. The problems arising from this approach are non deterministic polynomial time (NP-complete in nature, which were solved through the combined use of the analytical hierarchy process (AHP algorithm and pruning techniques. For smart meters transmitting Internet Protocol (IP packets of varying sizes at different intervals, the proposed technique considers the constraints of NAN and the applications’ traffic characteristics. The technique was developed by combining multiple OLSR path selection metrics with the AHP algorithminns-2. Compared with the conventional link metric in OLSR, the results show improvements of about 23% and 45% in latency and Packet Delivery Ratio (PDR, respectively, in a 25-node grid NAN.

  10. Slow Path to the Superintendency: Women's Social Networks and Negotiation Skills

    Science.gov (United States)

    Montz, Carol B.; Wanat, Carolyn L.

    2008-01-01

    Women superintendents in one Midwestern state participated in this study of their personal demographics, professional qualifications and career paths, and demographics of districts and boards of education that hired them. Participants identified characteristics, skills, and barriers to women seeking superintendencies. Thirty-one of 36 women…

  11. Configurbanist : Easiest paths, fuzzy accessibility, and network centrality for walking and cycling in cities

    NARCIS (Netherlands)

    Nourian Ghadikolaee, P.; Rezvani, S.; Sariyildiz, I.S.; Van der Hoeven, F.D.

    2015-01-01

    In a quest for promoting sustainable modes of mobility, we have revisited how feasible and suitable is it for people to walk or cycle to their destinations in a neighbourhood. We propose a few accessibility measures based on an 'Easiest Path' algorithm that provides also actual temporal distance

  12. Stability Properties of Network Diversity Multiple Access with Multiple-Antenna Reception and Imperfect Collision Multiplicity Estimation

    Directory of Open Access Journals (Sweden)

    Ramiro Samano-Robles

    2013-01-01

    Full Text Available In NDMA (network diversity multiple access, protocol-controlled retransmissions are used to create a virtual MIMO (multiple-input multiple-output system, where collisions can be resolved via source separation. By using this retransmission diversity approach for collision resolution, NDMA is the family of random access protocols with the highest potential throughput. However, several issues remain open today in the modeling and design of this type of protocol, particularly in terms of dynamic stable performance and backlog delay. This paper attempts to partially fill this gap by proposing a Markov model for the study of the dynamic-stable performance of a symmetrical and non-blind NDMA protocol assisted by a multiple-antenna receiver. The model is useful in the study of stability aspects in terms of the backlog-user distribution and average backlog delay. It also allows for the investigation of the different states of the system and the transition probabilities between them. Unlike previous works, the proposed approach considers the imperfect estimation of the collision multiplicity, which is a crucial process to the performance of NDMA. The results suggest that NDMA improves not only the throughput performance over previous solutions, but also the average number of backlogged users, the average backlog delay and, in general, the stability of random access protocols. It is also shown that when multiuser detection conditions degrade, ALOHA-type backlog retransmission becomes relevant to the stable operation of NDMA.

  13. AIR POLLUITON INDEX PREDICTION USING MULTIPLE NEURAL NETWORKS

    Directory of Open Access Journals (Sweden)

    Zainal Ahmad

    2017-05-01

    Full Text Available Air quality monitoring and forecasting tools are necessary for the purpose of taking precautionary measures against air pollution, such as reducing the effect of a predicted air pollution peak on the surrounding population and ecosystem. In this study a single Feed-forward Artificial Neural Network (FANN is shown to be able to predict the Air Pollution Index (API with a Mean Squared Error (MSE and coefficient determination, R2, of 0.1856 and 0.7950 respectively. However, due to the non-robust nature of single FANN, a selective combination of Multiple Neural Networks (MNN is introduced using backward elimination and a forward selection method. The results show that both selective combination methods can improve the robustness and performance of the API prediction with the MSE and R2 of 0.1614 and 0.8210 respectively. This clearly shows that it is possible to reduce the number of networks combined in MNN for API prediction, without losses of any information in terms of the performance of the final API prediction model.

  14. cisPath: an R/Bioconductor package for cloud users for visualization and management of functional protein interaction networks.

    Science.gov (United States)

    Wang, Likun; Yang, Luhe; Peng, Zuohan; Lu, Dan; Jin, Yan; McNutt, Michael; Yin, Yuxin

    2015-01-01

    With the burgeoning development of cloud technology and services, there are an increasing number of users who prefer cloud to run their applications. All software and associated data are hosted on the cloud, allowing users to access them via a web browser from any computer, anywhere. This paper presents cisPath, an R/Bioconductor package deployed on cloud servers for client users to visualize, manage, and share functional protein interaction networks. With this R package, users can easily integrate downloaded protein-protein interaction information from different online databases with private data to construct new and personalized interaction networks. Additional functions allow users to generate specific networks based on private databases. Since the results produced with the use of this package are in the form of web pages, cloud users can easily view and edit the network graphs via the browser, using a mouse or touch screen, without the need to download them to a local computer. This package can also be installed and run on a local desktop computer. Depending on user preference, results can be publicized or shared by uploading to a web server or cloud driver, allowing other users to directly access results via a web browser. This package can be installed and run on a variety of platforms. Since all network views are shown in web pages, such package is particularly useful for cloud users. The easy installation and operation is an attractive quality for R beginners and users with no previous experience with cloud services.

  15. Path Creation

    DEFF Research Database (Denmark)

    Karnøe, Peter; Garud, Raghu

    2012-01-01

    This paper employs path creation as a lens to follow the emergence of the Danish wind turbine cluster. Supplier competencies, regulations, user preferences and a market for wind power did not pre-exist; all had to emerge in a tranformative manner involving multiple actors and artefacts. Competenc......This paper employs path creation as a lens to follow the emergence of the Danish wind turbine cluster. Supplier competencies, regulations, user preferences and a market for wind power did not pre-exist; all had to emerge in a tranformative manner involving multiple actors and artefacts....... Competencies emerged through processes and mechanisms such as co-creation that implicated multiple learning processes. The process was not an orderly linear one as emergent contingencies influenced the learning processes. An implication is that public policy to catalyse clusters cannot be based...

  16. Intersection Recognition and Guide-Path Selection for a Vision-Based AGV in a Bidirectional Flow Network

    Directory of Open Access Journals (Sweden)

    Wu Xing

    2014-03-01

    Full Text Available Vision recognition and RFID perception are used to develop a smart AGV travelling on fixed paths while retaining low-cost, simplicity and reliability. Visible landmarks can describe features of shapes and geometric dimensions of lines and intersections, and RFID tags can directly record global locations on pathways and the local topological relations of crossroads. A topological map is convenient for building and editing without the need for accurate poses when establishing a priori knowledge of a workplace. To obtain the flexibility of bidirectional movement along guide-paths, a camera placed in the centre of the AGV looks downward vertically at landmarks on the floor. A small visual field presents many difficulties for vision guidance, especially for real-time, correct and reliable recognition of multi-branch crossroads. First, the region projection and contour scanning methods are both used to extract the features of shapes. Then LDA is used to reduce the number of the features' dimensions. Third, a hierarchical SVM classifier is proposed to classify their multi-branch patterns once the features of the shapes are complete. Our experiments in landmark recognition and navigation show that low-cost vision systems are insusceptible to visual noises, image breakages and floor changes, and a vision-based AGV can locate itself precisely on its paths, recognize different crossroads intelligently by verifying the conformance of vision and RFID information, and select its next pathway efficiently in a bidirectional flow network.

  17. Zero-Slack, Noncritical Paths

    Science.gov (United States)

    Simons, Jacob V., Jr.

    2017-01-01

    The critical path method/program evaluation and review technique method of project scheduling is based on the importance of managing a project's critical path(s). Although a critical path is the longest path through a network, its location in large projects is facilitated by the computation of activity slack. However, logical fallacies in…

  18. Energy optimization based path selection algorithm for IEEE 802.11s wireless mesh networks

    CSIR Research Space (South Africa)

    Mhlanga, MM

    2011-09-01

    Full Text Available It is everyone’s dream to have network connectivity anywhere at all times. This dream can only be realized provided there are feasible solutions that are put in place for the next generation of wireless works. Wireless Mesh Networks (WMNs...

  19. Quasi Path Restoration: A post-failure recovery scheme over pre-allocated backup resource for elastic optical networks

    Science.gov (United States)

    Yadav, Dharmendra Singh; Babu, Sarath; Manoj, B. S.

    2018-03-01

    Spectrum conflict during primary and backup routes assignment in elastic optical networks results in increased resource consumption as well as high Bandwidth Blocking Probability. In order to avoid such conflicts, we propose a new scheme, Quasi Path Restoration (QPR), where we divide the available spectrum into two: (1) primary spectrum (for primary routes allocation) and (2) backup spectrum (for rerouting the data on link failures). QPR exhibits three advantages over existing survivable strategies such as Shared Path Protection (SPP), Primary First Fit Backup Last Fit (PFFBLF), Jointly Releasing and re-establishment Defragmentation SPP (JRDSSPP), and Path Restoration (PR): (1) the conflict between primary and backup spectrum during route assignment is completely eliminated, (2) upon a link failure, connection recovery requires less backup resources compared to SPP, PFFBLF, and PR, and (3) availability of the same backup spectrum on each link improves the recovery guarantee. The performance of our scheme is analyzed with different primary backup spectrum partitions on varying connection-request demands and number of frequency slots. Our results show that QPR provides better connection recovery guarantee and Backup Resources Utilization (BRU) compared to bandwidth recovery of PR strategy. In addition, we compare QPR with Shared Path Protection and Primary First-Fit Backup Last Fit strategies in terms of Bandwidth Blocking Probability (BBP) and average frequency slots per connection request. Simulation results show that BBP of SPP, PFFBLF, and JRDSPP varies between 18.59% and 14.42%, while in QPR, BBP ranges from 2.55% to 17.76% for Cost239, NSFNET, and ARPANET topologies. Also, QPR provides bandwidth recovery between 93.61% and 100%, while in PR, the recovery ranges from 86.81% to 98.99%. It is evident from our analysis that QPR provides a reasonable trade-off between bandwidth blocking probability and connection recoverability.

  20. The Health Action Process Approach as a Motivational Model of Dietary Self-Management for People with Multiple Sclerosis: A Path Analysis

    Science.gov (United States)

    Chiu, Chung-Yi; Lynch, Ruth Torkelson; Chan, Fong; Rose, Lindsey

    2012-01-01

    The main objective of this study was to evaluate the health action process approach (HAPA) as a motivational model for dietary self-management for people with multiple sclerosis (MS). Quantitative descriptive research design using path analysis was used. Participants were 209 individuals with MS recruited from the National MS Society and a…

  1. Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks

    Science.gov (United States)

    Wu, Shaobo; Chou, Wusheng; Niu, Jianwei; Guizani, Mohsen

    2018-01-01

    Wireless sensor networks (WSNs) involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector) path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio. PMID:29562628

  2. Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks.

    Science.gov (United States)

    Wu, Shaobo; Chou, Wusheng; Niu, Jianwei; Guizani, Mohsen

    2018-03-18

    Wireless sensor networks (WSNs) involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector) path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio.

  3. Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Shaobo Wu

    2018-03-01

    Full Text Available Wireless sensor networks (WSNs involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio.

  4. Multiple Transcoding Impact on Speech Quality in Ideal Network Conditions

    Directory of Open Access Journals (Sweden)

    Martin Mikulec

    2015-01-01

    Full Text Available This paper deals with the impact of transcoding on the speech quality. We have focused mainly on the transcoding between codecs without the negative influence of the network parameters such as packet loss and delay. It has ensured objective and repeatable results from our measurement. The measurement was performed on the Transcoding Measuring System developed especially for this purpose. The system is based on the open source projects and is useful as a design tool for VoIP system administrators. The paper compares the most used codecs from the transcoding perspective. The multiple transcoding between G711, GSM and G729 codecs were performed and the speech quality of these calls was evaluated. The speech quality was measured by Perceptual Evaluation of Speech Quality method, which provides results in Mean Opinion Score used to describe the speech quality on a scale from 1 to 5. The obtained results indicate periodical speech quality degradation on every transcoding between two codecs.

  5. Polynomial Functions Resulting from the Multiplication of Curves in the Framework of the Research and Study Paths

    Science.gov (United States)

    Llanos, Viviana Carolina; Otero, Maria Rita; Rojas, Emmanuel Colombo

    2015-01-01

    This paper presents the results of a research, which proposes the introduction of the teaching by Research and Study Paths (RSPs) into Argentinean secondary schools within the frame of the Anthropologic Theory of Didactics (ATD). The paths begin with the study of "Q[subscript 0]: How to operate with any curves knowing only its graphic…

  6. Online Signature Verification using Recurrent Neural Network and Length-normalized Path Signature

    OpenAIRE

    Lai, Songxuan; Jin, Lianwen; Yang, Weixin

    2017-01-01

    Inspired by the great success of recurrent neural networks (RNNs) in sequential modeling, we introduce a novel RNN system to improve the performance of online signature verification. The training objective is to directly minimize intra-class variations and to push the distances between skilled forgeries and genuine samples above a given threshold. By back-propagating the training signals, our RNN network produced discriminative features with desired metrics. Additionally, we propose a novel d...

  7. The Average Network Flow Problem: Shortest Path and Minimum Cost Flow Formulations, Algorithms, Heuristics, and Complexity

    Science.gov (United States)

    2012-09-13

    46, 1989. [75] S. Melkote and M.S. Daskin . An integrated model of facility location and transportation network design. Transportation Research Part A ... a work of the U.S. Government and is not subject to copyright protection in the United States. AFIT/DS/ENS/12-09 THE AVERAGE NETWORK FLOW PROBLEM...focused thinking (VFT) are used sparingly, as is the case across the entirety of the supply chain literature. We provide a VFT tutorial for supply chain

  8. Pre-drawn paths: networks of itineraries of Russian tourists in Andalusia

    OpenAIRE

    Maya Jariego, Isidro; Alieva, Deniza

    2018-01-01

    This article describes the movements between cities of Russian tourists in Andalusia. With the application of network analysis strategies, we examined 1,681 displacements between 80 cities by 354 Russian tourists in Andalusia. The itineraries were reconstructed from information provided by tourists in a survey conducted between one and three years after their trip. With the analysis of QAP correlations, we explored the relationship between the route network and the distance matrix between cit...

  9. Connection Setup Signaling Scheme with Flooding-Based Path Searching for Diverse-Metric Network

    Science.gov (United States)

    Kikuta, Ko; Ishii, Daisuke; Okamoto, Satoru; Oki, Eiji; Yamanaka, Naoaki

    Connection setup on various computer networks is now achieved by GMPLS. This technology is based on the source-routing approach, which requires the source node to store metric information of the entire network prior to computing a route. Thus all metric information must be distributed to all network nodes and kept up-to-date. However, as metric information become more diverse and generalized, it is hard to update all information due to the huge update overhead. Emerging network services and applications require the network to support diverse metrics for achieving various communication qualities. Increasing the number of metrics supported by the network causes excessive processing of metric update messages. To reduce the number of metric update messages, another scheme is required. This paper proposes a connection setup scheme that uses flooding-based signaling rather than the distribution of metric information. The proposed scheme requires only flooding of signaling messages with requested metric information, no routing protocol is required. Evaluations confirm that the proposed scheme achieves connection establishment without excessive overhead. Our analysis shows that the proposed scheme greatly reduces the number of control messages compared to the conventional scheme, while their blocking probabilities are comparable.

  10. Network-based identification of biomarkers coexpressed with multiple pathways.

    Science.gov (United States)

    Guo, Nancy Lan; Wan, Ying-Wooi

    2014-01-01

    Unraveling complex molecular interactions and networks and incorporating clinical information in modeling will present a paradigm shift in molecular medicine. Embedding biological relevance via modeling molecular networks and pathways has become increasingly important for biomarker identification in cancer susceptibility and metastasis studies. Here, we give a comprehensive overview of computational methods used for biomarker identification, and provide a performance comparison of several network models used in studies of cancer susceptibility, disease progression, and prognostication. Specifically, we evaluated implication networks, Boolean networks, Bayesian networks, and Pearson's correlation networks in constructing gene coexpression networks for identifying lung cancer diagnostic and prognostic biomarkers. The results show that implication networks, implemented in Genet package, identified sets of biomarkers that generated an accurate prediction of lung cancer risk and metastases; meanwhile, implication networks revealed more biologically relevant molecular interactions than Boolean networks, Bayesian networks, and Pearson's correlation networks when evaluated with MSigDB database.

  11. Optimal assignment of multiple utilities in heat exchange networks

    International Nuclear Information System (INIS)

    Salama, A.I.A.

    2009-01-01

    Existing numerical geometry-based techniques, developed by [A.I.A. Salama, Numerical techniques for determining heat energy targets in pinch analysis, Computers and Chemical Engineering 29 (2005) 1861-1866; A.I.A. Salama, Determination of the optimal heat energy targets in heat pinch analysis using a geometry-based approach, Computers and Chemical Engineering 30 (2006) 758-764], have been extended to optimally assign multiple utilities in heat exchange network (HEN). These techniques utilize the horizontal shift between the cold composite curve (CC) and the stationary hot CC to determine the HEN optimal energy targets, grand composite curve (GCC), and the complement grand composite curve (CGCC). The proposed numerical technique developed in this paper is direct and simultaneously determines the optimal heat-energy targets and optimally assigns multiple utilities as compared with an existing technique based on sequential assignment of multiple utilities. The technique starts by arranging in an ascending order the HEN stream and target temperatures, and the resulting set is labelled T. Furthermore, the temperature sets where multiple utilities are introduced are arranged in an ascending order and are labelled T ic and T ih for the cold and hot sides, respectively. The graphical presentation of the results is facilitated by the insertion at each multiple-utility temperature a perturbed temperature equals the insertion temperature minus a small perturbation. Furthermore, using the heat exchanger network (HEN) minimum temperature-differential approach (ΔT min ) and stream heat-capacity flow rates, the presentation is facilitated by using the conventional temperature shift of the HEN CCs. The set of temperature-shifted stream and target temperatures and perturbed temperatures in the overlap range between the CCs is labelled T ol . Using T ol , a simple formula employing enthalpy-flow differences between the hot composite curve CC h and the cold composite curve CC c is

  12. Making cytological diagnoses on digital images using the iPath network.

    Science.gov (United States)

    Dalquen, Peter; Savic Prince, Spasenija; Spieler, Peter; Kunze, Dietmar; Neumann, Heinrich; Eppenberger-Castori, Serenella; Adams, Heiner; Glatz, Katharina; Bubendorf, Lukas

    2014-01-01

    The iPath telemedicine platform Basel is mainly used for histological and cytological consultations, but also serves as a valuable learning tool. To study the level of accuracy in making diagnoses based on still images achieved by experienced cytopathologists, to identify limiting factors, and to provide a cytological image series as a learning set. Images from 167 consecutive cytological specimens of different origin were uploaded on the iPath platform and evaluated by four cytopathologists. Only wet-fixed and well-stained specimens were used. The consultants made specific diagnoses and categorized each as benign, suspicious or malignant. For all consultants, specificity and sensitivity regarding categorized diagnoses were 83-92 and 85-93%, respectively; the overall accuracy was 88-90%. The interobserver agreement was substantial (κ = 0.791). The lowest rate of concordance was achieved in urine and bladder washings and in the identification of benign lesions. Using a digital image set for diagnostic purposes implies that even under optimal conditions the accuracy rate will not exceed to 80-90%, mainly because of lacking supportive immunocytochemical or molecular tests. This limitation does not disqualify digital images for teleconsulting or as a learning aid. The series of images used for the study are open to the public at http://pathorama.wordpress.com/extragenital-cytology-2013/. © 2014 S. Karger AG, Basel.

  13. Time-Critical Cooperative Path Following of Multiple Unmanned Aerial Vehicles over Time-Varying Networks

    Science.gov (United States)

    2013-03-01

    Springer–Verlag, Berlin, 2006, pp. 1–19. [33] Breivik , M., Subbotin, M. V., and Fossen, T. I., “Kinematic Aspects of Guided Formation Control in 2D...Technology, Trondheim, Norway, April 2007. [36] Breivik ,M., Hovstein, V. E., and Fossen, T. I., “Ship Formation Control: AGuided Leader-Follower Approach

  14. Time-Critical Cooperative Path Following of Multiple UAVs over Time-Varying Networks

    Science.gov (United States)

    2011-01-01

    Notes in Control and Information Systems Series (K. Y. Pettersen, T. Gravdahl, and H. Nijmeijer, Eds.). Springer-Verlag, 2006. 29M. Breivik , V...Information Systems Series (K. Y. Pettersen, T. Gravdahl, and H. Nijmeijer, Eds.). Springer-Verlag, 2006. 31M. Breivik , E. Hovstein, and T. I. Fossen. Ship

  15. Fault Tolerant Mechanism for Multimedia Flows in Wireless Ad Hoc Networks Based on Fast Switching Paths

    Directory of Open Access Journals (Sweden)

    Juan R. Diaz

    2014-01-01

    Full Text Available Multimedia traffic can be forwarded through a wireless ad hoc network using the available resources of the nodes. Several models and protocols have been designed in order to organize and arrange the nodes to improve transmissions along the network. We use a cluster-based framework, called MWAHCA architecture, which optimizes multimedia transmissions over a wireless ad hoc network. It was proposed by us in a previous research work. This architecture is focused on decreasing quality of service (QoS parameters like latency, jitter, and packet loss, but other network features were not developed, like load balance or fault tolerance. In this paper, we propose a new fault tolerance mechanism, using as a base the MWAHCA architecture, in order to recover any multimedia flow crossing the wireless ad hoc network when there is a node failure. The algorithm can run independently for each multimedia flow. The main objective is to keep the QoS parameters as low as possible. To achieve this goal, the convergence time must be controlled and reduced. This paper provides the designed protocol, the analytical model of the algorithm, and a software application developed to test its performance in a real laboratory.

  16. SUNSEED — An evolutionary path to smart grid comms over converged telco and energy provider networks

    DEFF Research Database (Denmark)

    Stefanovic, Cedomir; Popovski, Petar; Jorguseski, Ljupco

    2014-01-01

    of energy distribution service operators (DSO) and telecom operators (telco) for the future smart grid operations and services. To achieve this objective, SUNSEED proposes an evolutionary approach to converge existing DSO and telco networks, consisting of six steps: overlap, interconnect, interoperate......SUNSEED, “Sustainable and robust networking for smart electricity distribution”, is a 3-year project started in 2014 and partially funded under call FP7-ICT-2013-11. The project objective is to research, design and implement methods for exploitation of existing communication infrastructure...

  17. A Path-Based Gradient Projection Algorithm for the Cost-Based System Optimum Problem in Networks with Continuously Distributed Value of Time

    Directory of Open Access Journals (Sweden)

    Wen-Xiang Wu

    2014-01-01

    Full Text Available The cost-based system optimum problem in networks with continuously distributed value of time is formulated as a path-based form, which cannot be solved by the Frank-Wolfe algorithm. In light of magnitude improvement in the availability of computer memory in recent years, path-based algorithms have been regarded as a viable approach for traffic assignment problems with reasonably large network sizes. We develop a path-based gradient projection algorithm for solving the cost-based system optimum model, based on Goldstein-Levitin-Polyak method which has been successfully applied to solve standard user equilibrium and system optimum problems. The Sioux Falls network tested is used to verify the effectiveness of the algorithm.

  18. Path scanning for the detection of anomalous subgraphs and use of DNS requests and host agents for anomaly/change detection and network situational awareness

    Science.gov (United States)

    Neil, Joshua Charles; Fisk, Michael Edward; Brugh, Alexander William; Hash, Curtis Lee; Storlie, Curtis Byron; Uphoff, Benjamin; Kent, Alexander

    2017-11-21

    A system, apparatus, computer-readable medium, and computer-implemented method are provided for detecting anomalous behavior in a network. Historical parameters of the network are determined in order to determine normal activity levels. A plurality of paths in the network are enumerated as part of a graph representing the network, where each computing system in the network may be a node in the graph and the sequence of connections between two computing systems may be a directed edge in the graph. A statistical model is applied to the plurality of paths in the graph on a sliding window basis to detect anomalous behavior. Data collected by a Unified Host Collection Agent ("UHCA") may also be used to detect anomalous behavior.

  19. Damper-to-damper path loss characterization for intra-vehicular wireless sensor networks

    NARCIS (Netherlands)

    Mendes da Costa Jr., C.A.; Gao, H.; Le Polain, T.; van Dommele, A.R.; Smolders, A.B.; Dheans, M.; Baltus, P.G.M.

    2017-01-01

    Intra-Vehicular Wireless Sensor Networks (IVWSNs) is one of the major advances in electrical smart cars. It could extend the driving distance of E-cars by reducing the weight of bulky cables. It can also bring more sensing functions, turning the car into smart units for Intelligent Transportation

  20. Damper-to-damper path loss characterization for intra-vehicular wireless sensor networks

    NARCIS (Netherlands)

    Costa, Carlos A.M.; Gao, Hao; Le Polain, Thibault; Van Dommele, Rainier; Smolders, Bart; Dheans, Miguel; Baltus, Peter

    2018-01-01

    Intra-Vehicular Wireless Sensor Networks (IVWSNs) is one of the major advances in electrical smart cars. It could extend the driving distance of E-cars by reducing the weight of bulky cables. It can also bring more sensing functions, turning the car into smart units for Intelligent Transportation

  1. Path Calculation and Packet Translation for UAV Surveillance in Support of Wireless Sensor Networks

    Science.gov (United States)

    2006-09-01

    Servomechanism,” 2006). The Unicorn and MMALV have different servo arrangements due to the dissimilarity of their steering mechanisms. (2...15. NUMBER OF PAGES 191 14. SUBJECT TERMS Wireless Sensor Network, Contact Interception, Mote, MMALV, Unicorn , Kestrel Autopilot System...26 1. Procerus Unicorn ..............................................................................26 a. Physical

  2. Asymptotic analysis of network structures: degree-degree correlations and directed paths

    NARCIS (Netherlands)

    van der Hoorn, W.L.F.

    2016-01-01

    Our world is filled with complex systems, ranging from technological systems such as the Internet and the World Wide Web, to the human brain and social interactions between individuals or even organizations. Many of such systems can be modeled as a network, consisting of nodes and relations between

  3. Robust On-Demand Multipath Routing with Dynamic Path Upgrade for Delay-Sensitive Data over Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Sunil Kumar

    2013-01-01

    Full Text Available Node mobility in mobile ad hoc networks (MANETs causes frequent route breakages and intermittent link stability. In this paper, we introduce a robust routing scheme, known as ad hoc on-demand multipath distance vector with dynamic path update (AOMDV-DPU, for delay-sensitive data transmission over MANET. The proposed scheme improves the AOMDV scheme by incorporating the following features: (i a routing metric based on the combination of minimum hops and received signal strength indicator (RSSI for discovery of reliable routes; (ii a local path update mechanism which strengthens the route, reduces the route breakage frequency, and increases the route longevity; (iii a keep alive mechanism for secondary route maintenance which enables smooth switching between routes and reduces the route discovery frequency; (iv a packet salvaging scheme to improve packet delivery in the event of a route breakage; and (v low HELLO packet overhead. The simulations are carried out in ns-2 for varying node speeds, number of sources, and traffic load conditions. Our AOMDV-DPU scheme achieves significantly higher throughput, lower delay, routing overhead, and route discovery frequency and latency compared to AOMDV. For H.264 compressed video traffic, AOMDV-DPU scheme achieves 3 dB or higher PSNR gain over AOMDV at both low and high node speeds.

  4. A deterministic method for estimating free energy genetic network landscapes with applications to cell commitment and reprogramming paths.

    Science.gov (United States)

    Olariu, Victor; Manesso, Erica; Peterson, Carsten

    2017-06-01

    Depicting developmental processes as movements in free energy genetic landscapes is an illustrative tool. However, exploring such landscapes to obtain quantitative or even qualitative predictions is hampered by the lack of free energy functions corresponding to the biochemical Michaelis-Menten or Hill rate equations for the dynamics. Being armed with energy landscapes defined by a network and its interactions would open up the possibility of swiftly identifying cell states and computing optimal paths, including those of cell reprogramming, thereby avoiding exhaustive trial-and-error simulations with rate equations for different parameter sets. It turns out that sigmoidal rate equations do have approximate free energy associations. With this replacement of rate equations, we develop a deterministic method for estimating the free energy surfaces of systems of interacting genes at different noise levels or temperatures. Once such free energy landscape estimates have been established, we adapt a shortest path algorithm to determine optimal routes in the landscapes. We explore the method on three circuits for haematopoiesis and embryonic stem cell development for commitment and reprogramming scenarios and illustrate how the method can be used to determine sequential steps for onsets of external factors, essential for efficient reprogramming.

  5. The ASCI Network for SC '99: A Step on the Path to a 100 Gigabit Per Second Supercomputing Network

    Energy Technology Data Exchange (ETDEWEB)

    PRATT,THOMAS J.; TARMAN,THOMAS D.; MARTINEZ,LUIS M.; MILLER,MARC M.; ADAMS,ROGER L.; CHEN,HELEN Y.; BRANDT,JAMES M.; WYCKOFF,PETER S.

    2000-07-24

    This document highlights the Discom{sup 2}'s Distance computing and communication team activities at the 1999 Supercomputing conference in Portland, Oregon. This conference is sponsored by the IEEE and ACM. Sandia, Lawrence Livermore and Los Alamos National laboratories have participated in this conference for eleven years. For the last four years the three laboratories have come together at the conference under the DOE's ASCI, Accelerated Strategic Computing Initiatives rubric. Communication support for the ASCI exhibit is provided by the ASCI DISCOM{sup 2} project. The DISCOM{sup 2} communication team uses this forum to demonstrate and focus communication and networking developments within the community. At SC 99, DISCOM built a prototype of the next generation ASCI network demonstrated remote clustering techniques, demonstrated the capabilities of the emerging Terabit Routers products, demonstrated the latest technologies for delivering visualization data to the scientific users, and demonstrated the latest in encryption methods including IP VPN technologies and ATM encryption research. The authors also coordinated the other production networking activities within the booth and between their demonstration partners on the exhibit floor. This paper documents those accomplishments, discusses the details of their implementation, and describes how these demonstrations support Sandia's overall strategies in ASCI networking.

  6. Granger causal connectivity dissociates navigation networks that subserve allocentric and egocentric path integration.

    Science.gov (United States)

    Lin, Chin-Teng; Chiu, Te-Cheng; Wang, Yu-Kai; Chuang, Chun-Hsiang; Gramann, Klaus

    2018-01-15

    Studies on spatial navigation demonstrate a significant role of the retrosplenial complex (RSC) in the transformation of egocentric and allocentric information into complementary spatial reference frames (SRFs). The tight anatomical connections of the RSC with a wide range of other cortical regions processing spatial information support its vital role within the human navigation network. To better understand how different areas of the navigational network interact, we investigated the dynamic causal interactions of brain regions involved in solving a virtual navigation task. EEG signals were decomposed by independent component analysis (ICA) and subsequently examined for information flow between clusters of independent components (ICs) using direct short-time directed transfer function (sdDTF). The results revealed information flow between the anterior cingulate cortex and the left prefrontal cortex in the theta (4-7 Hz) frequency band and between the prefrontal, motor, parietal, and occipital cortices as well as the RSC in the alpha (8-13 Hz) frequency band. When participants prefered to use distinct reference frames (egocentric vs. allocentric) during navigation was considered, a dominant occipito-parieto-RSC network was identified in allocentric navigators. These results are in line with the assumption that the RSC, parietal, and occipital cortices are involved in transforming egocentric visual-spatial information into an allocentric reference frame. Moreover, the RSC demonstrated the strongest causal flow during changes in orientation, suggesting that this structure directly provides information on heading changes in humans. Copyright © 2017 Elsevier B.V. All rights reserved.

  7. K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks.

    Directory of Open Access Journals (Sweden)

    Yunyue He

    Full Text Available Emergency evacuation aims to transport people from dangerous places to safe shelters as quickly as possible. Police play an important role in the evacuation process, as they can handle traffic accidents immediately and help people move smoothly on roads. This paper investigates an evacuation routing problem that involves police resource allocation. We propose a novel k-th-shortest-path-based technique that uses explicit congestion control to optimize evacuation routing and police resource allocation. A nonlinear mixed-integer programming model is presented to formulate the problem. The model's objective is to minimize the overall evacuation clearance time. Two algorithms are given to solve the problem. The first one linearizes the original model and solves the linearized problem with CPLEX. The second one is a heuristic algorithm that uses a police resource utilization efficiency index to directly solve the original model. This police resource utilization efficiency index significantly aids in the evaluation of road links from an evacuation throughput perspective. The proposed algorithms are tested with a number of examples based on real data from cities of different sizes. The computational results show that the police resource utilization efficiency index is very helpful in finding near-optimal solutions. Additionally, comparing the performance of the heuristic algorithm and the linearization method by using randomly generated examples indicates that the efficiency of the heuristic algorithm is superior.

  8. Optimization of Multiple Related Negotiation through Multi-Negotiation Network

    Science.gov (United States)

    Ren, Fenghui; Zhang, Minjie; Miao, Chunyan; Shen, Zhiqi

    In this paper, a Multi-Negotiation Network (MNN) and a Multi- Negotiation Influence Diagram (MNID) are proposed to optimally handle Multiple Related Negotiations (MRN) in a multi-agent system. Most popular, state-of-the-art approaches perform MRN sequentially. However, a sequential procedure may not optimally execute MRN in terms of maximizing the global outcome, and may even lead to unnecessary losses in some situations. The motivation of this research is to use a MNN to handle MRN concurrently so as to maximize the expected utility of MRN. Firstly, both the joint success rate and the joint utility by considering all related negotiations are dynamically calculated based on a MNN. Secondly, by employing a MNID, an agent's possible decision on each related negotiation is reflected by the value of expected utility. Lastly, through comparing expected utilities between all possible policies to conduct MRN, an optimal policy is generated to optimize the global outcome of MRN. The experimental results indicate that the proposed approach can improve the global outcome of MRN in a successful end scenario, and avoid unnecessary losses in an unsuccessful end scenario.

  9. Multiple Hub Network Choice in the Liberalized European Market

    Science.gov (United States)

    Berechman, Joseph; deWit, Jaap

    1997-01-01

    . In the meantime, open skies agreements have been concluded between the USA and most of the EU member states to facilitate strategic alliances between airlines of the states involved. As a result of this on-going liberalization the model of the single 'national' carrier using the national home base as its single hub for the designated third, fourth and sixth freedom operations will stepwise disappear. Within the EU the concept of the national carrier has already been replaced by that of the community carrier. State ownership in more and more European carriers is reduced. On the longer run mergers or even bankruptcy will further undermine the "single national carrier - single national hub" model in Europe. In the meantime, strategic alliances between national carriers in Europe will already reduce the airlines' loyalty to a single airport. Profit maximization and accountability to share holders will supersede the loyalty of these newly emerging alliances, probably looking for the opportunities of a multiple hub network to adequately cover the whole European market. As a consequence, some European airports might see a substantial decline in arriving, departing and transfer traffic, thus in revenues and financial solvency, as well as in their connection to other inter-continental and intra-European destinations. At the same time, other airports might realize a significant increase in traffic as they will be sought after by the profit maximizing airlines as their major gateway hubs. Which will be the losing airports and which will be the winning ones? Can airports anticipate the actions of airlines in deregulated markets and utilize policies which will improve their relative position? If so, what should be these anticipatory policies? These questions become the more urgent, since an increasing number of major European airports will be privatized in the near future. Although increasing airport congestion in Europe will also be reflected in a growing demand pressure for

  10. Constrained approximation of effective generators for multiscale stochastic reaction networks and application to conditioned path sampling

    Energy Technology Data Exchange (ETDEWEB)

    Cotter, Simon L., E-mail: simon.cotter@manchester.ac.uk

    2016-10-15

    Efficient analysis and simulation of multiscale stochastic systems of chemical kinetics is an ongoing area for research, and is the source of many theoretical and computational challenges. In this paper, we present a significant improvement to the constrained approach, which is a method for computing effective dynamics of slowly changing quantities in these systems, but which does not rely on the quasi-steady-state assumption (QSSA). The QSSA can cause errors in the estimation of effective dynamics for systems where the difference in timescales between the “fast” and “slow” variables is not so pronounced. This new application of the constrained approach allows us to compute the effective generator of the slow variables, without the need for expensive stochastic simulations. This is achieved by finding the null space of the generator of the constrained system. For complex systems where this is not possible, or where the constrained subsystem is itself multiscale, the constrained approach can then be applied iteratively. This results in breaking the problem down into finding the solutions to many small eigenvalue problems, which can be efficiently solved using standard methods. Since this methodology does not rely on the quasi steady-state assumption, the effective dynamics that are approximated are highly accurate, and in the case of systems with only monomolecular reactions, are exact. We will demonstrate this with some numerics, and also use the effective generators to sample paths of the slow variables which are conditioned on their endpoints, a task which would be computationally intractable for the generator of the full system.

  11. Function and activity classification in network traffic data: existing methods, their weaknesses, and a path forward

    Science.gov (United States)

    Levchuk, Georgiy

    2016-05-01

    The cyber spaces are increasingly becoming the battlefields between friendly and adversary forces, with normal users caught in the middle. Accordingly, planners of enterprise defensive policies and offensive cyber missions alike have an essential goal to minimize the impact of their own actions and adversaries' attacks on normal operations of the commercial and government networks. To do this, the cyber analysis need accurate "cyber battle maps", where the functions, roles, and activities of individual and groups of devices and users are accurately identified. Most of the research in cyber exploitation has focused on the identification of attacks, attackers, and their devices. Many tools exist for device profiling, malware identification, user attribution, and attack analysis. However, most of the tools are intrusive, sensitive to data obfuscation, or provide anomaly flagging and not able to correctly classify the semantics and causes of network activities. In this paper, we review existing solutions that can identify functional and social roles of entities in cyberspace, discuss their weaknesses, and propose an approach for developing functional and social layers of cyber battle maps.

  12. Multiple dynamical time-scales in networks with hierarchically ...

    Indian Academy of Sciences (India)

    cists from resistor networks to polymer contact structure to spin interactions in disordered ... the intracellular signalling system to neuronal networks to ecological food ... tion of the key players can be used to develop drugs targeted specifically ...

  13. Performance Analysis on the Coexistence of Multiple Cognitive Radio Networks

    Science.gov (United States)

    2015-05-28

    etc. The regulation of wireless networks is done by government agencies through which spectrum is allocated to a particular application , this kind of...Local Area Networks ( WLAN ), cordless phones and BluetoothWireless Personal Area Networks (WPAN). While unlicensed bands have opened up avenues for the...they can be applied to other types of wireless ad hoc networks. As an example, this framework finds application in Device-to-Device (D2D) communication

  14. Network formation under heterogeneous costs: The multiple group model

    NARCIS (Netherlands)

    Kamphorst, J.J.A.; van der Laan, G.

    2007-01-01

    It is widely recognized that the shape of networks influences both individual and aggregate behavior. This raises the question which types of networks are likely to arise. In this paper we investigate a model of network formation, where players are divided into groups and the costs of a link between

  15. Towards heterogeneous robot team path planning: acquisition of multiple routes with a modified spline-based algorithm

    Directory of Open Access Journals (Sweden)

    Lavrenov Roman

    2017-01-01

    Full Text Available Our research focuses on operation of a heterogeneous robotic group that carries out point-to point navigation in GPS-denied dynamic environment, applying a combined local and global planning approach. In this paper, we introduce a homotopy-based high-level planner, which uses a modified splinebased path-planning algorithm. The algorithm utilizes Voronoi graph for global planning and a set of optimization criteria for local improvements of selected paths. The simulation was implemented in Matlab environment.

  16. A Velocity-Level Bi-Criteria Optimization Scheme for Coordinated Path Tracking of Dual Robot Manipulators Using Recurrent Neural Network.

    Science.gov (United States)

    Xiao, Lin; Zhang, Yongsheng; Liao, Bolin; Zhang, Zhijun; Ding, Lei; Jin, Long

    2017-01-01

    A dual-robot system is a robotic device composed of two robot arms. To eliminate the joint-angle drift and prevent the occurrence of high joint velocity, a velocity-level bi-criteria optimization scheme, which includes two criteria (i.e., the minimum velocity norm and the repetitive motion), is proposed and investigated for coordinated path tracking of dual robot manipulators. Specifically, to realize the coordinated path tracking of dual robot manipulators, two subschemes are first presented for the left and right robot manipulators. After that, such two subschemes are reformulated as two general quadratic programs (QPs), which can be formulated as one unified QP. A recurrent neural network (RNN) is thus presented to solve effectively the unified QP problem. At last, computer simulation results based on a dual three-link planar manipulator further validate the feasibility and the efficacy of the velocity-level optimization scheme for coordinated path tracking using the recurrent neural network.

  17. Anti-synchronization control of BAM memristive neural networks with multiple proportional delays and stochastic perturbations

    Science.gov (United States)

    Wang, Weiping; Yuan, Manman; Luo, Xiong; Liu, Linlin; Zhang, Yao

    2018-01-01

    Proportional delay is a class of unbounded time-varying delay. A class of bidirectional associative memory (BAM) memristive neural networks with multiple proportional delays is concerned in this paper. First, we propose the model of BAM memristive neural networks with multiple proportional delays and stochastic perturbations. Furthermore, by choosing suitable nonlinear variable transformations, the BAM memristive neural networks with multiple proportional delays can be transformed into the BAM memristive neural networks with constant delays. Based on the drive-response system concept, differential inclusions theory and Lyapunov stability theory, some anti-synchronization criteria are obtained. Finally, the effectiveness of proposed criteria are demonstrated through numerical examples.

  18. Remoting alternatives for a multiple phased-array antenna network

    Science.gov (United States)

    Shi, Zan; Foshee, James J.

    2001-10-01

    Significant improvements in technology have made phased array antennas an attractive alternative to the traditional dish antenna for use on wide body airplanes. These improvements have resulted in reduced size, reduced cost, reduced losses in the transmit and receive channels (simplifying the design), a significant extension in the bandwidth capability, and an increase in the functional capability. Flush mounting (thus reduced drag) and rapid beam switching are among the evolving desirable features of phased array antennas. Beam scanning of phased array antennas is limited to +/-45 degrees at best and therefore multiple phased array antennas would need to be used to insure instantaneous communications with any ground station (stations located at different geographical locations on the ground) and with other airborne stations. The exact number of phased array antennas and the specific installation location of each antenna on the wide body airplane would need to be determined by the specific communication requirements, but it is conceivable as many as five phased array antennas may need to be used to provide the required coverage. Control and switching of these antennas would need to be accomplished at a centralized location on the airplane and since these antennas would be at different locations on the airplane an efficient scheme of remoting would need to be used. To save in cost and keep the phased array antennas as small as possible the design of the phased array antennas would need to be kept simple. A dish antenna and a blade antenna (small size) could also be used to augment the system. Generating the RF signals at the central location and then using RF cables or waveguide to get the signal to any given antenna could result in significant RF losses. This paper will evaluate a number of remoting alternatives to keep the system design simple, reduce system cost, and utilize the functional capability of networking multiple phased array antennas on a wide body

  19. Application of neural networks to multiple alarm processing and diagnosis in nuclear power plants

    International Nuclear Information System (INIS)

    Cheon, Se Woo; Chang Soon Heung; Chung, Hak Yeong

    1992-01-01

    This paper presents feasibility studies of multiple alarm processing and diagnosis using neural networks. The back-propagation neural network model is applied to the training of multiple alarm patterns for the identification of failure in a reactor coolant pump (RCP) system. The general mapping capability of the neural network enables to identify a fault easily. The case studies are performed with emphasis on the applicability of the neural network to pattern recognition problems. It is revealed that the neural network model can identify the cause of multiple alarms properly, even when untrained or sensor-failed alarm symptoms are given. It is also shown that multiple failures are easily identified using the symptoms of multiple alarms

  20. Ordering, materiality, and multiplicity: Enacting Actor–Network Theory in tourism

    NARCIS (Netherlands)

    Duim, van der R.; Ren, C.; Johannesson, G.T.

    2013-01-01

    In this article, we demonstrate how Actor–Network Theory has been translated into tourism research. The article presents and discusses three concepts integral to the Actor–Network Theory approach: ordering, materiality, and multiplicity. We first briefly introduce Actor–Network Theory and draw

  1. Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast

    NARCIS (Netherlands)

    Goseling, J.; Matsumoto, R.; Uyematsu, T.; Weber, J.H.

    2010-01-01

    We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio of the minimum energy required by routing and network coding

  2. Lower bounds on the maximum energy benefit of network coding for wireless multiple unicast

    NARCIS (Netherlands)

    Goseling, Jasper; Matsumoto, Ryutaroh; Uyematsu, Tomohiko; Weber, Jos H.

    2010-01-01

    We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio of the minimum energy required by routing and network coding

  3. Robustness analysis of interdependent networks under multiple-attacking strategies

    Science.gov (United States)

    Gao, Yan-Li; Chen, Shi-Ming; Nie, Sen; Ma, Fei; Guan, Jun-Jie

    2018-04-01

    The robustness of complex networks under attacks largely depends on the structure of a network and the nature of the attacks. Previous research on interdependent networks has focused on two types of initial attack: random attack and degree-based targeted attack. In this paper, a deliberate attack function is proposed, where six kinds of deliberate attacking strategies can be derived by adjusting the tunable parameters. Moreover, the robustness of four types of interdependent networks (BA-BA, ER-ER, BA-ER and ER-BA) with different coupling modes (random, positive and negative correlation) is evaluated under different attacking strategies. Interesting conclusions could be obtained. It can be found that the positive coupling mode can make the vulnerability of the interdependent network to be absolutely dependent on the most vulnerable sub-network under deliberate attacks, whereas random and negative coupling modes make the vulnerability of interdependent network to be mainly dependent on the being attacked sub-network. The robustness of interdependent network will be enhanced with the degree-degree correlation coefficient varying from positive to negative. Therefore, The negative coupling mode is relatively more optimal than others, which can substantially improve the robustness of the ER-ER network and ER-BA network. In terms of the attacking strategies on interdependent networks, the degree information of node is more valuable than the betweenness. In addition, we found a more efficient attacking strategy for each coupled interdependent network and proposed the corresponding protection strategy for suppressing cascading failure. Our results can be very useful for safety design and protection of interdependent networks.

  4. Efficient extraction of drainage networks from massive, radar-based elevation models with least cost path search

    Directory of Open Access Journals (Sweden)

    M. Metz

    2011-02-01

    Full Text Available The availability of both global and regional elevation datasets acquired by modern remote sensing technologies provides an opportunity to significantly improve the accuracy of stream mapping, especially in remote, hard to reach regions. Stream extraction from digital elevation models (DEMs is based on computation of flow accumulation, a summary parameter that poses performance and accuracy challenges when applied to large, noisy DEMs generated by remote sensing technologies. Robust handling of DEM depressions is essential for reliable extraction of connected drainage networks from this type of data. The least-cost flow routing method implemented in GRASS GIS as the module r.watershed was redesigned to significantly improve its speed, functionality, and memory requirements and make it an efficient tool for stream mapping and watershed analysis from large DEMs. To evaluate its handling of large depressions, typical for remote sensing derived DEMs, three different methods were compared: traditional sink filling, impact reduction approach, and least-cost path search. The comparison was performed using the Shuttle Radar Topographic Mission (SRTM and Interferometric Synthetic Aperture Radar for Elevation (IFSARE datasets covering central Panama at 90 m and 10 m resolutions, respectively. The accuracy assessment was based on ground control points acquired by GPS and reference points digitized from Landsat imagery along segments of selected Panamanian rivers. The results demonstrate that the new implementation of the least-cost path method is significantly faster than the original version, can cope with massive datasets, and provides the most accurate results in terms of stream locations validated against reference points.

  5. Modeling and Simulation of a Novel Relay Node Based Secure Routing Protocol Using Multiple Mobile Sink for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Madhumathy Perumal

    2015-01-01

    Full Text Available Data gathering and optimal path selection for wireless sensor networks (WSN using existing protocols result in collision. Increase in collision further increases the possibility of packet drop. Thus there is a necessity to eliminate collision during data aggregation. Increasing the efficiency is the need of the hour with maximum security. This paper is an effort to come up with a reliable and energy efficient WSN routing and secure protocol with minimum delay. This technique is named as relay node based secure routing protocol for multiple mobile sink (RSRPMS. This protocol finds the rendezvous point for optimal transmission of data using a “splitting tree” technique in tree-shaped network topology and then to determine all the subsequent positions of a sink the “Biased Random Walk” model is used. In case of an event, the sink gathers the data from all sources, when they are in the sensing range of rendezvous point. Otherwise relay node is selected from its neighbor to transfer packets from rendezvous point to sink. A symmetric key cryptography is used for secure transmission. The proposed relay node based secure routing protocol for multiple mobile sink (RSRPMS is experimented and simulation results are compared with Intelligent Agent-Based Routing (IAR protocol to prove that there is increase in the network lifetime compared with other routing protocols.

  6. Statistical Modeling of Large-Scale Signal Path Loss in Underwater Acoustic Networks

    Directory of Open Access Journals (Sweden)

    Manuel Perez Malumbres

    2013-02-01

    Full Text Available In an underwater acoustic channel, the propagation conditions are known to vary in time, causing the deviation of the received signal strength from the nominal value predicted by a deterministic propagation model. To facilitate a large-scale system design in such conditions (e.g., power allocation, we have developed a statistical propagation model in which the transmission loss is treated as a random variable. By applying repetitive computation to the acoustic field, using ray tracing for a set of varying environmental conditions (surface height, wave activity, small node displacements around nominal locations, etc., an ensemble of transmission losses is compiled and later used to infer the statistical model parameters. A reasonable agreement is found with log-normal distribution, whose mean obeys a log-distance increases, and whose variance appears to be constant for a certain range of inter-node distances in a given deployment location. The statistical model is deemed useful for higher-level system planning, where simulation is needed to assess the performance of candidate network protocols under various resource allocation policies, i.e., to determine the transmit power and bandwidth allocation necessary to achieve a desired level of performance (connectivity, throughput, reliability, etc..

  7. [Body image dissatisfaction as a mediator of the association between BMI, self-esteem and mental health in early adolescents: a multiple-group path analysis across gender].

    Science.gov (United States)

    Jang, Mi Heui; Lee, Gyungjoo

    2013-04-01

    This study was done to examine not only the relationships between body mass index (BMI), self-esteem, body image dissatisfaction (BID) and mental health, according to gender, but the mediating role of BID on mental health in relation to BMI and self-esteem among early adolescents. Data from 576 (296 boys and 280 girls) elementary school students in grades 5 to 6 were collected. A multiple-group path analysis was utilized to examine the relationships between BMI, self-esteem, BID and mental health by gender. In the path analysis for all students, poor mental health was related directly to BID, while it was indirectly related to BMI and self-esteem. In the multiple-group path analysis of both genders, BID was found to have a significant direct and indirect effect on mental health for girls alone. The findings suggested that BID should be examined early to prevent poor mental health in early adolescent girls. This study helps to elucidate the role of early adolescent BID on mental health and provides insight for further prevention and intervention programs in school and community mental health settings.

  8. Modeling the Liquid Water Transport in the Gas Diffusion Layer for Polymer Electrolyte Membrane Fuel Cells Using a Water Path Network

    Directory of Open Access Journals (Sweden)

    Dietmar Gerteisen

    2013-09-01

    Full Text Available In order to model the liquid water transport in the porous materials used in polymer electrolyte membrane (PEM fuel cells, the pore network models are often applied. The presented model is a novel approach to further develop these models towards a percolation model that is based on the fiber structure rather than the pore structure. The developed algorithm determines the stable liquid water paths in the gas diffusion layer (GDL structure and the transitions from the paths to the subsequent paths. The obtained water path network represents the basis for the calculation of the percolation process with low calculation efforts. A good agreement with experimental capillary pressure-saturation curves and synchrotron liquid water visualization data from other literature sources is found. The oxygen diffusivity for the GDL with liquid water saturation at breakthrough reveals that the porosity is not a crucial factor for the limiting current density. An algorithm for condensation is included into the model, which shows that condensing water is redirecting the water path in the GDL, leading to an improved oxygen diffusion by a decreased breakthrough pressure and changed saturation distribution at breakthrough.

  9. SDN-based path hopping communication against eavesdropping attack

    Science.gov (United States)

    Zhang, Chuanhao; Bu, Youjun; Zhao, Zheng

    2016-10-01

    Network eavesdropping is one of the most popular means used by cyber attackers, which has been a severe threat to network communication security. Adversaries could capture and analyze network communication data from network nodes or links, monitor network status and steal sensitive data such as username and password etc. Traditional network usually uses static network configuration, and existing defense methods, including firewall, IDS, IPS etc., cannot prevent eavesdropping, which has no distinguishing characteristic. Network eavesdropping become silent during most of the time of the attacking process, which is why it is difficult to discover and to defend. But A successful eavesdropping attack also has its' precondition, which is the target path should be relatively stable and has enough time of duration. So, In order to resolve this problem, it has to work on the network architecture. In this paper, a path hopping communication(PHC) mechanism based on Software Define Network (SDN) was proposed to solve this problem. In PHC, Ends in communication packets as well as the routing paths were changed dynamically. Therefore, the traffic would be distributed to multiple flows and transmitted along different paths. so that Network eavesdropping attack could be prevented effectively. It was concluded that PHC was able to increase the overhead of Network eavesdropping, as well as the difficulty of communication data recovery.

  10. The US Network of Pediatric Multiple Sclerosis Centers: Development, Progress, and Next Steps

    Science.gov (United States)

    Casper, T. Charles; Rose, John W.; Roalstad, Shelly; Waubant, Emmanuelle; Aaen, Gregory; Belman, Anita; Chitnis, Tanuja; Gorman, Mark; Krupp, Lauren; Lotze, Timothy E.; Ness, Jayne; Patterson, Marc; Rodriguez, Moses; Weinstock-Guttman, Bianca; Browning, Brittan; Graves, Jennifer; Tillema, Jan-Mendelt; Benson, Leslie; Harris, Yolanda

    2014-01-01

    Multiple sclerosis and other demyelinating diseases in the pediatric population have received an increasing level of attention by clinicians and researchers. The low incidence of these diseases in children creates a need for the involvement of multiple clinical centers in research efforts. The Network of Pediatric Multiple Sclerosis Centers was created initially in 2006 to improve the diagnosis and care of children with demyelinating diseases. In 2010, the Network shifted its focus to multicenter research while continuing to advance the care of patients. The Network has obtained support from the National Multiple Sclerosis Society, the Guthy-Jackson Charitable Foundation, and the National Institutes of Health. The Network will continue to serve as a platform for conducting impactful research in pediatric demyelinating diseases of the central nervous system. This article provides a description of the history and development, organization, mission, research priorities, current studies, and future plans of the Network. PMID:25270659

  11. Source and path parameters determination based on data from the digital accelerometer and CALIXTO networks to assess the seismic hazard

    International Nuclear Information System (INIS)

    Radulian, M.; Anghel, M.; Ardeleanu, L.; Bazacliu, O.; Grecu, B.; Popa, M.; Popescu, E.; Rizescu, M.

    2002-01-01

    For any strategy of seismic risk mitigation, it is essential to have a realistic description of the seismic input that means of the source and structure parameters. The present project is focused on the problem of determining accurate source and structure parameters and to analyze the way these parameters influence the seismic hazard distribution. The main objectives of the project are: determination of seismic source parameters, scaling properties, database of recent earthquakes, seismic source effects on the seismic hazard distribution, seismic attenuation, site effects, realistic scenarios for Vrancea earthquakes. To this purpose, we valorize the data provided by the instruments installed recently on the Romanian territory, in the framework of multiple international cooperation programs. Thus, a new digital accelerometer network was installed between 1996 and 1999 in cooperation with the Institute of Geophysics of the University of Karlsruhe (Germany), and an ample tomography experiment deployed for a 6-month time window (May - November 1999).The results obtained up to now refer to the determination of seismic source parameters and scaling. The source parameters are constrained using the spectral ratio technique and the seismic moment tensor inversion. The spectral ratio method is efficient when pairs of co-located earthquakes recorded at common stations are available. In this case the spectral ratio depends essentially on source only, and corrections for path, local response and instrument are not required. Another advantage of the method is the possibility to determine simultaneously source parameters for both selected events of a pair, if the instrument has a broadband frequency response and the signal/noise ratio is sufficiently high in the frequency domain of interest. The spectral ratio method is applied for 37 events, occurred between 1996 and 2000, with magnitudes between 3.0 and 5.3 in the intermediate-depth range. Seismic moment, source dimension and

  12. Time Series Analysis of Soil Radon Data Using Multiple Linear Regression and Artificial Neural Network in Seismic Precursory Studies

    Science.gov (United States)

    Singh, S.; Jaishi, H. P.; Tiwari, R. P.; Tiwari, R. C.

    2017-07-01

    This paper reports the analysis of soil radon data recorded in the seismic zone-V, located in the northeastern part of India (latitude 23.73N, longitude 92.73E). Continuous measurements of soil-gas emission along Chite fault in Mizoram (India) were carried out with the replacement of solid-state nuclear track detectors at weekly interval. The present study was done for the period from March 2013 to May 2015 using LR-115 Type II detectors, manufactured by Kodak Pathe, France. In order to reduce the influence of meteorological parameters, statistical analysis tools such as multiple linear regression and artificial neural network have been used. Decrease in radon concentration was recorded prior to some earthquakes that occurred during the observation period. Some false anomalies were also recorded which may be attributed to the ongoing crustal deformation which was not major enough to produce an earthquake.

  13. Multiple dynamical time-scales in networks with hierarchically

    Indian Academy of Sciences (India)

    Modular networks; hierarchical organization; synchronization. ... we show that such a topological structure gives rise to characteristic time-scale separation ... This suggests a possible functional role of such mesoscopic organization principle in ...

  14. CyLineUp: A Cytoscape app for visualizing data in network small multiples.

    Science.gov (United States)

    Costa, Maria Cecília D; Slijkhuis, Thijs; Ligterink, Wilco; Hilhorst, Henk W M; de Ridder, Dick; Nijveen, Harm

    2016-01-01

    CyLineUp is a Cytoscape 3 app for the projection of high-throughput measurement data from multiple experiments/samples on a network or pathway map using "small multiples". This visualization method allows for easy comparison of different experiments in the context of the network or pathway. The user can import various kinds of measurement data and select any appropriate Cytoscape network or WikiPathways pathway map. CyLineUp creates small multiples by replicating the loaded network as many times as there are experiments/samples (e.g. time points, stress conditions, tissues, etc.). The measurement data for each experiment are then mapped onto the nodes (genes, proteins etc.) of the corresponding network using a color gradient. Each step of creating the visualization can be customized to the user's needs. The results can be exported as a high quality vector image.

  15. Multi-Destination Cognitive Radio Relay Network with SWIPT and Multiple Primary Receivers

    KAUST Repository

    Al-Habob, Ahmed A.; Salhab, Anas M.; Zummo, Salam A.; Alouini, Mohamed-Slim

    2017-01-01

    In this paper, we study the performance of simultaneous wireless information and power transfer (SWIPT) technique in a multi-destination dual-hop underlay cognitive relay network with multiple primary receivers. Information transmission from

  16. Energy efficient design for MIMO two-way AF multiple relay networks

    KAUST Repository

    Alsharoa, Ahmad M.; Ghazzai, Hakim; Alouini, Mohamed-Slim

    2014-01-01

    This paper studies the energy efficient transmission and the power allocation problem for multiple two-way relay networks equipped with multi-input multi-output antennas where each relay employs an amplify-and-forward strategy. The goal

  17. Optimal power allocation of a single transmitter-multiple receivers channel in a cognitive sensor network

    KAUST Repository

    Ayala Solares, Jose Roberto; Rezki, Zouheir; Alouini, Mohamed-Slim

    2012-01-01

    The optimal transmit power of a wireless sensor network with one transmitter and multiple receivers in a cognitive radio environment while satisfying independent peak, independent average, sum of peak and sum of average transmission rate constraints

  18. A genetic algorithm for multiple relay selection in two-way relaying cognitive radio networks

    KAUST Repository

    Alsharoa, Ahmad M.; Ghazzai, Hakim; Alouini, Mohamed-Slim

    2013-01-01

    In this paper, we investigate a multiple relay selection scheme for two-way relaying cognitive radio networks where primary users and secondary users operate on the same frequency band. More specifically, cooperative relays using Amplifyand- Forward

  19. Safe design and operation of tank reactors for multiple-reaction networks: uniqueness and multiplicity

    NARCIS (Netherlands)

    Westerterp, K.R.; Westerink, E.J.

    1990-01-01

    A method is developed to design a tank reactor in which a network of reactions is carried out. The network is a combination of parallel and consecutive reactions. The method ensures unique operation. Dimensionless groups are used which are either representative of properties of the reaction system

  20. Path Dependency

    OpenAIRE

    Mark Setterfield

    2015-01-01

    Path dependency is defined, and three different specific concepts of path dependency – cumulative causation, lock in, and hysteresis – are analyzed. The relationships between path dependency and equilibrium, and path dependency and fundamental uncertainty are also discussed. Finally, a typology of dynamical systems is developed to clarify these relationships.

  1. Embedding multiple self-organisation functionalities in future radio access networks

    NARCIS (Netherlands)

    Jansen, T.; Amirijoo, M.; Türke, U.; Jorguseski, L.; Zetterberg, K.; Nascimento, J.R.V. do; Schmelz, L.C.; Turk, J.; Balan, I.

    2009-01-01

    Wireless network operators today allocate considerable manual effort in managing their networks. A viable solution for lowering the manual effort is to introduce self-organisation functionalities. In this paper we discuss the challenges that are encountered when embedding multiple self-organisation

  2. Implementing multiple intervention strategies in Dutch public health-related policy networks

    NARCIS (Netherlands)

    Harting, Janneke; Peters, Dorothee; Grêaux, Kimberly; van Assema, Patricia; Verweij, Stefan; Stronks, Karien; Klijn, Erik-Hans

    2017-01-01

    Improving public health requires multiple intervention strategies. Implementing such an intervention mix is supposed to require a multisectoral policy network. As evidence to support this assumption is scarce, we examined under which conditions public health-related policy networks were able to

  3. Heirloom biodynamic seeds network rescue, conservation and multiplication of local seeds in Brazil

    OpenAIRE

    Jovchelevich, Pedro

    2014-01-01

    Structuring a network organic and biodynamic seed involving farmers in the central- southern Brazil. Training, participatory breeding, edition of publications, fairs of exchange seeds, a processing unit and assessment of seed quality, commercial seed multiplication with emphasis on vegetables. This network has garanteed the autonomy of farmers in seed production and enriched agrobiodiversity through exchanges of seed.

  4. [Association between Emotional Labor, Emotional Dissonance, Burnout and Turnover Intention in Clinical Nurses: A Multiple-Group Path Analysis across Job Satisfaction].

    Science.gov (United States)

    Back, Chi Yun; Hyun, Dae Sung; Chang, Sei Jin

    2017-12-01

    This study was conducted to investigate the influence of emotional labor, emotional dissonance, and burnout on nurse's turnover intention and examine the effect of job satisfaction on the relationships among emotional labor, emotional dissonance, burnout, and turnover intention. The sample consisted of 350 nurses recruited from 6 general hospitals in 2 cities in Korea. A multiple-group analysis was utilized. Data were analyzed using SPSS statistics 23 and AMOS 20. In the path analysis, turnover intention was directly related to burnout in clinical nurses who had a high job satisfaction (β=.24, p=.003), while it was indirectly related to emotional dissonance (β=.13, p=.002). In the multiple-group path analysis, turnover intention was directly related to emotional dissonance (β=.18, p=.033) and burnout (β=.26, p=.002) for nurses with low job satisfaction. These results indicate that manuals and guidelines to alleviate the negative effects of emotional labor, emotional dissonance, and burnout, and to increase job satisfaction are strongly required to reduce turnover intention in nurses at the organizational level as well as at the individual level. © 2017 Korean Society of Nursing Science

  5. Actor-Network Theory and Tourism : Ordering, materiality and multiplicity

    NARCIS (Netherlands)

    Duim, van der V.R.; Ren, C.; Jóhannesson, G.T.

    2012-01-01

    The recent surfacing of actor-network theory (ANT) in tourism studies correlates to a rising interest in understanding tourism as emergent thorough relational practice connecting cultures, natures and technologies in multifarious ways. Despite the widespread application of ANT across the social

  6. Multiple Description Coding with Feedback Based Network Compression

    DEFF Research Database (Denmark)

    Sørensen, Jesper Hemming; Østergaard, Jan; Popovski, Petar

    2010-01-01

    and an intermediate node, respectively. A trade-off exists between reducing the delay of the feedback by adapting in the vicinity of the receiver and increasing the gain from compression by adapting close to the source. The analysis shows that adaptation in the network provides a better trade-off than adaptation...

  7. Adaptive Information Access on Multiple Applications Support Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Tobgay, Sonam; Olsen, Rasmus Løvenstein; Prasad, Ramjee

    2014-01-01

    information is challenged by dynamic nature of information elements. These challenges are more prominent in case of wireless sensor network (WSN) applications, as the information that the sensor node collects are mostly dynamic in nature (say, temperature). Therefore, it is likely that there can be a mismatch...

  8. Adaptive Information Access in Multiple Applications Support Wireless Sensor Network

    DEFF Research Database (Denmark)

    Tobgay, Sonam; Olsen, Rasmus Løvenstein; Prasad, Ramjee

    2012-01-01

    Nowadays, due to wide applicability of Wireless Sensor Network (WSN) added by the low cost sensor devices, its popularity among the researchers and industrialists are very much visible. A substantial amount of works can be seen in the literature on WSN which are mainly focused on application...

  9. Injectivity, multiple zeros, and multistationarity in reaction networks

    DEFF Research Database (Denmark)

    Feliu, Elisenda

    2015-01-01

    Polynomial dynamical systems are widely used to model and study real phenomena. In biochemistry, they are the preferred choice for modelling the concentration of chemical species in reaction networks with mass-action kinetics. These systems are typically parametrized by many (unknown) parameters...

  10. Default mode network links to visual hallucinations: A comparison between Parkinson's disease and multiple system atrophy.

    Science.gov (United States)

    Franciotti, Raffaella; Delli Pizzi, Stefano; Perfetti, Bernardo; Tartaro, Armando; Bonanni, Laura; Thomas, Astrid; Weis, Luca; Biundo, Roberta; Antonini, Angelo; Onofrj, Marco

    2015-08-01

    Studying default mode network activity or connectivity in different parkinsonisms, with or without visual hallucinations, could highlight its roles in clinical phenotypes' expression. Multiple system atrophy is the archetype of parkinsonism without visual hallucinations, variably appearing instead in Parkinson's disease (PD). We aimed to evaluate default mode network functions in multiple system atrophy in comparison with PD. Functional magnetic resonance imaging evaluated default mode network activity and connectivity in 15 multiple system atrophy patients, 15 healthy controls, 15 early PD patients matched for disease duration, 30 severe PD patients (15 with and 15 without visual hallucinations), matched with multiple system atrophy for disease severity. Cortical thickness and neuropsychological evaluations were also performed. Multiple system atrophy had reduced default mode network activity compared with controls and PD with hallucinations, and no differences with PD (early or severe) without hallucinations. In PD with visual hallucinations, activity and connectivity was preserved compared with controls and higher than in other groups. In early PD, connectivity was lower than in controls but higher than in multiple system atrophy and severe PD without hallucinations. Cortical thickness was reduced in severe PD, with and without hallucinations, and correlated only with disease duration. Higher anxiety scores were found in patients without hallucinations. Default mode network activity and connectivity was higher in PD with visual hallucinations and reduced in multiple system atrophy and PD without visual hallucinations. Cortical thickness comparisons suggest that functional, rather than structural, changes underlie the activity and connectivity differences. © 2015 International Parkinson and Movement Disorder Society.

  11. Networks in Argentine agriculture: a multiple-case study approach

    Directory of Open Access Journals (Sweden)

    Sebastián Senesi

    2013-06-01

    Full Text Available Argentina is among the four largest producers of soybeans, sunflower, corn, and wheat, among other agricultural products. Institutional and policy changes during the 1990s fostered the development of Argentine agriculture and the introduction of innovative process and product technologies (no-till, agrochemicals, GMO, GPS and new investments in modern, large-scale sunflower and soybean processing plants. In addition to technological changes, a "quiet revolution" occurred in the way agricultural production was carried out and organized: from self-production or ownership agriculture to a contract-based agriculture. The objective of this paper is to explore and describe the emergence of networks in the Argentine crop production sector. The paper presents and describes four cases that currently represent about 50% of total grain and oilseed production in Argentina: "informal hybrid form", "agricultural trust fund", "investor-oriented corporate structure", and "network of networks". In all cases, hybrid forms involve a group of actors linked by common objectives, mainly to gain scale, share resources, and improve the profitability of the business. Informal contracts seem to be the most common way of organizing the agriculture process, but using short-term contracts and sequential interfirm collaboration. Networks of networks involve long-term relationships and social development, and reciprocal interfirm collaboration. Agricultural trust fund and investor-oriented corporate structures have combined interfirm collaboration and medium-term relationships. These organizational forms are highly flexible and show a great capacity to adapt to challenges; they are competitive because they enjoy aligned incentives, flexibility, and adaptability.

  12. Using Multiple Paths in NoCs for Guaranteed Resource Allocation and Improved Best Effort Performance in NoCs.

    NARCIS (Netherlands)

    Ovadia, I.; Ha, Y.; Corporaal, H.

    2005-01-01

    Networks-on-Chips (NoCs) provide communication platforms to Systems-on-Chips (SoCs). In NoCs, channels are generally shared between traffic flows, resulting in contention. However, certain flows require delivery guarantees. Differentiated quality-of-service (QoS) is achieved by providing guaranteed

  13. Relative camera localisation in non-overlapping camera networks using multiple trajectories

    NARCIS (Netherlands)

    John, V.; Englebienne, G.; Kröse, B.J.A.

    2012-01-01

    In this article we present an automatic camera calibration algorithm using multiple trajectories in a multiple camera network with non-overlapping field-of-views (FOV). Visible trajectories within a camera FOV are assumed to be measured with respect to the camera local co-ordinate system.

  14. Serial network simplifies the design of multiple microcomputer systems

    Energy Technology Data Exchange (ETDEWEB)

    Folkes, D.

    1981-01-01

    Recently there has been a lot of interest in developing network communication schemes for carrying digital data between locally distributed computing stations. Many of these schemes have focused on distributed networking techniques for data processing applications. These applications suggest the use of a serial, multipoint bus, where a number of remote intelligent units act as slaves to a central or host computer. Each slave would be serially addressable from the host and would perform required operations upon being addressed by the host. Based on an MK3873 single-chip microcomputer, the SCU 20 is designed to be such a remote slave device. The capabilities of the SCU 20 and its use in systems applications are examined.

  15. Software-defined networking control plane for seamless integration of multiple silicon photonic switches in Datacom networks.

    Science.gov (United States)

    Shen, Yiwen; Hattink, Maarten H N; Samadi, Payman; Cheng, Qixiang; Hu, Ziyiz; Gazman, Alexander; Bergman, Keren

    2018-04-16

    Silicon photonics based switches offer an effective option for the delivery of dynamic bandwidth for future large-scale Datacom systems while maintaining scalable energy efficiency. The integration of a silicon photonics-based optical switching fabric within electronic Datacom architectures requires novel network topologies and arbitration strategies to effectively manage the active elements in the network. We present a scalable software-defined networking control plane to integrate silicon photonic based switches with conventional Ethernet or InfiniBand networks. Our software-defined control plane manages both electronic packet switches and multiple silicon photonic switches for simultaneous packet and circuit switching. We built an experimental Dragonfly network testbed with 16 electronic packet switches and 2 silicon photonic switches to evaluate our control plane. Observed latencies occupied by each step of the switching procedure demonstrate a total of 344 µs control plane latency for data-center and high performance computing platforms.

  16. Pareto evolution of gene networks: an algorithm to optimize multiple fitness objectives

    International Nuclear Information System (INIS)

    Warmflash, Aryeh; Siggia, Eric D; Francois, Paul

    2012-01-01

    The computational evolution of gene networks functions like a forward genetic screen to generate, without preconceptions, all networks that can be assembled from a defined list of parts to implement a given function. Frequently networks are subject to multiple design criteria that cannot all be optimized simultaneously. To explore how these tradeoffs interact with evolution, we implement Pareto optimization in the context of gene network evolution. In response to a temporal pulse of a signal, we evolve networks whose output turns on slowly after the pulse begins, and shuts down rapidly when the pulse terminates. The best performing networks under our conditions do not fall into categories such as feed forward and negative feedback that also encode the input–output relation we used for selection. Pareto evolution can more efficiently search the space of networks than optimization based on a single ad hoc combination of the design criteria. (paper)

  17. Pareto evolution of gene networks: an algorithm to optimize multiple fitness objectives.

    Science.gov (United States)

    Warmflash, Aryeh; Francois, Paul; Siggia, Eric D

    2012-10-01

    The computational evolution of gene networks functions like a forward genetic screen to generate, without preconceptions, all networks that can be assembled from a defined list of parts to implement a given function. Frequently networks are subject to multiple design criteria that cannot all be optimized simultaneously. To explore how these tradeoffs interact with evolution, we implement Pareto optimization in the context of gene network evolution. In response to a temporal pulse of a signal, we evolve networks whose output turns on slowly after the pulse begins, and shuts down rapidly when the pulse terminates. The best performing networks under our conditions do not fall into categories such as feed forward and negative feedback that also encode the input-output relation we used for selection. Pareto evolution can more efficiently search the space of networks than optimization based on a single ad hoc combination of the design criteria.

  18. Adaptation of AMO-FBMC-OQAM in optical access network for accommodating asynchronous multiple access in OFDM-based uplink transmission

    Science.gov (United States)

    Jung, Sun-Young; Jung, Sang-Min; Han, Sang-Kook

    2015-01-01

    Exponentially expanding various applications in company with proliferation of mobile devices make mobile traffic exploded annually. For future access network, bandwidth efficient and asynchronous signals converged transmission technique is required in optical network to meet a huge bandwidth demand, while integrating various services and satisfying multiple access in perceived network resource. Orthogonal frequency division multiplexing (OFDM) is highly bandwidth efficient parallel transmission technique based on orthogonal subcarriers. OFDM has been widely studied in wired-/wireless communication and became a Long term evolution (LTE) standard. Consequently, OFDM also has been actively researched in optical network. However, OFDM is vulnerable frequency and phase offset essentially because of its sinc-shaped side lobes, therefore tight synchronism is necessary to maintain orthogonality. Moreover, redundant cyclic prefix (CP) is required in dispersive channel. Additionally, side lobes act as interference among users in multiple access. Thus, it practically hinders from supporting integration of various services and multiple access based on OFDM optical transmission In this paper, adaptively modulated optical filter bank multicarrier system with offset QAM (AMO-FBMC-OQAM) is introduced and experimentally investigated in uplink optical transmission to relax multiple access interference (MAI), while improving bandwidth efficiency. Side lobes are effectively suppressed by using FBMC, therefore the system becomes robust to path difference and imbalance among optical network units (ONUs), which increase bandwidth efficiency by reducing redundancy. In comparison with OFDM, a signal performance and an efficiency of frequency utilization are improved in the same experimental condition. It enables optical network to effectively support heterogeneous services and multiple access.

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

    Science.gov (United States)

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

    2015-12-01

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

  20. Position paper: cognitive radio networking for multiple sensor network interoperability in mines

    CSIR Research Space (South Africa)

    Kagize, BM

    2008-01-01

    Full Text Available . These commercially available networks are purported to be self-organizing and self correcting, though the software behind these networks are proprietary with the caveat of inter-operability difficulties with other networks [5]. There is a non-propriety and open...: Research challenges,” - Ad Hoc Networks, 2006 – Elsevier [4] V Mhatre, C Rosenberg, “Homogeneous vs heterogeneous clustered sensor networks: a comparative study,” - Communications, 2004 IEEE International Conference on, 2004 - ieeexplore.ieee.org [5...

  1. Modified-hybrid optical neural network filter for multiple object recognition within cluttered scenes

    Science.gov (United States)

    Kypraios, Ioannis; Young, Rupert C. D.; Chatwin, Chris R.

    2009-08-01

    Motivated by the non-linear interpolation and generalization abilities of the hybrid optical neural network filter between the reference and non-reference images of the true-class object we designed the modifiedhybrid optical neural network filter. We applied an optical mask to the hybrid optical neural network's filter input. The mask was built with the constant weight connections of a randomly chosen image included in the training set. The resulted design of the modified-hybrid optical neural network filter is optimized for performing best in cluttered scenes of the true-class object. Due to the shift invariance properties inherited by its correlator unit the filter can accommodate multiple objects of the same class to be detected within an input cluttered image. Additionally, the architecture of the neural network unit of the general hybrid optical neural network filter allows the recognition of multiple objects of different classes within the input cluttered image by modifying the output layer of the unit. We test the modified-hybrid optical neural network filter for multiple objects of the same and of different classes' recognition within cluttered input images and video sequences of cluttered scenes. The filter is shown to exhibit with a single pass over the input data simultaneously out-of-plane rotation, shift invariance and good clutter tolerance. It is able to successfully detect and classify correctly the true-class objects within background clutter for which there has been no previous training.

  2. Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees.

    Science.gov (United States)

    Mirzaei, Sajad; Wu, Yufeng

    2016-01-01

    Hybridization networks represent plausible evolutionary histories of species that are affected by reticulate evolutionary processes. An established computational problem on hybridization networks is constructing the most parsimonious hybridization network such that each of the given phylogenetic trees (called gene trees) is "displayed" in the network. There have been several previous approaches, including an exact method and several heuristics, for this NP-hard problem. However, the exact method is only applicable to a limited range of data, and heuristic methods can be less accurate and also slow sometimes. In this paper, we develop a new algorithm for constructing near parsimonious networks for multiple binary gene trees. This method is more efficient for large numbers of gene trees than previous heuristics. This new method also produces more parsimonious results on many simulated datasets as well as a real biological dataset than a previous method. We also show that our method produces topologically more accurate networks for many datasets.

  3. Lifetime Optimization of a Multiple Sink Wireless Sensor Network through Energy Balancing

    Directory of Open Access Journals (Sweden)

    Tapan Kumar Jain

    2015-01-01

    Full Text Available The wireless sensor network consists of small limited energy sensors which are connected to one or more sinks. The maximum energy consumption takes place in communicating the data from the nodes to the sink. Multiple sink WSN has an edge over the single sink WSN where very less energy is utilized in sending the data to the sink, as the number of hops is reduced. If the energy consumed by a node is balanced between the other nodes, the lifetime of the network is considerably increased. The network lifetime optimization is achieved by restructuring the network by modifying the neighbor nodes of a sink. Only those nodes are connected to a sink which makes the total energy of the sink less than the threshold. This energy balancing through network restructuring optimizes the network lifetime. This paper depicts this fact through simulations done in MATLAB.

  4. Beamspace Multiple Input Multiple Output. Part II: Steerable Antennas in Mobile Ad Hoc Networks

    Science.gov (United States)

    2016-09-01

    to the transmitter with half the channel transfer function power , since the actual receiver dwells on each channel only half the time. Fourth diagram...steering in a wireless network to maximize signal power and minimize interference [8–10]. The ability to switch beams adds another diversity dimension to...channel transfer function power , since the actual receiver dwells on each channel only half the time. Fourth diagram: The transmit array sends four

  5. Study on multiple-hops performance of MOOC sequences-based optical labels for OPS networks

    Science.gov (United States)

    Zhang, Chongfu; Qiu, Kun; Ma, Chunli

    2009-11-01

    In this paper, we utilize a new study method that is under independent case of multiple optical orthogonal codes to derive the probability function of MOOCS-OPS networks, discuss the performance characteristics for a variety of parameters, and compare some characteristics of the system employed by single optical orthogonal code or multiple optical orthogonal codes sequences-based optical labels. The performance of the system is also calculated, and our results verify that the method is effective. Additionally it is found that performance of MOOCS-OPS networks would, negatively, be worsened, compared with single optical orthogonal code-based optical label for optical packet switching (SOOC-OPS); however, MOOCS-OPS networks can greatly enlarge the scalability of optical packet switching networks.

  6. Augmented lagrange hopfield network for economic dispatch with multiple fuel options

    International Nuclear Information System (INIS)

    Dieu, Vo Ngoc; Ongsakul, Weerakorn; Polprasert, Jirawadee

    2011-01-01

    This paper proposes an augmented Lagrange Hopfield network (ALHN) for solving economic dispatch (ED) problem with multiple fuel options. The proposed ALHN method is a continuous Hopfield neural network with its energy function based on augmented Lagrangian function. The advantages of ALHN over the conventional Hopfield neural network are easier use, more general applications, faster convergence, better optimal solution, and larger scale of problem implementation. The method solves the problem by directly searching the most suitable fuel among the available fuels of each unit and finding the optimal solution for the problem based on minimization of the energy function of the continuous Hopfield neural network. The proposed method is tested on systems up to 100 units and the obtained results are compared to those from other methods in the literature. The results have shown that the proposed method is efficient for solving the ED problem with multiple fuel options and favorable for implementation in large scale problems.

  7. Implementing multiple intervention strategies in Dutch public health-related policy networks.

    Science.gov (United States)

    Harting, Janneke; Peters, Dorothee; Grêaux, Kimberly; van Assema, Patricia; Verweij, Stefan; Stronks, Karien; Klijn, Erik-Hans

    2017-10-13

    Improving public health requires multiple intervention strategies. Implementing such an intervention mix is supposed to require a multisectoral policy network. As evidence to support this assumption is scarce, we examined under which conditions public health-related policy networks were able to implement an intervention mix. Data were collected (2009-14) from 29 Dutch public health policy networks. Surveys were used to identify the number of policy sectors, participation of actors, level of trust, networking by the project leader, and intervention strategies implemented. Conditions sufficient for an intervention mix (≥3 of 4 non-educational strategies present) were determined in a fuzzy-set qualitative comparative analysis. A multisectoral policy network (≥7 of 14 sectors present) was neither a necessary nor a sufficient condition. In multisectoral networks, additionally required was either the active participation of network actors (≥50% actively involved) or active networking by the project leader (≥monthly contacts with network actors). In policy networks that included few sectors, a high level of trust (positive perceptions of each other's intentions) was needed-in the absence though of any of the other conditions. If the network actors were also actively involved, an extra requirement was active networking by the project leader. We conclude that the multisectoral composition of policy networks can contribute to the implementation of a variety of intervention strategies, but not without additional efforts. However, policy networks that include only few sectors are also able to implement an intervention mix. Here, trust seems to be the most important condition. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

  8. Comparison of a Ring On-Chip Network and a Code-Division Multiple-Access On-Chip Network

    Directory of Open Access Journals (Sweden)

    Xin Wang

    2007-01-01

    Full Text Available Two network-on-chip (NoC designs are examined and compared in this paper. One design applies a bidirectional ring connection scheme, while the other design applies a code-division multiple-access (CDMA connection scheme. Both of the designs apply globally asynchronous locally synchronous (GALS scheme in order to deal with the issue of transferring data in a multiple-clock-domain environment of an on-chip system. The two NoC designs are compared with each other by their network structures, data transfer principles, network node structures, and their asynchronous designs. Both the synchronous and the asynchronous designs of the two on-chip networks are realized using a hardware-description language (HDL in order to make the entire designs suit the commonly used synchronous design tools and flow. The performance estimation and comparison of the two NoC designs which are based on the HDL realizations are addressed. By comparing the two NoC designs, the advantages and disadvantages of applying direct connection and CDMA connection schemes in an on-chip communication network are discussed.

  9. Nonadditivity of quantum capacities of quantum multiple-access channels and the butterfly network

    International Nuclear Information System (INIS)

    Huang Peng; He Guangqiang; Zhu Jun; Zeng Guihua

    2011-01-01

    Multipartite quantum information transmission without additional classical resources is investigated. We show purely quantum superadditivity of quantum capacity regions of quantum memoryless multiple-access (MA) channels, which are not entanglement breaking. Also, we find that the superadditivity holds when the MA channel extends to the quantum butterfly network, which can achieve quantum network coding. The present widespread effects for the channels which enable entanglement distribution have not been revealed for multipartite scenarios.

  10. Global exponential stability for reaction-diffusion recurrent neural networks with multiple time varying delays

    International Nuclear Information System (INIS)

    Lou, X.; Cui, B.

    2008-01-01

    In this paper we consider the problem of exponential stability for recurrent neural networks with multiple time varying delays and reaction-diffusion terms. The activation functions are supposed to be bounded and globally Lipschitz continuous. By means of Lyapunov functional, sufficient conditions are derived, which guarantee global exponential stability of the delayed neural network. Finally, a numerical example is given to show the correctness of our analysis. (author)

  11. Robustness Assessment of Urban Road Network with Consideration of Multiple Hazard Events.

    Science.gov (United States)

    Zhou, Yaoming; Sheu, Jiuh-Biing; Wang, Junwei

    2017-08-01

    Robustness measures a system's ability of being insensitive to disturbances. Previous studies assessed the robustness of transportation networks to a single disturbance without considering simultaneously happening multiple events. The purpose of this article is to address this problem and propose a new framework to assess the robustness of an urban transportation network. The framework consists of two layers. The upper layer is to define the robustness index based on the impact evaluation in different scenarios obtained from the lower layer, whereas the lower layer is to evaluate the performance of each hypothetical disrupted road network given by the upper layer. The upper layer has two varieties, that is, robustness against random failure and robustness against intentional attacks. This robustness measurement framework is validated by application to a real-world urban road network in Hong Kong. The results show that the robustness of a transport network with consideration of multiple events is quite different from and more comprehensive than that with consideration of only a single disruption. We also propose a Monte Carlo method and a heuristic algorithm to handle different scenarios with multiple hazard events, which is proved to be quite efficient. This methodology can also be applied to conduct risk analysis of other systems where multiple failures or disruptions exist. © 2017 Society for Risk Analysis.

  12. Multivariate Multiple Regression Models for a Big Data-Empowered SON Framework in Mobile Wireless Networks

    Directory of Open Access Journals (Sweden)

    Yoonsu Shin

    2016-01-01

    Full Text Available In the 5G era, the operational cost of mobile wireless networks will significantly increase. Further, massive network capacity and zero latency will be needed because everything will be connected to mobile networks. Thus, self-organizing networks (SON are needed, which expedite automatic operation of mobile wireless networks, but have challenges to satisfy the 5G requirements. Therefore, researchers have proposed a framework to empower SON using big data. The recent framework of a big data-empowered SON analyzes the relationship between key performance indicators (KPIs and related network parameters (NPs using machine-learning tools, and it develops regression models using a Gaussian process with those parameters. The problem, however, is that the methods of finding the NPs related to the KPIs differ individually. Moreover, the Gaussian process regression model cannot determine the relationship between a KPI and its various related NPs. In this paper, to solve these problems, we proposed multivariate multiple regression models to determine the relationship between various KPIs and NPs. If we assume one KPI and multiple NPs as one set, the proposed models help us process multiple sets at one time. Also, we can find out whether some KPIs are conflicting or not. We implement the proposed models using MapReduce.

  13. A Comparison of the Cluster-Span Threshold and the Union of Shortest Paths as Objective Thresholds of EEG Functional Connectivity Networks from Beta Activity in Alzhaimer’s Disease

    OpenAIRE

    Smith, K; Abasolo, Daniel Emilio; Escudero, J

    2016-01-01

    The Cluster-Span Threshold (CST) is a recently introduced unbiased threshold for functional connectivity networks. This binarisation technique offers a natural trade-off of sparsity and density of information by balancing the ratio of closed to open triples in the network topology. Here we present findings comparing it with the Union of Shortest Paths (USP), another recently proposed objective method. We analyse standard network metrics of binarised networks for sensitivity to clinical Alzhei...

  14. Performance analysis of quantum access network using code division multiple access model

    International Nuclear Information System (INIS)

    Hu Linxi; Yang Can; He Guangqiang

    2017-01-01

    A quantum access network has been implemented by frequency division multiple access and time division multiple access, while code division multiple access is limited for its difficulty to realize the orthogonality of the code. Recently, the chaotic phase shifters were proposed to guarantee the orthogonality by different chaotic signals and spread the spectral content of the quantum states. In this letter, we propose to implement the code division multiple access quantum network by using chaotic phase shifters and synchronization. Due to the orthogonality of the different chaotic phase shifter, every pair of users can faithfully transmit quantum information through a common channel and have little crosstalk between different users. Meanwhile, the broadband spectra of chaotic signals efficiently help the quantum states to defend against channel loss and noise. (paper)

  15. A Multiple Mobility Support Approach (MMSA Based on PEAS for NCW in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Bong-Joo Koo

    2011-01-01

    Full Text Available Wireless Sensor Networks (WSNs can be implemented as one of sensor systems in Network Centric Warfare (NCW. Mobility support and energy efficiency are key concerns for this application, due to multiple mobile users and stimuli in real combat field. However, mobility support approaches that can be adopted in this circumstance are rare. This paper proposes Multiple Mobility Support Approach (MMSA based on Probing Environment and Adaptive Sleeping (PEAS to support the simultaneous mobility of both multiple users and stimuli by sharing the information of stimuli in WSNs. Simulations using Qualnet are conducted, showing that MMSA can support multiple mobile users and stimuli with good energy efficiency. It is expected that the proposed MMSA can be applied to real combat field.

  16. Network Events on Multiple Space and Time Scales in Cultured Neural Networks and in a Stochastic Rate Model.

    Directory of Open Access Journals (Sweden)

    Guido Gigante

    2015-11-01

    Full Text Available Cortical networks, in-vitro as well as in-vivo, can spontaneously generate a variety of collective dynamical events such as network spikes, UP and DOWN states, global oscillations, and avalanches. Though each of them has been variously recognized in previous works as expression of the excitability of the cortical tissue and the associated nonlinear dynamics, a unified picture of the determinant factors (dynamical and architectural is desirable and not yet available. Progress has also been partially hindered by the use of a variety of statistical measures to define the network events of interest. We propose here a common probabilistic definition of network events that, applied to the firing activity of cultured neural networks, highlights the co-occurrence of network spikes, power-law distributed avalanches, and exponentially distributed 'quasi-orbits', which offer a third type of collective behavior. A rate model, including synaptic excitation and inhibition with no imposed topology, synaptic short-term depression, and finite-size noise, accounts for all these different, coexisting phenomena. We find that their emergence is largely regulated by the proximity to an oscillatory instability of the dynamics, where the non-linear excitable behavior leads to a self-amplification of activity fluctuations over a wide range of scales in space and time. In this sense, the cultured network dynamics is compatible with an excitation-inhibition balance corresponding to a slightly sub-critical regime. Finally, we propose and test a method to infer the characteristic time of the fatigue process, from the observed time course of the network's firing rate. Unlike the model, possessing a single fatigue mechanism, the cultured network appears to show multiple time scales, signalling the possible coexistence of different fatigue mechanisms.

  17. Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast

    Directory of Open Access Journals (Sweden)

    Matsumoto Ryutaroh

    2010-01-01

    Full Text Available We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio of the minimum energy required by routing and network coding solutions, where the maximum is over all configurations. It is shown that if coding and routing solutions are using the same transmission range, the benefit in d-dimensional networks is at least . Moreover, it is shown that if the transmission range can be optimized for routing and coding individually, the benefit in 2-dimensional networks is at least 3. Our results imply that codes following a decode-and-recombine strategy are not always optimal regarding energy efficiency.

  18. The Health Action Process Approach as a motivational model for physical activity self-management for people with multiple sclerosis: a path analysis.

    Science.gov (United States)

    Chiu, Chung-Yi; Lynch, Ruth T; Chan, Fong; Berven, Norman L

    2011-08-01

    To evaluate the Health Action Process Approach (HAPA) as a motivational model for physical activity self-management for people with multiple sclerosis (MS). Quantitative descriptive research design using path analysis. One hundred ninety-five individuals with MS were recruited from the National Multiple Sclerosis Society and a neurology clinic at a university teaching hospital in the Midwest. Outcome was measured by the Physical Activity Stages of Change Instrument, along with measures for nine predictors (severity, action self-efficacy, outcome expectancy, risk perception, perceived barriers, intention, maintenance self-efficacy, action and coping planning, and recovery self-efficacy). The respecified HAPA physical activity model fit the data relatively well (goodness-of-fit index = .92, normed fit index = .91, and comparative fit index = .93) explaining 38% of the variance in physical activity. Recovery self-efficacy, action and coping planning, and perceived barriers directly contributed to the prediction of physical activity. Outcome expectancy significantly influenced intention and the relationship between intention and physical activity is mediated by action and coping planning. Action self-efficacy, maintenance self-efficacy, and recovery self-efficacy directly or indirectly affected physical activity. Severity of MS and action self-efficacy had an inverse relationship with perceived barriers and perceived barriers influenced physical activity. Empirical support was found for the proposed HAPA model of physical activity for people with MS. The HAPA model appears to provide useful information for clinical rehabilitation and health promotion interventions.

  19. An energy efficient distance-aware routing algorithm with multiple mobile sinks for wireless sensor networks.

    Science.gov (United States)

    Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk

    2014-08-18

    Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.

  20. An Energy Efficient Distance-Aware Routing Algorithm with Multiple Mobile Sinks for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jin Wang

    2014-08-01

    Full Text Available Traffic patterns in wireless sensor networks (WSNs usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.

  1. Path Expressions

    Science.gov (United States)

    1975-06-01

    Traditionally, synchronization of concurrent processes is coded in line by operations on semaphores or similar objects. Path expressions move the...discussion about a variety of synchronization primitives . An analysis of their relative power is found in [3]. Path expressions do not introduce yet...another synchronization primitive . A path expression relates to such primitives as a for- or while-statement of an ALGOL-like language relates to a JUMP

  2. Partial Interference and Its Performance Impact on Wireless Multiple Access Networks

    Directory of Open Access Journals (Sweden)

    Lau WingCheong

    2010-01-01

    Full Text Available To determine the capacity of wireless multiple access networks, the interference among the wireless links must be accurately modeled. In this paper, we formalize the notion of the partial interference phenomenon observed in many recent wireless measurement studies and establish analytical models with tractable solutions for various types of wireless multiple access networks. In particular, we characterize the stability region of IEEE 802.11 networks under partial interference with two potentially unsaturated links numerically. We also provide a closed-form solution for the stability region of slotted ALOHA networks under partial interference with two potentially unsaturated links and obtain a partial characterization of the boundary of the stability region for the general M-link case. Finally, we derive a closed-form approximated solution for the stability region for general M-link slotted ALOHA system under partial interference effects. Based on our results, we demonstrate that it is important to model the partial interference effects while analyzing wireless multiple access networks. This is because such considerations can result in not only significant quantitative differences in the predicted system capacity but also fundamental qualitative changes in the shape of the stability region of the systems.

  3. Report from the European myeloma network on interphase FISH in multiple myeloma and related disorders

    NARCIS (Netherlands)

    F. Ross (F.); H. Avet-Loiseau; G. Ameye (Geneviève); N. Gutierrez (Norma); G. Liebisch (Gerhard); S. O'Connor (Sheila); K. Dalva (Klara); F. Fabris (Federica Margherita); A.M. Testi (Adele); M. Jarosova (M.); C. Hodkinson (Clare); A. Collin (Anna); G. Kerndrup (Gitte); P. Kuglik (Petr); D. Ladon (Dariusz); P. Bernasconi (Paolo); B. Maes (Bart); Z. Zemanova (Zuzana); K. Michalova (Kyra); L. Michau (Lucienne); K. Neben (Kai); N.E.U. Hermansen (N. Emil); K. Rack (Katrina); A. Rocci (Alberto); R. Protheroe (Rebecca); L. Chiecchio (Laura); H.A. Poirel (Hélène A); P. Sonneveld (Pieter); M. Nyegaard (M.); H.E. Johnsen (Hans)

    2012-01-01

    textabstractThe European Myeloma Network has organized two workshops on fluorescence in situ hybridization in multiple myeloma. The first aimed to identify specific indications and consensus technical approaches of current practice. A second workshop followed a quality control exercise in which 21

  4. Multiple Distributed Smart Microgrids with a Self-Autonomous, Energy Harvesting Wireless Sensor Network

    DEFF Research Database (Denmark)

    Guerrero, Josep M.; Kheng Tan, Yen

    2012-01-01

    The chapter covers the smart wireless sensors for microgrids, as well as the energy harvesting technology used to sustain the operations of these sensors. Last, a case study on the multiple distributed smart microgrids with a self-autonomous, energy harvesting wireless sensor network is presented....

  5. Multiple-state based power control for multi-radio multi-channel wireless mesh networks

    CSIR Research Space (South Africa)

    Olwal, TO

    2009-01-01

    Full Text Available Multi-Radio Multi-Channel (MRMC) systems are key to power control problems in wireless mesh networks (WMNs). In this paper, we present asynchronous multiple-state based power control for MRMC WMNs. First, WMN is represented as a set of disjoint...

  6. Knowledge-Based Multiple Access Protocol in Broadband Wireless ATM Networks

    DEFF Research Database (Denmark)

    Liu, Hong; Gliese, Ulrik Bo; Dittmann, Lars

    1999-01-01

    In this paper, we propose a knowledge-based multiple access protocol for the extension of wireline ATM to wireless networks. The objective is to enable effecient transmission of all kinds of ATM traffic in the wireless channel with guaranteed QoS.The proposed protocol utilixes knowledge of the main...... guaranteed QoS requirements to a variety of ATM applications....

  7. Exploiting deep neural networks and head movements for binaural localisation of multiple speakers in reverberant conditions

    DEFF Research Database (Denmark)

    Ma, Ning; Brown, Guy J.; May, Tobias

    2015-01-01

    This paper presents a novel machine-hearing system that exploits deep neural networks (DNNs) and head movements for binaural localisation of multiple speakers in reverberant conditions. DNNs are used to map binaural features, consisting of the complete crosscorrelation function (CCF) and interaural...

  8. Disruption of Structural and Functional Networks in Long-Standing Multiple Sclerosis

    NARCIS (Netherlands)

    Tewarie, P.; Steenwijk, M.D.; Tijms, B.M.; Daams, M.; Balk, L.J.; Stam, C.J.; Uitdehaag, B.M.J.; Polman, C.H.; Geurts, J.J.G.; Barkhof, F.; Pouwels, P.J.W.; Vrenken, H.; Hillebrand, A.

    2014-01-01

    Both gray matter atrophy and disruption of functional networks are important predictors for physical disability and cognitive impairment in multiple sclerosis (MS), yet their relationship is poorly understood. Graph theory provides a modality invariant framework to analyze patterns of gray matter

  9. Robustness analysis of uncertain dynamical neural networks with multiple time delays.

    Science.gov (United States)

    Senan, Sibel

    2015-10-01

    This paper studies the problem of global robust asymptotic stability of the equilibrium point for the class of dynamical neural networks with multiple time delays with respect to the class of slope-bounded activation functions and in the presence of the uncertainties of system parameters of the considered neural network model. By using an appropriate Lyapunov functional and exploiting the properties of the homeomorphism mapping theorem, we derive a new sufficient condition for the existence, uniqueness and global robust asymptotic stability of the equilibrium point for the class of neural networks with multiple time delays. The obtained stability condition basically relies on testing some relationships imposed on the interconnection matrices of the neural system, which can be easily verified by using some certain properties of matrices. An instructive numerical example is also given to illustrate the applicability of our result and show the advantages of this new condition over the previously reported corresponding results. Copyright © 2015 Elsevier Ltd. All rights reserved.

  10. Performance of an opportunistic multi-user cognitive network with multiple primary users

    KAUST Repository

    Khan, Fahd Ahmed

    2014-04-01

    Consider a multi-user underlay cognitive network where multiple cognitive users, having limited peak transmit power, concurrently share the spectrum with a primary network with multiple users. The channel between the secondary network is assumed to have independent but not identical Nakagami-m fading. The interference channel between the secondary users and the primary users is assumed to have Rayleigh fading. The uplink scenario is considered where a single secondary user is selected for transmission. This opportunistic selection depends on the transmission channel power gain and the interference channel power gain as well as the power allocation policy adopted at the users. Exact closed form expressions for the momentgenerating function, outage performance and the symbol-error-rate performance are derived. The outage performance is also studied in the asymptotic regimes and the generalized diversity gain of this scheduling scheme is derived. Numerical results corroborate the derived analytical results.

  11. Unravelling Darwin's entangled bank: architecture and robustness of mutualistic networks with multiple interaction types.

    Science.gov (United States)

    Dáttilo, Wesley; Lara-Rodríguez, Nubia; Jordano, Pedro; Guimarães, Paulo R; Thompson, John N; Marquis, Robert J; Medeiros, Lucas P; Ortiz-Pulido, Raul; Marcos-García, Maria A; Rico-Gray, Victor

    2016-11-30

    Trying to unravel Darwin's entangled bank further, we describe the architecture of a network involving multiple forms of mutualism (pollination by animals, seed dispersal by birds and plant protection by ants) and evaluate whether this multi-network shows evidence of a structure that promotes robustness. We found that species differed strongly in their contributions to the organization of the multi-interaction network, and that only a few species contributed to the structuring of these patterns. Moreover, we observed that the multi-interaction networks did not enhance community robustness compared with each of the three independent mutualistic networks when analysed across a range of simulated scenarios of species extinction. By simulating the removal of highly interacting species, we observed that, overall, these species enhance network nestedness and robustness, but decrease modularity. We discuss how the organization of interlinked mutualistic networks may be essential for the maintenance of ecological communities, and therefore the long-term ecological and evolutionary dynamics of interactive, species-rich communities. We suggest that conserving these keystone mutualists and their interactions is crucial to the persistence of species-rich mutualistic assemblages, mainly because they support other species and shape the network organization. © 2016 The Author(s).

  12. DETECTION AND LOCALIZATION OF MULTIPLE SPOOFING ATTACKERS FOR MOBILE WIRELESS NETWORKS

    Directory of Open Access Journals (Sweden)

    R. Maivizhi

    2015-06-01

    Full Text Available The openness nature of wireless networks allows adversaries to easily launch variety of spoofing attacks and causes havoc in network performance. Recent approaches used Received Signal Strength (RSS traces, which only detect spoofing attacks in mobile wireless networks. However, it is not always desirable to use these methods as RSS values fluctuate significantly over time due to distance, noise and interference. In this paper, we discusses a novel approach, Mobile spOofing attack DEtection and Localization in WIireless Networks (MODELWIN system, which exploits location information about nodes to detect identity-based spoofing attacks in mobile wireless networks. Also, this approach determines the number of attackers who used the same node identity to masquerade as legitimate device. Moreover, multiple adversaries can be localized accurately. By eliminating attackers the proposed system enhances network performance. We have evaluated our technique through simulation using an 802.11 (WiFi network and an 802.15.4 (Zigbee networks. The results prove that MODELWIN can detect spoofing attacks with a very high detection rate and localize adversaries accurately.

  13. A Context-Aware Adaptive Streaming Media Distribution System in a Heterogeneous Network with Multiple Terminals

    Directory of Open Access Journals (Sweden)

    Yepeng Ni

    2016-01-01

    Full Text Available We consider the problem of streaming media transmission in a heterogeneous network from a multisource server to home multiple terminals. In wired network, the transmission performance is limited by network state (e.g., the bandwidth variation, jitter, and packet loss. In wireless network, the multiple user terminals can cause bandwidth competition. Thus, the streaming media distribution in a heterogeneous network becomes a severe challenge which is critical for QoS guarantee. In this paper, we propose a context-aware adaptive streaming media distribution system (CAASS, which implements the context-aware module to perceive the environment parameters and use the strategy analysis (SA module to deduce the most suitable service level. This approach is able to improve the video quality for guarantying streaming QoS. We formulate the optimization problem of QoS relationship with the environment parameters based on the QoS testing algorithm for IPTV in ITU-T G.1070. We evaluate the performance of the proposed CAASS through 12 types of experimental environments using a prototype system. Experimental results show that CAASS can dynamically adjust the service level according to the environment variation (e.g., network state and terminal performances and outperforms the existing streaming approaches in adaptive streaming media distribution according to peak signal-to-noise ratio (PSNR.

  14. Multiple synchronization transitions in scale-free neuronal networks with electrical and chemical hybrid synapses

    International Nuclear Information System (INIS)

    Liu, Chen; Wang, Jiang; Wang, Lin; Yu, Haitao; Deng, Bin; Wei, Xile; Tsang, Kaiming; Chan, Wailok

    2014-01-01

    Highlights: • Synchronization transitions in hybrid scale-free neuronal networks are investigated. • Multiple synchronization transitions can be induced by the time delay. • Effect of synchronization transitions depends on the ratio of the electrical and chemical synapses. • Coupling strength and the density of inter-neuronal links can enhance the synchronization. -- Abstract: The impacts of information transmission delay on the synchronization transitions in scale-free neuronal networks with electrical and chemical hybrid synapses are investigated. Numerical results show that multiple appearances of synchronization regions transitions can be induced by different information transmission delays. With the time delay increasing, the synchronization of neuronal activities can be enhanced or destroyed, irrespective of the probability of chemical synapses in the whole hybrid neuronal network. In particular, for larger probability of electrical synapses, the regions of synchronous activities appear broader with stronger synchronization ability of electrical synapses compared with chemical ones. Moreover, it can be found that increasing the coupling strength can promote synchronization monotonously, playing the similar role of the increasing the probability of the electrical synapses. Interestingly, the structures and parameters of the scale-free neuronal networks, especially the structural evolvement plays a more subtle role in the synchronization transitions. In the network formation process, it is found that every new vertex is attached to the more old vertices already present in the network, the more synchronous activities will be emerge

  15. Multiple Spatial Coherence Resonances and Spatial Patterns in a Noise-Driven Heterogeneous Neuronal Network

    Science.gov (United States)

    Li, Yu-Ye; Ding, Xue-Li

    2014-12-01

    Heterogeneity of the neurons and noise are inevitable in the real neuronal network. In this paper, Gaussian white noise induced spatial patterns including spiral waves and multiple spatial coherence resonances are studied in a network composed of Morris—Lecar neurons with heterogeneity characterized by parameter diversity. The relationship between the resonances and the transitions between ordered spiral waves and disordered spatial patterns are achieved. When parameter diversity is introduced, the maxima of multiple resonances increases first, and then decreases as diversity strength increases, which implies that the coherence degrees induced by noise are enhanced at an intermediate diversity strength. The synchronization degree of spatial patterns including ordered spiral waves and disordered patterns is identified to be a very low level. The results suggest that the nervous system can profit from both heterogeneity and noise, and the multiple spatial coherence resonances are achieved via the emergency of spiral waves instead of synchronization patterns.

  16. Multiple Spatial Coherence Resonances and Spatial Patterns in a Noise-Driven Heterogeneous Neuronal Network

    International Nuclear Information System (INIS)

    Li Yu-Ye; Ding Xue-Li

    2014-01-01

    Heterogeneity of the neurons and noise are inevitable in the real neuronal network. In this paper, Gaussian white noise induced spatial patterns including spiral waves and multiple spatial coherence resonances are studied in a network composed of Morris—Lecar neurons with heterogeneity characterized by parameter diversity. The relationship between the resonances and the transitions between ordered spiral waves and disordered spatial patterns are achieved. When parameter diversity is introduced, the maxima of multiple resonances increases first, and then decreases as diversity strength increases, which implies that the coherence degrees induced by noise are enhanced at an intermediate diversity strength. The synchronization degree of spatial patterns including ordered spiral waves and disordered patterns is identified to be a very low level. The results suggest that the nervous system can profit from both heterogeneity and noise, and the multiple spatial coherence resonances are achieved via the emergency of spiral waves instead of synchronization patterns. (interdisciplinary physics and related areas of science and technology)

  17. Spiral Waves and Multiple Spatial Coherence Resonances Induced by Colored Noise in Neuronal Network

    International Nuclear Information System (INIS)

    Tang Zhao; Li Yuye; Xi Lei; Jia Bing; Gu Huaguang

    2012-01-01

    Gaussian colored noise induced spatial patterns and spatial coherence resonances in a square lattice neuronal network composed of Morris-Lecar neurons are studied. Each neuron is at resting state near a saddle-node bifurcation on invariant circle, coupled to its nearest neighbors by electronic coupling. Spiral waves with different structures and disordered spatial structures can be alternately induced within a large range of noise intensity. By calculating spatial structure function and signal-to-noise ratio (SNR), it is found that SNR values are higher when the spiral structures are simple and are lower when the spatial patterns are complex or disordered, respectively. SNR manifest multiple local maximal peaks, indicating that the colored noise can induce multiple spatial coherence resonances. The maximal SNR values decrease as the correlation time of the noise increases. These results not only provide an example of multiple resonances, but also show that Gaussian colored noise play constructive roles in neuronal network. (general)

  18. Multiple-failure signal validation in nuclear power plants using artificial neural networks

    International Nuclear Information System (INIS)

    Fantoni, P.F.; Mazzola, A.

    1996-01-01

    The possibility of using a neural network to validate process signals during normal and abnormal plant conditions is explored. In boiling water reactor plants, signal validation is used to generate reliable thermal limits calculation and to supply reliable inputs to other computerized systems that support the operator during accident scenarios. The way that autoassociative neural networks can promptly detect faulty process signal measurements and produce a best estimate of the actual process values even in multifailure situations is shown. A method was developed to train the network for multiple sensor-failure detection, based on a random failure simulation algorithm. Noise was artificially added to the input to evaluate the network's ability to respond in a very low signal-to-noise ratio environment. Training and test data sets were simulated by the real-time transient simulator code APROS

  19. Prediction Approach of Critical Node Based on Multiple Attribute Decision Making for Opportunistic Sensor Networks

    Directory of Open Access Journals (Sweden)

    Qifan Chen

    2016-01-01

    Full Text Available Predicting critical nodes of Opportunistic Sensor Network (OSN can help us not only to improve network performance but also to decrease the cost in network maintenance. However, existing ways of predicting critical nodes in static network are not suitable for OSN. In this paper, the conceptions of critical nodes, region contribution, and cut-vertex in multiregion OSN are defined. We propose an approach to predict critical node for OSN, which is based on multiple attribute decision making (MADM. It takes RC to present the dependence of regions on Ferry nodes. TOPSIS algorithm is employed to find out Ferry node with maximum comprehensive contribution, which is a critical node. The experimental results show that, in different scenarios, this approach can predict the critical nodes of OSN better.

  20. An energy efficient multiple mobile sinks based routing algorithm for wireless sensor networks

    Science.gov (United States)

    Zhong, Peijun; Ruan, Feng

    2018-03-01

    With the fast development of wireless sensor networks (WSNs), more and more energy efficient routing algorithms have been proposed. However, one of the research challenges is how to alleviate the hot spot problem since nodes close to static sink (or base station) tend to die earlier than other sensors. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we mainly study the energy efficient routing method with multiple mobile sinks support. We divide the whole network into several clusters and study the influence of mobile sink number on network lifetime. Simulation results show that the best network performance appears when mobile sink number is about 3 under our simulation environment.

  1. ODMBP: Behavior Forwarding for Multiple Property Destinations in Mobile Social Networks

    Directory of Open Access Journals (Sweden)

    Jia Xu

    2016-01-01

    Full Text Available The smartphones are widely available in recent years. Wireless networks and personalized mobile devices are deeply integrated and embedded in our lives. The behavior based forwarding has become a new transmission paradigm for supporting many novel applications. However, the commodities, services, and individuals usually have multiple properties of their interests and behaviors. In this paper, we profile these multiple properties and propose an Opportunistic Dissemination Protocol based on Multiple Behavior Profile, ODMBP, in mobile social networks. We first map the interest space to the behavior space and extract the multiple behavior profiles from the behavior space. Then, we propose the correlation computing model based on the principle of BM25 to calculate the correlation metric of multiple behavior profiles. The correlation metric is used to forward the message to the users who are more similar to the target in our protocol. ODMBP consists of three stages: user initialization, gradient ascent, and group spread. Through extensive simulations, we demonstrate that the proposed multiple behavior profile and correlation computing model are correct and efficient. Compared to other classical routing protocols, ODMBP can significantly improve the performance in the aspect of delivery ratio, delay, and overhead ratio.

  2. Path-based Queries on Trajectory Data

    DEFF Research Database (Denmark)

    Krogh, Benjamin Bjerre; Pelekis, Nikos; Theodoridis, Yannis

    2014-01-01

    In traffic research, management, and planning a number of path-based analyses are heavily used, e.g., for computing turn-times, evaluating green waves, or studying traffic flow. These analyses require retrieving the trajectories that follow the full path being analyzed. Existing path queries cannot...... sufficiently support such path-based analyses because they retrieve all trajectories that touch any edge in the path. In this paper, we define and formalize the strict path query. This is a novel query type tailored to support path-based analysis, where trajectories must follow all edges in the path...... a specific path by only retrieving data from the first and last edge in the path. To correctly answer strict path queries existing network-constrained trajectory indexes must retrieve data from all edges in the path. An extensive performance study of NETTRA using a very large real-world trajectory data set...

  3. Multiple paths in educational transitions

    DEFF Research Database (Denmark)

    Karlson, Kristian Bernt

    2011-01-01

    In many countries educational branching points consist of more than two qualitatively different alternatives, and only some alternatives provide the opportunity of continuing into higher education. I develop a multinomial transition model for modeling the effects of family background...... characteristics and individual characteristics on these complex educational careers. The model controls for unobserved heterogeneity that may, if ignored, result in biased estimates. Compared to previous research, I explicitly include instrumental variables that ensure identification of the unobserved component....... I apply the model to the Danish case and analyze data which covers the educational careers of a cohort of Danes born around 1954. I find that the model brings forward non-trivial heterogeneity in the influence of family background and ability on qualitatively different choice alternatives both...

  4. Interrelationships Between Job Resources, Vigor, Exercise Habit, and Serum Lipids in Japanese Employees: a Multiple Group Path Analysis Using Medical Checkup Data.

    Science.gov (United States)

    Watanabe, Kazuhiro; Otsuka, Yasumasa; Inoue, Akiomi; Sakurai, Kenji; Ui, Akiko; Nakata, Akinori

    2016-08-01

    Physical inactivity is one of the major risk factors for dyslipidemia and coronary heart disease. Job resources have been identified as determinants of employees' vigor and physical activity habits. Our first purpose was to comprehensively analyze the series of relationships of job resources, through vigor and exercise habit (i.e., one aspect of physical activity), to serum lipid levels in a sample of Japanese employees in a manufacturing company. Our second purpose was to investigate sex differences in these relationships using a multiple-group path analysis. Data were collected from 4543 employees (men = 4018, women = 525) during a medical checkup conducted in February and March 2012. Job resources (job control, skill utilization, suitable jobs, and meaningfulness of work), vigor, exercise habit, triglyceride, high-density lipoprotein cholesterol (HDL-C), and low-density lipoprotein cholesterol (LDL-C) were measured cross-sectionally. Job resources and vigor were positively associated with exercise habit in both sexes. Exercise habit was inversely associated with triglyceride (-0.03 in men and -0.01 in women, ps jobs and meaningfulness of work. Higher levels of job resources were associated with greater vigor, leading to exercise habit, which in turn, improved serum lipid levels. Longitudinal studies are required to demonstrate causality.

  5. Single or multiple synchronization transitions in scale-free neuronal networks with electrical or chemical coupling

    International Nuclear Information System (INIS)

    Hao Yinghang; Gong, Yubing; Wang Li; Ma Xiaoguang; Yang Chuanlu

    2011-01-01

    Research highlights: → Single synchronization transition for gap-junctional coupling. → Multiple synchronization transitions for chemical synaptic coupling. → Gap junctions and chemical synapses have different impacts on synchronization transition. → Chemical synapses may play a dominant role in neurons' information processing. - Abstract: In this paper, we have studied time delay- and coupling strength-induced synchronization transitions in scale-free modified Hodgkin-Huxley (MHH) neuron networks with gap-junctions and chemical synaptic coupling. It is shown that the synchronization transitions are much different for these two coupling types. For gap-junctions, the neurons exhibit a single synchronization transition with time delay and coupling strength, while for chemical synapses, there are multiple synchronization transitions with time delay, and the synchronization transition with coupling strength is dependent on the time delay lengths. For short delays we observe a single synchronization transition, whereas for long delays the neurons exhibit multiple synchronization transitions as the coupling strength is varied. These results show that gap junctions and chemical synapses have different impacts on the pattern formation and synchronization transitions of the scale-free MHH neuronal networks, and chemical synapses, compared to gap junctions, may play a dominant and more active function in the firing activity of the networks. These findings would be helpful for further understanding the roles of gap junctions and chemical synapses in the firing dynamics of neuronal networks.

  6. Single or multiple synchronization transitions in scale-free neuronal networks with electrical or chemical coupling

    Energy Technology Data Exchange (ETDEWEB)

    Hao Yinghang [School of Physics, Ludong University, Yantai 264025 (China); Gong, Yubing, E-mail: gongyubing09@hotmail.co [School of Physics, Ludong University, Yantai 264025 (China); Wang Li; Ma Xiaoguang; Yang Chuanlu [School of Physics, Ludong University, Yantai 264025 (China)

    2011-04-15

    Research highlights: Single synchronization transition for gap-junctional coupling. Multiple synchronization transitions for chemical synaptic coupling. Gap junctions and chemical synapses have different impacts on synchronization transition. Chemical synapses may play a dominant role in neurons' information processing. - Abstract: In this paper, we have studied time delay- and coupling strength-induced synchronization transitions in scale-free modified Hodgkin-Huxley (MHH) neuron networks with gap-junctions and chemical synaptic coupling. It is shown that the synchronization transitions are much different for these two coupling types. For gap-junctions, the neurons exhibit a single synchronization transition with time delay and coupling strength, while for chemical synapses, there are multiple synchronization transitions with time delay, and the synchronization transition with coupling strength is dependent on the time delay lengths. For short delays we observe a single synchronization transition, whereas for long delays the neurons exhibit multiple synchronization transitions as the coupling strength is varied. These results show that gap junctions and chemical synapses have different impacts on the pattern formation and synchronization transitions of the scale-free MHH neuronal networks, and chemical synapses, compared to gap junctions, may play a dominant and more active function in the firing activity of the networks. These findings would be helpful for further understanding the roles of gap junctions and chemical synapses in the firing dynamics of neuronal networks.

  7. Path optimization method for the sign problem

    Directory of Open Access Journals (Sweden)

    Ohnishi Akira

    2018-01-01

    Full Text Available We propose a path optimization method (POM to evade the sign problem in the Monte-Carlo calculations for complex actions. Among many approaches to the sign problem, the Lefschetz-thimble path-integral method and the complex Langevin method are promising and extensively discussed. In these methods, real field variables are complexified and the integration manifold is determined by the flow equations or stochastically sampled. When we have singular points of the action or multiple critical points near the original integral surface, however, we have a risk to encounter the residual and global sign problems or the singular drift term problem. One of the ways to avoid the singular points is to optimize the integration path which is designed not to hit the singular points of the Boltzmann weight. By specifying the one-dimensional integration-path as z = t +if(t(f ϵ R and by optimizing f(t to enhance the average phase factor, we demonstrate that we can avoid the sign problem in a one-variable toy model for which the complex Langevin method is found to fail. In this proceedings, we propose POM and discuss how we can avoid the sign problem in a toy model. We also discuss the possibility to utilize the neural network to optimize the path.

  8. Revealing Pathway Dynamics in Heart Diseases by Analyzing Multiple Differential Networks.

    Directory of Open Access Journals (Sweden)

    Xiaoke Ma

    2015-06-01

    Full Text Available Development of heart diseases is driven by dynamic changes in both the activity and connectivity of gene pathways. Understanding these dynamic events is critical for understanding pathogenic mechanisms and development of effective treatment. Currently, there is a lack of computational methods that enable analysis of multiple gene networks, each of which exhibits differential activity compared to the network of the baseline/healthy condition. We describe the iMDM algorithm to identify both unique and shared gene modules across multiple differential co-expression networks, termed M-DMs (multiple differential modules. We applied iMDM to a time-course RNA-Seq dataset generated using a murine heart failure model generated on two genotypes. We showed that iMDM achieves higher accuracy in inferring gene modules compared to using single or multiple co-expression networks. We found that condition-specific M-DMs exhibit differential activities, mediate different biological processes, and are enriched for genes with known cardiovascular phenotypes. By analyzing M-DMs that are present in multiple conditions, we revealed dynamic changes in pathway activity and connectivity across heart failure conditions. We further showed that module dynamics were correlated with the dynamics of disease phenotypes during the development of heart failure. Thus, pathway dynamics is a powerful measure for understanding pathogenesis. iMDM provides a principled way to dissect the dynamics of gene pathways and its relationship to the dynamics of disease phenotype. With the exponential growth of omics data, our method can aid in generating systems-level insights into disease progression.

  9. Multiple access protocol for supporting multimedia services in wireless ATM networks

    DEFF Research Database (Denmark)

    Liu, Hong; Dittmann, Lars; Gliese, Ulrik Bo

    1999-01-01

    The furture broadband wireless asynchronous transfer mode (ATM) networks must provide seamless extension of multimedia services from the wireline ATM networks. This requires an effecient wireless access protocol to fulfill varying Quality-og-Service (QoS) requirements for multimedia applications....... In this paper, we propose a multiple access protocol using centralized and distributed channel access control techniques to provide QoS guarantees for multimedia services by taking advantage of the characteristics of different kinds of ATM traffics. Multimedia traffic, including constant bit rate (CBR...

  10. Traffic Management by Using Admission Control Methods in Multiple Node IMS Network

    Directory of Open Access Journals (Sweden)

    Filip Chamraz

    2016-01-01

    Full Text Available The paper deals with Admission Control methods (AC as a possible solution for traffic management in IMS networks (IP Multimedia Subsystem - from the point of view of an efficient redistribution of the available network resources and keeping the parameters of Quality of Service (QoS. The paper specifically aims at the selection of the most appropriate method for the specific type of traffic and traffic management concept using AC methods on multiple nodes. The potential benefit and disadvantage of the used solution is evaluated.

  11. Stability and attractive basins of multiple equilibria in delayed two-neuron networks

    International Nuclear Information System (INIS)

    Huang Yu-Jiao; Zhang Hua-Guang; Wang Zhan-Shan

    2012-01-01

    Multiple stability for two-dimensional delayed recurrent neural networks with piecewise linear activation functions of 2r (r ≥ 1) corner points is studied. Sufficient conditions are established for checking the existence of (2r + 1) 2 equilibria in delayed recurrent neural networks. Under these conditions, (r + 1) 2 equilibria are locally exponentially stable, and (2r + 1) 2 — (r + 1) 2 — r 2 equilibria are unstable. Attractive basins of stable equilibria are estimated, which are larger than invariant sets derived by decomposing state space. One example is provided to illustrate the effectiveness of our results. (general)

  12. New results for global robust stability of bidirectional associative memory neural networks with multiple time delays

    International Nuclear Information System (INIS)

    Senan, Sibel; Arik, Sabri

    2009-01-01

    This paper presents some new sufficient conditions for the global robust asymptotic stability of the equilibrium point for bidirectional associative memory (BAM) neural networks with multiple time delays. The results we obtain impose constraint conditions on the network parameters of neural system independently of the delay parameter, and they are applicable to all bounded continuous non-monotonic neuron activation functions. We also give some numerical examples to demonstrate the applicability and effectiveness of our results, and compare the results with the previous robust stability results derived in the literature.

  13. Fault diagnosis of sensor networked structures with multiple faults using a virtual beam based approach

    Science.gov (United States)

    Wang, H.; Jing, X. J.

    2017-07-01

    This paper presents a virtual beam based approach suitable for conducting diagnosis of multiple faults in complex structures with limited prior knowledge of the faults involved. The "virtual beam", a recently-proposed concept for fault detection in complex structures, is applied, which consists of a chain of sensors representing a vibration energy transmission path embedded in the complex structure. Statistical tests and adaptive threshold are particularly adopted for fault detection due to limited prior knowledge of normal operational conditions and fault conditions. To isolate the multiple faults within a specific structure or substructure of a more complex one, a 'biased running' strategy is developed and embedded within the bacterial-based optimization method to construct effective virtual beams and thus to improve the accuracy of localization. The proposed method is easy and efficient to implement for multiple fault localization with limited prior knowledge of normal conditions and faults. With extensive experimental results, it is validated that the proposed method can localize both single fault and multiple faults more effectively than the classical trust index subtract on negative add on positive (TI-SNAP) method.

  14. Multiple-point statistical prediction on fracture networks at Yucca Mountain

    International Nuclear Information System (INIS)

    Liu, X.Y; Zhang, C.Y.; Liu, Q.S.; Birkholzer, J.T.

    2009-01-01

    In many underground nuclear waste repository systems, such as at Yucca Mountain, water flow rate and amount of water seepage into the waste emplacement drifts are mainly determined by hydrological properties of fracture network in the surrounding rock mass. Natural fracture network system is not easy to describe, especially with respect to its connectivity which is critically important for simulating the water flow field. In this paper, we introduced a new method for fracture network description and prediction, termed multi-point-statistics (MPS). The process of the MPS method is to record multiple-point statistics concerning the connectivity patterns of a fracture network from a known fracture map, and to reproduce multiple-scale training fracture patterns in a stochastic manner, implicitly and directly. It is applied to fracture data to study flow field behavior at the Yucca Mountain waste repository system. First, the MPS method is used to create a fracture network with an original fracture training image from Yucca Mountain dataset. After we adopt a harmonic and arithmetic average method to upscale the permeability to a coarse grid, THM simulation is carried out to study near-field water flow in the surrounding waste emplacement drifts. Our study shows that connectivity or patterns of fracture networks can be grasped and reconstructed by MPS methods. In theory, it will lead to better prediction of fracture system characteristics and flow behavior. Meanwhile, we can obtain variance from flow field, which gives us a way to quantify model uncertainty even in complicated coupled THM simulations. It indicates that MPS can potentially characterize and reconstruct natural fracture networks in a fractured rock mass with advantages of quantifying connectivity of fracture system and its simulation uncertainty simultaneously.

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

    Directory of Open Access Journals (Sweden)

    Joeri Ruyssinck

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

  16. Constraints on signaling network logic reveal functional subgraphs on Multiple Myeloma OMIC data.

    Science.gov (United States)

    Miannay, Bertrand; Minvielle, Stéphane; Magrangeas, Florence; Guziolowski, Carito

    2018-03-21

    The integration of gene expression profiles (GEPs) and large-scale biological networks derived from pathways databases is a subject which is being widely explored. Existing methods are based on network distance measures among significantly measured species. Only a small number of them include the directionality and underlying logic existing in biological networks. In this study we approach the GEP-networks integration problem by considering the network logic, however our approach does not require a prior species selection according to their gene expression level. We start by modeling the biological network representing its underlying logic using Logic Programming. This model points to reachable network discrete states that maximize a notion of harmony between the molecular species active or inactive possible states and the directionality of the pathways reactions according to their activator or inhibitor control role. Only then, we confront these network states with the GEP. From this confrontation independent graph components are derived, each of them related to a fixed and optimal assignment of active or inactive states. These components allow us to decompose a large-scale network into subgraphs and their molecular species state assignments have different degrees of similarity when compared to the same GEP. We apply our method to study the set of possible states derived from a subgraph from the NCI-PID Pathway Interaction Database. This graph links Multiple Myeloma (MM) genes to known receptors for this blood cancer. We discover that the NCI-PID MM graph had 15 independent components, and when confronted to 611 MM GEPs, we find 1 component as being more specific to represent the difference between cancer and healthy profiles.

  17. Priority and Negotiation Based Dynamic Spectrum Allocation Scheme for Multiple Radio Access Network Operators

    Science.gov (United States)

    Kim, Hoon; Hyon, Taein; Lee, Yeonwoo

    Most of previous works have presented the dynamic spectrum allocation (DSA) gain achieved by utilizing the time or regional variations in traffic demand between multi-network operators (NOs). In this paper, we introduce the functionalities required for the entities related with the spectrum sharing and allocation and propose a spectrum allocation algorithm while considering the long-term priority between NOs, the priority between multiple class services, and the urgent bandwidth request. To take into account the priorities among the NOs and the priorities of multiple class services, a spectrum sharing metric (SSM) is proposed, while a negotiation procedure is proposed to treat the urgent bandwidth request.

  18. A feedback control model for network flow with multiple pure time delays

    Science.gov (United States)

    Press, J.

    1972-01-01

    A control model describing a network flow hindered by multiple pure time (or transport) delays is formulated. Feedbacks connect each desired output with a single control sector situated at the origin. The dynamic formulation invokes the use of differential difference equations. This causes the characteristic equation of the model to consist of transcendental functions instead of a common algebraic polynomial. A general graphical criterion is developed to evaluate the stability of such a problem. A digital computer simulation confirms the validity of such criterion. An optimal decision making process with multiple delays is presented.

  19. Path-length-resolved measurements of multiple scattered photons in static and dynamic turbid media using phase-modulated low-coherence interferometry

    NARCIS (Netherlands)

    Varghese, Babu; Rajan, Vinayakrishnan; van Leeuwen, Ton G.; Steenbergen, Wiendelt

    2007-01-01

    In optical Doppler measurements, the path length of the light is unknown. To facilitate quantitative measurements, we develop a phase-modulated Mach-Zehnder interferometer with separate fibers for illumination and detection. With this setup, path-length-resolved dynamic light scattering measurements

  20. Enforcement of Privacy Policies over Multiple Online Social Networks for Collaborative Activities

    Science.gov (United States)

    Wu, Zhengping; Wang, Lifeng

    Our goal is to tend to develop an enforcement architecture of privacy policies over multiple online social networks. It is used to solve the problem of privacy protection when several social networks build permanent or temporary collaboration. Theoretically, this idea is practical, especially due to more and more social network tend to support open source framework “OpenSocial”. But as we known different social network websites may have the same privacy policy settings based on different enforcement mechanisms, this would cause problems. In this case, we have to manually write code for both sides to make the privacy policy settings enforceable. We can imagine that, this is a huge workload based on the huge number of current social networks. So we focus on proposing a middleware which is used to automatically generate privacy protection component for permanent integration or temporary interaction of social networks. This middleware provide functions, such as collecting of privacy policy of each participant in the new collaboration, generating a standard policy model for each participant and mapping all those standard policy to different enforcement mechanisms of those participants.

  1. A study on the multiple dynamic wavelength distribution for gigabit capable passive optical networks

    Directory of Open Access Journals (Sweden)

    Gustavo Adolfo Puerto Leguizamón

    2014-04-01

    Full Text Available This paper presents a data traffic based study aiming at evaluating the impact of dynamic wavelength allocation on a Gigabit capable Passive Optical Network (GPON. In Passive Optical Networks (PON, an Optical Line Terminal (OLT feeds different PONs in such a way that a given wavelength channel is evenly distributed between the Optical Network Units (ONU at each PON. However, PONs do not specify any kind of dynamic behavior on the way the wavelengths are allocated in the network, a completely static distribution is implemented instead. In thispaper we evaluate the network performance in terms of packet losses and throughput for a number of ONUs being out-of-profile while featuring a given percentage of traffic in excess for a fixed wavelength distribution and for multiple dynamic wavelength allocation. Results show that for a multichannel operation with four wavelengths, the network throughput increases up to a rough value of 19% while the packet losses drop from 22 % to 1.8 % as compared with a static wavelength distribution.

  2. Efficient traffic grooming with dynamic ONU grouping for multiple-OLT-based access network

    Science.gov (United States)

    Zhang, Shizong; Gu, Rentao; Ji, Yuefeng; Wang, Hongxiang

    2015-12-01

    Fast bandwidth growth urges large-scale high-density access scenarios, where the multiple Passive Optical Networking (PON) system clustered deployment can be adopted as an appropriate solution to fulfill the huge bandwidth demands, especially for a future 5G mobile network. However, the lack of interaction between different optical line terminals (OLTs) results in part of the bandwidth resources waste. To increase the bandwidth efficiency, as well as reduce bandwidth pressure at the edge of a network, we propose a centralized flexible PON architecture based on Time- and Wavelength-Division Multiplexing PON (TWDM PON). It can provide flexible affiliation for optical network units (ONUs) and different OLTs to support access network traffic localization. Specifically, a dynamic ONU grouping algorithm (DGA) is provided to obtain the minimal OLT outbound traffic. Simulation results show that DGA obtains an average 25.23% traffic gain increment under different OLT numbers within a small ONU number situation, and the traffic gain will increase dramatically with the increment of the ONU number. As the DGA can be deployed easily as an application running above the centralized control plane, the proposed architecture can be helpful to improve the network efficiency for future traffic-intensive access scenarios.

  3. LAI inversion from optical reflectance using a neural network trained with a multiple scattering model

    Science.gov (United States)

    Smith, James A.

    1992-01-01

    The inversion of the leaf area index (LAI) canopy parameter from optical spectral reflectance measurements is obtained using a backpropagation artificial neural network trained using input-output pairs generated by a multiple scattering reflectance model. The problem of LAI estimation over sparse canopies (LAI 1000 percent for low LAI. Minimization methods applied to merit functions constructed from differences between measured reflectances and predicted reflectances using multiple-scattering models are unacceptably sensitive to a good initial guess for the desired parameter. In contrast, the neural network reported generally yields absolute percentage errors of <30 percent when weighting coefficients trained on one soil type were applied to predicted canopy reflectance at a different soil background.

  4. Multiple Regions of a Cortical Network Commonly Encode the Meaning of Words in Multiple Grammatical Positions of Read Sentences.

    Science.gov (United States)

    Anderson, Andrew James; Lalor, Edmund C; Lin, Feng; Binder, Jeffrey R; Fernandino, Leonardo; Humphries, Colin J; Conant, Lisa L; Raizada, Rajeev D S; Grimm, Scott; Wang, Xixi

    2018-05-16

    Deciphering how sentence meaning is represented in the brain remains a major challenge to science. Semantically related neural activity has recently been shown to arise concurrently in distributed brain regions as successive words in a sentence are read. However, what semantic content is represented by different regions, what is common across them, and how this relates to words in different grammatical positions of sentences is weakly understood. To address these questions, we apply a semantic model of word meaning to interpret brain activation patterns elicited in sentence reading. The model is based on human ratings of 65 sensory/motor/emotional and cognitive features of experience with words (and their referents). Through a process of mapping functional Magnetic Resonance Imaging activation back into model space we test: which brain regions semantically encode content words in different grammatical positions (e.g., subject/verb/object); and what semantic features are encoded by different regions. In left temporal, inferior parietal, and inferior/superior frontal regions we detect the semantic encoding of words in all grammatical positions tested and reveal multiple common components of semantic representation. This suggests that sentence comprehension involves a common core representation of multiple words' meaning being encoded in a network of regions distributed across the brain.

  5. Allocation and management issues in multiple-transaction open access transmission networks

    Science.gov (United States)

    Tao, Shu

    This thesis focuses on some key issues related to allocation and management by the independent grid operator (IGO) of unbundled services in multiple-transaction open access transmission networks. The three unbundled services addressed in the thesis are transmission real power losses, reactive power support requirements from generation sources, and transmission congestion management. We develop the general framework that explicitly represents multiple transactions undertaken simultaneously in the transmission grid. This framework serves as the basis for formulating various problems treated in the thesis. We use this comprehensive framework to develop a physical-flow-based mechanism to allocate the total transmission losses to each transaction using the system. An important property of the allocation scheme is its capability to effectively deal with counter flows that result in the presence of specific transactions. Using the loss allocation results as the basis, we construct the equivalent loss compensation concept and apply it to develop flexible and effective procedures for compensating losses in multiple-transaction networks. We present a new physical-flow-based mechanism for allocating the reactive power support requirements provided by generators in multiple-transaction networks. The allocatable reactive support requirements are formulated as the sum of two specific components---the voltage magnitude variation component and the voltage angle variation component. The formulation utilizes the multiple-transaction framework and makes use of certain simplifying approximations. The formulation leads to a natural allocation as a function of the amount of each transaction. The physical interpretation of each allocation as a sensitivity of the reactive output of a generator is discussed. We propose a congestion management allocation scheme for multiple-transaction networks. The proposed scheme determines the allocation of congestion among the transactions on a physical

  6. Smart Control of Multiple Evaporator Systems with Wireless Sensor and Actuator Networks

    Directory of Open Access Journals (Sweden)

    Apolinar González-Potes

    2016-02-01

    Full Text Available This paper describes the complete integration of a fuzzy control of multiple evaporator systems with the IEEE 802.15.4 standard, in which we study several important aspects for this kind of system, like a detailed analysis of the end-to-end real-time flows over wireless sensor and actuator networks (WSAN, a real-time kernel with an earliest deadline first (EDF scheduler, periodic and aperiodic tasking models for the nodes, lightweight and flexible compensation-based control algorithms for WSAN that exhibit packet dropouts, an event-triggered sampling scheme and design methodologies. We address the control problem of the multi-evaporators with the presence of uncertainties, which was tackled through a wireless fuzzy control approach, showing the advantages of this concept where it can easily perform the optimization for a set of multiple evaporators controlled by the same smart controller, which should have an intelligent and flexible architecture based on multi-agent systems (MAS that allows one to add or remove new evaporators online, without the need for reconfiguring, while maintaining temporal and functional restrictions in the system. We show clearly how we can get a greater scalability, the self-configuration of the network and the least overhead with a non-beacon or unslotted mode of the IEEE 802.15.4 protocol, as well as wireless communications and distributed architectures, which could be extremely helpful in the development process of networked control systems in large spatially-distributed plants, which involve many sensors and actuators. For this purpose, a fuzzy scheme is used to control a set of parallel evaporator air-conditioning systems, with temperature and relative humidity control as a multi-input and multi-output closed loop system; in addition, a general architecture is presented, which implements multiple control loops closed over a communication network, integrating the analysis and validation method for multi

  7. Optimal power allocation of a single transmitter-multiple receivers channel in a cognitive sensor network

    KAUST Repository

    Ayala Solares, Jose Roberto

    2012-08-01

    The optimal transmit power of a wireless sensor network with one transmitter and multiple receivers in a cognitive radio environment while satisfying independent peak, independent average, sum of peak and sum of average transmission rate constraints is derived. A suboptimal scheme is proposed to overcome the frequency of outages for the independent peak transmission rate constraint. In all cases, numerical results are provided for Rayleigh fading channels. © 2012 IEEE.

  8. Prairie Network Fireballs: Data of motion and ablation of fireball bodies obtained by local-ballistic method applied to variably-sliding path-segment

    Science.gov (United States)

    Kalenichenko, Valentin V.

    2000-11-01

    The electronic version of an extensive catalogue of the results of the fireball physics inverse problem solution for the precise observational data of the Prairie Network Fireballs (DTHM-values) obtained by local-ballistic method of a variably-sliding path-segment contains a set of the physical parameters for the 480 fireball images of the 248 cosmic body entries into the Earth's atmosphere (PNVK-values). The parameters are: the fireball velocity with the corresponding values of the mass to cross-section area ratio for the fireball-generating body a teach measured point of the fireball path, the ablation factor and the ratio of the luminous fireball energy to the drag work for the body in the Earth's atmosphere using a factor inversely proportional to the density of the body. The catalogue of all PNVK-values, about 3.1 Mbytes in ASCII is accessible from ftp://ftp2.mao.kiev.ua/pub/astro/pnvk, files pnvk.cat and pnvks.cat

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

    Science.gov (United States)

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

    2015-06-01

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

  10. Energy-Aware Routing in Multiple Domains Software-Defined Networks

    Directory of Open Access Journals (Sweden)

    Adriana FERNÁNDEZ-FERNÁNDEZ

    2016-12-01

    Full Text Available The growing energy consumption of communication networks has attracted the attention of the networking researchers in the last decade. In this context, the new architecture of Software-Defined Networks (SDN allows a flexible programmability, suitable for the power-consumption optimization problem. In this paper we address the issue of designing a novel distributed routing algorithm that optimizes the power consumption in large scale SDN with multiple domains. The solution proposed, called DEAR (Distributed Energy-Aware Routing, tackles the problem of minimizing the number of links that can be used to satisfy a given data traffic demand under performance constraints such as control traffic delay and link utilization. To this end, we present a complete formulation of the optimization problem that considers routing requirements for control and data plane communications. Simulation results confirm that the proposed solution enables the achievement of significant energy savings.

  11. Rock property estimates using multiple seismic attributes and neural networks; Pegasus Field, West Texas

    Energy Technology Data Exchange (ETDEWEB)

    Schuelke, J.S.; Quirein, J.A.; Sarg, J.F.

    1998-12-31

    This case study shows the benefit of using multiple seismic trace attributes and the pattern recognition capabilities of neural networks to predict reservoir architecture and porosity distribution in the Pegasus Field, West Texas. The study used the power of neural networks to integrate geologic, borehole and seismic data. Illustrated are the improvements between the new neural network approach and the more traditional method of seismic trace inversion for porosity estimation. Comprehensive statistical methods and interpretational/subjective measures are used in the prediction of porosity from seismic attributes. A 3-D volume of seismic derived porosity estimates for the Devonian reservoir provide a very detailed estimate of porosity, both spatially and vertically, for the field. The additional reservoir porosity detail provided, between the well control, allows for optimal placement of horizontal wells and improved field development. 6 refs., 2 figs.

  12. Maximizing the Lifetime of Wireless Sensor Networks Using Multiple Sets of Rendezvous

    Directory of Open Access Journals (Sweden)

    Bo Li

    2015-01-01

    Full Text Available In wireless sensor networks (WSNs, there is a “crowded center effect” where the energy of nodes located near a data sink drains much faster than other nodes resulting in a short network lifetime. To mitigate the “crowded center effect,” rendezvous points (RPs are used to gather data from other nodes. In order to prolong the lifetime of WSN further, we propose using multiple sets of RPs in turn to average the energy consumption of the RPs. The problem is how to select the multiple sets of RPs and how long to use each set of RPs. An optimal algorithm and a heuristic algorithm are proposed to address this problem. The optimal algorithm is highly complex and only suitable for small scale WSN. The performance of the proposed algorithms is evaluated through simulations. The simulation results indicate that the heuristic algorithm approaches the optimal one and that using multiple RP sets can significantly prolong network lifetime.

  13. Implementation of Multiple Host Nodes in Wireless Sensing Node Network System for Landslide Monitoring

    International Nuclear Information System (INIS)

    Bin Abas, Faizulsalihin; Takayama, Shigeru

    2015-01-01

    This paper proposes multiple host nodes in Wireless Sensing Node Network System (WSNNS) for landslide monitoring. As landslide disasters damage monitoring system easily, one major demand in landslide monitoring is the flexibility and robustness of the system to evaluate the current situation in the monitored area. For various reasons WSNNS can provide an important contribution to reach that aim. In this system, acceleration sensors and GPS are deployed in sensing nodes. Location information by GPS, enable the system to estimate network topology and enable the system to perceive the location in emergency by monitoring the node mode. Acceleration sensors deployment, capacitate this system to detect slow mass movement that can lead to landslide occurrence. Once deployed, sensing nodes self-organize into an autonomous wireless ad hoc network. The measurement parameter data from sensing nodes is transmitted to Host System via host node and ''Cloud'' System. The implementation of multiple host nodes in Local Sensing Node Network System (LSNNS), improve risk- management of the WSNNS for real-time monitoring of landslide disaster

  14. Parity-Check Network Coding for Multiple Access Relay Channel in Wireless Sensor Cooperative Communications

    Directory of Open Access Journals (Sweden)

    Du Bing

    2010-01-01

    Full Text Available A recently developed theory suggests that network coding is a generalization of source coding and channel coding and thus yields a significant performance improvement in terms of throughput and spatial diversity. This paper proposes a cooperative design of a parity-check network coding scheme in the context of a two-source multiple access relay channel (MARC model, a common compact model in hierarchical wireless sensor networks (WSNs. The scheme uses Low-Density Parity-Check (LDPC as the surrogate to build up a layered structure which encapsulates the multiple constituent LDPC codes in the source and relay nodes. Specifically, the relay node decodes the messages from two sources, which are used to generate extra parity-check bits by a random network coding procedure to fill up the rate gap between Source-Relay and Source-Destination transmissions. Then, we derived the key algebraic relationships among multidimensional LDPC constituent codes as one of the constraints for code profile optimization. These extra check bits are sent to the destination to realize a cooperative diversity as well as to approach MARC decode-and-forward (DF capacity.

  15. A System for Acquisition, Processing and Visualization of Image Time Series from Multiple Camera Networks

    Directory of Open Access Journals (Sweden)

    Cemal Melih Tanis

    2018-06-01

    Full Text Available A system for multiple camera networks is proposed for continuous monitoring of ecosystems by processing image time series. The system is built around the Finnish Meteorological Image PROcessing Toolbox (FMIPROT, which includes data acquisition, processing and visualization from multiple camera networks. The toolbox has a user-friendly graphical user interface (GUI for which only minimal computer knowledge and skills are required to use it. Images from camera networks are acquired and handled automatically according to the common communication protocols, e.g., File Transfer Protocol (FTP. Processing features include GUI based selection of the region of interest (ROI, automatic analysis chain, extraction of ROI based indices such as the green fraction index (GF, red fraction index (RF, blue fraction index (BF, green-red vegetation index (GRVI, and green excess (GEI index, as well as a custom index defined by a user-provided mathematical formula. Analysis results are visualized on interactive plots both on the GUI and hypertext markup language (HTML reports. The users can implement their own developed algorithms to extract information from digital image series for any purpose. The toolbox can also be run in non-GUI mode, which allows running series of analyses in servers unattended and scheduled. The system is demonstrated using an environmental camera network in Finland.

  16. Implementation of Multiple Host Nodes in Wireless Sensing Node Network System for Landslide Monitoring

    Science.gov (United States)

    Abas, Faizulsalihin bin; Takayama, Shigeru

    2015-02-01

    This paper proposes multiple host nodes in Wireless Sensing Node Network System (WSNNS) for landslide monitoring. As landslide disasters damage monitoring system easily, one major demand in landslide monitoring is the flexibility and robustness of the system to evaluate the current situation in the monitored area. For various reasons WSNNS can provide an important contribution to reach that aim. In this system, acceleration sensors and GPS are deployed in sensing nodes. Location information by GPS, enable the system to estimate network topology and enable the system to perceive the location in emergency by monitoring the node mode. Acceleration sensors deployment, capacitate this system to detect slow mass movement that can lead to landslide occurrence. Once deployed, sensing nodes self-organize into an autonomous wireless ad hoc network. The measurement parameter data from sensing nodes is transmitted to Host System via host node and "Cloud" System. The implementation of multiple host nodes in Local Sensing Node Network System (LSNNS), improve risk- management of the WSNNS for real-time monitoring of landslide disaster.

  17. Performance analysis of an opportunistic multi-user cognitive network with multiple primary users

    KAUST Repository

    Khan, Fahd Ahmed

    2014-03-01

    Consider a multi-user underlay cognitive network where multiple cognitive users concurrently share the spectrum with a primary network with multiple users. The channel between the secondary network is assumed to have independent but not identical Nakagami-m fading. The interference channel between the secondary users (SUs) and the primary users is assumed to have Rayleigh fading. A power allocation based on the instantaneous channel state information is derived when a peak interference power constraint is imposed on the secondary network in addition to the limited peak transmit power of each SU. The uplink scenario is considered where a single SU is selected for transmission. This opportunistic selection depends on the transmission channel power gain and the interference channel power gain as well as the power allocation policy adopted at the users. Exact closed form expressions for the moment-generating function, outage performance, symbol error rate performance, and the ergodic capacity are derived. Numerical results corroborate the derived analytical results. The performance is also studied in the asymptotic regimes, and the generalized diversity gain of this scheduling scheme is derived. It is shown that when the interference channel is deeply faded and the peak transmit power constraint is relaxed, the scheduling scheme achieves full diversity and that increasing the number of primary users does not impact the diversity order. © 2014 John Wiley & Sons, Ltd.

  18. A New Path-Constrained Rendezvous Planning Approach for Large-Scale Event-Driven Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Ahmadreza Vajdi

    2018-05-01

    Full Text Available We study the problem of employing a mobile-sink into a large-scale Event-Driven Wireless Sensor Networks (EWSNs for the purpose of data harvesting from sensor-nodes. Generally, this employment improves the main weakness of WSNs that is about energy-consumption in battery-driven sensor-nodes. The main motivation of our work is to address challenges which are related to a network’s topology by adopting a mobile-sink that moves in a predefined trajectory in the environment. Since, in this fashion, it is not possible to gather data from sensor-nodes individually, we adopt the approach of defining some of the sensor-nodes as Rendezvous Points (RPs in the network. We argue that RP-planning in this case is a tradeoff between minimizing the number of RPs while decreasing the number of hops for a sensor-node that needs data transformation to the related RP which leads to minimizing average energy consumption in the network. We address the problem by formulating the challenges and expectations as a Mixed Integer Linear Programming (MILP. Henceforth, by proving the NP-hardness of the problem, we propose three effective and distributed heuristics for RP-planning, identifying sojourn locations, and constructing routing trees. Finally, experimental results prove the effectiveness of our approach.

  19. A New Path-Constrained Rendezvous Planning Approach for Large-Scale Event-Driven Wireless Sensor Networks.

    Science.gov (United States)

    Vajdi, Ahmadreza; Zhang, Gongxuan; Zhou, Junlong; Wei, Tongquan; Wang, Yongli; Wang, Tianshu

    2018-05-04

    We study the problem of employing a mobile-sink into a large-scale Event-Driven Wireless Sensor Networks (EWSNs) for the purpose of data harvesting from sensor-nodes. Generally, this employment improves the main weakness of WSNs that is about energy-consumption in battery-driven sensor-nodes. The main motivation of our work is to address challenges which are related to a network’s topology by adopting a mobile-sink that moves in a predefined trajectory in the environment. Since, in this fashion, it is not possible to gather data from sensor-nodes individually, we adopt the approach of defining some of the sensor-nodes as Rendezvous Points (RPs) in the network. We argue that RP-planning in this case is a tradeoff between minimizing the number of RPs while decreasing the number of hops for a sensor-node that needs data transformation to the related RP which leads to minimizing average energy consumption in the network. We address the problem by formulating the challenges and expectations as a Mixed Integer Linear Programming (MILP). Henceforth, by proving the NP-hardness of the problem, we propose three effective and distributed heuristics for RP-planning, identifying sojourn locations, and constructing routing trees. Finally, experimental results prove the effectiveness of our approach.

  20. A New Path-Constrained Rendezvous Planning Approach for Large-Scale Event-Driven Wireless Sensor Networks

    Science.gov (United States)

    Zhang, Gongxuan; Wang, Yongli; Wang, Tianshu

    2018-01-01

    We study the problem of employing a mobile-sink into a large-scale Event-Driven Wireless Sensor Networks (EWSNs) for the purpose of data harvesting from sensor-nodes. Generally, this employment improves the main weakness of WSNs that is about energy-consumption in battery-driven sensor-nodes. The main motivation of our work is to address challenges which are related to a network’s topology by adopting a mobile-sink that moves in a predefined trajectory in the environment. Since, in this fashion, it is not possible to gather data from sensor-nodes individually, we adopt the approach of defining some of the sensor-nodes as Rendezvous Points (RPs) in the network. We argue that RP-planning in this case is a tradeoff between minimizing the number of RPs while decreasing the number of hops for a sensor-node that needs data transformation to the related RP which leads to minimizing average energy consumption in the network. We address the problem by formulating the challenges and expectations as a Mixed Integer Linear Programming (MILP). Henceforth, by proving the NP-hardness of the problem, we propose three effective and distributed heuristics for RP-planning, identifying sojourn locations, and constructing routing trees. Finally, experimental results prove the effectiveness of our approach. PMID:29734718

  1. Image transmission in multicore-fiber code-division multiple access network

    Science.gov (United States)

    Yang, Guu-Chang; Kwong, Wing C.

    1997-01-01

    Recently, two-dimensional (2-D) signature patterns were proposed to encode binary digitized image pixels in optical code-division multiple-access (CDMA) networks with 'multicore' fiber. The new technology enables parallel transmission and simultaneous access of 2-D images in multiple-access environment, where these signature patterns are defined as optical orthogonal signature pattern codes (OOSPCs). However, previous work on OOSPCs assumed that the weight of each signature pattern was the same. In this paper, we construct a new family of OOSPCs with the removal of this assumption. Since varying the weight of a user's signature pattern affects that user's performance, this approach is useful for CDMA optical systems with multiple performance requirements.

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

    Science.gov (United States)

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

    2015-01-01

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

  3. Multiple effect of social influence on cooperation in interdependent network games

    Science.gov (United States)

    Jiang, Luo-Luo; Li, Wen-Jing; Wang, Zhen

    2015-10-01

    The social influence exists widely in the human society, where individual decision-making process (from congressional election to electronic commerce) may be affected by the attitude and behavior of others belonging to different social networks. Here, we couple the snowdrift (SD) game and the prisoner’s dilemma (PD) game on two interdependent networks, where strategies in both games are associated by social influence to mimick the majority rule. More accurately, individuals’ strategies updating refers to social learning (based on payoff difference) and above-mentioned social influence (related with environment of interdependent group), which is controlled by social influence strength s. Setting s = 0 decouples the networks and returns the traditional network game; while its increase involves the interactions between networks. By means of numerous Monte Carlo simulations, we find that such a mechanism brings multiple influence to the evolution of cooperation. Small s leads to unequal cooperation level in both games, because social learning is still the main updating rule for most players. Though intermediate and large s guarantees the synchronized evolution of strategy pairs, cooperation finally dies out and reaches a completely dominance in both cases. Interestingly, these observations are attributed to the expansion of cooperation clusters. Our work may provide a new understanding to the emergence of cooperation in intercorrelated social systems.

  4. An Adaptive Time-Spread Multiple-Access Policy for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Konstantinos Oikonomou

    2007-05-01

    Full Text Available Sensor networks require a simple and efficient medium access control policy achieving high system throughput with no or limited control overhead in order to increase the network lifetime by minimizing the energy consumed during transmission attempts. Time-spread multiple-access (TSMA policies that have been proposed for ad hoc network environments, can also be employed in sensor networks, since no control overhead is introduced. However, they do not take advantage of any cross-layer information in order to exploit the idiosyncrasies of the particular sensor network environment such as the presence of typically static nodes and a common destination for the forwarded data. An adaptive probabilistic TSMA-based policy, that is proposed and analyzed in this paper, exploits these idiosyncrasies and achieves higher system throughput than the existing TSMA-based policies without any need for extra control overhead. As it is analytically shown in this paper, the proposed policy always outperforms the existing TSMA-based policies, if certain parameter values are properly set; the analysis also provides for these proper values. It is also shown that the proposed policy is characterized by a certain convergence period and that high system throughput is achieved for long convergence periods. The claims and expectations of the provided analysis are supported by simulation results presented in this paper.

  5. Path Dependence

    DEFF Research Database (Denmark)

    Madsen, Mogens Ove

    Begrebet Path Dependence blev oprindelig udviklet inden for New Institutionel Economics af bl.a. David, Arthur og North. Begrebet har spredt sig vidt i samfundsvidenskaberne og undergået en udvikling. Dette paper propagerer for at der er sket så en så omfattende udvikling af begrebet, at man nu kan...... tale om 1. og 2. generation af Path Dependence begrebet. Den nyeste udvikling af begrebet har relevans for metodologi-diskusionerne i relation til Keynes...

  6. Constrained Active Learning for Anchor Link Prediction Across Multiple Heterogeneous Social Networks.

    Science.gov (United States)

    Zhu, Junxing; Zhang, Jiawei; Wu, Quanyuan; Jia, Yan; Zhou, Bin; Wei, Xiaokai; Yu, Philip S

    2017-08-03

    Nowadays, people are usually involved in multiple heterogeneous social networks simultaneously. Discovering the anchor links between the accounts owned by the same users across different social networks is crucial for many important inter-network applications, e.g., cross-network link transfer and cross-network recommendation. Many different supervised models have been proposed to predict anchor links so far, but they are effective only when the labeled anchor links are abundant. However, in real scenarios, such a requirement can hardly be met and most anchor links are unlabeled, since manually labeling the inter-network anchor links is quite costly and tedious. To overcome such a problem and utilize the numerous unlabeled anchor links in model building, in this paper, we introduce the active learning based anchor link prediction problem. Different from the traditional active learning problems, due to the one-to-one constraint on anchor links, if an unlabeled anchor link a = ( u , v ) is identified as positive (i.e., existing), all the other unlabeled anchor links incident to account u or account v will be negative (i.e., non-existing) automatically. Viewed in such a perspective, asking for the labels of potential positive anchor links in the unlabeled set will be rewarding in the active anchor link prediction problem. Various novel anchor link information gain measures are defined in this paper, based on which several constraint active anchor link prediction methods are introduced. Extensive experiments have been done on real-world social network datasets to compare the performance of these methods with state-of-art anchor link prediction methods. The experimental results show that the proposed Mean-entropy-based Constrained Active Learning (MC) method can outperform other methods with significant advantages.

  7. Reliability assessment of a multistate freight network for perishable merchandise with multiple suppliers and buyers

    Science.gov (United States)

    Lin, Yi-Kuei; Yeh, Cheng-Ta; Huang, Cheng-Fu

    2017-01-01

    This study develops a multistate freight network for single and perishable merchandise to assess the freight performance, where a node denotes a supplier, a distribution centre, or a buyer, while a logistics company providing a freight traffic service is denoted by an edge. For each logistics company, carrying capacity should be multistate since partial capacity may be reserved by some customers. The merchandise may perish or be perished during conveyance because of disadvantageous weather or collision in carrying such that the number of intact cargoes may be insufficient for the buyers. Hence, according to the perspective of supply chain management, the reliability, a probability of the network to successfully deliver the cargoes from the suppliers to the buyers subject to a budget, is proposed to be a performance index, where the suppliers and buyers are not the previous customers. An algorithm in terms of minimal paths to assess the reliability is developed. A fruit logistics case is adopted to explore the managerial implications of the reliability using sensitivity analysis.

  8. Spatial heterogeneity regulates plant-pollinator networks across multiple landscape scales.

    Directory of Open Access Journals (Sweden)

    Eduardo Freitas Moreira

    Full Text Available Mutualistic plant-pollinator interactions play a key role in biodiversity conservation and ecosystem functioning. In a community, the combination of these interactions can generate emergent properties, e.g., robustness and resilience to disturbances such as fluctuations in populations and extinctions. Given that these systems are hierarchical and complex, environmental changes must have multiple levels of influence. In addition, changes in habitat quality and in the landscape structure are important threats to plants, pollinators and their interactions. However, despite the importance of these phenomena for the understanding of biological systems, as well as for conservation and management strategies, few studies have empirically evaluated these effects at the network level. Therefore, the objective of this study was to investigate the influence of local conditions and landscape structure at multiple scales on the characteristics of plant-pollinator networks. This study was conducted in agri-natural lands in Chapada Diamantina, Bahia, Brazil. Pollinators were collected in 27 sampling units distributed orthogonally along a gradient of proportion of agriculture and landscape diversity. The Akaike information criterion was used to select models that best fit the metrics for network characteristics, comparing four hypotheses represented by a set of a priori candidate models with specific combinations of the proportion of agriculture, the average shape of the landscape elements, the diversity of the landscape and the structure of local vegetation. The results indicate that a reduction of habitat quality and landscape heterogeneity can cause species loss and decrease of networks nestedness. These structural changes can reduce robustness and resilience of plant-pollinator networks what compromises the reproductive success of plants, the maintenance of biodiversity and the pollination service stability. We also discuss the possible explanations for

  9. Spatial heterogeneity regulates plant-pollinator networks across multiple landscape scales.

    Science.gov (United States)

    Moreira, Eduardo Freitas; Boscolo, Danilo; Viana, Blandina Felipe

    2015-01-01

    Mutualistic plant-pollinator interactions play a key role in biodiversity conservation and ecosystem functioning. In a community, the combination of these interactions can generate emergent properties, e.g., robustness and resilience to disturbances such as fluctuations in populations and extinctions. Given that these systems are hierarchical and complex, environmental changes must have multiple levels of influence. In addition, changes in habitat quality and in the landscape structure are important threats to plants, pollinators and their interactions. However, despite the importance of these phenomena for the understanding of biological systems, as well as for conservation and management strategies, few studies have empirically evaluated these effects at the network level. Therefore, the objective of this study was to investigate the influence of local conditions and landscape structure at multiple scales on the characteristics of plant-pollinator networks. This study was conducted in agri-natural lands in Chapada Diamantina, Bahia, Brazil. Pollinators were collected in 27 sampling units distributed orthogonally along a gradient of proportion of agriculture and landscape diversity. The Akaike information criterion was used to select models that best fit the metrics for network characteristics, comparing four hypotheses represented by a set of a priori candidate models with specific combinations of the proportion of agriculture, the average shape of the landscape elements, the diversity of the landscape and the structure of local vegetation. The results indicate that a reduction of habitat quality and landscape heterogeneity can cause species loss and decrease of networks nestedness. These structural changes can reduce robustness and resilience of plant-pollinator networks what compromises the reproductive success of plants, the maintenance of biodiversity and the pollination service stability. We also discuss the possible explanations for these relationships and

  10. Secure Path Selection under Random Fading

    Directory of Open Access Journals (Sweden)

    Furqan Jameel

    2017-05-01

    Full Text Available Application-oriented Wireless Sensor Networks (WSNs promises to be one of the most useful technologies of this century. However, secure communication between nodes in WSNs is still an unresolved issue. In this context, we propose two protocols (i.e. Optimal Secure Path (OSP and Sub-optimal Secure Path (SSP to minimize the outage probability of secrecy capacity in the presence of multiple eavesdroppers. We consider dissimilar fading at the main and wiretap link and provide detailed evaluation of the impact of Nakagami-m and Rician-K factors on the secrecy performance of WSNs. Extensive simulations are performed to validate our findings. Although the optimal scheme ensures more security, yet the sub-optimal scheme proves to be a more practical approach to secure wireless links.

  11. Path synthesis of four-bar mechanisms using synergy of polynomial neural network and Stackelberg game theory

    Science.gov (United States)

    Ahmadi, Bahman; Nariman-zadeh, Nader; Jamali, Ali

    2017-06-01

    In this article, a novel approach based on game theory is presented for multi-objective optimal synthesis of four-bar mechanisms. The multi-objective optimization problem is modelled as a Stackelberg game. The more important objective function, tracking error, is considered as the leader, and the other objective function, deviation of the transmission angle from 90° (TA), is considered as the follower. In a new approach, a group method of data handling (GMDH)-type neural network is also utilized to construct an approximate model for the rational reaction set (RRS) of the follower. Using the proposed game-theoretic approach, the multi-objective optimal synthesis of a four-bar mechanism is then cast into a single-objective optimal synthesis using the leader variables and the obtained RRS of the follower. The superiority of using the synergy game-theoretic method of Stackelberg with a GMDH-type neural network is demonstrated for two case studies on the synthesis of four-bar mechanisms.

  12. Systematic Analysis of the Multiple Bioactivities of Green Tea through a Network Pharmacology Approach

    Directory of Open Access Journals (Sweden)

    Shoude Zhang

    2014-01-01

    Full Text Available During the past decades, a number of studies have demonstrated multiple beneficial health effects of green tea. Polyphenolics are the most biologically active components of green tea. Many targets can be targeted or affected by polyphenolics. In this study, we excavated all of the targets of green tea polyphenolics (GTPs though literature mining and target calculation and analyzed the multiple pharmacology actions of green tea comprehensively through a network pharmacology approach. In the end, a total of 200 Homo sapiens targets were identified for fifteen GTPs. These targets were classified into six groups according to their related disease, which included cancer, diabetes, neurodegenerative disease, cardiovascular disease, muscular disease, and inflammation. Moreover, these targets mapped into 143 KEGG pathways, 26 of which were more enriched, as determined though pathway enrichment analysis and target-pathway network analysis. Among the identified pathways, 20 pathways were selected for analyzing the mechanisms of green tea in these diseases. Overall, this study systematically illustrated the mechanisms of the pleiotropic activity of green tea by analyzing the corresponding “drug-target-pathway-disease” interaction network.

  13. Joint multiple fully connected convolutional neural network with extreme learning machine for hepatocellular carcinoma nuclei grading.

    Science.gov (United States)

    Li, Siqi; Jiang, Huiyan; Pang, Wenbo

    2017-05-01

    Accurate cell grading of cancerous tissue pathological image is of great importance in medical diagnosis and treatment. This paper proposes a joint multiple fully connected convolutional neural network with extreme learning machine (MFC-CNN-ELM) architecture for hepatocellular carcinoma (HCC) nuclei grading. First, in preprocessing stage, each grayscale image patch with the fixed size is obtained using center-proliferation segmentation (CPS) method and the corresponding labels are marked under the guidance of three pathologists. Next, a multiple fully connected convolutional neural network (MFC-CNN) is designed to extract the multi-form feature vectors of each input image automatically, which considers multi-scale contextual information of deep layer maps sufficiently. After that, a convolutional neural network extreme learning machine (CNN-ELM) model is proposed to grade HCC nuclei. Finally, a back propagation (BP) algorithm, which contains a new up-sample method, is utilized to train MFC-CNN-ELM architecture. The experiment comparison results demonstrate that our proposed MFC-CNN-ELM has superior performance compared with related works for HCC nuclei grading. Meanwhile, external validation using ICPR 2014 HEp-2 cell dataset shows the good generalization of our MFC-CNN-ELM architecture. Copyright © 2017 Elsevier Ltd. All rights reserved.

  14. The heat-shock protein/chaperone network and multiple stress resistance.

    Science.gov (United States)

    Jacob, Pierre; Hirt, Heribert; Bendahmane, Abdelhafid

    2017-04-01

    Crop yield has been greatly enhanced during the last century. However, most elite cultivars are adapted to temperate climates and are not well suited to more stressful conditions. In the context of climate change, stress resistance is a major concern. To overcome these difficulties, scientists may help breeders by providing genetic markers associated with stress resistance. However, multistress resistance cannot be obtained from the simple addition of single stress resistance traits. In the field, stresses are unpredictable and several may occur at once. Consequently, the use of single stress resistance traits is often inadequate. Although it has been historically linked with the heat stress response, the heat-shock protein (HSP)/chaperone network is a major component of multiple stress responses. Among the HSP/chaperone 'client proteins', many are primary metabolism enzymes and signal transduction components with essential roles for the proper functioning of a cell. HSPs/chaperones are controlled by the action of diverse heat-shock factors, which are recruited under stress conditions. In this review, we give an overview of the regulation of the HSP/chaperone network with a focus on Arabidopsis thaliana. We illustrate the role of HSPs/chaperones in regulating diverse signalling pathways and discuss several basic principles that should be considered for engineering multiple stress resistance in crops through the HSP/chaperone network. © 2016 The Authors. Plant Biotechnology Journal published by Society for Experimental Biology and The Association of Applied Biologists and John Wiley & Sons Ltd.

  15. Identification of Multiple-Mode Linear Models Based on Particle Swarm Optimizer with Cyclic Network Mechanism

    Directory of Open Access Journals (Sweden)

    Tae-Hyoung Kim

    2017-01-01

    Full Text Available This paper studies the metaheuristic optimizer-based direct identification of a multiple-mode system consisting of a finite set of linear regression representations of subsystems. To this end, the concept of a multiple-mode linear regression model is first introduced, and its identification issues are established. A method for reducing the identification problem for multiple-mode models to an optimization problem is also described in detail. Then, to overcome the difficulties that arise because the formulated optimization problem is inherently ill-conditioned and nonconvex, the cyclic-network-topology-based constrained particle swarm optimizer (CNT-CPSO is introduced, and a concrete procedure for the CNT-CPSO-based identification methodology is developed. This scheme requires no prior knowledge of the mode transitions between subsystems and, unlike some conventional methods, can handle a large amount of data without difficulty during the identification process. This is one of the distinguishing features of the proposed method. The paper also considers an extension of the CNT-CPSO-based identification scheme that makes it possible to simultaneously obtain both the optimal parameters of the multiple submodels and a certain decision parameter involved in the mode transition criteria. Finally, an experimental setup using a DC motor system is established to demonstrate the practical usability of the proposed metaheuristic optimizer-based identification scheme for developing a multiple-mode linear regression model.

  16. Paths correlation matrix.

    Science.gov (United States)

    Qian, Weixian; Zhou, Xiaojun; Lu, Yingcheng; Xu, Jiang

    2015-09-15

    Both the Jones and Mueller matrices encounter difficulties when physically modeling mixed materials or rough surfaces due to the complexity of light-matter interactions. To address these issues, we derived a matrix called the paths correlation matrix (PCM), which is a probabilistic mixture of Jones matrices of every light propagation path. Because PCM is related to actual light propagation paths, it is well suited for physical modeling. Experiments were performed, and the reflection PCM of a mixture of polypropylene and graphite was measured. The PCM of the mixed sample was accurately decomposed into pure polypropylene's single reflection, pure graphite's single reflection, and depolarization caused by multiple reflections, which is consistent with the theoretical derivation. Reflection parameters of rough surface can be calculated from PCM decomposition, and the results fit well with the theoretical calculations provided by the Fresnel equations. These theoretical and experimental analyses verify that PCM is an efficient way to physically model light-matter interactions.

  17. The influence of single neuron dynamics and network topology on time delay-induced multiple synchronous behaviors in inhibitory coupled network

    International Nuclear Information System (INIS)

    Zhao, Zhiguo; Gu, Huaguang

    2015-01-01

    Highlights: • Time delay-induced multiple synchronous behaviors was simulated in neuronal networks. • Multiple behaviors appear at time delays shorter than a bursting period of neurons. • The more spikes per burst of bursting, the more synchronous regions of time delay. • From regular to random via small-world networks, synchronous degree becomes weak. • An interpretation of the multiple behaviors and the influence of network are provided. - Abstract: Time delay induced-multiple synchronous behaviors are simulated in neuronal network composed of many inhibitory neurons and appear at different time delays shorter than a period of endogenous bursting of individual neurons. It is different from previous investigations wherein only one of multiple synchronous behaviors appears at time delay shorter than a period of endogenous firing and others appear at time delay longer than the period duration. The bursting patterns of the synchronous behaviors are identified based on the dynamics of an individual neuron stimulated by a signal similar to the inhibitory coupling current, which is applied at the decaying branch of a spike and suitable phase within the quiescent state of the endogenous bursting. If a burst of endogenous bursting contains more spikes, the synchronous behaviors appear at more regions of time delay. As the coupling strength increases, the multiple synchronous behaviors appear in a sequence because the different threshold of coupling current or strength is needed to achieve synchronous behaviors. From regular, to small-world, and to random networks, synchronous degree of the multiple synchronous behaviors becomes weak, and synchronous bursting patterns with lower spikes per burst disappear, which is properly interpreted by the difference of coupling current between neurons induced by different degree and the high threshold of coupling current to achieve synchronization for the absent synchronous bursting patterns. The results of the influence of

  18. Discrete event command and control for networked teams with multiple missions

    Science.gov (United States)

    Lewis, Frank L.; Hudas, Greg R.; Pang, Chee Khiang; Middleton, Matthew B.; McMurrough, Christopher

    2009-05-01

    During mission execution in military applications, the TRADOC Pamphlet 525-66 Battle Command and Battle Space Awareness capabilities prescribe expectations that networked teams will perform in a reliable manner under changing mission requirements, varying resource availability and reliability, and resource faults. In this paper, a Command and Control (C2) structure is presented that allows for computer-aided execution of the networked team decision-making process, control of force resources, shared resource dispatching, and adaptability to change based on battlefield conditions. A mathematically justified networked computing environment is provided called the Discrete Event Control (DEC) Framework. DEC has the ability to provide the logical connectivity among all team participants including mission planners, field commanders, war-fighters, and robotic platforms. The proposed data management tools are developed and demonstrated on a simulation study and an implementation on a distributed wireless sensor network. The results show that the tasks of multiple missions are correctly sequenced in real-time, and that shared resources are suitably assigned to competing tasks under dynamically changing conditions without conflicts and bottlenecks.

  19. The function of communities in protein interaction networks at multiple scales

    Directory of Open Access Journals (Sweden)

    Jones Nick S

    2010-07-01

    Full Text Available Abstract Background If biology is modular then clusters, or communities, of proteins derived using only protein interaction network structure should define protein modules with similar biological roles. We investigate the link between biological modules and network communities in yeast and its relationship to the scale at which we probe the network. Results Our results demonstrate that the functional homogeneity of communities depends on the scale selected, and that almost all proteins lie in a functionally homogeneous community at some scale. We judge functional homogeneity using a novel test and three independent characterizations of protein function, and find a high degree of overlap between these measures. We show that a high mean clustering coefficient of a community can be used to identify those that are functionally homogeneous. By tracing the community membership of a protein through multiple scales we demonstrate how our approach could be useful to biologists focusing on a particular protein. Conclusions We show that there is no one scale of interest in the community structure of the yeast protein interaction network, but we can identify the range of resolution parameters that yield the most functionally coherent communities, and predict which communities are most likely to be functionally homogeneous.

  20. A Systematic Scheme for Multiple Access in Ethernet Passive Optical Access Networks

    Science.gov (United States)

    Ma, Maode; Zhu, Yongqing; Hiang Cheng, Tee

    2005-11-01

    While backbone networks have experienced substantial changes in the last decade, access networks have not changed much. Recently, passive optical networks (PONs) seem to be ready for commercial deployment as access networks, due to the maturity of a number of enabling technologies. Among the PON technologies, Ethernet PON (EPON) standardized by the IEEE 802.3ah Ethernet in the First Mile (EFM) Task Force is the most attractive one because of its high speed, low cost, familiarity, interoperability, and low overhead. In this paper, we consider the issue of upstream channel sharing in the EPONs. We propose a novel multiple-access control scheme to provide bandwidth-guaranteed service for high-demand customers, while providing best effort service to low-demand customers according to the service level agreement (SLA). The analytical and simulation results prove that the proposed scheme performs best in what it is designed to do compared to another well-known scheme that has not considered providing differentiated services. With business customers preferring premium services with guaranteed bandwidth and residential users preferring low-cost best effort services, our scheme could benefit both groups of subscribers, as well as the operators.

  1. Three-Way Channels With Multiple Unicast Sessions: Capacity Approximation via Network Transformation

    KAUST Repository

    Chaaban, Anas

    2016-09-28

    A network of three nodes mutually communicating with each other is studied. This multi-way network is a suitable model for three-user device-to-device communications. The main goal of this paper is to characterize the capacity region of the underlying Gaussian three-way channel (3WC) within a constant gap. To this end, a capacity outer bound is derived using cut-set bounds and genie-aided bounds. For achievability, the 3WC is first transformed into an equivalent star channel. This latter is then decomposed into a set of “successive” sub-channels, leading to a sub-channel allocation problem. Using backward decoding, interference neutralization, and known results on the capacity of the star-channel relying of physical-layer network coding, an achievable rate region for the 3WC is obtained. It is then shown that the achievable rate region is within a constant gap of the developed outer bound, leading to the desired capacity approximation. Interestingly, in contrast to the Gaussian two-way channel (TWC), adaptation is necessary in the 3WC. Furthermore, message splitting is another ingredient of the developed scheme for the 3WC, which is not required in the TWC. The two setups are, however, similar in terms of their sum-capacity pre-log, which is equal to 2. Finally, some interesting networks and their approximate capacities are recovered as special cases of the 3WC, such as the cooperative broadcast channel and multiple access channel.

  2. Symbolic dynamics and synchronization of coupled map networks with multiple delays

    International Nuclear Information System (INIS)

    Atay, Fatihcan M.; Jalan, Sarika; Jost, Juergen

    2010-01-01

    We use symbolic dynamics to study discrete-time dynamical systems with multiple time delays. We exploit the concept of avoiding sets, which arise from specific non-generating partitions of the phase space and restrict the occurrence of certain symbol sequences related to the characteristics of the dynamics. In particular, we show that the resulting forbidden sequences are closely related to the time delays in the system. We present two applications to coupled map lattices, namely (1) detecting synchronization and (2) determining unknown values of the transmission delays in networks with possibly directed and weighted connections and measurement noise. The method is applicable to multi-dimensional as well as set-valued maps, and to networks with time-varying delays and connection structure.

  3. A Neural Network Model to Learn Multiple Tasks under Dynamic Environments

    Science.gov (United States)

    Tsumori, Kenji; Ozawa, Seiichi

    When environments are dynamically changed for agents, the knowledge acquired in an environment might be useless in future. In such dynamic environments, agents should be able to not only acquire new knowledge but also modify old knowledge in learning. However, modifying all knowledge acquired before is not efficient because the knowledge once acquired may be useful again when similar environment reappears and some knowledge can be shared among different environments. To learn efficiently in such environments, we propose a neural network model that consists of the following modules: resource allocating network, long-term & short-term memory, and environment change detector. We evaluate the model under a class of dynamic environments where multiple function approximation tasks are sequentially given. The experimental results demonstrate that the proposed model possesses stable incremental learning, accurate environmental change detection, proper association and recall of old knowledge, and efficient knowledge transfer.

  4. Multiple Time Series Forecasting Using Quasi-Randomized Functional Link Neural Networks

    Directory of Open Access Journals (Sweden)

    Thierry Moudiki

    2018-03-01

    Full Text Available We are interested in obtaining forecasts for multiple time series, by taking into account the potential nonlinear relationships between their observations. For this purpose, we use a specific type of regression model on an augmented dataset of lagged time series. Our model is inspired by dynamic regression models (Pankratz 2012, with the response variable’s lags included as predictors, and is known as Random Vector Functional Link (RVFL neural networks. The RVFL neural networks have been successfully applied in the past, to solving regression and classification problems. The novelty of our approach is to apply an RVFL model to multivariate time series, under two separate regularization constraints on the regression parameters.

  5. Use of multiple dispersal pathways facilitates amphibian persistence in stream networks

    Science.gov (United States)

    Campbell, Grant E.H.; Nichols, J.D.; Lowe, W.H.; Fagan, W.F.

    2010-01-01

    Although populations of amphibians are declining worldwide, there is no evidence that salamanders occupying small streams are experiencing enigmatic declines, and populations of these species seem stable. Theory predicts that dispersal through multiple pathways can stabilize populations, preventing extinction in habitat networks. However, empirical data to support this prediction are absent for most species, especially those at risk of decline. Our mark-recapture study of stream salamanders reveals both a strong upstream bias in dispersal and a surprisingly high rate of overland dispersal to adjacent headwater streams. This evidence of route-dependent variation in dispersal rates suggests a spatial mechanism for population stability in headwater-stream salamanders. Our results link the movement behavior of stream salamanders to network topology, and they underscore the importance of identifying and protecting critical dispersal pathways when addressing region-wide population declines.

  6. Use of multiple dispersal pathways facilitates amphibian persistence in stream networks.

    Science.gov (United States)

    Campbell Grant, Evan H; Nichols, James D; Lowe, Winsor H; Fagan, William F

    2010-04-13

    Although populations of amphibians are declining worldwide, there is no evidence that salamanders occupying small streams are experiencing enigmatic declines, and populations of these species seem stable. Theory predicts that dispersal through multiple pathways can stabilize populations, preventing extinction in habitat networks. However, empirical data to support this prediction are absent for most species, especially those at risk of decline. Our mark-recapture study of stream salamanders reveals both a strong upstream bias in dispersal and a surprisingly high rate of overland dispersal to adjacent headwater streams. This evidence of route-dependent variation in dispersal rates suggests a spatial mechanism for population stability in headwater-stream salamanders. Our results link the movement behavior of stream salamanders to network topology, and they underscore the importance of identifying and protecting critical dispersal pathways when addressing region-wide population declines.

  7. Novel global robust stability criteria for interval neural networks with multiple time-varying delays

    International Nuclear Information System (INIS)

    Xu Shengyuan; Lam, James; Ho, Daniel W.C.

    2005-01-01

    This Letter is concerned with the problem of robust stability analysis for interval neural networks with multiple time-varying delays and parameter uncertainties. The parameter uncertainties are assumed to be bounded in given compact sets and the activation functions are supposed to be bounded and globally Lipschitz continuous. A sufficient condition is obtained by means of Lyapunov functionals, which guarantees the existence, uniqueness and global asymptotic stability of the delayed neural network for all admissible uncertainties. This condition is in terms of a linear matrix inequality (LMI), which can be easily checked by using recently developed algorithms in solving LMIs. Finally, a numerical example is provided to demonstrate the effectiveness of the proposed method

  8. A sum-over-paths algorithm for third-order impulse-response moment extraction within RC IC-interconnect networks

    Science.gov (United States)

    Wojcik, E. A.; Ni, D.; Lam, T. M.; Le Coz, Y. L.

    2015-07-01

    We have created the first stochastic SoP (Sum-over-Paths) algorithm to extract third-order impulse-response (IR) moment within RC IC interconnects. It employs a newly discovered Feynman SoP Postulate. Importantly, our algorithm maintains computational efficiency and full parallelism. Our approach begins with generation of s-domain nodal-voltage equations. We then perform a Taylor-series expansion of the circuit transfer function. These expansions yield transition diagrams involving mathematical coupling constants, or weight factors, in integral powers of complex frequency s. Our SoP Postulate enables stochastic evaluation of path sums within the circuit transition diagram to order s3-corresponding to the order of IR moment (m3) we seek here. We furnish, for the first time, an informal algebraic proof independently validating our SoP Postulate and algorithm. We list, as well, detailed procedural steps, suitable for coding, that define an efficient stochastic algorithm for m3 IR extraction. Origins of the algorithm's statistical "capacitor-number cubed" correction and "double-counting" weight factors are explained, for completeness. Our algorithm was coded and successfully tested against exact analytical solutions for 3-, 5-, and 10-stage RC lines. We achieved better than 0.65% 1-σ error convergence, after only 10K statistical samples, in less than 1 s of 2-GHz Pentium® execution time. These results continue to suggest that stochastic SoP algorithms may find useful application in circuit analysis of massively coupled networks, such as those encountered in high-end digital IC-interconnect CAD.

  9. Cloud Droplet Size and Liquid Water Path Retrievals From Zenith Radiance Measurements: Examples From the Atmospheric Radiation Measurement Program and the Aerosol Robotic Network

    Science.gov (United States)

    Chiu, J. C.; Marshak, A.; Huang, C.-H.; Varnai, T.; Hogan, R. J.; Giles, D. M.; Holben, B. N.; Knyazikhin, Y.; O'Connor, E. J.; Wiscombe, W. J.

    2012-01-01

    The ground-based Atmospheric Radiation Measurement Program (ARM) and NASA Aerosol Robotic Network (AERONET) routinely monitor clouds using zenith radiances at visible and near-infrared wavelengths. Using the transmittance calculated from such measurements, we have developed a new retrieval method for cloud effective droplet size and conducted extensive tests for non-precipitating liquid water clouds. The underlying principle is to combine a water-absorbing wavelength (i.e. 1640 nm) with a nonwater-absorbing wavelength for acquiring information on cloud droplet size and optical depth. For simulated stratocumulus clouds with liquid water path less than 300 g/sq m and horizontal resolution of 201m, the retrieval method underestimates the mean effective radius by 0.8 m, with a root-mean-squared error of 1.7 m and a relative deviation of 13 %. For actual observations with a liquid water path less than 450 gm.2 at the ARM Oklahoma site during 2007-2008, our 1.5 min-averaged retrievals are generally larger by around 1 m than those from combined ground-based cloud radar and microwave radiometer at a 5min temporal resolution. We also compared our retrievals to those from combined shortwave flux and microwave observations for relatively homogeneous clouds, showing that the bias between these two retrieval sets is negligible, but the error of 2.6 m and the relative deviation of 22% are larger than those found in our simulation case. Finally, the transmittance-based cloud effective droplet radii agree to better than 11% with satellite observations and have a negative bias of 1 m. Overall, the retrieval method provides reasonable cloud effective radius estimates, which can enhance the cloud products of both ARM and AERONET.

  10. Common Virtual Path and Its Expedience for VBR Video Traffic

    Directory of Open Access Journals (Sweden)

    E. Chromy

    2008-04-01

    Full Text Available The paper deals with utilization of common Virtual Path (VP for variable bit rate (VBR video service. Video service is one of the main services for broadband networks. Research is oriented to statistical properties of common and separate VPs. Separate VP means that for each VBR traffic source one VP will be allocated. Common VP means that for multiple VBR sources one common VP is allocated. VBR video traffic source is modeled by discrete Markov chain.

  11. A Suboptimal Power-Saving Transmission Scheme in Multiple Component Carrier Networks

    Science.gov (United States)

    Chung, Yao-Liang; Tsai, Zsehong

    Power consumption due to transmissions in base stations (BSs) has been a major contributor to communication-related CO2 emissions. A power optimization model is developed in this study with respect to radio resource allocation and activation in a multiple Component Carrier (CC) environment. We formulate and solve the power-minimization problem of the BS transceivers for multiple-CC networks with carrier aggregation, while maintaining the overall system and respective users' utilities above minimum levels. The optimized power consumption based on this model can be viewed as a lower bound of that of other algorithms employed in practice. A suboptimal scheme with low computation complexity is proposed. Numerical results show that the power consumption of our scheme is much better than that of the conventional one in which all CCs are always active, if both schemes maintain the same required utilities.

  12. A distributed Synchronous reservation multiple access control protocol for mobile Ad hoc networks

    Institute of Scientific and Technical Information of China (English)

    ZHANG Yanling; SUN Xianpu; LI Jiandong

    2007-01-01

    This study proposes a new multiple access control protocol named distributed synchronous reservation multiple access control protocol.in which the hidden and exposed terminal problems are solved,and the quality of service(QoS)requirements for real-time traffic are guaranteed.The protocol is founded on time division multiplex address and a different type of traffic is assigned to difierent priority,according to which a node should compete for and reserve the free slots in a different method.Moreover,there is a reservation acknowledgement process before data transmit in each reserved slot,so that the intruded terminal problem is solved.The throughput and average packets drop probability of this protocol are analyzed and simulated in a fully connected network.the results of which indicate that this protocol is efficient enough to support the real-time traffic.and it is more suitable to MANETs.

  13. Power Allocation in Multiple Access Networks: Implementation Aspects via Verhulst and Perron-Frobenius Models

    Directory of Open Access Journals (Sweden)

    Fábio Engel de Camargo

    2012-11-01

    Full Text Available In this work, the Verhulst model and the Perron-Frobenius theorem are applied on the power control problem which is a concern in multiple access communication networks due to the multiple access interference. This paper deals with the performance versus complexity tradeoff of both power control algorithm (PCA, as well as highlights the computational cost aspects regarding the implementability of distributed PCA (DPCA version for both algorithms. As a proof-of-concept the DPCA implementation is carried out deploying a commercial point-floating DSP platform. Numerical results in terms of DSP cycles and computational time as well indicate a feasibility of implementing the PCA-Verhulst model in 2G and 3G cellular systems; b high computational cost for the PCA-Perron-Frobenius model.

  14. A genetic algorithm for multiple relay selection in two-way relaying cognitive radio networks

    KAUST Repository

    Alsharoa, Ahmad M.

    2013-09-01

    In this paper, we investigate a multiple relay selection scheme for two-way relaying cognitive radio networks where primary users and secondary users operate on the same frequency band. More specifically, cooperative relays using Amplifyand- Forward (AF) protocol are optimally selected to maximize the sum rate of the secondary users without degrading the Quality of Service (QoS) of the primary users by respecting a tolerated interference threshold. A strong optimization tool based on genetic algorithm is employed to solve our formulated optimization problem where discrete relay power levels are considered. Our simulation results show that the practical heuristic approach achieves almost the same performance of the optimal multiple relay selection scheme either with discrete or continuous power distributions. Copyright © 2013 by the Institute of Electrical and Electronic Engineers, Inc.

  15. A low complexity algorithm for multiple relay selection in two-way relaying Cognitive Radio networks

    KAUST Repository

    Alsharoa, Ahmad M.

    2013-06-01

    In this paper, a multiple relay selection scheme for two-way relaying cognitive radio network is investigated. We consider a cooperative Cognitive Radio (CR) system with spectrum sharing scenario using Amplify-and-Forward (AF) protocol, where licensed users and unlicensed users operate on the same frequency band. The main objective is to maximize the sum rate of the unlicensed users allowed to share the spectrum with the licensed users by respecting a tolerated interference threshold. A practical low complexity heuristic approach is proposed to solve our formulated optimization problem. Selected numerical results show that the proposed algorithm reaches a performance close to the performance of the optimal multiple relay selection scheme either with discrete or continuous power distributions while providing a considerable saving in terms of computational complexity. In addition, these results show that our proposed scheme significantly outperforms the single relay selection scheme. © 2013 IEEE.

  16. Networking Multiple Autonomous Air and Ocean Vehicles for Oceanographic Research and Monitoring

    Science.gov (United States)

    McGillivary, P. A.; Borges de Sousa, J.; Rajan, K.

    2013-12-01

    Autonomous underwater and surface vessels (AUVs and ASVs) are coming into wider use as components of oceanographic research, including ocean observing systems. Unmanned airborne vehicles (UAVs) are now available at modest cost, allowing multiple UAVs to be deployed with multiple AUVs and ASVs. For optimal use good communication and coordination among vehicles is essential. We report on the use of multiple AUVs networked in communication with multiple UAVs. The UAVs are augmented by inferential reasoning software developed at MBARI that allows UAVs to recognize oceanographic fronts and change their navigation and control. This in turn allows UAVs to automatically to map frontal features, as well as to direct AUVs and ASVs to proceed to such features and conduct sampling via onboard sensors to provide validation for airborne mapping. ASVs can also act as data nodes for communication between UAVs and AUVs, as well as collecting data from onboard sensors, while AUVs can sample the water column vertically. This allows more accurate estimation of phytoplankton biomass and productivity, and can be used in conjunction with UAV sampling to determine air-sea flux of gases (e.g. CO2, CH4, DMS) affecting carbon budgets and atmospheric composition. In particular we describe tests in July 2013 conducted off Sesimbra, Portugal in conjunction with the Portuguese Navy by the University of Porto and MBARI with the goal of tracking large fish in the upper water column with coordinated air/surface/underwater measurements. A thermal gradient was observed in the infrared by a low flying UAV, which was used to dispatch an AUV to obtain ground truth to demonstrate the event-response capabilities using such autonomous platforms. Additional field studies in the future will facilitate integration of multiple unmanned systems into research vessel operations. The strength of hardware and software tools described in this study is to permit fundamental oceanographic measurements of both ocean

  17. Estimating Single and Multiple Target Locations Using K-Means Clustering with Radio Tomographic Imaging in Wireless Sensor Networks

    Science.gov (United States)

    2015-03-26

    clustering is an algorithm that has been used in data mining applications such as machine learning applications , pattern recognition, hyper-spectral imagery...42 3.7.2 Application of K-means Clustering . . . . . . . . . . . . . . . . . 42 3.8 Experiment Design...Tomographic Imaging WLAN Wireless Local Area Networks WSN Wireless Sensor Network xx ESTIMATING SINGLE AND MULTIPLE TARGET LOCATIONS USING K-MEANS CLUSTERING

  18. Nonadditivity of quantum and classical capacities for entanglement breaking multiple-access channels and the butterfly network

    International Nuclear Information System (INIS)

    Grudka, Andrzej; Horodecki, Pawel

    2010-01-01

    We analyze quantum network primitives which are entanglement breaking. We show superadditivity of quantum and classical capacity regions for quantum multiple-access channels and the quantum butterfly network. Since the effects are especially visible at high noise they suggest that quantum information effects may be particularly helpful in the case of the networks with occasional high noise rates. The present effects provide a qualitative borderline between superadditivities of bipartite and multipartite systems.

  19. Network meta-analysis of multiple outcome measures accounting for borrowing of information across outcomes.

    Science.gov (United States)

    Achana, Felix A; Cooper, Nicola J; Bujkiewicz, Sylwia; Hubbard, Stephanie J; Kendrick, Denise; Jones, David R; Sutton, Alex J

    2014-07-21

    Network meta-analysis (NMA) enables simultaneous comparison of multiple treatments while preserving randomisation. When summarising evidence to inform an economic evaluation, it is important that the analysis accurately reflects the dependency structure within the data, as correlations between outcomes may have implication for estimating the net benefit associated with treatment. A multivariate NMA offers a framework for evaluating multiple treatments across multiple outcome measures while accounting for the correlation structure between outcomes. The standard NMA model is extended to multiple outcome settings in two stages. In the first stage, information is borrowed across outcomes as well across studies through modelling the within-study and between-study correlation structure. In the second stage, we make use of the additional assumption that intervention effects are exchangeable between outcomes to predict effect estimates for all outcomes, including effect estimates on outcomes where evidence is either sparse or the treatment had not been considered by any one of the studies included in the analysis. We apply the methods to binary outcome data from a systematic review evaluating the effectiveness of nine home safety interventions on uptake of three poisoning prevention practices (safe storage of medicines, safe storage of other household products, and possession of poison centre control telephone number) in households with children. Analyses are conducted in WinBUGS using Markov Chain Monte Carlo (MCMC) simulations. Univariate and the first stage multivariate models produced broadly similar point estimates of intervention effects but the uncertainty around the multivariate estimates varied depending on the prior distribution specified for the between-study covariance structure. The second stage multivariate analyses produced more precise effect estimates while enabling intervention effects to be predicted for all outcomes, including intervention effects on

  20. Single- and Multiple-Objective Optimization with Differential Evolution and Neural Networks

    Science.gov (United States)

    Rai, Man Mohan

    2006-01-01

    Genetic and evolutionary algorithms have been applied to solve numerous problems in engineering design where they have been used primarily as optimization procedures. These methods have an advantage over conventional gradient-based search procedures became they are capable of finding global optima of multi-modal functions and searching design spaces with disjoint feasible regions. They are also robust in the presence of noisy data. Another desirable feature of these methods is that they can efficiently use distributed and parallel computing resources since multiple function evaluations (flow simulations in aerodynamics design) can be performed simultaneously and independently on ultiple processors. For these reasons genetic and evolutionary algorithms are being used more frequently in design optimization. Examples include airfoil and wing design and compressor and turbine airfoil design. They are also finding increasing use in multiple-objective and multidisciplinary optimization. This lecture will focus on an evolutionary method that is a relatively new member to the general class of evolutionary methods called differential evolution (DE). This method is easy to use and program and it requires relatively few user-specified constants. These constants are easily determined for a wide class of problems. Fine-tuning the constants will off course yield the solution to the optimization problem at hand more rapidly. DE can be efficiently implemented on parallel computers and can be used for continuous, discrete and mixed discrete/continuous optimization problems. It does not require the objective function to be continuous and is noise tolerant. DE and applications to single and multiple-objective optimization will be included in the presentation and lecture notes. A method for aerodynamic design optimization that is based on neural networks will also be included as a part of this lecture. The method offers advantages over traditional optimization methods. It is more

  1. White matter tract network disruption explains reduced conscientiousness in multiple sclerosis.

    Science.gov (United States)

    Fuchs, Tom A; Dwyer, Michael G; Kuceyeski, Amy; Choudhery, Sanjeevani; Carolus, Keith; Li, Xian; Mallory, Matthew; Weinstock-Guttman, Bianca; Jakimovski, Dejan; Ramasamy, Deepa; Zivadinov, Robert; Benedict, Ralph H B

    2018-05-08

    Quantifying white matter (WM) tract disruption in people with multiple sclerosis (PwMS) provides a novel means for investigating the relationship between defective network connectivity and clinical markers. PwMS exhibit perturbations in personality, where decreased Conscientiousness is particularly prominent. This trait deficit influences disease trajectory and functional outcomes such as work capacity. We aimed to identify patterns of WM tract disruption related to decreased Conscientiousness in PwMS. Personality assessment and brain MRI were obtained in 133 PwMS and 49 age- and sex-matched healthy controls (HC). Lesion maps were applied to determine the severity of WM tract disruption between pairs of gray matter regions. Next, the Network-Based-Statistics tool was applied to identify structural networks whose disruption negatively correlates with Conscientiousness. Finally, to determine whether these networks explain unique variance above conventional MRI measures and cognition, regression models were applied controlling for age, sex, brain volume, T2-lesion volume, and cognition. Relative to HCs, PwMS exhibited lower Conscientiousness and slowed cognitive processing speed (p = .025, p = .006). Lower Conscientiousness in PwMS was significantly associated with WM tract disruption between frontal, frontal-parietal, and frontal-cingulate pathways in the left (p = .02) and right (p = .01) hemisphere. The mean disruption of these pathways explained unique additive variance in Conscientiousness, after accounting for conventional MRI markers of pathology and cognition (ΔR 2  = .049, p = .029). Damage to WM tracts between frontal, frontal-parietal, and frontal-cingulate cortical regions is significantly correlated with reduced Conscientiousness in PwMS. Tract disruption within these networks explains decreased Conscientiousness observed in PwMS as compared with HCs. © 2018 Wiley Periodicals, Inc.

  2. A space weather forecasting system with multiple satellites based on a self-recognizing network.

    Science.gov (United States)

    Tokumitsu, Masahiro; Ishida, Yoshiteru

    2014-05-05

    This paper proposes a space weather forecasting system at geostationary orbit for high-energy electron flux (>2 MeV). The forecasting model involves multiple sensors on multiple satellites. The sensors interconnect and evaluate each other to predict future conditions at geostationary orbit. The proposed forecasting model is constructed using a dynamic relational network for sensor diagnosis and event monitoring. The sensors of the proposed model are located at different positions in space. The satellites for solar monitoring equip with monitoring devices for the interplanetary magnetic field and solar wind speed. The satellites orbit near the Earth monitoring high-energy electron flux. We investigate forecasting for typical two examples by comparing the performance of two models with different numbers of sensors. We demonstrate the prediction by the proposed model against coronal mass ejections and a coronal hole. This paper aims to investigate a possibility of space weather forecasting based on the satellite network with in-situ sensing.

  3. Cross-Layer Design for Two-Way Relaying Networks with Multiple Antennas

    Directory of Open Access Journals (Sweden)

    zhuo wu

    2015-10-01

    Full Text Available In this paper, we developed a cross-layer design for two-way relaying (TWR networks with multiple antennas, where two single antenna source nodes exchange information with the aid of one multiple antenna relay node. The proposed cross-layer design considers adaptive modulation (AM and space-time block coding (STBC at the physical layer with an automatic repeat request (ARQ protocol at the data link layer, in order to maximize the spectral efficiency under specific delay and packet error ratio (PER constraints. An MMSE-interference cancellation (IC receiver is employed at the relay node, to remove the interference in the fist phase of the TWR transmission. The transmission mode is updated for each phase of the TWR transmission on a frame-by-frame basis, to match the time-varying channel conditions and exploit the system performance and throughput gain. Simulation results show that retransmission at the data link layer could alleviate rigorous error-control requirements at the physical layer, and thereby allows higher data transmission. As a result, cross-layer design helps to achieve considerable system spectral efficiency gain for TWR networks, compared to those without cross-layer design.

  4. Real-time multiple networked viewer capability of the DIII-D EC data acquisition system

    International Nuclear Information System (INIS)

    Ponce, D.; Gorelov, I.A.; Chiu, H.K.; Baity, F.W.

    2005-01-01

    A data acquisition system (DAS) which permits real-time viewing by multiple locally networked operators is being implemented for the electron cyclotron (EC) heating and current drive system at DIII-D. The DAS is expected to demonstrate performance equivalent to standalone oscilloscopes. Participation by remote viewers, including throughout the greater DIII-D facility, can also be incorporated. The real-time system uses one computer-controlled DAS per gyrotron. The DAS computers send their data to a central data server using individual and dedicated 200 Mbps fully duplexed Ethernet connections. The server has a dedicated 10 krpm hard drive for each gyrotron DAS. Selected channels can then be reprocessed and distributed to viewers over a standard local area network (LAN). They can also be bridged from the LAN to the internet. Calculations indicate that the hardware will support real-time writing of each channel at full resolution to the server hard drives. The data will be re-sampled for distribution to multiple viewers over the LAN in real-time. The hardware for this system is in place. The software is under development. This paper will present the design details and up-to-date performance metrics of the system

  5. Sequential interrogation of multiple FBG sensors using LPG modulation and an artificial neural network

    International Nuclear Information System (INIS)

    Basu, Mainak; Ghorai, S K

    2015-01-01

    Interrogating multiple fiber Bragg gratings (FBG) requires highly sensitive spectrum scanning equipment such as optical spectrum analyzers, tunable filters, acousto-optic tunable filters etc, which are expensive, bulky and time consuming. In this paper, we present a new approach for multiple FBG sensor interrogation using long-period gratings and an artificial neural network. The reflection spectra of the multiplexed FBGs are modulated by two long period gratings separately and the modulated optical intensities were detected by two photodetectors. The outputs of the detectors are then used as input in a previously trained artificial neural network to interrogate the FBG sensors. Simulations have been performed to determine the strain and wavelength shift using two and four sensors. The interrogation system has also been demonstrated experimentally for two sensors using simply supported beams in the range of 0–350 μstrain. The proposed interrogation scheme has been found to identify the perturbed FBG, and to determine strain and wavelength shift with reasonable accuracy. (paper)

  6. U.S. Department of Defense Multiple-Parameter Biodosimetry Network

    International Nuclear Information System (INIS)

    Blakely, William F.; Hoefer, Matthew H.; Huff, L. Andrew; Romanyukha, Alexander; Hayes, Selena M.; Williams, Anthony; Sharp, Thad; Reyes, Ricardo A.; Stewart, H. Michael Jr

    2016-01-01

    The U.S. Department of Defense (US-DOD) service members are at risk of exposure to ionizing radiation due to radiation accidents, terrorist attacks and national defense activities. The use of biodosimetry is a standard of care for the triage and treatment of radiation injuries. Resources and procedures need to be established to implement a multiple-parameter biodosimetry system coupled with expert medial guidance to provide an integrated radiation diagnostic system to meet US-DOD requirements. Current US-DOD biodosimetry capabilities were identified and recommendations to fill the identified gaps are provided. A US-DOD Multi-parametric Biodosimetry Network, based on the expertise that resides at the Armed Forces Radiobiology Research Institute and the Naval Dosimetry Center, was designed. This network based on the use of multiple biodosimetry modalities would provide diagnostic and triage capabilities needed to meet US-DOD requirements. These are not available with sufficient capacity elsewhere but could be needed urgently after a major radiological/nuclear event. (authors)

  7. A Space Weather Forecasting System with Multiple Satellites Based on a Self-Recognizing Network

    Directory of Open Access Journals (Sweden)

    Masahiro Tokumitsu

    2014-05-01

    Full Text Available This paper proposes a space weather forecasting system at geostationary orbit for high-energy electron flux (>2 MeV. The forecasting model involves multiple sensors on multiple satellites. The sensors interconnect and evaluate each other to predict future conditions at geostationary orbit. The proposed forecasting model is constructed using a dynamic relational network for sensor diagnosis and event monitoring. The sensors of the proposed model are located at different positions in space. The satellites for solar monitoring equip with monitoring devices for the interplanetary magnetic field and solar wind speed. The satellites orbit near the Earth monitoring high-energy electron flux. We investigate forecasting for typical two examples by comparing the performance of two models with different numbers of sensors. We demonstrate the prediction by the proposed model against coronal mass ejections and a coronal hole. This paper aims to investigate a possibility of space weather forecasting based on the satellite network with in-situ sensing.

  8. Channel capacity of TDD-OFDM-MIMO for multiple access points in a wireless single-frequency-network

    DEFF Research Database (Denmark)

    Takatori, Y.; Fitzek, Frank; Tsunekawa, K.

    2005-01-01

    MIMO data transmission scheme, which combines Single-Frequency-Network (SFN) with TDD-OFDM-MIMO applied for wireless LAN networks. In our proposal, we advocate to use SFN for multiple access points (MAP) MIMO data transmission. The goal of this approach is to achieve very high channel capacity in both......The multiple-input-multiple-output (MIMO) technique is the most attractive candidate to improve the spectrum efficiency in the next generation wireless communication systems. However, the efficiency of MIMO techniques reduces in the line of sight (LOS) environments. In this paper, we propose a new...

  9. Parameter Diversity Induced Multiple Spatial Coherence Resonances and Spiral Waves in Neuronal Network with and Without Noise

    International Nuclear Information System (INIS)

    Li Yuye; Jia Bing; Gu Huaguang; An Shucheng

    2012-01-01

    Diversity in the neurons and noise are inevitable in the real neuronal network. In this paper, parameter diversity induced spiral waves and multiple spatial coherence resonances in a two-dimensional neuronal network without or with noise are simulated. The relationship between the multiple resonances and the multiple transitions between patterns of spiral waves are identified. The coherence degrees induced by the diversity are suppressed when noise is introduced and noise density is increased. The results suggest that natural nervous system might profit from both parameter diversity and noise, provided a possible approach to control formation and transition of spiral wave by the cooperation between the diversity and noise. (general)

  10. Non-Orthogonal Multiple Access for Large-Scale 5G Networks: Interference Aware Design

    KAUST Repository

    Ali, Konpal S.

    2017-09-18

    Non-orthogonal multiple access (NOMA) is promoted as a key component of 5G cellular networks. As the name implies, NOMA operation introduces intracell interference (i.e., interference arising within the cell) to the cellular operation. The intracell interference is managed by careful NOMA design (e.g., user clustering and resource allocation) along with successive interference cancellation. However, most of the proposed NOMA designs are agnostic to intercell interference (i.e., interference from outside the cell), which is a major performance limiting parameter in 5G networks. This article sheds light on the drastic negative-impact of intercell interference on the NOMA performance and advocates interference-aware NOMA design that jointly accounts for both intracell and intercell interference. To this end, a case study for fair NOMA operation is presented and intercell interference mitigation techniques for NOMA networks are discussed. This article also investigates the potential of integrating NOMA with two important 5G transmission schemes, namely, full duplex and device-to-device communication. This is important since the ambitious performance defined by the 3rd Generation Partnership Project (3GPP) for 5G is foreseen to be realized via seamless integration of several new technologies and transmission techniques.

  11. Network hydraulics inclusion in water quality event detection using multiple sensor stations data.

    Science.gov (United States)

    Oliker, Nurit; Ostfeld, Avi

    2015-09-01

    Event detection is one of the current most challenging topics in water distribution systems analysis: how regular on-line hydraulic (e.g., pressure, flow) and water quality (e.g., pH, residual chlorine, turbidity) measurements at different network locations can be efficiently utilized to detect water quality contamination events. This study describes an integrated event detection model which combines multiple sensor stations data with network hydraulics. To date event detection modelling is likely limited to single sensor station location and dataset. Single sensor station models are detached from network hydraulics insights and as a result might be significantly exposed to false positive alarms. This work is aimed at decreasing this limitation through integrating local and spatial hydraulic data understanding into an event detection model. The spatial analysis complements the local event detection effort through discovering events with lower signatures by exploring the sensors mutual hydraulic influences. The unique contribution of this study is in incorporating hydraulic simulation information into the overall event detection process of spatially distributed sensors. The methodology is demonstrated on two example applications using base runs and sensitivity analyses. Results show a clear advantage of the suggested model over single-sensor event detection schemes. Copyright © 2015 Elsevier Ltd. All rights reserved.

  12. A Network Pharmacology Approach to Uncover the Multiple Mechanisms of Hedyotis diffusa Willd. on Colorectal Cancer

    Directory of Open Access Journals (Sweden)

    Xinkui Liu

    2018-01-01

    Full Text Available Background. As one of the most frequently diagnosed cancer diseases globally, colorectal cancer (CRC remains an important cause of cancer-related death. Although the traditional Chinese herb Hedyotis diffusa Willd. (HDW has been proven to be effective for treating CRC in clinical practice, its definite mechanisms have not been completely deciphered. Objective. The aim of our research is to systematically explore the multiple mechanisms of HDW on CRC. Methods. This study adopted the network pharmacology approach, which was mainly composed of active component gathering, target prediction, CRC gene collection, network analysis, and gene enrichment analysis. Results. The network analysis showed that 10 targets might be the therapeutic targets of HDW on CRC, namely, HRAS, PIK3CA, KRAS, TP53, APC, BRAF, GSK3B, CDK2, AKT1, and RAF1. The gene enrichment analysis implied that HDW probably benefits patients with CRC by modulating pathways related to cancers, infectious diseases, endocrine system, immune system, nervous system, signal transduction, cellular community, and cell motility. Conclusions. This study partially verified and predicted the pharmacological and molecular mechanism of HDW against CRC from a holistic perspective, which will also lay a foundation for the further experimental research and clinical rational application of HDW.

  13. Neural Networks for Segregation of Multiple Objects: Visual Figure-Ground Separation and Auditory Pitch Perception.

    Science.gov (United States)

    Wyse, Lonce

    An important component of perceptual object recognition is the segmentation into coherent perceptual units of the "blooming buzzing confusion" that bombards the senses. The work presented herein develops neural network models of some key processes of pre-attentive vision and audition that serve this goal. A neural network model, called an FBF (Feature -Boundary-Feature) network, is proposed for automatic parallel separation of multiple figures from each other and their backgrounds in noisy images. Figure-ground separation is accomplished by iterating operations of a Boundary Contour System (BCS) that generates a boundary segmentation of a scene, and a Feature Contour System (FCS) that compensates for variable illumination and fills-in surface properties using boundary signals. A key new feature is the use of the FBF filling-in process for the figure-ground separation of connected regions, which are subsequently more easily recognized. The new CORT-X 2 model is a feed-forward version of the BCS that is designed to detect, regularize, and complete boundaries in up to 50 percent noise. It also exploits the complementary properties of on-cells and off -cells to generate boundary segmentations and to compensate for boundary gaps during filling-in. In the realm of audition, many sounds are dominated by energy at integer multiples, or "harmonics", of a fundamental frequency. For such sounds (e.g., vowels in speech), the individual frequency components fuse, so that they are perceived as one sound source with a pitch at the fundamental frequency. Pitch is integral to separating auditory sources, as well as to speaker identification and speech understanding. A neural network model of pitch perception called SPINET (SPatial PItch NETwork) is developed and used to simulate a broader range of perceptual data than previous spectral models. The model employs a bank of narrowband filters as a simple model of basilar membrane mechanics, spectral on-center off-surround competitive

  14. Multimodal wireless sensor network-based ambient assisted living in real homes with multiple residents.

    Science.gov (United States)

    Tunca, Can; Alemdar, Hande; Ertan, Halil; Incel, Ozlem Durmaz; Ersoy, Cem

    2014-05-30

    Human activity recognition and behavior monitoring in a home setting using wireless sensor networks (WSNs) provide a great potential for ambient assisted living (AAL) applications, ranging from health and wellbeing monitoring to resource consumption monitoring. However, due to the limitations of the sensor devices, challenges in wireless communication and the challenges in processing large amounts of sensor data in order to recognize complex human activities, WSN-based AAL systems are not effectively integrated in the home environment. Additionally, given the variety of sensor types and activities, selecting the most suitable set of sensors in the deployment is an important task. In order to investigate and propose solutions to such challenges, we introduce a WSN-based multimodal AAL system compatible for homes with multiple residents. Particularly, we focus on the details of the system architecture, including the challenges of sensor selection, deployment, networking and data collection and provide guidelines for the design and deployment of an effective AAL system. We also present the details of the field study we conducted, using the systems deployed in two different real home environments with multiple residents. With these systems, we are able to collect ambient sensor data from multiple homes. This data can be used to assess the wellbeing of the residents and identify deviations from everyday routines, which may be indicators of health problems. Finally, in order to elaborate on the possible applications of the proposed AAL system and to exemplify directions for processing the collected data, we provide the results of several human activity inference experiments, along with examples on how such results could be interpreted. We believe that the experiences shared in this work will contribute towards accelerating the acceptance of WSN-based AAL systems in the home setting.

  15. Multimodal Wireless Sensor Network-Based Ambient Assisted Living in Real Homes with Multiple Residents

    Directory of Open Access Journals (Sweden)

    Can Tunca

    2014-05-01

    Full Text Available Human activity recognition and behavior monitoring in a home setting using wireless sensor networks (WSNs provide a great potential for ambient assisted living (AAL applications, ranging from health and wellbeing monitoring to resource consumption monitoring. However, due to the limitations of the sensor devices, challenges in wireless communication and the challenges in processing large amounts of sensor data in order to recognize complex human activities, WSN-based AAL systems are not effectively integrated in the home environment. Additionally, given the variety of sensor types and activities, selecting the most suitable set of sensors in the deployment is an important task. In order to investigate and propose solutions to such challenges, we introduce a WSN-based multimodal AAL system compatible for homes with multiple residents. Particularly, we focus on the details of the system architecture, including the challenges of sensor selection, deployment, networking and data collection and provide guidelines for the design and deployment of an effective AAL system. We also present the details of the field study we conducted, using the systems deployed in two different real home environments with multiple residents. With these systems, we are able to collect ambient sensor data from multiple homes. This data can be used to assess the wellbeing of the residents and identify deviations from everyday routines, which may be indicators of health problems. Finally, in order to elaborate on the possible applications of the proposed AAL system and to exemplify directions for processing the collected data, we provide the results of several human activity inference experiments, along with examples on how such results could be interpreted. We believe that the experiences shared in this work will contribute towards accelerating the acceptance of WSN-based AAL systems in the home setting.

  16. Improving automated multiple sclerosis lesion segmentation with a cascaded 3D convolutional neural network approach.

    Science.gov (United States)

    Valverde, Sergi; Cabezas, Mariano; Roura, Eloy; González-Villà, Sandra; Pareto, Deborah; Vilanova, Joan C; Ramió-Torrentà, Lluís; Rovira, Àlex; Oliver, Arnau; Lladó, Xavier

    2017-07-15

    In this paper, we present a novel automated method for White Matter (WM) lesion segmentation of Multiple Sclerosis (MS) patient images. Our approach is based on a cascade of two 3D patch-wise convolutional neural networks (CNN). The first network is trained to be more sensitive revealing possible candidate lesion voxels while the second network is trained to reduce the number of misclassified voxels coming from the first network. This cascaded CNN architecture tends to learn well from a small (n≤35) set of labeled data of the same MRI contrast, which can be very interesting in practice, given the difficulty to obtain manual label annotations and the large amount of available unlabeled Magnetic Resonance Imaging (MRI) data. We evaluate the accuracy of the proposed method on the public MS lesion segmentation challenge MICCAI2008 dataset, comparing it with respect to other state-of-the-art MS lesion segmentation tools. Furthermore, the proposed method is also evaluated on two private MS clinical datasets, where the performance of our method is also compared with different recent public available state-of-the-art MS lesion segmentation methods. At the time of writing this paper, our method is the best ranked approach on the MICCAI2008 challenge, outperforming the rest of 60 participant methods when using all the available input modalities (T1-w, T2-w and FLAIR), while still in the top-rank (3rd position) when using only T1-w and FLAIR modalities. On clinical MS data, our approach exhibits a significant increase in the accuracy segmenting of WM lesions when compared with the rest of evaluated methods, highly correlating (r≥0.97) also with the expected lesion volume. Copyright © 2017 Elsevier Inc. All rights reserved.

  17. Autapse-induced multiple stochastic resonances in a modular neuronal network

    Science.gov (United States)

    Yang, XiaoLi; Yu, YanHu; Sun, ZhongKui

    2017-08-01

    This study investigates the nontrivial effects of autapse on stochastic resonance in a modular neuronal network subjected to bounded noise. The resonance effect of autapse is detected by imposing a self-feedback loop with autaptic strength and autaptic time delay to each constituent neuron. Numerical simulations have demonstrated that bounded noise with the proper level of amplitude can induce stochastic resonance; moreover, the noise induced resonance dynamics can be significantly shaped by the autapse. In detail, for a specific range of autaptic strength, multiple stochastic resonances can be induced when the autaptic time delays are appropriately adjusted. These appropriately adjusted delays are detected to nearly approach integer multiples of the period of the external weak signal when the autaptic strength is very near zero; otherwise, they do not match the period of the external weak signal when the autaptic strength is slightly greater than zero. Surprisingly, in both cases, the differences between arbitrary two adjacent adjusted autaptic delays are always approximately equal to the period of the weak signal. The phenomenon of autaptic delay induced multiple stochastic resonances is further confirmed to be robust against the period of the external weak signal and the intramodule probability of subnetwork. These findings could have important implications for weak signal detection and information propagation in realistic neural systems.

  18. PathMAPA: a tool for displaying gene expression and performing statistical tests on metabolic pathways at multiple levels for Arabidopsis

    Directory of Open Access Journals (Sweden)

    Ma Ligeng

    2003-11-01

    Full Text Available Abstract Background To date, many genomic and pathway-related tools and databases have been developed to analyze microarray data. In published web-based applications to date, however, complex pathways have been displayed with static image files that may not be up-to-date or are time-consuming to rebuild. In addition, gene expression analyses focus on individual probes and genes with little or no consideration of pathways. These approaches reveal little information about pathways that are key to a full understanding of the building blocks of biological systems. Therefore, there is a need to provide useful tools that can generate pathways without manually building images and allow gene expression data to be integrated and analyzed at pathway levels for such experimental organisms as Arabidopsis. Results We have developed PathMAPA, a web-based application written in Java that can be easily accessed over the Internet. An Oracle database is used to store, query, and manipulate the large amounts of data that are involved. PathMAPA allows its users to (i upload and populate microarray data into a database; (ii integrate gene expression with enzymes of the pathways; (iii generate pathway diagrams without building image files manually; (iv visualize gene expressions for each pathway at enzyme, locus, and probe levels; and (v perform statistical tests at pathway, enzyme and gene levels. PathMAPA can be used to examine Arabidopsis thaliana gene expression patterns associated with metabolic pathways. Conclusion PathMAPA provides two unique features for the gene expression analysis of Arabidopsis thaliana: (i automatic generation of pathways associated with gene expression and (ii statistical tests at pathway level. The first feature allows for the periodical updating of genomic data for pathways, while the second feature can provide insight into how treatments affect relevant pathways for the selected experiment(s.

  19. Assessing flow paths in a karst aquifer based on multiple dye tracing tests using stochastic simulation and the MODFLOW-CFP code

    Science.gov (United States)

    Assari, Amin; Mohammadi, Zargham

    2017-09-01

    Karst systems show high spatial variability of hydraulic parameters over small distances and this makes their modeling a difficult task with several uncertainties. Interconnections of fractures have a major role on the transport of groundwater, but many of the stochastic methods in use do not have the capability to reproduce these complex structures. A methodology is presented for the quantification of tortuosity using the single normal equation simulation (SNESIM) algorithm and a groundwater flow model. A training image was produced based on the statistical parameters of fractures and then used in the simulation process. The SNESIM algorithm was used to generate 75 realizations of the four classes of fractures in a karst aquifer in Iran. The results from six dye tracing tests were used to assign hydraulic conductivity values to each class of fractures. In the next step, the MODFLOW-CFP and MODPATH codes were consecutively implemented to compute the groundwater flow paths. The 9,000 flow paths obtained from the MODPATH code were further analyzed to calculate the tortuosity factor. Finally, the hydraulic conductivity values calculated from the dye tracing experiments were refined using the actual flow paths of groundwater. The key outcomes of this research are: (1) a methodology for the quantification of tortuosity; (2) hydraulic conductivities, that are incorrectly estimated (biased low) with empirical equations that assume Darcian (laminar) flow with parallel rather than tortuous streamlines; and (3) an understanding of the scale-dependence and non-normal distributions of tortuosity.

  20. Motif Penggunaan dan Kepuasan Menggunakan Path (Studi Korelasional Tentang Pengaruh Motif Penggunaan dan Kepuasan Menggunakan Jejaring sosial Path di Kalangan Masyarakat Pasar VI Kelurahan Padang Bulan Medan)

    OpenAIRE

    Dipta, Anna Mira

    2015-01-01

    This study entitled Effect of using and gratification of using social networking Path among the people in Padang Bulan Medan (CorrelationalEffect of using and gratification of using social networking Path among the people in Padang Bulan Medan). Path is a social network similar to its predecessor facebook. Path exclusive can only be used with smartphones based on IOS and android operating system. Path is a private social networking service application designed to bring users closer to family....

  1. H∞ Filtering for Networked Markovian Jump Systems with Multiple Stochastic Communication Delays

    Directory of Open Access Journals (Sweden)

    Hui Dong

    2015-01-01

    Full Text Available This paper is concerned with the H∞ filtering for a class of networked Markovian jump systems with multiple communication delays. Due to the existence of communication constraints, the measurement signal cannot arrive at the filter completely on time, and the stochastic communication delays are considered in the filter design. Firstly, a set of stochastic variables is introduced to model the occurrence probabilities of the delays. Then based on the stochastic system approach, a sufficient condition is obtained such that the filtering error system is stable in the mean-square sense and with a prescribed H∞ disturbance attenuation level. The optimal filter gain parameters can be determined by solving a convex optimization problem. Finally, a simulation example is given to show the effectiveness of the proposed filter design method.

  2. Report from the European Myeloma Network on interphase FISH in multiple myeloma and related disorders

    DEFF Research Database (Denmark)

    Ross, Fiona M; Avet-Loiseau, Hervé; Ameye, Geneviève

    2012-01-01

    The European Myeloma Network has organized two workshops on fluorescence in situ hybridization in multiple myeloma. The first aimed to identify specific indications and consensus technical approaches of current practice. A second workshop followed a quality control exercise in which 21 laboratories...... analyzed diagnostic cases of purified plasma cells for recurrent abnormalities. The summary report was discussed at the EHA Myeloma Scientific Working Group Meeting 2010. During the quality control exercise, there was acceptable agreement on more than 1,000 tests. The conclusions from the exercise were...... that the primary clinical applications for FISH analysis were for newly diagnosed cases of MM or frank relapse cases. A range of technical recommendations included: 1) material should be part of the first draw of the aspirate; 2) samples should be sent at suitable times to allow for the lengthy processing...

  3. Efficient Steplike Carrier Multiplication in Percolative Networks of Epitaxially Connected PbSe Nanocrystals.

    Science.gov (United States)

    Kulkarni, Aditya; Evers, Wiel H; Tomić, Stanko; Beard, Matthew C; Vanmaekelbergh, Daniel; Siebbeles, Laurens D A

    2018-01-23

    Carrier multiplication (CM) is a process in which a single photon excites two or more electrons. CM is of interest to enhance the efficiency of a solar cell. Until now, CM in thin films and solar cells of semiconductor nanocrystals (NCs) has been found at photon energies well above the minimum required energy of twice the band gap. The high threshold of CM strongly limits the benefits for solar cell applications. We show that CM is more efficient in a percolative network of directly connected PbSe NCs. The CM threshold is at twice the band gap and increases in a steplike fashion with photon energy. A lower CM efficiency is found for a solid of weaker coupled NCs. This demonstrates that the coupling between NCs strongly affects the CM efficiency. According to device simulations, the measured CM efficiency would significantly enhance the power conversion efficiency of a solar cell.

  4. Dynamic Allocation and Efficient Distribution of Data Among Multiple Clouds Using Network Coding

    DEFF Research Database (Denmark)

    Sipos, Marton A.; Fitzek, Frank; Roetter, Daniel Enrique Lucani

    2014-01-01

    Distributed storage has attracted large interest lately from both industry and researchers as a flexible, cost-efficient, high performance, and potentially secure solution for geographically distributed data centers, edge caching or sharing storage among users. This paper studies the benefits...... of random linear network coding to exploit multiple commercially available cloud storage providers simultaneously with the possibility to constantly adapt to changing cloud performance in order to optimize data retrieval times. The main contribution of this paper is a new data distribution mechanisms...... that cleverly stores and moves data among different clouds in order to optimize performance. Furthermore, we investigate the trade-offs among storage space, reliability and data retrieval speed for our proposed scheme. By means of real-world implementation and measurements using well-known and publicly...

  5. Tracking and Recognition of Multiple Human Targets Moving in a Wireless Pyroelectric Infrared Sensor Network

    Directory of Open Access Journals (Sweden)

    Ji Xiong

    2014-04-01

    Full Text Available With characteristics of low-cost and easy deployment, the distributed wireless pyroelectric infrared sensor network has attracted extensive interest, which aims to make it an alternate infrared video sensor in thermal biometric applications for tracking and identifying human targets. In these applications, effectively processing signals collected from sensors and extracting the features of different human targets has become crucial. This paper proposes the application of empirical mode decomposition and the Hilbert-Huang transform to extract features of moving human targets both in the time domain and the frequency domain. Moreover, the support vector machine is selected as the classifier. The experimental results demonstrate that by using this method the identification rates of multiple moving human targets are around 90%.

  6. Energy efficient design for MIMO two-way AF multiple relay networks

    KAUST Repository

    Alsharoa, Ahmad M.

    2014-04-01

    This paper studies the energy efficient transmission and the power allocation problem for multiple two-way relay networks equipped with multi-input multi-output antennas where each relay employs an amplify-and-forward strategy. The goal is to minimize the total power consumption without degrading the quality of service of the terminals. In our analysis, we start by deriving closed-form expressions of the optimal powers allocated to terminals. We then employ a strong optimization tool based on the particle swarm optimization technique to find the optimal power allocated at each relay antenna. Our numerical results illustrate the performance of the proposed scheme and show that it achieves a sub-optimal solution very close to the optimal one.

  7. A New Prime Code for Synchronous Optical Code Division Multiple-Access Networks

    Directory of Open Access Journals (Sweden)

    Huda Saleh Abbas

    2018-01-01

    Full Text Available A new spreading code based on a prime code for synchronous optical code-division multiple-access networks that can be used in monitoring applications has been proposed. The new code is referred to as “extended grouped new modified prime code.” This new code has the ability to support more terminal devices than other prime codes. In addition, it patches subsequences with “0s” leading to lower power consumption. The proposed code has an improved cross-correlation resulting in enhanced BER performance. The code construction and parameters are provided. The operating performance, using incoherent on-off keying modulation and incoherent pulse position modulation systems, has been analyzed. The performance of the code was compared with other prime codes. The results demonstrate an improved performance, and a BER floor of 10−9 was achieved.

  8. Elastic tracking versus neural network tracking for very high multiplicity problems

    International Nuclear Information System (INIS)

    Harlander, M.; Gyulassy, M.

    1991-04-01

    A new Elastic Tracking (ET) algorithm is proposed for finding tracks in very high multiplicity and noisy environments. It is based on a dynamical reinterpretation and generalization of the Radon transform and is related to elastic net algorithms for geometrical optimization. ET performs an adaptive nonlinear fit to noisy data with a variable number of tracks. Its numerics is more efficient than that of the traditional Radon or Hough transform method because it avoids binning of phase space and the costly search for valid minima. Spurious local minima are avoided in ET by introducing a time-dependent effective potential. The method is shown to be very robust to noise and measurement error and extends tracking capabilities to much higher track densities than possible via local road finding or even the novel Denby-Peterson neural network tracking algorithms. 12 refs., 2 figs

  9. The heat shock protein/chaperone network and multiple stress resistance

    KAUST Repository

    Jacob, Pierre

    2016-11-15

    Crop yield has been greatly enhanced during the last century. However, most elite cultivars are adapted to temperate climates and are not well suited to more stressful conditions. In the context of climate change, stress resistance is a major concern. To overcome these difficulties, scientists may help breeders by providing genetic markers associated with stress resistance. However, multi-stress resistance cannot be obtained from the simple addition of single stress resistance traits. In the field, stresses are unpredictable and several may occur at once. Consequently, the use of single stress resistance traits is often inadequate. Although it has been historically linked with the heat stress response, the heat shock protein (HSP)/chaperone network is a major component of multiple stress responses. Among the HSP/chaperone

  10. The heat shock protein/chaperone network and multiple stress resistance

    KAUST Repository

    Jacob, Pierre; Hirt, Heribert; Bendahmane, Abdelhafid

    2016-01-01

    Crop yield has been greatly enhanced during the last century. However, most elite cultivars are adapted to temperate climates and are not well suited to more stressful conditions. In the context of climate change, stress resistance is a major concern. To overcome these difficulties, scientists may help breeders by providing genetic markers associated with stress resistance. However, multi-stress resistance cannot be obtained from the simple addition of single stress resistance traits. In the field, stresses are unpredictable and several may occur at once. Consequently, the use of single stress resistance traits is often inadequate. Although it has been historically linked with the heat stress response, the heat shock protein (HSP)/chaperone network is a major component of multiple stress responses. Among the HSP/chaperone

  11. Stability and bifurcation in a simplified four-neuron BAM neural network with multiple delays

    Directory of Open Access Journals (Sweden)

    2006-01-01

    Full Text Available We first study the distribution of the zeros of a fourth-degree exponential polynomial. Then we apply the obtained results to a simplified bidirectional associated memory (BAM neural network with four neurons and multiple time delays. By taking the sum of the delays as the bifurcation parameter, it is shown that under certain assumptions the steady state is absolutely stable. Under another set of conditions, there are some critical values of the delay, when the delay crosses these critical values, the Hopf bifurcation occurs. Furthermore, some explicit formulae determining the stability and the direction of periodic solutions bifurcating from Hopf bifurcations are obtained by applying the normal form theory and center manifold reduction. Numerical simulations supporting the theoretical analysis are also included.

  12. Global robust stability of neural networks with multiple discrete delays and distributed delays

    International Nuclear Information System (INIS)

    Gao Ming; Cui Baotong

    2009-01-01

    The problem of global robust stability is investigated for a class of uncertain neural networks with both multiple discrete time-varying delays and distributed time-varying delays. The uncertainties are assumed to be of norm-bounded form and the activation functions are supposed to be bounded and globally Lipschitz continuous. Based on the Lyapunov stability theory and linear matrix inequality technique, some robust stability conditions guaranteeing the global robust convergence of the equilibrium point are derived. The proposed LMI-based criteria are computationally efficient as they can be easily checked by using recently developed algorithms in solving LMIs. Two examples are given to show the effectiveness of the proposed results.

  13. A Distributed Flow Rate Control Algorithm for Networked Agent System with Multiple Coding Rates to Optimize Multimedia Data Transmission

    Directory of Open Access Journals (Sweden)

    Shuai Zeng

    2013-01-01

    Full Text Available With the development of wireless technologies, mobile communication applies more and more extensively in the various walks of life. The social network of both fixed and mobile users can be seen as networked agent system. At present, kinds of devices and access network technology are widely used. Different users in this networked agent system may need different coding rates multimedia data due to their heterogeneous demand. This paper proposes a distributed flow rate control algorithm to optimize multimedia data transmission of the networked agent system with the coexisting various coding rates. In this proposed algorithm, transmission path and upload bandwidth of different coding rate data between source node, fixed and mobile nodes are appropriately arranged and controlled. On the one hand, this algorithm can provide user nodes with differentiated coding rate data and corresponding flow rate. On the other hand, it makes the different coding rate data and user nodes networked, which realizes the sharing of upload bandwidth of user nodes which require different coding rate data. The study conducts mathematical modeling on the proposed algorithm and compares the system that adopts the proposed algorithm with the existing system based on the simulation experiment and mathematical analysis. The results show that the system that adopts the proposed algorithm achieves higher upload bandwidth utilization of user nodes and lower upload bandwidth consumption of source node.

  14. Coordination of networked systems on digraphs with multiple leaders via pinning control

    Science.gov (United States)

    Chen, Gang; Lewis, Frank L.

    2012-02-01

    It is well known that achieving consensus among a group of multi-vehicle systems by local distributed control is feasible if and only if all nodes in the communication digraph are reachable from a single (root) node. In this article, we take into account a more general case that the communication digraph of the networked multi-vehicle systems is weakly connected and has two or more zero-in-degree and strongly connected subgraphs, i.e. there are two or more leader groups. Based on the pinning control strategy, the feasibility problem of achieving second-order controlled consensus is studied. At first, a necessary and sufficient condition is given when the topology is fixed. Then the method to design the controller and the rule to choose the pinned vehicles are discussed. The proposed approach allows us to extend several existing results for undirected graphs to directed balanced graphs. A sufficient condition is proposed in the case where the coupling topology is variable. As an illustrative example, a second-order controlled consensus scheme is applied to coordinate the movement of networked multiple mobile robots.

  15. Tracking Control Based on Recurrent Neural Networks for Nonlinear Systems with Multiple Inputs and Unknown Deadzone

    Directory of Open Access Journals (Sweden)

    J. Humberto Pérez-Cruz

    2012-01-01

    Full Text Available This paper deals with the problem of trajectory tracking for a broad class of uncertain nonlinear systems with multiple inputs each one subject to an unknown symmetric deadzone. On the basis of a model of the deadzone as a combination of a linear term and a disturbance-like term, a continuous-time recurrent neural network is directly employed in order to identify the uncertain dynamics. By using a Lyapunov analysis, the exponential convergence of the identification error to a bounded zone is demonstrated. Subsequently, by a proper control law, the state of the neural network is compelled to follow a bounded reference trajectory. This control law is designed in such a way that the singularity problem is conveniently avoided and the exponential convergence to a bounded zone of the difference between the state of the neural identifier and the reference trajectory can be proven. Thus, the exponential convergence of the tracking error to a bounded zone and the boundedness of all closed-loop signals can be guaranteed. One of the main advantages of the proposed strategy is that the controller can work satisfactorily without any specific knowledge of an upper bound for the unmodeled dynamics and/or the disturbance term.

  16. FODA: a novel efficient multiple access protocol for highly dynamic self-organizing networks

    Science.gov (United States)

    Li, Hantao; Liu, Kai; Zhang, Jun

    2005-11-01

    Based on the concept of contention reservation for polling transmission and collision prevention strategy for collision resolution, a fair on-demand access (FODA) protocol for supporting node mobility and multihop architecture in highly dynamic self-organizing networks is proposed. In the protocol, a distributed clustering network architecture formed by self-organizing algorithm and a main idea of reserving channel resources to get polling service are adopted, so that the hidden terminal (HT) and exposed terminal (ET) problems existed in traffic transmission due to multihop architecture and wireless transmission can be eliminated completely. In addition, an improved collision prevention scheme based on binary countdown algorithm (BCA), called fair collision prevention (FCP) algorithm, is proposed to greatly eliminate unfair phenomena existed in contention access of newly active ordinary nodes and completely resolve access collisions. Finally, the performance comparison of the FODA protocol with carrier sense multiple access with collision avoidance (CSMA/CA) and polling protocols by OPNET simulation are presented. Simulation results show that the FODA protocol can overcome the disadvantages of CSMA/CA and polling protocols, and achieve higher throughput, lower average message delay and less average message dropping rate.

  17. Optimal multiple-information integration inherent in a ring neural network

    International Nuclear Information System (INIS)

    Takiyama, Ken

    2017-01-01

    Although several behavioral experiments have suggested that our neural system integrates multiple sources of information based on the certainty of each type of information in the manner of maximum-likelihood estimation, it is unclear how the maximum-likelihood estimation is implemented in our neural system. Here, I investigate the relationship between maximum-likelihood estimation and a widely used ring-type neural network model that is used as a model of visual, motor, or prefrontal cortices. Without any approximation or ansatz, I analytically demonstrate that the equilibrium of an order parameter in the neural network model exactly corresponds to the maximum-likelihood estimation when the strength of the symmetrical recurrent synaptic connectivity within a neural population is appropriately stronger than that of asymmetrical connectivity, that of local and external inputs, and that of symmetrical or asymmetrical connectivity between different neural populations. In this case, strengths of local and external inputs or those of symmetrical connectivity between different neural populations exactly correspond to the input certainty in maximum-likelihood estimation. Thus, my analysis suggests appropriately strong symmetrical recurrent connectivity as a possible candidate for implementing the maximum-likelihood estimation within our neural system. (paper)

  18. Brain Interaction during Cooperation: Evaluating Local Properties of Multiple-Brain Network.

    Science.gov (United States)

    Sciaraffa, Nicolina; Borghini, Gianluca; Aricò, Pietro; Di Flumeri, Gianluca; Colosimo, Alfredo; Bezerianos, Anastasios; Thakor, Nitish V; Babiloni, Fabio

    2017-07-21

    Subjects' interaction is the core of most human activities. This is the reason why a lack of coordination is often the cause of missing goals, more than individual failure. While there are different subjective and objective measures to assess the level of mental effort required by subjects while facing a situation that is getting harder, that is, mental workload, to define an objective measure based on how and if team members are interacting is not so straightforward. In this study, behavioral, subjective and synchronized electroencephalographic data were collected from couples involved in a cooperative task to describe the relationship between task difficulty and team coordination, in the sense of interaction aimed at cooperatively performing the assignment. Multiple-brain connectivity analysis provided information about the whole interacting system. The results showed that averaged local properties of a brain network were affected by task difficulty. In particular, strength changed significantly with task difficulty and clustering coefficients strongly correlated with the workload itself. In particular, a higher workload corresponded to lower clustering values over the central and parietal brain areas. Such results has been interpreted as less efficient organization of the network when the subjects' activities, due to high workload tendencies, were less coordinated.

  19. Multi-Destination Cognitive Radio Relay Network with SWIPT and Multiple Primary Receivers

    KAUST Repository

    Al-Habob, Ahmed A.

    2017-05-12

    In this paper, we study the performance of simultaneous wireless information and power transfer (SWIPT) technique in a multi-destination dual-hop underlay cognitive relay network with multiple primary receivers. Information transmission from the secondary source to destinations is performed entirely via a decode- and-forward (DF) relay. The relay is assumed to have no embedded power source and to harvest energy from the source signal using a power splitting (PS) protocol and employing opportunistic scheduling to forward the information to the selected destination. We derive analytical expressions for the outage probability assuming Rayleigh fading channels and considering the energy harvesting efficiency at relay, the source maximum transmit power and primary receivers interference constraints. The system performance is also studied at high signal-to-noise ratio (SNR) values where approximate expressions for the outage probability are provided and analyzed in terms of diversity order and coding gain. Monte-Carlo simulations and some numerical examples are provided to validate the derived expressions and to illustrate the effect of various system parameters on the system performance. In contrast to their conventional counterparts where a multi- destination diversity is usually achieved, the results show that the multi-destination cognitive radio relay networks with the SWIPT technique achieve a constant diversity order of one.

  20. Bayesian state space models for dynamic genetic network construction across multiple tissues.

    Science.gov (United States)

    Liang, Yulan; Kelemen, Arpad

    2016-08-01

    Construction of gene-gene interaction networks and potential pathways is a challenging and important problem in genomic research for complex diseases while estimating the dynamic changes of the temporal correlations and non-stationarity are the keys in this process. In this paper, we develop dynamic state space models with hierarchical Bayesian settings to tackle this challenge for inferring the dynamic profiles and genetic networks associated with disease treatments. We treat both the stochastic transition matrix and the observation matrix time-variant and include temporal correlation structures in the covariance matrix estimations in the multivariate Bayesian state space models. The unevenly spaced short time courses with unseen time points are treated as hidden state variables. Hierarchical Bayesian approaches with various prior and hyper-prior models with Monte Carlo Markov Chain and Gibbs sampling algorithms are used to estimate the model parameters and the hidden state variables. We apply the proposed Hierarchical Bayesian state space models to multiple tissues (liver, skeletal muscle, and kidney) Affymetrix time course data sets following corticosteroid (CS) drug administration. Both simulation and real data analysis results show that the genomic changes over time and gene-gene interaction in response to CS treatment can be well captured by the proposed models. The proposed dynamic Hierarchical Bayesian state space modeling approaches could be expanded and applied to other large scale genomic data, such as next generation sequence (NGS) combined with real time and time varying electronic health record (EHR) for more comprehensive and robust systematic and network based analysis in order to transform big biomedical data into predictions and diagnostics for precision medicine and personalized healthcare with better decision making and patient outcomes.

  1. Interaction of multiple networks modulated by the working memory training based on real-time fMRI

    Science.gov (United States)

    Shen, Jiahui; Zhang, Gaoyan; Zhu, Chaozhe; Yao, Li; Zhao, Xiaojie

    2015-03-01

    Neuroimaging studies of working memory training have identified the alteration of brain activity as well as the regional interactions within the functional networks such as central executive network (CEN) and default mode network (DMN). However, how the interaction within and between these multiple networks is modulated by the training remains unclear. In this paper, we examined the interaction of three training-induced brain networks during working memory training based on real-time functional magnetic resonance imaging (rtfMRI). Thirty subjects assigned to the experimental and control group respectively participated in two times training separated by seven days. Three networks including silence network (SN), CEN and DMN were identified by the training data with the calculated function connections within each network. Structural equation modeling (SEM) approach was used to construct the directional connectivity patterns. The results showed that the causal influences from the percent signal changes of target ROI to the SN were positively changed in both two groups, as well as the causal influence from the SN to CEN was positively changed in experimental group but negatively changed in control group from the SN to DMN. Further correlation analysis of the changes in each network with the behavioral improvements showed that the changes in SN were stronger positively correlated with the behavioral improvement of letter memory task. These findings indicated that the SN was not only a switch between the target ROI and the other networks in the feedback training but also an essential factor to the behavioral improvement.

  2. Current-Sensitive Path Planning for an Underactuated Free-Floating Ocean Sensorweb

    Science.gov (United States)

    Dahl, Kristen P.; Thompson, David R.; McLaren, David; Chao, Yi; Chien, Steve

    2011-01-01

    This work investigates multi-agent path planning in strong, dynamic currents using thousands of highly under-actuated vehicles. We address the specific task of path planning for a global network of ocean-observing floats. These submersibles are typified by the Argo global network consisting of over 3000 sensor platforms. They can control their buoyancy to float at depth for data collection or rise to the surface for satellite communications. Currently, floats drift at a constant depth regardless of the local currents. However, accurate current forecasts have become available which present the possibility of intentionally controlling floats' motion by dynamically commanding them to linger at different depths. This project explores the use of these current predictions to direct float networks to some desired final formation or position. It presents multiple algorithms for such path optimization and demonstrates their advantage over the standard approach of constant-depth drifting.

  3. Optimal planning of multiple distributed generation sources in distribution networks: A new approach

    Energy Technology Data Exchange (ETDEWEB)

    AlRashidi, M.R., E-mail: malrash2002@yahoo.com [Department of Electrical Engineering, College of Technological Studies, Public Authority for Applied Education and Training (PAAET) (Kuwait); AlHajri, M.F., E-mail: mfalhajri@yahoo.com [Department of Electrical Engineering, College of Technological Studies, Public Authority for Applied Education and Training (PAAET) (Kuwait)

    2011-10-15

    Highlights: {yields} A new hybrid PSO for optimal DGs placement and sizing. {yields} Statistical analysis to fine tune PSO parameters. {yields} Novel constraint handling mechanism to handle different constraints types. - Abstract: An improved particle swarm optimization algorithm (PSO) is presented for optimal planning of multiple distributed generation sources (DG). This problem can be divided into two sub-problems: the DG optimal size (continuous optimization) and location (discrete optimization) to minimize real power losses. The proposed approach addresses the two sub-problems simultaneously using an enhanced PSO algorithm capable of handling multiple DG planning in a single run. A design of experiment is used to fine tune the proposed approach via proper analysis of PSO parameters interaction. The proposed algorithm treats the problem constraints differently by adopting a radial power flow algorithm to satisfy the equality constraints, i.e. power flows in distribution networks, while the inequality constraints are handled by making use of some of the PSO features. The proposed algorithm was tested on the practical 69-bus power distribution system. Different test cases were considered to validate the proposed approach consistency in detecting optimal or near optimal solution. Results are compared with those of Sequential Quadratic Programming.

  4. Optimal planning of multiple distributed generation sources in distribution networks: A new approach

    International Nuclear Information System (INIS)

    AlRashidi, M.R.; AlHajri, M.F.

    2011-01-01

    Highlights: → A new hybrid PSO for optimal DGs placement and sizing. → Statistical analysis to fine tune PSO parameters. → Novel constraint handling mechanism to handle different constraints types. - Abstract: An improved particle swarm optimization algorithm (PSO) is presented for optimal planning of multiple distributed generation sources (DG). This problem can be divided into two sub-problems: the DG optimal size (continuous optimization) and location (discrete optimization) to minimize real power losses. The proposed approach addresses the two sub-problems simultaneously using an enhanced PSO algorithm capable of handling multiple DG planning in a single run. A design of experiment is used to fine tune the proposed approach via proper analysis of PSO parameters interaction. The proposed algorithm treats the problem constraints differently by adopting a radial power flow algorithm to satisfy the equality constraints, i.e. power flows in distribution networks, while the inequality constraints are handled by making use of some of the PSO features. The proposed algorithm was tested on the practical 69-bus power distribution system. Different test cases were considered to validate the proposed approach consistency in detecting optimal or near optimal solution. Results are compared with those of Sequential Quadratic Programming.

  5. Quantitative differentiation of multiple virus in blood using nanoporous silicon oxide immunosensor and artificial neural network.

    Science.gov (United States)

    Chakraborty, W; Ray, R; Samanta, N; RoyChaudhuri, C

    2017-12-15

    In spite of the rapid developments in various nanosensor technologies, it still remains challenging to realize a reliable ultrasensitive electrical biosensing platform which will be able to detect multiple viruses in blood simultaneously with a fairly high reproducibility without using secondary labels. In this paper, we have reported quantitative differentiation of Hep-B and Hep-C viruses in blood using nanoporous silicon oxide immunosensor array and artificial neural network (ANN). The peak frequency output (f p ) from the steady state sensitivity characteristics and the first cut off frequency (f c ) from the transient characteristics have been considered as inputs to the multilayer ANN. Implementation of several classifier blocks in the ANN architecture and coupling them with both the sensor chips, functionalized with Hep-B and Hep-C antibodies have enabled the quantification of the viruses with an accuracy of around 95% in the range of 0.04fM-1pM and with an accuracy of around 90% beyond 1pM and within 25nM in blood serum. This is the most sensitive report on multiple virus quantification using label free method. Copyright © 2017 Elsevier B.V. All rights reserved.

  6. Optical coherence tomography angiography retinal vascular network assessment in multiple sclerosis.

    Science.gov (United States)

    Lanzillo, Roberta; Cennamo, Gilda; Criscuolo, Chiara; Carotenuto, Antonio; Velotti, Nunzio; Sparnelli, Federica; Cianflone, Alessandra; Moccia, Marcello; Brescia Morra, Vincenzo

    2017-09-01

    Optical coherence tomography (OCT) angiography is a new method to assess the density of the vascular networks. Vascular abnormalities are considered involved in multiple sclerosis (MS) pathology. To assess the presence of vascular abnormalities in MS and to evaluate their correlation to disease features. A total of 50 MS patients with and without history of optic neuritis (ON) and 46 healthy subjects were included. All underwent spectral domain (SD)-OCT and OCT angiography. Clinical history, Expanded Disability Status Scale (EDSS), Multiple Sclerosis Severity Score (MSSS) and disease duration were collected. Angio-OCT showed a vessel density reduction in eyes of MS patients when compared to controls. A statistically significant reduction in all SD-OCT and OCT angiography parameters was noticed both in eyes with and without ON when compared with control eyes. We found an inverse correlation between SD-OCT parameters and MSSS ( p = 0.003) and between vessel density parameters and EDSS ( p = 0.007). We report a vessel density reduction in retina of MS patients. We highlight the clinical correlation between vessel density and EDSS, suggesting that angio-OCT could be a good marker of disease and of disability in MS.

  7. Daily Suspended Sediment Discharge Prediction Using Multiple Linear Regression and Artificial Neural Network

    Science.gov (United States)

    Uca; Toriman, Ekhwan; Jaafar, Othman; Maru, Rosmini; Arfan, Amal; Saleh Ahmar, Ansari

    2018-01-01

    Prediction of suspended sediment discharge in a catchments area is very important because it can be used to evaluation the erosion hazard, management of its water resources, water quality, hydrology project management (dams, reservoirs, and irrigation) and to determine the extent of the damage that occurred in the catchments. Multiple Linear Regression analysis and artificial neural network can be used to predict the amount of daily suspended sediment discharge. Regression analysis using the least square method, whereas artificial neural networks using Radial Basis Function (RBF) and feedforward multilayer perceptron with three learning algorithms namely Levenberg-Marquardt (LM), Scaled Conjugate Descent (SCD) and Broyden-Fletcher-Goldfarb-Shanno Quasi-Newton (BFGS). The number neuron of hidden layer is three to sixteen, while in output layer only one neuron because only one output target. The mean absolute error (MAE), root mean square error (RMSE), coefficient of determination (R2 ) and coefficient of efficiency (CE) of the multiple linear regression (MLRg) value Model 2 (6 input variable independent) has the lowest the value of MAE and RMSE (0.0000002 and 13.6039) and highest R2 and CE (0.9971 and 0.9971). When compared between LM, SCG and RBF, the BFGS model structure 3-7-1 is the better and more accurate to prediction suspended sediment discharge in Jenderam catchment. The performance value in testing process, MAE and RMSE (13.5769 and 17.9011) is smallest, meanwhile R2 and CE (0.9999 and 0.9998) is the highest if it compared with the another BFGS Quasi-Newton model (6-3-1, 9-10-1 and 12-12-1). Based on the performance statistics value, MLRg, LM, SCG, BFGS and RBF suitable and accurately for prediction by modeling the non-linear complex behavior of suspended sediment responses to rainfall, water depth and discharge. The comparison between artificial neural network (ANN) and MLRg, the MLRg Model 2 accurately for to prediction suspended sediment discharge (kg

  8. Adaptive Code Division Multiple Access Protocol for Wireless Network-on-Chip Architectures

    Science.gov (United States)

    Vijayakumaran, Vineeth

    Massive levels of integration following Moore's Law ushered in a paradigm shift in the way on-chip interconnections were designed. With higher and higher number of cores on the same die traditional bus based interconnections are no longer a scalable communication infrastructure. On-chip networks were proposed enabled a scalable plug-and-play mechanism for interconnecting hundreds of cores on the same chip. Wired interconnects between the cores in a traditional Network-on-Chip (NoC) system, becomes a bottleneck with increase in the number of cores thereby increasing the latency and energy to transmit signals over them. Hence, there has been many alternative emerging interconnect technologies proposed, namely, 3D, photonic and multi-band RF interconnects. Although they provide better connectivity, higher speed and higher bandwidth compared to wired interconnects; they also face challenges with heat dissipation and manufacturing difficulties. On-chip wireless interconnects is one other alternative proposed which doesn't need physical interconnection layout as data travels over the wireless medium. They are integrated into a hybrid NOC architecture consisting of both wired and wireless links, which provides higher bandwidth, lower latency, lesser area overhead and reduced energy dissipation in communication. However, as the bandwidth of the wireless channels is limited, an efficient media access control (MAC) scheme is required to enhance the utilization of the available bandwidth. This thesis proposes using a multiple access mechanism such as Code Division Multiple Access (CDMA) to enable multiple transmitter-receiver pairs to send data over the wireless channel simultaneously. It will be shown that such a hybrid wireless NoC with an efficient CDMA based MAC protocol can significantly increase the performance of the system while lowering the energy dissipation in data transfer. In this work it is shown that the wireless NoC with the proposed CDMA based MAC protocol

  9. A replica exchange transition interface sampling method with multiple interface sets for investigating networks of rare events

    Science.gov (United States)

    Swenson, David W. H.; Bolhuis, Peter G.

    2014-07-01

    The multiple state transition interface sampling (TIS) framework in principle allows the simulation of a large network of complex rare event transitions, but in practice suffers from convergence problems. To improve convergence, we combine multiple state TIS [J. Rogal and P. G. Bolhuis, J. Chem. Phys. 129, 224107 (2008)] with replica exchange TIS [T. S. van Erp, Phys. Rev. Lett. 98, 268301 (2007)]. In addition, we introduce multiple interface sets, which allow more than one order parameter to be defined for each state. We illustrate the methodology on a model system of multiple independent dimers, each with two states. For reaction networks with up to 64 microstates, we determine the kinetics in the microcanonical ensemble, and discuss the convergence properties of the sampling scheme. For this model, we find that the kinetics depend on the instantaneous composition of the system. We explain this dependence in terms of the system's potential and kinetic energy.

  10. Cooperative path planning of unmanned aerial vehicles

    CERN Document Server

    Tsourdos, Antonios; Shanmugavel, Madhavan

    2010-01-01

    An invaluable addition to the literature on UAV guidance and cooperative control, Cooperative Path Planning of Unmanned Aerial Vehicles is a dedicated, practical guide to computational path planning for UAVs. One of the key issues facing future development of UAVs is path planning: it is vital that swarm UAVs/ MAVs can cooperate together in a coordinated manner, obeying a pre-planned course but able to react to their environment by communicating and cooperating. An optimized path is necessary in order to ensure a UAV completes its mission efficiently, safely, and successfully. Focussing on the path planning of multiple UAVs for simultaneous arrival on target, Cooperative Path Planning of Unmanned Aerial Vehicles also offers coverage of path planners that are applicable to land, sea, or space-borne vehicles. Cooperative Path Planning of Unmanned Aerial Vehicles is authored by leading researchers from Cranfield University and provides an authoritative resource for researchers, academics and engineers working in...

  11. From path integrals to anyons

    International Nuclear Information System (INIS)

    Canright, G.S.

    1992-01-01

    I offer a pedagogical review of the homotopy arguments for fractional statistics in two dimensions. These arguments arise naturally in path-integral language since they necessarily consider the properties of paths rather than simply permutations. The braid group replaces the permutation group as the basic structure for quantum statistics; hence properties of the braid group on several surfaces are briefly discussed. Finally, the question of multiple (real-space) occupancy is addressed; I suggest that the ''traditional'' treatment of this question (ie, an assumption that many-anyon wavefunctions necessarily vanish for multiple occupancy) needs reexamination

  12. Network Partnership Diplomatic Mechanism: The New Path in Sino-Russian Cooperation - On the Sino-Russian Joint Dominance of BRICS Governance Mechanism

    Directory of Open Access Journals (Sweden)

    Zhijie Cheng

    2014-01-01

    mechanisms, and providing a new path for Sino-Russian cooperation. The BRICS countries should establish a BRICS governance mechanism which has to be promoted by a leading force. The network partnership diplomatic mechanism could play a leading role in shaping this type of governance mechanism with Sino-Russian cooperation at its core.

  13. Optical Remote Sensing for Fence-Line Monitoring using Open-Path Quantum Cascade Laser (QCL) mono-static system for multiple target compounds in the Mid IR 7-13um (Fingerprint) region.

    Science.gov (United States)

    Zemek, P. G.

    2017-12-01

    Quantum Cascade Lasers (QCLs) are quickly replacing Tunable Diode Lasers (TDL) for multi-target species identification and quantification in both extractive and open-path (OP) Optical Remote Sensing (ORS) fence-line instrumentation. As was seen with TDL incorporation and pricing drops as the adoption by the telecommunications industry and its current scaling has improved robustness and pricing, the QCL is also, albiet more slowly, becoming a mature market. There are several advantages of QCLs over conventional TDLs such as improved brightness and beam density, high resolution, as well as the incorporation of external etalons or internal gratings to scan over wide spectral areas. QCLs typically operate in the Mid infra-red (MIR) as opposed to the Near-Infrared (NIR) region used with TDL. The MidIR is a target rich absorption band area where compounds have high absorbtivity coefficients resulting in better detection limits as compared to TDL instruments. The use of novel chemometrics and more sensitive non-cryo-cooled detectors has allowed some of the first QCL open-path instruments in both active and passive operation. Data and field studies of one of the newest QCL OP systems is presented that allows one system to measure multiple target compounds. Multiple QCL spectral regions may be stitched together to increase the capability of QCLs over TDL OP systems. A comparison of several ORS type systems will be presented.

  14. Multiple Linear Regression for Reconstruction of Gene Regulatory Networks in Solving Cascade Error Problems

    Directory of Open Access Journals (Sweden)

    Faridah Hani Mohamed Salleh

    2017-01-01

    Full Text Available Gene regulatory network (GRN reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C as a direct interaction (A → C. Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5.

  15. Yeast ribonuclease III uses a network of multiple hydrogen bonds for RNA binding and cleavage.

    Science.gov (United States)

    Lavoie, Mathieu; Abou Elela, Sherif

    2008-08-19

    Members of the bacterial RNase III family recognize a variety of short structured RNAs with few common features. It is not clear how this group of enzymes supports high cleavage fidelity while maintaining a broad base of substrates. Here we show that the yeast orthologue of RNase III (Rnt1p) uses a network of 2'-OH-dependent interactions to recognize substrates with different structures. We designed a series of bipartite substrates permitting the distinction between binding and cleavage defects. Each substrate was engineered to carry a single or multiple 2'- O-methyl or 2'-fluoro ribonucleotide substitutions to prevent the formation of hydrogen bonds with a specific nucleotide or group of nucleotides. Interestingly, introduction of 2'- O-methyl ribonucleotides near the cleavage site increased the rate of catalysis, indicating that 2'-OH are not required for cleavage. Substitution of nucleotides in known Rnt1p binding site with 2'- O-methyl ribonucleotides inhibited cleavage while single 2'-fluoro ribonucleotide substitutions did not. This indicates that while no single 2'-OH is essential for Rnt1p cleavage, small changes in the substrate structure are not tolerated. Strikingly, several nucleotide substitutions greatly increased the substrate dissociation constant with little or no effect on the Michaelis-Menten constant or rate of catalysis. Together, the results indicate that Rnt1p uses a network of nucleotide interactions to identify its substrate and support two distinct modes of binding. One mode is primarily mediated by the dsRNA binding domain and leads to the formation of stable RNA/protein complex, while the other requires the presence of the nuclease and N-terminal domains and leads to RNA cleavage.

  16. Multiple Linear Regression for Reconstruction of Gene Regulatory Networks in Solving Cascade Error Problems.

    Science.gov (United States)

    Salleh, Faridah Hani Mohamed; Zainudin, Suhaila; Arif, Shereena M

    2017-01-01

    Gene regulatory network (GRN) reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR) to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C) as a direct interaction (A → C). Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5.

  17. Vibration control of uncertain multiple launch rocket system using radial basis function neural network

    Science.gov (United States)

    Li, Bo; Rui, Xiaoting

    2018-01-01

    Poor dispersion characteristics of rockets due to the vibration of Multiple Launch Rocket System (MLRS) have always restricted the MLRS development for several decades. Vibration control is a key technique to improve the dispersion characteristics of rockets. For a mechanical system such as MLRS, the major difficulty in designing an appropriate control strategy that can achieve the desired vibration control performance is to guarantee the robustness and stability of the control system under the occurrence of uncertainties and nonlinearities. To approach this problem, a computed torque controller integrated with a radial basis function neural network is proposed to achieve the high-precision vibration control for MLRS. In this paper, the vibration response of a computed torque controlled MLRS is described. The azimuth and elevation mechanisms of the MLRS are driven by permanent magnet synchronous motors and supposed to be rigid. First, the dynamic model of motor-mechanism coupling system is established using Lagrange method and field-oriented control theory. Then, in order to deal with the nonlinearities, a computed torque controller is designed to control the vibration of the MLRS when it is firing a salvo of rockets. Furthermore, to compensate for the lumped uncertainty due to parametric variations and un-modeled dynamics in the design of the computed torque controller, a radial basis function neural network estimator is developed to adapt the uncertainty based on Lyapunov stability theory. Finally, the simulated results demonstrate the effectiveness of the proposed control system and show that the proposed controller is robust with regard to the uncertainty.

  18. Ultrafast all-optical code-division multiple-access networks

    Science.gov (United States)

    Kwong, Wing C.; Prucnal, Paul R.; Liu, Yanming

    1992-12-01

    In optical code-division multiple access (CDMA), the architecture of optical encoders/decoders is another important factor that needs to be considered, besides the correlation properties of those already extensively studied optical codes. The architecture of optical encoders/decoders affects, for example, the amount of power loss and length of optical delays that are associated with code sequence generation and correlation, which, in turn, affect the power budget, size, and cost of an optical CDMA system. Various CDMA coding architectures are studied in the paper. In contrast to the encoders/decoders used in prime networks (i.e., prime encodes/decoders), which generate, select, and correlate code sequences by a parallel combination of fiber-optic delay-lines, and in 2n networks (i.e., 2n encoders/decoders), which generate and correlate code sequences by a serial combination of 2 X 2 passive couplers and fiber delays with sequence selection performed in a parallel fashion, the modified 2n encoders/decoders generate, select, and correlate code sequences by a serial combination of directional couplers and delays. The power and delay- length requirements of the modified 2n encoders/decoders are compared to that of the prime and 2n encoders/decoders. A 100 Mbit/s optical CDMA experiment in free space demonstrating the feasibility of the all-serial coding architecture using a serial combination of 50/50 beam splitters and retroreflectors at 10 Tchip/s (i.e., 100,000 chip/bit) with 100 fs laser pulses is reported.

  19. An Interference-Aware Traffic-Priority-Based Link Scheduling Algorithm for Interference Mitigation in Multiple Wireless Body Area Networks

    Directory of Open Access Journals (Sweden)

    Thien T. T. Le

    2016-12-01

    Full Text Available Currently, wireless body area networks (WBANs are effectively used for health monitoring services. However, in cases where WBANs are densely deployed, interference among WBANs can cause serious degradation of network performance and reliability. Inter-WBAN interference can be reduced by scheduling the communication links of interfering WBANs. In this paper, we propose an interference-aware traffic-priority-based link scheduling (ITLS algorithm to overcome inter-WBAN interference in densely deployed WBANs. First, we model a network with multiple WBANs as an interference graph where node-level interference and traffic priority are taken into account. Second, we formulate link scheduling for multiple WBANs as an optimization model where the objective is to maximize the throughput of the entire network while ensuring the traffic priority of sensor nodes. Finally, we propose the ITLS algorithm for multiple WBANs on the basis of the optimization model. High spatial reuse is also achieved in the proposed ITLS algorithm. The proposed ITLS achieves high spatial reuse while considering traffic priority, packet length, and the number of interfered sensor nodes. Our simulation results show that the proposed ITLS significantly increases spatial reuse and network throughput with lower delay by mitigating inter-WBAN interference.

  20. Phylogeny and evolutionary histories of Pyrus L. revealed by phylogenetic trees and networks based on data from multiple DNA sequences

    Science.gov (United States)

    Reconstructing the phylogeny of Pyrus has been difficult due to the wide distribution of the genus and lack of informative data. In this study, we collected 110 accessions representing 25 Pyrus species and constructed both phylogenetic trees and phylogenetic networks based on multiple DNA sequence d...

  1. Nonorthogonal multiple access and carrierless amplitude phase modulation for flexible multiuser provisioning in 5G mobile networks

    NARCIS (Netherlands)

    Altabas, J.A.; Rommel, S.; Puerta, R.; Izquierdo, D.; Ignacio Garces, J.; Antonio Lazaro, J.; Vegas Olmos, J.J.; Tafur Monroy, I.

    2017-01-01

    In this paper, a combined nonorthogonal multiple access (NOMA) and multiband carrierless amplitude phase modulation (multiCAP) scheme is proposed for capacity enhancement of and flexible resource provisioning in 5G mobile networks. The proposed scheme is experimentally evaluated over a W-band

  2. KeyPathwayMiner - De-novo network enrichment by combining multiple OMICS data and biological networks

    DEFF Research Database (Denmark)

    Baumbach, Jan; Alcaraz, Nicolas; Pauling, Josch K.

    We tackle the problem of de-novo pathway extraction. Given a biological network and a set of case-control studies, KeyPathwayMiner efficiently extracts and visualizes all maximal connected sub-networks that contain mainly genes that are dysregulated, e.g., differentially expressed, in most cases ...

  3. Using Bayesian Belief Networks To Assess Volcano State from Multiple Monitoring Timeseries And Other Evidence

    Science.gov (United States)

    Odbert, Henry; Aspinall, Willy

    2013-04-01

    When volcanoes exhibit unrest or become eruptively active, science-based decision support invariably is sought by civil authorities. Evidence available to scientists about a volcano's internal state is usually indirect, secondary or very nebulous.Advancement of volcano monitoring technology in recent decades has increased the variety and resolution of multi-parameter timeseries data recorded at volcanoes. Monitoring timeseries may be interpreted in real time by observatory staff and are often later subjected to further analytic scrutiny by the research community at large. With increasing variety and resolution of data, interpreting these multiple strands of parallel, partial evidence has become increasingly complex. In practice, interpretation of many timeseries involves familiarity with the idiosyncracies of the volcano, the monitoring techniques, the configuration of the recording instrumentation, observations from other datasets, and so on. Assimilation of this knowledge is necessary in order to select and apply the appropriate statistical techniques required to extract the required information. Bayesian Belief Networks (BBNs) use probability theory to treat and evaluate uncertainties in a rational and auditable scientific manner, but only to the extent warranted by the strength of the available evidence. The concept is a suitable framework for marshalling multiple observations, model results and interpretations - and associated uncertainties - in a methodical manner. The formulation is usually implemented in graphical form and could be developed as a tool for near real-time, ongoing use in a volcano observatory, for example. We explore the application of BBNs in analysing volcanic timeseries, the certainty with which inferences may be drawn, and how they can be updated dynamically. Such approaches provide a route to developing analytical interface(s) between volcano monitoring analyses and probabilistic hazard analysis. We discuss the use of BBNs in hazard

  4. MrTADFinder: A network modularity based approach to identify topologically associating domains in multiple resolutions.

    Directory of Open Access Journals (Sweden)

    Koon-Kiu Yan

    2017-07-01

    Full Text Available Genome-wide proximity ligation based assays such as Hi-C have revealed that eukaryotic genomes are organized into structural units called topologically associating domains (TADs. From a visual examination of the chromosomal contact map, however, it is clear that the organization of the domains is not simple or obvious. Instead, TADs exhibit various length scales and, in many cases, a nested arrangement. Here, by exploiting the resemblance between TADs in a chromosomal contact map and densely connected modules in a network, we formulate TAD identification as a network optimization problem and propose an algorithm, MrTADFinder, to identify TADs from intra-chromosomal contact maps. MrTADFinder is based on the network-science concept of modularity. A key component of it is deriving an appropriate background model for contacts in a random chain, by numerically solving a set of matrix equations. The background model preserves the observed coverage of each genomic bin as well as the distance dependence of the contact frequency for any pair of bins exhibited by the empirical map. Also, by introducing a tunable resolution parameter, MrTADFinder provides a self-consistent approach for identifying TADs at different length scales, hence the acronym "Mr" standing for Multiple Resolutions. We then apply MrTADFinder to various Hi-C datasets. The identified domain boundaries are marked by characteristic signatures in chromatin marks and transcription factors (TF that are consistent with earlier work. Moreover, by calling TADs at different length scales, we observe that boundary signatures change with resolution, with different chromatin features having different characteristic length scales. Furthermore, we report an enrichment of HOT (high-occupancy target regions near TAD boundaries and investigate the role of different TFs in determining boundaries at various resolutions. To further explore the interplay between TADs and epigenetic marks, as tumor mutational

  5. ADNP-CSMA Random Multiple Access protocol application with the function of monitoring in Ad Hoc network

    Directory of Open Access Journals (Sweden)

    Zhan Gang

    2016-01-01

    Full Text Available In Ad Hoc networks,the net work of mobile nodes exchange information with their wireless transceiver equipment,the network throughput is in increased,compared to other such multiple hops network.Moreover along with the rapid development of modern information,communication business also will be increase.However,the access and adaptive of previous CSMA protocol are insufficient.According to these properties,this paper presents a kind of adaptive dual clock with monitoring function P-CSMA random multiple access protocol(ADNP-CSMA,and discusses two kinds of P-CSMA.ACK with monitoring function is introduced to maintain the stability of the whole system,and the introduction of dual clock mechanism reduces the channel of idle period.It calculate the system throughput expression through the method of average period,and the simulation results show that the system is constant in the case of high load throughput.

  6. Shortest Path Problems in a Stochastic and Dynamic Environment

    National Research Council Canada - National Science Library

    Cho, Jae

    2003-01-01

    .... Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network...

  7. Detection of deregulated modules using deregulatory linked path.

    Directory of Open Access Journals (Sweden)

    Yuxuan Hu

    Full Text Available The identification of deregulated modules (such as induced by oncogenes is a crucial step for exploring the pathogenic process of complex diseases. Most of the existing methods focus on deregulation of genes rather than the links of the path among them. In this study, we emphasize on the detection of deregulated links, and develop a novel and effective regulatory path-based approach in finding deregulated modules. Observing that a regulatory pathway between two genes might involve in multiple rather than a single path, we identify condition-specific core regulatory path (CCRP to detect the significant deregulation of regulatory links. Using time-series gene expression, we define the regulatory strength within each gene pair based on statistical dependence analysis. The CCRPs in regulatory networks can then be identified using the shortest path algorithm. Finally, we derive the deregulated modules by integrating the differential edges (as deregulated links of the CCRPs between the case and the control group. To demonstrate the effectiveness of our approach, we apply the method to expression data associated with different states of Human Epidermal Growth Factor Receptor 2 (HER2. The experimental results show that the genes as well as the links in the deregulated modules are significantly enriched in multiple KEGG pathways and GO biological processes, most of which can be validated to suffer from impact of this oncogene based on previous studies. Additionally, we find the regulatory mechanism associated with the crucial gene SNAI1 significantly deregulated resulting from the activation of HER2. Hence, our method provides not only a strategy for detecting the deregulated links in regulatory networks, but also a way to identify concerning deregulated modules, thus contributing to the target selection of edgetic drugs.

  8. QSAR Study of Insecticides of Phthalamide Derivatives Using Multiple Linear Regression and Artificial Neural Network Methods

    Directory of Open Access Journals (Sweden)

    Adi Syahputra

    2014-03-01

    Full Text Available Quantitative structure activity relationship (QSAR for 21 insecticides of phthalamides containing hydrazone (PCH was studied using multiple linear regression (MLR, principle component regression (PCR and artificial neural network (ANN. Five descriptors were included in the model for MLR and ANN analysis, and five latent variables obtained from principle component analysis (PCA were used in PCR analysis. Calculation of descriptors was performed using semi-empirical PM6 method. ANN analysis was found to be superior statistical technique compared to the other methods and gave a good correlation between descriptors and activity (r2 = 0.84. Based on the obtained model, we have successfully designed some new insecticides with higher predicted activity than those of previously synthesized compounds, e.g.2-(decalinecarbamoyl-5-chloro-N’-((5-methylthiophen-2-ylmethylene benzohydrazide, 2-(decalinecarbamoyl-5-chloro-N’-((thiophen-2-yl-methylene benzohydrazide and 2-(decaline carbamoyl-N’-(4-fluorobenzylidene-5-chlorobenzohydrazide with predicted log LC50 of 1.640, 1.672, and 1.769 respectively.

  9. A deep convolutional neural network-based automatic delineation strategy for multiple brain metastases stereotactic radiosurgery.

    Directory of Open Access Journals (Sweden)

    Yan Liu

    Full Text Available Accurate and automatic brain metastases target delineation is a key step for efficient and effective stereotactic radiosurgery (SRS treatment planning. In this work, we developed a deep learning convolutional neural network (CNN algorithm for segmenting brain metastases on contrast-enhanced T1-weighted magnetic resonance imaging (MRI datasets. We integrated the CNN-based algorithm into an automatic brain metastases segmentation workflow and validated on both Multimodal Brain Tumor Image Segmentation challenge (BRATS data and clinical patients' data. Validation on BRATS data yielded average DICE coefficients (DCs of 0.75±0.07 in the tumor core and 0.81±0.04 in the enhancing tumor, which outperformed most techniques in the 2015 BRATS challenge. Segmentation results of patient cases showed an average of DCs 0.67±0.03 and achieved an area under the receiver operating characteristic curve of 0.98±0.01. The developed automatic segmentation strategy surpasses current benchmark levels and offers a promising tool for SRS treatment planning for multiple brain metastases.

  10. Multiple-Antenna Interference Cancellation for WLAN with MAC Interference Avoidance in Open Access Networks

    Directory of Open Access Journals (Sweden)

    Alexandr M. Kuzminskiy

    2007-10-01

    Full Text Available The potential of multiantenna interference cancellation receiver algorithms for increasing the uplink throughput in WLAN systems such as 802.11 is investigated. The medium access control (MAC in such systems is based on carrier sensing multiple-access with collision avoidance (CSMA/CA, which itself is a powerful tool for the mitigation of intrasystem interference. However, due to the spatial dependence of received signal strengths, it is possible for the collision avoidance mechanism to fail, resulting in packet collisions at the receiver and a reduction in system throughput. The CSMA/CA MAC protocol can be complemented in such scenarios by interference cancellation (IC algorithms at the physical (PHY layer. The corresponding gains in throughput are a result of the complex interplay between the PHY and MAC layers. It is shown that semiblind interference cancellation techniques are essential for mitigating the impact of interference bursts, in particular since these are typically asynchronous with respect to the desired signal burst. Semiblind IC algorithms based on second- and higher-order statistics are compared to the conventional no-IC and training-based IC techniques in an open access network (OAN scenario involving home and visiting users. It is found that the semiblind IC algorithms significantly outperform the other techniques due to the bursty and asynchronous nature of the interference caused by the MAC interference avoidance scheme.

  11. Multiple-Antenna Interference Cancellation for WLAN with MAC Interference Avoidance in Open Access Networks

    Directory of Open Access Journals (Sweden)

    Kuzminskiy Alexandr M

    2007-01-01

    Full Text Available The potential of multiantenna interference cancellation receiver algorithms for increasing the uplink throughput in WLAN systems such as 802.11 is investigated. The medium access control (MAC in such systems is based on carrier sensing multiple-access with collision avoidance (CSMA/CA, which itself is a powerful tool for the mitigation of intrasystem interference. However, due to the spatial dependence of received signal strengths, it is possible for the collision avoidance mechanism to fail, resulting in packet collisions at the receiver and a reduction in system throughput. The CSMA/CA MAC protocol can be complemented in such scenarios by interference cancellation (IC algorithms at the physical (PHY layer. The corresponding gains in throughput are a result of the complex interplay between the PHY and MAC layers. It is shown that semiblind interference cancellation techniques are essential for mitigating the impact of interference bursts, in particular since these are typically asynchronous with respect to the desired signal burst. Semiblind IC algorithms based on second- and higher-order statistics are compared to the conventional no-IC and training-based IC techniques in an open access network (OAN scenario involving home and visiting users. It is found that the semiblind IC algorithms significantly outperform the other techniques due to the bursty and asynchronous nature of the interference caused by the MAC interference avoidance scheme.

  12. Ear Detection under Uncontrolled Conditions with Multiple Scale Faster Region-Based Convolutional Neural Networks

    Directory of Open Access Journals (Sweden)

    Yi Zhang

    2017-04-01

    Full Text Available Ear detection is an important step in ear recognition approaches. Most existing ear detection techniques are based on manually designing features or shallow learning algorithms. However, researchers found that the pose variation, occlusion, and imaging conditions provide a great challenge to the traditional ear detection methods under uncontrolled conditions. This paper proposes an efficient technique involving Multiple Scale Faster Region-based Convolutional Neural Networks (Faster R-CNN to detect ears from 2D profile images in natural images automatically. Firstly, three regions of different scales are detected to infer the information about the ear location context within the image. Then an ear region filtering approach is proposed to extract the correct ear region and eliminate the false positives automatically. In an experiment with a test set of 200 web images (with variable photographic conditions, 98% of ears were accurately detected. Experiments were likewise conducted on the Collection J2 of University of Notre Dame Biometrics Database (UND-J2 and University of Beira Interior Ear dataset (UBEAR, which contain large occlusion, scale, and pose variations. Detection rates of 100% and 98.22%, respectively, demonstrate the effectiveness of the proposed approach.

  13. Mass detection in digital breast tomosynthesis data using convolutional neural networks and multiple instance learning.

    Science.gov (United States)

    Yousefi, Mina; Krzyżak, Adam; Suen, Ching Y

    2018-05-01

    Digital breast tomosynthesis (DBT) was developed in the field of breast cancer screening as a new tomographic technique to minimize the limitations of conventional digital mammography breast screening methods. A computer-aided detection (CAD) framework for mass detection in DBT has been developed and is described in this paper. The proposed framework operates on a set of two-dimensional (2D) slices. With plane-to-plane analysis on corresponding 2D slices from each DBT, it automatically learns complex patterns of 2D slices through a deep convolutional neural network (DCNN). It then applies multiple instance learning (MIL) with a randomized trees approach to classify DBT images based on extracted information from 2D slices. This CAD framework was developed and evaluated using 5040 2D image slices derived from 87 DBT volumes. The empirical results demonstrate that this proposed CAD framework achieves much better performance than CAD systems that use hand-crafted features and deep cardinality-restricted Bolzmann machines to detect masses in DBTs. Copyright © 2018 Elsevier Ltd. All rights reserved.

  14. Modern drug design: the implication of using artificial neuronal networks and multiple molecular dynamic simulations

    Science.gov (United States)

    Yakovenko, Oleksandr; Jones, Steven J. M.

    2018-01-01

    We report the implementation of molecular modeling approaches developed as a part of the 2016 Grand Challenge 2, the blinded competition of computer aided drug design technologies held by the D3R Drug Design Data Resource (https://drugdesigndata.org/). The challenge was focused on the ligands of the farnesoid X receptor (FXR), a highly flexible nuclear receptor of the cholesterol derivative chenodeoxycholic acid. FXR is considered an important therapeutic target for metabolic, inflammatory, bowel and obesity related diseases (Expert Opin Drug Metab Toxicol 4:523-532, 2015), but in the context of this competition it is also interesting due to the significant ligand-induced conformational changes displayed by the protein. To deal with these conformational changes we employed multiple simulations of molecular dynamics (MD). Our MD-based protocols were top-ranked in estimating the free energy of binding of the ligands and FXR protein. Our approach was ranked second in the prediction of the binding poses where we also combined MD with molecular docking and artificial neural networks. Our approach showed mediocre results for high-throughput scoring of interactions.

  15. Securing optical code-division multiple-access networks with a postswitching coding scheme of signature reconfiguration

    Science.gov (United States)

    Huang, Jen-Fa; Meng, Sheng-Hui; Lin, Ying-Chen

    2014-11-01

    The optical code-division multiple-access (OCDMA) technique is considered a good candidate for providing optical layer security. An enhanced OCDMA network security mechanism with a pseudonoise (PN) random digital signals type of maximal-length sequence (M-sequence) code switching to protect against eavesdropping is presented. Signature codes unique to individual OCDMA-network users are reconfigured according to the register state of the controlling electrical shift registers. Examples of signature reconfiguration following state switching of the controlling shift register for both the network user and the eavesdropper are numerically illustrated. Dynamically changing the PN state of the shift register to reconfigure the user signature sequence is shown; this hinders eavesdroppers' efforts to decode correct data sequences. The proposed scheme increases the probability of eavesdroppers committing errors in decoding and thereby substantially enhances the degree of an OCDMA network's confidentiality.

  16. Multiple brain networks underpinning word learning from fluent speech revealed by independent component analysis.

    Science.gov (United States)

    López-Barroso, Diana; Ripollés, Pablo; Marco-Pallarés, Josep; Mohammadi, Bahram; Münte, Thomas F; Bachoud-Lévi, Anne-Catherine; Rodriguez-Fornells, Antoni; de Diego-Balaguer, Ruth

    2015-04-15

    Although neuroimaging studies using standard subtraction-based analysis from functional magnetic resonance imaging (fMRI) have suggested that frontal and temporal regions are involved in word learning from fluent speech, the possible contribution of different brain networks during this type of learning is still largely unknown. Indeed, univariate fMRI analyses cannot identify the full extent of distributed networks that are engaged by a complex task such as word learning. Here we used Independent Component Analysis (ICA) to characterize the different brain networks subserving word learning from an artificial language speech stream. Results were replicated in a second cohort of participants with a different linguistic background. Four spatially independent networks were associated with the task in both cohorts: (i) a dorsal Auditory-Premotor network; (ii) a dorsal Sensory-Motor network; (iii) a dorsal Fronto-Parietal network; and (iv) a ventral Fronto-Temporal network. The level of engagement of these networks varied through the learning period with only the dorsal Auditory-Premotor network being engaged across all blocks. In addition, the connectivity strength of this network in the second block of the learning phase correlated with the individual variability in word learning performance. These findings suggest that: (i) word learning relies on segregated connectivity patterns involving dorsal and ventral networks; and (ii) specifically, the dorsal auditory-premotor network connectivity strength is directly correlated with word learning performance. Copyright © 2015 Elsevier Inc. All rights reserved.

  17. Secure Communications in High Speed Fiber Optical Networks Using Code Division Multiple Access (CDMA) Transmission

    Energy Technology Data Exchange (ETDEWEB)

    Han, I; Bond, S; Welty, R; Du, Y; Yoo, S; Reinhardt, C; Behymer, E; Sperry, V; Kobayashi, N

    2004-02-12

    This project is focused on the development of advanced components and system technologies for secure data transmission on high-speed fiber optic data systems. This work capitalizes on (1) a strong relationship with outstanding faculty at the University of California-Davis who are experts in high speed fiber-optic networks, (2) the realization that code division multiple access (CDMA) is emerging as a bandwidth enhancing technique for fiber optic networks, (3) the realization that CDMA of sufficient complexity forms the basis for almost unbreakable one-time key transmissions, (4) our concepts for superior components for implementing CDMA, (5) our expertise in semiconductor device processing and (6) our Center for Nano and Microtechnology, which is where the majority of the experimental work was done. Here we present a novel device concept, which will push the limits of current technology, and will simultaneously solve system implementation issues by investigating new state-of-the-art fiber technologies. This will enable the development of secure communication systems for the transmission and reception of messages on deployed commercial fiber optic networks, through the CDMA phase encoding of broad bandwidth pulses. CDMA technology has been developed as a multiplexing technology, much like wavelength division multiplexing (WDM) or time division multiplexing (TDM), to increase the potential number of users on a given communication link. A novel application of the techniques created for CDMA is to generate secure communication through physical layer encoding. Physical layer encoding devices are developed which utilize semiconductor waveguides with fast carrier response times to phase encode spectral components of a secure signal. Current commercial technology, most commonly a spatial light modulator, allows phase codes to be changed at rates of only 10's of Hertz ({approx}25ms response). The use of fast (picosecond to nanosecond) carrier dynamics of semiconductors

  18. Low-cost design of next generation SONET/SDH networks with multiple constraints

    CSIR Research Space (South Africa)

    Karem, TR

    2007-07-01

    Full Text Available on constraints programming satisfaction technology is proposed. The algorithm is tested in OPNET simulation environment using different network models derived from a hypothetical case study of an optical network design for Bellville area in Cape Town, South...

  19. Path Creation, Path Dependence and Breaking Away from the Path

    OpenAIRE

    Wang, Jens; Hedman, Jonas; Tuunainen, Virpi Kristiina

    2016-01-01

    The explanation of how and why firms succeed or fail is a recurrent research challenge. This is particularly important in the context of technological innovations. We focus on the role of historical events and decisions in explaining such success and failure. Using a case study of Nokia, we develop and extend a multi-layer path dependence framework. We identify four layers of path dependence: technical, strategic and leadership, organizational, and external collaboration. We show how path dep...

  20. Tunable optical frequency comb enabled scalable and cost-effective multiuser orthogonal frequency-division multiple access passive optical network with source-free optical network units.

    Science.gov (United States)

    Chen, Chen; Zhang, Chongfu; Liu, Deming; Qiu, Kun; Liu, Shuang

    2012-10-01

    We propose and experimentally demonstrate a multiuser orthogonal frequency-division multiple access passive optical network (OFDMA-PON) with source-free optical network units (ONUs), enabled by tunable optical frequency comb generation technology. By cascading a phase modulator (PM) and an intensity modulator and dynamically controlling the peak-to-peak voltage of a PM driven signal, a tunable optical frequency comb source can be generated. It is utilized to assist the configuration of a multiple source-free ONUs enhanced OFDMA-PON where simultaneous and interference-free multiuser upstream transmission over a single wavelength can be efficiently supported. The proposed multiuser OFDMA-PON is scalable and cost effective, and its feasibility is successfully verified by experiment.