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

NASA Astrophysics Data System (ADS)

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.

SIMRAND I- SIMULATION OF RESEARCH AND DEVELOPMENT PROJECTS

NASA Technical Reports Server (NTRS)

Miles, R. F.

1994-01-01

The Simulation of Research and Development Projects program (SIMRAND) aids in the optimal allocation of R&D resources needed to achieve project goals. SIMRAND models the system subsets or project tasks as various network paths to a final goal. Each path is described in terms of task variables such as cost per hour, cost per unit, availability of resources, etc. Uncertainty is incorporated by treating task variables as probabilistic random variables. SIMRAND calculates the measure of preference for each alternative network. The networks yielding the highest utility function (or certainty equivalence) are then ranked as the optimal network paths. SIMRAND has been used in several economic potential studies at NASA's Jet Propulsion Laboratory involving solar dish power systems and photovoltaic array construction. However, any project having tasks which can be reduced to equations and related by measures of preference can be modeled. SIMRAND analysis consists of three phases: reduction, simulation, and evaluation. In the reduction phase, analytical techniques from probability theory and simulation techniques are used to reduce the complexity of the alternative networks. In the simulation phase, a Monte Carlo simulation is used to derive statistics on the variables of interest for each alternative network path. In the evaluation phase, the simulation statistics are compared and the networks are ranked in preference by a selected decision rule. The user must supply project subsystems in terms of equations based on variables (for example, parallel and series assembly line tasks in terms of number of items, cost factors, time limits, etc). The associated cumulative distribution functions and utility functions for each variable must also be provided (allowable upper and lower limits, group decision factors, etc). SIMRAND is written in Microsoft FORTRAN 77 for batch execution and has been implemented on an IBM PC series computer operating under DOS.

Self-organization and solution of shortest-path optimization problems with memristive networks

NASA Astrophysics Data System (ADS)

Pershin, Yuriy V.; Di Ventra, Massimiliano

2013-07-01

We show that memristive networks, namely networks of resistors with memory, can efficiently solve shortest-path optimization problems. Indeed, the presence of memory (time nonlocality) promotes self organization of the network into the shortest possible path(s). We introduce a network entropy function to characterize the self-organized evolution, show the solution of the shortest-path problem and demonstrate the healing property of the solution path. Finally, we provide an algorithm to solve the traveling salesman problem. Similar considerations apply to networks of memcapacitors and meminductors, and networks with memory in various dimensions.

On Applications of Disruption Tolerant Networking to Optical Networking in Space

NASA Technical Reports Server (NTRS)

Hylton, Alan Guy; Raible, Daniel E.; Juergens, Jeffrey; Iannicca, Dennis

2012-01-01

The integration of optical communication links into space networks via Disruption Tolerant Networking (DTN) is a largely unexplored area of research. Building on successful foundational work accomplished at JPL, we discuss a multi-hop multi-path network featuring optical links. The experimental test bed is constructed at the NASA Glenn Research Center featuring multiple Ethernet-to-fiber converters coupled with free space optical (FSO) communication channels. The test bed architecture models communication paths from deployed Mars assets to the deep space network (DSN) and finally to the mission operations center (MOC). Reliable versus unreliable communication methods are investigated and discussed; including reliable transport protocols, custody transfer, and fragmentation. Potential commercial applications may include an optical communications infrastructure deployment to support developing nations and remote areas, which are unburdened with supporting an existing heritage means of telecommunications. Narrow laser beam widths and control of polarization states offer inherent physical layer security benefits with optical communications over RF solutions. This paper explores whether or not DTN is appropriate for space-based optical networks, optimal payload sizes, reliability, and a discussion on security.

Simulation Of Research And Development Projects

NASA Technical Reports Server (NTRS)

Miles, Ralph F.

1987-01-01

Measures of preference for alternative project plans calculated. Simulation of Research and Development Projects (SIMRAND) program aids in optimal allocation of research and development resources needed to achieve project goals. Models system subsets or project tasks as various network paths to final goal. Each path described in terms of such task variables as cost per hour, cost per unit, and availability of resources. Uncertainty incorporated by treating task variables as probabilistic random variables. Written in Microsoft FORTRAN 77.

Routing and wavelength assignment based on normalized resource and constraints for all-optical network

NASA Astrophysics Data System (ADS)

Joo, Seong-Soon; Nam, Hyun-Soon; Lim, Chang-Kyu

2003-08-01

With the rapid growth of the Optical Internet, high capacity pipes is finally destined to support end-to-end IP on the WDM optical network. Newly launched 2D MEMS optical switching module in the market supports that expectations of upcoming a transparent optical cross-connect in the network have encouraged the field applicable research on establishing real all-optical transparent network. To open up a customer-driven bandwidth services, design of the optical transport network becomes more challenging task in terms of optimal network resource usage. This paper presents a practical approach to finding a route and wavelength assignment for wavelength routed all-optical network, which has λ-plane OXC switches and wavelength converters, and supports that optical paths are randomly set up and released by dynamic wavelength provisioning to create bandwidth between end users with timescales on the order of seconds or milliseconds. We suggest three constraints to make the RWA problem become more practical one on deployment for wavelength routed all-optical network in network view: limitation on maximum hop of a route within bearable optical network impairments, limitation on minimum hops to travel before converting a wavelength, and limitation on calculation time to find all routes for connections requested at once. We design the NRCD (Normalized Resource and Constraints for All-Optical Network RWA Design) algorithm for the Tera OXC: network resource for a route is calculated by the number of internal switching paths established in each OXC nodes on the route, and is normalized by ratio of number of paths established and number of paths equipped in a node. We show that it fits for the RWA algorithm of the wavelength routed all-optical network through real experiments on the distributed objects platform.

Assessment of critical path analyses of the relationship between permeability and electrical conductivity of pore networks

USDA-ARS?s Scientific Manuscript database

Critical path analysis (CPA) is a method for estimating macroscopic transport coefficients of heterogeneous materials that are highly disordered at the micro-scale. Developed originally to model conduction in semiconductors, numerous researchers have noted that CPA might also have relevance to flow ...

An Effective Evolutionary Approach for Bicriteria Shortest Path Routing Problems

NASA Astrophysics Data System (ADS)

Lin, Lin; Gen, Mitsuo

Routing problem is one of the important research issues in communication network fields. In this paper, we consider a bicriteria shortest path routing (bSPR) model dedicated to calculating nondominated paths for (1) the minimum total cost and (2) the minimum transmission delay. To solve this bSPR problem, we propose a new multiobjective genetic algorithm (moGA): (1) an efficient chromosome representation using the priority-based encoding method; (2) a new operator of GA parameters auto-tuning, which is adaptively regulation of exploration and exploitation based on the change of the average fitness of parents and offspring which is occurred at each generation; and (3) an interactive adaptive-weight fitness assignment mechanism is implemented that assigns weights to each objective and combines the weighted objectives into a single objective function. Numerical experiments with various scales of network design problems show the effectiveness and the efficiency of our approach by comparing with the recent researches.

The Identification of Major Factors in the Deployment of a Science DMZ at Small Institutions

ERIC Educational Resources Information Center

Valcourt, Scott A.

2017-01-01

The Science DMZ is a network research tool offering superior large science data transmission between two locations. Through a network design that places the Science DMZ at the edge of the campus network, the Science DMZ defines a network path that avoids packet inspecting devices (firewalls, packet shapers) and produces near line-rate transmission…

Complex Network Theory Applied to the Growth of Kuala Lumpur's Public Urban Rail Transit Network.

PubMed

Ding, Rui; Ujang, Norsidah; Hamid, Hussain Bin; Wu, Jianjun

2015-01-01

Recently, the number of studies involving complex network applications in transportation has increased steadily as scholars from various fields analyze traffic networks. Nonetheless, research on rail network growth is relatively rare. This research examines the evolution of the Public Urban Rail Transit Networks of Kuala Lumpur (PURTNoKL) based on complex network theory and covers both the topological structure of the rail system and future trends in network growth. In addition, network performance when facing different attack strategies is also assessed. Three topological network characteristics are considered: connections, clustering and centrality. In PURTNoKL, we found that the total number of nodes and edges exhibit a linear relationship and that the average degree stays within the interval [2.0488, 2.6774] with heavy-tailed distributions. The evolutionary process shows that the cumulative probability distribution (CPD) of degree and the average shortest path length show good fit with exponential distribution and normal distribution, respectively. Moreover, PURTNoKL exhibits clear cluster characteristics; most of the nodes have a 2-core value, and the CPDs of the centrality's closeness and betweenness follow a normal distribution function and an exponential distribution, respectively. Finally, we discuss four different types of network growth styles and the line extension process, which reveal that the rail network's growth is likely based on the nodes with the biggest lengths of the shortest path and that network protection should emphasize those nodes with the largest degrees and the highest betweenness values. This research may enhance the networkability of the rail system and better shape the future growth of public rail networks.

Research on moving target defense based on SDN

NASA Astrophysics Data System (ADS)

Chen, Mingyong; Wu, Weimin

2017-08-01

An address mutation strategy was proposed. This strategy provided an unpredictable change in address, replacing the real address of the packet forwarding process and path mutation, thus hiding the real address of the host and path. a mobile object defense technology based on Spatio-temporal Mutation on this basis is proposed, Using the software Defined Network centralized control architecture advantage combines sFlow traffic monitoring technology and Moving Target Defense. A mutated time period which can be changed in real time according to the network traffic is changed, and the destination address is changed while the controller abruptly changes the address while the data packet is transferred between the switches to construct a moving target, confusing the host within the network, thereby protecting the host and network.

Low-stress bicycling and network connectivity : [research brief].

DOT National Transportation Integrated Search

2012-05-01

In one sense, a citys or regions bicycling network includes all of its roads and paths on which bicycling is permitted. However, some streets provide such a poor level of safety and comfort for bicycling that the majority of the population cons...

Building a Community of Practice for Researchers: The International Network for Simulation-Based Pediatric Innovation, Research and Education.

PubMed

Cheng, Adam; Auerbach, Marc; Calhoun, Aaron; Mackinnon, Ralph; Chang, Todd P; Nadkarni, Vinay; Hunt, Elizabeth A; Duval-Arnould, Jordan; Peiris, Nicola; Kessler, David

2018-06-01

The scope and breadth of simulation-based research is growing rapidly; however, few mechanisms exist for conducting multicenter, collaborative research. Failure to foster collaborative research efforts is a critical gap that lies in the path of advancing healthcare simulation. The 2017 Research Summit hosted by the Society for Simulation in Healthcare highlighted how simulation-based research networks can produce studies that positively impact the delivery of healthcare. In 2011, the International Network for Simulation-based Pediatric Innovation, Research and Education (INSPIRE) was formed to facilitate multicenter, collaborative simulation-based research with the aim of developing a community of practice for simulation researchers. Since its formation, the network has successfully completed and published numerous collaborative research projects. In this article, we describe INSPIRE's history, structure, and internal processes with the goal of highlighting the community of practice model for other groups seeking to form a simulation-based research network.

Optimal solution for travelling salesman problem using heuristic shortest path algorithm with imprecise arc length

NASA Astrophysics Data System (ADS)

Bakar, Sumarni Abu; Ibrahim, Milbah

2017-08-01

The shortest path problem is a popular problem in graph theory. It is about finding a path with minimum length between a specified pair of vertices. In any network the weight of each edge is usually represented in a form of crisp real number and subsequently the weight is used in the calculation of shortest path problem using deterministic algorithms. However, due to failure, uncertainty is always encountered in practice whereby the weight of edge of the network is uncertain and imprecise. In this paper, a modified algorithm which utilized heuristic shortest path method and fuzzy approach is proposed for solving a network with imprecise arc length. Here, interval number and triangular fuzzy number in representing arc length of the network are considered. The modified algorithm is then applied to a specific example of the Travelling Salesman Problem (TSP). Total shortest distance obtained from this algorithm is then compared with the total distance obtained from traditional nearest neighbour heuristic algorithm. The result shows that the modified algorithm can provide not only on the sequence of visited cities which shown to be similar with traditional approach but it also provides a good measurement of total shortest distance which is lesser as compared to the total shortest distance calculated using traditional approach. Hence, this research could contribute to the enrichment of methods used in solving TSP.

Radiology: "killer app" for next generation networks?

PubMed

McNeill, Kevin M

2004-03-01

The core principles of digital radiology were well developed by the end of the 1980 s. During the following decade tremendous improvements in computer technology enabled realization of those principles at an affordable cost. In this decade work can focus on highly distributed radiology in the context of the integrated health care enterprise. Over the same period computer networking has evolved from a relatively obscure field used by a small number of researchers across low-speed serial links to a pervasive technology that affects nearly all facets of society. Development directions in network technology will ultimately provide end-to-end data paths with speeds that match or exceed the speeds of data paths within the local network and even within workstations. This article describes key developments in Next Generation Networks, potential obstacles, and scenarios in which digital radiology can become a "killer app" that helps to drive deployment of new network infrastructure.

Improved efficient routing strategy on two-layer complex networks

NASA Astrophysics Data System (ADS)

Ma, Jinlong; Han, Weizhan; Guo, Qing; Zhang, Shuai; Wang, Junfang; Wang, Zhihao

2016-10-01

The traffic dynamics of multi-layer networks has become a hot research topic since many networks are comprised of two or more layers of subnetworks. Due to its low traffic capacity, the traditional shortest path routing (SPR) protocol is susceptible to congestion on two-layer complex networks. In this paper, we propose an efficient routing strategy named improved global awareness routing (IGAR) strategy which is based on the betweenness centrality of nodes in the two layers. With the proposed strategy, the routing paths can bypass hub nodes of both layers to enhance the transport efficiency. Simulation results show that the IGAR strategy can bring much better traffic capacity than the SPR and the global awareness routing (GAR) strategies. Because of the significantly improved traffic performance, this study is helpful to alleviate congestion of the two-layer complex networks.

Study of co-authorship network of papers in the Journal of Research in Medical Sciences using social network analysis

PubMed Central

Zare-Farashbandi, Firoozeh; Geraei, Ehsan; Siamaki, Saba

2014-01-01

Background: Co-authorship is one of the most tangible forms of research collaboration. A co-authorship network is a social network in which the authors through participation in one or more publication through an indirect path have linked to each other. The present research using the social network analysis studied co-authorship network of 681 articles published in Journal of Research in Medical Sciences (JRMS) during 2008-2012. Materials and Methods: The study was carried out with the scientometrics approach and using co-authorship network analysis of authors. The topology of the co-authorship network of 681 published articles in JRMS between 2008 and 2012 was analyzed using macro-level metrics indicators of network analysis such as density, clustering coefficient, components and mean distance. In addition, in order to evaluate the performance of each authors and countries in the network, the micro-level indicators such as degree centrality, closeness centrality and betweenness centrality as well as productivity index were used. The UCINET and NetDraw softwares were used to draw and analyze the co-authorship network of the papers. Results: The assessment of the authors productivity in this journal showed that the first ranks were belonged to only five authors, respectively. Furthermore, analysis of the co-authorship of the authors in the network demonstrated that in the betweenness centrality index, three authors of them had the good position in the network. They can be considered as the network leaders able to control the flow of information in the network compared with the other members based on the shortest paths. On the other hand, the key role of the network according to the productivity and centrality indexes was belonged to Iran, Malaysia and United States of America. Conclusion: Co-authorship network of JRMS has the characteristics of a small world network. In addition, the theory of 6° separation is valid in this network was also true. PMID:24672564

Circuity analyses of HSR network and high-speed train paths in China

PubMed Central

Zhao, Shuo; Huang, Jie; Shan, Xinghua

2017-01-01

Circuity, defined as the ratio of the shortest network distance to the Euclidean distance between one origin–destination (O-D) pair, can be adopted as a helpful evaluation method of indirect degrees of train paths. In this paper, the maximum circuity of the paths of operated trains is set to be the threshold value of the circuity of high-speed train paths. For the shortest paths of any node pairs, if their circuity is not higher than the threshold value, the paths can be regarded as the reasonable paths. With the consideration of a certain relative or absolute error, we cluster the reasonable paths on the basis of their inclusion relationship and the center path of each class represents a passenger transit corridor. We take the high-speed rail (HSR) network in China at the end of 2014 as an example, and obtain 51 passenger transit corridors, which are alternative sets of train paths. Furthermore, we analyze the circuity distribution of paths of all node pairs in the network. We find that the high circuity of train paths can be decreased with the construction of a high-speed railway line, which indicates that the structure of the HSR network in China tends to be more complete and the HSR network can make the Chinese railway network more efficient. PMID:28945757

Efficient packet transportation on complex networks with nonuniform node capacity distribution

NASA Astrophysics Data System (ADS)

He, Xuan; Niu, Kai; He, Zhiqiang; Lin, Jiaru; Jiang, Zhong-Yuan

2015-03-01

Provided that node delivery capacity may be not uniformly distributed in many realistic networks, we present a node delivery capacity distribution in which each node capacity is composed of uniform fraction and degree related proportion. Based on the node delivery capacity distribution, we construct a novel routing mechanism called efficient weighted routing (EWR) strategy to enhance network traffic capacity and transportation efficiency. Compared with the shortest path routing and the efficient routing strategies, the EWR achieves the highest traffic capacity. After investigating average path length, network diameter, maximum efficient betweenness, average efficient betweenness, average travel time and average traffic load under extensive simulations, it indicates that the EWR appears to be a very effective routing method. The idea of this routing mechanism gives us a good insight into network science research. The practical use of this work is prospective in some real complex systems such as the Internet.

RPT: A Low Overhead Single-End Probing Tool for Detecting Network Congestion Positions

DTIC Science & Technology

2003-12-20

complete evaluation on the Internet , we need to know the real available bandwidth on all the links of a network path. But that information is hard to...School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Abstract Detecting the points of network congestion is an intriguing...research problem, because this infor- mation can benefit both regular network users and Internet Service Providers. This is also a highly challenging

An improved global dynamic routing strategy for scale-free network with tunable clustering

NASA Astrophysics Data System (ADS)

Sun, Lina; Huang, Ning; Zhang, Yue; Bai, Yannan

2016-08-01

An efficient routing strategy can deliver packets quickly to improve the network capacity. Node congestion and transmission path length are inevitable real-time factors for a good routing strategy. Existing dynamic global routing strategies only consider the congestion of neighbor nodes and the shortest path, which ignores other key nodes’ congestion on the path. With the development of detection methods and techniques, global traffic information is readily available and important for the routing choice. Reasonable use of this information can effectively improve the network routing. So, an improved global dynamic routing strategy is proposed, which considers the congestion of all nodes on the shortest path and incorporates the waiting time of the most congested node into the path. We investigate the effectiveness of the proposed routing for scale-free network with different clustering coefficients. The shortest path routing strategy and the traffic awareness routing strategy only considering the waiting time of neighbor node are analyzed comparatively. Simulation results show that network capacity is greatly enhanced compared with the shortest path; congestion state increase is relatively slow compared with the traffic awareness routing strategy. Clustering coefficient increase will not only reduce the network throughput, but also result in transmission average path length increase for scale-free network with tunable clustering. The proposed routing is favorable to ease network congestion and network routing strategy design.

Entropy-based link prediction in weighted networks

NASA Astrophysics Data System (ADS)

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

2017-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2010-04-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.

Wireless Communications in Reverberant Environments

DTIC Science & Technology

2015-01-01

Secure Wireless Agent Testbed (SWAT), the Protocol Engineering Advanced Networking (PROTEAN) Research Group, the Data Fusion Laboratory (DFL), and the...constraints of their application. 81 Bibliography [1] V. Gungor and G. Hancke, “Industrial wireless sensor networks : Challenges, design principles, and...Bhattacharya, “Path loss estimation for a wireless sensor network for application in ship,” Int. J. of Comput. Sci. and Mobile Computing, vol. 2, no. 6, pp

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

PubMed

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.

E-Center: A Collaborative Platform for Wide Area Network Users

NASA Astrophysics Data System (ADS)

Grigoriev, M.; DeMar, P.; Tierney, B.; Lake, A.; Metzger, J.; Frey, M.; Calyam, P.

2012-12-01

The E-Center is a social collaborative web-based platform for assisting network users in understanding network conditions across network paths of interest to them. It is designed to give a user the necessary tools to isolate, identify, and resolve network performance-related problems. E-Center provides network path information on a link-by-link level, as well as from an end-to-end perspective. In addition to providing current and recent network path data, E-Center is intended to provide a social media environment for them to share issues, ideas, concerns, and problems. The product has a modular design that accommodates integration of other network services that make use of the same network path and performance data.

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

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

William C. McLendon III; Brost, Randy C.

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 singlemore » 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.« less

Decentralized Routing and Diameter Bounds in Entangled Quantum Networks

NASA Astrophysics Data System (ADS)

Gyongyosi, Laszlo; Imre, Sandor

2017-04-01

Entangled quantum networks are a necessity for any future quantum internet, long-distance quantum key distribution, and quantum repeater networks. The entangled quantum nodes can communicate through several different levels of entanglement, leading to a heterogeneous, multi-level entangled network structure. The level of entanglement between the quantum nodes determines the hop distance, the number of spanned nodes, and the probability of the existence of an entangled link in the network. In this work we define a decentralized routing for entangled quantum networks. We show that the probability distribution of the entangled links can be modeled by a specific distribution in a base-graph. The results allow us to perform efficient routing to find the shortest paths in entangled quantum networks by using only local knowledge of the quantum nodes. We give bounds on the maximum value of the total number of entangled links of a path. The proposed scheme can be directly applied in practical quantum communications and quantum networking scenarios. This work was partially supported by the Hungarian Scientific Research Fund - OTKA K-112125.

Modeling Network Interdiction Tasks

DTIC Science & Technology

2015-09-17

they may attack the flaw to cause widespread chaos. Attacks such as these are considered a form of network interdiction. Assessing the networks over...and forms a foundation for the techniques of the measures and models approaches of the research framework, which is depicted in Figure 2. The...ensures the distance of the shortest (i, j) path is computed. This insight is attributed to Warshall [62]. The algorithm’s present form is attributed

Method and apparatus for eliminating unsuccessful tries in a search tree

NASA Technical Reports Server (NTRS)

Peterson, John C. (Inventor); Chow, Edward (Inventor); Madan, Herb S. (Inventor)

1991-01-01

A circuit switching system in an M-ary, n-cube connected network completes a best-first path from an originating node to a destination node by latching valid legs of the path as the path is being sought out. Each network node is provided with a routing hyperswitch sub-network, (HSN) connected between that node and bidirectional high capacity communication channels of the n-cube network. The sub-networks are all controlled by routing algorithms which respond to message identification headings (headers) on messages to be routed along one or more routing legs. The header includes information embedded therein which is interpreted by each sub-network to route and historically update the header. A logic circuit, available at every node, implements the algorithm and automatically forwards or back-tracks the header in the network legs of various paths until a completed path is latched.

Two betweenness centrality measures based on Randomized Shortest Paths

PubMed Central

Kivimäki, Ilkka; Lebichot, Bertrand; Saramäki, Jari; Saerens, Marco

2016-01-01

This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods considering random walks or current flows. The framework defines Boltzmann probability distributions over paths of the network which focus on the shortest paths, but also take into account longer paths depending on an inverse temperature parameter. RSP’s have previously proven to be useful in defining distance measures on networks. In this work we study their utility in quantifying the importance of the nodes of a network. The proposed RSP betweenness centralities combine, in an optimal way, the ideas of using the shortest and purely random paths for analysing the roles of network nodes, avoiding issues involving these two paradigms. We present the derivations of these measures and how they can be computed in an efficient way. In addition, we show with real world examples the potential of the RSP betweenness centralities in identifying interesting nodes of a network that more traditional methods might fail to notice. PMID:26838176

Structural factoring approach for analyzing stochastic networks

NASA Technical Reports Server (NTRS)

Hayhurst, Kelly J.; Shier, Douglas R.

1991-01-01

The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

A uniform energy consumption algorithm for wireless sensor and actuator networks based on dynamic polling point selection.

PubMed

Li, Shuo; Peng, Jun; Liu, Weirong; Zhu, Zhengfa; Lin, Kuo-Chi

2013-12-19

Recent research has indicated that using the mobility of the actuator in wireless sensor and actuator networks (WSANs) to achieve mobile data collection can greatly increase the sensor network lifetime. However, mobile data collection may result in unacceptable collection delays in the network if the path of the actuator is too long. Because real-time network applications require meeting data collection delay constraints, planning the path of the actuator is a very important issue to balance the prolongation of the network lifetime and the reduction of the data collection delay. In this paper, a multi-hop routing mobile data collection algorithm is proposed based on dynamic polling point selection with delay constraints to address this issue. The algorithm can actively update the selection of the actuator's polling points according to the sensor nodes' residual energies and their locations while also considering the collection delay constraint. It also dynamically constructs the multi-hop routing trees rooted by these polling points to balance the sensor node energy consumption and the extension of the network lifetime. The effectiveness of the algorithm is validated by simulation.

Limited-path-length entanglement percolation in quantum complex networks

NASA Astrophysics Data System (ADS)

Cuquet, Martí; Calsamiglia, John

2011-03-01

We study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted through them. For pure quantum state links, quantum networks exhibit a remarkable feature absent in classical networks: it is possible to effectively rewire the network by performing local operations on the nodes. We propose a family of such quantum operations that decrease the entanglement percolation threshold of the network and increase the size of the giant connected component. We provide analytic results for complex networks with an arbitrary (uncorrelated) degree distribution. These results are in good agreement with numerical simulations, which also show enhancement in correlated and real-world networks. The proposed quantum preprocessing strategies are not robust in the presence of noise. However, even when the links consist of (noisy) mixed-state links, one can send quantum information through a connecting path with a fidelity that decreases with the path length. In this noisy scenario, complex networks offer a clear advantage over regular lattices, namely, the fact that two arbitrary nodes can be connected through a relatively small number of steps, known as the small-world effect. We calculate the probability that two arbitrary nodes in the network can successfully communicate with a fidelity above a given threshold. This amounts to working out the classical problem of percolation with a limited path length. We find that this probability can be significant even for paths limited to few connections and that the results for standard (unlimited) percolation are soon recovered if the path length exceeds by a finite amount the average path length, which in complex networks generally scales logarithmically with the size of the network.

The Threshold Shortest Path Interdiction Problem for Critical Infrastructure Resilience Analysis

DTIC Science & Technology

2017-09-01

being pushed over the minimum designated threshold. 1.4 Motivation A simple setting to motivate this research is the “30 minutes or it’s free” guarantee...parallel network structure in Fig. 4.4 is simple in design , yet shows a relatively high resilience when compared to the other networks in general. The high...United States Naval Academy, 2002 Submitted in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE IN OPERATIONS RESEARCH

Semantic Segmentation of Convolutional Neural Network for Supervised Classification of Multispectral Remote Sensing

NASA Astrophysics Data System (ADS)

Xue, L.; Liu, C.; Wu, Y.; Li, H.

2018-04-01

Semantic segmentation is a fundamental research in remote sensing image processing. Because of the complex maritime environment, the classification of roads, vegetation, buildings and water from remote Sensing Imagery is a challenging task. Although the neural network has achieved excellent performance in semantic segmentation in the last years, there are a few of works using CNN for ground object segmentation and the results could be further improved. This paper used convolution neural network named U-Net, its structure has a contracting path and an expansive path to get high resolution output. In the network , We added BN layers, which is more conducive to the reverse pass. Moreover, after upsampling convolution , we add dropout layers to prevent overfitting. They are promoted to get more precise segmentation results. To verify this network architecture, we used a Kaggle dataset. Experimental results show that U-Net achieved good performance compared with other architectures, especially in high-resolution remote sensing imagery.

Networks model of the East Turkistan terrorism

NASA Astrophysics Data System (ADS)

Li, Ben-xian; Zhu, Jun-fang; Wang, Shun-guo

2015-02-01

The presence of the East Turkistan terrorist network in China can be traced back to the rebellions on the BAREN region in Xinjiang in April 1990. This article intends to research the East Turkistan networks in China and offer a panoramic view. The events, terrorists and their relationship are described using matrices. Then social network analysis is adopted to reveal the network type and the network structure characteristics. We also find the crucial terrorist leader. Ultimately, some results show that the East Turkistan network has big hub nodes and small shortest path, and that the network follows a pattern of small world network with hierarchical structure.

Assessment of critical path analyses of the relationship between permeability and electrical conductivity of pore networks

NASA Astrophysics Data System (ADS)

Skaggs, Todd H.

2011-10-01

Critical path analysis (CPA) is a method for estimating macroscopic transport coefficients of heterogeneous materials that are highly disordered at the micro-scale. Developed originally to model conduction in semiconductors, numerous researchers have noted that CPA might also have relevance to flow and transport processes in porous media. However, the results of several numerical investigations of critical path analysis on pore network models raise questions about the applicability of CPA to porous media. Among other things, these studies found that (i) in well-connected 3D networks, CPA predictions were inaccurate and became worse when heterogeneity was increased; and (ii) CPA could not fully explain the transport properties of 2D networks. To better understand the applicability of CPA to porous media, we made numerical computations of permeability and electrical conductivity on 2D and 3D networks with differing pore-size distributions and geometries. A new CPA model for the relationship between the permeability and electrical conductivity was found to be in good agreement with numerical data, and to be a significant improvement over a classical CPA model. In sufficiently disordered 3D networks, the new CPA prediction was within ±20% of the true value, and was nearly optimal in terms of minimizing the squared prediction errors across differing network configurations. The agreement of CPA predictions with 2D network computations was similarly good, although 2D networks are in general not well-suited for evaluating CPA. Numerical transport coefficients derived for regular 3D networks of slit-shaped pores were found to be in better agreement with experimental data from rock samples than were coefficients derived for networks of cylindrical pores.

Link prediction based on local weighted paths for complex networks

NASA Astrophysics Data System (ADS)

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

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

Pheromone Static Routing Strategy for Complex Networks

NASA Astrophysics Data System (ADS)

Hu, Mao-Bin; Henry, Y. K. Lau; Ling, Xiang; Jiang, Rui

2012-12-01

We adopt the concept of using pheromones to generate a set of static paths that can reach the performance of global dynamic routing strategy [Phys. Rev. E 81 (2010) 016113]. The path generation method consists of two stages. In the first stage, a pheromone is dropped to the nodes by packets forwarded according to the global dynamic routing strategy. In the second stage, pheromone static paths are generated according to the pheromone density. The output paths can greatly improve traffic systems' overall capacity on different network structures, including scale-free networks, small-world networks and random graphs. Because the paths are static, the system needs much less computational resources than the global dynamic routing strategy.

Path connectivity based spectral defragmentation in flexible bandwidth networks.

PubMed

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.

Performance analysis of multi-radio routing protocol in cognitive radio ad hoc networks under different path failure rate

NASA Astrophysics Data System (ADS)

Che-Aron, Z.; Abdalla, A. H.; Abdullah, K.; Hassan, W. H.

2013-12-01

In recent years, Cognitive Radio (CR) technology has largely attracted significant studies and research. Cognitive Radio Ad Hoc Network (CRAHN) is an emerging self-organized, multi-hop, wireless network which allows unlicensed users to opportunistically access available licensed spectrum bands for data communication under an intelligent and cautious manner. However, in CRAHNs, a lot of failures can easily occur during data transmission caused by PU (Primary User) activity, topology change, node fault, or link degradation. In this paper, an attempt has been made to evaluate the performance of the Multi-Radio Link-Quality Source Routing (MR-LQSR) protocol in CRAHNs under different path failure rate. In the MR-LQSR protocol, the Weighted Cumulative Expected Transmission Time (WCETT) is used as the routing metric. The simulations are carried out using the NS-2 simulator. The protocol performance is evaluated with respect to performance metrics like average throughput, packet loss, average end-to-end delay and average jitter. From the simulation results, it is observed that the number of path failures depends on the PUs number and mobility rate of SUs (Secondary Users). Moreover, the protocol performance is greatly affected when the path failure rate is high, leading to major service outages.

SDN-based path hopping communication against eavesdropping attack

NASA Astrophysics Data System (ADS)

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.

Adaptive Dynamics, Control, and Extinction in Networked Populations

DTIC Science & Technology

2015-07-09

network geometries. From the pre-history of paths that go extinct, a density function is created from the prehistory of these paths, and a clear local...density plots of Fig. 3b. Using the IAMM to compute the most probable path and comparing it to the prehistory of extinction events on stochastic networks

Cross-layer restoration with software defined networking based on IP over optical transport networks

NASA Astrophysics Data System (ADS)

Yang, Hui; Cheng, Lei; Deng, Junni; Zhao, Yongli; Zhang, Jie; Lee, Young

2015-10-01

The IP over optical transport network is a very promising networking architecture applied to the interconnection of geographically distributed data centers due to the performance guarantee of low delay, huge bandwidth and high reliability at a low cost. It can enable efficient resource utilization and support heterogeneous bandwidth demands in highly-available, cost-effective and energy-effective manner. In case of cross-layer link failure, to ensure a high-level quality of service (QoS) for user request after the failure becomes a research focus. In this paper, we propose a novel cross-layer restoration scheme for data center services with software defined networking based on IP over optical network. The cross-layer restoration scheme can enable joint optimization of IP network and optical network resources, and enhance the data center service restoration responsiveness to the dynamic end-to-end service demands. We quantitatively evaluate the feasibility and performances through the simulation under heavy traffic load scenario in terms of path blocking probability and path restoration latency. Numeric results show that the cross-layer restoration scheme improves the recovery success rate and minimizes the overall recovery time.

The navigation system of the JPL robot

NASA Technical Reports Server (NTRS)

Thompson, A. M.

1977-01-01

The control structure of the JPL research robot and the operations of the navigation subsystem are discussed. The robot functions as a network of interacting concurrent processes distributed among several computers and coordinated by a central executive. The results of scene analysis are used to create a segmented terrain model in which surface regions are classified by traversibility. The model is used by a path planning algorithm, PATH, which uses tree search methods to find the optimal path to a goal. In PATH, the search space is defined dynamically as a consequence of node testing. Maze-solving and the use of an associative data base for context dependent node generation are also discussed. Execution of a planned path is accomplished by a feedback guidance process with automatic error recovery.

Intelligent path loss prediction engine design using machine learning in the urban outdoor environment

NASA Astrophysics Data System (ADS)

Wang, Ruichen; Lu, Jingyang; Xu, Yiran; Shen, Dan; Chen, Genshe; Pham, Khanh; Blasch, Erik

2018-05-01

Due to the progressive expansion of public mobile networks and the dramatic growth of the number of wireless users in recent years, researchers are motivated to study the radio propagation in urban environments and develop reliable and fast path loss prediction models. During last decades, different types of propagation models are developed for urban scenario path loss predictions such as the Hata model and the COST 231 model. In this paper, the path loss prediction model is thoroughly investigated using machine learning approaches. Different non-linear feature selection methods are deployed and investigated to reduce the computational complexity. The simulation results are provided to demonstratethe validity of the machine learning based path loss prediction engine, which can correctly determine the signal propagation in a wireless urban setting.

Analyzing Study of Path loss Propagation Models in Wireless Communications at 0.8 GHz

NASA Astrophysics Data System (ADS)

Kadhim Hoomod, Haider; Al-Mejibli, Intisar; Issa Jabboory, Abbas

2018-05-01

The paths loss propagation model is an important tool in wireless network planning, allowing network planner to optimize the cell towers distribution and meet expected service level requirements. However, each type of path loss propagation model is designed to predict path loss in a particular environment that may be inaccurate in other different environment. In this research different propagation models (Hata Model, ICC-33 Model, Ericson Model and Coast-231 Model) have been analyzed and compared based on the measured data. The measured data represent signal strength of two cell towers placed in two different environments which obtained by a drive test of them. First one in AL-Habebea represents an urban environment (high-density region) and the second in AL-Hindea district represents a rural environment (low-density region) with operating frequency 0.8 GHz. The results of performing the analysis and comparison conclude that Hata model and Ericsson model shows small deviation from real measurements in urban environment and Hata model generally gives better prediction in the rural environment.

Composition and structure of a large online social network in The Netherlands.

PubMed

Corten, Rense

2012-01-01

Limitations in data collection have long been an obstacle in research on friendship networks. Most earlier studies use either a sample of ego-networks, or complete network data on a relatively small group (e.g., a single organization). The rise of online social networking services such as Friendster and Facebook, however, provides researchers with opportunities to study friendship networks on a much larger scale. This study uses complete network data from Hyves, a popular online social networking service in The Netherlands, comprising over eight million members and over 400 million online friendship relations. In the first study of its kind for The Netherlands, I examine the structure of this network in terms of the degree distribution, characteristic path length, clustering, and degree assortativity. Results indicate that this network shares features of other large complex networks, but also deviates in other respects. In addition, a comparison with other online social networks shows that these networks show remarkable similarities.

STEPP--Search Tool for Exploration of Petri net Paths: a new tool for Petri net-based path analysis in biochemical networks.

PubMed

Koch, Ina; Schueler, Markus; Heiner, Monika

2005-01-01

To understand biochemical processes caused by, e. g., mutations or deletions in the genome, the knowledge of possible alternative paths between two arbitrary chemical compounds is of increasing interest for biotechnology, pharmacology, medicine, and drug design. With the steadily increasing amount of data from high-throughput experiments new biochemical networks can be constructed and existing ones can be extended, which results in many large metabolic, signal transduction, and gene regulatory networks. The search for alternative paths within these complex and large networks can provide a huge amount of solutions, which can not be handled manually. Moreover, not all of the alternative paths are generally of interest. Therefore, we have developed and implemented a method, which allows us to define constraints to reduce the set of all structurally possible paths to the truly interesting path set. The paper describes the search algorithm and the constraints definition language. We give examples for path searches using this dedicated special language for a Petri net model of the sucrose-to-starch breakdown in the potato tuber.

STEPP - Search Tool for Exploration of Petri net Paths: A New Tool for Petri Net-Based Path Analysis in Biochemical Networks.

PubMed

Koch, Ina; Schüler, Markus; Heiner, Monika

2011-01-01

To understand biochemical processes caused by, e.g., mutations or deletions in the genome, the knowledge of possible alternative paths between two arbitrary chemical compounds is of increasing interest for biotechnology, pharmacology, medicine, and drug design. With the steadily increasing amount of data from high-throughput experiments new biochemical networks can be constructed and existing ones can be extended, which results in many large metabolic, signal transduction, and gene regulatory networks. The search for alternative paths within these complex and large networks can provide a huge amount of solutions, which can not be handled manually. Moreover, not all of the alternative paths are generally of interest. Therefore, we have developed and implemented a method, which allows us to define constraints to reduce the set of all structurally possible paths to the truly interesting path set. The paper describes the search algorithm and the constraints definition language. We give examples for path searches using this dedicated special language for a Petri net model of the sucrose-to-starch breakdown in the potato tuber. http://sanaga.tfh-berlin.de/~stepp/

A Time-constrained Network Voronoi Construction and Accessibility Analysis in Location-based Service Technology

NASA Astrophysics Data System (ADS)

Yu, W.; Ai, T.

2014-11-01

Accessibility analysis usually requires special models of spatial location analysis based on some geometric constructions, such as Voronoi diagram (abbreviated to VD). There are many achievements in classic Voronoi model research, however suffering from the following limitations for location-based services (LBS) applications. (1) It is difficult to objectively reflect the actual service areas of facilities by using traditional planar VDs, because human activities in LBS are usually constrained only to the network portion of the planar space. (2) Although some researchers have adopted network distance to construct VDs, their approaches are used in a static environment, where unrealistic measures of shortest path distance based on assumptions about constant travel speeds through the network were often used. (3) Due to the computational complexity of the shortest-path distance calculating, previous researches tend to be very time consuming, especially for large datasets and if multiple runs are required. To solve the above problems, a novel algorithm is developed in this paper. We apply network-based quadrat system and 1-D sequential expansion to find the corresponding subnetwork for each focus. The idea is inspired by the natural phenomenon that water flow extends along certain linear channels until meets others or arrives at the end of route. In order to accommodate the changes in traffic conditions, the length of network-quadrat is set upon the traffic condition of the corresponding street. The method has the advantage over Dijkstra's algorithm in that the time cost is avoided, and replaced with a linear time operation.

From the physics of interacting polymers to optimizing routes on the London Underground

PubMed Central

Yeung, Chi Ho; Saad, David; Wong, K. Y. Michael

2013-01-01

Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: (i) random graphs resembling Internet overlay networks, (ii) travel on the London Underground network based on Oyster card data, and (iii) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise. PMID:23898198

From the physics of interacting polymers to optimizing routes on the London Underground.

PubMed

Yeung, Chi Ho; Saad, David; Wong, K Y Michael

2013-08-20

Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: (i) random graphs resembling Internet overlay networks, (ii) travel on the London Underground network based on Oyster card data, and (iii) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise.

Path Flow Estimation Using Time Varying Coefficient State Space Model

NASA Astrophysics Data System (ADS)

Jou, Yow-Jen; Lan, Chien-Lun

2009-08-01

The dynamic path flow information is very crucial in the field of transportation operation and management, i.e., dynamic traffic assignment, scheduling plan, and signal timing. Time-dependent path information, which is important in many aspects, is nearly impossible to be obtained. Consequently, researchers have been seeking estimation methods for deriving valuable path flow information from less expensive traffic data, primarily link traffic counts of surveillance systems. This investigation considers a path flow estimation problem involving the time varying coefficient state space model, Gibbs sampler, and Kalman filter. Numerical examples with part of a real network of the Taipei Mass Rapid Transit with real O-D matrices is demonstrated to address the accuracy of proposed model. Results of this study show that this time-varying coefficient state space model is very effective in the estimation of path flow compared to time-invariant model.

Privacy-Preserving Relationship Path Discovery in Social Networks

NASA Astrophysics Data System (ADS)

Mezzour, Ghita; Perrig, Adrian; Gligor, Virgil; Papadimitratos, Panos

As social networks sites continue to proliferate and are being used for an increasing variety of purposes, the privacy risks raised by the full access of social networking sites over user data become uncomfortable. A decentralized social network would help alleviate this problem, but offering the functionalities of social networking sites is a distributed manner is a challenging problem. In this paper, we provide techniques to instantiate one of the core functionalities of social networks: discovery of paths between individuals. Our algorithm preserves the privacy of relationship information, and can operate offline during the path discovery phase. We simulate our algorithm on real social network topologies.

Traffic-engineering-aware shortest-path routing and its application in IP-over-WDM networks [Invited

NASA Astrophysics Data System (ADS)

Lee, Youngseok; Mukherjee, Biswanath

2004-03-01

Single shortest-path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal-cost multiple shortest paths in open shortest path first and intermediate system-intermediate system protocols does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, a TE-aware shortest path among all the equal-cost multiple shortest paths between each ingress-egress pair can be selected such that the maximum link load is significantly reduced. IP routers can use the globally optimal TE-aware shortest path without any change to existing routing protocols and without any serious configuration overhead. While calculating TE-aware shortest paths, the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next hop toward the destination by looking up the destination prefix. We present a mathematical problem formulation for finding a set of TE-aware shortest paths for the given network as an integer linear program, and we propose a simple heuristic for solving large instances of the problem. Then we explore the usage of our proposed algorithm for the integrated TE method in IP-over-WDM networks. The proposed algorithm is evaluated through simulations in IP networks as well as in IP-over-WDM networks.

Fault tolerant hypercube computer system architecture

NASA Technical Reports Server (NTRS)

Madan, Herb S. (Inventor); Chow, Edward (Inventor)

1989-01-01

A fault-tolerant multiprocessor computer system of the hypercube type comprising a hierarchy of computers of like kind which can be functionally substituted for one another as necessary is disclosed. Communication between the working nodes is via one communications network while communications between the working nodes and watch dog nodes and load balancing nodes higher in the structure is via another communications network separate from the first. A typical branch of the hierarchy reporting to a master node or host computer comprises, a plurality of first computing nodes; a first network of message conducting paths for interconnecting the first computing nodes as a hypercube. The first network provides a path for message transfer between the first computing nodes; a first watch dog node; and a second network of message connecting paths for connecting the first computing nodes to the first watch dog node independent from the first network, the second network provides an independent path for test message and reconfiguration affecting transfers between the first computing nodes and the first switch watch dog node. There is additionally, a plurality of second computing nodes; a third network of message conducting paths for interconnecting the second computing nodes as a hypercube. The third network provides a path for message transfer between the second computing nodes; a fourth network of message conducting paths for connecting the second computing nodes to the first watch dog node independent from the third network. The fourth network provides an independent path for test message and reconfiguration affecting transfers between the second computing nodes and the first watch dog node; and a first multiplexer disposed between the first watch dog node and the second and fourth networks for allowing the first watch dog node to selectively communicate with individual ones of the computing nodes through the second and fourth networks; as well as, a second watch dog node operably connected to the first multiplexer whereby the second watch dog node can selectively communicate with individual ones of the computing nodes through the second and fourth networks. The branch is completed by a first load balancing node; and a second multiplexer connected between the first load balancing node and the first and second watch dog nodes, allowing the first load balancing node to selectively communicate with the first and second watch dog nodes.

Dysfunctional whole brain networks in mild cognitive impairment patients: an fMRI study

NASA Astrophysics Data System (ADS)

Liu, Zhenyu; Bai, Lijun; Dai, Ruwei; Zhong, Chongguang; Xue, Ting; You, Youbo; Tian, Jie

2012-03-01

Mild cognitive impairment (MCI) was recognized as the prodromal stage of Alzheimer's disease (AD). Recent researches have shown that cognitive and memory decline in AD patients is coupled with losses of small-world attributes. However, few studies pay attention to the characteristics of the whole brain networks in MCI patients. In the present study, we investigated the topological properties of the whole brain networks utilizing graph theoretical approaches in 16 MCI patients, compared with 18 age-matched healthy subjects as a control. Both MCI patients and normal controls showed small-world architectures, with large clustering coefficients and short characteristic path lengths. We detected significantly longer characteristic path length in MCI patients compared with normal controls at the low sparsity. The longer characteristic path lengths in MCI indicated disrupted information processing among distant brain regions. Compared with normal controls, MCI patients showed decreased nodal centrality in the brain areas of the angular gyrus, heschl gyrus, hippocampus and superior parietal gyrus, while increased nodal centrality in the calcarine, inferior occipital gyrus and superior frontal gyrus. These changes in nodal centrality suggested a widespread rewiring in MCI patients, which may be an integrated reflection of reorganization of the brain networks accompanied with the cognitive decline. Our findings may be helpful for further understanding the pathological mechanisms of MCI.

A Uniform Energy Consumption Algorithm for Wireless Sensor and Actuator Networks Based on Dynamic Polling Point Selection

PubMed Central

Li, Shuo; Peng, Jun; Liu, Weirong; Zhu, Zhengfa; Lin, Kuo-Chi

2014-01-01

Recent research has indicated that using the mobility of the actuator in wireless sensor and actuator networks (WSANs) to achieve mobile data collection can greatly increase the sensor network lifetime. However, mobile data collection may result in unacceptable collection delays in the network if the path of the actuator is too long. Because real-time network applications require meeting data collection delay constraints, planning the path of the actuator is a very important issue to balance the prolongation of the network lifetime and the reduction of the data collection delay. In this paper, a multi-hop routing mobile data collection algorithm is proposed based on dynamic polling point selection with delay constraints to address this issue. The algorithm can actively update the selection of the actuator's polling points according to the sensor nodes' residual energies and their locations while also considering the collection delay constraint. It also dynamically constructs the multi-hop routing trees rooted by these polling points to balance the sensor node energy consumption and the extension of the network lifetime. The effectiveness of the algorithm is validated by simulation. PMID:24451455

A Hybrid Key Management Scheme for WSNs Based on PPBR and a Tree-Based Path Key Establishment Method

PubMed Central

Zhang, Ying; Liang, Jixing; Zheng, Bingxin; Chen, Wei

2016-01-01

With the development of wireless sensor networks (WSNs), in most application scenarios traditional WSNs with static sink nodes will be gradually replaced by Mobile Sinks (MSs), and the corresponding application requires a secure communication environment. Current key management researches pay less attention to the security of sensor networks with MS. This paper proposes a hybrid key management schemes based on a Polynomial Pool-based key pre-distribution and Basic Random key pre-distribution (PPBR) to be used in WSNs with MS. The scheme takes full advantages of these two kinds of methods to improve the cracking difficulty of the key system. The storage effectiveness and the network resilience can be significantly enhanced as well. The tree-based path key establishment method is introduced to effectively solve the problem of communication link connectivity. Simulation clearly shows that the proposed scheme performs better in terms of network resilience, connectivity and storage effectiveness compared to other widely used schemes. PMID:27070624

Tracking trade transactions in water resource systems: A node-arc optimization formulation

NASA Astrophysics Data System (ADS)

Erfani, Tohid; Huskova, Ivana; Harou, Julien J.

2013-05-01

We formulate and apply a multicommodity network flow node-arc optimization model capable of tracking trade transactions in complex water resource systems. The model uses a simple node to node network connectivity matrix and does not require preprocessing of all possible flow paths in the network. We compare the proposed node-arc formulation with an existing arc-path (flow path) formulation and explain the advantages and difficulties of both approaches. We verify the proposed formulation model on a hypothetical water distribution network. Results indicate the arc-path model solves the problem with fewer constraints, but the proposed formulation allows using a simple network connectivity matrix which simplifies modeling large or complex networks. The proposed algorithm allows converting existing node-arc hydroeconomic models that broadly represent water trading to ones that also track individual supplier-receiver relationships (trade transactions).

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

PubMed Central

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

2017-01-01

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. PMID:28481245

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

PubMed

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.

Improved routing strategy based on gravitational field theory

NASA Astrophysics Data System (ADS)

Song, Hai-Quan; Guo, Jin

2015-10-01

Routing and path selection are crucial for many communication and logistic applications. We study the interaction between nodes and packets and establish a simple model for describing the attraction of the node to the packet in transmission process by using the gravitational field theory, considering the real and potential congestion of the nodes. On the basis of this model, we propose a gravitational field routing strategy that considers the attractions of all of the nodes on the travel path to the packet. In order to illustrate the efficiency of proposed routing algorithm, we introduce the order parameter to measure the throughput of the network by the critical value of phase transition from a free flow phase to a congested phase, and study the distribution of betweenness centrality and traffic jam. Simulations show that, compared with the shortest path routing strategy, the gravitational field routing strategy considerably enhances the throughput of the network and balances the traffic load, and nearly all of the nodes are used efficiently. Project supported by the Technology and Development Research Project of China Railway Corporation (Grant No. 2012X007-D) and the Key Program of Technology and Development Research Foundation of China Railway Corporation (Grant No. 2012X003-A).

Japan Women's University Multi-Career Path Support Model for Female Researchers (abstract)

NASA Astrophysics Data System (ADS)

Toyama, Yoshikazu; Kodate, Kashiko

2009-04-01

The overall goal of this project, funded by MEXT-Japan (Ministry of Education, Culture, Sports, and Technology), is to implement prototypical programs to foster and proactively engage female researchers. The project aims to provide comprehensive support for female researchers who wish to raise a family and pursue an academic career, and increase opportunities for female researchers to play more active roles. To achieve these objectives, three core actions are taken. First, with out-of-office/out-of-lab research support (ubiquitous research support), an assistant researcher is provided to help perform experiments while the ubiquitous researcher is out of the laboratory. A communication network is introduced to connect the laboratory with home to facilitate in-home research. Second, with human resources support, researchers' career paths, abilities, and experiences are accumulated in e-portfolios. This enables researchers coming from different fields of employment to pursue other career paths. Third, a follow-up survey and project planning are conducted. We believe through science education, science can be demystified, and made more accessible and fascinating for children. This would bode well for future generations. Alumni questionnaires show that 80% of respondents were very satisfied to have graduated with a science background.

Graph Coarsening for Path Finding in Cybersecurity Graphs

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

Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh

2013-01-01

n the pass-the-hash attack, hackers repeatedly steal password hashes and move through a computer network with the goal of reaching a computer with high level administrative privileges. In this paper we apply graph coarsening in network graphs for the purpose of detecting hackers using this attack or assessing the risk level of the network's current state. We repeatedly take graph minors, which preserve the existence of paths in the graph, and take powers of the adjacency matrix to count the paths. This allows us to detect the existence of paths as well as find paths that have high risk ofmore » being used by adversaries.« less

Scientific collaboration and endorsement: Network analysis of coauthorship and citation networks

PubMed Central

Ding, Ying

2010-01-01

Scientific collaboration and endorsement are well-established research topics which utilize three kinds of methods: survey/questionnaire, bibliometrics, and complex network analysis. This paper combines topic modeling and path-finding algorithms to determine whether productive authors tend to collaborate with or cite researchers with the same or different interests, and whether highly cited authors tend to collaborate with or cite each other. Taking information retrieval as a test field, the results show that productive authors tend to directly coauthor with and closely cite colleagues sharing the same research interests; they do not generally collaborate directly with colleagues having different research topics, but instead directly or indirectly cite them; and highly cited authors do not generally coauthor with each other, but closely cite each other. PMID:21344057

A Network Approach to Environmental Impact in Psychotic Disorder: Brief Theoretical Framework.

PubMed

Isvoranu, Adela-Maria; Borsboom, Denny; van Os, Jim; Guloksuz, Sinan

2016-07-01

The spectrum of psychotic disorder represents a multifactorial and heterogeneous condition and is thought to result from a complex interplay between genetic and environmental factors. In the current paper, we analyze this interplay using network analysis, which has been recently proposed as a novel psychometric framework for the study of mental disorders. Using general population data, we construct network models for the relation between 3 environmental risk factors (cannabis use, developmental trauma, and urban environment), dimensional measures of psychopathology (anxiety, depression, interpersonal sensitivity, obsessive-compulsive disorder, phobic anxiety, somatizations, and hostility), and a composite measure of psychosis expression. Results indicate the existence of specific paths between environmental factors and symptoms. These paths most often involve cannabis use. In addition, the analyses suggest that symptom networks are more strongly connected for people exposed to environmental risk factors, implying that environmental exposure may lead to less resilient symptom networks. © The Author 2016. Published by Oxford University Press on behalf of the Maryland Psychiatric Research Center. All rights reserved. For permissions, please email: journals.permissions@oup.com.

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

PubMed

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.

Architecture and design of optical path networks utilizing waveband virtual links

NASA Astrophysics Data System (ADS)

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.

A link prediction method for heterogeneous networks based on BP neural network

NASA Astrophysics Data System (ADS)

Li, Ji-chao; Zhao, Dan-ling; Ge, Bing-Feng; Yang, Ke-Wei; Chen, Ying-Wu

2018-04-01

Most real-world systems, composed of different types of objects connected via many interconnections, can be abstracted as various complex heterogeneous networks. Link prediction for heterogeneous networks is of great significance for mining missing links and reconfiguring networks according to observed information, with considerable applications in, for example, friend and location recommendations and disease-gene candidate detection. In this paper, we put forward a novel integrated framework, called MPBP (Meta-Path feature-based BP neural network model), to predict multiple types of links for heterogeneous networks. More specifically, the concept of meta-path is introduced, followed by the extraction of meta-path features for heterogeneous networks. Next, based on the extracted meta-path features, a supervised link prediction model is built with a three-layer BP neural network. Then, the solution algorithm of the proposed link prediction model is put forward to obtain predicted results by iteratively training the network. Last, numerical experiments on the dataset of examples of a gene-disease network and a combat network are conducted to verify the effectiveness and feasibility of the proposed MPBP. It shows that the MPBP with very good performance is superior to the baseline methods.

Improved Efficient Routing Strategy on Scale-Free Networks

NASA Astrophysics Data System (ADS)

Jiang, Zhong-Yuan; Liang, Man-Gui

Since the betweenness of nodes in complex networks can theoretically represent the traffic load of nodes under the currently used routing strategy, we propose an improved efficient (IE) routing strategy to enhance to the network traffic capacity based on the betweenness centrality. Any node with the highest betweenness is susceptible to traffic congestion. An efficient way to improve the network traffic capacity is to redistribute the heavy traffic load from these central nodes to non-central nodes, so in this paper, we firstly give a path cost function by considering the sum of node betweenness with a tunable parameter β along the actual path. Then, by minimizing the path cost, our IE routing strategy achieved obvious improvement on the network transport efficiency. Simulations on scale-free Barabási-Albert (BA) networks confirmed the effectiveness of our strategy, when compared with the efficient routing (ER) and the shortest path (SP) routing.

Extended shortest path selection for package routing of complex networks

NASA Astrophysics Data System (ADS)

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.

The Research Path to the Virtual Class. ZIFF Papiere 105.

ERIC Educational Resources Information Center

Rajasingham, Lalita

This paper describes a project conducted in 1991-92, based on research conducted in 1986-87 that demonstrated the need for a telecommunications system with the capacity of integrated services digital networks (ISDN) that would allow for sound, vision, and integrated computer services. Called the Tri-Centre Project, it set out to explore, from the…

Social Learning Networks: From Data Analytics to Active Sensing

DTIC Science & Technology

2017-10-13

time updating of user models that in turn dictate the learning path of each student . In particular, we have designed , implemented, and evaluated our...decision, unless so designated by other documentation. 9. SPONSORING/MONITORING AGENCY NAME(S) AND ADDRESS (ES) U.S. Army Research Office P.O. Box...social network that exists between students , instructors, and modules of learning. Between 2015 and 2017, we completed a variety of data-driven

Mentors, networks, and resources for early career female atmospheric scientists

NASA Astrophysics Data System (ADS)

Hallar, A. G.; Avallone, L. M.; Edwards, L. M.; Thiry, H.; Ascent

2011-12-01

Atmospheric Science Collaborations and Enriching NeTworks (ASCENT) is a workshop series designed to bring together early career female scientists in the field of atmospheric science and related disciplines. ASCENT is a multi-faceted approach to retaining these junior scientists through the challenges in their research and teaching career paths. During the workshop, senior women scientists discuss their career and life paths. They also lead seminars on tools, resources and methods that can help early career scientists to be successful. Networking is a significant aspect of ASCENT, and many opportunities for both formal and informal interactions among the participants (of both personal and professional nature) are blended in the schedule. The workshops are held in Steamboat Springs, Colorado, home of a high-altitude atmospheric science laboratory - Storm Peak Laboratory, which also allows for nearby casual outings and a pleasant environment for participants. Near the conclusion of each workshop, junior and senior scientists are matched in mentee-mentor ratios of two junior scientists per senior scientist. An external evaluation of the three workshop cohorts concludes that the workshops have been successful in establishing and expanding personal and research-related networks, and that seminars have been useful in creating confidence and sharing resources for such things as preparing promotion and tenure packages, interviewing and negotiating job offers, and writing successful grant proposals.

Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks

PubMed Central

Robinson, Y. Harold; Rajaram, M.

2015-01-01

Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique. PMID:26819966

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

PubMed

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.

Enabling Research Network Connectivity to Clouds with Virtual Router Technology

NASA Astrophysics Data System (ADS)

Seuster, R.; Casteels, K.; Leavett-Brown, CR; Paterson, M.; Sobie, RJ

2017-10-01

The use of opportunistic cloud resources by HEP experiments has significantly increased over the past few years. Clouds that are owned or managed by the HEP community are connected to the LHCONE network or the research network with global access to HEP computing resources. Private clouds, such as those supported by non-HEP research funds are generally connected to the international research network; however, commercial clouds are either not connected to the research network or only connect to research sites within their national boundaries. Since research network connectivity is a requirement for HEP applications, we need to find a solution that provides a high-speed connection. We are studying a solution with a virtual router that will address the use case when a commercial cloud has research network connectivity in a limited region. In this situation, we host a virtual router in our HEP site and require that all traffic from the commercial site transit through the virtual router. Although this may increase the network path and also the load on the HEP site, it is a workable solution that would enable the use of the remote cloud for low I/O applications. We are exploring some simple open-source solutions. In this paper, we present the results of our studies and how it will benefit our use of private and public clouds for HEP computing.

CMPF: class-switching minimized pathfinding in metabolic networks.

PubMed

Lim, Kevin; Wong, Limsoon

2012-01-01

The metabolic network is an aggregation of enzyme catalyzed reactions that converts one compound to another. Paths in a metabolic network are a sequence of enzymes that describe how a chemical compound of interest can be produced in a biological system. As the number of such paths is quite large, many methods have been developed to score paths so that the k-shortest paths represent the set of paths that are biologically meaningful or efficient. However, these approaches do not consider whether the sequence of enzymes can be manufactured in the same pathway/species/localization. As a result, a predicted sequence might consist of groups of enzymes that operate in distinct pathway/species/localization and may not truly reflect the events occurring within cell. We propose a path weighting method CMPF (Class-switching Minimized Pathfinder) to search for routes in a metabolic network which minimizes pathway switching. In biological terms, a pathway is a series of chemical reactions which define a specific function (e.g. glycolysis). We conjecture that routes that cross many pathways are inefficient since different pathways define different metabolic functions. In addition, native routes are also well characterized within pathways, suggesting that reasonable paths should not involve too many pathway switches. Our method can be generalized when reactions participate in a class set (e.g., pathways, species or cellular localization) so that the paths predicted have minimal class crossings. We show that our method generates k-paths that involve the least number of class switching. In addition, we also show that native paths are recoverable and alternative paths deviates less from native paths compared to other methods. This suggests that paths ranked by our method could be a way to predict paths that are likely to occur in biological systems.

Epidemic extinction paths in complex networks

NASA Astrophysics Data System (ADS)

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.

Epidemic extinction paths in complex networks.

PubMed

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.

A link-adding strategy for transport efficiency of complex networks

NASA Astrophysics Data System (ADS)

Ma, Jinlong; Han, Weizhan; Guo, Qing; Wang, Zhenyong; Zhang, Shuai

2016-12-01

The transport efficiency is one of the critical parameters to evaluate the performance of a network. In this paper, we propose an improved efficient (IE) strategy to enhance the network transport efficiency of complex networks by adding a fraction of links to an existing network based on the node’s local degree centrality and the shortest path length. Simulation results show that the proposed strategy can bring better traffic capacity and shorter average shortest path length than the low-degree-first (LDF) strategy under the shortest path routing protocol. It is found that the proposed strategy is beneficial to the improvement of overall traffic handling and delivering ability of the network. This study can alleviate the congestion in networks, and is helpful to design and optimize realistic networks.

Road networks as collections of minimum cost paths

NASA Astrophysics Data System (ADS)

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.

Blocking performance approximation in flexi-grid networks

NASA Astrophysics Data System (ADS)

Ge, Fei; Tan, Liansheng

2016-12-01

The blocking probability to the path requests is an important issue in flexible bandwidth optical communications. In this paper, we propose a blocking probability approximation method of path requests in flexi-grid networks. It models the bundled neighboring carrier allocation with a group of birth-death processes and provides a theoretical analysis to the blocking probability under variable bandwidth traffic. The numerical results show the effect of traffic parameters to the blocking probability of path requests. We use the first fit algorithm in network nodes to allocate neighboring carriers to path requests in simulations, and verify approximation results.

Optimization research of railway passenger transfer scheme based on ant colony algorithm

NASA Astrophysics Data System (ADS)

Ni, Xiang

2018-05-01

The optimization research of railway passenger transfer scheme can provide strong support for railway passenger transport system, and its essence is path search. This paper realized the calculation of passenger transfer scheme for high speed railway when giving the time and stations of departure and arrival. The specific method that used were generating a passenger transfer service network of high-speed railway, establishing optimization model and searching by Ant Colony Algorithm. Finally, making analysis on the scheme from LanZhouxi to BeiJingXi which were based on high-speed railway network of China in 2017. The results showed that the transfer network and model had relatively high practical value and operation efficiency.

Path loss variation of on-body UWB channel in the frequency bands of IEEE 802.15.6 standard.

PubMed

Goswami, Dayananda; Sarma, Kanak C; Mahanta, Anil

2016-06-01

The wireless body area network (WBAN) has gaining tremendous attention among researchers and academicians for its envisioned applications in healthcare service. Ultra wideband (UWB) radio technology is considered as excellent air interface for communication among body area network devices. Characterisation and modelling of channel parameters are utmost prerequisite for the development of reliable communication system. The path loss of on-body UWB channel for each frequency band defined in IEEE 802.15.6 standard is experimentally determined. The parameters of path loss model are statistically determined by analysing measurement data. Both the line-of-sight and non-line-of-sight channel conditions are considered in the measurement. Variations of parameter values with the size of human body are analysed along with the variation of parameter values with the surrounding environments. It is observed that the parameters of the path loss model vary with the frequency band as well as with the body size and surrounding environment. The derived parameter values are specific to the particular frequency bands of IEEE 802.15.6 standard, which will be useful for the development of efficient UWB WBAN system.

Dynamic Network-Based Epistasis Analysis: Boolean Examples

PubMed Central

Azpeitia, Eugenio; Benítez, Mariana; Padilla-Longoria, Pablo; Espinosa-Soto, Carlos; Alvarez-Buylla, Elena R.

2011-01-01

In this article we focus on how the hierarchical and single-path assumptions of epistasis analysis can bias the inference of gene regulatory networks. Here we emphasize the critical importance of dynamic analyses, and specifically illustrate the use of Boolean network models. Epistasis in a broad sense refers to gene interactions, however, as originally proposed by Bateson, epistasis is defined as the blocking of a particular allelic effect due to the effect of another allele at a different locus (herein, classical epistasis). Classical epistasis analysis has proven powerful and useful, allowing researchers to infer and assign directionality to gene interactions. As larger data sets are becoming available, the analysis of classical epistasis is being complemented with computer science tools and system biology approaches. We show that when the hierarchical and single-path assumptions are not met in classical epistasis analysis, the access to relevant information and the correct inference of gene interaction topologies is hindered, and it becomes necessary to consider the temporal dynamics of gene interactions. The use of dynamical networks can overcome these limitations. We particularly focus on the use of Boolean networks that, like classical epistasis analysis, relies on logical formalisms, and hence can complement classical epistasis analysis and relax its assumptions. We develop a couple of theoretical examples and analyze them from a dynamic Boolean network model perspective. Boolean networks could help to guide additional experiments and discern among alternative regulatory schemes that would be impossible or difficult to infer without the elimination of these assumption from the classical epistasis analysis. We also use examples from the literature to show how a Boolean network-based approach has resolved ambiguities and guided epistasis analysis. Our article complements previous accounts, not only by focusing on the implications of the hierarchical and single-path assumption, but also by demonstrating the importance of considering temporal dynamics, and specifically introducing the usefulness of Boolean network models and also reviewing some key properties of network approaches. PMID:22645556

Three layers multi-granularity OCDM switching system based on learning-stateful PCE

NASA Astrophysics Data System (ADS)

Wang, Yubao; Liu, Yanfei; Sun, Hao

2017-10-01

In the existing three layers multi-granularity OCDM switching system (TLMG-OCDMSS), F-LSP, L-LSP and OC-LSP can be bundled as switching granularity. For CPU-intensive network, the node not only needs to compute the path but also needs to bundle the switching granularity so that the load of single node is heavy. The node will paralyze when the traffic of the node is too heavy, which will impact the performance of the whole network seriously. The introduction of stateful PCE(S-PCE) will effectively solve these problems. PCE is composed of two parts, namely, the path computation element and the database (TED and LSPDB), and returns the result of path computation to PCC (path computation clients) after PCC sends the path computation request to it. In this way, the pressure of the distributed path computation in each node is reduced. In this paper, we propose the concept of Learning PCE (L-PCE), which uses the existing LSPDB as the data source of PCE's learning. By this means, we can simplify the path computation and reduce the network delay, as a result, improving the performance of network.

Path statistics, memory, and coarse-graining of continuous-time random walks on networks

PubMed Central

Kion-Crosby, Willow; Morozov, Alexandre V.

2015-01-01

Continuous-time random walks (CTRWs) on discrete state spaces, ranging from regular lattices to complex networks, are ubiquitous across physics, chemistry, and biology. Models with coarse-grained states (for example, those employed in studies of molecular kinetics) or spatial disorder can give rise to memory and non-exponential distributions of waiting times and first-passage statistics. However, existing methods for analyzing CTRWs on complex energy landscapes do not address these effects. Here we use statistical mechanics of the nonequilibrium path ensemble to characterize first-passage CTRWs on networks with arbitrary connectivity, energy landscape, and waiting time distributions. Our approach can be applied to calculating higher moments (beyond the mean) of path length, time, and action, as well as statistics of any conservative or non-conservative force along a path. For homogeneous networks, we derive exact relations between length and time moments, quantifying the validity of approximating a continuous-time process with its discrete-time projection. For more general models, we obtain recursion relations, reminiscent of transfer matrix and exact enumeration techniques, to efficiently calculate path statistics numerically. We have implemented our algorithm in PathMAN (Path Matrix Algorithm for Networks), a Python script that users can apply to their model of choice. We demonstrate the algorithm on a few representative examples which underscore the importance of non-exponential distributions, memory, and coarse-graining in CTRWs. PMID:26646868

Nonlinear Motion Tracking by Deep Learning Architecture

NASA Astrophysics Data System (ADS)

Verma, Arnav; Samaiya, Devesh; Gupta, Karunesh K.

2018-03-01

In the world of Artificial Intelligence, object motion tracking is one of the major problems. The extensive research is being carried out to track people in crowd. This paper presents a unique technique for nonlinear motion tracking in the absence of prior knowledge of nature of nonlinear path that the object being tracked may follow. We achieve this by first obtaining the centroid of the object and then using the centroid as the current example for a recurrent neural network trained using real-time recurrent learning. We have tweaked the standard algorithm slightly and have accumulated the gradient for few previous iterations instead of using just the current iteration as is the norm. We show that for a single object, such a recurrent neural network is highly capable of approximating the nonlinearity of its path.

Routing and spectrum assignment based on ant colony optimization of minimum consecutiveness loss in elastic optical networks

NASA Astrophysics Data System (ADS)

Wang, Fu; Liu, Bo; Zhang, Lijia; Xin, Xiangjun; Tian, Qinghua; Zhang, Qi; Rao, Lan; Tian, Feng; Luo, Biao; Liu, Yingjun; Tang, Bao

2016-10-01

Elastic Optical Networks are considered to be a promising technology for future high-speed network. In this paper, we propose a RSA algorithm based on the ant colony optimization of minimum consecutiveness loss (ACO-MCL). Based on the effect of the spectrum consecutiveness loss on the pheromone in the ant colony optimization, the path and spectrum of the minimal impact on the network are selected for the service request. When an ant arrives at the destination node from the source node along a path, we assume that this path is selected for the request. We calculate the consecutiveness loss of candidate-neighbor link pairs along this path after the routing and spectrum assignment. Then, the networks update the pheromone according to the value of the consecutiveness loss. We save the path with the smallest value. After multiple iterations of the ant colony optimization, the final selection of the path is assigned for the request. The algorithms are simulated in different networks. The results show that ACO-MCL algorithm performs better in blocking probability and spectrum efficiency than other algorithms. Moreover, the ACO-MCL algorithm can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness. Compared with other algorithms, the ACO-MCL algorithm can reduce the blocking rate by at least 5.9% in heavy load.

cPath: open source software for collecting, storing, and querying biological pathways.

PubMed

Cerami, Ethan G; Bader, Gary D; Gross, Benjamin E; Sander, Chris

2006-11-13

Biological pathways, including metabolic pathways, protein interaction networks, signal transduction pathways, and gene regulatory networks, are currently represented in over 220 diverse databases. These data are crucial for the study of specific biological processes, including human diseases. Standard exchange formats for pathway information, such as BioPAX, CellML, SBML and PSI-MI, enable convenient collection of this data for biological research, but mechanisms for common storage and communication are required. We have developed cPath, an open source database and web application for collecting, storing, and querying biological pathway data. cPath makes it easy to aggregate custom pathway data sets available in standard exchange formats from multiple databases, present pathway data to biologists via a customizable web interface, and export pathway data via a web service to third-party software, such as Cytoscape, for visualization and analysis. cPath is software only, and does not include new pathway information. Key features include: a built-in identifier mapping service for linking identical interactors and linking to external resources; built-in support for PSI-MI and BioPAX standard pathway exchange formats; a web service interface for searching and retrieving pathway data sets; and thorough documentation. The cPath software is freely available under the LGPL open source license for academic and commercial use. cPath is a robust, scalable, modular, professional-grade software platform for collecting, storing, and querying biological pathways. It can serve as the core data handling component in information systems for pathway visualization, analysis and modeling.

Modeling and optimization of Quality of Service routing in Mobile Ad hoc Networks

NASA Astrophysics Data System (ADS)

Rafsanjani, Marjan Kuchaki; Fatemidokht, Hamideh; Balas, Valentina Emilia

2016-01-01

Mobile ad hoc networks (MANETs) are a group of mobile nodes that are connected without using a fixed infrastructure. In these networks, nodes communicate with each other by forming a single-hop or multi-hop network. To design effective mobile ad hoc networks, it is important to evaluate the performance of multi-hop paths. In this paper, we present a mathematical model for a routing protocol under energy consumption and packet delivery ratio of multi-hop paths. In this model, we use geometric random graphs rather than random graphs. Our proposed model finds effective paths that minimize the energy consumption and maximizes the packet delivery ratio of the network. Validation of the mathematical model is performed through simulation.

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

PubMed

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.

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

PubMed Central

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

2018-01-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. PMID:29657804

Traffic engineering and regenerator placement in GMPLS networks with restoration

NASA Astrophysics Data System (ADS)

Yetginer, Emre; Karasan, Ezhan

2002-07-01

In this paper we study regenerator placement and traffic engineering of restorable paths in Generalized Multipro-tocol Label Switching (GMPLS) networks. Regenerators are necessary in optical networks due to transmission impairments. We study a network architecture where there are regenerators at selected nodes and we propose two heuristic algorithms for the regenerator placement problem. Performances of these algorithms in terms of required number of regenerators and computational complexity are evaluated. In this network architecture with sparse regeneration, offline computation of working and restoration paths is studied with bandwidth reservation and path rerouting as the restoration scheme. We study two approaches for selecting working and restoration paths from a set of candidate paths and formulate each method as an Integer Linear Programming (ILP) prob-lem. Traffic uncertainty model is developed in order to compare these methods based on their robustness with respect to changing traffic patterns. Traffic engineering methods are compared based on number of additional demands due to traffic uncertainty that can be carried. Regenerator placement algorithms are also evaluated from a traffic engineering point of view.

Resilient Wireless Sensor Networks Using Topology Control: A Review

PubMed Central

Huang, Yuanjiang; Martínez, José-Fernán; Sendra, Juana; López, Lourdes

2015-01-01

Wireless sensor networks (WSNs) may be deployed in failure-prone environments, and WSNs nodes easily fail due to unreliable wireless connections, malicious attacks and resource-constrained features. Nevertheless, if WSNs can tolerate at most losing k − 1 nodes while the rest of nodes remain connected, the network is called k − connected. k is one of the most important indicators for WSNs’ self-healing capability. Following a WSN design flow, this paper surveys resilience issues from the topology control and multi-path routing point of view. This paper provides a discussion on transmission and failure models, which have an important impact on research results. Afterwards, this paper reviews theoretical results and representative topology control approaches to guarantee WSNs to be k − connected at three different network deployment stages: pre-deployment, post-deployment and re-deployment. Multi-path routing protocols are discussed, and many NP-complete or NP-hard problems regarding topology control are identified. The challenging open issues are discussed at the end. This paper can serve as a guideline to design resilient WSNs. PMID:26404272

Modelling information flow along the human connectome using maximum flow.

PubMed

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

2018-01-01

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

Subjective well-being associated with size of social network and social support of elderly.

PubMed

Wang, Xingmin

2016-06-01

The current study examined the impact of size of social network on subjective well-being of elderly, mainly focused on confirmation of the mediator role of perceived social support. The results revealed that both size of social network and perceived social support were significantly correlated with subjective well-being. Structural equation modeling indicated that perceived social support partially mediated size of social network to subjective well-being. The final model also revealed significant both paths from size of social network to subjective well-being through perceived social support. The findings extended prior researches and provided valuable evidence on how to promote mental health of the elderly. © The Author(s) 2014.

Multi-criteria robustness analysis of metro networks

NASA Astrophysics Data System (ADS)

Wang, Xiangrong; Koç, Yakup; Derrible, Sybil; Ahmad, Sk Nasir; Pino, Willem J. A.; Kooij, Robert E.

2017-05-01

Metros (heavy rail transit systems) are integral parts of urban transportation systems. Failures in their operations can have serious impacts on urban mobility, and measuring their robustness is therefore critical. Moreover, as physical networks, metros can be viewed as topological entities, and as such they possess measurable network properties. In this article, by using network science and graph theory, we investigate ten theoretical and four numerical robustness metrics and their performance in quantifying the robustness of 33 metro networks under random failures or targeted attacks. We find that the ten theoretical metrics capture two distinct aspects of robustness of metro networks. First, several metrics place an emphasis on alternative paths. Second, other metrics place an emphasis on the length of the paths. To account for all aspects, we standardize all ten indicators and plot them on radar diagrams to assess the overall robustness for metro networks. Overall, we find that Tokyo and Rome are the most robust networks. Rome benefits from short transferring and Tokyo has a significant number of transfer stations, both in the city center and in the peripheral area of the city, promoting both a higher number of alternative paths and overall relatively short path-lengths.

An improved sampling method of complex network

NASA Astrophysics Data System (ADS)

Gao, Qi; Ding, Xintong; Pan, Feng; Li, Weixing

2014-12-01

Sampling subnet is an important topic of complex network research. Sampling methods influence the structure and characteristics of subnet. Random multiple snowball with Cohen (RMSC) process sampling which combines the advantages of random sampling and snowball sampling is proposed in this paper. It has the ability to explore global information and discover the local structure at the same time. The experiments indicate that this novel sampling method could keep the similarity between sampling subnet and original network on degree distribution, connectivity rate and average shortest path. This method is applicable to the situation where the prior knowledge about degree distribution of original network is not sufficient.

Adaptive Reliable Routing Protocol Using Combined Link Stability Estimation for Mobile Ad hoc Networks

NASA Astrophysics Data System (ADS)

Vadivel, R.; Bhaskaran, V. Murali

2010-10-01

The main reason for packet loss in ad hoc networks is the link failure or node failure. In order to increase the path stability, it is essential to distinguish and moderate the failures. By knowing individual link stability along a path, path stability can be identified. In this paper, we develop an adaptive reliable routing protocol using combined link stability estimation for mobile ad hoc networks. The main objective of this protocol is to determine a Quality of Service (QoS) path along with prolonging the network life time and to reduce the packet loss. We calculate a combined metric for a path based on the parameters Link Expiration Time, Node Remaining Energy and Node Velocity and received signal strength to predict the link stability or lifetime. Then, a bypass route is established to retransmit the lost data, when a link failure occurs. By simulation results, we show that the proposed reliable routing protocol achieves high delivery ratio with reduced delay and packet drop.

Modeling the average shortest-path length in growth of word-adjacency networks

NASA Astrophysics Data System (ADS)

Kulig, Andrzej; DroŻdŻ, Stanisław; Kwapień, Jarosław; OświÈ©cimka, Paweł

2015-03-01

We investigate properties of evolving linguistic networks defined by the word-adjacency relation. Such networks belong to the category of networks with accelerated growth but their shortest-path length appears to reveal the network size dependence of different functional form than the ones known so far. We thus compare the networks created from literary texts with their artificial substitutes based on different variants of the Dorogovtsev-Mendes model and observe that none of them is able to properly simulate the novel asymptotics of the shortest-path length. Then, we identify the local chainlike linear growth induced by grammar and style as a missing element in this model and extend it by incorporating such effects. It is in this way that a satisfactory agreement with the empirical result is obtained.

EEG-based research on brain functional networks in cognition.

PubMed

Wang, Niannian; Zhang, Li; Liu, Guozhong

2015-01-01

Recently, exploring the cognitive functions of the brain by establishing a network model to understand the working mechanism of the brain has become a popular research topic in the field of neuroscience. In this study, electroencephalography (EEG) was used to collect data from subjects given four different mathematical cognitive tasks: recite numbers clockwise and counter-clockwise, and letters clockwise and counter-clockwise to build a complex brain function network (BFN). By studying the connectivity features and parameters of those brain functional networks, it was found that the average clustering coefficient is much larger than its corresponding random network and the average shortest path length is similar to the corresponding random networks, which clearly shows the characteristics of the small-world network. The brain regions stimulated during the experiment are consistent with traditional cognitive science regarding learning, memory, comprehension, and other rational judgment results. The new method of complex networking involves studying the mathematical cognitive process of reciting, providing an effective research foundation for exploring the relationship between brain cognition and human learning skills and memory. This could help detect memory deficits early in young and mentally handicapped children, and help scientists understand the causes of cognitive brain disorders.

[Not Available].

PubMed

Yanashima, Ryoji; Kitagawa, Noriyuki; Matsubara, Yoshiya; Weatheritt, Robert; Oka, Kotaro; Kikuchi, Shinichi; Tomita, Masaru; Ishizaki, Shun

2009-01-01

The scale-free and small-world network models reflect the functional units of networks. However, when we investigated the network properties of a signaling pathway using these models, no significant differences were found between the original undirected graphs and the graphs in which inactive proteins were eliminated from the gene expression data. We analyzed signaling networks by focusing on those pathways that best reflected cellular function. Therefore, our analysis of pathways started from the ligands and progressed to transcription factors and cytoskeletal proteins. We employed the Python module to assess the target network. This involved comparing the original and restricted signaling cascades as a directed graph using microarray gene expression profiles of late onset Alzheimer's disease. The most commonly used method of shortest-path analysis neglects to consider the influences of alternative pathways that can affect the activation of transcription factors or cytoskeletal proteins. We therefore introduced included k-shortest paths and k-cycles in our network analysis using the Python modules, which allowed us to attain a reasonable computational time and identify k-shortest paths. This technique reflected results found in vivo and identified pathways not found when shortest path or degree analysis was applied. Our module enabled us to comprehensively analyse the characteristics of biomolecular networks and also enabled analysis of the effects of diseases considering the feedback loop and feedforward loop control structures as an alternative path.

Evolvable Neuronal Paths: A Novel Basis for Information and Search in the Brain

PubMed Central

Fernando, Chrisantha; Vasas, Vera; Szathmáry, Eörs; Husbands, Phil

2011-01-01

We propose a previously unrecognized kind of informational entity in the brain that is capable of acting as the basis for unlimited hereditary variation in neuronal networks. This unit is a path of activity through a network of neurons, analogous to a path taken through a hidden Markov model. To prove in principle the capabilities of this new kind of informational substrate, we show how a population of paths can be used as the hereditary material for a neuronally implemented genetic algorithm, (the swiss-army knife of black-box optimization techniques) which we have proposed elsewhere could operate at somatic timescales in the brain. We compare this to the same genetic algorithm that uses a standard ‘genetic’ informational substrate, i.e. non-overlapping discrete genotypes, on a range of optimization problems. A path evolution algorithm (PEA) is defined as any algorithm that implements natural selection of paths in a network substrate. A PEA is a previously unrecognized type of natural selection that is well suited for implementation by biological neuronal networks with structural plasticity. The important similarities and differences between a standard genetic algorithm and a PEA are considered. Whilst most experiments are conducted on an abstract network model, at the conclusion of the paper a slightly more realistic neuronal implementation of a PEA is outlined based on Izhikevich spiking neurons. Finally, experimental predictions are made for the identification of such informational paths in the brain. PMID:21887266

Diversified Control Paths: A Significant Way Disease Genes Perturb the Human Regulatory Network

PubMed Central

Wang, Bingbo; Gao, Lin; Zhang, Qingfang; Li, Aimin; Deng, Yue; Guo, Xingli

2015-01-01

Background The complexity of biological systems motivates us to use the underlying networks to provide deep understanding of disease etiology and the human diseases are viewed as perturbations of dynamic properties of networks. Control theory that deals with dynamic systems has been successfully used to capture systems-level knowledge in large amount of quantitative biological interactions. But from the perspective of system control, the ways by which multiple genetic factors jointly perturb a disease phenotype still remain. Results In this work, we combine tools from control theory and network science to address the diversified control paths in complex networks. Then the ways by which the disease genes perturb biological systems are identified and quantified by the control paths in a human regulatory network. Furthermore, as an application, prioritization of candidate genes is presented by use of control path analysis and gene ontology annotation for definition of similarities. We use leave-one-out cross-validation to evaluate the ability of finding the gene-disease relationship. Results have shown compatible performance with previous sophisticated works, especially in directed systems. Conclusions Our results inspire a deeper understanding of molecular mechanisms that drive pathological processes. Diversified control paths offer a basis for integrated intervention techniques which will ultimately lead to the development of novel therapeutic strategies. PMID:26284649

Atmospheric Responses from Radiosonde Observations of the 2017 Total Solar Eclipse

NASA Astrophysics Data System (ADS)

Fowler, J.

2017-12-01

The Atmospheric Responses from Radiosonde Observations project during the August 21st, 2017 Total Solar Eclipse was to observe the atmospheric response under the shadow of the Moon using both research and operational earth science instruments run primarily by undergraduate students not formally trained in atmospheric science. During the eclipse, approximately 15 teams across the path of totality launched radiosonde balloon platforms in very rapid, serial sonde deployment. Our strategy was to combine a dense ground observation network with multiple radiosonde sites, located within and along the margins of the path of totality. This can demonstrate how dense observation networks leveraged among various programs can "fill the gaps" in data sparse regions allowing research ideas and questions that previously could not be approached with courser resolution data and improving the scientific understanding and prediction of geophysical and hazardous phenomenon. The core scientific objectives are (1) to make high-resolution surface and upper air observations in several sites along the eclipse path (2) to quantitatively study atmospheric responses to the rapid disappearance of the Sun across the United States, and (3) to assess the performance of high-resolution weather forecasting models in simulating the observed response. Such a scientific campaign, especially unique during a total solar eclipse, provides a rare but life-altering opportunity to attract and enable next-generation of observational scientists. It was an ideal "laboratory" for graduate, undergraduate, citizen scientists and k-12 students and staff to learn, explore and research in STEM.

Toward Omics-Based, Systems Biomedicine, and Path and Drug Discovery Methodologies for Depression-Inflammation Research.

PubMed

Maes, Michael; Nowak, Gabriel; Caso, Javier R; Leza, Juan Carlos; Song, Cai; Kubera, Marta; Klein, Hans; Galecki, Piotr; Noto, Cristiano; Glaab, Enrico; Balling, Rudi; Berk, Michael

2016-07-01

Meta-analyses confirm that depression is accompanied by signs of inflammation including increased levels of acute phase proteins, e.g., C-reactive protein, and pro-inflammatory cytokines, e.g., interleukin-6. Supporting the translational significance of this, a meta-analysis showed that anti-inflammatory drugs may have antidepressant effects. Here, we argue that inflammation and depression research needs to get onto a new track. Firstly, the choice of inflammatory biomarkers in depression research was often too selective and did not consider the broader pathways. Secondly, although mild inflammatory responses are present in depression, other immune-related pathways cannot be disregarded as new drug targets, e.g., activation of cell-mediated immunity, oxidative and nitrosative stress (O&NS) pathways, autoimmune responses, bacterial translocation, and activation of the toll-like receptor and neuroprogressive pathways. Thirdly, anti-inflammatory treatments are sometimes used without full understanding of their effects on the broader pathways underpinning depression. Since many of the activated immune-inflammatory pathways in depression actually confer protection against an overzealous inflammatory response, targeting these pathways may result in unpredictable and unwanted results. Furthermore, this paper discusses the required improvements in research strategy, i.e., path and drug discovery processes, omics-based techniques, and systems biomedicine methodologies. Firstly, novel methods should be employed to examine the intracellular networks that control and modulate the immune, O&NS and neuroprogressive pathways using omics-based assays, including genomics, transcriptomics, proteomics, metabolomics, epigenomics, immunoproteomics and metagenomics. Secondly, systems biomedicine analyses are essential to unravel the complex interactions between these cellular networks, pathways, and the multifactorial trigger factors and to delineate new drug targets in the cellular networks or pathways. Drug discovery processes should delineate new drugs targeting the intracellular networks and immune-related pathways.

MinePath: Mining for Phenotype Differential Sub-paths in Molecular Pathways.

PubMed

Koumakis, Lefteris; Kanterakis, Alexandros; Kartsaki, Evgenia; Chatzimina, Maria; Zervakis, Michalis; Tsiknakis, Manolis; Vassou, Despoina; Kafetzopoulos, Dimitris; Marias, Kostas; Moustakis, Vassilis; Potamias, George

2016-11-01

Pathway analysis methodologies couple traditional gene expression analysis with knowledge encoded in established molecular pathway networks, offering a promising approach towards the biological interpretation of phenotype differentiating genes. Early pathway analysis methodologies, named as gene set analysis (GSA), view pathways just as plain lists of genes without taking into account either the underlying pathway network topology or the involved gene regulatory relations. These approaches, even if they achieve computational efficiency and simplicity, consider pathways that involve the same genes as equivalent in terms of their gene enrichment characteristics. Most recent pathway analysis approaches take into account the underlying gene regulatory relations by examining their consistency with gene expression profiles and computing a score for each profile. Even with this approach, assessing and scoring single-relations limits the ability to reveal key gene regulation mechanisms hidden in longer pathway sub-paths. We introduce MinePath, a pathway analysis methodology that addresses and overcomes the aforementioned problems. MinePath facilitates the decomposition of pathways into their constituent sub-paths. Decomposition leads to the transformation of single-relations to complex regulation sub-paths. Regulation sub-paths are then matched with gene expression sample profiles in order to evaluate their functional status and to assess phenotype differential power. Assessment of differential power supports the identification of the most discriminant profiles. In addition, MinePath assess the significance of the pathways as a whole, ranking them by their p-values. Comparison results with state-of-the-art pathway analysis systems are indicative for the soundness and reliability of the MinePath approach. In contrast with many pathway analysis tools, MinePath is a web-based system (www.minepath.org) offering dynamic and rich pathway visualization functionality, with the unique characteristic to color regulatory relations between genes and reveal their phenotype inclination. This unique characteristic makes MinePath a valuable tool for in silico molecular biology experimentation as it serves the biomedical researchers' exploratory needs to reveal and interpret the regulatory mechanisms that underlie and putatively govern the expression of target phenotypes.

The Lateral Tracking Control for the Intelligent Vehicle Based on Adaptive PID Neural Network.

PubMed

Han, Gaining; Fu, Weiping; Wang, Wen; Wu, Zongsheng

2017-05-30

The intelligent vehicle is a complicated nonlinear system, and the design of a path tracking controller is one of the key technologies in intelligent vehicle research. This paper mainly designs a lateral control dynamic model of the intelligent vehicle, which is used for lateral tracking control. Firstly, the vehicle dynamics model (i.e., transfer function) is established according to the vehicle parameters. Secondly, according to the vehicle steering control system and the CARMA (Controlled Auto-Regression and Moving-Average) model, a second-order control system model is built. Using forgetting factor recursive least square estimation (FFRLS), the system parameters are identified. Finally, a neural network PID (Proportion Integral Derivative) controller is established for lateral path tracking control based on the vehicle model and the steering system model. Experimental simulation results show that the proposed model and algorithm have the high real-time and robustness in path tracing control. This provides a certain theoretical basis for intelligent vehicle autonomous navigation tracking control, and lays the foundation for the vertical and lateral coupling control.

The Lateral Tracking Control for the Intelligent Vehicle Based on Adaptive PID Neural Network

PubMed Central

Han, Gaining; Fu, Weiping; Wang, Wen; Wu, Zongsheng

2017-01-01

The intelligent vehicle is a complicated nonlinear system, and the design of a path tracking controller is one of the key technologies in intelligent vehicle research. This paper mainly designs a lateral control dynamic model of the intelligent vehicle, which is used for lateral tracking control. Firstly, the vehicle dynamics model (i.e., transfer function) is established according to the vehicle parameters. Secondly, according to the vehicle steering control system and the CARMA (Controlled Auto-Regression and Moving-Average) model, a second-order control system model is built. Using forgetting factor recursive least square estimation (FFRLS), the system parameters are identified. Finally, a neural network PID (Proportion Integral Derivative) controller is established for lateral path tracking control based on the vehicle model and the steering system model. Experimental simulation results show that the proposed model and algorithm have the high real-time and robustness in path tracing control. This provides a certain theoretical basis for intelligent vehicle autonomous navigation tracking control, and lays the foundation for the vertical and lateral coupling control. PMID:28556817

The Integrated Marine Postdoc Network: Support for postdoctoral researchers in marine sciences in Kiel, Germany

NASA Astrophysics Data System (ADS)

Braker, Gesche; Schelten, Christiane K.

2016-04-01

Despite the important role postdoctoral researchers play in the German academic system their status is largely undefined: Being challenged by a multitude of tasks, their employment situation is often characterized by short term contracts and a well-defined and articulated academic career path is lacking. Moreover, their employment situation becomes increasingly insecure as the time post Ph.D. increases unless they manage to shift into a tenured professorship or into similar opportunities in the non-academic employment sector. All this results in insecurity in terms of career perspectives. The support of postdoctoral researchers through the 'Integrated Marine Postdoc Network (IMAP)' has been identified as one of the strategic goals of the Cluster of Excellence 'The Future Ocean' in Kiel, Germany, a large collaborative research project funded through the German Excellence Initiative. To improve the situation of researchers post Ph.D., IMAP has identified three main actions: Building a vibrant community of postdoctoral researchers, engaging in a strategic dialogue on structural changes within the academic system in Germany with special emphasis on more predictable career paths below the professorship level and enhancing the competitiveness of postdoctoral researchers in marine sciences in Kiel through tailored schemes for career support. Since 2012 IMAP has developed into a vibrant network of researchers post Ph.D. who engage in the diverse disciplines of marine sciences in Kiel - in natural, social and medical sciences, computing, economics, and law. With currently more than 90 members working at one of the partner institutions of the Cluster in Kiel - Kiel University, GEOMAR Helmholtz Centre for Ocean Research, and the Institute for the World Economy the network hosts broad scientific expertise in integrated ocean research. It is professionally coordinated and operates at the interface between the partner institutions and large scale collaborative research projects, e.g. the SFB 754 'Climate-biogeochemical interactions in the tropical ocean' in Kiel, to provide a structure for complementary support of researchers post Ph.D. (This contribution is linked to the presentation by Dr. Christiane K. Schelten.)

Effects of social networks on physical health among people with serious mental illness.

PubMed

Lee, Sungkyu; Wong, Yin-Ling Irene; Rothbard, Aileen

2014-12-01

This study examined the effects of social network characteristics on physical health among people with serious mental illness using social transactions that are reciprocal, and the combination of objective and subjective health measures. The sample consisted of a probability sample of 231 adults with serious mental illness who resided in permanent supportive housing in Philadelphia, Pennsylvania. Path analyses were conducted to examine the relationships between social network characteristics and two aspects of medical comorbidity, objective health and subjective health. Bivariate statistics showed that individuals with medical comorbidity were more likely to have contact with their network members and had a higher level of reciprocal positive tangible support when compared to those who did not have medical comorbidity. The results of the path analyses revealed that none of the social network characteristics were associated with better physical health. The lack of a significant relationship between social networks and better physical health is contrary to prior research findings. However, this is the first study to include both types of social transactions simultaneously as predictors of better physical health for individuals with serious mental illness. A longitudinal study would provide more insight into the temporal relationship of social networks and physical health conditions of people with serious mental illness. Furthermore, the transactional nature of social relationships, particularly for those with mental health issues, requires greater exploration.

The dynamic evolution of social ties and user-generated content: a case study on a Douban group

NASA Astrophysics Data System (ADS)

Shan, Siqing; Ren, Jie; Li, Cangyan

2017-11-01

As platforms based on user-generated content (UGC), social media platforms emphasise the social ties between users and user participation, which promote the communication and propagation of ideas and help to build and maintain relationships. However, many researchers have studied only predefined social networks, such as academic social networks. We believe that there are certain characteristics associated with the network's UGC worth evaluating. We conducted research in communities in which content attracts discussion and new members and examined the evolution patterns of social and content networks in a topic-oriented Douban group. Datasets of user and content information in communities of interest were collected through web crawler software. Networks based on social and content ties were constructed and analysed. We chose scale, density, centrality, average path length and cluster coefficient as measures for exploring the evolution and correlation of both types of networks. These findings are valuable for social media marketing and helpful in directing and controlling public opinion.

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

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

Neil, Joshua Charles; Fisk, Michael Edward; Brugh, Alexander William

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 anomalousmore » behavior. Data collected by a Unified Host Collection Agent ("UHCA") may also be used to detect anomalous behavior.« less

cPath: open source software for collecting, storing, and querying biological pathways

PubMed Central

Cerami, Ethan G; Bader, Gary D; Gross, Benjamin E; Sander, Chris

2006-01-01

Background Biological pathways, including metabolic pathways, protein interaction networks, signal transduction pathways, and gene regulatory networks, are currently represented in over 220 diverse databases. These data are crucial for the study of specific biological processes, including human diseases. Standard exchange formats for pathway information, such as BioPAX, CellML, SBML and PSI-MI, enable convenient collection of this data for biological research, but mechanisms for common storage and communication are required. Results We have developed cPath, an open source database and web application for collecting, storing, and querying biological pathway data. cPath makes it easy to aggregate custom pathway data sets available in standard exchange formats from multiple databases, present pathway data to biologists via a customizable web interface, and export pathway data via a web service to third-party software, such as Cytoscape, for visualization and analysis. cPath is software only, and does not include new pathway information. Key features include: a built-in identifier mapping service for linking identical interactors and linking to external resources; built-in support for PSI-MI and BioPAX standard pathway exchange formats; a web service interface for searching and retrieving pathway data sets; and thorough documentation. The cPath software is freely available under the LGPL open source license for academic and commercial use. Conclusion cPath is a robust, scalable, modular, professional-grade software platform for collecting, storing, and querying biological pathways. It can serve as the core data handling component in information systems for pathway visualization, analysis and modeling. PMID:17101041

Quality of service routing in wireless ad hoc networks

NASA Astrophysics Data System (ADS)

Sane, Sachin J.; Patcha, Animesh; Mishra, Amitabh

2003-08-01

An efficient routing protocol is essential to guarantee application level quality of service running on wireless ad hoc networks. In this paper we propose a novel routing algorithm that computes a path between a source and a destination by considering several important constraints such as path-life, availability of sufficient energy as well as buffer space in each of the nodes on the path between the source and destination. The algorithm chooses the best path from among the multiples paths that it computes between two endpoints. We consider the use of control packets that run at a priority higher than the data packets in determining the multiple paths. The paper also examines the impact of different schedulers such as weighted fair queuing, and weighted random early detection among others in preserving the QoS level guarantees. Our extensive simulation results indicate that the algorithm improves the overall lifetime of a network, reduces the number of dropped packets, and decreases the end-to-end delay for real-time voice application.

Zero-Slack, Noncritical Paths

ERIC Educational Resources Information Center

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…

A mathematical model for adaptive transport network in path finding by true slime mold.

PubMed

Tero, Atsushi; Kobayashi, Ryo; Nakagaki, Toshiyuki

2007-02-21

We describe here a mathematical model of the adaptive dynamics of a transport network of the true slime mold Physarum polycephalum, an amoeboid organism that exhibits path-finding behavior in a maze. This organism possesses a network of tubular elements, by means of which nutrients and signals circulate through the plasmodium. When the organism is put in a maze, the network changes its shape to connect two exits by the shortest path. This process of path-finding is attributed to an underlying physiological mechanism: a tube thickens as the flux through it increases. The experimental evidence for this is, however, only qualitative. We constructed a mathematical model of the general form of the tube dynamics. Our model contains a key parameter corresponding to the extent of the feedback regulation between the thickness of a tube and the flux through it. We demonstrate the dependence of the behavior of the model on this parameter.

Path integration of head direction: updating a packet of neural activity at the correct speed using axonal conduction delays.

PubMed

Walters, Daniel; Stringer, Simon; Rolls, Edmund

2013-01-01

The head direction cell system is capable of accurately updating its current representation of head direction in the absence of visual input. This is known as the path integration of head direction. An important question is how the head direction cell system learns to perform accurate path integration of head direction. In this paper we propose a model of velocity path integration of head direction in which the natural time delay of axonal transmission between a linked continuous attractor network and competitive network acts as a timing mechanism to facilitate the correct speed of path integration. The model effectively learns a "look-up" table for the correct speed of path integration. In simulation, we show that the model is able to successfully learn two different speeds of path integration across two different axonal conduction delays, and without the need to alter any other model parameters. An implication of this model is that, by learning look-up tables for each speed of path integration, the model should exhibit a degree of robustness to damage. In simulations, we show that the speed of path integration is not significantly affected by degrading the network through removing a proportion of the cells that signal rotational velocity.

Path Integration of Head Direction: Updating a Packet of Neural Activity at the Correct Speed Using Axonal Conduction Delays

PubMed Central

Walters, Daniel; Stringer, Simon; Rolls, Edmund

2013-01-01

The head direction cell system is capable of accurately updating its current representation of head direction in the absence of visual input. This is known as the path integration of head direction. An important question is how the head direction cell system learns to perform accurate path integration of head direction. In this paper we propose a model of velocity path integration of head direction in which the natural time delay of axonal transmission between a linked continuous attractor network and competitive network acts as a timing mechanism to facilitate the correct speed of path integration. The model effectively learns a “look-up” table for the correct speed of path integration. In simulation, we show that the model is able to successfully learn two different speeds of path integration across two different axonal conduction delays, and without the need to alter any other model parameters. An implication of this model is that, by learning look-up tables for each speed of path integration, the model should exhibit a degree of robustness to damage. In simulations, we show that the speed of path integration is not significantly affected by degrading the network through removing a proportion of the cells that signal rotational velocity. PMID:23526976

Network Design for Reliability and Resilience to Attack

DTIC Science & Technology

2014-03-01

attacker can destroy n arcs in the network SPNI Shortest-Path Network-Interdiction problem TSP Traveling Salesman Problem UB upper bound UKR Ukraine...elimination from the traveling salesman problem (TSP). Literature calls a walk that does not contain a cycle a path [19]. The objective function in...arc lengths as random variables with known probability distributions. The m-median problem seeks to design a network with minimum average travel cost

DETERMINANTS OF NETWORK OUTCOMES: THE IMPACT OF MANAGEMENT STRATEGIES

PubMed Central

YSA, TAMYKO; SIERRA, VICENTA; ESTEVE, MARC

2014-01-01

The literature on network management is extensive. However, it generally explores network structures, neglecting the impact of management strategies. In this article we assess the effect of management strategies on network outcomes, providing empirical evidence from 119 urban revitalization networks. We go beyond current work by testing a path model for the determinants of network outcomes and considering the interactions between the constructs: management strategies, trust, complexity, and facilitative leadership. Our results suggest that management strategies have a strong effect on network outcomes and that they enhance the level of trust. We also found that facilitative leadership has a positive impact on network management as well as on trust in the network. Our findings also show that complexity has a negative impact on trust. A key finding of our research is that managers may wield more influence on network dynamics than previously theorized. PMID:25520529

DETERMINANTS OF NETWORK OUTCOMES: THE IMPACT OF MANAGEMENT STRATEGIES.

PubMed

Ysa, Tamyko; Sierra, Vicenta; Esteve, Marc

2014-09-01

The literature on network management is extensive. However, it generally explores network structures, neglecting the impact of management strategies. In this article we assess the effect of management strategies on network outcomes, providing empirical evidence from 119 urban revitalization networks. We go beyond current work by testing a path model for the determinants of network outcomes and considering the interactions between the constructs: management strategies, trust, complexity, and facilitative leadership. Our results suggest that management strategies have a strong effect on network outcomes and that they enhance the level of trust. We also found that facilitative leadership has a positive impact on network management as well as on trust in the network. Our findings also show that complexity has a negative impact on trust. A key finding of our research is that managers may wield more influence on network dynamics than previously theorized.

Bayesian Networks in Educational Assessment

PubMed Central

Culbertson, Michael J.

2015-01-01

Bayesian networks (BN) provide a convenient and intuitive framework for specifying complex joint probability distributions and are thus well suited for modeling content domains of educational assessments at a diagnostic level. BN have been used extensively in the artificial intelligence community as student models for intelligent tutoring systems (ITS) but have received less attention among psychometricians. This critical review outlines the existing research on BN in educational assessment, providing an introduction to the ITS literature for the psychometric community, and points out several promising research paths. The online appendix lists 40 assessment systems that serve as empirical examples of the use of BN for educational assessment in a variety of domains. PMID:29881033

Extinction Dynamics and Control in Adaptive Networks

NASA Astrophysics Data System (ADS)

Schwartz, Ira; Shaw, Leah; Hindes, Jason

Disease control is of paramount importance in public health. Moreover, models of disease spread are an important component in implementing effective vaccination and treatment campaigns. However, human behavior in response to an outbreak has only recently been included in epidemic models on networks. Here we develop the mathematical machinery to describe the dynamics of extinction in finite populations that include human adaptive behavior. The formalism enables us to compute the optimal, fluctuation-induced path to extinction, and predict the average extinction time in adaptive networks as a function of the adaptation rate. We find that both observables have several unique scalings depending on the relative speed of infection and adaptivity. Finally, we discuss how the theory can be used to design optimal control programs in general networks, by coupling the effective force of noise with treatment and human behavior. Research supported by U.S. Naval Research Laboratory funding (Grant No. N0001414WX00023) and the Office of Naval Research (Grant No. N0001414WX20610).

Simulation and modeling of the temporal performance of path-based restoration schemes in planar mesh networks

NASA Astrophysics Data System (ADS)

Bhardwaj, Manish; McCaughan, Leon; Olkhovets, Anatoli; Korotky, Steven K.

2006-12-01

We formulate an analytic framework for the restoration performance of path-based restoration schemes in planar mesh networks. We analyze various switch architectures and signaling schemes and model their total restoration interval. We also evaluate the network global expectation value of the time to restore a demand as a function of network parameters. We analyze a wide range of nominally capacity-optimal planar mesh networks and find our analytic model to be in good agreement with numerical simulation data.

How to train your microbe: methods for dynamically characterizing gene networks

PubMed Central

Castillo-Hair, Sebastian M.; Igoshin, Oleg A.; Tabor, Jeffrey J.

2015-01-01

Gene networks regulate biological processes dynamically. However, researchers have largely relied upon static perturbations, such as growth media variations and gene knockouts, to elucidate gene network structure and function. Thus, much of the regulation on the path from DNA to phenotype remains poorly understood. Recent studies have utilized improved genetic tools, hardware, and computational control strategies to generate precise temporal perturbations outside and inside of live cells. These experiments have, in turn, provided new insights into the organizing principles of biology. Here, we introduce the major classes of dynamical perturbations that can be used to study gene networks, and discuss technologies available for creating them in a wide range of microbial pathways. PMID:25677419

Assessing the weather monitoring capabilities of cellular microwave link networks

NASA Astrophysics Data System (ADS)

Fencl, Martin; Vrzba, Miroslav; Rieckermann, Jörg; Bareš, Vojtěch

2016-04-01

Using of microwave links for rainfall monitoring was suggested already by (Atlas and Ulbrich, 1977). However, this technique attracted broader attention of scientific community only in the recent decade, with the extensive growth of cellular microwave link (CML) networks, which form the backbone of today's cellular telecommunication infrastructure. Several studies have already shown that CMLs can be conveniently used as weather sensors and have potential to provide near-ground path-integrated observations of rainfall but also humidity or fog. However, although research is still focusing on algorithms to improve the weather sensing capabilities (Fencl et al., 2015), it is not clear how to convince cellular operators to provide the power levels of their network. One step in this direction is to show in which regions or municipalities the networks are sufficiently dense to provide/develop good services. In this contribution we suggest a standardized approach to evaluate CML networks in terms of rainfall observation and to identify suitable regions for CML rainfall monitoring. We estimate precision of single CML based on its sensitivity to rainfall, i.e. as a function of frequency, polarization and path length. Capability of a network to capture rainfall spatial patterns is estimated from the CML coverage and path lengths considering that single CML provides path-integrated rain rates. We also search for suitable predictors for regions where no network topologies are available. We test our approach on several European networks and discuss the results. Our results show that CMLs are very dense in urban areas (> 1 CML/km2), but less in rural areas (< 0.02 CML/km2). We found a strong correlation between a population and CML network density (e.g. R2 = 0.97 in Czech Republic), thus population could be a simple proxy to identify suitable regions for CML weather monitoring. To enable a simple and efficient assessment of the CML monitoring potential for any region worldwide, we are currently integrating our approach into open source online tool. In summary, our results demonstrate that CML represent promising environmental observation network, suitable especially for urban rainfall monitoring. The developed approach integrated into an open source online tool can be conveniently used e.g. by local operators or authorities to evaluate the suitability of their region for CML weather monitoring and estimate the credible spatial-resolution of a CML weather monitoring product. Atlas, D. and Ulbrich, C. W. (1977) Path- and Area-Integrated Rainfall Measurement by Microwave Attenuation in the 1-3 cm Band. Journal of Applied Meteorology, 16(12), 1322-1331. Fencl, M., Rieckermann, J., Sýkora, P., Stránský, D., and Bareš, V. (2015) Commercial microwave links instead of rain gauges: fiction or reality? Water Science & Technology, 71(1), 31. Acknowledgements to Czech Science Foundation project No. 14-22978S and Czech Technical University in Prague project No. SGS15/050/OHK1/1T/11.

Network and Information Sciences (NIS) International Technology Alliance (ITA)

DTIC Science & Technology

2016-05-01

unpredictable, insights often unexpected, and innovation paths are diverse. On the one hand a laissez - faire and unconstrained management approach would...138 References . ..... ...... . . ... . . .. .. . . ..... . ....... . ... .. . 139 A NIS ITA Leadership ........... . . .. .. . . . . ..... . .. 141...ten-year programme, covering a range of perspectives of the work and the results achieved by the integrated technical leadership and wide research

Integration of an Intelligent Tutoring System in a Course of Computer Network Design

ERIC Educational Resources Information Center

Verdú, Elena; Regueras, Luisa M.; Gal, Eran; de Castro, Juan P.; Verdú, María J.; Kohen-Vacs, Dan

2017-01-01

INTUITEL is a research project aiming to offer a personalized learning environment. The INTUITEL approach includes an Intelligent Tutoring System that gives students recommendations and feedback about what the best learning path is for them according to their profile, learning progress, context and environmental influences. INTUITEL combines…

In-Space Networking On NASA's SCaN Testbed

NASA Technical Reports Server (NTRS)

Brooks, David; Eddy, Wesley M.; Clark, Gilbert J., III; Johnson, Sandra K.

2016-01-01

The NASA Space Communications and Navigation (SCaN) Testbed, an external payload onboard the International Space Station, is equipped with three software defined radios (SDRs) and a programmable flight computer. The purpose of the Testbed is to conduct inspace research in the areas of communication, navigation, and networking in support of NASA missions and communication infrastructure. Multiple reprogrammable elements in the end to end system, along with several communication paths and a semi-operational environment, provides a unique opportunity to explore networking concepts and protocols envisioned for the future Solar System Internet (SSI). This paper will provide a general description of the system's design and the networking protocols implemented and characterized on the testbed, including Encapsulation, IP over CCSDS, and Delay-Tolerant Networking (DTN). Due to the research nature of the implementation, flexibility and robustness are considered in the design to enable expansion for future adaptive and cognitive techniques. Following a detailed design discussion, lessons learned and suggestions for future missions and communication infrastructure elements will be provided. Plans for the evolving research on SCaN Testbed as it moves towards a more adaptive, autonomous system will be discussed.

Research on Taxiway Path Optimization Based on Conflict Detection

PubMed Central

Zhou, Hang; Jiang, Xinxin

2015-01-01

Taxiway path planning is one of the effective measures to make full use of the airport resources, and the optimized paths can ensure the safety of the aircraft during the sliding process. In this paper, the taxiway path planning based on conflict detection is considered. Specific steps are shown as follows: firstly, make an improvement on A * algorithm, the conflict detection strategy is added to search for the shortest and safe path in the static taxiway network. Then, according to the sliding speed of aircraft, a time table for each node is determined and the safety interval is treated as the constraint to judge whether there is a conflict or not. The intelligent initial path planning model is established based on the results. Finally, make an example in an airport simulation environment, detect and relieve the conflict to ensure the safety. The results indicate that the model established in this paper is effective and feasible. Meanwhile, make comparison with the improved A*algorithm and other intelligent algorithms, conclude that the improved A*algorithm has great advantages. It could not only optimize taxiway path, but also ensure the safety of the sliding process and improve the operational efficiency. PMID:26226485

Research on Taxiway Path Optimization Based on Conflict Detection.

PubMed

Zhou, Hang; Jiang, Xinxin

2015-01-01

Taxiway path planning is one of the effective measures to make full use of the airport resources, and the optimized paths can ensure the safety of the aircraft during the sliding process. In this paper, the taxiway path planning based on conflict detection is considered. Specific steps are shown as follows: firstly, make an improvement on A * algorithm, the conflict detection strategy is added to search for the shortest and safe path in the static taxiway network. Then, according to the sliding speed of aircraft, a time table for each node is determined and the safety interval is treated as the constraint to judge whether there is a conflict or not. The intelligent initial path planning model is established based on the results. Finally, make an example in an airport simulation environment, detect and relieve the conflict to ensure the safety. The results indicate that the model established in this paper is effective and feasible. Meanwhile, make comparison with the improved A*algorithm and other intelligent algorithms, conclude that the improved A*algorithm has great advantages. It could not only optimize taxiway path, but also ensure the safety of the sliding process and improve the operational efficiency.

Time signal distribution in communication networks based on synchronous digital hierarchy

NASA Technical Reports Server (NTRS)

Imaoka, Atsushi; Kihara, Masami

1993-01-01

A new method that uses round-trip paths to accurately measure transmission delay for time synchronization is proposed. The performance of the method in Synchronous Digital Hierarchy networks is discussed. The feature of this method is that it separately measures the initial round trip path delay and the variations in round-trip path delay. The delay generated in SDH equipment is determined by measuring the initial round-trip path delay. In an experiment with actual SDH equipment, the error of initial delay measurement was suppressed to 30ns.

Findings from an Organizational Network Analysis to Support Local Public Health Management

PubMed Central

Caldwell, Michael; Rockoff, Maxine L.; Gebbie, Kristine; Carley, Kathleen M.; Bakken, Suzanne

2008-01-01

We assessed the feasibility of using organizational network analysis in a local public health organization. The research setting was an urban/suburban county health department with 156 employees. The goal of the research was to study communication and information flow in the department and to assess the technique for public health management. Network data were derived from survey questionnaires. Computational analysis was performed with the Organizational Risk Analyzer. Analysis revealed centralized communication, limited interdependencies, potential knowledge loss through retirement, and possible informational silos. The findings suggested opportunities for more cross program coordination but also suggested the presences of potentially efficient communication paths and potentially beneficial social connectedness. Managers found the findings useful to support decision making. Public health organizations must be effective in an increasingly complex environment. Network analysis can help build public health capacity for complex system management. PMID:18481183

A Survey on Multimedia-Based Cross-Layer Optimization in Visual Sensor Networks

PubMed Central

Costa, Daniel G.; Guedes, Luiz Affonso

2011-01-01

Visual sensor networks (VSNs) comprised of battery-operated electronic devices endowed with low-resolution cameras have expanded the applicability of a series of monitoring applications. Those types of sensors are interconnected by ad hoc error-prone wireless links, imposing stringent restrictions on available bandwidth, end-to-end delay and packet error rates. In such context, multimedia coding is required for data compression and error-resilience, also ensuring energy preservation over the path(s) toward the sink and improving the end-to-end perceptual quality of the received media. Cross-layer optimization may enhance the expected efficiency of VSNs applications, disrupting the conventional information flow of the protocol layers. When the inner characteristics of the multimedia coding techniques are exploited by cross-layer protocols and architectures, higher efficiency may be obtained in visual sensor networks. This paper surveys recent research on multimedia-based cross-layer optimization, presenting the proposed strategies and mechanisms for transmission rate adjustment, congestion control, multipath selection, energy preservation and error recovery. We note that many multimedia-based cross-layer optimization solutions have been proposed in recent years, each one bringing a wealth of contributions to visual sensor networks. PMID:22163908

Hopfield networks for solving Tower of Hanoi problems

NASA Astrophysics Data System (ADS)

Kaplan, G. B.; Güzeliş, Cüneyt

2001-08-01

In this paper, Hopfield neural networks have been considered in solving the Tower of Hanoi test which is used in the determining of deficit of planning capability of the human prefrontal cortex. The main difference between this paper and the ones in the literature which use neural networks is that the Tower of Hanoi problem has been formulated here as a special shortest-path problem. In the literature, some Hopfield networks are developed for solving the shortest path problem which is a combinatorial optimization problem having a diverse field of application. The approach given in this paper gives the possibility of solving the Tower of Hanoi problem using these Hopfield networks. Also, the paper proposes new Hopfield network models for the shortest path and hence the Tower of Hanoi problems and compares them to the available ones in terms of the memory and time (number of steps) needed in the simulations.

pathChirp: Efficient Available Bandwidth Estimation for Network Paths

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

Cottrell, Les

2003-04-30

This paper presents pathChirp, a new active probing tool for estimating the available bandwidth on a communication network path. Based on the concept of ''self-induced congestion,'' pathChirp features an exponential flight pattern of probes we call a chirp. Packet chips offer several significant advantages over current probing schemes based on packet pairs or packet trains. By rapidly increasing the probing rate within each chirp, pathChirp obtains a rich set of information from which to dynamically estimate the available bandwidth. Since it uses only packet interarrival times for estimation, pathChirp does not require synchronous nor highly stable clocks at the sendermore » and receiver. We test pathChirp with simulations and Internet experiments and find that it provides good estimates of the available bandwidth while using only a fraction of the number of probe bytes that current state-of-the-art techniques use.« less

Selection of test paths for solder joint intermittent connection faults under DC stimulus

NASA Astrophysics Data System (ADS)

Huakang, Li; Kehong, Lv; Jing, Qiu; Guanjun, Liu; Bailiang, Chen

2018-06-01

The test path of solder joint intermittent connection faults under direct-current stimulus is examined in this paper. According to the physical structure of the circuit, a network model is established first. A network node is utilised to represent the test node. The path edge refers to the number of intermittent connection faults in the path. Then, the selection criteria of the test path based on the node degree index are proposed and the solder joint intermittent connection faults are covered using fewer test paths. Finally, three circuits are selected to verify the method. To test if the intermittent fault is covered by the test paths, the intermittent fault is simulated by a switch. The results show that the proposed method can detect the solder joint intermittent connection fault using fewer test paths. Additionally, the number of detection steps is greatly reduced without compromising fault coverage.

VORBrouter: A dynamic data routing system for Real-Time Seismic networks

NASA Astrophysics Data System (ADS)

Hansen, T.; Vernon, F.; Lindquist, K.; Orcutt, J.

2004-12-01

For anyone who has managed a moderately complex buffered real-time data transport system, the need for reliable adaptive data transport is clear. The ROADNet VORBrouter system, an extension to the ROADNet data catalog system [AGU-2003, Dynamic Dataflow Topology Monitoring for Real-time Seismic Networks], allows dynamic routing of real-time seismic data from sensor to end-user. Traditional networks consist of a series of data buffer computers with data transport interconnections configured by hand. This allows for arbitrarily complex data networks, which can often exceed full comprehension by network administrators, sometimes resulting in data loops or accidental data cutoff. In order to manage data transport systems in the event of a network failure, a network administrator must be called upon to change the data transport paths and to recover the missing data. Using VORBrouter, administrators can sleep at night while still providing 7/24 uninterupted data streams at realistic cost. This software package uses information from the ROADNet data catalog system to route packets around failed link outages and to new consumers in real-time. Dynamic data routing protocols operating on top of the Antelope Data buffering layer allow authorized users to request data sets from their local buffer and to have them delivered from anywhere within the network of buffers. The VORBrouter software also allows for dynamic routing around network outages, and the elimination of duplicate data paths within the network, while maintaining the nearly lossless data transport features exhibited by the underlying Antelope system. We present the design of the VORBrouter system, its features, limitations and some future research directions.

Calculating Least Risk Paths in 3d Indoor Space

NASA Astrophysics Data System (ADS)

Vanclooster, A.; De Maeyer, Ph.; Fack, V.; Van de Weghe, N.

2013-08-01

Over the last couple of years, research on indoor environments has gained a fresh impetus; more specifically applications that support navigation and wayfinding have become one of the booming industries. Indoor navigation research currently covers the technological aspect of indoor positioning and the modelling of indoor space. The algorithmic development to support navigation has so far been left mostly untouched, as most applications mainly rely on adapting Dijkstra's shortest path algorithm to an indoor network. However, alternative algorithms for outdoor navigation have been proposed adding a more cognitive notion to the calculated paths and as such adhering to the natural wayfinding behaviour (e.g. simplest paths, least risk paths). These algorithms are currently restricted to outdoor applications. The need for indoor cognitive algorithms is highlighted by a more challenged navigation and orientation due to the specific indoor structure (e.g. fragmentation, less visibility, confined areas…). As such, the clarity and easiness of route instructions is of paramount importance when distributing indoor routes. A shortest or fastest path indoors not necessarily aligns with the cognitive mapping of the building. Therefore, the aim of this research is to extend those richer cognitive algorithms to three-dimensional indoor environments. More specifically for this paper, we will focus on the application of the least risk path algorithm of Grum (2005) to an indoor space. The algorithm as proposed by Grum (2005) is duplicated and tested in a complex multi-storey building. The results of several least risk path calculations are compared to the shortest paths in indoor environments in terms of total length, improvement in route description complexity and number of turns. Several scenarios are tested in this comparison: paths covering a single floor, paths crossing several building wings and/or floors. Adjustments to the algorithm are proposed to be more aligned to the specific structure of indoor environments (e.g. no turn restrictions, restricted usage of rooms, vertical movement) and common wayfinding strategies indoors. In a later stage, other cognitive algorithms will be implemented and tested in both an indoor and combined indoor-outdoor setting, in an effort to improve the overall user experience during navigation in indoor environments.

On Channel-Discontinuity-Constraint Routing in Wireless Networks☆

PubMed Central

Sankararaman, Swaminathan; Efrat, Alon; Ramasubramanian, Srinivasan; Agarwal, Pankaj K.

2011-01-01

Multi-channel wireless networks are increasingly deployed as infrastructure networks, e.g. in metro areas. Network nodes frequently employ directional antennas to improve spatial throughput. In such networks, between two nodes, it is of interest to compute a path with a channel assignment for the links such that the path and link bandwidths are the same. This is achieved when any two consecutive links are assigned different channels, termed as “Channel-Discontinuity-Constraint” (CDC). CDC-paths are also useful in TDMA systems, where, preferably, consecutive links are assigned different time-slots. In the first part of this paper, we develop a t-spanner for CDC-paths using spatial properties; a sub-network containing O(n/θ) links, for any θ > 0, such that CDC-paths increase in cost by at most a factor t = (1−2 sin (θ/2))−2. We propose a novel distributed algorithm to compute the spanner using an expected number of O(n log n) fixed-size messages. In the second part, we present a distributed algorithm to find minimum-cost CDC-paths between two nodes using O(n2) fixed-size messages, by developing an extension of Edmonds’ algorithm for minimum-cost perfect matching. In a centralized implementation, our algorithm runs in O(n2) time improving the previous best algorithm which requires O(n3) running time. Moreover, this running time improves to O(n/θ) when used in conjunction with the spanner developed. PMID:24443646

Research on Some Bus Transport Networks with Random Overlapping Clique Structure

NASA Astrophysics Data System (ADS)

Yang, Xu-Hua; Wang, Bo; Wang, Wan-Liang; Sun, You-Xian

2008-11-01

On the basis of investigating the statistical data of bus transport networks of three big cities in China, we propose that each bus route is a clique (maximal complete subgraph) and a bus transport network (BTN) consists of a lot of cliques, which intensively connect and overlap with each other. We study the network properties, which include the degree distribution, multiple edges' overlapping time distribution, distribution of the overlap size between any two overlapping cliques, distribution of the number of cliques that a node belongs to. Naturally, the cliques also constitute a network, with the overlapping nodes being their multiple links. We also research its network properties such as degree distribution, clustering, average path length, and so on. We propose that a BTN has the properties of random clique increment and random overlapping clique, at the same time, a BTN is a small-world network with highly clique-clustered and highly clique-overlapped. Finally, we introduce a BTN evolution model, whose simulation results agree well with the statistical laws that emerge in real BTNs.

Study on Data Clustering and Intelligent Decision Algorithm of Indoor Localization

NASA Astrophysics Data System (ADS)

Liu, Zexi

2018-01-01

Indoor positioning technology enables the human beings to have the ability of positional perception in architectural space, and there is a shortage of single network coverage and the problem of location data redundancy. So this article puts forward the indoor positioning data clustering algorithm and intelligent decision-making research, design the basic ideas of multi-source indoor positioning technology, analyzes the fingerprint localization algorithm based on distance measurement, position and orientation of inertial device integration. By optimizing the clustering processing of massive indoor location data, the data normalization pretreatment, multi-dimensional controllable clustering center and multi-factor clustering are realized, and the redundancy of locating data is reduced. In addition, the path is proposed based on neural network inference and decision, design the sparse data input layer, the dynamic feedback hidden layer and output layer, low dimensional results improve the intelligent navigation path planning.

Chain-Based Communication in Cylindrical Underwater Wireless Sensor Networks

PubMed Central

Javaid, Nadeem; Jafri, Mohsin Raza; Khan, Zahoor Ali; Alrajeh, Nabil; Imran, Muhammad; Vasilakos, Athanasios

2015-01-01

Appropriate network design is very significant for Underwater Wireless Sensor Networks (UWSNs). Application-oriented UWSNs are planned to achieve certain objectives. Therefore, there is always a demand for efficient data routing schemes, which can fulfill certain requirements of application-oriented UWSNs. These networks can be of any shape, i.e., rectangular, cylindrical or square. In this paper, we propose chain-based routing schemes for application-oriented cylindrical networks and also formulate mathematical models to find a global optimum path for data transmission. In the first scheme, we devise four interconnected chains of sensor nodes to perform data communication. In the second scheme, we propose routing scheme in which two chains of sensor nodes are interconnected, whereas in third scheme single-chain based routing is done in cylindrical networks. After finding local optimum paths in separate chains, we find global optimum paths through their interconnection. Moreover, we develop a computational model for the analysis of end-to-end delay. We compare the performance of the above three proposed schemes with that of Power Efficient Gathering System in Sensor Information Systems (PEGASIS) and Congestion adjusted PEGASIS (C-PEGASIS). Simulation results show that our proposed 4-chain based scheme performs better than the other selected schemes in terms of network lifetime, end-to-end delay, path loss, transmission loss, and packet sending rate. PMID:25658394

Toward Intelligent Autonomous Agents for Cyber Defense: Report of the 2017 Workshop by the North Atlantic Treaty Organization (NATO) Research Group IST-152 RTG

DTIC Science & Technology

2018-04-18

Significant research is currently conducted on dynamic learning and threat detection. However, this work is held back by gaps in validation methods ...and network path rotation (e.g., Stream Splitting MTD). Agents can also employ various cyber-deception methods , including direct observation hiding...ARL-SR-0395 ● APR 2018 US Army Research Laboratory Toward Intelligent Autonomous Agents for Cyber Defense: Report of the 2017

Toward Intelligent Autonomous Agents for Cyber Defense: Report of the 2017 Workshop by the North Atlantic Treaty Organization (NATO) Research Group IST-152-RTG

DTIC Science & Technology

2018-04-01

Significant research is currently conducted on dynamic learning and threat detection. However, this work is held back by gaps in validation methods ...and network path rotation (e.g., Stream Splitting MTD). Agents can also employ various cyber-deception methods , including direct observation hiding...ARL-SR-0395 ● APR 2018 US Army Research Laboratory Toward Intelligent Autonomous Agents for Cyber Defense: Report of the 2017

All-Optical Wavelength-Path Service With Quality Assurance by Multilayer Integration System

NASA Astrophysics Data System (ADS)

Yagi, Mikio; Tanaka, Shinya; Satomi, Shuichi; Ryu, Shiro; Asano, Shoichiro

2006-09-01

In the future all-optical network controlled by generalized multiprotocol label switching (GMPLS), the wavelength path between end nodes will change dynamically. This inevitably means that the fiber parameters along the wavelength path will also vary. This variation in fiber parameters influences the signal quality of high-speed-transmission system (bit rates over 40 Gb/s). Therefore, at a path setup, the fiber-parameter effect should be adequately compensated. Moreover, the path setup must be completed fast enough to meet the network-application demands. To realize the rapid setup of adequate paths, a multilayer integration system for all-optical wavelength-path quality assurance is proposed. This multilayer integration system is evaluated in a field trial. In the trial, the GMPLS control plane, measurement plane, and data plane coordinated to maintain the quality of a 40-Gb/s wavelength path that would otherwise be degraded by the influence of chromatic dispersion. It is also demonstrated that the multilayer integration system can assure the signal quality in the face of not only chromatic dispersion but also degradation in the optical signal-to-noise ratio by the use of a 2R regeneration system. Our experiments confirm that the proposed multilayer integration system is an essential part of future all-optical networks.

Visualizing Transmedia Networks: Links, Paths and Peripheries

ERIC Educational Resources Information Center

Ruppel, Marc Nathaniel

2012-01-01

'Visualizing Transmedia Networks: Links, Paths and Peripheries' examines the increasingly complex rhetorical intersections between narrative and media ("old" and "new") in the creation of transmedia fictions, loosely defined as multisensory and multimodal stories told extensively across a diverse media set. In order…

Networks of genetic loci and the scientific literature

NASA Astrophysics Data System (ADS)

Semeiks, J. R.; Grate, L. R.; Mian, I. S.

This work considers biological information graphs, networks in which nodes corre-spond to genetic loci (or "genes") and an (undirected) edge signifies that two genes are discussed in the same article(s) in the scientific literature ("documents"). Operations that utilize the topology of these graphs can assist researchers in the scientific discovery process. For example, a shortest path between two nodes defines an ordered series of genes and documents that can be used to explore the relationship(s) between genes of interest. This work (i) describes how topologies in which edges are likely to reflect genuine relationship(s) can be constructed from human-curated corpora of genes an-notated with documents (or vice versa), and (ii) illustrates the potential of biological information graphs in synthesizing knowledge in order to formulate new hypotheses and generate novel predictions for subsequent experimental study. In particular, the well-known LocusLink corpus is used to construct a biological information graph consisting of 10,297 nodes and 21,910 edges. The large-scale statistical properties of this gene-document network suggest that it is a new example of a power-law network. The segregation of genes on the basis of species and encoded protein molecular function indicate the presence of assortativity, the preference for nodes with similar attributes to be neighbors in a network. The practical utility of a gene-document network is illustrated by using measures such as shortest paths and centrality to analyze a subset of nodes corresponding to genes implicated in aging. Each release of a curated biomedical corpus defines a particular static graph. The topology of a gene-document network changes over time as curators add and/or remove nodes and/or edges. Such a dynamic, evolving corpus provides both the foundation for analyzing the growth and behavior of large complex networks and a substrate for examining trends in biological research.

Path integrals and large deviations in stochastic hybrid systems.

PubMed

Bressloff, Paul C; Newby, Jay M

2014-04-01

We construct a path-integral representation of solutions to a stochastic hybrid system, consisting of one or more continuous variables evolving according to a piecewise-deterministic dynamics. The differential equations for the continuous variables are coupled to a set of discrete variables that satisfy a continuous-time Markov process, which means that the differential equations are only valid between jumps in the discrete variables. Examples of stochastic hybrid systems arise in biophysical models of stochastic ion channels, motor-driven intracellular transport, gene networks, and stochastic neural networks. We use the path-integral representation to derive a large deviation action principle for a stochastic hybrid system. Minimizing the associated action functional with respect to the set of all trajectories emanating from a metastable state (assuming that such a minimization scheme exists) then determines the most probable paths of escape. Moreover, evaluating the action functional along a most probable path generates the so-called quasipotential used in the calculation of mean first passage times. We illustrate the theory by considering the optimal paths of escape from a metastable state in a bistable neural network.

Optimizing Retransmission Threshold in Wireless Sensor Networks

PubMed Central

Bi, Ran; Li, Yingshu; Tan, Guozhen; Sun, Liang

2016-01-01

The retransmission threshold in wireless sensor networks is critical to the latency of data delivery in the networks. However, existing works on data transmission in sensor networks did not consider the optimization of the retransmission threshold, and they simply set the same retransmission threshold for all sensor nodes in advance. The method did not take link quality and delay requirement into account, which decreases the probability of a packet passing its delivery path within a given deadline. This paper investigates the problem of finding optimal retransmission thresholds for relay nodes along a delivery path in a sensor network. The object of optimizing retransmission thresholds is to maximize the summation of the probability of the packet being successfully delivered to the next relay node or destination node in time. A dynamic programming-based distributed algorithm for finding optimal retransmission thresholds for relay nodes along a delivery path in the sensor network is proposed. The time complexity is OnΔ·max1≤i≤n{ui}, where ui is the given upper bound of the retransmission threshold of sensor node i in a given delivery path, n is the length of the delivery path and Δ is the given upper bound of the transmission delay of the delivery path. If Δ is greater than the polynomial, to reduce the time complexity, a linear programming-based (1+pmin)-approximation algorithm is proposed. Furthermore, when the ranges of the upper and lower bounds of retransmission thresholds are big enough, a Lagrange multiplier-based distributed O(1)-approximation algorithm with time complexity O(1) is proposed. Experimental results show that the proposed algorithms have better performance. PMID:27171092

A main path domain map as digital library interface

NASA Astrophysics Data System (ADS)

Demaine, Jeffrey

2009-01-01

The shift to electronic publishing of scientific journals is an opportunity for the digital library to provide non-traditional ways of accessing the literature. One method is to use citation metadata drawn from a collection of electronic journals to generate maps of science. These maps visualize the communication patterns in the collection, giving the user an easy-tograsp view of the semantic structure underlying the scientific literature. For this visualization to be understandable the complexity of the citation network must be reduced through an algorithm. This paper describes the Citation Pathfinder application and its integration into a prototype digital library. This application generates small-scale citation networks that expand upon the search results of the digital library. These domain maps are linked to the collection, creating an interface that is based on the communication patterns in science. The Main Path Analysis technique is employed to simplify these networks into linear, sequential structures. By identifying patterns that characterize the evolution of the research field, Citation Pathfinder uses citations to give users a deeper understanding of the scientific literature.

Scientific authorship and collaboration network analysis on malaria research in Benin: papers indexed in the web of science (1996-2016).

PubMed

Azondekon, Roseric; Harper, Zachary James; Agossa, Fiacre Rodrigue; Welzig, Charles Michael; McRoy, Susan

2018-01-01

To sustain the critical progress made, prioritization and a multidisciplinary approach to malaria research remain important to the national malaria control program in Benin. To document the structure of the malaria collaborative research in Benin, we analyze authorship of the scientific documents published on malaria from Benin. We collected bibliographic data from the Web Of Science on malaria research in Benin from January 1996 to December 2016. From the collected data, a mulitigraph co-authorship network with authors representing vertices was generated. An edge was drawn between two authors when they co-author a paper. We computed vertex degree, betweenness, closeness, and eigenvectors among others to identify prolific authors. We further assess the weak points and how information flow in the network. Finally, we perform a hierarchical clustering analysis, and Monte-Carlo simulations. Overall, 427 publications were included in this study. The generated network contained 1792 authors and 116,388 parallel edges which converted in a weighted graph of 1792 vertices and 95,787 edges. Our results suggested that prolific authors with higher degrees tend to collaborate more. The hierarchical clustering revealed 23 clusters, seven of which form a giant component containing 94% of all the vertices in the network. This giant component has all the characteristics of a small-world network with a small shortest path distance between pairs of three, a diameter of 10 and a high clustering coefficient of 0.964. However, Monte-Carlo simulations suggested our observed network is an unusual type of small-world network. Sixteen vertices were identified as weak articulation points within the network. The malaria research collaboration network in Benin is a complex network that seems to display the characteristics of a small-world network. This research reveals the presence of closed research groups where collaborative research likely happens only between members. Interdisciplinary collaboration tends to occur at higher levels between prolific researchers. Continuously supporting, stabilizing the identified key brokers and most productive authors in the Malaria research collaborative network is an urgent need in Benin. It will foster the malaria research network and ensure the promotion of junior scientists in the field.

Optical Circuit Switched Protocol

NASA Technical Reports Server (NTRS)

Monacos, Steve P. (Inventor)

2000-01-01

The present invention is a system and method embodied in an optical circuit switched protocol for the transmission of data through a network. The optical circuit switched protocol is an all-optical circuit switched network and includes novel optical switching nodes for transmitting optical data packets within a network. Each optical switching node comprises a detector for receiving the header, header detection logic for translating the header into routing information and eliminating the header, and a controller for receiving the routing information and configuring an all optical path within the node. The all optical path located within the node is solely an optical path without having electronic storage of the data and without having optical delay of the data. Since electronic storage of the header is not necessary and the initial header is eliminated by the first detector of the first switching node. multiple identical headers are sent throughout the network so that subsequent switching nodes can receive and read the header for setting up an optical data path.

[Material base on Chinese medical theory of 'Fei and Dachang being interior-exteriorly correlated'].

PubMed

Li, Jie; Cheng, Xin; Jia, Yu-Hua

2011-02-01

By reviewing pertinent literatures, we found that there existed some defects in studying material base on Chinese medical theory of "Fei and Dachang being interior-exteriorly related", such as the low efficacy of research methods; the neglect of intestinal and respiratory microhabitat and Chinese medical functional condition; and the unconformity of research design with evidence-based medicinal requirements. Thereby, the authors offered that the researches method of initiating merely from sole material or line linkage path should be rejected. The new research strategy should be established based on the feature of the lung and large intestine network connective structure, cutting-in from correlative changes in the two terminals (respiratory system and intestinal tissue), and the intermedial key knot of connection (blood serum), screen out in high throughput the relevant materials adopting microecological, proteomic and metabonomic techniques, and catch hold of the knots of network as much as possible. Based on these to perfect the researches on coordinating mechanism of the network, and to establish a new strategy for future researching.

Path finding methods accounting for stoichiometry in metabolic networks

PubMed Central

2011-01-01

Graph-based methods have been widely used for the analysis of biological networks. Their application to metabolic networks has been much discussed, in particular noting that an important weakness in such methods is that reaction stoichiometry is neglected. In this study, we show that reaction stoichiometry can be incorporated into path-finding approaches via mixed-integer linear programming. This major advance at the modeling level results in improved prediction of topological and functional properties in metabolic networks. PMID:21619601

Development of an integrated set of research facilities for the support of research flight test

NASA Technical Reports Server (NTRS)

Moore, Archie L.; Harney, Constance D.

1988-01-01

The Ames-Dryden Flight Research Facility (DFRF) serves as the site for high-risk flight research on many one-of-a-kind test vehicles like the X-29A advanced technology demonstrator, F-16 advanced fighter technology integration (AFTI), AFTI F-111 mission adaptive wing, and F-18 high-alpha research vehicle (HARV). Ames-Dryden is on a section of the historic Muroc Range. The facility is oriented toward the testing of high-performance aircraft, as shown by its part in the development of the X-series aircraft. Given the cost of research flight tests and the complexity of today's systems-driven aircraft, an integrated set of ground support experimental facilities is a necessity. In support of the research flight test of highly advanced test beds, the DFRF is developing a network of facilities to expedite the acquisition and distribution of flight research data to the researcher. The network consists of an array of experimental ground-based facilities and systems as nodes and the necessary telecommunications paths to pass research data and information between these facilities. This paper presents the status of the current network, an overview of current developments, and a prospectus on future major enhancements.

Optimization of OSPF Routing in IP Networks

NASA Astrophysics Data System (ADS)

Bley, Andreas; Fortz, Bernard; Gourdin, Eric; Holmberg, Kaj; Klopfenstein, Olivier; Pióro, Michał; Tomaszewski, Artur; Ümit, Hakan

The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct subnetworks, referred to as Autonomous Systems (ASs) autonomous system AS . They all rely on the Internet Protocol (IP) internet protocol IP for transport of packets across the network. And most of them use shortest path routing protocols shortest path routing!protocols , such as OSPF or IS-IS, to control the routing of IP packets routing!of IP packets within an AS. The idea of the routing is extremely simple — every packet is forwarded on IP links along the shortest route between its source and destination nodes of the AS. The AS network administrator can manage the routing of packets in the AS by supplying the so-called administrative weights of IP links, which specify the link lengths that are used by the routing protocols for their shortest path computations. The main advantage of the shortest path routing policy is its simplicity, allowing for little administrative overhead. From the network engineering perspective, however, shortest path routing can pose problems in achieving satisfactory traffic handling efficiency. As all routing paths depend on the same routing metric routing!metric , it is not possible to configure the routing paths for the communication demands between different pairs of nodes explicitly or individually; the routing can be controlled only indirectly and only as a whole by modifying the routing metric. Thus, one of the main tasks when planning such networks is to find administrative link weights that induce a globally efficient traffic routing traffic!routing configuration of an AS. It turns out that this task leads to very difficult mathematical optimization problems. In this chapter, we discuss and describe exact integer programming models and solution approaches as well as practically efficient smart heuristics for such shortest path routing problems shortest path routing!problems .

Reflectivity retrieval in a networked radar environment

NASA Astrophysics Data System (ADS)

Lim, Sanghun

Monitoring of precipitation using a high-frequency radar system such as X-band is becoming increasingly popular due to its lower cost compared to its counterpart at S-band. Networks of meteorological radar systems at higher frequencies are being pursued for targeted applications such as coverage over a city or a small basin. However, at higher frequencies, the impact of attenuation due to precipitation needs to be resolved for successful implementation. In this research, new attenuation correction algorithms are introduced to compensate the attenuation impact due to rain medium. In order to design X-band radar systems as well as evaluate algorithm development, it is useful to have simultaneous X-band observation with and without the impact of path attenuation. One way to obtain that data set is through theoretical models. Methodologies for generating realistic range profiles of radar variables at attenuating frequencies such as X-band for rain medium are presented here. Fundamental microphysical properties of precipitation, namely size and shape distribution information, are used to generate realistic profiles of X-band starting with S-band observations. Conditioning the simulation from S-band radar measurements maintains the natural distribution of microphysical parameters associated with rainfall. In this research, data taken by the CSU-CHILL radar and the National Center for Atmospheric Research S-POL radar are used to simulate X-band radar variables. Three procedures to simulate the radar variables at X-band and sample applications are presented. A new attenuation correction algorithm based on profiles of reflectivity, differential reflectivity, and differential propagation phase shift is presented. A solution for specific attenuation retrieval in rain medium is proposed that solves the integral equations for reflectivity and differential reflectivity with cumulative differential propagation phase shift constraint. The conventional rain profiling algorithms that connect reflectivity and specific attenuation can retrieve specific attenuation values along the radar path assuming a constant intercept parameter of the normalized drop size distribution. However, in convective storms, the drop size distribution parameters can have significant variation along the path. In this research, a dual-polarization rain profiling algorithm for horizontal-looking radars incorporating reflectivity as well as differential reflectivity profiles is developed. The dual-polarization rain profiling algorithm has been evaluated with X-band radar observations simulated from drop size distribution derived from high-resolution S-band measurements collected by the CSU-CHILL radar. The analysis shows that the dual-polarization rain profiling algorithm provides significant improvement over the current algorithms. A methodology for reflectivity and attenuation retrieval for rain medium in a networked radar environment is described. Electromagnetic waves backscattered from a common volume in networked radar systems are attenuated differently along the different paths. A solution for the specific attenuation distribution is proposed by solving the integral equation for reflectivity. The set of governing integral equations describing the backscatter and propagation of common resolution volume are solved simultaneously with constraints on total path attenuation. The proposed algorithm is evaluated based on simulated X-band radar observations synthesized from S-band measurements collected by the CSU-CHILL radar. Retrieved reflectivity and specific attenuation using the proposed method show good agreement with simulated reflectivity and specific attenuation.

Grief responses, coping processes, and social support of widows: research with Roy's model.

PubMed

Robinson, J H

1995-01-01

This ex post facto descriptive correlational design study of widows during their second year of bereavement utilizes Roy's adaptation model as a guiding framework. Contextual stimuli (social support, social network, income/education, spiritual beliefs) were related to the cognator function (coping process), which was related to adaptation outcome (grief response). Significant moderate positive relationships were found between social support and coping process, and between social network and coping process. A significant relationship was also found between coping process and grief response. The path model accounted for 18% explained variance.

Accelerating Innovation that Enhances Resource Recovery in the Wastewater Sector: Advancing a National Testbed Network.

PubMed

Mihelcic, James R; Ren, Zhiyong Jason; Cornejo, Pablo K; Fisher, Aaron; Simon, A J; Snyder, Seth W; Zhang, Qiong; Rosso, Diego; Huggins, Tyler M; Cooper, William; Moeller, Jeff; Rose, Bob; Schottel, Brandi L; Turgeon, Jason

2017-07-18

This Feature examines significant challenges and opportunities to spur innovation and accelerate adoption of reliable technologies that enhance integrated resource recovery in the wastewater sector through the creation of a national testbed network. The network is a virtual entity that connects appropriate physical testing facilities, and other components needed for a testbed network, with researchers, investors, technology providers, utilities, regulators, and other stakeholders to accelerate the adoption of innovative technologies and processes that are needed for the water resource recovery facility of the future. Here we summarize and extract key issues and developments, to provide a strategy for the wastewater sector to accelerate a path forward that leads to new sustainable water infrastructures.

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

NASA Astrophysics Data System (ADS)

Hyman, J.; Hagberg, A.; Srinivasan, G.; Mohd-Yusof, J.; Viswanathan, H. S.

2017-12-01

We present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. Accurate estimates of first passage times are obtained with an order of magnitude reduction of CPU time and mesh size using the proposed method.

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

NASA Astrophysics Data System (ADS)

Hyman, Jeffrey D.; Hagberg, Aric; Srinivasan, Gowri; Mohd-Yusof, Jamaludin; Viswanathan, Hari

2017-07-01

We present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. Accurate estimates of first passage times are obtained with an order of magnitude reduction of CPU time and mesh size using the proposed method.

Cascade defense via routing in complex networks

NASA Astrophysics Data System (ADS)

Xu, Xiao-Lan; Du, Wen-Bo; Hong, Chen

2015-05-01

As the cascading failures in networked traffic systems are becoming more and more serious, research on cascade defense in complex networks has become a hotspot in recent years. In this paper, we propose a traffic-based cascading failure model, in which each packet in the network has its own source and destination. When cascade is triggered, packets will be redistributed according to a given routing strategy. Here, a global hybrid (GH) routing strategy, which uses the dynamic information of the queue length and the static information of nodes' degree, is proposed to defense the network cascade. Comparing GH strategy with the shortest path (SP) routing, efficient routing (ER) and global dynamic (GD) routing strategies, we found that GH strategy is more effective than other routing strategies in improving the network robustness against cascading failures. Our work provides insight into the robustness of networked traffic systems.

Topological Vulnerability Analysis

NASA Astrophysics Data System (ADS)

Jajodia, Sushil; Noel, Steven

Traditionally, network administrators rely on labor-intensive processes for tracking network configurations and vulnerabilities. This requires a great deal of expertise, and is error prone because of the complexity of networks and associated security data. The interdependencies of network vulnerabilities make traditional point-wise vulnerability analysis inadequate. We describe a Topological Vulnerability Analysis (TVA) approach that analyzes vulnerability dependencies and shows all possible attack paths into a network. From models of the network vulnerabilities and potential attacker exploits, we compute attack graphs that convey the impact of individual and combined vulnerabilities on overall security. TVA finds potential paths of vulnerability through a network, showing exactly how attackers may penetrate a network. From this, we identify key vulnerabilities and provide strategies for protection of critical network assets.

Algebraic Approaches for Scalable End-to-End Monitoring and Diagnosis

NASA Astrophysics Data System (ADS)

Zhao, Yao; Chen, Yan

The rigidity of the Internet architecture led to flourish in the research of end-to-end based systems. In this chapter, we describe a linear algebra-based end-to-end monitoring and diagnosis system. We first propose a tomography-based overlay monitoring system (TOM). Given n end hosts, TOM selectively monitors a basis set of O(nlogn) paths out of all n(n - 1) end-to-end paths. Any end-to-end path can be written as a unique linear combination of paths in the basis set. Consequently, by monitoring loss rates for the paths in the basis set, TOM infers loss rates for all end-to-end paths. Furthermore, leveraging on the scalable measurements from the TOM system, we propose the Least-biased End-to-End Network Diagnosis (in short, LEND) system. We define a minimal identifiable link sequence (MILS) as a link sequence of minimal length whose properties can be uniquely identified from end-to-end measurements. LEND applies an algebraic approach to find out the MILSes and infers the properties of the MILSes efficiently. This also means LEND system achieves the finest diagnosis granularity under the least biased statistical assumptions.

Real-time video streaming using H.264 scalable video coding (SVC) in multihomed mobile networks: a testbed approach

NASA Astrophysics Data System (ADS)

Nightingale, James; Wang, Qi; Grecos, Christos

2011-03-01

Users of the next generation wireless paradigm known as multihomed mobile networks expect satisfactory quality of service (QoS) when accessing streamed multimedia content. The recent H.264 Scalable Video Coding (SVC) extension to the Advanced Video Coding standard (AVC), offers the facility to adapt real-time video streams in response to the dynamic conditions of multiple network paths encountered in multihomed wireless mobile networks. Nevertheless, preexisting streaming algorithms were mainly proposed for AVC delivery over multipath wired networks and were evaluated by software simulation. This paper introduces a practical, hardware-based testbed upon which we implement and evaluate real-time H.264 SVC streaming algorithms in a realistic multihomed wireless mobile networks environment. We propose an optimised streaming algorithm with multi-fold technical contributions. Firstly, we extended the AVC packet prioritisation schemes to reflect the three-dimensional granularity of SVC. Secondly, we designed a mechanism for evaluating the effects of different streamer 'read ahead window' sizes on real-time performance. Thirdly, we took account of the previously unconsidered path switching and mobile networks tunnelling overheads encountered in real-world deployments. Finally, we implemented a path condition monitoring and reporting scheme to facilitate the intelligent path switching. The proposed system has been experimentally shown to offer a significant improvement in PSNR of the received stream compared with representative existing algorithms.

Sampling of temporal networks: Methods and biases

NASA Astrophysics Data System (ADS)

Rocha, Luis E. C.; Masuda, Naoki; Holme, Petter

2017-11-01

Temporal networks have been increasingly used to model a diversity of systems that evolve in time; for example, human contact structures over which dynamic processes such as epidemics take place. A fundamental aspect of real-life networks is that they are sampled within temporal and spatial frames. Furthermore, one might wish to subsample networks to reduce their size for better visualization or to perform computationally intensive simulations. The sampling method may affect the network structure and thus caution is necessary to generalize results based on samples. In this paper, we study four sampling strategies applied to a variety of real-life temporal networks. We quantify the biases generated by each sampling strategy on a number of relevant statistics such as link activity, temporal paths and epidemic spread. We find that some biases are common in a variety of networks and statistics, but one strategy, uniform sampling of nodes, shows improved performance in most scenarios. Given the particularities of temporal network data and the variety of network structures, we recommend that the choice of sampling methods be problem oriented to minimize the potential biases for the specific research questions on hand. Our results help researchers to better design network data collection protocols and to understand the limitations of sampled temporal network data.

Nano-iron Tracer Test for Characterizing Preferential Flow Path in Fractured Rock

NASA Astrophysics Data System (ADS)

Chia, Y.; Chuang, P. Y.

2015-12-01

Deterministic description of the discrete features interpreted from site characterization is desirable for developing a discrete fracture network conceptual model. It is often difficult, however, to delineate preferential flow path through a network of discrete fractures in the field. A preliminary cross-borehole nano-iron tracer test was conducted to characterize the preferential flow path in fractured shale bedrock at a hydrogeological research station. Prior to the test, heat-pulse flowmeter measurements were performed to detect permeable fracture zones at both the injection well and the observation well. While a few fracture zones are found permeable, most are not really permeable. Chemical reduction method was used to synthesize nano zero-valent iron particles with a diameter of 50~150 nm. The conductivity of nano-iron solution is about 3100 μs/cm. The recorded fluid conductivity shows the arrival of nano-iron solution in the observation well 11.5 minutes after it was released from the injection well. The magnetism of zero-valent iron enables it to be absorbed on magnet array designed to locate the depth of incoming tracer. We found nearly all of absorbed iron on the magnet array in the observation well were distributed near the most permeable fracture zone. The test results revealed a preferential flow path through a permeable fracture zone between the injection well and the observation well. The estimated hydraulic conductivity of the connected fracture is 2.2 × 10-3 m/s. This preliminary study indicated that nano-iron tracer test has the potential to characterize preferential flow path in fractured rock.

Quantifying Cell Fate Decisions for Differentiation and Reprogramming of a Human Stem Cell Network: Landscape and Biological Paths

PubMed Central

Li, Chunhe; Wang, Jin

2013-01-01

Cellular reprogramming has been recently intensively studied experimentally. We developed a global potential landscape and kinetic path framework to explore a human stem cell developmental network composed of 52 genes. We uncovered the underlying landscape for the stem cell network with two basins of attractions representing stem and differentiated cell states, quantified and exhibited the high dimensional biological paths for the differentiation and reprogramming process, connecting the stem cell state and differentiated cell state. Both the landscape and non-equilibrium curl flux determine the dynamics of cell differentiation jointly. Flux leads the kinetic paths to be deviated from the steepest descent gradient path, and the corresponding differentiation and reprogramming paths are irreversible. Quantification of paths allows us to find out how the differentiation and reprogramming occur and which important states they go through. We show the developmental process proceeds as moving from the stem cell basin of attraction to the differentiation basin of attraction. The landscape topography characterized by the barrier heights and transition rates quantitatively determine the global stability and kinetic speed of cell fate decision process for development. Through the global sensitivity analysis, we provided some specific predictions for the effects of key genes and regulation connections on the cellular differentiation or reprogramming process. Key links from sensitivity analysis and biological paths can be used to guide the differentiation designs or reprogramming tactics. PMID:23935477

Path Searching Based Fault Automated Recovery Scheme for Distribution Grid with DG

NASA Astrophysics Data System (ADS)

Xia, Lin; Qun, Wang; Hui, Xue; Simeng, Zhu

2016-12-01

Applying the method of path searching based on distribution network topology in setting software has a good effect, and the path searching method containing DG power source is also applicable to the automatic generation and division of planned islands after the fault. This paper applies path searching algorithm in the automatic division of planned islands after faults: starting from the switch of fault isolation, ending in each power source, and according to the line load that the searching path traverses and the load integrated by important optimized searching path, forming optimized division scheme of planned islands that uses each DG as power source and is balanced to local important load. Finally, COBASE software and distribution network automation software applied are used to illustrate the effectiveness of the realization of such automatic restoration program.

The path to producing pharmaceuticals from natural products uncovered by academia-from the perspective of a science coordinator.

PubMed

Fujie, Akihiko

2017-01-01

To actualize the invention of all-Japanese medicines, the Department of Innovative Drug Discovery and Development (iD3) in the Japan Agency for Medical Research and Development (AMED) serves as the headquarters for the Drug Discovery Support Network. iD3 assists with creating research strategies for the seeds of medicines discovered by academia and provides technological support, intellectual property management, and aid for applying the seeds through industry-led efforts. In this review, from the perspective of a science coordinator, I will describe the current activities of the drug discovery support network and iD3 as well as the challenges and future developments of pharmaceutical research and development using the natural product drug discovery method.

Systematic Evaluation of Molecular Networks for Discovery of Disease Genes.

PubMed

Huang, Justin K; Carlin, Daniel E; Yu, Michael Ku; Zhang, Wei; Kreisberg, Jason F; Tamayo, Pablo; Ideker, Trey

2018-04-25

Gene networks are rapidly growing in size and number, raising the question of which networks are most appropriate for particular applications. Here, we evaluate 21 human genome-wide interaction networks for their ability to recover 446 disease gene sets identified through literature curation, gene expression profiling, or genome-wide association studies. While all networks have some ability to recover disease genes, we observe a wide range of performance with STRING, ConsensusPathDB, and GIANT networks having the best performance overall. A general tendency is that performance scales with network size, suggesting that new interaction discovery currently outweighs the detrimental effects of false positives. Correcting for size, we find that the DIP network provides the highest efficiency (value per interaction). Based on these results, we create a parsimonious composite network with both high efficiency and performance. This work provides a benchmark for selection of molecular networks in human disease research. Copyright © 2018 Elsevier Inc. All rights reserved.

[Measurement and performance analysis of functional neural network].

PubMed

Li, Shan; Liu, Xinyu; Chen, Yan; Wan, Hong

2018-04-01

The measurement of network is one of the important researches in resolving neuronal population information processing mechanism using complex network theory. For the quantitative measurement problem of functional neural network, the relation between the measure indexes, i.e. the clustering coefficient, the global efficiency, the characteristic path length and the transitivity, and the network topology was analyzed. Then, the spike-based functional neural network was established and the simulation results showed that the measured network could represent the original neural connections among neurons. On the basis of the former work, the coding of functional neural network in nidopallium caudolaterale (NCL) about pigeon's motion behaviors was studied. We found that the NCL functional neural network effectively encoded the motion behaviors of the pigeon, and there were significant differences in four indexes among the left-turning, the forward and the right-turning. Overall, the establishment method of spike-based functional neural network is available and it is an effective tool to parse the brain information processing mechanism.

Bim-Based Indoor Path Planning Considering Obstacles

NASA Astrophysics Data System (ADS)

Xu, M.; Wei, S.; Zlatanova, S.; Zhang, R.

2017-09-01

At present, 87 % of people's activities are in indoor environment; indoor navigation has become a research issue. As the building structures for people's daily life are more and more complex, many obstacles influence humans' moving. Therefore it is essential to provide an accurate and efficient indoor path planning. Nowadays there are many challenges and problems in indoor navigation. Most existing path planning approaches are based on 2D plans, pay more attention to the geometric configuration of indoor space, often ignore rich semantic information of building components, and mostly consider simple indoor layout without taking into account the furniture. Addressing the above shortcomings, this paper uses BIM (IFC) as the input data and concentrates on indoor navigation considering obstacles in the multi-floor buildings. After geometric and semantic information are extracted, 2D and 3D space subdivision methods are adopted to build the indoor navigation network and to realize a path planning that avoids obstacles. The 3D space subdivision is based on triangular prism. The two approaches are verified by the experiments.

Fundamental Lifetime Mechanisms in Routing Protocols for Wireless Sensor Networks: A Survey and Open Issues

PubMed Central

Eslaminejad, Mohammadreza; Razak, Shukor Abd

2012-01-01

Wireless sensor networks basically consist of low cost sensor nodes which collect data from environment and relay them to a sink, where they will be subsequently processed. Since wireless nodes are severely power-constrained, the major concern is how to conserve the nodes' energy so that network lifetime can be extended significantly. Employing one static sink can rapidly exhaust the energy of sink neighbors. Furthermore, using a non-optimal single path together with a maximum transmission power level may quickly deplete the energy of individual nodes on the route. This all results in unbalanced energy consumption through the sensor field, and hence a negative effect on the network lifetime. In this paper, we present a comprehensive taxonomy of the various mechanisms applied for increasing the network lifetime. These techniques, whether in the routing or cross-layer area, fall within the following types: multi-sink, mobile sink, multi-path, power control and bio-inspired algorithms, depending on the protocol operation. In this taxonomy, special attention has been devoted to the multi-sink, power control and bio-inspired algorithms, which have not yet received much consideration in the literature. Moreover, each class covers a variety of the state-of-the-art protocols, which should provide ideas for potential future works. Finally, we compare these mechanisms and discuss open research issues. PMID:23202008

Fundamental lifetime mechanisms in routing protocols for wireless sensor networks: a survey and open issues.

PubMed

Eslaminejad, Mohammadreza; Razak, Shukor Abd

2012-10-09

Wireless sensor networks basically consist of low cost sensor nodes which collect data from environment and relay them to a sink, where they will be subsequently processed. Since wireless nodes are severely power-constrained, the major concern is how to conserve the nodes' energy so that network lifetime can be extended significantly. Employing one static sink can rapidly exhaust the energy of sink neighbors. Furthermore, using a non-optimal single path together with a maximum transmission power level may quickly deplete the energy of individual nodes on the route. This all results in unbalanced energy consumption through the sensor field, and hence a negative effect on the network lifetime. In this paper, we present a comprehensive taxonomy of the various mechanisms applied for increasing the network lifetime. These techniques, whether in the routing or cross-layer area, fall within the following types: multi-sink, mobile sink, multi-path, power control and bio-inspired algorithms, depending on the protocol operation. In this taxonomy, special attention has been devoted to the multi-sink, power control and bio-inspired algorithms, which have not yet received much consideration in the literature. Moreover, each class covers a variety of the state-of-the-art protocols, which should provide ideas for potential future works. Finally, we compare these mechanisms and discuss open research issues.

Why Does Mptcp Have To Make Things So Complicated : Cross Path Nids Evasion And Countermeasures

DTIC Science & Technology

2016-09-01

previously only establish communication channels over single network paths to communicate over multiple network paths. MPTCP is an enhancement toTCP that...the attacker would fail to create a Command and Control (C2) channel unless the attacker had created a new mapping to the target on the splicing...machine. This would allow the attacker to conduct C2 over a spliced channel . This may even make the attacker’s C2 more evasive. In fact, the effect

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by employing bandwidth shells at areas of overutilization

DOEpatents

Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

2010-04-27

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a final destination. The default routing strategy is altered responsive to detection of overutilization of a particular path of one or more links, and at least some traffic is re-routed by distributing the traffic among multiple paths (which may include the default path). An alternative path may require a greater number of link traversals to reach the destination node.

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

NASA Astrophysics Data System (ADS)

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.

Campaign-level dynamic network modelling for spaceflight logistics for the flexible path concept

NASA Astrophysics Data System (ADS)

Ho, Koki; de Weck, Olivier L.; Hoffman, Jeffrey A.; Shishko, Robert

2016-06-01

This paper develops a network optimization formulation for dynamic campaign-level space mission planning. Although many past space missions have been designed mainly from a mission-level perspective, a campaign-level perspective will be important for future space exploration. In order to find the optimal campaign-level space transportation architecture, a mixed-integer linear programming (MILP) formulation with a generalized multi-commodity flow and a time-expanded network is developed. Particularly, a new heuristics-based method, a partially static time-expanded network, is developed to provide a solution quickly. The developed method is applied to a case study containing human exploration of a near-Earth object (NEO) and Mars, related to the concept of the Flexible Path. The numerical results show that using the specific combinations of propulsion technologies, in-situ resource utilization (ISRU), and other space infrastructure elements can reduce the initial mass in low-Earth orbit (IMLEO) significantly. In addition, the case study results also show that we can achieve large IMLEO reduction by designing NEO and Mars missions together as a campaign compared with designing them separately owing to their common space infrastructure pre-deployment. This research will be an important step toward efficient and flexible campaign-level space mission planning.

Current-Sensitive Path Planning for an Underactuated Free-Floating Ocean Sensorweb

NASA Technical Reports Server (NTRS)

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.

Pseudo paths towards minimum energy states in network dynamics

NASA Astrophysics Data System (ADS)

Hedayatifar, L.; Hassanibesheli, F.; Shirazi, A. H.; Vasheghani Farahani, S.; Jafari, G. R.

2017-10-01

The dynamics of networks forming on Heider balance theory moves towards lower tension states. The condition derived from this theory enforces agents to reevaluate and modify their interactions to achieve equilibrium. These possible changes in network's topology can be considered as various paths that guide systems to minimum energy states. Based on this theory the final destination of a system could reside on a local minimum energy, ;jammed state;, or the global minimum energy, balanced states. The question we would like to address is whether jammed states just appear by chance? Or there exist some pseudo paths that bound a system towards a jammed state. We introduce an indicator to suspect the location of a jammed state based on the Inverse Participation Ratio method (IPR). We provide a margin before a local minimum where the number of possible paths dramatically drastically decreases. This is a condition that proves adequate for ending up on a jammed states.

How physics teachers approach innovation: An empirical study for reconstructing the appropriation path in the case of special relativity

NASA Astrophysics Data System (ADS)

de Ambrosis, Anna; Levrini, Olivia

2010-07-01

This paper concerns an empirical study carried out with a group of high school physics teachers engaged in the Module on relativity of a Master course on the teaching of modern physics. The study is framed within the general research issue of how to promote innovation in school via teachers’ education and how to foster fruitful interactions between research and school practice via the construction of networks of researchers and teachers. In the paper, the problems related to innovation are addressed by focusing on the phase during which teachers analyze an innovative teaching proposal in the perspective of designing their own paths for the class work. The proposal analyzed in this study is Taylor and Wheeler’s approach for teaching special relativity. The paper aims to show that the roots of problems known in the research literature about teachers’ difficulties in coping with innovative proposals, and usually related to the implementation process, can be found and addressed already when teachers approach the proposal and try to appropriate it. The study is heuristic and has been carried out in order to trace the “appropriation path,” followed by the group of teachers, in terms of the main steps and factors triggering the progressive evolution of teachers’ attitudes and competences.

Spatial Characterization of Radio Propagation Channel in Urban Vehicle-to-Infrastructure Environments to Support WSNs Deployment

PubMed Central

Granda, Fausto; Azpilicueta, Leyre; Vargas-Rosales, Cesar; Lopez-Iturri, Peio; Aguirre, Erik; Astrain, Jose Javier; Villandangos, Jesus; Falcone, Francisco

2017-01-01

Vehicular ad hoc Networks (VANETs) enable vehicles to communicate with each other as well as with roadside units (RSUs). Although there is a significant research effort in radio channel modeling focused on vehicle-to-vehicle (V2V), not much work has been done for vehicle-to-infrastructure (V2I) using 3D ray-tracing tools. This work evaluates some important parameters of a V2I wireless channel link such as large-scale path loss and multipath metrics in a typical urban scenario using a deterministic simulation model based on an in-house 3D Ray-Launching (3D-RL) algorithm at 5.9 GHz. Results show the high impact that the spatial distance; link frequency; placement of RSUs; and factors such as roundabout, geometry and relative position of the obstacles have in V2I propagation channel. A detailed spatial path loss characterization of the V2I channel along the streets and avenues is presented. The 3D-RL results show high accuracy when compared with measurements, and represent more reliably the propagation phenomena when compared with analytical path loss models. Performance metrics for a real test scenario implemented with a VANET wireless sensor network implemented ad-hoc are also described. These results constitute a starting point in the design phase of Wireless Sensor Networks (WSNs) radio-planning in the urban V2I deployment in terms of coverage. PMID:28590429

Spatial Characterization of Radio Propagation Channel in Urban Vehicle-to-Infrastructure Environments to Support WSNs Deployment.

PubMed

Granda, Fausto; Azpilicueta, Leyre; Vargas-Rosales, Cesar; Lopez-Iturri, Peio; Aguirre, Erik; Astrain, Jose Javier; Villandangos, Jesus; Falcone, Francisco

2017-06-07

Vehicular ad hoc Networks (VANETs) enable vehicles to communicate with each other as well as with roadside units (RSUs). Although there is a significant research effort in radio channel modeling focused on vehicle-to-vehicle (V2V), not much work has been done for vehicle-to-infrastructure (V2I) using 3D ray-tracing tools. This work evaluates some important parameters of a V2I wireless channel link such as large-scale path loss and multipath metrics in a typical urban scenario using a deterministic simulation model based on an in-house 3D Ray-Launching (3D-RL) algorithm at 5.9 GHz. Results show the high impact that the spatial distance; link frequency; placement of RSUs; and factors such as roundabout, geometry and relative position of the obstacles have in V2I propagation channel. A detailed spatial path loss characterization of the V2I channel along the streets and avenues is presented. The 3D-RL results show high accuracy when compared with measurements, and represent more reliably the propagation phenomena when compared with analytical path loss models. Performance metrics for a real test scenario implemented with a VANET wireless sensor network implemented ad-hoc are also described. These results constitute a starting point in the design phase of Wireless Sensor Networks (WSNs) radio-planning in the urban V2I deployment in terms of coverage.

Physarum solver: A biologically inspired method of road-network navigation

NASA Astrophysics Data System (ADS)

Tero, Atsushi; Kobayashi, Ryo; Nakagaki, Toshiyuki

2006-04-01

We have proposed a mathematical model for the adaptive dynamics of the transport network in an amoeba-like organism, the true slime mold Physarum polycephalum. The model is based on physiological observations of this species, but can also be used for path-finding in the complicated networks of mazes and road maps. In this paper, we describe the physiological basis and the formulation of the model, as well as the results of simulations of some complicated networks. The path-finding method used by Physarum is a good example of cellular computation.

Metabolic PathFinding: inferring relevant pathways in biochemical networks.

PubMed

Croes, Didier; Couche, Fabian; Wodak, Shoshana J; van Helden, Jacques

2005-07-01

Our knowledge of metabolism can be represented as a network comprising several thousands of nodes (compounds and reactions). Several groups applied graph theory to analyse the topological properties of this network and to infer metabolic pathways by path finding. This is, however, not straightforward, with a major problem caused by traversing irrelevant shortcuts through highly connected nodes, which correspond to pool metabolites and co-factors (e.g. H2O, NADP and H+). In this study, we present a web server implementing two simple approaches, which circumvent this problem, thereby improving the relevance of the inferred pathways. In the simplest approach, the shortest path is computed, while filtering out the selection of highly connected compounds. In the second approach, the shortest path is computed on the weighted metabolic graph where each compound is assigned a weight equal to its connectivity in the network. This approach significantly increases the accuracy of the inferred pathways, enabling the correct inference of relatively long pathways (e.g. with as many as eight intermediate reactions). Available options include the calculation of the k-shortest paths between two specified seed nodes (either compounds or reactions). Multiple requests can be submitted in a queue. Results are returned by email, in textual as well as graphical formats (available in http://www.scmbb.ulb.ac.be/pathfinding/).

[Research on brain white matter network in cerebral palsy infant].

PubMed

Li, Jun; Yang, Cheng; Wang, Yuanjun; Nie, Shengdong

2017-10-01

Present study used diffusion tensor image and tractography to construct brain white matter networks of 15 cerebral palsy infants and 30 healthy infants that matched for age and gender. After white matter network analysis, we found that both cerebral palsy and healthy infants had a small-world topology in white matter network, but cerebral palsy infants exhibited abnormal topological organization: increased shortest path length but decreased normalize clustering coefficient, global efficiency and local efficiency. Furthermore, we also found that white matter network hub regions were located in the left cuneus, precuneus, and left posterior cingulate gyrus. However, some abnormal nodes existed in the frontal, temporal, occipital and parietal lobes of cerebral palsy infants. These results indicated that the white matter networks for cerebral palsy infants were disrupted, which was consistent with previous studies about the abnormal brain white matter areas. This work could help us further study the pathogenesis of cerebral palsy infants.

Applications of Temporal Graph Metrics to Real-World Networks

NASA Astrophysics Data System (ADS)

Tang, John; Leontiadis, Ilias; Scellato, Salvatore; Nicosia, Vincenzo; Mascolo, Cecilia; Musolesi, Mirco; Latora, Vito

Real world networks exhibit rich temporal information: friends are added and removed over time in online social networks; the seasons dictate the predator-prey relationship in food webs; and the propagation of a virus depends on the network of human contacts throughout the day. Recent studies have demonstrated that static network analysis is perhaps unsuitable in the study of real world network since static paths ignore time order, which, in turn, results in static shortest paths overestimating available links and underestimating their true corresponding lengths. Temporal extensions to centrality and efficiency metrics based on temporal shortest paths have also been proposed. Firstly, we analyse the roles of key individuals of a corporate network ranked according to temporal centrality within the context of a bankruptcy scandal; secondly, we present how such temporal metrics can be used to study the robustness of temporal networks in presence of random errors and intelligent attacks; thirdly, we study containment schemes for mobile phone malware which can spread via short range radio, similar to biological viruses; finally, we study how the temporal network structure of human interactions can be exploited to effectively immunise human populations. Through these applications we demonstrate that temporal metrics provide a more accurate and effective analysis of real-world networks compared to their static counterparts.

Tracing Technological Development Trajectories: A Genetic Knowledge Persistence-Based Main Path Approach.

PubMed

Park, Hyunseok; Magee, Christopher L

2017-01-01

The aim of this paper is to propose a new method to identify main paths in a technological domain using patent citations. Previous approaches for using main path analysis have greatly improved our understanding of actual technological trajectories but nonetheless have some limitations. They have high potential to miss some dominant patents from the identified main paths; nonetheless, the high network complexity of their main paths makes qualitative tracing of trajectories problematic. The proposed method searches backward and forward paths from the high-persistence patents which are identified based on a standard genetic knowledge persistence algorithm. We tested the new method by applying it to the desalination and the solar photovoltaic domains and compared the results to output from the same domains using a prior method. The empirical results show that the proposed method can dramatically reduce network complexity without missing any dominantly important patents. The main paths identified by our approach for two test cases are almost 10x less complex than the main paths identified by the existing approach. The proposed approach identifies all dominantly important patents on the main paths, but the main paths identified by the existing approach miss about 20% of dominantly important patents.

Tracing Technological Development Trajectories: A Genetic Knowledge Persistence-Based Main Path Approach

PubMed Central

2017-01-01

The aim of this paper is to propose a new method to identify main paths in a technological domain using patent citations. Previous approaches for using main path analysis have greatly improved our understanding of actual technological trajectories but nonetheless have some limitations. They have high potential to miss some dominant patents from the identified main paths; nonetheless, the high network complexity of their main paths makes qualitative tracing of trajectories problematic. The proposed method searches backward and forward paths from the high-persistence patents which are identified based on a standard genetic knowledge persistence algorithm. We tested the new method by applying it to the desalination and the solar photovoltaic domains and compared the results to output from the same domains using a prior method. The empirical results show that the proposed method can dramatically reduce network complexity without missing any dominantly important patents. The main paths identified by our approach for two test cases are almost 10x less complex than the main paths identified by the existing approach. The proposed approach identifies all dominantly important patents on the main paths, but the main paths identified by the existing approach miss about 20% of dominantly important patents. PMID:28135304

Effective distance adaptation traffic dispatching in software defined IP over optical network

NASA Astrophysics Data System (ADS)

Duan, Zhiwei; Li, Hui; Liu, Yuze; Ji, Yuefeng; Li, Hongfa; Lin, Yi

2017-10-01

The rapid growth of IP traffic has contributed to the wide deployment of optical devices (ROADM/OXC, etc.). Meanwhile, with the emergence and application of high-performance network services such as ultra-high video transmission, people are increasingly becoming more and more particular about the quality of service (QoS) of network. However, the pass-band shape of WSSs which is utilized in the ROADM/OXC is not ideal, causing narrowing of spectrum. Spectral narrowing can lead to signal impairment. Therefore, guard-bands need to be inserted between adjacent paths. In order to minimize the bandwidth waste due to guard bands, we propose an effective distance-adaptation traffic dispatching algorithm in IP over optical network based on SDON architecture. We use virtualization technology to set up virtual resources direct links by extracting part of the resources on paths which meet certain specific constraints. We also assign different bandwidth to each IP request based on path length. There is no need for guard-bands between the adjacent paths on the virtual link, which can effectively reduce the number of guard-bands and save the spectrum.

Teleconnection Paths via Climate Network Direct Link Detection.

PubMed

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.

Academic career in medicine: requirements and conditions for successful advancement in Switzerland.

PubMed

Buddeberg-Fischer, Barbara; Stamm, Martina; Buddeberg, Claus

2009-04-29

Within the framework of a prospective cohort study of Swiss medical school graduates a sample of young physicians aspiring to an academic career were surveyed on their career support and barriers experienced up to their sixth year of postgraduate training. Thirty-one junior academics took part in semi-structured telephone interviews in 2007. The interview guideline focused on career paths to date, career support and barriers experienced, and recommendations for junior and senior academics. The qualitatively assessed data were evaluated according to Mayring's content analysis. Furthermore, quantitatively gained data from the total cohort sample on person- and career-related characteristics were analyzed in regard to differences between the junior academics and cohort doctors who aspire to another career in medicine. Junior academics differ in terms of instrumentality as a person-related factor, and in terms of intrinsic career motivation and mentoring as career-related factors from cohort doctors who follow other career paths in medicine; they also show higher scores in the Career-Success Scale. Four types of career path could be identified in junior academics: (1) focus on basic sciences, (2) strong focus on research (PhD programs) followed by clinical training, (3) one to two years in research followed by clinical training, (4) clinical training and research in parallel. The interview material revealed the following categories of career-supporting experience: making oneself out as a proactive junior physician, research resources provided by superior staff, and social network; statements concerning career barriers encompassed interference between clinical training and research activities, insufficient research coaching, and personality related barriers. Recommendations for junior academics focused on mentoring and professional networking, for senior academics on interest in human resource development and being role models. The conditions for an academic career in medicine in Switzerland appear to be difficult especially for those physicians combining research with clinical work. For a successful academic career it seems crucial to start with research activities right after graduation, and take up clinical training later in the career. Furthermore, special mentoring programs for junior academics should be implemented at all medical schools to give trainees more goal-oriented guidance in their career.

Academic career in medicine – requirements and conditions for successful advancement in Switzerland

PubMed Central

Buddeberg-Fischer, Barbara; Stamm, Martina; Buddeberg, Claus

2009-01-01

Background Within the framework of a prospective cohort study of Swiss medical school graduates a sample of young physicians aspiring to an academic career were surveyed on their career support and barriers experienced up to their sixth year of postgraduate training. Methods Thirty-one junior academics took part in semi-structured telephone interviews in 2007. The interview guideline focused on career paths to date, career support and barriers experienced, and recommendations for junior and senior academics. The qualitatively assessed data were evaluated according to Mayring's content analysis. Furthermore, quantitatively gained data from the total cohort sample on person- and career-related characteristics were analyzed in regard to differences between the junior academics and cohort doctors who aspire to another career in medicine. Results Junior academics differ in terms of instrumentality as a person-related factor, and in terms of intrinsic career motivation and mentoring as career-related factors from cohort doctors who follow other career paths in medicine; they also show higher scores in the Career-Success Scale. Four types of career path could be identified in junior academics: (1) focus on basic sciences, (2) strong focus on research (PhD programs) followed by clinical training, (3) one to two years in research followed by clinical training, (4) clinical training and research in parallel. The interview material revealed the following categories of career-supporting experience: making oneself out as a proactive junior physician, research resources provided by superior staff, and social network; statements concerning career barriers encompassed interference between clinical training and research activities, insufficient research coaching, and personality related barriers. Recommendations for junior academics focused on mentoring and professional networking, for senior academics on interest in human resource development and being role models. Conclusion The conditions for an academic career in medicine in Switzerland appear to be difficult especially for those physicians combining research with clinical work. For a successful academic career it seems crucial to start with research activities right after graduation, and take up clinical training later in the career. Furthermore, special mentoring programs for junior academics should be implemented at all medical schools to give trainees more goal-oriented guidance in their career. PMID:19402885

Caching Joint Shortcut Routing to Improve Quality of Service for Information-Centric Networking.

PubMed

Huang, Baixiang; Liu, Anfeng; Zhang, Chengyuan; Xiong, Naixue; Zeng, Zhiwen; Cai, Zhiping

2018-05-29

Hundreds of thousands of ubiquitous sensing (US) devices have provided an enormous number of data for Information-Centric Networking (ICN), which is an emerging network architecture that has the potential to solve a great variety of issues faced by the traditional network. A Caching Joint Shortcut Routing (CJSR) scheme is proposed in this paper to improve the Quality of service (QoS) for ICN. The CJSR scheme mainly has two innovations which are different from other in-network caching schemes: (1) Two routing shortcuts are set up to reduce the length of routing paths. Because of some inconvenient transmission processes, the routing paths of previous schemes are prolonged, and users can only request data from Data Centers (DCs) until the data have been uploaded from Data Producers (DPs) to DCs. Hence, the first kind of shortcut is built from DPs to users directly. This shortcut could release the burden of whole network and reduce delay. Moreover, in the second shortcut routing method, a Content Router (CR) which could yield shorter length of uploading routing path from DPs to DCs is chosen, and then data packets are uploaded through this chosen CR. In this method, the uploading path shares some segments with the pre-caching path, thus the overall length of routing paths is reduced. (2) The second innovation of the CJSR scheme is that a cooperative pre-caching mechanism is proposed so that QoS could have a further increase. Besides being used in downloading routing, the pre-caching mechanism can also be used when data packets are uploaded towards DCs. Combining uploading and downloading pre-caching, the cooperative pre-caching mechanism exhibits high performance in different situations. Furthermore, to address the scarcity of storage size, an algorithm that could make use of storage from idle CRs is proposed. After comparing the proposed scheme with five existing schemes via simulations, experiments results reveal that the CJSR scheme could reduce the total number of processed interest packets by 54.8%, enhance the cache hits of each CR and reduce the number of total hop counts by 51.6% and cut down the length of routing path for users to obtain their interested data by 28.6⁻85.7% compared with the traditional NDN scheme. Moreover, the length of uploading routing path could be decreased by 8.3⁻33.3%.

Network Analysis Tools: from biological networks to clusters and pathways.

PubMed

Brohée, Sylvain; Faust, Karoline; Lima-Mendez, Gipsi; Vanderstocken, Gilles; van Helden, Jacques

2008-01-01

Network Analysis Tools (NeAT) is a suite of computer tools that integrate various algorithms for the analysis of biological networks: comparison between graphs, between clusters, or between graphs and clusters; network randomization; analysis of degree distribution; network-based clustering and path finding. The tools are interconnected to enable a stepwise analysis of the network through a complete analytical workflow. In this protocol, we present a typical case of utilization, where the tasks above are combined to decipher a protein-protein interaction network retrieved from the STRING database. The results returned by NeAT are typically subnetworks, networks enriched with additional information (i.e., clusters or paths) or tables displaying statistics. Typical networks comprising several thousands of nodes and arcs can be analyzed within a few minutes. The complete protocol can be read and executed in approximately 1 h.

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

PubMed Central

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

2012-01-01

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

Path integration of head direction: updating a packet of neural activity at the correct speed using neuronal time constants.

PubMed

Walters, D M; Stringer, S M

2010-07-01

A key question in understanding the neural basis of path integration is how individual, spatially responsive, neurons may self-organize into networks that can, through learning, integrate velocity signals to update a continuous representation of location within an environment. It is of vital importance that this internal representation of position is updated at the correct speed, and in real time, to accurately reflect the motion of the animal. In this article, we present a biologically plausible model of velocity path integration of head direction that can solve this problem using neuronal time constants to effect natural time delays, over which associations can be learned through associative Hebbian learning rules. The model comprises a linked continuous attractor network and competitive network. In simulation, we show that the same model is able to learn two different speeds of rotation when implemented with two different values for the time constant, and without the need to alter any other model parameters. The proposed model could be extended to path integration of place in the environment, and path integration of spatial view.

An Efficient Wireless Recharging Mechanism for Achieving Perpetual Lifetime of Wireless Sensor Networks

PubMed Central

Yu, Hongli; Chen, Guilin; Zhao, Shenghui; Chang, Chih-Yung; Chin, Yu-Ting

2016-01-01

Energy recharging has received much attention in recent years. Several recharging mechanisms were proposed for achieving perpetual lifetime of a given Wireless Sensor Network (WSN). However, most of them require a mobile recharger to visit each sensor and then perform the recharging task, which increases the length of the recharging path. Another common weakness of these works is the requirement for the mobile recharger to stop at the location of each sensor. As a result, it is impossible for recharger to move with a constant speed, leading to inefficient movement. To improve the recharging efficiency, this paper takes “recharging while moving” into consideration when constructing the recharging path. We propose a Recharging Path Construction (RPC) mechanism, which enables the mobile recharger to recharge all sensors using a constant speed, aiming to minimize the length of recharging path and improve the recharging efficiency while achieving the requirement of perpetual network lifetime of a given WSN. Performance studies reveal that the proposed RPC outperforms existing proposals in terms of path length and energy utilization index, as well as visiting cycle. PMID:28025567

Entanglement-Gradient Routing for Quantum Networks.

PubMed

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

Water vapor radiometry research and development phase

NASA Technical Reports Server (NTRS)

Resch, G. M.; Chavez, M. C.; Yamane, N. L.; Barbier, K. M.; Chandlee, R. C.

1985-01-01

This report describes the research and development phase for eight dual-channel water vapor radiometers constructed for the Crustal Dynamics Project at the Goddard Space Flight Center, Greenbelt, Maryland, and for the NASA Deep Space Network. These instruments were developed to demonstrate that the variable path delay imposed on microwave radio transmissions by atmospheric water vapor can be calibrated, particularly as this phenomenon affects very long baseline interferometry measurement systems. Water vapor radiometry technology can also be used in systems that involve moist air meteorology and propagation studies.

Scheduling with hop-by-hop priority increasing in meshed optical burst-switched network

NASA Astrophysics Data System (ADS)

Chang, Hao; Luo, Jiangtao; Zhang, Zhizhong; Xia, Da; Gong, Jue

2006-09-01

In OBS, JET (Just-Enough-Time) is the classical wavelength reservation scheme. But there is a phenomenon that the burst priority decreasing hop-by-hop in multi-hop networks that will waste the bandwidth that was used in the upstream. Based on the HPI (Hop-by-hop Priority Increasing) proposed in the former research, this paper will do an unprecedented simulation in 4×4 meshed topology, which is closer to the real network environment with the help of a NS2-based OBSN simulation platform constructed by ourselves. By contrasting, the drop probability and throughput on one of the longest end-to-end path lengths in the whole networks, it shows that the HPI scheme can improve the utilance of bandwidth better.

Cyber Fighter Associate

DTIC Science & Technology

2016-01-01

accomplish a patch- management mission while securing a critical path. As a first proof of concept a simulation with a network of 10 nodes and 4...software-agility walk of the “PERFORMANCE Each Threat Managed ” tree is slightly more complex than the network -agility walk. The original design of the...CyFiA was tested to accomplish a patch- management mission while securing a critical path. As a first proof of concept a simulation with a network of 10

Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad-Hoc Networks

NASA Astrophysics Data System (ADS)

Li, Xiaohua(Edward)

In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interference cancellation (SIC) and maximal ratio combining (MRC) to deal with mutual interference and to utilize all the received signal energy, we show that the signal-to-interference-plus-noise ratio (SINR) of a node is determined only by the nodes before it, not the nodes after it, along a packet forwarding path. Based on this observation, we propose an iterative procedure to select the relay nodes and to calculate the path SINR as well as capacity of an arbitrary multi-hop packet forwarding path. The complexity of the algorithm is extremely low, and scaling well with network size. The algorithm is applicable in arbitrarily large networks. Its performance is demonstrated as desirable by simulations. The algorithm can be helpful in analyzing the performance of multi-hop wireless networks.

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

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

Hyman, Jeffrey De'Haven; Hagberg, Aric Arild; Mohd-Yusof, Jamaludin

Here, we present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We also derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths.more » First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. We obtain accurate estimates of first passage times with an order of magnitude reduction of CPU time and mesh size using the proposed method.« less

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

DOE PAGES

Hyman, Jeffrey De'Haven; Hagberg, Aric Arild; Mohd-Yusof, Jamaludin; ...

2017-07-10

Here, we present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We also derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths.more » First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. We obtain accurate estimates of first passage times with an order of magnitude reduction of CPU time and mesh size using the proposed method.« less

Research on the tourism resource development from the perspective of network capability-Taking Wuxi Huishan Ancient Town as an example

NASA Astrophysics Data System (ADS)

Bao, Yanli; Hua, Hefeng

2017-03-01

Network capability is the enterprise's capability to set up, manage, maintain and use a variety of relations between enterprises, and to obtain resources for improving competitiveness. Tourism in China is in a transformation period from sightseeing to leisure and vacation. Scenic spots as well as tourist enterprises can learn from some other enterprises in the process of resource development, and build up its own network relations in order to get resources for their survival and development. Through the effective management of network relations, the performance of resource development will be improved. By analyzing literature on network capability and the case analysis of Wuxi Huishan Ancient Town, the role of network capacity in the tourism resource development is explored and resource development path is built from the perspective of network capability. Finally, the tourism resource development process model based on network capacity is proposed. This model mainly includes setting up network vision, resource identification, resource acquisition, resource utilization and tourism project development. In these steps, network construction, network management and improving network center status are key points.

An object-based storage model for distributed remote sensing images

NASA Astrophysics Data System (ADS)

Yu, Zhanwu; Li, Zhongmin; Zheng, Sheng

2006-10-01

It is very difficult to design an integrated storage solution for distributed remote sensing images to offer high performance network storage services and secure data sharing across platforms using current network storage models such as direct attached storage, network attached storage and storage area network. Object-based storage, as new generation network storage technology emerged recently, separates the data path, the control path and the management path, which solves the bottleneck problem of metadata existed in traditional storage models, and has the characteristics of parallel data access, data sharing across platforms, intelligence of storage devices and security of data access. We use the object-based storage in the storage management of remote sensing images to construct an object-based storage model for distributed remote sensing images. In the storage model, remote sensing images are organized as remote sensing objects stored in the object-based storage devices. According to the storage model, we present the architecture of a distributed remote sensing images application system based on object-based storage, and give some test results about the write performance comparison of traditional network storage model and object-based storage model.

Integration of geospatial multi-mode transportation Systems in Kuala Lumpur

NASA Astrophysics Data System (ADS)

Ismail, M. A.; Said, M. N.

2014-06-01

Public transportation serves people with mobility and accessibility to workplaces, health facilities, community resources, and recreational areas across the country. Development in the application of Geographical Information Systems (GIS) to transportation problems represents one of the most important areas of GIS-technology today. To show the importance of GIS network analysis, this paper highlights the determination of the optimal path between two or more destinations based on multi-mode concepts. The abstract connector is introduced in this research as an approach to integrate urban public transportation in Kuala Lumpur, Malaysia including facilities such as Light Rapid Transit (LRT), Keretapi Tanah Melayu (KTM) Komuter, Express Rail Link (ERL), KL Monorail, road driving as well as pedestrian modes into a single intelligent data model. To assist such analysis, ArcGIS's Network Analyst functions are used whereby the final output includes the total distance, total travelled time, directional maps produced to find the quickest, shortest paths, and closest facilities based on either time or distance impedance for multi-mode route analysis.

Mutual-Information-Based Incremental Relaying Communications for Wireless Biomedical Implant Systems

PubMed Central

Liao, Yangzhe; Cai, Qing; Ai, Qingsong; Liu, Quan

2018-01-01

Network lifetime maximization of wireless biomedical implant systems is one of the major research challenges of wireless body area networks (WBANs). In this paper, a mutual information (MI)-based incremental relaying communication protocol is presented where several on-body relay nodes and one coordinator are attached to the clothes of a patient. Firstly, a comprehensive analysis of a system model is investigated in terms of channel path loss, energy consumption, and the outage probability from the network perspective. Secondly, only when the MI value becomes smaller than the predetermined threshold is data transmission allowed. The communication path selection can be either from the implanted sensor to the on-body relay then forwards to the coordinator or from the implanted sensor to the coordinator directly, depending on the communication distance. Moreover, mathematical models of quality of service (QoS) metrics are derived along with the related subjective functions. The results show that the MI-based incremental relaying technique achieves better performance in comparison to our previous proposed protocol techniques regarding several selected performance metrics. The outcome of this paper can be applied to intra-body continuous physiological signal monitoring, artificial biofeedback-oriented WBANs, and telemedicine system design. PMID:29419784

Mutual-Information-Based Incremental Relaying Communications for Wireless Biomedical Implant Systems.

PubMed

Liao, Yangzhe; Leeson, Mark S; Cai, Qing; Ai, Qingsong; Liu, Quan

2018-02-08

Network lifetime maximization of wireless biomedical implant systems is one of the major research challenges of wireless body area networks (WBANs). In this paper, a mutual information (MI)-based incremental relaying communication protocol is presented where several on-body relay nodes and one coordinator are attached to the clothes of a patient. Firstly, a comprehensive analysis of a system model is investigated in terms of channel path loss, energy consumption, and the outage probability from the network perspective. Secondly, only when the MI value becomes smaller than the predetermined threshold is data transmission allowed. The communication path selection can be either from the implanted sensor to the on-body relay then forwards to the coordinator or from the implanted sensor to the coordinator directly, depending on the communication distance. Moreover, mathematical models of quality of service (QoS) metrics are derived along with the related subjective functions. The results show that the MI-based incremental relaying technique achieves better performance in comparison to our previous proposed protocol techniques regarding several selected performance metrics. The outcome of this paper can be applied to intra-body continuous physiological signal monitoring, artificial biofeedback-oriented WBANs, and telemedicine system design.

On/off ratio enhancement in single-walled carbon nanotube field-effect transistor by controlling network density via sonication

NASA Astrophysics Data System (ADS)

Jang, Ho-Kyun; Choi, Jun Hee; Kim, Do-Hyun; Kim, Gyu Tae

2018-06-01

Single-walled carbon nanotube (SWCNT) is generally used as a networked structure in the fabrication of a field-effect transistor (FET) since it is known that one-third of SWCNT is electrically metallic and the remains are semiconducting. In this case, the presence of metallic paths by metallic SWCNT (m-SWCNT) becomes a significant technical barrier which hinders the networks from achieving a semiconducting behavior, resulting in a low on/off ratio. Here, we report on an easy method of controlling the on/off ratio of a FET where semiconducting SWCNT (s-SWCNT) and m-SWCNT constitute networks between source and drain electrodes. A FET with SWCNT networks was simply sonicated under water to control the on/off ratio and network density. As a result, the FET having an almost metallic behavior due to the metallic paths by m-SWCNT exhibited a p-type semiconducting behavior. The on/off ratio ranged from 1 to 9.0 × 104 along sonication time. In addition, theoretical calculations based on Monte-Carlo method and circuit simulation were performed to understand and explain the phenomenon of a change in the on/off ratio and network density by sonication. On the basis of experimental and theoretical results, we found that metallic paths contributed to a high off-state current which leads to a low on/off ratio and that sonication formed sparse SWCNT networks where metallic paths of m-SWCNT were removed, resulting in a high on/off ratio. This method can open a chance to save the device which has been considered as a failed one due to a metallic behavior by a high network density leading to a low on/off ratio.

Minimum-Risk Path Finding by an Adaptive Amoebal Network

NASA Astrophysics Data System (ADS)

Nakagaki, Toshiyuki; Iima, Makoto; Ueda, Tetsuo; Nishiura, Yasumasa; Saigusa, Tetsu; Tero, Atsushi; Kobayashi, Ryo; Showalter, Kenneth

2007-08-01

When two food sources are presented to the slime mold Physarum in the dark, a thick tube for absorbing nutrients is formed that connects the food sources through the shortest route. When the light-avoiding organism is partially illuminated, however, the tube connecting the food sources follows a different route. Defining risk as the experimentally measurable rate of light-avoiding movement, the minimum-risk path is exhibited by the organism, determined by integrating along the path. A model for an adaptive-tube network is presented that is in good agreement with the experimental observations.

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

NASA Astrophysics Data System (ADS)

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.

Iterative deep convolutional encoder-decoder network for medical image segmentation.

PubMed

Jung Uk Kim; Hak Gu Kim; Yong Man Ro

2017-07-01

In this paper, we propose a novel medical image segmentation using iterative deep learning framework. We have combined an iterative learning approach and an encoder-decoder network to improve segmentation results, which enables to precisely localize the regions of interest (ROIs) including complex shapes or detailed textures of medical images in an iterative manner. The proposed iterative deep convolutional encoder-decoder network consists of two main paths: convolutional encoder path and convolutional decoder path with iterative learning. Experimental results show that the proposed iterative deep learning framework is able to yield excellent medical image segmentation performances for various medical images. The effectiveness of the proposed method has been proved by comparing with other state-of-the-art medical image segmentation methods.

A scaling law for random walks on networks

PubMed Central

Perkins, Theodore J.; Foxall, Eric; Glass, Leon; Edwards, Roderick

2014-01-01

The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics. PMID:25311870

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

PubMed

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.

A scaling law for random walks on networks

NASA Astrophysics Data System (ADS)

Perkins, Theodore J.; Foxall, Eric; Glass, Leon; Edwards, Roderick

2014-10-01

The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics.

Topology and static response of interaction networks in molecular biology

PubMed Central

Radulescu, Ovidiu; Lagarrigue, Sandrine; Siegel, Anne; Veber, Philippe; Le Borgne, Michel

2005-01-01

We introduce a mathematical framework describing static response of networks occurring in molecular biology. This formalism has many similarities with the Laplace–Kirchhoff equations for electrical networks. We introduce the concept of graph boundary and we show how the response of the biological networks to external perturbations can be related to the Dirichlet or Neumann problems for the corresponding equations on the interaction graph. Solutions to these two problems are given in terms of path moduli (measuring path rigidity with respect to the propagation of interaction along the graph). Path moduli are related to loop products in the interaction graph via generalized Mason–Coates formulae. We apply our results to two specific biological examples: the lactose operon and the genetic regulation of lipogenesis. Our applications show consistency with experimental results and in the case of lipogenesis check some hypothesis on the behaviour of hepatic fatty acids on fasting. PMID:16849230

A scaling law for random walks on networks.

PubMed

Perkins, Theodore J; Foxall, Eric; Glass, Leon; Edwards, Roderick

2014-10-14

The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics.

Adverse outcome pathway networks II: Network analytics.

PubMed

Villeneuve, Daniel L; Angrish, Michelle M; Fortin, Marie C; Katsiadaki, Ioanna; Leonard, Marc; Margiotta-Casaluci, Luigi; Munn, Sharon; O'Brien, Jason M; Pollesch, Nathan L; Smith, L Cody; Zhang, Xiaowei; Knapen, Dries

2018-06-01

Toxicological responses to stressors are more complex than the simple one-biological-perturbation to one-adverse-outcome model portrayed by individual adverse outcome pathways (AOPs). Consequently, the AOP framework was designed to facilitate de facto development of AOP networks that can aid in the understanding and prediction of pleiotropic and interactive effects more common to environmentally realistic, complex exposure scenarios. The present study introduces nascent concepts related to the qualitative analysis of AOP networks. First, graph theory-based approaches for identifying important topological features are illustrated using 2 example AOP networks derived from existing AOP descriptions. Second, considerations for identifying the most significant path(s) through an AOP network from either a biological or risk assessment perspective are described. Finally, approaches for identifying interactions among AOPs that may result in additive, synergistic, or antagonistic responses (or previously undefined emergent patterns of response) are introduced. Along with a companion article (part I), these concepts set the stage for the development of tools and case studies that will facilitate more rigorous analysis of AOP networks, and the utility of AOP network-based predictions, for use in research and regulatory decision-making. The present study addresses one of the major themes identified through a Society of Environmental Toxicology and Chemistry Horizon Scanning effort focused on advancing the AOP framework. Environ Toxicol Chem 2018;37:1734-1748. © 2018 The Authors. Environmental Toxicology and Chemistry published by Wiley Periodicals, Inc. on behalf of SETAC. This article is a US government work and, as such, is in the public domain in the United States of America. © 2018 The Authors. Environmental Toxicology and Chemistry published by Wiley Periodicals, Inc. on behalf of SETAC. This article is a US government work and, as such, is in the public domain in the United States of America.

Comparison of weighted and unweighted network analysis in the case of a pig trade network in Northern Germany.

PubMed

Büttner, Kathrin; Krieter, Joachim

2018-08-01

The analysis of trade networks as well as the spread of diseases within these systems focuses mainly on pure animal movements between farms. However, additional data included as edge weights can complement the informational content of the network analysis. However, the inclusion of edge weights can also alter the outcome of the network analysis. Thus, the aim of the study was to compare unweighted and weighted network analyses of a pork supply chain in Northern Germany and to evaluate the impact on the centrality parameters. Five different weighted network versions were constructed by adding the following edge weights: number of trade contacts, number of delivered livestock, average number of delivered livestock per trade contact, geographical distance and reciprocal geographical distance. Additionally, two different edge weight standardizations were used. The network observed from 2013 to 2014 contained 678 farms which were connected by 1,018 edges. General network characteristics including shortest path structure (e.g. identical shortest paths, shortest path lengths) as well as centrality parameters for each network version were calculated. Furthermore, the targeted and the random removal of farms were performed in order to evaluate the structural changes in the networks. All network versions and edge weight standardizations revealed the same number of shortest paths (1,935). Between 94.4 to 98.9% of the unweighted network and the weighted network versions were identical. Furthermore, depending on the calculated centrality parameters and the edge weight standardization used, it could be shown that the weighted network versions differed from the unweighted network (e.g. for the centrality parameters based on ingoing trade contacts) or did not differ (e.g. for the centrality parameters based on the outgoing trade contacts) with regard to the Spearman Rank Correlation and the targeted removal of farms. The choice of standardization method as well as the inclusion or exclusion of specific farm types (e.g. abattoirs) can alter the results significantly. These facts have to be considered when centrality parameters are to be used for the implementation of prevention and control strategies in the case of an epidemic. Copyright © 2018 Elsevier B.V. All rights reserved.

An improved approximate network blocking probability model for all-optical WDM Networks with heterogeneous link capacities

NASA Astrophysics Data System (ADS)

Khan, Akhtar Nawaz

2017-11-01

Currently, analytical models are used to compute approximate blocking probabilities in opaque and all-optical WDM networks with the homogeneous link capacities. Existing analytical models can also be extended to opaque WDM networking with heterogeneous link capacities due to the wavelength conversion at each switch node. However, existing analytical models cannot be utilized for all-optical WDM networking with heterogeneous structure of link capacities due to the wavelength continuity constraint and unequal numbers of wavelength channels on different links. In this work, a mathematical model is extended for computing approximate network blocking probabilities in heterogeneous all-optical WDM networks in which the path blocking is dominated by the link along the path with fewer number of wavelength channels. A wavelength assignment scheme is also proposed for dynamic traffic, termed as last-fit-first wavelength assignment, in which a wavelength channel with maximum index is assigned first to a lightpath request. Due to heterogeneous structure of link capacities and the wavelength continuity constraint, the wavelength channels with maximum indexes are utilized for minimum hop routes. Similarly, the wavelength channels with minimum indexes are utilized for multi-hop routes between source and destination pairs. The proposed scheme has lower blocking probability values compared to the existing heuristic for wavelength assignments. Finally, numerical results are computed in different network scenarios which are approximately equal to values obtained from simulations. Since January 2016, he is serving as Head of Department and an Assistant Professor in the Department of Electrical Engineering at UET, Peshawar-Jalozai Campus, Pakistan. From May 2013 to June 2015, he served Department of Telecommunication Engineering as an Assistant Professor at UET, Peshawar-Mardan Campus, Pakistan. He also worked as an International Internship scholar in the Fukuda Laboratory, National Institute of Informatics, Tokyo, Japan on the topic large-scale simulation for internet topology analysis. His research interests include design and analysis of optical WDM networks, network algorithms, network routing, and network resource optimization problems.

Newberry EGS Seismic Velocity Model

DOE Data Explorer

Templeton, Dennise

2013-10-01

We use ambient noise correlation (ANC) to create a detailed image of the subsurface seismic velocity at the Newberry EGS site down to 5 km. We collected continuous data for the 22 stations in the Newberry network, together with 12 additional stations from the nearby CC, UO and UW networks. The data were instrument corrected, whitened and converted to single bit traces before cross correlation according to the methodology in Benson (2007). There are 231 unique paths connecting the 22 stations of the Newberry network. The additional networks extended that to 402 unique paths crossing beneath the Newberry site.

An industrial robot singular trajectories planning based on graphs and neural networks

NASA Astrophysics Data System (ADS)

Łęgowski, Adrian; Niezabitowski, Michał

2016-06-01

Singular trajectories are rarely used because of issues during realization. A method of planning trajectories for given set of points in task space with use of graphs and neural networks is presented. In every desired point the inverse kinematics problem is solved in order to derive all possible solutions. A graph of solutions is made. The shortest path is determined to define required nodes in joint space. Neural networks are used to define the path between these nodes.

Graphene-based battery electrodes having continuous flow paths

DOEpatents

Zhang, Jiguang; Xiao, Jie; Liu, Jun; Xu, Wu; Li, Xiaolin; Wang, Deyu

2014-05-24

Some batteries can exhibit greatly improved performance by utilizing electrodes having randomly arranged graphene nanosheets forming a network of channels defining continuous flow paths through the electrode. The network of channels can provide a diffusion pathway for the liquid electrolyte and/or for reactant gases. Metal-air batteries can benefit from such electrodes. In particular Li-air batteries show extremely high capacities, wherein the network of channels allow oxygen to diffuse through the electrode and mesopores in the electrode can store discharge products.

Studies of free-space optical links through simulated boundary layer and long-path turbulence

NASA Astrophysics Data System (ADS)

Wasiczko, Linda; Smolyaninov, Igor I.; Milner, Stuart D.; Davis, Christopher C.

2004-02-01

There is recent interest from the US Department of Defense in free space optical communication networks involving aircraft flying at various altitudes. The optical links between these aircraft may be as long as 100km, and involve communication between network nodes that are moving at sub-sonic speeds. An unresolved issue for links of this kind between pairs of aircraft is the effect of boundary layer turbulence near each aircraft, as well as along the atmospheric path between them. The deployment of optical wireless links in several different scenarios will be described. These include links near to the ground for which the turbulence parameter Cn2 varies along the path between transmitter (TX) and receiver (RX), high altitude links between aircraft, and ground to aircraft links. The last two of these may involve boundary layer turbulence near the aircraft node where the turbulence is localized either at the TX or at the RX. Some of the theoretical approaches to examining these situations will be described, as well as an ongoing program of research to examine these situations experimentally. Ways to mitigate the effects of node motion, and scintillation at the RX will be discussed, including the use of non-imaging concentrators at the RX.

minepath.org: a free interactive pathway analysis web server.

PubMed

Koumakis, Lefteris; Roussos, Panos; Potamias, George

2017-07-03

( www.minepath.org ) is a web-based platform that elaborates on, and radically extends the identification of differentially expressed sub-paths in molecular pathways. Besides the network topology, the underlying MinePath algorithmic processes exploit exact gene-gene molecular relationships (e.g. activation, inhibition) and are able to identify differentially expressed pathway parts. Each pathway is decomposed into all its constituent sub-paths, which in turn are matched with corresponding gene expression profiles. The highly ranked, and phenotype inclined sub-paths are kept. Apart from the pathway analysis algorithm, the fundamental innovation of the MinePath web-server concerns its advanced visualization and interactive capabilities. To our knowledge, this is the first pathway analysis server that introduces and offers visualization of the underlying and active pathway regulatory mechanisms instead of genes. Other features include live interaction, immediate visualization of functional sub-paths per phenotype and dynamic linked annotations for the engaged genes and molecular relations. The user can download not only the results but also the corresponding web viewer framework of the performed analysis. This feature provides the flexibility to immediately publish results without publishing source/expression data, and get all the functionality of a web based pathway analysis viewer. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.

Mining the Temporal Dimension of the Information Propagation

NASA Astrophysics Data System (ADS)

Berlingerio, Michele; Coscia, Michele; Giannotti, Fosca

In the last decade, Social Network Analysis has been a field in which the effort devoted from several researchers in the Data Mining area has increased very fast. Among the possible related topics, the study of the information propagation in a network attracted the interest of many researchers, also from the industrial world. However, only a few answers to the questions “How does the information propagates over a network, why and how fast?” have been discovered so far. On the other hand, these answers are of large interest, since they help in the tasks of finding experts in a network, assessing viral marketing strategies, identifying fast or slow paths of the information inside a collaborative network. In this paper we study the problem of finding frequent patterns in a network with the help of two different techniques: TAS (Temporally Annotated Sequences) mining, aimed at extracting sequential patterns where each transition between two events is annotated with a typical transition time that emerges from input data, and Graph Mining, which is helpful for locally analyzing the nodes of the networks with their properties. Finally we show preliminary results done in the direction of mining the information propagation over a network, performed on two well known email datasets, that show the power of the combination of these two approaches.

The role of endogenous and exogenous mechanisms in the formation of R&D networks

NASA Astrophysics Data System (ADS)

Tomasello, Mario V.; Perra, Nicola; Tessone, Claudio J.; Karsai, Márton; Schweitzer, Frank

2014-07-01

We develop an agent-based model of strategic link formation in Research and Development (R&D) networks. Empirical evidence has shown that the growth of these networks is driven by mechanisms which are both endogenous to the system (that is, depending on existing alliances patterns) and exogenous (that is, driven by an exploratory search for newcomer firms). Extant research to date has not investigated both mechanisms simultaneously in a comparative manner. To overcome this limitation, we develop a general modeling framework to shed light on the relative importance of these two mechanisms. We test our model against a comprehensive dataset, listing cross-country and cross-sectoral R&D alliances from 1984 to 2009. Our results show that by fitting only three macroscopic properties of the network topology, this framework is able to reproduce a number of micro-level measures, including the distributions of degree, local clustering, path length and component size, and the emergence of network clusters. Furthermore, by estimating the link probabilities towards newcomers and established firms from the data, we find that endogenous mechanisms are predominant over the exogenous ones in the network formation, thus quantifying the importance of existing structures in selecting partner firms.

Investigation of global and local network properties of music perception with culturally different styles of music.

PubMed

Li, Yan; Rui, Xue; Li, Shuyu; Pu, Fang

2014-11-01

Graph theoretical analysis has recently become a popular research tool in neuroscience, however, there have been very few studies on brain responses to music perception, especially when culturally different styles of music are involved. Electroencephalograms were recorded from ten subjects listening to Chinese traditional music, light music and western classical music. For event-related potentials, phase coherence was calculated in the alpha band and then constructed into correlation matrices. Clustering coefficients and characteristic path lengths were evaluated for global properties, while clustering coefficients and efficiency were assessed for local network properties. Perception of light music and western classical music manifested small-world network properties, especially with a relatively low proportion of weights of correlation matrices. For local analysis, efficiency was more discernible than clustering coefficient. Nevertheless, there was no significant discrimination between Chinese traditional and western classical music perception. Perception of different styles of music introduces different network properties, both globally and locally. Research into both global and local network properties has been carried out in other areas; however, this is a preliminary investigation aimed at suggesting a possible new approach to brain network properties in music perception. Copyright © 2014 Elsevier Ltd. All rights reserved.

Graph modeling systems and methods

DOEpatents

Neergaard, Mike

2015-10-13

An apparatus and a method for vulnerability and reliability modeling are provided. The method generally includes constructing a graph model of a physical network using a computer, the graph model including a plurality of terminating vertices to represent nodes in the physical network, a plurality of edges to represent transmission paths in the physical network, and a non-terminating vertex to represent a non-nodal vulnerability along a transmission path in the physical network. The method additionally includes evaluating the vulnerability and reliability of the physical network using the constructed graph model, wherein the vulnerability and reliability evaluation includes a determination of whether each terminating and non-terminating vertex represents a critical point of failure. The method can be utilized to evaluate wide variety of networks, including power grid infrastructures, communication network topologies, and fluid distribution systems.

a Modified Genetic Algorithm for Finding Fuzzy Shortest Paths in Uncertain Networks

NASA Astrophysics Data System (ADS)

Heidari, A. A.; Delavar, M. R.

2016-06-01

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.

Three-tier multi-granularity switching system based on PCE

NASA Astrophysics Data System (ADS)

Wang, Yubao; Sun, Hao; Liu, Yanfei

2017-10-01

With the growing demand for business communications, electrical signal processing optical path switching can't meet the demand. The multi-granularity switch system that can improve node routing and switching capabilities came into being. In the traditional network, each node is responsible for calculating the path; synchronize the whole network state, which will increase the burden on the network, so the concept of path calculation element (PCE) is proposed. The PCE is responsible for routing and allocating resources in the network1. In the traditional band-switched optical network, the wavelength is used as the basic routing unit, resulting in relatively low wavelength utilization. Due to the limitation of wavelength continuity, the routing design of the band technology becomes complicated, which directly affects the utilization of the system. In this paper, optical code granularity is adopted. There is no continuity of the optical code, and the number of optical codes is more flexible than the wavelength. For the introduction of optical code switching, we propose a Code Group Routing Entity (CGRE) algorithm. In short, the combination of three-tier multi-granularity optical switching system and PCE can simplify the network structure, reduce the node load, and enhance the network scalability and survivability. Realize the intelligentization of optical network.

Research on robust optimization of emergency logistics network considering the time dependence characteristic

NASA Astrophysics Data System (ADS)

WANG, Qingrong; ZHU, Changfeng; LI, Ying; ZHANG, Zhengkun

2017-06-01

Considering the time dependence of emergency logistic network and complexity of the environment that the network exists in, in this paper the time dependent network optimization theory and robust discrete optimization theory are combined, and the emergency logistics dynamic network optimization model with characteristics of robustness is built to maximize the timeliness of emergency logistics. On this basis, considering the complexity of dynamic network and the time dependence of edge weight, an improved ant colony algorithm is proposed to realize the coupling of the optimization algorithm and the network time dependence and robustness. Finally, a case study has been carried out in order to testify validity of this robustness optimization model and its algorithm, and the value of different regulation factors was analyzed considering the importance of the value of the control factor in solving the optimal path. Analysis results show that this model and its algorithm above-mentioned have good timeliness and strong robustness.

Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks

PubMed Central

Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

2016-01-01

Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV. PMID:27258013

An Energy-Efficient and Robust Multipath Routing Protocol for Cognitive Radio Ad Hoc Networks.

PubMed

Singh, Kishor; Moh, Sangman

2017-09-04

Routing in cognitive radio ad hoc networks (CRAHNs) is a daunting task owing to dynamic topology, intermittent connectivity, spectrum heterogeneity, and energy constraints. Other prominent aspects such as channel stability, path reliability, and route discovery frequency should also be exploited. Several routing protocols have been proposed for CRAHNs in the literature. By stressing on one of the aspects more than any other, however, they do not satisfy all requirements of throughput, energy efficiency, and robustness. In this paper, we propose an energy-efficient and robust multipath routing (ERMR) protocol for CRAHNs by considering all prominent aspects including residual energy and channel stability in design. Even when the current routing path fails, the alternative routing path is immediately utilized. In establishing primary and alternative routing paths, both residual energy and channel stability are exploited simultaneously. Our simulation study shows that the proposed ERMR outperforms the conventional protocol in terms of network throughput, packet delivery ratio, energy consumption, and end-to-end delay.

An Energy-Efficient and Robust Multipath Routing Protocol for Cognitive Radio Ad Hoc Networks

PubMed Central

Singh, Kishor

2017-01-01

Routing in cognitive radio ad hoc networks (CRAHNs) is a daunting task owing to dynamic topology, intermittent connectivity, spectrum heterogeneity, and energy constraints. Other prominent aspects such as channel stability, path reliability, and route discovery frequency should also be exploited. Several routing protocols have been proposed for CRAHNs in the literature. By stressing on one of the aspects more than any other, however, they do not satisfy all requirements of throughput, energy efficiency, and robustness. In this paper, we propose an energy-efficient and robust multipath routing (ERMR) protocol for CRAHNs by considering all prominent aspects including residual energy and channel stability in design. Even when the current routing path fails, the alternative routing path is immediately utilized. In establishing primary and alternative routing paths, both residual energy and channel stability are exploited simultaneously. Our simulation study shows that the proposed ERMR outperforms the conventional protocol in terms of network throughput, packet delivery ratio, energy consumption, and end-to-end delay. PMID:28869551

Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks.

PubMed

Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

2016-01-01

Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV.

Statistical similarity measures for link prediction in heterogeneous complex networks

NASA Astrophysics Data System (ADS)

Shakibian, Hadi; Charkari, Nasrollah Moghadam

2018-07-01

The majority of the link prediction measures in heterogeneous complex networks rely on the nodes connectivities while less attention has been paid to the importance of the nodes and paths. In this paper, we propose some new meta-path based statistical similarity measures to properly perform link prediction task. The main idea in the proposed measures is to drive some co-occurrence events in a number of co-occurrence matrices that are occurred between the visited nodes obeying a meta-path. The extracted co-occurrence matrices are analyzed in terms of the energy, inertia, local homogeneity, correlation, and information measure of correlation to determine various information theoretic measures. We evaluate the proposed measures, denoted as link energy, link inertia, link local homogeneity, link correlation, and link information measure of correlation, using a standard DBLP network data set. The results of the AUC score and Precision rate indicate the validity and accuracy of the proposed measures in comparison to the popular meta-path based similarity measures.

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

DTIC Science & Technology

2015-01-01

independence in Tor. 5.1 Vanilla Tor All of our Tor simulations run over the week of January 19– 25, 2014. When producing and analyzing these simulations, we...selection using path simula- tion and our traceroute data, similar to how they were used in Section 5.1 to explore vanilla Tor security. As a byproduct

The QKD network: model and routing scheme

NASA Astrophysics Data System (ADS)

Yang, Chao; Zhang, Hongqi; Su, Jinhai

2017-11-01

Quantum key distribution (QKD) technology can establish unconditional secure keys between two communicating parties. Although this technology has some inherent constraints, such as the distance and point-to-point mode limits, building a QKD network with multiple point-to-point QKD devices can overcome these constraints. Considering the development level of current technology, the trust relaying QKD network is the first choice to build a practical QKD network. However, the previous research didn't address a routing method on the trust relaying QKD network in detail. This paper focuses on the routing issues, builds a model of the trust relaying QKD network for easily analysing and understanding this network, and proposes a dynamical routing scheme for this network. From the viewpoint of designing a dynamical routing scheme in classical network, the proposed scheme consists of three components: a Hello protocol helping share the network topology information, a routing algorithm to select a set of suitable paths and establish the routing table and a link state update mechanism helping keep the routing table newly. Experiments and evaluation demonstrates the validity and effectiveness of the proposed routing scheme.

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

NASA Technical Reports Server (NTRS)

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.

A characterization of the coupled evolution of grain fabric and pore space using complex networks: Pore connectivity and optimized flows in the presence of shear bands

NASA Astrophysics Data System (ADS)

Russell, Scott; Walker, David M.; Tordesillas, Antoinette

2016-03-01

A framework for the multiscale characterization of the coupled evolution of the solid grain fabric and its associated pore space in dense granular media is developed. In this framework, a pseudo-dual graph transformation of the grain contact network produces a graph of pores which can be readily interpreted as a pore space network. Survivability, a new metric succinctly summarizing the connectivity of the solid grain and pore space networks, measures material robustness. The size distribution and the connectivity of pores can be characterized quantitatively through various network properties. Assortativity characterizes the pore space with respect to the parity of the number of particles enclosing the pore. Multiscale clusters of odd parity versus even parity contact cycles alternate spatially along the shear band: these represent, respectively, local jamming and unjamming regions that continually switch positions in time throughout the failure regime. Optimal paths, established using network shortest paths in favor of large pores, provide clues on preferential paths for interstitial matter transport. In systems with higher rolling resistance at contacts, less tortuous shortest paths thread through larger pores in shear bands. Notably the structural patterns uncovered in the pore space suggest that more robust models of interstitial pore flow through deforming granular systems require a proper consideration of the evolution of in situ shear band and fracture patterns - not just globally, but also inside these localized failure zones.

An Experiment of GMPLS-Based Dispersion Compensation Control over In-Field Fibers

NASA Astrophysics Data System (ADS)

Seno, Shoichiro; Horiuchi, Eiichi; Yoshida, Sota; Sugihara, Takashi; Onohara, Kiyoshi; Kamei, Misato; Baba, Yoshimasa; Kubo, Kazuo; Mizuochi, Takashi

As ROADMs (Reconfigurable Optical Add/Drop Multiplexers) are becoming widely used in metro/core networks, distributed control of wavelength paths by extended GMPLS (Generalized MultiProtocol Label Switching) protocols has attracted much attention. For the automatic establishment of an arbitrary wavelength path satisfying dynamic traffic demands over a ROADM or WXC (Wavelength Cross Connect)-based network, precise determination of chromatic dispersion over the path and optimized assignment of dispersion compensation capabilities at related nodes are essential. This paper reports an experiment over in-field fibers where GMPLS-based control was applied for the automatic discovery of chromatic dispersion, path computation, and wavelength path establishment with dynamic adjustment of variable dispersion compensation. The GMPLS-based control scheme, which the authors called GMPLS-Plus, extended GMPLS's distributed control architecture with attributes for automatic discovery, advertisement, and signaling of chromatic dispersion. In this experiment, wavelength paths with distances of 24km and 360km were successfully established and error-free data transmission was verified. The experiment also confirmed path restoration with dynamic compensation adjustment upon fiber failure.

Effective use of congestion in complex networks

NASA Astrophysics Data System (ADS)

Echagüe, Juan; Cholvi, Vicent; Kowalski, Dariusz R.

2018-03-01

In this paper, we introduce a congestion-aware routing protocol that selects the paths according to the congestion of nodes in the network. The aim is twofold: on one hand, and in order to prevent the networks from collapsing, it provides a good tolerance to nodes' overloads; on the other hand, and in order to guarantee efficient communication, it also incentivize the routes to follow short paths. We analyze the performance of our proposed routing strategy by means of a series of experiments carried out by using simulations. We show that it provides a tolerance to collapse close to the optimal value. Furthermore, the average length of the paths behaves optimally up to the certain value of packet generation rate ρ and it grows in a linear fashion with the increase of ρ.

Retrieval and Validation of Zenith and Slant Path Delays From the Irish GPS Network

NASA Astrophysics Data System (ADS)

Hanafin, Jennifer; Jennings, S. Gerard; O'Dowd, Colin; McGrath, Ray; Whelan, Eoin

2010-05-01

Retrieval of atmospheric integrated water vapour (IWV) from ground-based GPS receivers and provision of this data product for meteorological applications has been the focus of a number of Europe-wide networks and projects, most recently the EUMETNET GPS water vapour programme. The results presented here are from a project to provide such information about the state of the atmosphere around Ireland for climate monitoring and improved numerical weather prediction. Two geodetic reference GPS receivers have been deployed at Valentia Observatory in Co. Kerry and Mace Head Atmospheric Research Station in Co. Galway, Ireland. These two receivers supplement the existing Ordnance Survey Ireland active network of 17 permanent ground-based receivers. A system to retrieve column-integrated atmospheric water vapour from the data provided by this network has been developed, based on the GPS Analysis at MIT (GAMIT) software package. The data quality of the zenith retrievals has been assessed using co-located radiosondes at the Valentia site and observations from a microwave profiling radiometer at the Mace Head site. Validation of the slant path retrievals requires a numerical weather prediction model and HIRLAM (High-Resolution Limited Area Model) version 7.2, the current operational forecast model in use at Met Éireann for the region, has been used for this validation work. Results from the data processing and comparisons with the independent observations and model will be presented.

The SIMRAND methodology: Theory and application for the simulation of research and development projects

NASA Technical Reports Server (NTRS)

Miles, R. F., Jr.

1986-01-01

A research and development (R&D) project often involves a number of decisions that must be made concerning which subset of systems or tasks are to be undertaken to achieve the goal of the R&D project. To help in this decision making, SIMRAND (SIMulation of Research ANd Development Projects) is a methodology for the selection of the optimal subset of systems or tasks to be undertaken on an R&D project. Using alternative networks, the SIMRAND methodology models the alternative subsets of systems or tasks under consideration. Each path through an alternative network represents one way of satisfying the project goals. Equations are developed that relate the system or task variables to the measure of reference. Uncertainty is incorporated by treating the variables of the equations probabilistically as random variables, with cumulative distribution functions assessed by technical experts. Analytical techniques of probability theory are used to reduce the complexity of the alternative networks. Cardinal utility functions over the measure of preference are assessed for the decision makers. A run of the SIMRAND Computer I Program combines, in a Monte Carlo simulation model, the network structure, the equations, the cumulative distribution functions, and the utility functions.

Current-flow efficiency of networks

NASA Astrophysics Data System (ADS)

Liu, Kai; Yan, Xiaoyong

2018-02-01

Many real-world networks, from infrastructure networks to social and communication networks, can be formulated as flow networks. How to realistically measure the transport efficiency of these networks is of fundamental importance. The shortest-path-based efficiency measurement has limitations, as it assumes that flow travels only along those shortest paths. Here, we propose a new metric named current-flow efficiency, in which we calculate the average reciprocal effective resistance between all pairs of nodes in the network. This metric takes the multipath effect into consideration and is more suitable for measuring the efficiency of many real-world flow equilibrium networks. Moreover, this metric can handle a disconnected graph and can thus be used to identify critical nodes and edges from the efficiency-loss perspective. We further analyze how the topological structure affects the current-flow efficiency of networks based on some model and real-world networks. Our results enable a better understanding of flow networks and shed light on the design and improvement of such networks with higher transport efficiency.

Modelling rapid subsurface flow at the hillslope scale with explicit representation of preferential flow paths

NASA Astrophysics Data System (ADS)

Wienhöfer, J.; Zehe, E.

2012-04-01

Rapid lateral flow processes via preferential flow paths are widely accepted to play a key role for rainfall-runoff response in temperate humid headwater catchments. A quantitative description of these processes, however, is still a major challenge in hydrological research, not least because detailed information about the architecture of subsurface flow paths are often impossible to obtain at a natural site without disturbing the system. Our study combines physically based modelling and field observations with the objective to better understand how flow network configurations influence the hydrological response of hillslopes. The system under investigation is a forested hillslope with a small perennial spring at the study area Heumöser, a headwater catchment of the Dornbirnerach in Vorarlberg, Austria. In-situ points measurements of field-saturated hydraulic conductivity and dye staining experiments at the plot scale revealed that shrinkage cracks and biogenic macropores function as preferential flow paths in the fine-textured soils of the study area, and these preferential flow structures were active in fast subsurface transport of artificial tracers at the hillslope scale. For modelling of water and solute transport, we followed the approach of implementing preferential flow paths as spatially explicit structures of high hydraulic conductivity and low retention within the 2D process-based model CATFLOW. Many potential configurations of the flow path network were generated as realisations of a stochastic process informed by macropore characteristics derived from the plot scale observations. Together with different realisations of soil hydraulic parameters, this approach results in a Monte Carlo study. The model setups were used for short-term simulation of a sprinkling and tracer experiment, and the results were evaluated against measured discharges and tracer breakthrough curves. Although both criteria were taken for model evaluation, still several model setups produced acceptable matches to the observed behaviour. These setups were selected for long-term simulation, the results of which were compared against water level measurements at two piezometers along the hillslope and the integral discharge response of the spring to reject some non-behavioural model setups and further reduce equifinality. The results of this study indicate that process-based modelling can provide a means to distinguish preferential flow networks on the hillslope scale when complementary measurements to constrain the range of behavioural model setups are available. These models can further be employed as a virtual reality to investigate the characteristics of flow path architectures and explore effective parameterisations for larger scale applications.

Shortest path problem on a grid network with unordered intermediate points

NASA Astrophysics Data System (ADS)

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.

An experimental analysis on OSPF-TE convergence time

NASA Astrophysics Data System (ADS)

Huang, S.; Kitayama, K.; Cugini, F.; Paolucci, F.; Giorgetti, A.; Valcarenghi, L.; Castoldi, P.

2008-11-01

Open shortest path first (OSPF) protocol is commonly used as an interior gateway protocol (IGP) in MPLS and generalized MPLS (GMPLS) networks to determine the topology over which label-switched paths (LSPs) can be established. Traffic-engineering extensions (network states such as link bandwidth information, available wavelengths, signal quality, etc) have been recently enabled in OSPF (henceforth, called OSPF-TE) to support shortest path first (SPF) tree calculation upon different purposes, thus possibly achieving optimal path computation and helping improve resource utilization efficiency. Adding these features into routing phase can exploit the OSPF robustness, and no additional network component is required to manage the traffic-engineering information. However, this traffic-engineering enhancement also complicates OSPF behavior. Since network states change frequently upon the dynamic trafficengineered LSP setup and release, the network is easily driven from a stable state to unstable operating regimes. In this paper, we focus on studying the OSPF-TE stability in terms of convergence time. Convergence time is referred to the time spent by the network to go back to steady states upon any network state change. An external observation method (based on black-box method) is employed to estimate the convergence time. Several experimental test-beds are developed to emulate dynamic LSP setup/release, re-routing upon single-link failure. The experimental results show that with OSPF-TE the network requires more time to converge compared to the conventional OSPF protocol without TE extension. Especially, in case of wavelength-routed optical network (WRON), introducing per wavelength availability and wavelength continuity constraint to OSPF-TE suffers severe convergence time and a large number of advertised link state advertisements (LSAs). Our study implies that long convergence time and large number of LSAs flooded in the network might cause scalability problems in OSPF-TE and impose limitations on OSPF-TE applications. New solutions to mitigate the s convergence time and to reduce the amount of state information are desired in the future.

Meta-path based heterogeneous combat network link prediction

NASA Astrophysics Data System (ADS)

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.

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

PubMed Central

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

2013-01-01

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. PMID:24193100

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

PubMed

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.

Protecting core networks with dual-homing: A study on enhanced network availability, resource efficiency, and energy-savings

NASA Astrophysics Data System (ADS)

Abeywickrama, Sandu; Furdek, Marija; Monti, Paolo; Wosinska, Lena; Wong, Elaine

2016-12-01

Core network survivability affects the reliability performance of telecommunication networks and remains one of the most important network design considerations. This paper critically examines the benefits arising from utilizing dual-homing in the optical access networks to provide resource-efficient protection against link and node failures in the optical core segment. Four novel, heuristic-based RWA algorithms that provide dedicated path protection in networks with dual-homing are proposed and studied. These algorithms protect against different failure scenarios (i.e. single link or node failures) and are implemented with different optimization objectives (i.e., minimization of wavelength usage and path length). Results obtained through simulations and comparison with baseline architectures indicate that exploiting dual-homed architecture in the access segment can bring significant improvements in terms of core network resource usage, connection availability, and power consumption.

Group Centric Networking: A new Approach for Wireless Multi-Hop Networking to Enable the Internet of Things

DTIC Science & Technology

2015-11-11

reliable data message delivery. The basic mechanism of link-based routing schemes is the broadcasting of a control message (called a “ hello ”) to all of its...short- est path route to a destination by using the set of ex- changed hello messages between users of the network. With sufficiently high frequency... hello messages are suc- cessfully exchanged across a high error link, and since this link is of longer distance, it gets used to build a shortest path

Group Centric Networking: A new Approach for Wireless Multi-Hop Networking to Enable the Internet of Things

DTIC Science & Technology

2015-09-07

reliable data message delivery. The basic mechanism of link-based routing schemes is the broadcasting of a control message (called a “ hello ”) to all of its...short- est path route to a destination by using the set of ex- changed hello messages between users of the network. With sufficiently high frequency... hello messages are suc- cessfully exchanged across a high error link, and since this link is of longer distance, it gets used to build a shortest path

Federal Indian Law Internet Tools: "Indian Territory Cases" at the Oklahoma State Courts Network and Kappler's "Indian Affairs: Laws and Treaties" at the Oklahoma State University

ERIC Educational Resources Information Center

Bernholz, Charles D.

2004-01-01

In a thorough analysis of researching the regulation of the banking industry in the United States, Zoller (2000) demonstrated a number of paths among federal documents of various agencies within the Department of the Treasury, including the legislation that created these entities, and to relevant online resources. This latter opportunity included…

Interrelation of structure and operational states in cascading failure of overloading lines in power grids

NASA Astrophysics Data System (ADS)

Xue, Fei; Bompard, Ettore; Huang, Tao; Jiang, Lin; Lu, Shaofeng; Zhu, Huaiying

2017-09-01

As the modern power system is expected to develop to a more intelligent and efficient version, i.e. the smart grid, or to be the central backbone of energy internet for free energy interactions, security concerns related to cascading failures have been raised with consideration of catastrophic results. The researches of topological analysis based on complex networks have made great contributions in revealing structural vulnerabilities of power grids including cascading failure analysis. However, existing literature with inappropriate assumptions in modeling still cannot distinguish the effects between the structure and operational state to give meaningful guidance for system operation. This paper is to reveal the interrelation between network structure and operational states in cascading failure and give quantitative evaluation by integrating both perspectives. For structure analysis, cascading paths will be identified by extended betweenness and quantitatively described by cascading drop and cascading gradient. Furthermore, the operational state for cascading paths will be described by loading level. Then, the risk of cascading failure along a specific cascading path can be quantitatively evaluated considering these two factors. The maximum cascading gradient of all possible cascading paths can be used as an overall metric to evaluate the entire power grid for its features related to cascading failure. The proposed method is tested and verified on IEEE30-bus system and IEEE118-bus system, simulation evidences presented in this paper suggests that the proposed model can identify the structural causes for cascading failure and is promising to give meaningful guidance for the protection of system operation in the future.

An efficient routing strategy for traffic dynamics on two-layer complex networks

NASA Astrophysics Data System (ADS)

Ma, Jinlong; Wang, Huiling; Zhang, Zhuxi; Zhang, Yi; Duan, Congwen; Qi, Zhaohui; Liu, Yu

2018-05-01

In order to alleviate traffic congestion on multilayer networks, designing an efficient routing strategy is one of the most important ways. In this paper, a novel routing strategy is proposed to reduce traffic congestion on two-layer networks. In the proposed strategy, the optimal paths in the physical layer are chosen by comprehensively considering the roles of nodes’ degrees of the two layers. Both numerical and analytical results indicate that our routing strategy can reasonably redistribute the traffic load of the physical layer, and thus the traffic capacity of two-layer complex networks are significantly enhanced compared with the shortest path routing (SPR) and the global awareness routing (GAR) strategies. This study may shed some light on the optimization of networked traffic dynamics.

A computational approach to identify cellular heterogeneity and tissue-specific gene regulatory networks.

PubMed

Jambusaria, Ankit; Klomp, Jeff; Hong, Zhigang; Rafii, Shahin; Dai, Yang; Malik, Asrar B; Rehman, Jalees

2018-06-07

The heterogeneity of cells across tissue types represents a major challenge for studying biological mechanisms as well as for therapeutic targeting of distinct tissues. Computational prediction of tissue-specific gene regulatory networks may provide important insights into the mechanisms underlying the cellular heterogeneity of cells in distinct organs and tissues. Using three pathway analysis techniques, gene set enrichment analysis (GSEA), parametric analysis of gene set enrichment (PGSEA), alongside our novel model (HeteroPath), which assesses heterogeneously upregulated and downregulated genes within the context of pathways, we generated distinct tissue-specific gene regulatory networks. We analyzed gene expression data derived from freshly isolated heart, brain, and lung endothelial cells and populations of neurons in the hippocampus, cingulate cortex, and amygdala. In both datasets, we found that HeteroPath segregated the distinct cellular populations by identifying regulatory pathways that were not identified by GSEA or PGSEA. Using simulated datasets, HeteroPath demonstrated robustness that was comparable to what was seen using existing gene set enrichment methods. Furthermore, we generated tissue-specific gene regulatory networks involved in vascular heterogeneity and neuronal heterogeneity by performing motif enrichment of the heterogeneous genes identified by HeteroPath and linking the enriched motifs to regulatory transcription factors in the ENCODE database. HeteroPath assesses contextual bidirectional gene expression within pathways and thus allows for transcriptomic assessment of cellular heterogeneity. Unraveling tissue-specific heterogeneity of gene expression can lead to a better understanding of the molecular underpinnings of tissue-specific phenotypes.

Evaluation of Flow Paths and Confluences for Saltwater Intrusion and Its Influence on Fish Species Diversity in a Deltaic River Network

NASA Astrophysics Data System (ADS)

Shao, X.; Cui, B.; Zhang, Z.; Fang, Y.; Jawitz, J. W.

2016-12-01

Freshwater in a delta is often at risk of saltwater intrusion, which has been a serious issue in estuarine deltas all over the world. Salinity gradients and hydrologic connectivity in the deltas can be disturbed by saltwater intrusion, which can fluctuate frequently and locally in time and space to affect biotic processes and then to affect the distribution patterns of the riverine fishes throughout the river network. Therefore, identifying the major flow paths or locations at risk of saltwater intrusion in estuarine ecosystems is necessary for saltwater intrusion mitigation and fish species diversity conservation. In this study, we use the betweenness centrality (BC) as the weighted attribute of the river network to identify the critical confluences and detect the preferential flow paths for saltwater intrusion through the least-cost-path algorithm from graph theory approach. Moreover, we analyse the responses of the salinity and fish species diversity to the BC values of confluences calculated in the river network. Our results show that the most likely location of saltwater intrusion is not a simple gradient change from sea to land, but closely dependent on the river segments' characteristics. In addition, a significant positive correlation between the salinity and the BC values of confluences is determined in the Pearl River Delta. Changes in the BC values of confluences can produce significant variation in the fish species diversity. Therefore, the dynamics of saltwater intrusion are a growing consideration for understanding the patterns and subsequent processes driving fish community structure. Freshwater can be diverted into these major flow paths and critical confluences to improve river network management and conservation of fish species diversity under saltwater intrusion.

Efficient collective influence maximization in cascading processes with first-order transitions

PubMed Central

Pei, Sen; Teng, Xian; Shaman, Jeffrey; Morone, Flaviano; Makse, Hernán A.

2017-01-01

In many social and biological networks, the collective dynamics of the entire system can be shaped by a small set of influential units through a global cascading process, manifested by an abrupt first-order transition in dynamical behaviors. Despite its importance in applications, efficient identification of multiple influential spreaders in cascading processes still remains a challenging task for large-scale networks. Here we address this issue by exploring the collective influence in general threshold models of cascading process. Our analysis reveals that the importance of spreaders is fixed by the subcritical paths along which cascades propagate: the number of subcritical paths attached to each spreader determines its contribution to global cascades. The concept of subcritical path allows us to introduce a scalable algorithm for massively large-scale networks. Results in both synthetic random graphs and real networks show that the proposed method can achieve larger collective influence given the same number of seeds compared with other scalable heuristic approaches. PMID:28349988

Efficient collective influence maximization in cascading processes with first-order transitions

NASA Astrophysics Data System (ADS)

Pei, Sen; Teng, Xian; Shaman, Jeffrey; Morone, Flaviano; Makse, Hernán A.

2017-03-01

In many social and biological networks, the collective dynamics of the entire system can be shaped by a small set of influential units through a global cascading process, manifested by an abrupt first-order transition in dynamical behaviors. Despite its importance in applications, efficient identification of multiple influential spreaders in cascading processes still remains a challenging task for large-scale networks. Here we address this issue by exploring the collective influence in general threshold models of cascading process. Our analysis reveals that the importance of spreaders is fixed by the subcritical paths along which cascades propagate: the number of subcritical paths attached to each spreader determines its contribution to global cascades. The concept of subcritical path allows us to introduce a scalable algorithm for massively large-scale networks. Results in both synthetic random graphs and real networks show that the proposed method can achieve larger collective influence given the same number of seeds compared with other scalable heuristic approaches.

[Developing a home care nursing information system by utilizing wire-wireless network and mobile computing system].

PubMed

Park, Jung-Ho; Park, Sung-Ae; Yoon, Soon-Nyoung; Kang, Sung-Rye

2004-04-01

The purpose of this study was to develop a home care nursing network system for operating home care effectively and efficiently by utilizing a wire-wireless network and mobile computing in order to record and send patients' data in real time, and by combining the headquarter office and the local offices with home care nurses over the Internet. It complements the preceding research from 1999 by adding home care nursing standard guidelines and upgrading the PDA program. Method/1 and Prototyping were adopted to develop the main network system. The detailed research process is as follows : 1)home care nursing standard guidelines for Diabetes, cancer and peritoneal-dialysis were added in 12 domains of nursing problem fields with nursing assessment/intervention algorithms. 2) complementing the PDA program was done by omitting and integrating the home care nursing algorithm path which is unnecessary and duplicated. Also, upgrading the PDA system was done by utilizing the machinery and tools where the PDA and the data transmission modem are integrated, CDMX-1X base construction, in order to reduce a transmission error or transmission failure.

Centrality and Flow Vergence gradient based Path analysis of scientific literature: A case study of Biotechnology for Engineering

NASA Astrophysics Data System (ADS)

Lathabai, Hiran H.; Prabhakaran, Thara; Changat, Manoj

2015-07-01

Biotechnology, ever since its inception has had a huge impact on the society and its various applications have been intricately woven into the human web of life. Its evolution amidst all the other research realms vital to mankind is remarkable. In this paper, we intend to identify the radical innovations in Biotechnology for Engineering using network analyses. Centrality analysis and Path analysis are used for identifying important works. Existence of Flow Vergence effect in the scientific literature is revealed. Flow Vergence gradient, an arc metric derived from FV model, is utilised for Path analysis which detects pivotal papers of paradigm shift more accurately. A major paradigm shift has been identified in the business models of Biotechnology for Engineering - 'Capability to Connectivity' model. Evidence towards the adoption of business practices in BT firms by nanotechnology start-ups is also identified. The notion of critical divergence is introduced and the exhibition of interdisciplinary interaction in emerging fields due to critical divergence is discussed. Implications of above analyses which target: (i) Science and technology policy makers, (ii) industrialists and investors, (iii) researchers in academia as well as industry, are also discussed.

Toward Agent-Based Models of the Development And Evolution of Business Relations and Networks

NASA Astrophysics Data System (ADS)

Wilkinson, Ian F.; Marks, Robert E.; Young, Louise

Firms achieve competitive advantage in part through the development of cooperative relations with other firms and organisations. We describe a program of research designed to map and model the development of cooperative inter-firm relations, including the processes and paths by which firms may evolve from adversarial to more cooperative relations. Narrative-event-history methods will be used to develop stylised histories of the emergence of business relations in various contexts and to identify relevant causal mechanisms to be included in the agent-based models of relationship and network evolution. The relationship histories will provide the means of assuring the agent-based models developed.

Network-Based Management Procedures.

ERIC Educational Resources Information Center

Buckner, Allen L.

Network-based management procedures serve as valuable aids in organizational management, achievement of objectives, problem solving, and decisionmaking. Network techniques especially applicable to educational management systems are the program evaluation and review technique (PERT) and the critical path method (CPM). Other network charting…

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

Hagberg, Aric; Swart, Pieter; S Chult, Daniel

NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides data structures for representing many types of networks, or graphs, including simple graphs, directed graphs, and graphs with parallel edges and self loops. The nodes in NetworkX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibility mades NetworkX ideal for representing networks found in many different scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network properties and structure measures: shortest paths, betweenness centrality, clustering, and degree distributionmore » and many more. NetworkX can read and write various graph formats for eash exchange with existing data, and provides generators for many classic graphs and popular graph models, such as the Erdoes-Renyi, Small World, and Barabasi-Albert models, are included. The ease-of-use and flexibility of the Python programming language together with connection to the SciPy tools make NetworkX a powerful tool for scientific computations. We discuss some of our recent work studying synchronization of coupled oscillators to demonstrate how NetworkX enables research in the field of computational networks.« less

Voices from Left of the Dial:* Reflections of Practice-Based Researchers

PubMed Central

Fagnan, Lyle J.; Handley, Margaret A.; Rollins, Nancy; Mold, James

2010-01-01

Background Purpose Practice-Based Research Networks (PBRNs) provide an important approach to implementing primary care research at the community level, thus increasing the relevance and utility of research findings for routine primary care practices. PBRNs expend considerable time and energy in the recruitment, engagement, and retention of network clinicians and practices to establish this community-based primary care research laboratory. This study assessed factors motivating PBRN clinicians to participate and stay involved in practice-based research in their primary care office setting. Methods We invited practicing clinicians across the United States who are affiliated with a PBRN to share their stories regarding motivations to participate in practice-based research. Using qualitative methods, we categorized the stories into the main motivation for participation and the perceived impact of participation. Results We collected 37 stories from clinicians affiliated with 12 PBRNS located in 14 states. Motivations for participation in practice-based research included themes associated with personal satisfaction, improving local clinic-based care, and contributing to community and system level improvements. Sources of personal satisfaction corresponded to the three psychological needs postulated by Deci's and Ryan's Self-Determination Theory: competence, autonomy, and relatedness. Conclusions These PBRN clinician stories describe the values, motivations and unique paths that clinicians took as they chose to participate and stay active in a practice-based research network. Their voices have the potential to influence others to participate in practice-based research. PMID:20616286

System for testing properties of a network

DOEpatents

Rawle, Michael; Bartholomew, David B.; Soares, Marshall A.

2009-06-16

A method for identifying properties of a downhole electromagnetic network in a downhole tool sting, including the step of providing an electromagnetic path intermediate a first location and a second location on the electromagnetic network. The method further includes the step of providing a receiver at the second location. The receiver includes a known reference. The analog signal includes a set amplitude, a set range of frequencies, and a set rate of change between the frequencies. The method further includes the steps of sending the analog signal, and passively modifying the signal. The analog signal is sent from the first location through the electromagnetic path, and the signal is modified by the properties of the electromagnetic path. The method further includes the step of receiving a modified signal at the second location and comparing the known reference to the modified signal.

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

PubMed

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.

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

NASA Astrophysics Data System (ADS)

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.

Integration of Hierarchical Goal Network Planning and Autonomous Path Planning

DTIC Science & Technology

2016-03-01

Conference on Robotics and Automation (ICRA); 2010 May 3– 7; Anchorage, AK. p. 2902–2908. 4. Ayan NF, Kuter U, Yaman F, Goldman RP. Hotride...DISTRIBUTION/AVAILABILITY STATEMENT Approved for public release; distribution unlimited. 13. SUPPLEMENTARY NOTES 14. ABSTRACT Automated planning has...world robotic systems. This report documents work to integrate a hierarchical goal network planning algorithm with low-level path planning. The system

The data-driven null models for information dissemination tree in social networks

NASA Astrophysics Data System (ADS)

Zhang, Zhiwei; Wang, Zhenyu

2017-10-01

For the purpose of detecting relatedness and co-occurrence between users, as well as the distribution features of nodes in spreading path of a social network, this paper explores topological characteristics of information dissemination trees (IDT) that can be employed indirectly to probe the information dissemination laws within social networks. Hence, three different null models of IDT are presented in this article, including the statistical-constrained 0-order IDT null model, the random-rewire-broken-edge 0-order IDT null model and the random-rewire-broken-edge 2-order IDT null model. These null models firstly generate the corresponding randomized copy of an actual IDT; then the extended significance profile, which is developed by adding the cascade ratio of information dissemination path, is exploited not only to evaluate degree correlation of two nodes associated with an edge, but also to assess the cascade ratio of different length of information dissemination paths. The experimental correspondences of the empirical analysis for several SinaWeibo IDTs and Twitter IDTs indicate that the IDT null models presented in this paper perform well in terms of degree correlation of nodes and dissemination path cascade ratio, which can be better to reveal the features of information dissemination and to fit the situation of real social networks.

The drug target genes show higher evolutionary conservation than non-target genes.

PubMed

Lv, Wenhua; Xu, Yongdeng; Guo, Yiying; Yu, Ziqi; Feng, Guanglong; Liu, Panpan; Luan, Meiwei; Zhu, Hongjie; Liu, Guiyou; Zhang, Mingming; Lv, Hongchao; Duan, Lian; Shang, Zhenwei; Li, Jin; Jiang, Yongshuai; Zhang, Ruijie

2016-01-26

Although evidence indicates that drug target genes share some common evolutionary features, there have been few studies analyzing evolutionary features of drug targets from an overall level. Therefore, we conducted an analysis which aimed to investigate the evolutionary characteristics of drug target genes. We compared the evolutionary conservation between human drug target genes and non-target genes by combining both the evolutionary features and network topological properties in human protein-protein interaction network. The evolution rate, conservation score and the percentage of orthologous genes of 21 species were included in our study. Meanwhile, four topological features including the average shortest path length, betweenness centrality, clustering coefficient and degree were considered for comparison analysis. Then we got four results as following: compared with non-drug target genes, 1) drug target genes had lower evolutionary rates; 2) drug target genes had higher conservation scores; 3) drug target genes had higher percentages of orthologous genes and 4) drug target genes had a tighter network structure including higher degrees, betweenness centrality, clustering coefficients and lower average shortest path lengths. These results demonstrate that drug target genes are more evolutionarily conserved than non-drug target genes. We hope that our study will provide valuable information for other researchers who are interested in evolutionary conservation of drug targets.

Topics on data transmission problem in software definition network

NASA Astrophysics Data System (ADS)

Gao, Wei; Liang, Li; Xu, Tianwei; Gan, Jianhou

2017-08-01

In normal computer networks, the data transmission between two sites go through the shortest path between two corresponding vertices. However, in the setting of software definition network (SDN), it should monitor the network traffic flow in each site and channel timely, and the data transmission path between two sites in SDN should consider the congestion in current networks. Hence, the difference of available data transmission theory between normal computer network and software definition network is that we should consider the prohibit graph structures in SDN, and these forbidden subgraphs represent the sites and channels in which data can't be passed by the serious congestion. Inspired by theoretical analysis of an available data transmission in SDN, we consider some computational problems from the perspective of the graph theory. Several results determined in the paper imply the sufficient conditions of data transmission in SDN in the various graph settings.

Netest: A Tool to Measure the Maximum Burst Size, Available Bandwidth and Achievable Throughput

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

Jin, Guojun; Tierney, Brian

2003-01-31

Distinguishing available bandwidth and achievable throughput is essential for improving network applications' performance. Achievable throughput is the throughput considering a number of factors such as network protocol, host speed, network path, and TCP buffer space, where as available bandwidth only considers the network path. Without understanding this difference, trying to improve network applications' performance is like ''blind men feeling the elephant'' [4]. In this paper, we define and distinguish bandwidth and throughput, and debate which part of each is achievable and which is available. Also, we introduce and discuss a new concept - Maximum Burst Size that is crucial tomore » the network performance and bandwidth sharing. A tool, netest, is introduced to help users to determine the available bandwidth, and provides information to achieve better throughput with fairness of sharing the available bandwidth, thus reducing misuse of the network.« less

Genetic Algorithm for Solving Fuzzy Shortest Path Problem in a Network with mixed fuzzy arc lengths

NASA Astrophysics Data System (ADS)

Mahdavi, Iraj; Tajdin, Ali; Hassanzadeh, Reza; Mahdavi-Amiri, Nezam; Shafieian, Hosna

2011-06-01

We are concerned with the design of a model and an algorithm for computing a shortest path in a network having various types of fuzzy arc lengths. First, we develop a new technique for the addition of various fuzzy numbers in a path using α -cuts by proposing a linear least squares model to obtain membership functions for the considered additions. Then, using a recently proposed distance function for comparison of fuzzy numbers. we propose a new approach to solve the fuzzy APSPP using of genetic algorithm. Examples are worked out to illustrate the applicability of the proposed model.

Localizing Global Medicine: Challenges and Opportunities in Cervical Screening in an Indigenous Community in Ecuador.

PubMed

Nugus, Peter; Désalliers, Julie; Morales, Juana; Graves, Lisa; Evans, Andrea; Macaulay, Ann C

2018-04-01

This participatory research study examines the tensions and opportunities in accessing allopathic medicine, or biomedicine, in the context of a cervical cancer screening program in a rural indigenous community of Northern Ecuador. Focusing on the influence of social networks, the article extends research on "re-appropriation" of biomedicine. It does so by recognizing two competing tensions expressed through social interactions: suspicion of allopathic medicine and the desire to maximize one's health. Semistructured individual interviews and focus groups were conducted with 28 women who had previously participated in a government-sponsored cervical screening program. From inductive thematic analysis, the article traces these women's active agency in navigating coherent paths of health. Despite drawing on social networks to overcome formidable challenges, the participants faced enduring system obstacles-the organizational effects of the networks of allopathic medicine. Such obstacles need to be understood to reconcile competing knowledge systems and improve health care access in underresourced communities.

Topological versus rheological entanglement length in primitive-path analysis protocols, tube models, and slip-link models

NASA Astrophysics Data System (ADS)

Everaers, Ralf

2012-08-01

We show that the front factor appearing in the shear modulus of a phantom network, Gph=(1-2/f)(ρkBT)/Ns, also controls the ratio of the strand length, Ns, and the number of monomers per Kuhn length of the primitive paths, NphPPKuhn, characterizing the average network conformation. In particular, NphPPKuhn=Ns/(1-2/f) and Gph=(ρkBT)/NphPPKuhn. Neglecting the difference between cross-links and slip-links, these results can be transferred to entangled systems and the interpretation of primitive path analysis data. In agreement with the tube model, the analogy to phantom networks suggest that the rheological entanglement length, Nerheo=(ρkBT)/Ge, should equal NePPKuhn. Assuming binary entanglements with f=4 functional junctions, we expect that Nerheo should be twice as large as the topological entanglement length, Netopo. These results are in good agreement with reported primitive path analysis results for model systems and a wide range of polymeric materials. Implications for tube and slip-link models are discussed.

Minimum expected delay-based routing protocol (MEDR) for Delay Tolerant Mobile Sensor Networks.

PubMed

Feng, Yong; Liu, Ming; Wang, Xiaomin; Gong, Haigang

2010-01-01

It is a challenging work to develop efficient routing protocols for Delay Tolerant Mobile Sensor Networks (DTMSNs), which have several unique characteristics such as sensor mobility, intermittent connectivity, energy limit, and delay tolerability. In this paper, we propose a new routing protocol called Minimum Expected Delay-based Routing (MEDR) tailored for DTMSNs. MEDR achieves a good routing performance by finding and using the connected paths formed dynamically by mobile sensors. In MEDR, each sensor maintains two important parameters: Minimum Expected Delay (MED) and its expiration time. According to MED, messages will be delivered to the sensor that has at least a connected path with their hosting nodes, and has the shortest expected delay to communication directly with the sink node. Because of the changing network topology, the path is fragile and volatile, so we use the expiration time of MED to indicate the valid time of the path, and avoid wrong transmissions. Simulation results show that the proposed MEDR achieves a higher message delivery ratio with lower transmission overhead and data delivery delay than other DTMSN routing approaches.

Heterogeneous Data Fusion Method to Estimate Travel Time Distributions in Congested Road Networks

PubMed Central

Lam, William H. K.; Li, Qingquan

2017-01-01

Travel times in congested urban road networks are highly stochastic. Provision of travel time distribution information, including both mean and variance, can be very useful for travelers to make reliable path choice decisions to ensure higher probability of on-time arrival. To this end, a heterogeneous data fusion method is proposed to estimate travel time distributions by fusing heterogeneous data from point and interval detectors. In the proposed method, link travel time distributions are first estimated from point detector observations. The travel time distributions of links without point detectors are imputed based on their spatial correlations with links that have point detectors. The estimated link travel time distributions are then fused with path travel time distributions obtained from the interval detectors using Dempster-Shafer evidence theory. Based on fused path travel time distribution, an optimization technique is further introduced to update link travel time distributions and their spatial correlations. A case study was performed using real-world data from Hong Kong and showed that the proposed method obtained accurate and robust estimations of link and path travel time distributions in congested road networks. PMID:29210978

Heterogeneous Data Fusion Method to Estimate Travel Time Distributions in Congested Road Networks.

PubMed

Shi, Chaoyang; Chen, Bi Yu; Lam, William H K; Li, Qingquan

2017-12-06

Travel times in congested urban road networks are highly stochastic. Provision of travel time distribution information, including both mean and variance, can be very useful for travelers to make reliable path choice decisions to ensure higher probability of on-time arrival. To this end, a heterogeneous data fusion method is proposed to estimate travel time distributions by fusing heterogeneous data from point and interval detectors. In the proposed method, link travel time distributions are first estimated from point detector observations. The travel time distributions of links without point detectors are imputed based on their spatial correlations with links that have point detectors. The estimated link travel time distributions are then fused with path travel time distributions obtained from the interval detectors using Dempster-Shafer evidence theory. Based on fused path travel time distribution, an optimization technique is further introduced to update link travel time distributions and their spatial correlations. A case study was performed using real-world data from Hong Kong and showed that the proposed method obtained accurate and robust estimations of link and path travel time distributions in congested road networks.

WEAMR — A Weighted Energy Aware Multipath Reliable Routing Mechanism for Hotline-Based WSNs

PubMed Central

Tufail, Ali; Qamar, Arslan; Khan, Adil Mehmood; Baig, Waleed Akram; Kim, Ki-Hyung

2013-01-01

Reliable source to sink communication is the most important factor for an efficient routing protocol especially in domains of military, healthcare and disaster recovery applications. We present weighted energy aware multipath reliable routing (WEAMR), a novel energy aware multipath routing protocol which utilizes hotline-assisted routing to meet such requirements for mission critical applications. The protocol reduces the number of average hops from source to destination and provides unmatched reliability as compared to well known reactive ad hoc protocols i.e., AODV and AOMDV. Our protocol makes efficient use of network paths based on weighted cost calculation and intelligently selects the best possible paths for data transmissions. The path cost calculation considers end to end number of hops, latency and minimum energy node value in the path. In case of path failure path recalculation is done efficiently with minimum latency and control packets overhead. Our evaluation shows that our proposal provides better end-to-end delivery with less routing overhead and higher packet delivery success ratio compared to AODV and AOMDV. The use of multipath also increases overall life time of WSN network using optimum energy available paths between sender and receiver in WDNs. PMID:23669714

WEAMR-a weighted energy aware multipath reliable routing mechanism for hotline-based WSNs.

PubMed

Tufail, Ali; Qamar, Arslan; Khan, Adil Mehmood; Baig, Waleed Akram; Kim, Ki-Hyung

2013-05-13

Reliable source to sink communication is the most important factor for an efficient routing protocol especially in domains of military, healthcare and disaster recovery applications. We present weighted energy aware multipath reliable routing (WEAMR), a novel energy aware multipath routing protocol which utilizes hotline-assisted routing to meet such requirements for mission critical applications. The protocol reduces the number of average hops from source to destination and provides unmatched reliability as compared to well known reactive ad hoc protocols i.e., AODV and AOMDV. Our protocol makes efficient use of network paths based on weighted cost calculation and intelligently selects the best possible paths for data transmissions. The path cost calculation considers end to end number of hops, latency and minimum energy node value in the path. In case of path failure path recalculation is done efficiently with minimum latency and control packets overhead. Our evaluation shows that our proposal provides better end-to-end delivery with less routing overhead and higher packet delivery success ratio compared to AODV and AOMDV. The use of multipath also increases overall life time of WSN network using optimum energy available paths between sender and receiver in WDNs.

The impact of self-driving cars on existing transportation networks

NASA Astrophysics Data System (ADS)

Ji, Xiang

2018-04-01

In this paper, considering the usage of self-driving, I research the congestion problems of traffic networks from both macro and micro levels. Firstly, the macroscopic mathematical model is established using the Greenshields function, analytic hierarchy process and Monte Carlo simulation, where the congestion level is divided into five levels according to the average vehicle speed. The roads with an obvious congestion situation is investigated mainly and the traffic flow and topology of the roads are analyzed firstly. By processing the data, I propose a traffic congestion model. In the model, I assume that half of the non-self-driving cars only take the shortest route and the other half can choose the path randomly. While self-driving cars can obtain vehicle density data of each road and choose the path more reasonable. When the path traffic density exceeds specific value, it cannot be selected. To overcome the dimensional differences of data, I rate the paths by BORDA sorting. The Monte Carlo simulation of Cellular Automaton is used to obtain the negative feedback information of the density of the traffic network, where the vehicles are added into the road network one by one. I then analyze the influence of negative feedback information on path selection of intelligent cars. The conclusion is that the increase of the proportion of intelligent vehicles will make the road load more balanced, and the self-driving cars can avoid the peak and reduce the degree of road congestion. Combined with other models, the optimal self-driving ratio is about sixty-two percent. From the microscopic aspect, by using the single-lane traffic NS rule, another model is established to analyze the road Partition scheme. The self-driving traffic is more intelligent, and their cooperation can reduce the random deceleration probability. By the model, I get the different self-driving ratio of space-time distribution. I also simulate the case of making a lane separately for self-driving, compared to the former model. It is concluded that a single lane is more efficient in a certain interval. However, it is not recommended to offer a lane separately. However, the self-driving also faces the problem of hacker attacks and greater damage after fault. So, when self-driving ratio is higher than a certain value, the increase of traffic flow rate is small. In this article, that value is discussed, and the optimal proportion is determined. Finally, I give a nontechnical explanation of the problem.

Visualization and Hierarchical Analysis of Flow in Discrete Fracture Network Models

NASA Astrophysics Data System (ADS)

Aldrich, G. A.; Gable, C. W.; Painter, S. L.; Makedonska, N.; Hamann, B.; Woodring, J.

2013-12-01

Flow and transport in low permeability fractured rock is primary in interconnected fracture networks. Prediction and characterization of flow and transport in fractured rock has important implications in underground repositories for hazardous materials (eg. nuclear and chemical waste), contaminant migration and remediation, groundwater resource management, and hydrocarbon extraction. We have developed methods to explicitly model flow in discrete fracture networks and track flow paths using passive particle tracking algorithms. Visualization and analysis of particle trajectory through the fracture network is important to understanding fracture connectivity, flow patterns, potential contaminant pathways and fast paths through the network. However, occlusion due to the large number of highly tessellated and intersecting fracture polygons preclude the effective use of traditional visualization methods. We would also like quantitative analysis methods to characterize the trajectory of a large number of particle paths. We have solved these problems by defining a hierarchal flow network representing the topology of particle flow through the fracture network. This approach allows us to analyses the flow and the dynamics of the system as a whole. We are able to easily query the flow network, and use paint-and-link style framework to filter the fracture geometry and particle traces based on the flow analytics. This allows us to greatly reduce occlusion while emphasizing salient features such as the principal transport pathways. Examples are shown that demonstrate the methodology and highlight how use of this new method allows quantitative analysis and characterization of flow and transport in a number of representative fracture networks.

Logical optical line terminal technologies towards flexible and highly reliable metro- and access-integrated networks

NASA Astrophysics Data System (ADS)

Okamoto, Satoru; Sato, Takehiro; Yamanaka, Naoaki

2017-01-01

In this paper, flexible and highly reliable metro and access integrated networks with network virtualization and software defined networking technologies will be presented. Logical optical line terminal (L-OLT) technologies and active optical distribution networks (ODNs) are the key to introduce flexibility and high reliability into the metro and access integrated networks. In the Elastic Lambda Aggregation Network (EλAN) project which was started in 2012, a concept of the programmable optical line terminal (P-OLT) has been proposed. A role of the P-OLT is providing multiple network services that have different protocols and quality of service requirements by single OLT box. Accommodated services will be Internet access, mobile front-haul/back-haul, data-center access, and leased line. L-OLTs are configured within the P-OLT box to support the functions required for each network service. Multiple P-OLTs and programmable optical network units (P-ONUs) are connected by the active ODN. Optical access paths which have flexible capacity are set on the ODN to provide network services from L-OLT to logical ONUs (L-ONUs). The L-OLT to L-ONU path on the active ODN provides a logical connection. Therefore, introducing virtualization technologies becomes possible. One example is moving an L-OLT from one P-OLT to another P-OLT like a virtual machine. This movement is called L-OLT migration. The L-OLT migration provides flexible and reliable network functions such as energy saving by aggregating L-OLTs to a limited number of P-OLTs, and network wide optical access path restoration. Other L-OLT virtualization technologies and experimental results will be also discussed in the paper.

Marine Vehicle Sensor Network Architecture and Protocol Designs for Ocean Observation

PubMed Central

Zhang, Shaowei; Yu, Jiancheng; Zhang, Aiqun; Yang, Lei; Shu, Yeqiang

2012-01-01

The micro-scale and meso-scale ocean dynamic processes which are nonlinear and have large variability, have a significant impact on the fisheries, natural resources, and marine climatology. A rapid, refined and sophisticated observation system is therefore needed in marine scientific research. The maneuverability and controllability of mobile sensor platforms make them a preferred choice to establish ocean observing networks, compared to the static sensor observing platform. In this study, marine vehicles are utilized as the nodes of mobile sensor networks for coverage sampling of a regional ocean area and ocean feature tracking. A synoptic analysis about marine vehicle dynamic control, multi vehicles mission assignment and path planning methods, and ocean feature tracking and observing techniques is given. Combined with the observation plan in the South China Sea, we provide an overview of the mobile sensor networks established with marine vehicles, and the corresponding simulation results. PMID:22368475

Nursing work stress: the impacts of social network structure and organizational citizenship behavior.

PubMed

Tsang, Seng-Su; Chen, Tzu-Yin; Wang, Shih-Fong; Tai, Hsin-Ling

2012-03-01

The nursing workplace imposes significantly more stress on its employees than other workplace settings. Organizational resources, both physical and psychological, have been recognized in prior studies as important alleviators of nursing workplace stress. Whereas physical resources are less difficult to manipulate because of their tangibility, psychological resources, particularly psychological support from colleagues, are typically not deployed to greatest effect. This article investigated the alleviation of nursing work stress using resources already extant in coworker social networks. Researchers conducted a survey in a dialysis department at a medical center located in Taipei City, Taiwan. This survey measured nurse work stress, satisfaction, organizational citizenship behavior (OCB) and social network structures. Researchers employed UCINET to analyze the network structure data, which were in dyadic matrix format to estimate nurse network centralities and used partial least squares analysis to estimate research construct path coefficients and test extrapolated hypotheses. The level of OCB induced by nurse social ties was satisfactory and did not only directly increased work satisfaction but also alleviated work stress, which indirectly boosted work satisfaction. Findings suggest that managers may be able to use social network analysis to identify persons appropriate to conduct the distribution of organizational resources. Choosing those with multiple social connections can help distribute resources effectively and induce higher OCB levels within the organization. In addition, staff with strong friendship network connections may provide appropriate psychological resources (support) to coworkers. If those with high friendship network centrality receive proper counseling training, they should be in a good position to provide assistance when needed.

Evaluating the transport, health and economic impacts of new urban cycling infrastructure in Sydney, Australia – protocol paper

PubMed Central

2013-01-01

Background There are repeated calls to build better cycling paths in Australian cities if the proportion of people cycling is to increase. Yet the full range of transport, health, environmental and economic impacts of new cycling infrastructure and the extent to which observed changes are sustained is not well understood. The City of Sydney is currently building a new bicycle network, which includes a new bicycle path separated from road traffic in the south Sydney area. This protocol paper describes a comprehensive method to evaluate this new cycling infrastructure. Method A cohort of residents within two kilometres of the new bicycle path will be surveyed at baseline before a new section of bicycle path is built, and again 12 and 24 months later to assess changes in travel behaviour, sense of community, quality of life and health behaviours. Residents in a comparable area of Sydney that will not get a new separated bike path will act as a comparison group. At baseline a sub-set of residents who volunteer will also take a small GPS device with them for one week to assess travel behaviour. Discussion This research should contribute to the advancement in evaluation and appraisal methods for cycling projects. PMID:24131667

Spectrum efficient distance-adaptive paths for fixed and fixed-alternate routing in elastic optical networks

NASA Astrophysics Data System (ADS)

Agrawal, Anuj; Bhatia, Vimal; Prakash, Shashi

2018-01-01

Efficient utilization of spectrum is a key concern in the soon to be deployed elastic optical networks (EONs). To perform routing in EONs, various fixed routing (FR), and fixed-alternate routing (FAR) schemes are ubiquitously used. FR, and FAR schemes calculate a fixed route, and a prioritized list of a number of alternate routes, respectively, between different pairs of origin o and target t nodes in the network. The route calculation performed using FR and FAR schemes is predominantly based on either the physical distance, known as k -shortest paths (KSP), or on the hop count (HC). For survivable optical networks, FAR usually calculates link-disjoint (LD) paths. These conventional routing schemes have been efficiently used for decades in communication networks. However, in this paper, it has been demonstrated that these commonly used routing schemes cannot utilize the network spectral resources optimally in the newly introduced EONs. Thus, we propose a new routing scheme for EON, namely, k -distance adaptive paths (KDAP) that efficiently utilizes the benefit of distance-adaptive modulation, and bit rate-adaptive superchannel capability inherited by EON to improve spectrum utilization. In the proposed KDAP, routes are found and prioritized on the basis of bit rate, distance, spectrum granularity, and the number of links used for a particular route. To evaluate the performance of KSP, HC, LD, and the proposed KDAP, simulations have been performed for three different sized networks, namely, 7-node test network (TEST7), NSFNET, and 24-node US backbone network (UBN24). We comprehensively assess the performance of various conventional, and the proposed routing schemes by solving both the RSA and the dual RSA problems under homogeneous and heterogeneous traffic requirements. Simulation results demonstrate that there is a variation amongst the performance of KSP, HC, and LD, depending on the o - t pair, and the network topology and its connectivity. However, the proposed KDAP always performs better for all the considered networks and traffic scenarios, as compared to the conventional routing schemes, namely, KSP, HC, and LD. The proposed KDAP achieves up to 60 % , and 10.46 % improvement in terms of spectrum utilization, and resource utilization ratio, respectively, over the conventional routing schemes.

Brain-machine interface control of a manipulator using small-world neural network and shared control strategy.

PubMed

Li, Ting; Hong, Jun; Zhang, Jinhua; Guo, Feng

2014-03-15

The improvement of the resolution of brain signal and the ability to control external device has been the most important goal in BMI research field. This paper describes a non-invasive brain-actuated manipulator experiment, which defined a paradigm for the motion control of a serial manipulator based on motor imagery and shared control. The techniques of component selection, spatial filtering and classification of motor imagery were involved. Small-world neural network (SWNN) was used to classify five brain states. To verify the effectiveness of the proposed classifier, we replace the SWNN classifier by a radial basis function (RBF) networks neural network, a standard multi-layered feed-forward backpropagation network (SMN) and a multi-SVM classifier, with the same features for the classification. The results also indicate that the proposed classifier achieves a 3.83% improvement over the best results of other classifiers. We proposed a shared control method consisting of two control patterns to expand the control of BMI from the software angle. The job of path building for reaching the 'end' point was designated as an assessment task. We recorded all paths contributed by subjects and picked up relevant parameters as evaluation coefficients. With the assistance of two control patterns and series of machine learning algorithms, the proposed BMI originally achieved the motion control of a manipulator in the whole workspace. According to experimental results, we confirmed the feasibility of the proposed BMI method for 3D motion control of a manipulator using EEG during motor imagery. Copyright © 2013 Elsevier B.V. All rights reserved.

Proactive routing mutation against stealthy Distributed Denial of Service attacks: metrics, modeling, and analysis

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

Duan, Qi; Al-Shaer, Ehab; Chatterjee, Samrat

The Infrastructure Distributed Denial of Service (IDDoS) attacks continue to be one of the most devastating challenges facing cyber systems. The new generation of IDDoS attacks exploit the inherent weakness of cyber infrastructure including deterministic nature of routes, skew distribution of flows, and Internet ossification to discover the network critical links and launch highly stealthy flooding attacks that are not observable at the victim end. In this paper, first, we propose a new metric to quantitatively measure the potential susceptibility of any arbitrary target server or domain to stealthy IDDoS attacks, and es- timate the impact of such susceptibility onmore » enterprises. Second, we develop a proactive route mutation technique to minimize the susceptibility to these attacks by dynamically changing the flow paths periodically to invalidate the adversary knowledge about the network and avoid targeted critical links. Our proposed approach actively changes these network paths while satisfying security and qualify of service requirements. We present an integrated approach of proactive route mutation that combines both infrastructure-based mutation that is based on reconfiguration of switches and routers, and middle-box approach that uses an overlay of end-point proxies to construct a virtual network path free of critical links to reach a destination. We implemented the proactive path mutation technique on a Software Defined Network using the OpendDaylight controller to demonstrate a feasible deployment of this approach. Our evaluation validates the correctness, effectiveness, and scalability of the proposed approaches.« less

An optimal routing strategy on scale-free networks

NASA Astrophysics Data System (ADS)

Yang, Yibo; Zhao, Honglin; Ma, Jinlong; Qi, Zhaohui; Zhao, Yongbin

Traffic is one of the most fundamental dynamical processes in networked systems. With the traditional shortest path routing (SPR) protocol, traffic congestion is likely to occur on the hub nodes on scale-free networks. In this paper, we propose an improved optimal routing (IOR) strategy which is based on the betweenness centrality and the degree centrality of nodes in the scale-free networks. With the proposed strategy, the routing paths can accurately bypass hub nodes in the network to enhance the transport efficiency. Simulation results show that the traffic capacity as well as some other indexes reflecting transportation efficiency are further improved with the IOR strategy. Owing to the significantly improved traffic performance, this study is helpful to design more efficient routing strategies in communication or transportation systems.

Selective epidemic vaccination under the performant routing algorithms

NASA Astrophysics Data System (ADS)

Bamaarouf, O.; Alweimine, A. Ould Baba; Rachadi, A.; EZ-Zahraouy, H.

2018-04-01

Despite the extensive research on traffic dynamics and epidemic spreading, the effect of the routing algorithms strategies on the traffic-driven epidemic spreading has not received an adequate attention. It is well known that more performant routing algorithm strategies are used to overcome the congestion problem. However, our main result shows unexpectedly that these algorithms favor the virus spreading more than the case where the shortest path based algorithm is used. In this work, we studied the virus spreading in a complex network using the efficient path and the global dynamic routing algorithms as compared to shortest path strategy. Some previous studies have tried to modify the routing rules to limit the virus spreading, but at the expense of reducing the traffic transport efficiency. This work proposed a solution to overcome this drawback by using a selective vaccination procedure instead of a random vaccination used often in the literature. We found that the selective vaccination succeeded in eradicating the virus better than a pure random intervention for the performant routing algorithm strategies.

Exploring the full catalytic cycle of rhodium(i)–BINAP-catalysed isomerisation of allylic amines: a graph theory approach for path optimisation† †Electronic supplementary information (ESI) available. See DOI: 10.1039/c7sc00401j Click here for additional data file.

PubMed Central

Yoshimura, Takayoshi; Taketsugu, Tetsuya; Sawamura, Masaya

2017-01-01

We explored the reaction mechanism of the cationic rhodium(i)–BINAP complex catalysed isomerisation of allylic amines using the artificial force induced reaction method with the global reaction route mapping strategy, which enabled us to search for various reaction paths without assumption of transition states. The entire reaction network was reproduced in the form of a graph, and reasonable paths were selected from the complicated network using Prim’s algorithm. As a result, a new dissociative reaction mechanism was proposed. Our comprehensive reaction path search provided rationales for the E/Z and S/R selectivities of the stereoselective reaction. PMID:28970877

A graph-based system for network-vulnerability analysis

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

Swiler, L.P.; Phillips, C.

1998-06-01

This paper presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The graph-based tool can identify the set of attack paths that have a high probability of success (or a low effort cost) for the attacker. The system could be used to test the effectiveness of making configuration changes, implementing an intrusion detection system, etc. The analysis system requires as input a database of common attacks,more » broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level-of-effort for the attacker, various graph algorithms such as shortest-path algorithms can identify the attack paths with the highest probability of success.« less

Identifying influential spreaders in complex networks through local effective spreading paths

NASA Astrophysics Data System (ADS)

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.

Grey matter networks in people at increased familial risk for schizophrenia.

PubMed

Tijms, Betty M; Sprooten, Emma; Job, Dominic; Johnstone, Eve C; Owens, David G C; Willshaw, David; Seriès, Peggy; Lawrie, Stephen M

2015-10-01

Grey matter brain networks are disrupted in schizophrenia, but it is still unclear at which point during the development of the illness these disruptions arise and whether these can be associated with behavioural predictors of schizophrenia. We investigated if single-subject grey matter networks were disrupted in a sample of people at familial risk of schizophrenia. Single-subject grey matter networks were extracted from structural MRI scans of 144 high risk subjects, 32 recent-onset patients and 36 healthy controls. The following network properties were calculated: size, connectivity density, degree, path length, clustering coefficient, betweenness centrality and small world properties. People at risk of schizophrenia showed decreased path length and clustering in mostly prefrontal and temporal areas. Within the high risk sample, the path length of the posterior cingulate cortex and the betweenness centrality of the left inferior frontal operculum explained 81% of the variance in schizotypal cognitions, which was previously shown to be the strongest behavioural predictor of schizophrenia in the study. In contrast, local grey matter volume measurements explained 48% of variance in schizotypy. The present results suggest that single-subject grey matter networks can quantify behaviourally relevant biological alterations in people at increased risk for schizophrenia before disease onset. Copyright © 2015 Elsevier B.V. All rights reserved.

Information Spread of Emergency Events: Path Searching on Social Networks

PubMed Central

Hu, Hongzhi; Wu, Tunan

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. PMID:24600323

Surface Hold Advisor Using Critical Sections

NASA Technical Reports Server (NTRS)

Law, Caleb Hoi Kei (Inventor); Hsiao, Thomas Kun-Lung (Inventor); Mittler, Nathan C. (Inventor); Couluris, George J. (Inventor)

2013-01-01

The Surface Hold Advisor Using Critical Sections is a system and method for providing hold advisories to surface controllers to prevent gridlock and resolve crossing and merging conflicts among vehicles traversing a vertex-edge graph representing a surface traffic network on an airport surface. The Advisor performs pair-wise comparisons of current position and projected path of each vehicle with other surface vehicles to detect conflicts, determine critical sections, and provide hold advisories to traffic controllers recommending vehicles stop at entry points to protected zones around identified critical sections. A critical section defines a segment of the vertex-edge graph where vehicles are in crossing or merging or opposite direction gridlock contention. The Advisor detects critical sections without reference to scheduled, projected or required times along assigned vehicle paths, and generates hold advisories to prevent conflicts without requiring network path direction-of-movement rules and without requiring rerouting, rescheduling or other network optimization solutions.

Cross-layer shared protection strategy towards data plane in software defined optical networks

NASA Astrophysics Data System (ADS)

Xiong, Yu; Li, Zhiqiang; Zhou, Bin; Dong, Xiancun

2018-04-01

In order to ensure reliable data transmission on the data plane and minimize resource consumption, a novel protection strategy towards data plane is proposed in software defined optical networks (SDON). Firstly, we establish a SDON architecture with hierarchical structure of data plane, which divides the data plane into four layers for getting fine-grained bandwidth resource. Then, we design the cross-layer routing and resource allocation based on this network architecture. Through jointly considering the bandwidth resource on all the layers, the SDN controller could allocate bandwidth resource to working path and backup path in an economical manner. Next, we construct auxiliary graphs and transform the shared protection problem into the graph vertex coloring problem. Therefore, the resource consumption on backup paths can be reduced further. The simulation results demonstrate that the proposed protection strategy can achieve lower protection overhead and higher resource utilization ratio.

A DNA-based molecular motor that can navigate a network of tracks

NASA Astrophysics Data System (ADS)

Wickham, Shelley F. J.; Bath, Jonathan; Katsuda, Yousuke; Endo, Masayuki; Hidaka, Kumi; Sugiyama, Hiroshi; Turberfield, Andrew J.

2012-03-01

Synthetic molecular motors can be fuelled by the hydrolysis or hybridization of DNA. Such motors can move autonomously and programmably, and long-range transport has been observed on linear tracks. It has also been shown that DNA systems can compute. Here, we report a synthetic DNA-based system that integrates long-range transport and information processing. We show that the path of a motor through a network of tracks containing four possible routes can be programmed using instructions that are added externally or carried by the motor itself. When external control is used we find that 87% of the motors follow the correct path, and when internal control is used 71% of the motors follow the correct path. Programmable motion will allow the development of computing networks, molecular systems that can sort and process cargoes according to instructions that they carry, and assembly lines that can be reconfigured dynamically in response to changing demands.

A new network representation of the metabolism to detect chemical transformation modules.

PubMed

Sorokina, Maria; Medigue, Claudine; Vallenet, David

2015-11-14

Metabolism is generally modeled by directed networks where nodes represent reactions and/or metabolites. In order to explore metabolic pathway conservation and divergence among organisms, previous studies were based on graph alignment to find similar pathways. Few years ago, the concept of chemical transformation modules, also called reaction modules, was introduced and correspond to sequences of chemical transformations which are conserved in metabolism. We propose here a novel graph representation of the metabolic network where reactions sharing a same chemical transformation type are grouped in Reaction Molecular Signatures (RMS). RMS were automatically computed for all reactions and encode changes in atoms and bonds. A reaction network containing all available metabolic knowledge was then reduced by an aggregation of reaction nodes and edges to obtain a RMS network. Paths in this network were explored and a substantial number of conserved chemical transformation modules was detected. Furthermore, this graph-based formalism allows us to define several path scores reflecting different biological conservation meanings. These scores are significantly higher for paths corresponding to known metabolic pathways and were used conjointly to build association rules that should predict metabolic pathway types like biosynthesis or degradation. This representation of metabolism in a RMS network offers new insights to capture relevant metabolic contexts. Furthermore, along with genomic context methods, it should improve the detection of gene clusters corresponding to new metabolic pathways.

Characteristics of real futures trading networks

NASA Astrophysics Data System (ADS)

Wang, Junjie; Zhou, Shuigeng; Guan, Jihong

2011-01-01

Futures trading is the core of futures business, and it is considered as one of the typical complex systems. To investigate the complexity of futures trading, we employ the analytical method of complex networks. First, we use real trading records from the Shanghai Futures Exchange to construct futures trading networks, in which nodes are trading participants, and two nodes have a common edge if the two corresponding investors appear simultaneously in at least one trading record as a purchaser and a seller, respectively. Then, we conduct a comprehensive statistical analysis on the constructed futures trading networks. Empirical results show that the futures trading networks exhibit features such as scale-free behavior with interesting odd-even-degree divergence in low-degree regions, small-world effect, hierarchical organization, power-law betweenness distribution, disassortative mixing, and shrinkage of both the average path length and the diameter as network size increases. To the best of our knowledge, this is the first work that uses real data to study futures trading networks, and we argue that the research results can shed light on the nature of real futures business.

The semantic distance task: Quantifying semantic distance with semantic network path length.

PubMed

Kenett, Yoed N; Levi, Effi; Anaki, David; Faust, Miriam

2017-09-01

Semantic distance is a determining factor in cognitive processes, such as semantic priming, operating upon semantic memory. The main computational approach to compute semantic distance is through latent semantic analysis (LSA). However, objections have been raised against this approach, mainly in its failure at predicting semantic priming. We propose a novel approach to computing semantic distance, based on network science methodology. Path length in a semantic network represents the amount of steps needed to traverse from 1 word in the network to the other. We examine whether path length can be used as a measure of semantic distance, by investigating how path length affect performance in a semantic relatedness judgment task and recall from memory. Our results show a differential effect on performance: Up to 4 steps separating between word-pairs, participants exhibit an increase in reaction time (RT) and decrease in the percentage of word-pairs judged as related. From 4 steps onward, participants exhibit a significant decrease in RT and the word-pairs are dominantly judged as unrelated. Furthermore, we show that as path length between word-pairs increases, success in free- and cued-recall decreases. Finally, we demonstrate how our measure outperforms computational methods measuring semantic distance (LSA and positive pointwise mutual information) in predicting participants RT and subjective judgments of semantic strength. Thus, we provide a computational alternative to computing semantic distance. Furthermore, this approach addresses key issues in cognitive theory, namely the breadth of the spreading activation process and the effect of semantic distance on memory retrieval. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

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

PubMed

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.

A dataset on human navigation strategies in foreign networked systems.

PubMed

Kőrösi, Attila; Csoma, Attila; Rétvári, Gábor; Heszberger, Zalán; Bíró, József; Tapolcai, János; Pelle, István; Klajbár, Dávid; Novák, Márton; Halasi, Valentina; Gulyás, András

2018-03-13

Humans are involved in various real-life networked systems. The most obvious examples are social and collaboration networks but the language and the related mental lexicon they use, or the physical map of their territory can also be interpreted as networks. How do they find paths between endpoints in these networks? How do they obtain information about a foreign networked world they find themselves in, how they build mental model for it and how well they succeed in using it? Large, open datasets allowing the exploration of such questions are hard to find. Here we report a dataset collected by a smartphone application, in which players navigate between fixed length source and destination English words step-by-step by changing only one letter at a time. The paths reflect how the players master their navigation skills in such a foreign networked world. The dataset can be used in the study of human mental models for the world around us, or in a broader scope to investigate the navigation strategies in complex networked systems.

Direct and Indirect Influence of Altruistic Behavior in a Social Network.

PubMed

Liu, Pei-Pei; Safin, Vasiliy; Yang, Barry; Luhmann, Christian C

2015-01-01

Prior research has suggested that recipients of generosity behave more generously themselves (a direct social influence). In contrast, there is conflicting evidence about the existence of indirect influence (i.e., whether interacting with a recipient of generosity causes one to behave more generously), casting doubt on the possibility that altruistic behavior can cascade through social networks. The current study investigated how far selfish and generous behavior can be transmitted through social networks and the cognitive mechanisms that underlie such transmission. Participants played a sequence of public goods games comprising a chain network. This network is advantageous because it permits only a single, unambiguous path of influence. Furthermore, we experimentally manipulated the behavior of the first link in the chain to be either generous or selfish. Results revealed the presence of direct social influence, but no evidence for indirect influence. Results also showed that selfish behavior exerted a substantially greater influence than generous behavior. Finally, expectations about future partners' behavior strongly mediated the observed social influence, suggesting an adaptive basis for such influence.

Ecological Networks in Stored Grain: Key Postharvest Nodes for Emerging Pests, Pathogens, and Mycotoxins.

PubMed

Hernandez Nopsa, John F; Daglish, Gregory J; Hagstrum, David W; Leslie, John F; Phillips, Thomas W; Scoglio, Caterina; Thomas-Sharma, Sara; Walter, Gimme H; Garrett, Karen A

2015-10-01

Wheat is at peak quality soon after harvest. Subsequently, diverse biota use wheat as a resource in storage, including insects and mycotoxin-producing fungi. Transportation networks for stored grain are crucial to food security and provide a model system for an analysis of the population structure, evolution, and dispersal of biota in networks. We evaluated the structure of rail networks for grain transport in the United States and Eastern Australia to identify the shortest paths for the anthropogenic dispersal of pests and mycotoxins, as well as the major sources, sinks, and bridges for movement. We found important differences in the risk profile in these two countries and identified priority control points for sampling, detection, and management. An understanding of these key locations and roles within the network is a new type of basic research result in postharvest science and will provide insights for the integrated pest management of high-risk subpopulations, such as pesticide-resistant insect pests.

Ecological Networks in Stored Grain: Key Postharvest Nodes for Emerging Pests, Pathogens, and Mycotoxins

PubMed Central

Hernandez Nopsa, John F.; Daglish, Gregory J.; Hagstrum, David W.; Leslie, John F.; Phillips, Thomas W.; Scoglio, Caterina; Thomas-Sharma, Sara; Walter, Gimme H.; Garrett, Karen A.

2015-01-01

Wheat is at peak quality soon after harvest. Subsequently, diverse biota use wheat as a resource in storage, including insects and mycotoxin-producing fungi. Transportation networks for stored grain are crucial to food security and provide a model system for an analysis of the population structure, evolution, and dispersal of biota in networks. We evaluated the structure of rail networks for grain transport in the United States and Eastern Australia to identify the shortest paths for the anthropogenic dispersal of pests and mycotoxins, as well as the major sources, sinks, and bridges for movement. We found important differences in the risk profile in these two countries and identified priority control points for sampling, detection, and management. An understanding of these key locations and roles within the network is a new type of basic research result in postharvest science and will provide insights for the integrated pest management of high-risk subpopulations, such as pesticide-resistant insect pests. PMID:26955074

Complex quantum network geometries: Evolution and phase transitions

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao

2015-08-01

Networks are topological and geometric structures used to describe systems as different as the Internet, the brain, or the quantum structure of space-time. Here we define complex quantum network geometries, describing the underlying structure of growing simplicial 2-complexes, i.e., simplicial complexes formed by triangles. These networks are geometric networks with energies of the links that grow according to a nonequilibrium dynamics. The evolution in time of the geometric networks is a classical evolution describing a given path of a path integral defining the evolution of quantum network states. The quantum network states are characterized by quantum occupation numbers that can be mapped, respectively, to the nodes, links, and triangles incident to each link of the network. We call the geometric networks describing the evolution of quantum network states the quantum geometric networks. The quantum geometric networks have many properties common to complex networks, including small-world property, high clustering coefficient, high modularity, and scale-free degree distribution. Moreover, they can be distinguished between the Fermi-Dirac network and the Bose-Einstein network obeying, respectively, the Fermi-Dirac and Bose-Einstein statistics. We show that these networks can undergo structural phase transitions where the geometrical properties of the networks change drastically. Finally, we comment on the relation between quantum complex network geometries, spin networks, and triangulations.

Complex quantum network geometries: Evolution and phase transitions.

PubMed

Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao

2015-08-01

Networks are topological and geometric structures used to describe systems as different as the Internet, the brain, or the quantum structure of space-time. Here we define complex quantum network geometries, describing the underlying structure of growing simplicial 2-complexes, i.e., simplicial complexes formed by triangles. These networks are geometric networks with energies of the links that grow according to a nonequilibrium dynamics. The evolution in time of the geometric networks is a classical evolution describing a given path of a path integral defining the evolution of quantum network states. The quantum network states are characterized by quantum occupation numbers that can be mapped, respectively, to the nodes, links, and triangles incident to each link of the network. We call the geometric networks describing the evolution of quantum network states the quantum geometric networks. The quantum geometric networks have many properties common to complex networks, including small-world property, high clustering coefficient, high modularity, and scale-free degree distribution. Moreover, they can be distinguished between the Fermi-Dirac network and the Bose-Einstein network obeying, respectively, the Fermi-Dirac and Bose-Einstein statistics. We show that these networks can undergo structural phase transitions where the geometrical properties of the networks change drastically. Finally, we comment on the relation between quantum complex network geometries, spin networks, and triangulations.

Designing Networks that are Capable of Self-Healing and Adapting

DTIC Science & Technology

2017-04-01

from statistical mechanics, combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we... principles for self-healing networks, and applications, and construct an all-possible-paths model for network adaptation. 2015-11-16 UNIT CONVERSION...combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we will undertake the fol

Self-organized topology of recurrence-based complex networks

NASA Astrophysics Data System (ADS)

Yang, Hui; Liu, Gang

2013-12-01

With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article is to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., "what is the self-organizing geometry of a recurrence network?" and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.

Self-organized topology of recurrence-based complex networks.

PubMed

Yang, Hui; Liu, Gang

2013-12-01

With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article is to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., "what is the self-organizing geometry of a recurrence network?" and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.

Self-organized topology of recurrence-based complex networks

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

Yang, Hui, E-mail: huiyang@usf.edu; Liu, Gang

With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article ismore » to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., “what is the self-organizing geometry of a recurrence network?” and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.« less

A multipath routing protocol based on clustering and ant colony optimization for wireless sensor networks.

PubMed

Yang, Jing; Xu, Mai; Zhao, Wei; Xu, Baoguo

2010-01-01

For monitoring burst events in a kind of reactive wireless sensor networks (WSNs), a multipath routing protocol (MRP) based on dynamic clustering and ant colony optimization (ACO) is proposed. Such an approach can maximize the network lifetime and reduce the energy consumption. An important attribute of WSNs is their limited power supply, and therefore some metrics (such as energy consumption of communication among nodes, residual energy, path length) were considered as very important criteria while designing routing in the MRP. Firstly, a cluster head (CH) is selected among nodes located in the event area according to some parameters, such as residual energy. Secondly, an improved ACO algorithm is applied in the search for multiple paths between the CH and sink node. Finally, the CH dynamically chooses a route to transmit data with a probability that depends on many path metrics, such as energy consumption. The simulation results show that MRP can prolong the network lifetime, as well as balance of energy consumption among nodes and reduce the average energy consumption effectively.

Analyzing and interpreting genome data at the network level with ConsensusPathDB.

PubMed

Herwig, Ralf; Hardt, Christopher; Lienhard, Matthias; Kamburov, Atanas

2016-10-01

ConsensusPathDB consists of a comprehensive collection of human (as well as mouse and yeast) molecular interaction data integrated from 32 different public repositories and a web interface featuring a set of computational methods and visualization tools to explore these data. This protocol describes the use of ConsensusPathDB (http://consensuspathdb.org) with respect to the functional and network-based characterization of biomolecules (genes, proteins and metabolites) that are submitted to the system either as a priority list or together with associated experimental data such as RNA-seq. The tool reports interaction network modules, biochemical pathways and functional information that are significantly enriched by the user's input, applying computational methods for statistical over-representation, enrichment and graph analysis. The results of this protocol can be observed within a few minutes, even with genome-wide data. The resulting network associations can be used to interpret high-throughput data mechanistically, to characterize and prioritize biomarkers, to integrate different omics levels, to design follow-up functional assay experiments and to generate topology for kinetic models at different scales.

Spatio-temporal networks: reachability, centrality and robustness.

PubMed

Williams, Matthew J; Musolesi, Mirco

2016-06-01

Recent advances in spatial and temporal networks have enabled researchers to more-accurately describe many real-world systems such as urban transport networks. In this paper, we study the response of real-world spatio-temporal networks to random error and systematic attack, taking a unified view of their spatial and temporal performance. We propose a model of spatio-temporal paths in time-varying spatially embedded networks which captures the property that, as in many real-world systems, interaction between nodes is non-instantaneous and governed by the space in which they are embedded. Through numerical experiments on three real-world urban transport systems, we study the effect of node failure on a network's topological, temporal and spatial structure. We also demonstrate the broader applicability of this framework to three other classes of network. To identify weaknesses specific to the behaviour of a spatio-temporal system, we introduce centrality measures that evaluate the importance of a node as a structural bridge and its role in supporting spatio-temporally efficient flows through the network. This exposes the complex nature of fragility in a spatio-temporal system, showing that there is a variety of failure modes when a network is subject to systematic attacks.

Understanding the Relationship Between PTSD and Social Support: The Role of Negative Network Orientation

PubMed Central

Clapp, Joshua D.; Beck, J. Gayle

2009-01-01

Network orientation is conceptualized as an individual’s attitudes and expectations regarding the usefulness of support networks in coping with stress. The present research examined the potential for network orientation to explicate the well documented association between posttraumatic stress disorder (PTSD) and attenuated social support. Data collected from survivors of serious motor vehicle trauma (N = 458) were used to test the hypothesis that severity of PTSD would hold a significant indirect relationship with social support through negative network orientation. Childhood victimization and elapsed time from the accident were examined as potential moderators of this indirect relationship. Consistent with hypotheses, path analyses demonstrated a significant indirect relationship between PTSD and social support through negative network orientation. Specifically, this indirect effect was the result of a direct association between PTSD severity and negative network orientation and an inverse association between negative network orientation and social support. This pattern of relationships was invariant across mode of PTSD assessment (interview vs. self-report). No moderation effects were noted. These data suggest that network orientation may be an important factor in understanding interface of interpersonal processes and posttrauma pathology. PMID:19162260

Graph configuration model based evaluation of the education-occupation match

PubMed Central

2018-01-01

To study education—occupation matchings we developed a bipartite network model of education to work transition and a graph configuration model based metric. We studied the career paths of 15 thousand Hungarian students based on the integrated database of the National Tax Administration, the National Health Insurance Fund, and the higher education information system of the Hungarian Government. A brief analysis of gender pay gap and the spatial distribution of over-education is presented to demonstrate the background of the research and the resulted open dataset. We highlighted the hierarchical and clustered structure of the career paths based on the multi-resolution analysis of the graph modularity. The results of the cluster analysis can support policymakers to fine-tune the fragmented program structure of higher education. PMID:29509783

Graph configuration model based evaluation of the education-occupation match.

PubMed

Gadar, Laszlo; Abonyi, Janos

2018-01-01

To study education-occupation matchings we developed a bipartite network model of education to work transition and a graph configuration model based metric. We studied the career paths of 15 thousand Hungarian students based on the integrated database of the National Tax Administration, the National Health Insurance Fund, and the higher education information system of the Hungarian Government. A brief analysis of gender pay gap and the spatial distribution of over-education is presented to demonstrate the background of the research and the resulted open dataset. We highlighted the hierarchical and clustered structure of the career paths based on the multi-resolution analysis of the graph modularity. The results of the cluster analysis can support policymakers to fine-tune the fragmented program structure of higher education.

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

NASA Astrophysics Data System (ADS)

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

2014-04-01

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

Impact of indoor environment on path loss in body area networks.

PubMed

Hausman, Sławomir; Januszkiewicz, Łukasz

2014-10-20

In this paper the influence of an example indoor environment on narrowband radio channel path loss for body area networks operating around 2.4 GHz is investigated using computer simulations and on-site measurements. In contrast to other similar studies, the simulation model included both a numerical human body phantom and its environment-room walls, floor and ceiling. As an example, radio signal attenuation between two different configurations of transceivers with dipole antennas placed in a direct vicinity of a human body (on-body scenario) is analyzed by computer simulations for several types of reflecting environments. In the analyzed case the propagation environments comprised a human body and office room walls. As a reference environment for comparison, free space with only a conducting ground plane, modelling a steel mesh reinforced concrete floor, was chosen. The transmitting and receiving antennas were placed in two on-body configurations chest-back and chest-arm. Path loss vs. frequency simulation results obtained using Finite Difference Time Domain (FDTD) method and a multi-tissue anthropomorphic phantom were compared to results of measurements taken with a vector network analyzer with a human subject located in an average-size empty cuboidal office room. A comparison of path loss values in different environments variants gives some qualitative and quantitative insight into the adequacy of simplified indoor environment model for the indoor body area network channel representation.

Impact of Indoor Environment on Path Loss in Body Area Networks

PubMed Central

Hausman, Sławomir; Januszkiewicz, Łukasz

2014-01-01

In this paper the influence of an example indoor environment on narrowband radio channel path loss for body area networks operating around 2.4 GHz is investigated using computer simulations and on-site measurements. In contrast to other similar studies, the simulation model included both a numerical human body phantom and its environment—room walls, floor and ceiling. As an example, radio signal attenuation between two different configurations of transceivers with dipole antennas placed in a direct vicinity of a human body (on-body scenario) is analyzed by computer simulations for several types of reflecting environments. In the analyzed case the propagation environments comprised a human body and office room walls. As a reference environment for comparison, free space with only a conducting ground plane, modelling a steel mesh reinforced concrete floor, was chosen. The transmitting and receiving antennas were placed in two on-body configurations chest–back and chest–arm. Path loss vs. frequency simulation results obtained using Finite Difference Time Domain (FDTD) method and a multi-tissue anthropomorphic phantom were compared to results of measurements taken with a vector network analyzer with a human subject located in an average-size empty cuboidal office room. A comparison of path loss values in different environments variants gives some qualitative and quantitative insight into the adequacy of simplified indoor environment model for the indoor body area network channel representation. PMID:25333289

A neuro-collision avoidance strategy for robot manipulators

NASA Technical Reports Server (NTRS)

Onema, Joel P.; Maclaunchlan, Robert A.

1992-01-01

The area of collision avoidance and path planning in robotics has received much attention in the research community. Our study centers on a combination of an artificial neural network paradigm with a motion planning strategy that insures safe motion of the Articulated Two-Link Arm with Scissor Hand System relative to an object. Whenever an obstacle is encountered, the arm attempts to slide along the obstacle surface, thereby avoiding collision by means of the local tangent strategy and its artificial neural network implementation. This combination compensates the inverse kinematics of a robot manipulator. Simulation results indicate that a neuro-collision avoidance strategy can be achieved by means of a learning local tangent method.

The predictive power of local properties of financial networks

NASA Astrophysics Data System (ADS)

Caraiani, Petre

2017-01-01

The literature on analyzing the dynamics of financial networks has focused so far on the predictive power of global measures of networks like entropy or index cohesive force. In this paper, I show that the local network properties have similar predictive power. I focus on key network measures like average path length, average degree or cluster coefficient, and also consider the diameter and the s-metric. Using Granger causality tests, I show that some of these measures have statistically significant prediction power with respect to the dynamics of aggregate stock market. Average path length is most robust relative to the frequency of data used or specification (index or growth rate). Most measures are found to have predictive power only for monthly frequency. Further evidences that support this view are provided through a simple regression model.

Curvature and torsion in growing actin networks

NASA Astrophysics Data System (ADS)

Shaevitz, Joshua W.; Fletcher, Daniel A.

2008-06-01

Intracellular pathogens such as Listeria monocytogenes and Rickettsia rickettsii move within a host cell by polymerizing a comet-tail of actin fibers that ultimately pushes the cell forward. This dense network of cross-linked actin polymers typically exhibits a striking curvature that causes bacteria to move in gently looping paths. Theoretically, tail curvature has been linked to details of motility by considering force and torque balances from a finite number of polymerizing filaments. Here we track beads coated with a prokaryotic activator of actin polymerization in three dimensions to directly quantify the curvature and torsion of bead motility paths. We find that bead paths are more likely to have low rather than high curvature at any given time. Furthermore, path curvature changes very slowly in time, with an autocorrelation decay time of 200 s. Paths with a small radius of curvature, therefore, remain so for an extended period resulting in loops when confined to two dimensions. When allowed to explore a three-dimensional (3D) space, path loops are less evident. Finally, we quantify the torsion in the bead paths and show that beads do not exhibit a significant left- or right-handed bias to their motion in 3D. These results suggest that paths of actin-propelled objects may be attributed to slow changes in curvature, possibly associated with filament debranching, rather than a fixed torque.

Coordinated path following of multiple underacutated marine surface vehicles along one curve.

PubMed

Liu, Lu; Wang, Dan; Peng, Zhouhua

2016-09-01

This paper investigates the coordinated path following problem for a fleet of underactuated marine surface vehicles (MSVs) along one curve. The dedicated control design is divided into two tasks. One is to steer individual underactuated MSV to track the given spatial path, and the other is to force the vehicles dispersed on a parameterized path subject to the constraints of a communication network. Specifically, a robust individual path following controller is developed based on a line-of-sight (LOS) guidance law and a reduced-order extended state observer (ESO). The vehicle sideslip angle due to environmental disturbances can be exactly identified. Then, the vehicle coordination is achieved by a path variable containment approach, under which the path variables are evenly dispersed between two virtual leaders. Another reduced-order ESO is developed to identify the composite disturbance related to the speed of virtual leaders and neighboring vehicles. The proposed coordination design is distributed since the reference speed does not need to be known by all vehicles as a priori. The input-to-state stability of the closed-loop network system is established via cascade theory. Simulation results demonstrate the effectiveness of the proposed design method. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

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

PubMed Central

Dung, Le The; Hieu, Tran Dinh; Choi, Seong-Gon; Kim, Byung-Seo; An, Beongku

2017-01-01

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. PMID:28346377

Bioprinting: Functional droplet networks

NASA Astrophysics Data System (ADS)

Durmus, Naside Gozde; Tasoglu, Savas; Demirci, Utkan

2013-06-01

Tissue-mimicking printed networks of droplets separated by lipid bilayers that can be functionalized with membrane proteins are able to spontaneously fold and transmit electrical currents along predefined paths.

A Revised Similarity Law in Botanic Describes the Genesis of the Vulnerability Curve Shape in Vascular Plants

NASA Astrophysics Data System (ADS)

Mrad, A.; Domec, J. C.; Huang, C. W.; Katul, G. G.

2017-12-01

Xylem tissues are specialized in offering the least possible resistance to water flow. However, this is not guaranteed when ascending sap reaches large negative pressures during periods of water stress when embolism within the xylem occurs, an inevitable step toward potential drought-induced mortality. Ongoing research into changing forest patterns and plant survival due to droughts rarely dispute the significance of Vulnerability Curves (VCs), plots that feature loss in relative conductance with declining liquid pressure (ψ). While Earth-Systems models routinely employ various VC functions, the theoretical underpinnings describing their shape remains lacking. VCs are the outcome of microscopic phenomena describing embolism formation, bubble-scale xylem properties allowing embolism spread, and hydraulic processes that dictate the water potential along the flow path. The work here explores how the upscaled version of these gives rise to popular mathematical shapes used to describe VC measurements: The Logistic and Weibull exceedance equations. Each of these two captures a distinct type of embolism spread: The Logistic VC arises when the probability that embolized vessels interact with intact ones describe embolism spread as water pressure decreases (labeled as a similarity law in botanic [1]). The Weibull VC arises when the aforementioned description includes the effects of ψ explicitly. Variability in xylem properties along the flow path is explored analytically using novel approaches borrowed from `super-statistics' and numerical simulations. The numerical simulations intend to single out which xylem network property is significant in describing the VC shape. The model results corroborate previous research (experimental and 3-dimensional high-resolution simulations) on the effect of vessel size and network topology. It is shown that (i) initial embolism locations alter air-seeding pressure and VC slope; (ii) redundancy and size variations decrease bubble propagation probability with decreasing ψ; and (iii) varying network properties spatially along the flow path delays total loss of conductance. The implications of these findings to linking VC shape to plant traits and the on-going debate about `r' vs `s' shape VCs are highlighted.

Investigating end-to-end security in the fifth generation wireless capabilities and IoT extensions

NASA Astrophysics Data System (ADS)

Uher, J.; Harper, J.; Mennecke, R. G.; Patton, P.; Farroha, B.

2016-05-01

The emerging 5th generation wireless network will be architected and specified to meet the vision of allowing the billions of devices and millions of human users to share spectrum to communicate and deliver services. The expansion of wireless networks from its current role to serve these diverse communities of interest introduces new paradigms that require multi-tiered approaches. The introduction of inherently low security components, like IoT devices, necessitates that critical data be better secured to protect the networks and users. Moreover high-speed communications that are meant to enable the autonomous vehicles require ultra reliable and low latency paths. This research explores security within the proposed new architectures and the cross interconnection of the highly protected assets with low cost/low security components forming the overarching 5th generation wireless infrastructure.

Optimizing Pedestrian-Friendly Walking Path for the First and Last Mile Transit Journey by Using the Analytical Network Process (anp) Decision Model and GIS Network Analysis

NASA Astrophysics Data System (ADS)

Naharudin, N.; Ahamad, M. S. S.; Sadullah, A. F. M.

2017-10-01

Every transit trip begins and ends with pedestrian travel. People need to walk to access the transit services. However, their choice to walk depends on many factors including the connectivity, level of comfort and safety. These factors can influence the pleasantness of riding the transit itself, especially during the first/last mile (FLM) journey. This had triggered few studies attempting to measure the pedestrian-friendliness a walking environment can offer. There were studies that implement the pedestrian experience on walking to assess the pedestrian-friendliness of a walking environment. There were also studies that use spatial analysis to measure it based on the path connectivity and accessibility to public facilities and amenities. Though both are good, but the perception-based studies and spatial analysis can be combined to derive more holistic results. This paper proposes a framework for selecting a pedestrian-friendly path for the FLM transit journey by using the two techniques (perception-based and spatial analysis). First, the degree of importance for the factors influencing a good walking environment will be aggregated by using Analytical Network Process (ANP) decision rules based on people's preferences on those factors. The weight will then be used as attributes in the GIS network analysis. Next, the network analysis will be performed to find a pedestrian-friendly walking route based on the priorities aggregated by ANP. It will choose routes passing through the preferred attributes accordingly. The final output is a map showing pedestrian-friendly walking path for the FLM transit journey.

Home and Clinical Cardiovascular Care Center (H4C): a Framework for Integrating Body Sensor Networks and QTRU Cryptography System.

PubMed

Zakerolhosseini, Ali; Sokouti, Massoud; Pezeshkian, Massoud

2013-01-01

Quick responds to heart attack patients before arriving to hospital is a very important factor. In this paper, a combined model of Body Sensor Network and Personal Digital Access using QTRU cipher algorithm in Wifi networks is presented to efficiently overcome these life threatening attacks. The algorithm for optimizing the routing paths between sensor nodes and an algorithm for reducing the power consumption are also applied for achieving the best performance by this model. This system is consumes low power and has encrypting and decrypting processes. It also has an efficient routing path in a fast manner.

Video distribution system cost model

NASA Technical Reports Server (NTRS)

Gershkoff, I.; Haspert, J. K.; Morgenstern, B.

1980-01-01

A cost model that can be used to systematically identify the costs of procuring and operating satellite linked communications systems is described. The user defines a network configuration by specifying the location of each participating site, the interconnection requirements, and the transmission paths available for the uplink (studio to satellite), downlink (satellite to audience), and voice talkback (between audience and studio) segments of the network. The model uses this information to calculate the least expensive signal distribution path for each participating site. Cost estimates are broken downy by capital, installation, lease, operations and maintenance. The design of the model permits flexibility in specifying network and cost structure.

Home and Clinical Cardiovascular Care Center (H4C): a Framework for Integrating Body Sensor Networks and QTRU Cryptography System

PubMed Central

Zakerolhosseini, Ali; Sokouti, Massoud; Pezeshkian, Massoud

2013-01-01

Quick responds to heart attack patients before arriving to hospital is a very important factor. In this paper, a combined model of Body Sensor Network and Personal Digital Access using QTRU cipher algorithm in Wifi networks is presented to efficiently overcome these life threatening attacks. The algorithm for optimizing the routing paths between sensor nodes and an algorithm for reducing the power consumption are also applied for achieving the best performance by this model. This system is consumes low power and has encrypting and decrypting processes. It also has an efficient routing path in a fast manner. PMID:24252988

Path coloring on the Mesh

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

Rabani, Y.

In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edge disjoint. Our objective is to minimize the number of colors used. This problem was raised by Aggarwal et al and Raghavan and Upfal as a model for routing in all-optical networks. It is also related to questions in circuit routing. In this paper, we improve the O (ln N) approximation result of Kleinberg and Tardos for path coloring on the N x Nmore » mesh. We give an O(1) approximation algorithm to the number of colors needed, and a poly(ln ln N) approximation algorithm to the choice of paths and colors. To the best of our knowledge, these are the first sub-logarithmic bounds for any network other than trees, rings, or trees of rings. Our results are based on developing new techniques for randomized rounding. These techniques iteratively improve a fractional solution until it approaches integrality. They are motivated by the method used by Leighton, Maggs, and Rao for packet routing.« less

Markov State Models of gene regulatory networks.

PubMed

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

2017-02-06

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

Quality assessment of static aggregation compared to the temporal approach based on a pig trade network in Northern Germany.

PubMed

Büttner, Kathrin; Salau, Jennifer; Krieter, Joachim

2016-07-01

Recent analyses of animal movement networks focused on the static aggregation of trade contacts over different time windows, which neglects the system's temporal variation. In terms of disease spread, ignoring the temporal dynamics can lead to an over- or underestimation of an outbreak's speed and extent. This becomes particularly evident, if the static aggregation allows for the existence of more paths compared to the number of time-respecting paths (i.e. paths in the right chronological order). Therefore, the aim of this study was to reveal differences between static and temporal representations of an animal trade network and to assess the quality of the static aggregation in comparison to the temporal counterpart. Contact data from a pig trade network (2006-2009) of a producer community in Northern Germany were analysed. The results show that a median value of 8.7 % (4.6-14.1%) of the nodes and 3.1% (1.6-5.5%) of the edges were active on a weekly resolution. No fluctuations in the activity patterns were obvious. Furthermore, 50% of the nodes already had one trade contact after approximately six months. For an accumulation window with increasing size (one day each), the accumulation rate, i.e. the relative increase in the number of nodes or edges, stayed relatively constant below 0.07% for the nodes and 0.12 % for the edges. The temporal distances had a much wider distribution than the topological distances. 84% of the temporal distances were smaller than 90 days. The maximum temporal distance was 1000 days, which corresponds to the temporal diameter of the present network. The median temporal correlation coefficient, which measures the probability for an edge to persist across two consecutive time steps, was 0.47, with a maximum value of 0.63 at the accumulation window of 88 days. The causal fidelity measures the fraction of the number of static paths which can also be taken in the temporal network. For the whole observation period relatively high values indicate that 67% of the time-respecting paths existed in both network representations. An increase to 0.87 (0.82-0.88) and 0.92 (0.80-0.98), respectively, could be observed for yearly and monthly aggregation windows. The results show that the investigated pig trade network in its static aggregation represents the temporal dynamics of the system sufficiently well. Therefore, the methodology for analysing static instead of dynamic networks can be used without losing too much information. Copyright © 2016 Elsevier B.V. All rights reserved.

The role of storm scale, position and movement in controlling urban flood response

NASA Astrophysics Data System (ADS)

ten Veldhuis, Marie-claire; Zhou, Zhengzheng; Yang, Long; Liu, Shuguang; Smith, James

2018-01-01

The impact of spatial and temporal variability of rainfall on hydrological response remains poorly understood, in particular in urban catchments due to their strong variability in land use, a high degree of imperviousness and the presence of stormwater infrastructure. In this study, we analyze the effect of storm scale, position and movement in relation to basin scale and flow-path network structure on urban hydrological response. A catalog of 279 peak events was extracted from a high-quality observational dataset covering 15 years of flow observations and radar rainfall data for five (semi)urbanized basins ranging from 7.0 to 111.1 km2 in size. Results showed that the largest peak flows in the event catalog were associated with storm core scales exceeding basin scale, for all except the largest basin. Spatial scale of flood-producing storm events in the smaller basins fell into two groups: storms of large spatial scales exceeding basin size or small, concentrated events, with storm core much smaller than basin size. For the majority of events, spatial rainfall variability was strongly smoothed by the flow-path network, increasingly so for larger basin size. Correlation analysis showed that position of the storm in relation to the flow-path network was significantly correlated with peak flow in the smallest and in the two more urbanized basins. Analysis of storm movement relative to the flow-path network showed that direction of storm movement, upstream or downstream relative to the flow-path network, had little influence on hydrological response. Slow-moving storms tend to be associated with higher peak flows and longer lag times. Unexpectedly, position of the storm relative to impervious cover within the basins had little effect on flow peaks. These findings show the importance of observation-based analysis in validating and improving our understanding of interactions between the spatial distribution of rainfall and catchment variability.

Protein function prediction using neighbor relativity in protein-protein interaction network.

PubMed

Moosavi, Sobhan; Rahgozar, Masoud; Rahimi, Amir

2013-04-01

There is a large gap between the number of discovered proteins and the number of functionally annotated ones. Due to the high cost of determining protein function by wet-lab research, function prediction has become a major task for computational biology and bioinformatics. Some researches utilize the proteins interaction information to predict function for un-annotated proteins. In this paper, we propose a novel approach called "Neighbor Relativity Coefficient" (NRC) based on interaction network topology which estimates the functional similarity between two proteins. NRC is calculated for each pair of proteins based on their graph-based features including distance, common neighbors and the number of paths between them. In order to ascribe function to an un-annotated protein, NRC estimates a weight for each neighbor to transfer its annotation to the unknown protein. Finally, the unknown protein will be annotated by the top score transferred functions. We also investigate the effect of using different coefficients for various types of functions. The proposed method has been evaluated on Saccharomyces cerevisiae and Homo sapiens interaction networks. The performance analysis demonstrates that NRC yields better results in comparison with previous protein function prediction approaches that utilize interaction network. Copyright © 2012 Elsevier Ltd. All rights reserved.

Driving forces of researchers mobility

NASA Astrophysics Data System (ADS)

Gargiulo, Floriana; Carletti, Timoteo

2014-05-01

Starting from the dataset of the publication corpus of the APS during the period 1955-2009, we reconstruct the individual researchers trajectories, namely the list of the consecutive affiliations for each scholar. Crossing this information with different geographic datasets we embed these trajectories in a spatial framework. Using methods from network theory and complex systems analysis we characterise these patterns in terms of topological network properties and we analyse the dependence of an academic path across different dimensions: the distance between two subsequent positions, the relative importance of the institutions (in terms of number of publications) and some socio-cultural traits. We show that distance is not always a good predictor for the next affiliation while other factors like ``the previous steps'' of the career of the researchers (in particular the first position) or the linguistic and historical similarity between two countries can have an important impact. Finally we show that the dataset exhibit a memory effect, hence the fate of a career strongly depends from the first two affiliations.

Orbit analysis of a bright Southern sigma Sagittariids fireball

NASA Astrophysics Data System (ADS)

Koukal, Jakub

2018-02-01

During twilight on June 14, 2017, CEMeNt network cameras recorded a long and bright fireball with an absolute magnitude of -7.9 ± 0.2m, whose atmospheric path began over the northwest of Romania and ended up above southern Poland. This fireball belongs to the Southern sigma Sagittariids meteor shower and was recorded from 9 cameras of the CEMeNt network. The atmospheric path of the fireball as well as the heliocentric orbit of the meteoroid are analyzed in this article.

Effect of non-classical current paths in networks of 1-dimensional wires

NASA Astrophysics Data System (ADS)

Echternach, P. M.; Mikhalchuk, A. G.; Bozler, H. M.; Gershenson, M. E.; Bogdanov, A. L.; Nilsson, B.

1996-04-01

At low temperatures, the quantum corrections to the resistance due to weak localization and electron-electron interaction are affected by the shape and topology of samples. We observed these effects in the resistance of 2D percolation networks made from 1D wires and in a series of long 1D wires with regularly spaced side branches. Branches outside the classical current path strongly reduce the quantum corrections to the resistance and these reductions become a measure of the quantum lengths.

The Laser Communications Relay and the Path to the Next Generation Near Earth Relay

NASA Technical Reports Server (NTRS)

Israel, David J.

2015-01-01

NASA Goddard Space Flight Center is currently developing the Laser Communications Relay Demonstration (LCRD) as a Path to the Next Generation Near Earth Space Communication Network. The current NASA Space Network or Tracking and Data Relay Satellite System is comprised of a constellation of Tracking and Data Relay Satellites (TDRS) in geosynchronous orbit and associated ground stations and operation centers. NASA is currently targeting a next generation of relay capability on orbit in the 2025 timeframe.

Cross-Participant EEG-Based Assessment of Cognitive Workload Using Multi-Path Convolutional Recurrent Neural Networks.

PubMed

Hefron, Ryan; Borghetti, Brett; Schubert Kabban, Christine; Christensen, James; Estepp, Justin

2018-04-26

Applying deep learning methods to electroencephalograph (EEG) data for cognitive state assessment has yielded improvements over previous modeling methods. However, research focused on cross-participant cognitive workload modeling using these techniques is underrepresented. We study the problem of cross-participant state estimation in a non-stimulus-locked task environment, where a trained model is used to make workload estimates on a new participant who is not represented in the training set. Using experimental data from the Multi-Attribute Task Battery (MATB) environment, a variety of deep neural network models are evaluated in the trade-space of computational efficiency, model accuracy, variance and temporal specificity yielding three important contributions: (1) The performance of ensembles of individually-trained models is statistically indistinguishable from group-trained methods at most sequence lengths. These ensembles can be trained for a fraction of the computational cost compared to group-trained methods and enable simpler model updates. (2) While increasing temporal sequence length improves mean accuracy, it is not sufficient to overcome distributional dissimilarities between individuals’ EEG data, as it results in statistically significant increases in cross-participant variance. (3) Compared to all other networks evaluated, a novel convolutional-recurrent model using multi-path subnetworks and bi-directional, residual recurrent layers resulted in statistically significant increases in predictive accuracy and decreases in cross-participant variance.

Cross-Participant EEG-Based Assessment of Cognitive Workload Using Multi-Path Convolutional Recurrent Neural Networks

PubMed Central

Hefron, Ryan; Borghetti, Brett; Schubert Kabban, Christine; Christensen, James; Estepp, Justin

2018-01-01

Applying deep learning methods to electroencephalograph (EEG) data for cognitive state assessment has yielded improvements over previous modeling methods. However, research focused on cross-participant cognitive workload modeling using these techniques is underrepresented. We study the problem of cross-participant state estimation in a non-stimulus-locked task environment, where a trained model is used to make workload estimates on a new participant who is not represented in the training set. Using experimental data from the Multi-Attribute Task Battery (MATB) environment, a variety of deep neural network models are evaluated in the trade-space of computational efficiency, model accuracy, variance and temporal specificity yielding three important contributions: (1) The performance of ensembles of individually-trained models is statistically indistinguishable from group-trained methods at most sequence lengths. These ensembles can be trained for a fraction of the computational cost compared to group-trained methods and enable simpler model updates. (2) While increasing temporal sequence length improves mean accuracy, it is not sufficient to overcome distributional dissimilarities between individuals’ EEG data, as it results in statistically significant increases in cross-participant variance. (3) Compared to all other networks evaluated, a novel convolutional-recurrent model using multi-path subnetworks and bi-directional, residual recurrent layers resulted in statistically significant increases in predictive accuracy and decreases in cross-participant variance. PMID:29701668

Community Evolution in International Migration Top1 Networks.

PubMed

Peres, Mihaela; Xu, Helian; Wu, Gang

2016-01-01

Focusing on each country's topmost destination/origin migration relation with other countries, this study builds top1 destination networks and top1 origin networks in order to understand their skeletal construction and community dynamics. Each top1 network covers approximately 50% of the complete migrant network stock for each decade between 1960 and 2000. We investigate the community structure by implementing the Girvan-Newman algorithm and compare the number of components and communities to illustrate their differences. We find that (i) both top1 networks (origin and destination) exhibited communities with a clear structure and a surprising evolution, although 80% edges persist between each decade; (ii) top1 destination networks focused on developed countries exhibiting shorter paths and preferring more advance countries, while top1 origin networks focused both on developed as well as more substantial developing nations that presented a longer path and more stable groups; (iii) only few countries have a decisive influence on community evolution of both top1 networks. USA took the leading position as a destination country in top1 destination networks, while China and India were the main Asian emigration countries in top1 origin networks; European countries and the Russian Federation played an important role in both.

Community Evolution in International Migration Top1 Networks

PubMed Central

Xu, Helian

2016-01-01

Focusing on each country’s topmost destination/origin migration relation with other countries, this study builds top1 destination networks and top1 origin networks in order to understand their skeletal construction and community dynamics. Each top1 network covers approximately 50% of the complete migrant network stock for each decade between 1960 and 2000. We investigate the community structure by implementing the Girvan-Newman algorithm and compare the number of components and communities to illustrate their differences. We find that (i) both top1 networks (origin and destination) exhibited communities with a clear structure and a surprising evolution, although 80% edges persist between each decade; (ii) top1 destination networks focused on developed countries exhibiting shorter paths and preferring more advance countries, while top1 origin networks focused both on developed as well as more substantial developing nations that presented a longer path and more stable groups; (iii) only few countries have a decisive influence on community evolution of both top1 networks. USA took the leading position as a destination country in top1 destination networks, while China and India were the main Asian emigration countries in top1 origin networks; European countries and the Russian Federation played an important role in both. PMID:26859406

Graph theoretical analysis of EEG functional connectivity during music perception.

PubMed

Wu, Junjie; Zhang, Junsong; Liu, Chu; Liu, Dongwei; Ding, Xiaojun; Zhou, Changle

2012-11-05

The present study evaluated the effect of music on large-scale structure of functional brain networks using graph theoretical concepts. While most studies on music perception used Western music as an acoustic stimulus, Guqin music, representative of Eastern music, was selected for this experiment to increase our knowledge of music perception. Electroencephalography (EEG) was recorded from non-musician volunteers in three conditions: Guqin music, noise and silence backgrounds. Phase coherence was calculated in the alpha band and between all pairs of EEG channels to construct correlation matrices. Each resulting matrix was converted into a weighted graph using a threshold, and two network measures: the clustering coefficient and characteristic path length were calculated. Music perception was found to display a higher level mean phase coherence. Over the whole range of thresholds, the clustering coefficient was larger while listening to music, whereas the path length was smaller. Networks in music background still had a shorter characteristic path length even after the correction for differences in mean synchronization level among background conditions. This topological change indicated a more optimal structure under music perception. Thus, prominent small-world properties are confirmed in functional brain networks. Furthermore, music perception shows an increase of functional connectivity and an enhancement of small-world network organizations. Copyright © 2012 Elsevier B.V. All rights reserved.

The use and significance of a research networking system.

PubMed

Kahlon, Maninder; Yuan, Leslie; Daigre, John; Meeks, Eric; Nelson, Katie; Piontkowski, Cynthia; Reuter, Katja; Sak, Rachael; Turner, Brian; Weber, Griffin M; Chatterjee, Anirvan

2014-02-07

Universities have begun deploying public Internet systems that allow for easy search of their experts, expertise, and intellectual networks. Deployed first in biomedical schools but now being implemented more broadly, the initial motivator of these research networking systems was to enable easier identification of collaborators and enable the development of teams for research. The intent of the study was to provide the first description of the usage of an institutional research "social networking" system or research networking system (RNS). Number of visits, visitor location and type, referral source, depth of visit, search terms, and click paths were derived from 2.5 years of Web analytics data. Feedback from a pop-up survey presented to users over 15 months was summarized. RNSs automatically generate and display profiles and networks of researchers. Within 2.5 years, the RNS at the University of California, San Francisco (UCSF) achieved one-seventh of the monthly visit rate of the main longstanding university website, with an increasing trend. Visitors came from diverse locations beyond the institution. Close to 75% (74.78%, 208,304/278,570) came via a public search engine and 84.0% (210 out of a sample of 250) of these queried an individual's name that took them directly to the relevant profile page. In addition, 20.90% (214 of 1024) visits went beyond the page related to a person of interest to explore related researchers and topics through the novel and networked information provided by the tool. At the end of the period analyzed, more than 2000 visits per month traversed 5 or more links into related people and topics. One-third of visits came from returning visitors who were significantly more likely to continue to explore networked people and topics (P<.001). Responses to an online survey suggest a broad range of benefits of using the RNS in supporting the research and clinical mission. Returning visitors in an ever-increasing pool of visitors to an RNS are among those that display behavior consistent with using the tool to identify new collaborators or research topics. Through direct user feedback we know that some visits do result in research-enhancing outcomes, although we cannot address the scale of impact. With the rapid pace of acquiring visitors searching for individual names, the RNS is evolving into a new kind of gateway for the university.

The social determinants of oral health: new approaches to conceptualizing and researching complex causal networks.

PubMed

Newton, J Timothy; Bower, Elizabeth J

2005-02-01

Oral epidemiological research into the social determinants of oral health has been limited by the absence of a theoretical framework which reflects the complexity of real life social processes and the network of causal pathways between social structure and oral health and disease. In the absence of such a framework, social determinants are treated as isolated risk factors, attributable to the individual, having a direct impact on oral health. There is little sense of how such factors interrelate over time and place and the pathways between the factors and oral health. Features of social life which impact on individuals' oral health but are not reducible to the individual remain under-researched. A conceptual framework informing mainstream epidemiological research into the social determinants of health is applied to oral epidemiology. The framework suggests complex causal pathways between social structure and health via interlinking material, psychosocial and behavioural pathways. Methodological implications for oral epidemiological research informed by the framework, such as the use of multilevel modelling, path analysis and structural equation modelling, combining qualitative and quantitative research methods, and collaborative research, are discussed. Copyright Blackwell Munksgaard, 2005.

Looking for robust properties in the growth of an academic network: the case of the Uruguayan biological research community.

PubMed

Cabana, Alvaro; Mizraji, Eduardo; Pomi, Andrés; Valle-Lisboa, Juan Carlos

2008-04-01

Graph-theoretical methods have recently been used to analyze certain properties of natural and social networks. In this work, we have investigated the early stages in the growth of a Uruguayan academic network, the Biology Area of the Programme for the Development of Basic Science (PEDECIBA). This transparent social network is a territory for the exploration of the reliability of clustering methods that can potentially be used when we are confronted with opaque natural systems that provide us with a limited spectrum of observables (happens in research on the relations between brain, thought and language). From our social net, we constructed two different graph representations based on the relationships among researchers revealed by their co-participation in Master's thesis committees. We studied these networks at different times and found that they achieve connectedness early in their evolution and exhibit the small-world property (i.e. high clustering with short path lengths). The data seem compatible with power law distributions of connectivity, clustering coefficients and betweenness centrality. Evidence of preferential attachment of new nodes and of new links between old nodes was also found in both representations. These results suggest that there are topological properties observed throughout the growth of the network that do not depend on the representations we have chosen but reflect intrinsic properties of the academic collective under study. Researchers in PEDECIBA are classified according to their specialties. We analysed the community structure detected by a standard algorithm in both representations. We found that much of the pre-specified structure is recovered and part of the mismatches can be attributed to convergent interests between scientists from different sub-disciplines. This result shows the potentiality of some clustering methods for the analysis of partially known natural systems.

Increasing retention of early career female atmospheric scientists

NASA Astrophysics Data System (ADS)

Edwards, L. M.; Hallar, A. G.; Avallone, L. M.; Thiry, H.

2010-12-01

Atmospheric Science Collaborations and Enriching NeTworks (ASCENT) is a workshop series designed to bring together early career female scientists in the field of atmospheric science and related disciplines. ASCENT uses a multi-faceted approach to provide junior scientists with tools that will help them meet the challenges in their research and teaching career paths and will promote their retention in the field. During the workshop, senior women scientists discuss their career and life paths. They also lead seminars on tools, resources and methods that can help early career scientists to be successful and prepared to fill vacancies created by the “baby boomer” retirees. Networking is a significant aspect of ASCENT, and many opportunities for both formal and informal interactions among the participants (of both personal and professional nature) are blended in the schedule. The workshops are held in Steamboat Springs, Colorado, home of a high-altitude atmospheric science laboratory, Storm Peak Laboratory, which also allows for nearby casual outings and a pleasant environment for participants. Near the conclusion of each workshop, junior and senior scientists are matched in mentee-mentor ratios of two junior scientists per senior scientist. Post-workshop reunion events are held at national scientific meetings to maintain connectivity among each year’s participants, and for collaborating among participants of all workshops held to date. Evaluations of the two workshop cohorts thus far conclude that the workshops have been successful in achieving the goals of establishing and expanding personal and research-related networks, and that seminars have been useful in creating confidence and sharing resources for such things as preparing promotion and tenure packages, interviewing and negotiating job offers, and writing successful grant proposals.

A systematic FPGA acceleration design for applications based on convolutional neural networks

NASA Astrophysics Data System (ADS)

Dong, Hao; Jiang, Li; Li, Tianjian; Liang, Xiaoyao

2018-04-01

Most FPGA accelerators for convolutional neural network are designed to optimize the inner acceleration and are ignored of the optimization for the data path between the inner accelerator and the outer system. This could lead to poor performance in applications like real time video object detection. We propose a brand new systematic FPFA acceleration design to solve this problem. This design takes the data path optimization between the inner accelerator and the outer system into consideration and optimizes the data path using techniques like hardware format transformation, frame compression. It also takes fixed-point, new pipeline technique to optimize the inner accelerator. All these make the final system's performance very good, reaching about 10 times the performance comparing with the original system.

Path selection in the growth of rivers

DOE PAGES

Cohen, Yossi; Devauchelle, Olivier; Seybold, Hansjörg F.; ...

2015-11-02

River networks exhibit a complex ramified structure that has inspired decades of studies. But, an understanding of the propagation of a single stream remains elusive. In this paper, we invoke a criterion for path selection from fracture mechanics and apply it to the growth of streams in a diffusion field. We show that, as it cuts through the landscape, a stream maintains a symmetric groundwater flow around its tip. The local flow conditions therefore determine the growth of the drainage network. We use this principle to reconstruct the history of a network and to find a growth law associated withmore » it. Finally, our results show that the deterministic growth of a single channel based on its local environment can be used to characterize the structure of river networks.« less

A fault-tolerant control architecture for unmanned aerial vehicles

NASA Astrophysics Data System (ADS)

Drozeski, Graham R.

Research has presented several approaches to achieve varying degrees of fault-tolerance in unmanned aircraft. Approaches in reconfigurable flight control are generally divided into two categories: those which incorporate multiple non-adaptive controllers and switch between them based on the output of a fault detection and identification element, and those that employ a single adaptive controller capable of compensating for a variety of fault modes. Regardless of the approach for reconfigurable flight control, certain fault modes dictate system restructuring in order to prevent a catastrophic failure. System restructuring enables active control of actuation not employed by the nominal system to recover controllability of the aircraft. After system restructuring, continued operation requires the generation of flight paths that adhere to an altered flight envelope. The control architecture developed in this research employs a multi-tiered hierarchy to allow unmanned aircraft to generate and track safe flight paths despite the occurrence of potentially catastrophic faults. The hierarchical architecture increases the level of autonomy of the system by integrating five functionalities with the baseline system: fault detection and identification, active system restructuring, reconfigurable flight control; reconfigurable path planning, and mission adaptation. Fault detection and identification algorithms continually monitor aircraft performance and issue fault declarations. When the severity of a fault exceeds the capability of the baseline flight controller, active system restructuring expands the controllability of the aircraft using unconventional control strategies not exploited by the baseline controller. Each of the reconfigurable flight controllers and the baseline controller employ a proven adaptive neural network control strategy. A reconfigurable path planner employs an adaptive model of the vehicle to re-shape the desired flight path. Generation of the revised flight path is posed as a linear program constrained by the response of the degraded system. Finally, a mission adaptation component estimates limitations on the closed-loop performance of the aircraft and adjusts the aircraft mission accordingly. A combination of simulation and flight test results using two unmanned helicopters validates the utility of the hierarchical architecture.

Availability Improvement of Layer 2 Seamless Networks Using OpenFlow

PubMed Central

Molina, Elias; Jacob, Eduardo; Matias, Jon; Moreira, Naiara; Astarloa, Armando

2015-01-01

The network robustness and reliability are strongly influenced by the implementation of redundancy and its ability of reacting to changes. In situations where packet loss or maximum latency requirements are critical, replication of resources and information may become the optimal technique. To this end, the IEC 62439-3 Parallel Redundancy Protocol (PRP) provides seamless recovery in layer 2 networks by delegating the redundancy management to the end-nodes. In this paper, we present a combination of the Software-Defined Networking (SDN) approach and PRP topologies to establish a higher level of redundancy and thereby, through several active paths provisioned via the OpenFlow protocol, the global reliability is increased, as well as data flows are managed efficiently. Hence, the experiments with multiple failure scenarios, which have been run over the Mininet network emulator, show the improvement in the availability and responsiveness over other traditional technologies based on a single active path. PMID:25759861

Availability improvement of layer 2 seamless networks using OpenFlow.

PubMed

Molina, Elias; Jacob, Eduardo; Matias, Jon; Moreira, Naiara; Astarloa, Armando

2015-01-01

The network robustness and reliability are strongly influenced by the implementation of redundancy and its ability of reacting to changes. In situations where packet loss or maximum latency requirements are critical, replication of resources and information may become the optimal technique. To this end, the IEC 62439-3 Parallel Redundancy Protocol (PRP) provides seamless recovery in layer 2 networks by delegating the redundancy management to the end-nodes. In this paper, we present a combination of the Software-Defined Networking (SDN) approach and PRP topologies to establish a higher level of redundancy and thereby, through several active paths provisioned via the OpenFlow protocol, the global reliability is increased, as well as data flows are managed efficiently. Hence, the experiments with multiple failure scenarios, which have been run over the Mininet network emulator, show the improvement in the availability and responsiveness over other traditional technologies based on a single active path.

Determining average path length and average trapping time on generalized dual dendrimer

NASA Astrophysics Data System (ADS)

Li, Ling; Guan, Jihong

2015-03-01

Dendrimer has wide number of important applications in various fields. In some cases during transport or diffusion process, it transforms into its dual structure named Husimi cactus. In this paper, we study the structure properties and trapping problem on a family of generalized dual dendrimer with arbitrary coordination numbers. We first calculate exactly the average path length (APL) of the networks. The APL increases logarithmically with the network size, indicating that the networks exhibit a small-world effect. Then we determine the average trapping time (ATT) of the trapping process in two cases, i.e., the trap placed on a central node and the trap is uniformly distributed in all the nodes of the network. In both case, we obtain explicit solutions of ATT and show how they vary with the networks size. Besides, we also discuss the influence of the coordination number on trapping efficiency.

Renormalization group theory for percolation in time-varying networks.

PubMed

Karschau, Jens; Zimmerling, Marco; Friedrich, Benjamin M

2018-05-22

Motivated by multi-hop communication in unreliable wireless networks, we present a percolation theory for time-varying networks. We develop a renormalization group theory for a prototypical network on a regular grid, where individual links switch stochastically between active and inactive states. The question whether a given source node can communicate with a destination node along paths of active links is equivalent to a percolation problem. Our theory maps the temporal existence of multi-hop paths on an effective two-state Markov process. We show analytically how this Markov process converges towards a memoryless Bernoulli process as the hop distance between source and destination node increases. Our work extends classical percolation theory to the dynamic case and elucidates temporal correlations of message losses. Quantification of temporal correlations has implications for the design of wireless communication and control protocols, e.g. in cyber-physical systems such as self-organized swarms of drones or smart traffic networks.

Using new edges for anomaly detection in computer networks

DOEpatents

Neil, Joshua Charles

2017-07-04

Creation of new edges in a network may be used as an indication of a potential attack on the network. Historical data of a frequency with which nodes in a network create and receive new edges may be analyzed. Baseline models of behavior among the edges in the network may be established based on the analysis of the historical data. A new edge that deviates from a respective baseline model by more than a predetermined threshold during a time window may be detected. The new edge may be flagged as potentially anomalous when the deviation from the respective baseline model is detected. Probabilities for both new and existing edges may be obtained for all edges in a path or other subgraph. The probabilities may then be combined to obtain a score for the path or other subgraph. A threshold may be obtained by calculating an empirical distribution of the scores under historical conditions.

Using new edges for anomaly detection in computer networks

DOEpatents

Neil, Joshua Charles

2015-05-19

Creation of new edges in a network may be used as an indication of a potential attack on the network. Historical data of a frequency with which nodes in a network create and receive new edges may be analyzed. Baseline models of behavior among the edges in the network may be established based on the analysis of the historical data. A new edge that deviates from a respective baseline model by more than a predetermined threshold during a time window may be detected. The new edge may be flagged as potentially anomalous when the deviation from the respective baseline model is detected. Probabilities for both new and existing edges may be obtained for all edges in a path or other subgraph. The probabilities may then be combined to obtain a score for the path or other subgraph. A threshold may be obtained by calculating an empirical distribution of the scores under historical conditions.

GraphStore: A Distributed Graph Storage System for Big Data Networks

ERIC Educational Resources Information Center

Martha, VenkataSwamy

2013-01-01

Networks, such as social networks, are a universal solution for modeling complex problems in real time, especially in the Big Data community. While previous studies have attempted to enhance network processing algorithms, none have paved a path for the development of a persistent storage system. The proposed solution, GraphStore, provides an…

Predicting links based on knowledge dissemination in complex network

NASA Astrophysics Data System (ADS)

Zhou, Wen; Jia, Yifan

2017-04-01

Link prediction is the task of mining the missing links in networks or predicting the next vertex pair to be connected by a link. A lot of link prediction methods were inspired by evolutionary processes of networks. In this paper, a new mechanism for the formation of complex networks called knowledge dissemination (KD) is proposed with the assumption of knowledge disseminating through the paths of a network. Accordingly, a new link prediction method-knowledge dissemination based link prediction (KDLP)-is proposed to test KD. KDLP characterizes vertex similarity based on knowledge quantity (KQ) which measures the importance of a vertex through H-index. Extensive numerical simulations on six real-world networks demonstrate that KDLP is a strong link prediction method which performs at a higher prediction accuracy than four well-known similarity measures including common neighbors, local path index, average commute time and matrix forest index. Furthermore, based on the common conclusion that an excellent link prediction method reveals a good evolving mechanism, the experiment results suggest that KD is a considerable network evolving mechanism for the formation of complex networks.

A dataset on human navigation strategies in foreign networked systems

PubMed Central

Kőrösi, Attila; Csoma, Attila; Rétvári, Gábor; Heszberger, Zalán; Bíró, József; Tapolcai, János; Pelle, István; Klajbár, Dávid; Novák, Márton; Halasi, Valentina; Gulyás, András

2018-01-01

Humans are involved in various real-life networked systems. The most obvious examples are social and collaboration networks but the language and the related mental lexicon they use, or the physical map of their territory can also be interpreted as networks. How do they find paths between endpoints in these networks? How do they obtain information about a foreign networked world they find themselves in, how they build mental model for it and how well they succeed in using it? Large, open datasets allowing the exploration of such questions are hard to find. Here we report a dataset collected by a smartphone application, in which players navigate between fixed length source and destination English words step-by-step by changing only one letter at a time. The paths reflect how the players master their navigation skills in such a foreign networked world. The dataset can be used in the study of human mental models for the world around us, or in a broader scope to investigate the navigation strategies in complex networked systems. PMID:29533391

Frequency specific patterns of resting-state networks development from childhood to adolescence: A magnetoencephalography study.

PubMed

Meng, Lu; Xiang, Jing

2016-11-01

The present study investigated frequency dependent developmental patterns of the brain resting-state networks from childhood to adolescence. Magnetoencephalography (MEG) data were recorded from 20 healthy subjects at resting-state with eyes-open. The resting-state networks (RSNs) was analyzed at source-level. Brain network organization was characterized by mean clustering coefficient and average path length. The correlations between brain network measures and subjects' age during development from childhood to adolescence were statistically analyzed in delta (1-4Hz), theta (4-8Hz), alpha (8-12Hz), and beta (12-30Hz) frequency bands. A significant positive correlation between functional connectivity with age was found in alpha and beta frequency bands. A significant negative correlation between average path lengths with age was found in beta frequency band. The results suggest that there are significant developmental changes of resting-state networks from childhood to adolescence, which matures from a lattice network to a small-world network. Copyright © 2016 The Japanese Society of Child Neurology. Published by Elsevier B.V. All rights reserved.

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

PubMed Central

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

Algorithms for constructing optimal paths and statistical analysis of passenger traffic

NASA Astrophysics Data System (ADS)

Trofimov, S. P.; Druzhinina, N. G.; Trofimova, O. G.

2018-01-01

Several existing information systems of urban passenger transport (UPT) are considered. Author’s UPT network model is presented. To a passenger a new service is offered that is the best path from one stop to another stop at a specified time. The algorithm and software implementation for finding the optimal path are presented. The algorithm uses the current UPT schedule. The article also describes the algorithm of statistical analysis of trip payments by the electronic E-cards. The algorithm allows obtaining the density of passenger traffic during the day. This density is independent of the network topology and UPT schedules. The resulting density of the traffic flow can solve a number of practical problems. In particular, the forecast for the overflow of passenger transport in the «rush» hours, the quantitative comparison of different topologies transport networks, constructing of the best UPT timetable. The efficiency of the proposed integrated approach is demonstrated by the example of the model town with arbitrary dimensions.

Circuit-Detour Design and Implementation - Enhancing the Southern California's Seismic Network Reliability through Redundant Network Paths

NASA Astrophysics Data System (ADS)

Watkins, M.; Busby, R.; Rico, H.; Johnson, M.; Hauksson, E.

2003-12-01

We provide enhanced network robustness by apportioning redundant data communications paths for seismic stations in the field. By providing for more than one telemetry route, either physical or logical, network operators can improve availability of seismic data while experiencing occasional network outages, and also during the loss of key gateway interfaces such as a router or central processor. This is especially important for seismic stations in sparsely populated regions where a loss of a single site may result in a significant gap in the network's monitoring capability. A number of challenges arise in the application of a circuit-detour mechanism. One requirement is that it fits well within the existing framework of our real-time system processing. It is also necessary to craft a system that is not needlessly complex to maintain or implement, particularly during a crisis. The method that we use for circuit-detours does not require the reconfiguration of dataloggers or communications equipment in the field. Remote network configurations remain static, changes are only required at the central site. We have implemented standardized procedures to detour circuits on similar transport mediums, such as virtual circuits on the same leased line; as well as physically different communications pathways, such as a microwave link backed up by a leased line. The lessons learned from these improvements in reliability, and optimization efforts could be applied to other real-time seismic networks. A fundamental tenant of most seismic networks is that they are reliable and have a high percentage of real-time data availability. A reasonable way to achieve these expectations is to provide alternate means of delivering data to the central processing sites, with a simple method for utilizing these alternate paths.

Consumer-oriented social data fusion: controlled learning in social environments, social advertising, and more

NASA Astrophysics Data System (ADS)

Grewe, L.

2013-05-01

This paper explores the current practices in social data fusion and analysis as it applies to consumer-oriented applications in a slew of areas including business, economics, politics, sciences, medicine, education and more. A categorization of these systems is proposed and contributions to each area are explored preceded by a discussion of some special issues related to social data and networks. From this work, future paths of consumer-based social data analysis research and current outstanding problems are discovered.

Constructing paths through social networks for disease surveillance

NASA Astrophysics Data System (ADS)

Greene, Marjorie

2011-06-01

Global health security needs better information on biological threats such as pandemics and bioterrorism that pose ever-increasing dangers for the health of populations worldwide. A vast amount of real-time information about infectious disease outbreaks is found in various forms of Web-based data streams. There are advantages and disadvantages of Internet-based surveillance and it has been suggested that an important research area will be to evaluate the application of technologies that will provide benefits to outbreak disease control at local, national, and international levels.

Directionality of real world networks as predicted by path length in directed and undirected graphs

NASA Astrophysics Data System (ADS)

Rosen, Yonatan; Louzoun, Yoram

2014-05-01

Many real world networks either support ordered processes, or are actually representations of such processes. However, the same networks contain large strong connectivity components and long circles, which hide a possible inherent order, since each vertex can be reached from each vertex in a directed path. Thus, the presence of an inherent directionality in networks may be hidden. We here discuss a possible definition of such a directionality and propose a method to detect it. Several common algorithms, such as the betweenness centrality or the degree, measure various aspects of centrality in networks. However, they do not address directly the issue of inherent directionality. The goal of the algorithm discussed here is the detection of global directionality in directed networks. Such an algorithm is essential to detangle complex networks into ordered process. We show that indeed the vast majority of measured real world networks have a clear directionality. Moreover, this directionality can be used to classify vertices in these networks from sources to sinks. Such an algorithm can be highly useful in order to extract a meaning from large interaction networks assembled in many domains.

Co-Authorship and Bibliographic Coupling Network Effects on Citations

PubMed Central

Biscaro, Claudio; Giupponi, Carlo

2014-01-01

This paper analyzes the effects of the co-authorship and bibliographic coupling networks on the citations received by scientific articles. It expands prior research that limited its focus on the position of co-authors and incorporates the effects of the use of knowledge sources within articles: references. By creating a network on the basis of shared references, we propose a way to understand whether an article bridges among extant strands of literature and infer the size of its research community and its embeddedness. Thus, we map onto the article – our unit of analysis – the metrics of authors' position in the co-authorship network and of the use of knowledge on which the scientific article is grounded. Specifically, we adopt centrality measures – degree, betweenneess, and closeness centrality – in the co-authorship network and degree, betweenness centrality and clustering coefficient in the bibliographic coupling and show their influence on the citations received in first two years after the year of publication. Findings show that authors' degree positively impacts citations. Also closeness centrality has a positive effect manifested only when the giant component is relevant. Author's betweenness centrality has instead a negative effect that persists until the giant component - largest component of the network in which all nodes can be linked by a path - is relevant. Moreover, articles that draw on fragmented strands of literature tend to be cited more, whereas the size of the scientific research community and the embeddedness of the article in a cohesive cluster of literature have no effect. PMID:24911416

Time optimized path-choice in the termite hunting ant Megaponera analis.

PubMed

Frank, Erik T; Hönle, Philipp O; Linsenmair, K Eduard

2018-05-10

Trail network systems among ants have received a lot of scientific attention due to their various applications in problem solving of networks. Recent studies have shown that ants select the fastest available path when facing different velocities on different substrates, rather than the shortest distance. The progress of decision-making by these ants is determined by pheromone-based maintenance of paths, which is a collective decision. However, path optimization through individual decision-making remains mostly unexplored. Here we present the first study of time-optimized path selection via individual decision-making by scout ants. Megaponera analis scouts search for termite foraging sites and lead highly organized raid columns to them. The path of the scout determines the path of the column. Through installation of artificial roads around M. analis nests we were able to influence the pathway choice of the raids. After road installation 59% of all recorded raids took place completely or partly on the road, instead of the direct, i.e. distance-optimized, path through grass from the nest to the termites. The raid velocity on the road was more than double the grass velocity, the detour thus saved 34.77±23.01% of the travel time compared to a hypothetical direct path. The pathway choice of the ants was similar to a mathematical model of least time allowing us to hypothesize the underlying mechanisms regulating the behavior. Our results highlight the importance of individual decision-making in the foraging behavior of ants and show a new procedure of pathway optimization. © 2018. Published by The Company of Biologists Ltd.

Convolutional Neural Network-Based Robot Navigation Using Uncalibrated Spherical Images †

PubMed Central

Ran, Lingyan; Zhang, Yanning; Zhang, Qilin; Yang, Tao

2017-01-01

Vision-based mobile robot navigation is a vibrant area of research with numerous algorithms having been developed, the vast majority of which either belong to the scene-oriented simultaneous localization and mapping (SLAM) or fall into the category of robot-oriented lane-detection/trajectory tracking. These methods suffer from high computational cost and require stringent labelling and calibration efforts. To address these challenges, this paper proposes a lightweight robot navigation framework based purely on uncalibrated spherical images. To simplify the orientation estimation, path prediction and improve computational efficiency, the navigation problem is decomposed into a series of classification tasks. To mitigate the adverse effects of insufficient negative samples in the “navigation via classification” task, we introduce the spherical camera for scene capturing, which enables 360° fisheye panorama as training samples and generation of sufficient positive and negative heading directions. The classification is implemented as an end-to-end Convolutional Neural Network (CNN), trained on our proposed Spherical-Navi image dataset, whose category labels can be efficiently collected. This CNN is capable of predicting potential path directions with high confidence levels based on a single, uncalibrated spherical image. Experimental results demonstrate that the proposed framework outperforms competing ones in realistic applications. PMID:28604624

Convolutional Neural Network-Based Robot Navigation Using Uncalibrated Spherical Images.

PubMed

Ran, Lingyan; Zhang, Yanning; Zhang, Qilin; Yang, Tao

2017-06-12

Vision-based mobile robot navigation is a vibrant area of research with numerous algorithms having been developed, the vast majority of which either belong to the scene-oriented simultaneous localization and mapping (SLAM) or fall into the category of robot-oriented lane-detection/trajectory tracking. These methods suffer from high computational cost and require stringent labelling and calibration efforts. To address these challenges, this paper proposes a lightweight robot navigation framework based purely on uncalibrated spherical images. To simplify the orientation estimation, path prediction and improve computational efficiency, the navigation problem is decomposed into a series of classification tasks. To mitigate the adverse effects of insufficient negative samples in the "navigation via classification" task, we introduce the spherical camera for scene capturing, which enables 360° fisheye panorama as training samples and generation of sufficient positive and negative heading directions. The classification is implemented as an end-to-end Convolutional Neural Network (CNN), trained on our proposed Spherical-Navi image dataset, whose category labels can be efficiently collected. This CNN is capable of predicting potential path directions with high confidence levels based on a single, uncalibrated spherical image. Experimental results demonstrate that the proposed framework outperforms competing ones in realistic applications.

A graph-based network-vulnerability analysis system

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

Swiler, L.P.; Phillips, C.; Gaylor, T.

1998-05-03

This paper presents a graph based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example themore » class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level of effort for the attacker, various graph algorithms such as shortest path algorithms can identify the attack paths with the highest probability of success.« less

A graph-based network-vulnerability analysis system

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

Swiler, L.P.; Phillips, C.; Gaylor, T.

1998-01-01

This report presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the classmore » of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level-of-effort for the attacker, various graph algorithms such as shortest-path algorithms can identify the attack paths with the highest probability of success.« less

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

PubMed Central

Wang, Haiyan; He, Ke

2018-01-01

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. PMID:29690621

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

PubMed

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.

Path Finding for Maximum Value of Information in Multi-Modal Underwater Wireless Sensor Networks

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

Gjanci, Petrika; Petrioli, Chiara; Basagni, Stefano

Here, we consider underwater multi-modal wireless sensor networks (UWSNs) suitable for applications on submarine surveillance and monitoring, where nodes offload data to a mobile autonomous underwater vehicle (AUV) via optical technology, and coordinate using acoustic communication. Sensed data are associated with a value, decaying in time. In this scenario, we address the problem of finding the path of the AUV so that the Value of Information (VoI) of the data delivered to a sink on the surface is maximized. We define a Greedy and Adaptive AUV Path-finding (GAAP) heuristic that drives the AUV to collect data from nodes depending onmore » the VoI of their data. For benchmarking the performance of AUV path-finding heuristics, we define an integer linear programming (ILP) formulation that accurately models the considered scenario, deriving a path that drives the AUV to collect and deliver data with the maximum VoI. In our experiments GAAP consistently delivers more than 80 percent of the theoretical maximum VoI determined by the ILP model. We also compare the performance of GAAP with that of other strategies for driving the AUV among sensing nodes, namely, random paths, TSP-based paths and a “lawn mower”-like strategy. Our results show that GAAP always outperforms every other heuristic in terms of delivered VoI, also obtaining higher energy efficiency.« less

Path Finding for Maximum Value of Information in Multi-Modal Underwater Wireless Sensor Networks

DOE PAGES

Gjanci, Petrika; Petrioli, Chiara; Basagni, Stefano; ...

2017-05-19

Here, we consider underwater multi-modal wireless sensor networks (UWSNs) suitable for applications on submarine surveillance and monitoring, where nodes offload data to a mobile autonomous underwater vehicle (AUV) via optical technology, and coordinate using acoustic communication. Sensed data are associated with a value, decaying in time. In this scenario, we address the problem of finding the path of the AUV so that the Value of Information (VoI) of the data delivered to a sink on the surface is maximized. We define a Greedy and Adaptive AUV Path-finding (GAAP) heuristic that drives the AUV to collect data from nodes depending onmore » the VoI of their data. For benchmarking the performance of AUV path-finding heuristics, we define an integer linear programming (ILP) formulation that accurately models the considered scenario, deriving a path that drives the AUV to collect and deliver data with the maximum VoI. In our experiments GAAP consistently delivers more than 80 percent of the theoretical maximum VoI determined by the ILP model. We also compare the performance of GAAP with that of other strategies for driving the AUV among sensing nodes, namely, random paths, TSP-based paths and a “lawn mower”-like strategy. Our results show that GAAP always outperforms every other heuristic in terms of delivered VoI, also obtaining higher energy efficiency.« less

Scale-free Graphs for General Aviation Flight Schedules

NASA Technical Reports Server (NTRS)

Alexandov, Natalia M. (Technical Monitor); Kincaid, Rex K.

2003-01-01

In the late 1990s a number of researchers noticed that networks in biology, sociology, and telecommunications exhibited similar characteristics unlike standard random networks. In particular, they found that the cummulative degree distributions of these graphs followed a power law rather than a binomial distribution and that their clustering coefficients tended to a nonzero constant as the number of nodes, n, became large rather than O(1/n). Moreover, these networks shared an important property with traditional random graphs as n becomes large the average shortest path length scales with log n. This latter property has been coined the small-world property. When taken together these three properties small-world, power law, and constant clustering coefficient describe what are now most commonly referred to as scale-free networks. Since 1997 at least six books and over 400 articles have been written about scale-free networks. In this manuscript an overview of the salient characteristics of scale-free networks. Computational experience will be provided for two mechanisms that grow (dynamic) scale-free graphs. Additional computational experience will be given for constructing (static) scale-free graphs via a tabu search optimization approach. Finally, a discussion of potential applications to general aviation networks is given.

Neural Network Assisted Inverse Dynamic Guidance for Terminally Constrained Entry Flight

PubMed Central

Chen, Wanchun

2014-01-01

This paper presents a neural network assisted entry guidance law that is designed by applying Bézier approximation. It is shown that a fully constrained approximation of a reference trajectory can be made by using the Bézier curve. Applying this approximation, an inverse dynamic system for an entry flight is solved to generate guidance command. The guidance solution thus gotten ensures terminal constraints for position, flight path, and azimuth angle. In order to ensure terminal velocity constraint, a prediction of the terminal velocity is required, based on which, the approximated Bézier curve is adjusted. An artificial neural network is used for this prediction of the terminal velocity. The method enables faster implementation in achieving fully constrained entry flight. Results from simulations indicate improved performance of the neural network assisted method. The scheme is expected to have prospect for further research on automated onboard control of terminal velocity for both reentry and terminal guidance laws. PMID:24723821

On the Performance of TCP Spoofing in Satellite Networks

NASA Technical Reports Server (NTRS)

Ishac, Joseph; Allman, Mark

2001-01-01

In this paper, we analyze the performance of Transmission Control Protocol (TCP) in a network that consists of both satellite and terrestrial components. One method, proposed by outside research, to improve the performance of data transfers over satellites is to use a performance enhancing proxy often dubbed 'spoofing.' Spoofing involves the transparent splitting of a TCP connection between the source and destination by some entity within the network path. In order to analyze the impact of spoofing, we constructed a simulation suite based around the network simulator ns-2. The simulation reflects a host with a satellite connection to the Internet and allows the option to spoof connections just prior to the satellite. The methodology used in our simulation allows us to analyze spoofing over a large range of file sizes and under various congested conditions, while prior work on this topic has primarily focused on bulk transfers with no congestion. As a result of these simulations, we find that the performance of spoofing is dependent upon a number of conditions.

Scheduling of House Development Projects with CPM and PERT Method for Time Efficiency (Case Study: House Type 36)

NASA Astrophysics Data System (ADS)

Kholil, Muhammad; Nurul Alfa, Bonitasari; Hariadi, Madjumsyah

2018-04-01

Network planning is one of the management techniques used to plan and control the implementation of a project, which shows the relationship between activities. The objective of this research is to arrange network planning on house construction project on CV. XYZ and to know the role of network planning in increasing the efficiency of time so that can be obtained the optimal project completion period. This research uses descriptive method, where the data collected by direct observation to the company, interview, and literature study. The result of this research is optimal time planning in project work. Based on the results of the research, it can be concluded that the use of the both methods in scheduling of house construction project gives very significant effect on the completion time of the project. The company’s CPM (Critical Path Method) method can complete the project with 131 days, PERT (Program Evaluation Review and Technique) Method takes 136 days. Based on PERT calculation obtained Z = -0.66 or 0,2546 (from normal distribution table), and also obtained the value of probability or probability is 74,54%. This means that the possibility of house construction project activities can be completed on time is high enough. While without using both methods the project completion time takes 173 days. So using the CPM method, the company can save time up to 42 days and has time efficiency by using network planning.

Prediction and Validation of Disease Genes Using HeteSim Scores.

PubMed

Zeng, Xiangxiang; Liao, Yuanlu; Liu, Yuansheng; Zou, Quan

2017-01-01

Deciphering the gene disease association is an important goal in biomedical research. In this paper, we use a novel relevance measure, called HeteSim, to prioritize candidate disease genes. Two methods based on heterogeneous networks constructed using protein-protein interaction, gene-phenotype associations, and phenotype-phenotype similarity, are presented. In HeteSim_MultiPath (HSMP), HeteSim scores of different paths are combined with a constant that dampens the contributions of longer paths. In HeteSim_SVM (HSSVM), HeteSim scores are combined with a machine learning method. The 3-fold experiments show that our non-machine learning method HSMP performs better than the existing non-machine learning methods, our machine learning method HSSVM obtains similar accuracy with the best existing machine learning method CATAPULT. From the analysis of the top 10 predicted genes for different diseases, we found that HSSVM avoid the disadvantage of the existing machine learning based methods, which always predict similar genes for different diseases. The data sets and Matlab code for the two methods are freely available for download at http://lab.malab.cn/data/HeteSim/index.jsp.

Study on loading path optimization of internal high pressure forming process

NASA Astrophysics Data System (ADS)

Jiang, Shufeng; Zhu, Hengda; Gao, Fusheng

2017-09-01

In the process of internal high pressure forming, there is no formula to describe the process parameters and forming results. The article use numerical simulation to obtain several input parameters and corresponding output result, use the BP neural network to found their mapping relationship, and with weighted summing method make each evaluating parameters to set up a formula which can evaluate quality. Then put the training BP neural network into the particle swarm optimization, and take the evaluating formula of the quality as adapting formula of particle swarm optimization, finally do the optimization and research at the range of each parameters. The results show that the parameters obtained by the BP neural network algorithm and the particle swarm optimization algorithm can meet the practical requirements. The method can solve the optimization of the process parameters in the internal high pressure forming process.

Predicting protein folding rate change upon point mutation using residue-level coevolutionary information.

PubMed

Mallik, Saurav; Das, Smita; Kundu, Sudip

2016-01-01

Change in folding kinetics of globular proteins upon point mutation is crucial to a wide spectrum of biological research, such as protein misfolding, toxicity, and aggregations. Here we seek to address whether residue-level coevolutionary information of globular proteins can be informative to folding rate changes upon point mutations. Generating residue-level coevolutionary networks of globular proteins, we analyze three parameters: relative coevolution order (rCEO), network density (ND), and characteristic path length (CPL). A point mutation is considered to be equivalent to a node deletion of this network and respective percentage changes in rCEO, ND, CPL are found linearly correlated (0.84, 0.73, and -0.61, respectively) with experimental folding rate changes. The three parameters predict the folding rate change upon a point mutation with 0.031, 0.045, and 0.059 standard errors, respectively. © 2015 Wiley Periodicals, Inc.

More than a meal: integrating non-feeding interactions into food webs

USGS Publications Warehouse

Kéfi, Sonia; Berlow, Eric L.; Wieters, Evie A.; Navarrete, Sergio A.; Petchey, Owen L.; Wood, Spencer A.; Boit, Alice; Joppa, Lucas N.; Lafferty, Kevin D.; Williams, Richard J.; Martinez, Neo D.; Menge, Bruce A.; Blanchette, Carol A.; Iles, Alison C.; Brose, Ulrich

2012-01-01

Organisms eating each other are only one of many types of well documented and important interactions among species. Other such types include habitat modification, predator interference and facilitation. However, ecological network research has been typically limited to either pure food webs or to networks of only a few (<3) interaction types. The great diversity of non-trophic interactions observed in nature has been poorly addressed by ecologists and largely excluded from network theory. Herein, we propose a conceptual framework that organises this diversity into three main functional classes defined by how they modify specific parameters in a dynamic food web model. This approach provides a path forward for incorporating non-trophic interactions in traditional food web models and offers a new perspective on tackling ecological complexity that should stimulate both theoretical and empirical approaches to understanding the patterns and dynamics of diverse species interactions in nature.

An Investigation of the Differences and Similarities between Generated Small-World Networks for Right- and Left-Hand Motor Imageries.

PubMed

Zhang, Jiang; Li, Yuyao; Chen, Huafu; Ding, Jurong; Yuan, Zhen

2016-11-04

In this study, small-world network analysis was performed to identify the similarities and differences between functional brain networks for right- and left-hand motor imageries (MIs). First, Pearson correlation coefficients among the nodes within the functional brain networks from healthy subjects were calculated. Then, small-world network indicators, including the clustering coefficient, the average path length, the global efficiency, the local efficiency, the average node degree, and the small-world index, were generated for the functional brain networks during both right- and left-hand MIs. We identified large differences in the small-world network indicators between the functional networks during MI and in the random networks. More importantly, the functional brain networks underlying the right- and left-hand MIs exhibited similar small-world properties in terms of the clustering coefficient, the average path length, the global efficiency, and the local efficiency. By contrast, the right- and left-hand MI brain networks showed differences in small-world characteristics, including indicators such as the average node degree and the small-world index. Interestingly, our findings also suggested that the differences in the activity intensity and range, the average node degree, and the small-world index of brain networks between the right- and left-hand MIs were associated with the asymmetry of brain functions.

Apply network coding for H.264/SVC multicasting

NASA Astrophysics Data System (ADS)

Wang, Hui; Kuo, C.-C. Jay

2008-08-01

In a packet erasure network environment, video streaming benefits from error control in two ways to achieve graceful degradation. The first approach is application-level (or the link-level) forward error-correction (FEC) to provide erasure protection. The second error control approach is error concealment at the decoder end to compensate lost packets. A large amount of research work has been done in the above two areas. More recently, network coding (NC) techniques have been proposed for efficient data multicast over networks. It was shown in our previous work that multicast video streaming benefits from NC for its throughput improvement. An algebraic model is given to analyze the performance in this work. By exploiting the linear combination of video packets along nodes in a network and the SVC video format, the system achieves path diversity automatically and enables efficient video delivery to heterogeneous receivers in packet erasure channels. The application of network coding can protect video packets against the erasure network environment. However, the rank defficiency problem of random linear network coding makes the error concealment inefficiently. It is shown by computer simulation that the proposed NC video multicast scheme enables heterogenous receiving according to their capacity constraints. But it needs special designing to improve the video transmission performance when applying network coding.

Primary path reservation using enhanced slot assignment in TDMA for session admission.

PubMed

Koneri Chandrasekaran, Suresh; Savarimuthu, Prakash; Andi Elumalai, Priya; Ayyaswamy, Kathirvel

2015-01-01

Mobile ad hoc networks (MANET) is a self-organized collection of nodes that communicates without any infrastructure. Providing quality of service (QoS) in such networks is a competitive task due to unreliable wireless link, mobility, lack of centralized coordination, and channel contention. The success of many real time applications is purely based on the QoS, which can be achieved by quality aware routing (QAR) and admission control (AC). Recently proposed QoS mechanisms do focus completely on either reservation or admission control but are not better enough. In MANET, high mobility causes frequent path break due to the fact that every time the source node must find the route. In such cases the QoS session is affected. To admit a QoS session, admission control protocols must ensure the bandwidth of the relaying path before transmission starts; reservation of such bandwidth noticeably improves the admission control performance. Many TDMA based reservation mechanisms are proposed but need some improvement over slot reservation procedures. In order to overcome this specific issue, we propose a framework-PRAC (primary path reservation admission control protocol), which achieves improved QoS by making use of backup route combined with resource reservation. A network topology has been simulated and our approach proves to be a mechanism that admits the session effectively.

Multigranular integrated services optical network

NASA Astrophysics Data System (ADS)

Yu, Oliver; Yin, Leping; Xu, Huan; Liao, Ming

2006-12-01

Based on all-optical switches without requiring fiber delay lines and optical-electrical-optical interfaces, the multigranular optical switching (MGOS) network integrates three transport services via unified core control to efficiently support bursty and stream traffic of subwavelength to multiwavelength bandwidth. Adaptive robust optical burst switching (AR-OBS) aggregates subwavelength burst traffic into asynchronous light-rate bursts, transported via slotted-time light paths established by fast two-way reservation with robust blocking recovery control. Multiwavelength optical switching (MW-OS) decomposes multiwavelength stream traffic into a group of timing-related light-rate streams, transported via a light-path group to meet end-to-end delay-variation requirements. Optical circuit switching (OCS) simply converts wavelength stream traffic from an electrical-rate into a light-rate stream. The MGOS network employs decoupled routing, wavelength, and time-slot assignment (RWTA) and novel group routing and wavelength assignment (GRWA) to select slotted-time light paths and light-path groups, respectively. The selected resources are reserved by the unified multigranular robust fast optical reservation protocol (MG-RFORP). Simulation results show that elastic traffic is efficiently supported via AR-OBS in terms of loss rate and wavelength utilization, while connection-oriented wavelength traffic is efficiently supported via wavelength-routed OCS in terms of connection blocking and wavelength utilization. The GRWA-tuning result for MW-OS is also shown.

Characteristics of Effective Leadership Networks

ERIC Educational Resources Information Center

Leithwood, Kenneth; Azah, Vera Ndifor

2016-01-01

Purpose: The purpose of this paper is to inquire about the characteristics of effective school leadership networks and the contribution of such networks to the development of individual leaders' professional capacities. Design/methodology/approach: The study used path-analytic techniques with survey data provided by 450 school and district leaders…

76 FR 51271 - Implementing a Nationwide, Broadband, Interoperable Public Safety Network in the 700 MHz Band

Federal Register 2010, 2011, 2012, 2013, 2014

2011-08-18

... Docket 07-100; FCC 11-6] Implementing a Nationwide, Broadband, Interoperable Public Safety Network in the... interoperable public safety broadband network. The establishment of a common air interface for 700 MHz public safety broadband networks will create a foundation for interoperability and provide a clear path for the...

Promoting Scientific Collaboration in South America through IDD-Brazil

NASA Astrophysics Data System (ADS)

Chagas, G. O.

2006-05-01

The IDD-Brazil constitutes of an expansion of the Unidata Internet Data Distribution (IDD), a joint effort among the Laboratório de Prognósticos em Mesoescala - Universidade Federal do Rio de Janeiro (LPM/UFRJ), Centro de PreviSão de Tempo e Estudos Climáticos (CPTEC, a division of INPE) and the Unidata Program Center, linking several Brazilian and South American Institutions in a network for near-real time data sharing. This international cooperation is modifying drastically the way that researchers use data, providing access to broaden and more detailed information, available freely for the participants of this network. Data-sharing is one of the biggest issues in Brazil, and the solutions developed at Unidata Program Center enhances not only data access and management, but also the display and analysis of a variety of datasets. Using the Local Data Manager (LDM), a site can both receive and send data trough the IDD network, on a client-server architecture. Moreover, this system also provides a seamless integration with many decoders, following WMO standards for a large array of data, ranging from METAR messages to GRIB. Using this network as a new path to deliver and acquire observational data, IDD-Brazil participants are now capable of receiving observational data not only from GTS (Global Telecommunication System), but also from CPTECs PCD (automatic stations) network and the entire array of METAR and SYNOP observations, in a near-real time basis. This network is capable of addressing a gap in data sharing, since it has no cost for educational and research purposes. The UFRJ has been working closely with CPTEC and Unidata, porting new datasets to this system, such as the output from CPTEC's ETA 40km regional model, local acquired Satellite Imagery from GOES, and LPM's MM5 and WRF 20km mesoscale models. The IDD-Brazil is creating a new cooperation among several institutions that traditionally face the same issues, but never had a link to a community. The new challenge faced is the dissemination of this knowledge, a key factor to increase the number of participants. In order to facilitate the dialogue among these institutions, training sessions are planned to occur, and also the involvement in key events - such as the Brazilian Meteorology Meeting an the 8th International Conference on Southern Hemisphere Meteorology and Oceanography. Any University or Research Center can, and its encouraged to, share its data with other IDD participants. Constant outreach efforts driven by Unidata, UFRJ and CPTEC are increasing the number of participants in IDD-Brazil, setting new paths for research, empowering Meteorology nationwide, and creating new collaborations throughout the Americas.

Roads at risk - traffic detours from debris flows in southern Norway

NASA Astrophysics Data System (ADS)

Meyer, N. K.; Schwanghart, W.; Korup, O.; Nadim, F.

2014-10-01

Globalization and interregional exchange of people, goods, and services has boosted the importance of and reliance on all kinds of transport networks. The linear structure of road networks is especially sensitive to natural hazards. In southern Norway, steep topography and extreme weather events promote frequent traffic disruption caused by debris flows. Topographic susceptibility and trigger frequency maps serve as input into a hazard appraisal at the scale of first-order catchments to quantify the impact of debris flows on the road network in terms of a failure likelihood of each link connecting two network vertices, e.g., road junctions. We compute total additional traffic loads as a function of traffic volume and excess distance, i.e. the extra length of an alternative path connecting two previously disrupted network vertices using a shortest-path algorithm. Our risk metric of link failure is the total additional annual traffic load expressed as vehicle kilometers because of debris-flow related road closures. We present two scenarios demonstrating the impact of debris flows on the road network, and quantify the associated path failure likelihood between major cities in southern Norway. The scenarios indicate that major routes crossing the central and northwestern part of the study area are associated with high link failure risk. Yet options for detours on major routes are manifold, and incur only little additional costs provided that drivers are sufficiently well informed about road closures. Our risk estimates may be of importance to road network managers and transport companies relying of speedy delivery of services and goods.

Roads at risk: traffic detours from debris flows in southern Norway

NASA Astrophysics Data System (ADS)

Meyer, N. K.; Schwanghart, W.; Korup, O.; Nadim, F.

2015-05-01

Globalisation and interregional exchange of people, goods, and services has boosted the importance of and reliance on all kinds of transport networks. The linear structure of road networks is especially sensitive to natural hazards. In southern Norway, steep topography and extreme weather events promote frequent traffic disruption caused by debris flows. Topographic susceptibility and trigger frequency maps serve as input into a hazard appraisal at the scale of first-order catchments to quantify the impact of debris flows on the road network in terms of a failure likelihood of each link connecting two network vertices, e.g. road junctions. We compute total additional traffic loads as a function of traffic volume and excess distance, i.e. the extra length of an alternative path connecting two previously disrupted network vertices using a shortest-path algorithm. Our risk metric of link failure is the total additional annual traffic load, expressed as vehicle kilometres, because of debris-flow-related road closures. We present two scenarios demonstrating the impact of debris flows on the road network and quantify the associated path-failure likelihood between major cities in southern Norway. The scenarios indicate that major routes crossing the central and north-western part of the study area are associated with high link-failure risk. Yet options for detours on major routes are manifold and incur only little additional costs provided that drivers are sufficiently well informed about road closures. Our risk estimates may be of importance to road network managers and transport companies relying on speedy delivery of services and goods.

Temporal variation in bat-fruit interactions: Foraging strategies influence network structure over time

NASA Astrophysics Data System (ADS)

Zapata-Mesa, Natalya; Montoya-Bustamante, Sebastián; Murillo-García, Oscar E.

2017-11-01

Mutualistic interactions, such as seed dispersal, are important for the maintenance of structure and stability of tropical communities. However, there is a lack of information about spatial and temporal variation in plant-animal interaction networks. Thus, our goal was to assess the effect of bat's foraging strategies on temporal variation in the structure and robustness of bat-fruit networks in both a dry and a rain tropical forest. We evaluated monthly variation in bat-fruit networks by using seven structure metrics: network size, average path length, nestedness, modularity, complementary specialization, normalized degree and betweenness centrality. Seed dispersal networks showed variations in size, species composition and modularity; did not present nested structures and their complementary specialization was high compared to other studies. Both networks presented short path lengths, and a constantly high robustness, despite their monthly variations. Sedentary bat species were recorded during all the study periods and occupied more central positions than nomadic species. We conclude that foraging strategies are important structuring factors that affect the dynamic of networks by determining the functional roles of frugivorous bats over time; thus sedentary bats are more important than nomadic species for the maintenance of the network structure, and their conservation is a must.

Solving fuzzy shortest path problem by genetic algorithm

NASA Astrophysics Data System (ADS)

Syarif, A.; Muludi, K.; Adrian, R.; Gen, M.

2018-03-01

Shortest Path Problem (SPP) is known as one of well-studied fields in the area Operations Research and Mathematical Optimization. It has been applied for many engineering and management designs. The objective is usually to determine path(s) in the network with minimum total cost or traveling time. In the past, the cost value for each arc was usually assigned or estimated as a deteministic value. For some specific real world applications, however, it is often difficult to determine the cost value properly. One way of handling such uncertainty in decision making is by introducing fuzzy approach. With this situation, it will become difficult to solve the problem optimally. This paper presents the investigations on the application of Genetic Algorithm (GA) to a new SPP model in which the cost values are represented as Triangular Fuzzy Number (TFN). We adopts the concept of ranking fuzzy numbers to determine how good the solutions. Here, by giving his/her degree value, the decision maker can determine the range of objective value. This would be very valuable for decision support system in the real world applications.Simulation experiments were carried out by modifying several test problems with 10-25 nodes. It is noted that the proposed approach is capable attaining a good solution with different degree of optimism for the tested problems.

Properties of a new small-world network with spatially biased random shortcuts

NASA Astrophysics Data System (ADS)

Matsuzawa, Ryo; Tanimoto, Jun; Fukuda, Eriko

2017-11-01

This paper introduces a small-world (SW) network with a power-law distance distribution that differs from conventional models in that it uses completely random shortcuts. By incorporating spatial constraints, we analyze the divergence of the proposed model from conventional models in terms of fundamental network properties such as clustering coefficient, average path length, and degree distribution. We find that when the spatial constraint more strongly prohibits a long shortcut, the clustering coefficient is improved and the average path length increases. We also analyze the spatial prisoner's dilemma (SPD) games played on our new SW network in order to understand its dynamical characteristics. Depending on the basis graph, i.e., whether it is a one-dimensional ring or a two-dimensional lattice, and the parameter controlling the prohibition of long-distance shortcuts, the emergent results can vastly differ.

Network acceleration techniques

NASA Technical Reports Server (NTRS)

Crowley, Patricia (Inventor); Maccabe, Arthur Barney (Inventor); Awrach, James Michael (Inventor)

2012-01-01

Splintered offloading techniques with receive batch processing are described for network acceleration. Such techniques offload specific functionality to a NIC while maintaining the bulk of the protocol processing in the host operating system ("OS"). The resulting protocol implementation allows the application to bypass the protocol processing of the received data. Such can be accomplished this by moving data from the NIC directly to the application through direct memory access ("DMA") and batch processing the receive headers in the host OS when the host OS is interrupted to perform other work. Batch processing receive headers allows the data path to be separated from the control path. Unlike operating system bypass, however, the operating system still fully manages the network resource and has relevant feedback about traffic and flows. Embodiments of the present disclosure can therefore address the challenges of networks with extreme bandwidth delay products (BWDP).

Quantifying the underlying landscape and paths of cancer

PubMed Central

Li, Chunhe; Wang, Jin

2014-01-01

Cancer is a disease regulated by the underlying gene networks. The emergence of normal and cancer states as well as the transformation between them can be thought of as a result of the gene network interactions and associated changes. We developed a global potential landscape and path framework to quantify cancer and associated processes. We constructed a cancer gene regulatory network based on the experimental evidences and uncovered the underlying landscape. The resulting tristable landscape characterizes important biological states: normal, cancer and apoptosis. The landscape topography in terms of barrier heights between stable state attractors quantifies the global stability of the cancer network system. We propose two mechanisms of cancerization: one is by the changes of landscape topography through the changes in regulation strengths of the gene networks. The other is by the fluctuations that help the system to go over the critical barrier at fixed landscape topography. The kinetic paths from least action principle quantify the transition processes among normal state, cancer state and apoptosis state. The kinetic rates provide the quantification of transition speeds among normal, cancer and apoptosis attractors. By the global sensitivity analysis of the gene network parameters on the landscape topography, we uncovered some key gene regulations determining the transitions between cancer and normal states. This can be used to guide the design of new anti-cancer tactics, through cocktail strategy of targeting multiple key regulation links simultaneously, for preventing cancer occurrence or transforming the early cancer state back to normal state. PMID:25232051

An improved hierarchical A * algorithm in the optimization of parking lots

NASA Astrophysics Data System (ADS)

Wang, Yong; Wu, Junjuan; Wang, Ying

2017-08-01

In the parking lot parking path optimization, the traditional evaluation index is the shortest distance as the best index and it does not consider the actual road conditions. Now, the introduction of a more practical evaluation index can not only simplify the hardware design of the boot system but also save the software overhead. Firstly, we establish the parking lot network graph RPCDV mathematical model and all nodes in the network is divided into two layers which were constructed using different evaluation function base on the improved hierarchical A * algorithm which improves the time optimal path search efficiency and search precision of the evaluation index. The final results show that for different sections of the program attribute parameter algorithm always faster the time to find the optimal path.

Price of anarchy on heterogeneous traffic-flow networks.

PubMed

Rose, A; O'Dea, R; Hopcraft, K I

2016-09-01

The efficiency of routing traffic through a network, comprising nodes connected by links whose cost of traversal is either fixed or varies in proportion to volume of usage, can be measured by the "price of anarchy." This is the ratio of the cost incurred by agents who act to minimize their individual expenditure to the optimal cost borne by the entire system. As the total traffic load and the network variability-parameterized by the proportion of variable-cost links in the network-changes, the behaviors that the system presents can be understood with the introduction of a network of simpler structure. This is constructed from classes of nonoverlapping paths connecting source to destination nodes that are characterized by the number of variable-cost edges they contain. It is shown that localized peaks in the price of anarchy occur at critical traffic volumes at which it becomes beneficial to exploit ostensibly more expensive paths as the network becomes more congested. Simulation results verifying these findings are presented for the variation of the price of anarchy with the network's size, aspect ratio, variability, and traffic load.

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

PubMed

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

2011-02-21

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

Distributive routing and congestion control in wireless multihop ad hoc communication networks

NASA Astrophysics Data System (ADS)

Glauche, Ingmar; Krause, Wolfram; Sollacher, Rudolf; Greiner, Martin

2004-10-01

Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example network connectivity, good data traffic performance and robustness are guaranteed. In this contribution the focus is on routing and congestion control. First, random data traffic along shortest path routes is studied by simulations as well as theoretical modeling. Measures of congestion like end-to-end time delay and relaxation times are given. A scaling law of the average time delay with respect to network size is revealed and found to depend on the underlying network topology. In the second step, a distributive routing and congestion control is proposed. Each node locally propagates its routing cost estimates and information about its congestion state to its neighbors, which then update their respective cost estimates. This allows for a flexible adaptation of end-to-end routes to the overall congestion state of the network. Compared to shortest-path routing, the critical network load is significantly increased.

Purpose-Driven Communities in Multiplex Networks: Thresholding User-Engaged Layer Aggregation

DTIC Science & Technology

2016-06-01

dark networks is a non-trivial yet useful task. Because terrorists work hard to hide their relationships/network, analysts have an incomplete picture...them identify meaningful terrorist communities. This thesis introduces a general-purpose algorithm for community detection in multiplex dark networks...aggregation, dark networks, conductance, cluster adequacy, mod- ularity, Louvain method, shortest path interdiction 15. NUMBER OF PAGES 155 16. PRICE CODE

Electronic Resources for Security Related Information, CIAC-2307 R.1

DTIC Science & Technology

1994-12-01

administrators NETwork - Statistics about the network NODEntry node1 <node2 <…>> - BITEARN NODES entry for the specified node(s) NODEntry node1 / abc */xyz...Just the “:xyz.” tag and all tags whose name starts with “ abc ” PATHs snode node1 <node2 <…>> - BITNET path between “snode” and the specified node(s...protect their data and sytems . The mention of vendors or product names does not imply criticism or endorsement by the National Institute of Standards

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

PubMed

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.

The Use and Significance of a Research Networking System

PubMed Central

Yuan, Leslie; Daigre, John; Meeks, Eric; Nelson, Katie; Piontkowski, Cynthia; Reuter, Katja; Sak, Rachael; Turner, Brian; Weber, Griffin M; Chatterjee, Anirvan

2014-01-01

Background Universities have begun deploying public Internet systems that allow for easy search of their experts, expertise, and intellectual networks. Deployed first in biomedical schools but now being implemented more broadly, the initial motivator of these research networking systems was to enable easier identification of collaborators and enable the development of teams for research. Objective The intent of the study was to provide the first description of the usage of an institutional research “social networking” system or research networking system (RNS). Methods Number of visits, visitor location and type, referral source, depth of visit, search terms, and click paths were derived from 2.5 years of Web analytics data. Feedback from a pop-up survey presented to users over 15 months was summarized. Results RNSs automatically generate and display profiles and networks of researchers. Within 2.5 years, the RNS at the University of California, San Francisco (UCSF) achieved one-seventh of the monthly visit rate of the main longstanding university website, with an increasing trend. Visitors came from diverse locations beyond the institution. Close to 75% (74.78%, 208,304/278,570) came via a public search engine and 84.0% (210 out of a sample of 250) of these queried an individual’s name that took them directly to the relevant profile page. In addition, 20.90% (214 of 1024) visits went beyond the page related to a person of interest to explore related researchers and topics through the novel and networked information provided by the tool. At the end of the period analyzed, more than 2000 visits per month traversed 5 or more links into related people and topics. One-third of visits came from returning visitors who were significantly more likely to continue to explore networked people and topics (P<.001). Responses to an online survey suggest a broad range of benefits of using the RNS in supporting the research and clinical mission. Conclusions Returning visitors in an ever-increasing pool of visitors to an RNS are among those that display behavior consistent with using the tool to identify new collaborators or research topics. Through direct user feedback we know that some visits do result in research-enhancing outcomes, although we cannot address the scale of impact. With the rapid pace of acquiring visitors searching for individual names, the RNS is evolving into a new kind of gateway for the university. PMID:24509520

Real-time network traffic classification technique for wireless local area networks based on compressed sensing

NASA Astrophysics Data System (ADS)

Balouchestani, Mohammadreza

2017-05-01

Network traffic or data traffic in a Wireless Local Area Network (WLAN) is the amount of network packets moving across a wireless network from each wireless node to another wireless node, which provide the load of sampling in a wireless network. WLAN's Network traffic is the main component for network traffic measurement, network traffic control and simulation. Traffic classification technique is an essential tool for improving the Quality of Service (QoS) in different wireless networks in the complex applications such as local area networks, wireless local area networks, wireless personal area networks, wireless metropolitan area networks, and wide area networks. Network traffic classification is also an essential component in the products for QoS control in different wireless network systems and applications. Classifying network traffic in a WLAN allows to see what kinds of traffic we have in each part of the network, organize the various kinds of network traffic in each path into different classes in each path, and generate network traffic matrix in order to Identify and organize network traffic which is an important key for improving the QoS feature. To achieve effective network traffic classification, Real-time Network Traffic Classification (RNTC) algorithm for WLANs based on Compressed Sensing (CS) is presented in this paper. The fundamental goal of this algorithm is to solve difficult wireless network management problems. The proposed architecture allows reducing False Detection Rate (FDR) to 25% and Packet Delay (PD) to 15 %. The proposed architecture is also increased 10 % accuracy of wireless transmission, which provides a good background for establishing high quality wireless local area networks.

Construction and analysis of protein-protein interaction networks based on proteomics data of prostate cancer

PubMed Central

CHEN, CHEN; SHEN, HONG; ZHANG, LI-GUO; LIU, JIAN; CAO, XIAO-GE; YAO, AN-LIANG; KANG, SHAO-SAN; GAO, WEI-XING; HAN, HUI; CAO, FENG-HONG; LI, ZHI-GUO

2016-01-01

Currently, using human prostate cancer (PCa) tissue samples to conduct proteomics research has generated a large amount of data; however, only a very small amount has been thoroughly investigated. In this study, we manually carried out the mining of the full text of proteomics literature that involved comparisons between PCa and normal or benign tissue and identified 41 differentially expressed proteins verified or reported more than 2 times from different research studies. We regarded these proteins as seed proteins to construct a protein-protein interaction (PPI) network. The extended network included one giant network, which consisted of 1,264 nodes connected via 1,744 edges, and 3 small separate components. The backbone network was then constructed, which was derived from key nodes and the subnetwork consisting of the shortest path between seed proteins. Topological analyses of these networks were conducted to identify proteins essential for the genesis of PCa. Solute carrier family 2 (facilitated glucose transporter), member 4 (SLC2A4) had the highest closeness centrality located in the center of each network, and the highest betweenness centrality and largest degree in the backbone network. Tubulin, beta 2C (TUBB2C) had the largest degree in the giant network and subnetwork. In addition, using module analysis of the whole PPI network, we obtained a densely connected region. Functional annotation indicated that the Ras protein signal transduction biological process, mitogen-activated protein kinase (MAPK), neurotrophin and the gonadotropin-releasing hormone (GnRH) signaling pathway may play an important role in the genesis and development of PCa. Further investigation of the SLC2A4, TUBB2C proteins, and these biological processes and pathways may therefore provide a potential target for the diagnosis and treatment of PCa. PMID:27121963

Right-side-stretched multifractal spectra indicate small-worldness in networks

NASA Astrophysics Data System (ADS)

Oświȩcimka, Paweł; Livi, Lorenzo; Drożdż, Stanisław

2018-04-01

Complex network formalism allows to explain the behavior of systems composed by interacting units. Several prototypical network models have been proposed thus far. The small-world model has been introduced to mimic two important features observed in real-world systems: i) local clustering and ii) the possibility to move across a network by means of long-range links that significantly reduce the characteristic path length. A natural question would be whether there exist several ;types; of small-world architectures, giving rise to a continuum of models with properties (partially) shared with other models belonging to different network families. Here, we take advantage of the interplay between network theory and time series analysis and propose to investigate small-world signatures in complex networks by analyzing multifractal characteristics of time series generated from such networks. In particular, we suggest that the degree of right-sided asymmetry of multifractal spectra is linked with the degree of small-worldness present in networks. This claim is supported by numerical simulations performed on several parametric models, including prototypical small-world networks, scale-free, fractal and also real-world networks describing protein molecules. Our results also indicate that right-sided asymmetry emerges with the presence of the following topological properties: low edge density, low average shortest path, and high clustering coefficient.

Advancing research opportunities and promoting pathways in graduate education: a systemic approach to BUILD training at California State University, Long Beach (CSULB).

PubMed

Urizar, Guido G; Henriques, Laura; Chun, Chi-Ah; Buonora, Paul; Vu, Kim-Phuong L; Galvez, Gino; Kingsford, Laura

2017-01-01

First-generation college graduates, racial and ethnic minorities, people with disabilities, and those from disadvantaged backgrounds are gravely underrepresented in the health research workforce representing behavioral health sciences and biomedical sciences and engineering (BHS/BSE). Furthermore, relative to their peers, very few students from these underrepresented groups (URGs) earn scientific bachelor's degrees with even fewer earning doctorate degrees. Therefore, programs that engage and retain URGs in health-related research careers early on in their career path are imperative to promote the diversity of well-trained research scientists who have the ability to address the nation's complex health challenges in an interdisciplinary way. The purpose of this paper is to describe the challenges, lessons learned, and sustainability of implementing a large-scale, multidisciplinary research infrastructure at California State University, Long Beach (CSULB) - a minority-serving institution - through federal funding received by the National Institutes of Health (NIH) Building Infrastructure Leading to Diversity (BUILD) Initiative. The CSULB BUILD initiative consists of developing a research infrastructure designed to engage and retain URGs on the research career path by providing them with the research training and skills needed to make them highly competitive for doctoral programs and entry into the research workforce. This initiative unites many research disciplines using basic, applied, and translational approaches to offer insights and develop technologies addressing prominent community and national health issues from a multidisciplinary perspective. Additionally, this initiative brings together local (e.g., high school, community college, doctoral research institutions) and national (e.g., National Research Mentoring Network) collaborative partners to alter how we identify, develop, and implement resources to enhance student and faculty research. Finally, this initiative establishes a student research training program that engages URGs earlier in their academic development, is larger and multidisciplinary in scope, and is responsive to the life contexts and promotes the cultural capital that URGs bring to their career path. Although there have been many challenges to planning for and developing CSULB BUILD's large-scale, multidisciplinary research infrastructure, there have been many lessons learned in the process that could aid other campuses in the development and sustainability of similar research programs.

An improved least cost routing approach for WDM optical network without wavelength converters

NASA Astrophysics Data System (ADS)

Bonani, Luiz H.; Forghani-elahabad, Majid

2016-12-01

Routing and wavelength assignment (RWA) problem has been an attractive problem in optical networks, and consequently several algorithms have been proposed in the literature to solve this problem. The most known techniques for the dynamic routing subproblem are fixed routing, fixed-alternate routing, and adaptive routing methods. The first one leads to a high blocking probability (BP) and the last one includes a high computational complexity and requires immense backing from the control and management protocols. The second one suggests a trade-off between performance and complexity, and hence we consider it to improve in our work. In fact, considering the RWA problem in a wavelength routed optical network with no wavelength converter, an improved technique is proposed for the routing subproblem in order to decrease the BP of the network. Based on fixed-alternate approach, the first k shortest paths (SPs) between each node pair is determined. We then rearrange the SPs according to a newly defined cost for the links and paths. Upon arriving a connection request, the sorted paths are consecutively checked for an available wavelength according to the most-used technique. We implement our proposed algorithm and the least-hop fixed-alternate algorithm to show how the rearrangement of SPs contributes to a lower BP in the network. The numerical results demonstrate the efficiency of our proposed algorithm in comparison with the others, considering different number of available wavelengths.

Electronic Neural Networks

NASA Technical Reports Server (NTRS)

Thakoor, Anil

1990-01-01

Viewgraphs on electronic neural networks for space station are presented. Topics covered include: electronic neural networks; electronic implementations; VLSI/thin film hybrid hardware for neurocomputing; computations with analog parallel processing; features of neuroprocessors; applications of neuroprocessors; neural network hardware for terrain trafficability determination; a dedicated processor for path planning; neural network system interface; neural network for robotic control; error backpropagation algorithm for learning; resource allocation matrix; global optimization neuroprocessor; and electrically programmable read only thin-film synaptic array.

DIZZYNET--a European network initiative for vertigo and balance research: visions and aims.

PubMed

Zwergal, Andreas; Brandt, Thomas; Magnusson, Mans; Kennard, Christopher

2016-04-01

Vertigo is one of the most common complaints in medicine. Despite its high prevalence, patients with vertigo often receive either inappropriate or inadequate treatment. The most important reasons for this deplorable situation are insufficient interdisciplinary cooperation, nonexistent standards in diagnostics and therapy, the relatively rare translations of basic science findings to clinical applications, and the scarcity of prospective controlled multicenter clinical trials. To overcome these problems, the German Center for Vertigo and Balance Disorders (DSGZ) started an initiative to establish a European Network for Vertigo and Balance Research called DIZZYNET. The central aim is to create a platform for collaboration and exchange among scientists, physicians, technicians, and physiotherapists in the fields of basic and translational research, clinical management, clinical trials, rehabilitation, and epidemiology. The network will also promote public awareness and help establish educational standards in the field. The DIZZYNET has the following objectives as regards structure and content: to focus on multidisciplinary translational research in vertigo and balance disorders, to develop interdisciplinary longitudinal and transversal networks for patient care by standardizing and personalizing the management of patients, to increase methodological competence by implementing common standards of practice and quality management, to internationalize the infrastructure for prospective multicenter clinical trials, to increase recruitment capacity for clinical trials, to create a common data base for patients with vertigo and balance disorders, to offer and promote attractive educational and career paths in a network of cooperating institutions. In the long term, the DIZZYNET should serve as an internationally visible network for interdisciplinary and multiprofessional research on vertigo and balance disorders. It ideally should equally attract the afflicted patients and those managing their disorders. DIZZYNET will not compete with the traditional national or international societies active in the field, but will function as an additional structure that addresses some of the above problems.

Effective distances for epidemics spreading on complex networks.

PubMed

Iannelli, Flavio; Koher, Andreas; Brockmann, Dirk; Hövel, Philipp; Sokolov, Igor M

2017-01-01

We show that the recently introduced logarithmic metrics used to predict disease arrival times on complex networks are approximations of more general network-based measures derived from random walks theory. Using the daily air-traffic transportation data we perform numerical experiments to compare the infection arrival time with this alternative metric that is obtained by accounting for multiple walks instead of only the most probable path. The comparison with direct simulations reveals a higher correlation compared to the shortest-path approach used previously. In addition our method allows to connect fundamental observables in epidemic spreading with the cumulant-generating function of the hitting time for a Markov chain. Our results provides a general and computationally efficient approach using only algebraic methods.

Effective distances for epidemics spreading on complex networks

NASA Astrophysics Data System (ADS)

Iannelli, Flavio; Koher, Andreas; Brockmann, Dirk; Hövel, Philipp; Sokolov, Igor M.

2017-01-01

We show that the recently introduced logarithmic metrics used to predict disease arrival times on complex networks are approximations of more general network-based measures derived from random walks theory. Using the daily air-traffic transportation data we perform numerical experiments to compare the infection arrival time with this alternative metric that is obtained by accounting for multiple walks instead of only the most probable path. The comparison with direct simulations reveals a higher correlation compared to the shortest-path approach used previously. In addition our method allows to connect fundamental observables in epidemic spreading with the cumulant-generating function of the hitting time for a Markov chain. Our results provides a general and computationally efficient approach using only algebraic methods.

Towards Scalable Cost-Effective Service and Survivability Provisioning in Ultra High Speed Networks

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

Bin Wang

Optical transport networks based on wavelength division multiplexing (WDM) are considered to be the most appropriate choice for future Internet backbone. On the other hand, future DOE networks are expected to have the ability to dynamically provision on-demand survivable services to suit the needs of various high performance scientific applications and remote collaboration. Since a failure in aWDMnetwork such as a cable cut may result in a tremendous amount of data loss, efficient protection of data transport in WDM networks is therefore essential. As the backbone network is moving towards GMPLS/WDM optical networks, the unique requirement to support DOE’s sciencemore » mission results in challenging issues that are not directly addressed by existing networking techniques and methodologies. The objectives of this project were to develop cost effective protection and restoration mechanisms based on dedicated path, shared path, preconfigured cycle (p-cycle), and so on, to deal with single failure, dual failure, and shared risk link group (SRLG) failure, under different traffic and resource requirement models; to devise efficient service provisioning algorithms that deal with application specific network resource requirements for both unicast and multicast; to study various aspects of traffic grooming in WDM ring and mesh networks to derive cost effective solutions while meeting application resource and QoS requirements; to design various diverse routing and multi-constrained routing algorithms, considering different traffic models and failure models, for protection and restoration, as well as for service provisioning; to propose and study new optical burst switched architectures and mechanisms for effectively supporting dynamic services; and to integrate research with graduate and undergraduate education. All objectives have been successfully met. This report summarizes the major accomplishments of this project. The impact of the project manifests in many aspects: First, the project addressed many essential problems that arisen in current and future WDM optical networks, and provided a host of innovative solutions though there was no invention or patent filing. This project resulted in more than 2 dozens publications in major journals and conferences (including papers in IEEE Transactions and journals, as well as a book chapter). Our publications have been cited by many peer researchers. In particular, one of our conference papers was nominated for the best paper award of IEEE/Create-Net Broadnets (International Conference on Broadband Communications, Networks, and Systems) 2006. Second, the results and solutions of this project were well received by DOE Labs where presentations were given by the PI. We hope to continue the collaboration with DOE Labs in the future. Third, the project was the first to propose and extensively study multicast traffic grooming, new traffic models such as sliding scheduled traffic model and scheduled traffic model. Our research has sparkled a flurry of recent studies and publications by the research community in these areas. Fourth, the project has benefited a diverse population of students by motivating, engaging, enhancing their learning and skills. The project has been conducted in a manner conducive to the training of students both at graduate and undergraduate levels. As a result, one Ph.D., Dr. Abdur Billah, was graduated. Another Ph.D. student, Tianjian Li, will graduate in January 2007. In addition, four MS students were graduated. One undergraduate student, Jeffrey Alan Shininger, completed his university honors project. Fifth, thanks to the support of this ECPI project, the PI has obtained additional funding from the National Science Foundation, the Air Force Research Lab, and other sources. A few other proposals are pending. Finally, this project has also significantly impacted the curricula and resulted in the enhancement of courses at the graduate and undergraduate levels, therefore strengthening the bond between research and education.« less

Bicriteria Network Optimization Problem using Priority-based Genetic Algorithm

NASA Astrophysics Data System (ADS)

Gen, Mitsuo; Lin, Lin; Cheng, Runwei

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

Research on a Banknote Printing Wastewater Monitoring System based on Wireless Sensor Network

NASA Astrophysics Data System (ADS)

Li, B. B.; Yuan, Z. F.

2006-10-01

In this paper, a banknote printing wastewater monitoring system based on WSN is presented in line with the system demands and actual condition of the worksite for a banknote printing factory. In Physical Layer, the network node is a nRF9e5-centric embedded instrument, which can realize the multi-function such as data collecting, status monitoring, wireless data transmission and so on. Limited by the computing capability, memory capability, communicating energy and others factors, it is impossible for the node to get every detail information of the network, so the communication protocol on WSN couldn't be very complicated. The competitive-based MACA (Multiple Access with Collision Avoidance) Protocol is introduced in MAC, which can decide the communication process and working mode of the nodes, avoid the collision of data transmission, hidden and exposed station problem of nodes. On networks layer, the routing protocol in charge of the transmitting path of the data, the networks topology structure is arranged based on address assignation. Accompanied with some redundant nodes, the network performances stabile and expandable. The wastewater monitoring system is a tentative practice of WSN theory in engineering. Now, the system has passed test and proved efficiently.

Coevolutionary dynamics of opinion propagation and social balance: The key role of small-worldness

NASA Astrophysics Data System (ADS)

Chen, Yan; Chen, Lixue; Sun, Xian; Zhang, Kai; Zhang, Jie; Li, Ping

2014-03-01

The propagation of various opinions in social networks, which influences human inter-relationships and even social structure, and hence is a most important part of social life. We have incorporated social balance into opinion propagation in social networks are influenced by social balance. The edges in networks can represent both friendly or hostile relations, and change with the opinions of individual nodes. We introduce a model to characterize the coevolutionary dynamics of these two dynamical processes on Watts-Strogatz (WS) small-world network. We employ two distinct evolution rules (i) opinion renewal; and (ii) relation adjustment. By changing the rewiring probability, and thus the small-worldness of the WS network, we found that the time for the system to reach balanced states depends critically on both the average path length and clustering coefficient of the network, which is different than other networked process like epidemic spreading. In particular, the system equilibrates most quickly when the underlying network demonstrates strong small-worldness, i.e., small average path lengths and large clustering coefficient. We also find that opinion clusters emerge in the process of the network approaching the global equilibrium, and a measure of global contrariety is proposed to quantify the balanced state of a social network.

Sensory feedback in a bump attractor model of path integration.

PubMed

Poll, Daniel B; Nguyen, Khanh; Kilpatrick, Zachary P

2016-04-01

Mammalian spatial navigation systems utilize several different sensory information channels. This information is converted into a neural code that represents the animal's current position in space by engaging place cell, grid cell, and head direction cell networks. In particular, sensory landmark (allothetic) cues can be utilized in concert with an animal's knowledge of its own velocity (idiothetic) cues to generate a more accurate representation of position than path integration provides on its own (Battaglia et al. The Journal of Neuroscience 24(19):4541-4550 (2004)). We develop a computational model that merges path integration with feedback from external sensory cues that provide a reliable representation of spatial position along an annular track. Starting with a continuous bump attractor model, we explore the impact of synaptic spatial asymmetry and heterogeneity, which disrupt the position code of the path integration process. We use asymptotic analysis to reduce the bump attractor model to a single scalar equation whose potential represents the impact of asymmetry and heterogeneity. Such imperfections cause errors to build up when the network performs path integration, but these errors can be corrected by an external control signal representing the effects of sensory cues. We demonstrate that there is an optimal strength and decay rate of the control signal when cues appear either periodically or randomly. A similar analysis is performed when errors in path integration arise from dynamic noise fluctuations. Again, there is an optimal strength and decay of discrete control that minimizes the path integration error.

[Application of extended exergy method in driving mechanism and efficiency of regional eco-economy].

PubMed

Fan, Xin Gang; Mi, Wen Bao; Hou, Jing Wei

2017-01-01

To analyze social-economic causes of the regional ecological degradation, and avoid such problems as the complex circulation network and difficulty to identify laws caused by extended exergy analysis (EEA) previously applied at the national scale, this paper reduced spatial scale to the county scale and took Pengyang County in Ningxia as an example. Eco-economic system in Peng-yang County was divided into seven interrelated sectors. The exergy value of circulations in the eco-economic system including materials, labor and capital were calculated respectively to analyze the extended exergy characteristics of the driving sectors, factors and paths and evaluate their ecological efficiency. The results showed that agriculture and households were the main driving sectors of the eco-economic system in Pengyang County. The average exergy value of 31 flow paths among the sectors was 0.80 PJ. There were only 8 flow paths whose exergy values were higher than the average value. Eco-economic system in Pengyang County development was driven by two continuous flow paths, labor output of the households sector and demands of the households sector supported by other sectors. The mineral resources were massively exploited, and then directly exported to the outside, which could not promote the local development from the inside, but, on the contrary, increase the ecological environment pressure because of the over-exploitation. The eco-efficiency of Pengyang County in 2014 was 68.1%, almost equivalent to the by-level of the national scale at home and abroad ten years ago, mainly because of the lower eco-efficiencies of the service sector and households sector. EEA had the advantage of networking and structuring, could specify the sectors, factors and driven paths, and break through the bottleneck of driving mechanism research of the eco-economic system. EEA had certain adaptability to explore the operational principle and optimal pattern of the regional eco-economic system. Compared with the national scale, EEA at the regional scale could more easily identify the driving mechanism of eco-economic system, and could clearly guide the regional administrative department to reduce the ecological environment pressure.

THE CRITICAL-PATH METHOD OF CONSTRUCTION CONTROL.

ERIC Educational Resources Information Center

DOMBROW, RODGER T.; MAUCHLY, JOHN

THIS DISCUSSION PRESENTS A DEFINITION AND BRIEF DESCRIPTION OF THE CRITICAL-PATH METHOD AS APPLIED TO BUILDING CONSTRUCTION. INTRODUCING REMARKS CONSIDER THE MOST PERTINENT QUESTIONS PERTAINING TO CPM AND THE NEEDS ASSOCIATED WITH MINIMIZING TIME AND COST ON CONSTRUCTION PROJECTS. SPECIFIC DISCUSSION INCLUDES--(1) ADVANTAGES OF NETWORK TECHNIQUES,…

Earth Education: A New Beginning.

ERIC Educational Resources Information Center

Van Matre, Steve

The Institute for Earth Education is a nonprofit volunteer group made up of an international network of individuals and member organizations devoted to helping people live more lightly on the earth. This book proposes an alternative path to solve environmental problems. The program, called the earth education path, seeks to accomplish one of…

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

ERIC Educational Resources Information Center

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…

76 FR 51463 - Petition for Waiver of Compliance

Federal Register 2010, 2011, 2012, 2013, 2014

2011-08-18

... territory. Specifically, this petition is made in connection with the implementation of PATH's Automatic Train Control (ATC) project and the plan to use unequipped PA-4 cars as maintenance-of-way (MOW) work... control (CBTC) technology throughout the PATH rail network, as described in the Positive Train Control...

Hydraulic analysis of harmonic pumping tests in frequency and time domains for identifying the conduits networks in a karstic aquifer

NASA Astrophysics Data System (ADS)

Fischer, P.; Jardani, A.; Cardiff, M.; Lecoq, N.; Jourde, H.

2018-04-01

In a karstic field, the flow paths are very complex as they globally follow the conduit network. The responses generated from an investigation in this type of aquifer can be spatially highly variable. Therefore, the aim of the investigation in this case is to define a degree of connectivity between points of the field, in order to understand these flow paths. Harmonic pumping tests represent a possible investigation method for characterizing the subsurface flow of groundwater. They have several advantages compared to a constant-rate pumping (more signal possibilities, ease of extracting the signal in the responses and possibility of closed loop investigation). We show in this work that interpreting the responses from a harmonic pumping test is very useful for delineating a degree of connectivity between measurement points. We have firstly studied the amplitude and phase offset of responses from a harmonic pumping test in a theoretical synthetic modeling case in order to define a qualitative interpretation method in the time and frequency domains. Three different type of responses have been separated: a conduit connectivity response, a matrix connectivity, and a dual connectivity (response of a point in the matrix, but close to a conduit). We have then applied this method to measured responses at a field research site. Our interpretation method permits a quick and easy reconstruction of the main flow paths, and the whole set of field responses appear to give a similar range of responses to those seen in the theoretical synthetic case.

Measuring science-technology interactions using patent citations and author-inventor links: an exploration analysis from Chinese nanotechnology

NASA Astrophysics Data System (ADS)

Wang, Gangbo; Guan, Jiancheng

2011-12-01

This article contributes to the growing study on the interactions between science and technology with China's evidence in the field of nanotechnology, based on the database of United States Patent and Trademark Office. The analysis is focused during the period of 1991-2008, a rapid increasing period for the development of nanotechnology. Using the non-patent references cited by patents, we first investigate the science-technology connections in the context of Chinese nanotechnology, especially in institutional sectors and its application fields. Those patents, produced by academic researchers and directed towards basic scientific knowledge, generally cite more scientific references with a higher proportion of self-citations. It is interesting to find that patents contributed by collaborations between public organizations and corporations seldom contain scientific references. Following an interesting path on matching the data of publications and patents, we establish the author-inventor links in this emerging field. Author-inventors, who are co-active in publishing and patenting, are at the very top of the most prolific and highly cited researchers. Finally, we employ social network analysis to explore the characteristics of scientific and technological networks generated by co-authorship and co-invention data, to investigate the position and the role of patenting-publishing scientists in these research networks.

Field-Based Optimal Placement of Antennas for Body-Worn Wireless Sensors

PubMed Central

Januszkiewicz, Łukasz; Di Barba, Paolo; Hausman, Sławomir

2016-01-01

We investigate a case of automated energy-budget-aware optimization of the physical position of nodes (sensors) in a Wireless Body Area Network (WBAN). This problem has not been presented in the literature yet, as opposed to antenna and routing optimization, which are relatively well-addressed. In our research, which was inspired by a safety-critical application for firefighters, the sensor network consists of three nodes located on the human body. The nodes communicate over a radio link operating in the 2.4 GHz or 5.8 GHz ISM frequency band. Two sensors have a fixed location: one on the head (earlobe pulse oximetry) and one on the arm (with accelerometers, temperature and humidity sensors, and a GPS receiver), while the position of the third sensor can be adjusted within a predefined region on the wearer’s chest. The path loss between each node pair strongly depends on the location of the nodes and is difficult to predict without performing a full-wave electromagnetic simulation. Our optimization scheme employs evolutionary computing. The novelty of our approach lies not only in the formulation of the problem but also in linking a fully automated optimization procedure with an electromagnetic simulator and a simplified human body model. This combination turns out to be a computationally effective solution, which, depending on the initial placement, has a potential to improve performance of our example sensor network setup by up to about 20 dB with respect to the path loss between selected nodes. PMID:27196911

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

PubMed Central

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. PMID:22319316

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

NASA Astrophysics Data System (ADS)

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.

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

PubMed

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.

Interfacing a high performance disk array file server to a Gigabit LAN

NASA Technical Reports Server (NTRS)

Seshan, Srinivasan; Katz, Randy H.

1993-01-01

Our previous prototype, RAID-1, identified several bottlenecks in typical file server architectures. The most important bottleneck was the lack of a high-bandwidth path between disk, memory, and the network. Workstation servers, such as the Sun-4/280, have very slow access to peripherals on busses far from the CPU. For the RAID-2 system, we addressed this problem by designing a crossbar interconnect, Xbus board, that provides a 40MB/s path between disk, memory, and the network interfaces. However, this interconnect does not provide the system CPU with low latency access to control the various interfaces. To provide a high data rate to clients on the network, we were forced to carefully and efficiently design the network software. A block diagram of the system hardware architecture is given. In the following subsections, we describe pieces of the RAID-2 file server hardware that had a significant impact on the design of the network interface.

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

Yang, Dr. Li; Cui, Xiaohui; Cemerlic, Alma

Ad hoc networks are very helpful in situations when no fixed network infrastructure is available, such as natural disasters and military conflicts. In such a network, all wireless nodes are equal peers simultaneously serving as both senders and routers for other nodes. Therefore, how to route packets through reliable paths becomes a fundamental problems when behaviors of certain nodes deviate from wireless ad hoc routing protocols. We proposed a novel Dirichlet reputation model based on Bayesian inference theory which evaluates reliability of each node in terms of packet delivery. Our system offers a way to predict and select a reliablemore » path through combination of first-hand observation and second-hand reputation reports. We also proposed moving window mechanism which helps to adjust ours responsiveness of our system to changes of node behaviors. We integrated the Dirichlet reputation into routing protocol of wireless ad hoc networks. Our extensive simulation indicates that our proposed reputation system can improve good throughput of the network and reduce negative impacts caused by misbehaving nodes.« less

Path optimisation of a mobile robot using an artificial neural network controller

NASA Astrophysics Data System (ADS)

Singh, M. K.; Parhi, D. R.

2011-01-01

This article proposed a novel approach for design of an intelligent controller for an autonomous mobile robot using a multilayer feed forward neural network, which enables the robot to navigate in a real world dynamic environment. The inputs to the proposed neural controller consist of left, right and front obstacle distance with respect to its position and target angle. The output of the neural network is steering angle. A four layer neural network has been designed to solve the path and time optimisation problem of mobile robots, which deals with the cognitive tasks such as learning, adaptation, generalisation and optimisation. A back propagation algorithm is used to train the network. This article also analyses the kinematic design of mobile robots for dynamic movements. The simulation results are compared with experimental results, which are satisfactory and show very good agreement. The training of the neural nets and the control performance analysis has been done in a real experimental setup.

A Dynamic Resilience Approach for WDM Optical Networks

NASA Astrophysics Data System (ADS)

Garg, Amit Kumar

2017-12-01

Optical fibres have been developed as a transmission medium to carry traffic in order to provide various services in telecommunications platform. Failure of this fibre caused loss of data which can interrupt communication services. This paper has been focused only on survivable schemes in order to guarantee both protection and restoration in WDM optical networks. In this paper, a dynamic resilience approach has been proposed whose objective is to route the flows in a way which minimizes the total amount of bandwidth used for working and protection paths. In the proposed approach, path-based protection is utilized because it yields lower overhead and is also suitable for global optimization where, in case of a single link failure, all the flows utilizing the failed link are re-routed to a pre-computed set of paths. The simulation results demonstrate that proposed approach is much more efficient as it provides better quality of services (QoS) in terms of network resource utilization, blocking probability etc. as compared to conventional protection and restoration schemes. The proposed approach seems to offer an attractive combination of features, with both ring like speed and mesh-like efficiency.

Preferential paths in yield stress fluid flow through a porous medium

NASA Astrophysics Data System (ADS)

Guasto, Jeffrey; Waisbord, Nicolas; Stoop, Norbert; Dunkel, Jörn

2016-11-01

A broad range of biological, geological, and industrial materials with complex rheological properties are subjected to flow through porous media in applications ranging from oil recovery to food manufacturing. In this experimental study, we examine the flow of a model yield stress fluid (Carbopol micro-gel) through a quasi-2D porous medium, fabricated in a microfluidic channel. The flow is driven by applying a precisely-controlled pressure gradient and measured by particle tracking velocimetry, and our observations are complemented by a pore-network model of the yield stress fluid flow. While remaining unyielded at small applied pressure, the micro-gel begins to yield at a critical pressure gradient, exhibiting a single preferential flow path that percolates through the porous medium. As the applied pressure gradient increases, we observe a subsequent coarsening and invasion of the yielded, fluidized network. An examination of both the yielded network topology and pore-scale flow reveal that two cooperative phenomena are involved in sculpting the preferential flow paths: (1) the geometry of the porous microstructure, and (2) the adhesive surface interactions between the micro-gel and substrate. NSF CBET-1511340.

Liouville action as path-integral complexity: from continuous tensor networks to AdS/CFT

NASA Astrophysics Data System (ADS)

Caputa, Pawel; Kundu, Nilay; Miyaji, Masamichi; Takayanagi, Tadashi; Watanabe, Kento

2017-11-01

We propose an optimization procedure for Euclidean path-integrals that evaluate CFT wave functionals in arbitrary dimensions. The optimization is performed by minimizing certain functional, which can be interpreted as a measure of computational complexity, with respect to background metrics for the path-integrals. In two dimensional CFTs, this functional is given by the Liouville action. We also formulate the optimization for higher dimensional CFTs and, in various examples, find that the optimized hyperbolic metrics coincide with the time slices of expected gravity duals. Moreover, if we optimize a reduced density matrix, the geometry becomes two copies of the entanglement wedge and reproduces the holographic entanglement entropy. Our approach resembles a continuous tensor network renormalization and provides a concrete realization of the proposed interpretation of AdS/CFT as tensor networks. The present paper is an extended version of our earlier report arXiv:1703.00456 and includes many new results such as evaluations of complexity functionals, energy stress tensor, higher dimensional extensions and time evolutions of thermofield double states.

Investigating brain community structure abnormalities in bipolar disorder using path length associated community estimation.

PubMed

Gadelkarim, Johnson J; Ajilore, Olusola; Schonfeld, Dan; Zhan, Liang; Thompson, Paul M; Feusner, Jamie D; Kumar, Anand; Altshuler, Lori L; Leow, Alex D

2014-05-01

In this article, we present path length associated community estimation (PLACE), a comprehensive framework for studying node-level community structure. Instead of the well-known Q modularity metric, PLACE utilizes a novel metric, Ψ(PL), which measures the difference between intercommunity versus intracommunity path lengths. We compared community structures in human healthy brain networks generated using these two metrics and argued that Ψ(PL) may have theoretical advantages. PLACE consists of the following: (1) extracting community structure using top-down hierarchical binary trees, where a branch at each bifurcation denotes a collection of nodes that form a community at that level, (2) constructing and assessing mean group community structure, and (3) detecting node-level changes in community between groups. We applied PLACE and investigated the structural brain networks obtained from a sample of 25 euthymic bipolar I subjects versus 25 gender- and age-matched healthy controls. Results showed community structural differences in posterior default mode network regions, with the bipolar group exhibiting left-right decoupling. Copyright © 2013 Wiley Periodicals, Inc.

Data center networks and network architecture

NASA Astrophysics Data System (ADS)

Esaki, Hiroshi

2014-02-01

This paper discusses and proposes the architectural framework, which is for data center networks. The data center networks require new technical challenges, and it would be good opportunity to change the functions, which are not need in current and future networks. Based on the observation and consideration on data center networks, this paper proposes; (i) Broadcast-free layer 2 network (i.e., emulation of broadcast at the end-node), (ii) Full-mesh point-to-point pipes, and (iii) IRIDES (Invitation Routing aDvertisement for path Engineering System).

Cooperative UAV-Based Communications Backbone for Sensor Networks

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

Roberts, R S

2001-10-07

The objective of this project is to investigate the use of unmanned air vehicles (UAVs) as mobile, adaptive communications backbones for ground-based sensor networks. In this type of network, the UAVs provide communication connectivity to sensors that cannot communicate with each other because of terrain, distance, or other geographical constraints. In these situations, UAVs provide a vertical communication path for the sensors, thereby mitigating geographic obstacles often imposed on networks. With the proper use of UAVs, connectivity to a widely disbursed sensor network in rugged terrain is readily achieved. Our investigation has focused on networks where multiple cooperating UAVs aremore » used to form a network backbone. The advantage of using multiple UAVs to form the network backbone is parallelization of sensor connectivity. Many widely spaced or isolated sensors can be connected to the network at once using this approach. In these networks, the UAVs logically partition the sensor network into sub-networks (subnets), with one UAV assigned per subnet. Partitioning the network into subnets allows the UAVs to service sensors in parallel thereby decreasing the sensor-to-network connectivity. A UAV services sensors in its subnet by flying a route (path) through the subnet, uplinking data collected by the sensors, and forwarding the data to a ground station. An additional advantage of using multiple UAVs in the network is that they provide redundancy in the communications backbone, so that the failure of a single UAV does not necessarily imply the loss of the network.« less

Efficient Data Gathering in 3D Linear Underwater Wireless Sensor Networks Using Sink Mobility

PubMed Central

Akbar, Mariam; Javaid, Nadeem; Khan, Ayesha Hussain; Imran, Muhammad; Shoaib, Muhammad; Vasilakos, Athanasios

2016-01-01

Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability. PMID:27007373

Efficient Data Gathering in 3D Linear Underwater Wireless Sensor Networks Using Sink Mobility.

PubMed

Akbar, Mariam; Javaid, Nadeem; Khan, Ayesha Hussain; Imran, Muhammad; Shoaib, Muhammad; Vasilakos, Athanasios

2016-03-19

Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability.

A Graph-Based Impact Metric for Mitigating Lateral Movement Cyber Attacks

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

Purvine, Emilie AH; Johnson, John R.; Lo, Chaomei

Most cyber network attacks begin with an adversary gain- ing a foothold within the network and proceed with lateral movement until a desired goal is achieved. The mechanism by which lateral movement occurs varies but the basic signa- ture of hopping between hosts by exploiting vulnerabilities is the same. Because of the nature of the vulnerabilities typ- ically exploited, lateral movement is very difficult to detect and defend against. In this paper we define a dynamic reach- ability graph model of the network to discover possible paths that an adversary could take using different vulnerabilities, and how those paths evolvemore » over time. We use this reacha- bility graph to develop dynamic machine-level and network- level impact scores. Lateral movement mitigation strategies which make use of our impact scores are also discussed, and we detail an example using a freely available data set.« less

Network-based landscape of research strengths of universities in Mainland China

NASA Astrophysics Data System (ADS)

Liu, Zihua; Xiao, Qin; Zhan, Qian; Gu, Changgui; Yang, Huijie

2017-07-01

A landscape of a complex system presents a quantitative measure of its global state. The profile of research strength in Mainland China is investigated in detail, by which we illustrate a complex network based framework to extract a landscape from detailed records. First, a measure analogous to the Jaccard similarity is proposed to calculate from the presided funds similarities between the top-ranked universities. The neighbor threshold method is employed to reconstruct the similarity network of the universities. Second, the network is divided into communities. In each community the node with the largest degree and the smallest average shortest path length is taken as the representative of the community, called central node. The node bridging each pair of communities is defined to be a boundary. The central nodes and boundaries cooperatively give us a picture of the research strength landscape. Third, the evolutionary behavior is monitored by the fission and fusion probability matrices, elements of which are the percentage of a community at present time that joins into every community at the next time, and the percentage of a community at next time that comes from every present community, respectively. The landscapes in three successive 4-year durations are identified. It was found that some types of universities, such as the medicine&pharmacy and the finance&economy, conserve in single communities in the more than ten years, respectively. The agriculture&forest universities tend to cluster into one community. Meanwhile the engineering type distributes in different communities and tends to mix with the comprehension type. This framework can be used straightforwardly to analyze temporal networks. It provides also a new network-based method for multivariate time series analysis.

Physarum can compute shortest paths.

PubMed

Bonifaci, Vincenzo; Mehlhorn, Kurt; Varma, Girish

2012-09-21

Physarum polycephalum is a slime mold that is apparently able to solve shortest path problems. A mathematical model has been proposed by Tero et al. (Journal of Theoretical Biology, 244, 2007, pp. 553-564) to describe the feedback mechanism used by the slime mold to adapt its tubular channels while foraging two food sources s(0) and s(1). We prove that, under this model, the mass of the mold will eventually converge to the shortest s(0)-s(1) path of the network that the mold lies on, independently of the structure of the network or of the initial mass distribution. This matches the experimental observations by Tero et al. and can be seen as an example of a "natural algorithm", that is, an algorithm developed by evolution over millions of years. Copyright © 2012 Elsevier Ltd. All rights reserved.

Motion planning for autonomous vehicle based on radial basis function neural network in unstructured environment.

PubMed

Chen, Jiajia; Zhao, Pan; Liang, Huawei; Mei, Tao

2014-09-18

The autonomous vehicle is an automated system equipped with features like environment perception, decision-making, motion planning, and control and execution technology. Navigating in an unstructured and complex environment is a huge challenge for autonomous vehicles, due to the irregular shape of road, the requirement of real-time planning, and the nonholonomic constraints of vehicle. This paper presents a motion planning method, based on the Radial Basis Function (RBF) neural network, to guide the autonomous vehicle in unstructured environments. The proposed algorithm extracts the drivable region from the perception grid map based on the global path, which is available in the road network. The sample points are randomly selected in the drivable region, and a gradient descent method is used to train the RBF network. The parameters of the motion-planning algorithm are verified through the simulation and experiment. It is observed that the proposed approach produces a flexible, smooth, and safe path that can fit any road shape. The method is implemented on autonomous vehicle and verified against many outdoor scenes; furthermore, a comparison of proposed method with the existing well-known Rapidly-exploring Random Tree (RRT) method is presented. The experimental results show that the proposed method is highly effective in planning the vehicle path and offers better motion quality.

Motion Planning for Autonomous Vehicle Based on Radial Basis Function Neural Network in Unstructured Environment

PubMed Central

Chen, Jiajia; Zhao, Pan; Liang, Huawei; Mei, Tao

2014-01-01

The autonomous vehicle is an automated system equipped with features like environment perception, decision-making, motion planning, and control and execution technology. Navigating in an unstructured and complex environment is a huge challenge for autonomous vehicles, due to the irregular shape of road, the requirement of real-time planning, and the nonholonomic constraints of vehicle. This paper presents a motion planning method, based on the Radial Basis Function (RBF) neural network, to guide the autonomous vehicle in unstructured environments. The proposed algorithm extracts the drivable region from the perception grid map based on the global path, which is available in the road network. The sample points are randomly selected in the drivable region, and a gradient descent method is used to train the RBF network. The parameters of the motion-planning algorithm are verified through the simulation and experiment. It is observed that the proposed approach produces a flexible, smooth, and safe path that can fit any road shape. The method is implemented on autonomous vehicle and verified against many outdoor scenes; furthermore, a comparison of proposed method with the existing well-known Rapidly-exploring Random Tree (RRT) method is presented. The experimental results show that the proposed method is highly effective in planning the vehicle path and offers better motion quality. PMID:25237902

Traffic protection in MPLS networks using an off-line flow optimization model

NASA Astrophysics Data System (ADS)

Krzesinski, Anthony E.; Muller, Karen E.

2002-07-01

MPLS-based recovery is intended to effect rapid and complete restoration of traffic affected by a fault in an MPLS network. Two MPLS-based recovery models have been proposed: IP re-routing which establishes recovery paths on demand, and protection switching which works with pre-established recovery paths. IP re-routing is robust and frugal since no resources are pre-committed but is inherently slower than protection switching which is intended to offer high reliability to premium services where fault recovery takes place at the 100 ms time scale. We present a model of protection switching in MPLS networks. A variant of the flow deviation method is used to find and capacitate a set of optimal label switched paths. The traffic is routed over a set of working LSPs. Global repair is implemented by reserving a set of pre-established recovery LSPs. An analytic model is used to evaluate the MPLS-based recovery mechanisms in response to bi-directional link failures. A simulation model is used to evaluate the MPLS recovery cycle in terms of the time needed to restore the traffic after a uni-directional link failure. The models are applied to evaluate the effectiveness of protection switching in networks consisting of between 20 and 100 nodes.

[Delineation of ecological security pattern based on ecological network].

PubMed

Fu, Qiang; Gu, Chao Lin

2017-03-18

Ecological network can be used to describe and assess the relationship between spatial organization of landscapes and species survival under the condition of the habitat fragmentation. Taking Qingdao City as the research area, woodland and wetland ecological networks in 2005 were simulated based on least cost path method, and the ecological networks were classified by their corridors' cumulative cost value. We made importance distinction of ecological network structure elements such as patches and corridors using betweenness centrality index and correlation length-percentage of importance of omitted patches index, and then created the structure system of ecological network. Considering the effects brought by the newly-added construction land from 2005 to 2013, we proposed the ecological security pattern for construction land change of Qingdao City. The results showed that based on ecological network framework, graph theory based methods could be used to quantify both attributes of specific ecological land (e.g., the area of an ecological network patch) and functional connection between ecological lands. Between 2005 and 2013, large area of wetlands had been destroyed by newly-added construction land, while the role of specific woodland and wetland played in the connection of the whole network had not been considered. The delineation of ecological security pattern based on ecological network could optimize regional ecological basis, provide accurate spatial explicit decision for ecological conservation and restoration, and meanwhile provide scientific and reasonable space guidance for urban spatial expansion.

Method and Apparatus for Reducing the Vulnerability of Latches to Single Event Upsets

NASA Technical Reports Server (NTRS)

Shuler, Robert L., Jr. (Inventor)

2002-01-01

A delay circuit includes a first network having an input and an output node, a second network having an input and an output, the input of the second network being coupled to the output node of the first network. The first network and the second network are configured such that: a glitch at the input to the first network having a length of approximately one-half of a standard glitch time or less does not cause the voltage at the output of the second network to cross a threshold, a glitch at the input to the first network having a length of between approximately one-half and two standard glitch times causes the voltage at the output of the second network to cross the threshold for less than the length of the glitch, and a glitch at the input to the first network having a length of greater than approximately two standard glitch times causes the voltage at the output of the second network to cross the threshold for approximately the time of the glitch. The method reduces the vulnerability of a latch to single event upsets. The latch includes a gate having an input and an output and a feedback path from the output to the input of the gate. The method includes inserting a delay into the feedback path and providing a delay in the gate.

Method and Apparatus for Reducing the Vulnerability of Latches to Single Event Upsets

NASA Technical Reports Server (NTRS)

Shuler, Robert L., Jr. (Inventor)

2002-01-01

A delay circuit includes a first network having an input and an output node, a second network having an input and an output, the input of the second network being coupled to the output node of the first network. The first network and the second network are configured such that: a glitch at the input to the first network having a length of approximately one-half of a standard glitch time or less does not cause tile voltage at the output of the second network to cross a threshold, a glitch at the input to the first network having a length of between approximately one-half and two standard glitch times causes the voltage at the output of the second network to cross the threshold for less than the length of the glitch, and a glitch at the input to the first network having a length of greater than approximately two standard glitch times causes the voltage at the output of the second network to cross the threshold for approximately the time of the glitch. A method reduces the vulnerability of a latch to single event upsets. The latch includes a gate having an input and an output and a feedback path from the output to the input of the gate. The method includes inserting a delay into the feedback path and providing a delay in the gate.

Path spectra derived from inversion of source and site spectra for earthquakes in Southern California

NASA Astrophysics Data System (ADS)

Klimasewski, A.; Sahakian, V. J.; Baltay, A.; Boatwright, J.; Fletcher, J. B.; Baker, L. M.

2017-12-01

A large source of epistemic uncertainty in Ground Motion Prediction Equations (GMPEs) is derived from the path term, currently represented as a simple geometric spreading and intrinsic attenuation term. Including additional physical relationships between the path properties and predicted ground motions would produce more accurate and precise, region-specific GMPEs by reclassifying some of the random, aleatory uncertainty as epistemic. This study focuses on regions of Southern California, using data from the Anza network and Southern California Seismic network to create a catalog of events magnitude 2.5 and larger from 1998 to 2016. The catalog encompasses regions of varying geology and therefore varying path and site attenuation. Within this catalog of events, we investigate several collections of event region-to-station pairs, each of which share similar origin locations and stations so that all events have similar paths. Compared with a simple regional GMPE, these paths consistently have high or low residuals. By working with events that have the same path, we can isolate source and site effects, and focus on the remaining residual as path effects. We decompose the recordings into source and site spectra for each unique event and site in our greater Southern California regional database using the inversion method of Andrews (1986). This model represents each natural log record spectra as the sum of its natural log event and site spectra, while constraining each record to a reference site or Brune source spectrum. We estimate a regional, path-specific anelastic attenuation (Q) and site attenuation (t*) from the inversion site spectra and corner frequency from the inversion event spectra. We then compute the residuals between the observed record data, and the inversion model prediction (event*site spectra). This residual is representative of path effects, likely anelastic attenuation along the path that varies from the regional median attenuation. We examine the residuals for our different sets independently to see how path terms differ between event-to-station collections. The path-specific information gained from this can inform development of terms for regional GMPEs, through understanding of these seismological phenomena.

A distributed geo-routing algorithm for wireless sensor networks.

PubMed

Joshi, Gyanendra Prasad; Kim, Sung Won

2009-01-01

Geographic wireless sensor networks use position information for greedy routing. Greedy routing works well in dense networks, whereas in sparse networks it may fail and require a recovery algorithm. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costly for resource constrained position-based wireless sensor networks (WSNs). In this paper, we propose a void avoidance algorithm (VAA), a novel idea based on upgrading virtual distance. VAA allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forwarding packets using only greedy routing. In VAA, the stuck node upgrades distance unless it finds a next hop node that is closer to the destination than it is. VAA guarantees packet delivery if there is a topologically valid path. Further, it is completely distributed, immediately responds to node failure or topology changes and does not require planarization of the network. NS-2 is used to evaluate the performance and correctness of VAA and we compare its performance to other protocols. Simulations show our proposed algorithm consumes less energy, has an efficient path and substantially less control overheads.

Price of anarchy on heterogeneous traffic-flow networks

NASA Astrophysics Data System (ADS)

Rose, A.; O'Dea, R.; Hopcraft, K. I.

2016-09-01

The efficiency of routing traffic through a network, comprising nodes connected by links whose cost of traversal is either fixed or varies in proportion to volume of usage, can be measured by the "price of anarchy." This is the ratio of the cost incurred by agents who act to minimize their individual expenditure to the optimal cost borne by the entire system. As the total traffic load and the network variability—parameterized by the proportion of variable-cost links in the network—changes, the behaviors that the system presents can be understood with the introduction of a network of simpler structure. This is constructed from classes of nonoverlapping paths connecting source to destination nodes that are characterized by the number of variable-cost edges they contain. It is shown that localized peaks in the price of anarchy occur at critical traffic volumes at which it becomes beneficial to exploit ostensibly more expensive paths as the network becomes more congested. Simulation results verifying these findings are presented for the variation of the price of anarchy with the network's size, aspect ratio, variability, and traffic load.

Comparisons of topological properties in autism for the brain network construction methods

NASA Astrophysics Data System (ADS)

Lee, Min-Hee; Kim, Dong Youn; Lee, Sang Hyeon; Kim, Jin Uk; Chung, Moo K.

2015-03-01

Structural brain networks can be constructed from the white matter fiber tractography of diffusion tensor imaging (DTI), and the structural characteristics of the brain can be analyzed from its networks. When brain networks are constructed by the parcellation method, their network structures change according to the parcellation scale selection and arbitrary thresholding. To overcome these issues, we modified the Ɛ -neighbor construction method proposed by Chung et al. (2011). The purpose of this study was to construct brain networks for 14 control subjects and 16 subjects with autism using both the parcellation and the Ɛ-neighbor construction method and to compare their topological properties between two methods. As the number of nodes increased, connectedness decreased in the parcellation method. However in the Ɛ-neighbor construction method, connectedness remained at a high level even with the rising number of nodes. In addition, statistical analysis for the parcellation method showed significant difference only in the path length. However, statistical analysis for the Ɛ-neighbor construction method showed significant difference with the path length, the degree and the density.

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization.

PubMed

Jiang, Ailian; Zheng, Lihong

2018-03-29

Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs). This paper investigates the existing ant colony optimization (ACO)-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime.

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization

PubMed Central

2018-01-01

Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs). This paper investigates the existing ant colony optimization (ACO)-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime. PMID:29596336

Brain Network Architecture and Global Intelligence in Children with Focal Epilepsy.

PubMed

Paldino, M J; Golriz, F; Chapieski, M L; Zhang, W; Chu, Z D

2017-02-01

The biologic basis for intelligence rests to a large degree on the capacity for efficient integration of information across the cerebral network. We aimed to measure the relationship between network architecture and intelligence in the pediatric, epileptic brain. Patients were retrospectively identified with the following: 1) focal epilepsy; 2) brain MR imaging at 3T, including resting-state functional MR imaging; and 3) full-scale intelligence quotient measured by a pediatric neuropsychologist. The cerebral cortex was parcellated into approximately 700 gray matter network "nodes." The strength of a connection between 2 nodes was defined by the correlation between their blood oxygen level-dependent time-series. We calculated the following topologic properties: clustering coefficient, transitivity, modularity, path length, and global efficiency. A machine learning algorithm was used to measure the independent contribution of each metric to the intelligence quotient after adjusting for all other metrics. Thirty patients met the criteria (4-18 years of age); 20 patients required anesthesia during MR imaging. After we accounted for age and sex, clustering coefficient and path length were independently associated with full-scale intelligence quotient. Neither motion parameters nor general anesthesia was an important variable with regard to accurate intelligence quotient prediction by the machine learning algorithm. A longer history of epilepsy was associated with shorter path lengths ( P = .008), consistent with reorganization of the network on the basis of seizures. Considering only patients receiving anesthesia during machine learning did not alter the patterns of network architecture contributing to global intelligence. These findings support the physiologic relevance of imaging-based metrics of network architecture in the pathologic, developing brain. © 2017 by American Journal of Neuroradiology.

Path planning on cellular nonlinear network using active wave computing technique

NASA Astrophysics Data System (ADS)

Yeniçeri, Ramazan; Yalçın, Müstak E.

2009-05-01

This paper introduces a simple algorithm to solve robot path finding problem using active wave computing techniques. A two-dimensional Cellular Neural/Nonlinear Network (CNN), consist of relaxation oscillators, has been used to generate active waves and to process the visual information. The network, which has been implemented on a Field Programmable Gate Array (FPGA) chip, has the feature of being programmed, controlled and observed by a host computer. The arena of the robot is modelled as the medium of the active waves on the network. Active waves are employed to cover the whole medium with their own dynamics, by starting from an initial point. The proposed algorithm is achieved by observing the motion of the wave-front of the active waves. Host program first loads the arena model onto the active wave generator network and command to start the generation. Then periodically pulls the network image from the generator hardware to analyze evolution of the active waves. When the algorithm is completed, vectorial data image is generated. The path from any of the pixel on this image to the active wave generating pixel is drawn by the vectors on this image. The robot arena may be a complicated labyrinth or may have a simple geometry. But, the arena surface always must be flat. Our Autowave Generator CNN implementation which is settled on the Xilinx University Program Virtex-II Pro Development System is operated by a MATLAB program running on the host computer. As the active wave generator hardware has 16, 384 neurons, an arena with 128 × 128 pixels can be modeled and solved by the algorithm. The system also has a monitor and network image is depicted on the monitor simultaneously.

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

PubMed Central

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. PMID:28255297

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

PubMed

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.