WorldWideScience

Sample records for alternate network path

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

    Science.gov (United States)

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

    2017-05-06

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

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

    Directory of Open Access Journals (Sweden)

    P. Chitra

    2017-04-01

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

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

    International Nuclear Information System (INIS)

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

    2007-01-01

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

  4. Spreading paths in partially observed social networks

    Science.gov (United States)

    Onnela, Jukka-Pekka; Christakis, Nicholas A.

    2012-03-01

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

  5. Spreading paths in partially observed social networks.

    Science.gov (United States)

    Onnela, Jukka-Pekka; Christakis, Nicholas A

    2012-03-01

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

  6. Spreading paths in partially observed social networks

    OpenAIRE

    Onnela, Jukka-Pekka; Christakis, Nicholas A.

    2012-01-01

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

  7. Epidemic extinction paths in complex networks

    Science.gov (United States)

    Hindes, Jason; Schwartz, Ira B.

    2017-05-01

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

  8. An alternative path integral for quantum gravity

    Energy Technology Data Exchange (ETDEWEB)

    Krishnan, Chethan; Kumar, K.V. Pavan; Raju, Avinash [Center for High Energy Physics, Indian Institute of Science,Bangalore 560012 (India)

    2016-10-10

    We define a (semi-classical) path integral for gravity with Neumann boundary conditions in D dimensions, and show how to relate this new partition function to the usual picture of Euclidean quantum gravity. We also write down the action in ADM Hamiltonian formulation and use it to reproduce the entropy of black holes and cosmological horizons. A comparison between the (background-subtracted) covariant and Hamiltonian ways of semi-classically evaluating this path integral in flat space reproduces the generalized Smarr formula and the first law. This “Neumann ensemble” perspective on gravitational thermodynamics is parallel to the canonical (Dirichlet) ensemble of Gibbons-Hawking and the microcanonical approach of Brown-York.

  9. Search for minimal paths in modified networks

    International Nuclear Information System (INIS)

    Yeh, W.-C.

    2002-01-01

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

  10. Evaluation of Shortest Paths in Road Network

    Directory of Open Access Journals (Sweden)

    Farrukh Shehzad

    2009-06-01

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

  11. Position and Attitude Alternate of Path Tracking Heading Control

    Directory of Open Access Journals (Sweden)

    Baocheng Tan

    2014-03-01

    Full Text Available The path tracking control algorithm is one of the key problems in the control system design of autonomous vehicle. In this paper, we have conducted dynamic modeling for autonomous vehicle, the relationship between course deviation and yaw rate and centroid deflection angle. From the angle of the dynamics and geometrical, this paper have described the path tracking problem, analyzed the emergence of the eight autonomous vehicles pose binding - position and attitude alternate control methods to identify the relationship between posture and the controlling variables, and design a controller, the experimental results verify the feasibility and effectiveness of this control method.

  12. A path finding implementation for multi-layer networks

    NARCIS (Netherlands)

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

    2009-01-01

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

  13. A path finding implementation for multi-layer network

    NARCIS (Netherlands)

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

    2009-01-01

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

  14. Structural equation models from paths to networks

    CERN Document Server

    Westland, J Christopher

    2015-01-01

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

  15. Estimation of network path segment delays

    Science.gov (United States)

    Nichols, Kathleen Marie

    2018-05-01

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

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

    Directory of Open Access Journals (Sweden)

    Hyunhun Cho

    2015-05-01

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

  17. Hanford spent nuclear fuel project recommended path forward, volume III: Alternatives and path forward evaluation supporting documentation

    International Nuclear Information System (INIS)

    Fulton, J.C.

    1994-10-01

    Volume I of the Hanford Spent Nuclear Fuel Project - Recommended Path Forward constitutes an aggressive series of projects to construct and operate systems and facilities to safely retrieve, package, transport, process, and store K Basins fuel and sludge. Volume II provided a comparative evaluation of four Alternatives for the Path Forward and an evaluation for the Recommended Path Forward. Although Volume II contained extensive appendices, six supporting documents have been compiled in Volume III to provide additional background for Volume II

  18. Networks in Buildings: Which Path Forward?

    Energy Technology Data Exchange (ETDEWEB)

    Nordman, Bruce

    2008-08-17

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

  19. Differential neural network configuration during human path integration

    Science.gov (United States)

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

    2014-01-01

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

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

    Science.gov (United States)

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

    2013-01-28

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

  1. Ranking paths in stochastic time-dependent networks

    DEFF Research Database (Denmark)

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

    2014-01-01

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

  2. Ranking shortest paths in Stochastic time-denpendent networks

    DEFF Research Database (Denmark)

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

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

  3. K shortest paths in stochastic time-dependent networks

    DEFF Research Database (Denmark)

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

    2004-01-01

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

  4. Teleconnection Paths via Climate Network Direct Link Detection.

    Science.gov (United States)

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

    2015-12-31

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

  5. Hanford Spent Nuclear Fuel Project: Recommended path forward. Volume 2: Alternatives and path forward evaluation

    International Nuclear Information System (INIS)

    Fulton, J.C.

    1994-10-01

    The Hanford Spent Nuclear Fuel Project has completed an evaluation of four alternatives for expediting the removal of spent nuclear fuel from the K Basins and stabilizing and placing the fuel into interim storage. Four alternatives were compared: (1) Containerizing fuel in the K Basins, transporting fuel to a facility for stabilization, and interim storage of stabilized fuel in a dry storage facility (DSF); (2) Containerizing fuel in the K Basins, transporting fuel to a wet temporary staging facility, moving fuel to a facility for stabilization, and transporting stabilized fuel to an interim DSF; (3) Containerizing fuel in the K Basins in multi-canister overpacks, transporting fuel directly to a stabilization facility for passivation in the overpack, and interim storage of stabilized fuel in a DSF; (4) Packaging fuel for transport overseas and shipping fuel to a foreign reprocessing facility for reprocessing with eventual return of U, Pu and vitrified high level waste. The comparative evaluation consisted of a multi-attribute utility decision analysis, a public, worker and environmental health risk assessment, and a programmatic risk evaluation. The evaluation concluded that the best Path Forward combines the following concepts: Removal of K Basin fuel and sludge is uncoupled from the operation of a stabilization facility; A storage capability is provided to act as a lag storage or staging operation for overpack fuel containers as they are removed from the K Basins; Metal fuel drying and passivation should be maintained as the fuel stabilization process with the option of further refinements as more information becomes available; and The near term NEPA strategy should focus on expeditious removal of fuel and sludge from K Basins and placing overpacked fuel in temporary storage

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

    Science.gov (United States)

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

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

  7. Road networks as collections of minimum cost paths

    Science.gov (United States)

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

    2015-10-01

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

  8. Compact wireless control network protocol with fast path switching

    Directory of Open Access Journals (Sweden)

    Yasutaka Kawamoto

    2017-08-01

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

  9. Beyond centrality-classifying topological significance using backup efficiency and alternative paths

    International Nuclear Information System (INIS)

    Shavitt, Yuval; Singer, Yaron

    2007-01-01

    In complex networks characterized by broad degree distribution, node significance is often associated with its degree or with centrality metrics which relate to its reachability and shortest paths passing through it. Such measures do not consider availability of efficient backup of the node and thus often fail to capture its contribution to the functionality and resilience of the network operation. In this paper, we suggest the quality of backup (QoB) and alternative path centrality (APC) measures as complementary methods which enable analysis of node significance in a manner which considers backup. We examine the theoretical significance of these measures and use them to classify nodes in social interaction networks and in the Internet AS (autonomous system) graph while applying the valley-free routing restrictions which reflect the economic relationships between the AS nodes in the Internet. We show that both node degree and node centrality are not necessarily evidence of its significance. In particular, we show that social structures do not necessarily depend on highly central nodes and that medium degree nodes with medium centrality measure prove to be crucial for efficient routing in the Internet AS graph

  10. An alternative derivation of the Faddeev-Popov path integral

    International Nuclear Information System (INIS)

    Cabo, A.; Martinez, D.L.; Chaichian, M.; Presnajder, P.

    1991-01-01

    A new derivation of the Faddeev-Popov path integral is presented. The use of gauge invariant transformations and gauge fixing conditions in the phase space allows to introduce straightforwardly Lorentz invariant gauge conditions into the path integral, thus avoiding the necessity of going first through a Coulomb-like gauge as it is usually done. The case of systems with finite degrees of freedom and the abelian (QED) one are also presented for illustration. (orig.)

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

    NARCIS (Netherlands)

    Du, W.

    2014-01-01

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

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

    International Nuclear Information System (INIS)

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

    2014-01-01

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

  13. Meta-path based heterogeneous combat network link prediction

    Science.gov (United States)

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

    2017-09-01

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

  14. Local Network Wideband Interconnection Alternatives.

    Science.gov (United States)

    1984-01-01

    signal. 3.2.2 Limitations Although satellites offer the advantages of insensitivity to distance, point-to-multipoint communication capability and...Russell, the CATV franchisee for the town of Bedford, has not yit set rates for leasing channels on their network. If this network were interconnected

  15. The internet as an alternative path to internationalization?

    OpenAIRE

    Sinkovics, Noemi; Sinkovics, Rudolf R.; Jean, Ruey Jer Bryan

    2013-01-01

    Purpose: While the internet enjoys increasing interest regarding its potential to extend the global reach of firms, especially small and medium-sized firms (SMEs), little work has been done on the viability of the internet as a new and effective path to internationalization. Specifically, it is unclear how the internet can successfully support export marketing. The purpose of this paper is to examine the drivers and performance outcomes of two patterns of internet use supporting export market...

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

    Science.gov (United States)

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

    2014-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Weihui Dai

    2014-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Juen Joshua

    2015-06-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

    DeMar, Philip; Petravick, Don; /Fermilab

    2004-12-01

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

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

    Science.gov (United States)

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

    2018-04-23

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

  1. Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Weigang Bai

    2018-04-01

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

  2. Path searching in switching networks using cellular algorithm

    Energy Technology Data Exchange (ETDEWEB)

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

    1981-01-01

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

  3. Investments in power networks and alternative measures

    International Nuclear Information System (INIS)

    2003-01-01

    Measures taken with respect to production and consumption are often alternatives to investments in the power networks. While decisions about production and consumption are taken in the market, the network operation is subject to monopoly regulation. In the central network, Statnett's commission is to invest on the basis of socioeconomic profitability. There is a need for much better coordination between network investments and other measures in the power system. The price signal from the market and general tariffs are not sufficient to realize optimal solutions, and there is a need for a ''visible hand'' that can contribute to the realization of the solutions that are the best in each individual situation. It is desirable to create processes and incentives that realize the best solutions, independently of dealing with network investments, local power production or other measures.

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

    Science.gov (United States)

    Stringer, Simon M; Rolls, Edmund T

    2006-12-01

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

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

    Directory of Open Access Journals (Sweden)

    R. Boliac

    1997-08-01

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

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

    International Nuclear Information System (INIS)

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

    2010-01-01

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

  7. Discovery of path nearby clusters in spatial networks

    KAUST Repository

    Shang, Shuo

    2015-06-01

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

  8. Social network analysis using k-Path centrality method

    Science.gov (United States)

    Taniarza, Natya; Adiwijaya; Maharani, Warih

    2018-03-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

    McLendon, William C.,; Brost, Randolph

    2016-05-01

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

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

    NARCIS (Netherlands)

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

    2008-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Z. Akbari

    2014-10-01

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

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

    Directory of Open Access Journals (Sweden)

    Mario Miler

    2014-02-01

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

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

    KAUST Repository

    Fareed, Muhammad Mehboob

    2014-01-06

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

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

    KAUST Repository

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

    2014-01-01

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

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

    Science.gov (United States)

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

    2017-07-25

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

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

    Science.gov (United States)

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

    2010-10-11

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

  17. Discovery of path nearby clusters in spatial networks

    KAUST Repository

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

    2015-01-01

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

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

    Science.gov (United States)

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

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

  19. Whatever It Takes A Case Study Of Our Childs Alternative Path To Literacy

    Directory of Open Access Journals (Sweden)

    Shelly HUGGINS

    2016-12-01

    Full Text Available As public school educators, my husband and I struggled with making alternative academic choices for our child with learning differences. Choosing the alternative path was not easy or clear cut for us. This is a reflective record of the journey toward getting my son Whatever it Takes to help him learn. The article chronicles intuition about the early warning signs of learning differences. The article discusses the merits of the private school experience, the homeschooling experience and ultimately a modified and personalized learning plan that made learning natural, while preserving my sons confidence, self-esteem and integrity. Detailed in the article are the discussions concerning the many educational, instructional and sociological decisions that are necessary to individualize instruction to meet an individuals needs.

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

    NARCIS (Netherlands)

    Dijkstra, F.

    2009-01-01

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

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

    Science.gov (United States)

    2003-01-01

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

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

    Science.gov (United States)

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

    2016-02-01

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

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

    NARCIS (Netherlands)

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

    2008-01-01

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

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

    NARCIS (Netherlands)

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

    2013-01-01

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

  5. Design alternatives for wavelength routing networks

    Science.gov (United States)

    Miliotis, K.; Papadimitriou, G. I.; Pomportsis, A. S.

    2003-03-01

    This paper attempts to provide a high level overview of many of the technologies employed in optical networks with a focus on wavelength-routing networks. Optical networks involve a number of technologies from the physics of light through protocols and networks architectures. In fact there is so much technology and know-how that most people involved with optical networks only have a full understanding of the narrow area they deal with. We start first examining the principles that govern light and its use as a wave guide, and then turn our focus to the various components that constitute an optical network and conclude with the description of all optical networks and wavelength-routed networks in greater detail.

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

    Science.gov (United States)

    Hoomod, Haider K.; Kareem Jebur, Tuka

    2018-05-01

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

  7. Leveraging the NPS Femto Satellite for Alternative Satellite Communication Networks

    Science.gov (United States)

    2017-09-01

    programmed for eventual integration with the Iridium Network , which is then tested. C. THESIS ORGANIZATION The thesis addresses these questions...NPS FEMTO SATELLITE FOR ALTERNATIVE SATELLITE COMMUNICATION NETWORKS by Faisal S. Alshaya September 2017 Co-Advisors: Steven J. Iatrou...TYPE AND DATES COVERED Master’s thesis 4. TITLE AND SUBTITLE LEVERAGING THE NPS FEMTO SATELLITE FOR ALTERNATIVE SATELLITE COMMUNICATION NETWORKS 5

  8. Cultural adaptation of preschool PATHS (Promoting Alternative Thinking Strategies) curriculum for Pakistani children.

    Science.gov (United States)

    Inam, Ayesha; Tariq, Pervaiz N; Zaman, Sahira

    2015-06-01

    Cultural adaptation of evidence-based programmes has gained importance primarily owing to its perceived impact on the established effectiveness of a programme. To date, many researchers have proposed different frameworks for systematic adaptation process. This article presents the cultural adaptation of preschool Promoting Alternative Thinking Strategies (PATHS) curriculum for Pakistani children using the heuristic framework of adaptation (Barrera & Castro, 2006). The study was completed in four steps: information gathering, preliminary adaptation design, preliminary adaptation test and adaptation refinement. Feedbacks on programme content suggested universality of the core programme components. Suggested changes were mostly surface structure: language, presentation of materials, conceptual equivalence of concepts, training needs of implementation staff and frequency of programme delivery. In-depth analysis was done to acquire cultural equivalence. Pilot testing of the outcome measures showed strong internal consistency. The results were further discussed with reference to similar work undertaken in other cultures. © 2014 International Union of Psychological Science.

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

    Directory of Open Access Journals (Sweden)

    Jing Wang

    2013-01-01

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

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

    Science.gov (United States)

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

    2015-01-01

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

  11. Minimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet Vehicle Routing Problem with Alternative Paths

    Directory of Open Access Journals (Sweden)

    Wan-Yu Liu

    2014-07-01

    Full Text Available Torespondto the reduction of greenhouse gas emissions and global warming, this paper investigates the minimal-carbon-footprint time-dependent heterogeneous-fleet vehicle routing problem with alternative paths (MTHVRPP. This finds a route with the smallestcarbon footprint, instead of the shortestroute distance, which is the conventional approach, to serve a number of customers with a heterogeneous fleet of vehicles in cases wherethere may not be only one path between each pair of customers, and the vehicle speed differs at different times of the day. Inheriting from the NP-hardness of the vehicle routing problem, the MTHVRPP is also NP-hard. This paper further proposes a genetic algorithm (GA to solve this problem. The solution representedbyour GA determines the customer serving ordering of each vehicle type. Then, the capacity check is used to classify multiple routes of each vehicle type, and the path selection determines the detailed paths of each route. Additionally, this paper improves the energy consumption model used for calculating the carbon footprint amount more precisely. Compared with the results without alternative paths, our experimental results show that the alternative path in this experimenthas a significant impact on the experimental results in terms of carbon footprint.

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

    Science.gov (United States)

    Yuniarto, Budi; Kurniawan, Robert

    2017-03-01

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

  13. An evidential path logic for multi-relational networks

    Energy Technology Data Exchange (ETDEWEB)

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

    2008-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Fei Dou

    2014-01-01

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

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

    International Nuclear Information System (INIS)

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

    2016-01-01

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

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

    Directory of Open Access Journals (Sweden)

    V. A. Bulanov

    2014-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Zheng Zhang

    2013-03-01

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

  18. An access alternative for mobile satellite networks

    Science.gov (United States)

    Wu, W. W.

    1988-01-01

    Conceptually, this paper discusses strategies of digital satellite communication networks for a very large number of low density traffic stations. These stations can be either aeronautical, land mobile, or maritime. The techniques can be applied to international, domestic, regional, and special purpose satellite networks. The applications can be commercial, scientific, military, emergency, navigational or educational. The key strategy is the use of a non-orthogonal access method, which tolerates overlapping signals. With n being either time or frequency partitions, and with a single overlapping signal allowed, a low cost mobile satellite system can be designed with n squared (n squared + n + 1) number of terminals.

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2011-01-15

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

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

    CSIR Research Space (South Africa)

    Mhlanga, MM

    2009-01-01

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

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

    CSIR Research Space (South Africa)

    Mhlanga, MM

    2009-08-01

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

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

    NARCIS (Netherlands)

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

    2013-01-01

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

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

    NARCIS (Netherlands)

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

    2015-01-01

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

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

    NARCIS (Netherlands)

    Vinciguerra, S.; Frenken, K.

    2015-01-01

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

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

    Science.gov (United States)

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

    2013-07-01

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

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

    Science.gov (United States)

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

    2015-07-27

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

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

    Directory of Open Access Journals (Sweden)

    J R Managbanag

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

  8. Panning for Gold: The personal journey of mental health wellness and its relationships with Planning Alternatives Tomorrows with Hope (PATH

    Directory of Open Access Journals (Sweden)

    Matthew Lyndon Armstrong

    2015-12-01

    Full Text Available This study explored how the Planning Alternatives Tomorrows with Hope (PATH process could enhance and strengthen an individual’s personal journey of recovery. This article utilised the knowledge base of members of a Community of Practice, located in Brisbane Australia. Members had a deep concern and passion to promote and strengthen wellbeing for people who live with the experience of mental ill health. They were invited to form a focus group to explore the use of PATH and its relationship with mental health wellness. After contemplating and reflecting on an example of the PATH process, the focus group explored opportunities for PATH to become one of many wellness resources for people experiencing and overcoming mental ill health. Through the exploration of personal meaning, storytelling and community connection (anchored in the visuals and graphics of the PATH example, the study found that PATH can make a valuable contribution by restoring some of the power inbalances in traditonal service frameworks and enhancing personal self direction. Keywords: mental health distress, practitioners, recovery, facilitation, creativity, planning

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

    Science.gov (United States)

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

    2017-10-01

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

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

    Directory of Open Access Journals (Sweden)

    R. Asokan

    2008-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Yueyue Deng

    2013-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Le The Dung

    2017-03-01

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

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

    Science.gov (United States)

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

    1987-01-01

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

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

    Science.gov (United States)

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

    2001-07-01

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

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

    Directory of Open Access Journals (Sweden)

    A. A. Heidari

    2016-06-01

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

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

    Directory of Open Access Journals (Sweden)

    Nogbou G. Anoh

    2017-02-01

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

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

    Science.gov (United States)

    Steinbock, Chanania; Biham, Ofer; Katzav, Eytan

    2017-09-01

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

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

    Science.gov (United States)

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

    2017-01-01

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

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

    DEFF Research Database (Denmark)

    Kaul, Manohar

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

  20. Alternative Constraint Handling Technique for Four-Bar Linkage Path Generation

    Science.gov (United States)

    Sleesongsom, S.; Bureerat, S.

    2018-03-01

    This paper proposes an extension of a new concept for path generation from our previous work by adding a new constraint handling technique. The propose technique was initially designed for problems without prescribed timing by avoiding the timing constraint, while remain constraints are solving with a new constraint handling technique. The technique is one kind of penalty technique. The comparative study is optimisation of path generation problems are solved using self-adaptive population size teaching-learning based optimization (SAP-TLBO) and original TLBO. In this study, two traditional path generation test problem are used to test the proposed technique. The results show that the new technique can be applied with the path generation problem without prescribed timing and gives better results than the previous technique. Furthermore, SAP-TLBO outperforms the original one.

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

    DEFF Research Database (Denmark)

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

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

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

    Directory of Open Access Journals (Sweden)

    Haifeng Du

    2017-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Ming-Chorng Hwang

    2015-01-01

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

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

    Science.gov (United States)

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

    2017-05-01

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

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

    Directory of Open Access Journals (Sweden)

    Mihui Kim

    2010-04-01

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

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

    DEFF Research Database (Denmark)

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

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

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

    Science.gov (United States)

    Kim, Mihui; Chae, Kijoon

    2010-01-01

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

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

    Science.gov (United States)

    Zhang, Junying; Zhao, Xiaoxue; He, Xiaotao

    2014-08-01

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

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

    Science.gov (United States)

    Burak, Yoram; Fiete, Ila R

    2009-02-01

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

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

    International Nuclear Information System (INIS)

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

    2017-01-01

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

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

    International Nuclear Information System (INIS)

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

    2017-01-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-12-03

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

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

    Science.gov (United States)

    Mao, Yuxin; Wei, Guiyi

    2010-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Guiyi Wei

    2010-10-01

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

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

    Science.gov (United States)

    Mao, Yuxin; Wei, Guiyi

    2010-01-01

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

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

    International Nuclear Information System (INIS)

    Çakır, Tunahan; Khatibipour, Mohammad Jafar

    2014-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Daouda Ahmat

    2015-01-01

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

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

    DEFF Research Database (Denmark)

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

    2013-01-01

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

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

    Science.gov (United States)

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

    2018-03-01

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

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

    Science.gov (United States)

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

    2018-01-01

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

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

    DEFF Research Database (Denmark)

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

    2017-01-01

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

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

    Science.gov (United States)

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

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

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

    DEFF Research Database (Denmark)

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

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

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

    Science.gov (United States)

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

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

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

    Science.gov (United States)

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

    2016-05-01

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

  6. Intelligent alternator control system - a path to efficient dynamics; Intelligente Generatorregelung - Ein Weg zur effizienten Dynamik

    Energy Technology Data Exchange (ETDEWEB)

    Liebl, J.; Frickenstein, E.; Wier, M.; Hafkemeyer, M.; El-Dwaik, F.; Hockgeier, E. [BMW AG, Muenchen (Germany)

    2006-11-15

    In automotive engineering, it would seem - at first glance at least - difficult to simultaneously achieve both efficiency and dynamics in the sense of improved driving performance and fuel economy. The BMW Group has set itself the following goal: to drive innovation in automotive and powertrain engineering for the benefit of its customers. An example is the specific control of the alternator in such a way as to improve driving dynamics and fuel economy. (orig.)

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

    KAUST Repository

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

    2015-01-01

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

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

    KAUST Repository

    Fareed, Muhammad Mehboob

    2015-04-01

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

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

    Science.gov (United States)

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

    2012-04-01

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

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

    Science.gov (United States)

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

    2014-08-01

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

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

    Science.gov (United States)

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

    2015-03-01

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

  12. Alternative Evolutionary Paths to Bacterial Antibiotic Resistance Cause Distinct Collateral Effects.

    Science.gov (United States)

    Barbosa, Camilo; Trebosc, Vincent; Kemmer, Christian; Rosenstiel, Philip; Beardmore, Robert; Schulenburg, Hinrich; Jansen, Gunther

    2017-09-01

    When bacteria evolve resistance against a particular antibiotic, they may simultaneously gain increased sensitivity against a second one. Such collateral sensitivity may be exploited to develop novel, sustainable antibiotic treatment strategies aimed at containing the current, dramatic spread of drug resistance. To date, the presence and molecular basis of collateral sensitivity has only been studied in few bacterial species and is unknown for opportunistic human pathogens such as Pseudomonas aeruginosa. In the present study, we assessed patterns of collateral effects by experimentally evolving 160 independent populations of P. aeruginosa to high levels of resistance against eight commonly used antibiotics. The bacteria evolved resistance rapidly and expressed both collateral sensitivity and cross-resistance. The pattern of such collateral effects differed to those previously reported for other bacterial species, suggesting interspecific differences in the underlying evolutionary trade-offs. Intriguingly, we also identified contrasting patterns of collateral sensitivity and cross-resistance among the replicate populations adapted to the same drug. Whole-genome sequencing of 81 independently evolved populations revealed distinct evolutionary paths of resistance to the selective drug, which determined whether bacteria became cross-resistant or collaterally sensitive towards others. Based on genomic and functional genetic analysis, we demonstrate that collateral sensitivity can result from resistance mutations in regulatory genes such as nalC or mexZ, which mediate aminoglycoside sensitivity in β-lactam-adapted populations, or the two-component regulatory system gene pmrB, which enhances penicillin sensitivity in gentamicin-resistant populations. Our findings highlight substantial variation in the evolved collateral effects among replicates, which in turn determine their potential in antibiotic therapy. © The Author 2017. Published by Oxford University Press on

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

    Directory of Open Access Journals (Sweden)

    As'ad Mahmoud As'ad ALNASER

    2017-04-01

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

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

    Science.gov (United States)

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

    2017-09-01

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

  15. Capacity gain with an alternative LTE railway communication network

    DEFF Research Database (Denmark)

    Sniady, Aleksander; Soler, José

    2014-01-01

    , such as 3GPP Long Term Evolution (LTE). T his paper describe s how to adapt the reversible multi - chain/channel queuing system to model an LTE cell serving ETCS - equipped trains . It is proposed to use the multiple user chains available in the model to represent varying bitrate in LTE radio access network....... Usin g this model , LTE and GSM - R are compare d in terms of capacity on an example at Copenhagen Main Train Station . The purpose of this work is to demonstrate the benefits that railway operators and infrastructure managers can expect from the introduc tion of LTE , as a telecommunication technology...... Control System (ETCS) signaling , the capacity of GSM - R turns out to be insufficient . GSM - R cannot ful fill the railway requirements , in terms of the number of simultaneous ETCS connections . This is why , alternative , more efficient communication technologies should be considered by railways...

  16. Outsmarting neural networks: an alternative paradigm for machine learning

    Energy Technology Data Exchange (ETDEWEB)

    Protopopescu, V.; Rao, N.S.V.

    1996-10-01

    We address three problems in machine learning, namely: (i) function learning, (ii) regression estimation, and (iii) sensor fusion, in the Probably and Approximately Correct (PAC) framework. We show that, under certain conditions, one can reduce the three problems above to the regression estimation. The latter is usually tackled with artificial neural networks (ANNs) that satisfy the PAC criteria, but have high computational complexity. We propose several computationally efficient PAC alternatives to ANNs to solve the regression estimation. Thereby we also provide efficient PAC solutions to the function learning and sensor fusion problems. The approach is based on cross-fertilizing concepts and methods from statistical estimation, nonlinear algorithms, and the theory of computational complexity, and is designed as part of a new, coherent paradigm for machine learning.

  17. Incorporating alternative design clinical trials in network meta-analyses

    Directory of Open Access Journals (Sweden)

    Thorlund K

    2014-12-01

    Full Text Available Kristian Thorlund,1–3 Eric Druyts,1,4 Kabirraaj Toor,1,5 Jeroen P Jansen,1,6 Edward J Mills1,3 1Redwood Outcomes, Vancouver, BC, 2Department of Clinical Epidemiology and Biostatistics, McMaster University, Hamilton, ON, Canada; 3Stanford Prevention Research Center, Stanford University, Stanford, CA, USA; 4Department of Medicine, Faculty of Medicine, 5School of Population and Public Health, Faculty of Medicine, University of British Columbia, Vancouver, BC, Canada; 6Department of Public Health and Community Medicine, Tufts University, Boston, MA, USA Introduction: Network meta-analysis (NMA is an extension of conventional pairwise meta-analysis that allows for simultaneous comparison of multiple interventions. Well-established drug class efficacies have become commonplace in many disease areas. Thus, for reasons of ethics and equipoise, it is not practical to randomize patients to placebo or older drug classes. Unique randomized clinical trial designs are an attempt to navigate these obstacles. These alternative designs, however, pose challenges when attempting to incorporate data into NMAs. Using ulcerative colitis as an example, we illustrate an example of a method where data provided by these trials are used to populate treatment networks. Methods: We present the methods used to convert data from the PURSUIT trial into a typical parallel design for inclusion in our NMA. Data were required for three arms: golimumab 100 mg; golimumab 50 mg; and placebo. Golimumab 100 mg induction data were available; however, data regarding those individuals who were nonresponders at induction and those who were responders at maintenance were not reported, and as such, had to be imputed using data from the rerandomization phase. Golimumab 50 mg data regarding responses at week 6 were not available. Existing relationships between the available components were used to impute the expected proportions in this missing subpopulation. Data for placebo maintenance

  18. Alternative Paths to Hearing (A Conjecture. Photonic and Tactile Hearing Systems Displaying the Frequency Spectrum of Sound

    Directory of Open Access Journals (Sweden)

    E. H. Hara

    2006-01-01

    Full Text Available In this article, the hearing process is considered from a system engineering perspective. For those with total hearing loss, a cochlear implant is the only direct remedy. It first acts as a spectrum analyser and then electronically stimulates the neurons in the cochlea with a number of electrodes. Each electrode carries information on the separate frequency bands (i.e., spectrum of the original sound signal. The neurons then relay the signals in a parallel manner to the section of the brain where sound signals are processed. Photonic and tactile hearing systems displaying the spectrum of sound are proposed as alternative paths to the section of the brain that processes sound. In view of the plasticity of the brain, which can rewire itself, the following conjectures are offered. After a certain period of training, a person without the ability to hear should be able to decipher the patterns of photonic or tactile displays of the sound spectrum and learn to ‘hear’. This is very similar to the case of a blind person learning to ‘read’ by recognizing the patterns created by the series of bumps as their fingers scan the Braille writing. The conjectures are yet to be tested. Designs of photonic and tactile systems displaying the sound spectrum are outlined.

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

    Science.gov (United States)

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

    2013-11-04

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

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

    Directory of Open Access Journals (Sweden)

    Huifang Chen

    2013-11-01

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

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

    Science.gov (United States)

    Shi, Zan; Foshee, James J.

    2001-10-01

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

  2. Mapping alternative energy paths for taiwan to reach a sustainable future: An application of the leap model

    Science.gov (United States)

    Chen, Wei-Ming

    Energy is the backbone of modern life which is highly related to national security, economic growth, and environmental protection. For Taiwan, a region having limited conventional energy resources but constructing economies and societies with high energy intensity, energy became the throat of national security and development. This dissertation explores energy solutions for Taiwan by constructing a sustainable and comprehensive energy planning framework (SCENE) and by simulating alternative energy pathways on the horizon to 2030. The Long-range Energy Alternatives Planning system (LEAP) is used as a platform for the energy simulation. The study models three scenarios based on the E4 (energy -- environment -- economic -- equity) perspectives. Three scenarios refer to the business-as-usual scenario (BAU), the government target scenario (GOV), and the renewable and efficiency scenario (REEE). The simulation results indicate that the most promising scenario for Taiwan is the REEE scenario, which aims to save 48.7 million tonnes of oil equivalent (Mtoe) of final energy consumption. It avoids USD 11.1 billion on electricity expenditure in final demand sectors. In addition, the cost of the REEE path is the lowest among all scenarios before 2020 in the electricity generation sector. In terms of global warming potential (GWP), the REEE scenario could reduce 35 percent of the GWP in the demand sectors, the lowest greenhouse gases emission in relation to all other scenarios. Based on lowest energy consumption, competitive cost, and least harm to the environment, the REEE scenario is the best option to achieve intergenerational equity. This dissertation proposes that promoting energy efficiency and utilizing renewable energy is the best strategy for Taiwan. For efficiency improvement, great energy saving potentials do exist in Taiwan so that Taiwan needs more ambitious targets, policies, and implementation mechanisms for energy efficiency enhancement to slow down and decrease

  3. Building alternate protein structures using the elastic network model.

    Science.gov (United States)

    Yang, Qingyi; Sharp, Kim A

    2009-02-15

    We describe a method for efficiently generating ensembles of alternate, all-atom protein structures that (a) differ significantly from the starting structure, (b) have good stereochemistry (bonded geometry), and (c) have good steric properties (absence of atomic overlap). The method uses reconstruction from a series of backbone framework structures that are obtained from a modified elastic network model (ENM) by perturbation along low-frequency normal modes. To ensure good quality backbone frameworks, the single force parameter ENM is modified by introducing two more force parameters to characterize the interaction between the consecutive carbon alphas and those within the same secondary structure domain. The relative stiffness of the three parameters is parameterized to reproduce B-factors, while maintaining good bonded geometry. After parameterization, violations of experimental Calpha-Calpha distances and Calpha-Calpha-Calpha pseudo angles along the backbone are reduced to less than 1%. Simultaneously, the average B-factor correlation coefficient improves to R = 0.77. Two applications illustrate the potential of the approach. (1) 102,051 protein backbones spanning a conformational space of 15 A root mean square deviation were generated from 148 nonredundant proteins in the PDB database, and all-atom models with minimal bonded and nonbonded violations were produced from this ensemble of backbone structures using the SCWRL side chain building program. (2) Improved backbone templates for homology modeling. Fifteen query sequences were each modeled on two targets. For each of the 30 target frameworks, dozens of improved templates could be produced In all cases, improved full atom homology models resulted, of which 50% could be identified blind using the D-Fire statistical potential. (c) 2008 Wiley-Liss, Inc.

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

    DEFF Research Database (Denmark)

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

    2011-01-01

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

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

    Science.gov (United States)

    Montz, Carol B.; Wanat, Carolyn L.

    2008-01-01

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

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

    NARCIS (Netherlands)

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

    2015-01-01

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

  7. An Intelligent Alternative Approach to the efficient Network Management

    Directory of Open Access Journals (Sweden)

    MARTÍN, A.

    2012-12-01

    Full Text Available Due to the increasing complexity and heterogeneity of networks and services, many efforts have been made to develop intelligent techniques for management. Network intelligent management is a key technology for operating large heterogeneous data transmission networks. This paper presents a proposal for an architecture that integrates management object specifications and the knowledge of expert systems. We present a new approach named Integrated Expert Management, for learning objects based on expert management rules and describe the design and implementation of an integrated intelligent management platform based on OSI and Internet management models. The main contributions of our approach is the integration of both expert system and managed models, so we can make use of them to construct more flexible intelligent management network. The prototype SONAP (Software for Network Assistant and Performance is accuracy-aware since it can control and manage a network. We have tested our system on real data to the fault diagnostic in a telecommunication system of a power utility. The results validate the model and show a significant improvement with respect to the number of rules and the error rate in others systems.

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

    Science.gov (United States)

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

    2015-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Wu Xing

    2014-03-01

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

  10. Zero-Slack, Noncritical Paths

    Science.gov (United States)

    Simons, Jacob V., Jr.

    2017-01-01

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

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

    CSIR Research Space (South Africa)

    Mhlanga, MM

    2011-09-01

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

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

    Science.gov (United States)

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

    2018-03-01

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

  13. Evolutionary neural networks: a new alternative for neutron spectrometry

    International Nuclear Information System (INIS)

    Ortiz R, J. M.; Martinez B, M. R.; Vega C, H. R.; Galleo, E.

    2009-10-01

    A device used to perform neutron spectroscopy is the system known as a system of Bonner spheres spectrometer, this system has some disadvantages, one of these is the need for reconstruction using a code that is based on an iterative reconstruction algorithm, whose greater inconvenience is the need for a initial spectrum, as close as possible to the spectrum that is desired to avoid this inconvenience has been reported several procedures in reconstruction, combined with various types of experimental methods, based on artificial intelligence technology how genetic algorithms, artificial neural networks and hybrid systems evolved artificial neural networks using genetic algorithms. This paper analyzes the intersection of neural networks and evolutionary algorithms applied in the neutron spectroscopy and dosimetry. Due to this is an emerging technology, there are not tools for doing analysis of the obtained results, by what this paper presents a computing tool to analyze the neutron spectra and the equivalent doses obtained through the hybrid technology of neural networks and genetic algorithms. The toolmaker offers a user graphical environment, friendly and easy to operate. (author)

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

    Science.gov (United States)

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

    2018-01-01

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

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

    Science.gov (United States)

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

    2018-03-18

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

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

    Directory of Open Access Journals (Sweden)

    Shaobo Wu

    2018-03-01

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

  17. Criteria for Evaluating Alternative Network and Link Layer Protocols for the NASA Constellation Program Communication Architecture

    Science.gov (United States)

    Benbenek, Daniel; Soloff, Jason; Lieb, Erica

    2010-01-01

    Selecting a communications and network architecture for future manned space flight requires an evaluation of the varying goals and objectives of the program, development of communications and network architecture evaluation criteria, and assessment of critical architecture trades. This paper uses Cx Program proposed exploration activities as a guideline; lunar sortie, outpost, Mars, and flexible path options are described. A set of proposed communications network architecture criteria are proposed and described. They include: interoperability, security, reliability, and ease of automating topology changes. Finally a key set of architecture options are traded including (1) multiplexing data at a common network layer vs. at the data link layer, (2) implementing multiple network layers vs. a single network layer, and (3) the use of a particular network layer protocol, primarily IPv6 vs. Delay Tolerant Networking (DTN). In summary, the protocol options are evaluated against the proposed exploration activities and their relative performance with respect to the criteria are assessed. An architectural approach which includes (a) the capability of multiplexing at both the network layer and the data link layer and (b) a single network layer for operations at each program phase, as these solutions are best suited to respond to the widest array of program needs and meet each of the evaluation criteria.

  18. Alternative strategy for steady growth towards high quality translation networks

    Energy Technology Data Exchange (ETDEWEB)

    Witkam, A P.M.

    1983-01-01

    This paper points out a rather new and largely unexplored direction. In machine translation (MT), but also in data-base enquiry, advanced word processing and natural language programming systems, the analysis of the source text is the crucial process, responsible for parsing and disambiguation. For this purpose, conventional MT systems initially relied on only grammar and dictionary, the grammar being limited to morphology and syntax. The author points to artificial intelligence as an alternative strategy, leading to knowledge based translation. 12 references.

  19. Visualizing deep neural network by alternately image blurring and deblurring.

    Science.gov (United States)

    Wang, Feng; Liu, Haijun; Cheng, Jian

    2018-01-01

    Visualization from trained deep neural networks has drawn massive public attention in recent. One of the visualization approaches is to train images maximizing the activation of specific neurons. However, directly maximizing the activation would lead to unrecognizable images, which cannot provide any meaningful information. In this paper, we introduce a simple but effective technique to constrain the optimization route of the visualization. By adding two totally inverse transformations, image blurring and deblurring, to the optimization procedure, recognizable images can be created. Our algorithm is good at extracting the details in the images, which are usually filtered by previous methods in the visualizations. Extensive experiments on AlexNet, VGGNet and GoogLeNet illustrate that we can better understand the neural networks utilizing the knowledge obtained by the visualization. Copyright © 2017 Elsevier Ltd. All rights reserved.

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

    OpenAIRE

    Lai, Songxuan; Jin, Lianwen; Yang, Weixin

    2017-01-01

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

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

    Science.gov (United States)

    2012-09-13

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

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

    OpenAIRE

    Maya Jariego, Isidro; Alieva, Deniza

    2018-01-01

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

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

    Science.gov (United States)

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

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

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

    Science.gov (United States)

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

    2014-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Juan R. Diaz

    2014-01-01

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

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

    DEFF Research Database (Denmark)

    Stefanovic, Cedomir; Popovski, Petar; Jorguseski, Ljupco

    2014-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Wen-Xiang Wu

    2014-01-01

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

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

    Science.gov (United States)

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

    2017-11-21

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

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

    NARCIS (Netherlands)

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

    2017-01-01

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

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

    NARCIS (Netherlands)

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

    2018-01-01

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

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

    Science.gov (United States)

    2006-09-01

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

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

    NARCIS (Netherlands)

    Fioreze, Tiago; Pras, Aiko

    2006-01-01

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

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

    NARCIS (Netherlands)

    van der Hoorn, W.L.F.

    2016-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Sunil Kumar

    2013-01-01

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

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

    Science.gov (United States)

    Olariu, Victor; Manesso, Erica; Peterson, Carsten

    2017-06-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2000-07-24

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

  17. Water-flushing toilets: systemic development and path-dependent characteristics and their bearing on technological alternatives

    DEFF Research Database (Denmark)

    Quitzau, M.

    2007-01-01

    Artiklen gennemgår den historiske proces, som førte til vandskyllende toilette med særlig fokus på hvordan praksisserne forandres. Herefter sættes denne udvikling op imod ønsket om mere bæredygtige toiletter og diskuterer hvordan det vandskyllende toilet hæmmer udviklingen af alternative toiletter....

  18. An alternative respiratory sounds classification system utilizing artificial neural networks

    Directory of Open Access Journals (Sweden)

    Rami J Oweis

    2015-04-01

    Full Text Available Background: Computerized lung sound analysis involves recording lung sound via an electronic device, followed by computer analysis and classification based on specific signal characteristics as non-linearity and nonstationarity caused by air turbulence. An automatic analysis is necessary to avoid dependence on expert skills. Methods: This work revolves around exploiting autocorrelation in the feature extraction stage. All process stages were implemented in MATLAB. The classification process was performed comparatively using both artificial neural networks (ANNs and adaptive neuro-fuzzy inference systems (ANFIS toolboxes. The methods have been applied to 10 different respiratory sounds for classification. Results: The ANN was superior to the ANFIS system and returned superior performance parameters. Its accuracy, specificity, and sensitivity were 98.6%, 100%, and 97.8%, respectively. The obtained parameters showed superiority to many recent approaches. Conclusions: The promising proposed method is an efficient fast tool for the intended purpose as manifested in the performance parameters, specifically, accuracy, specificity, and sensitivity. Furthermore, it may be added that utilizing the autocorrelation function in the feature extraction in such applications results in enhanced performance and avoids undesired computation complexities compared to other techniques.

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

    Science.gov (United States)

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

    2018-01-15

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

  20. Using of alternative sources of the electric power on telecommunication network of Uzbekistan

    International Nuclear Information System (INIS)

    Abdullaev, D.A.; Isaev, R.I.; Makhkamdzhanov, V.M.; Mansurov, M.S.

    1997-01-01

    The article presents the talk on the using of alternative sources of the electric power on telecommunication network of Uzbekistan given at the International Workshop on applied solar energy held in Tashkent (Uzbekistan) in June 1997. As an alternative source the combined solar-wind power plant on the basis of solar cells battery and wind-generator is proposed. The efficiency of proposed system is considered. (A.A.D.)

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

    Directory of Open Access Journals (Sweden)

    Yunyue He

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-10-15

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

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

    Science.gov (United States)

    Levchuk, Georgiy

    2016-05-01

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

  4. Optical slotted circuit switched network: a bandwidth efficient alternative to wavelength-routed network

    Science.gov (United States)

    Li, Yan; Collier, Martin

    2007-11-01

    Wavelength-routed networks have received enormous attention due to the fact that they are relatively simple to implement and implicitly offer Quality of Service (QoS) guarantees. However, they suffer from a bandwidth inefficiency problem and require complex Routing and Wavelength Assignment (RWA). Most attempts to address the above issues exploit the joint use of WDM and TDM technologies. The resultant TDM-based wavelength-routed networks partition the wavelength bandwidth into fixed-length time slots organized as a fixed-length frame. Multiple connections can thus time-share a wavelength and the grooming of their traffic leads to better bandwidth utilization. The capability of switching in both wavelength and time domains in such networks also mitigates the RWA problem. However, TMD-based wavelength-routed networks work in synchronous mode and strict synchronization among all network nodes is required. Global synchronization for all-optical networks which operate at extremely high speed is technically challenging, and deploying an optical synchronizer for each wavelength involves considerable cost. An Optical Slotted Circuit Switching (OSCS) architecture is proposed in this paper. In an OSCS network, slotted circuits are created to better utilize the wavelength bandwidth than in classic wavelength-routed networks. The operation of the protocol is such as to avoid the need for global synchronization required by TDM-based wavelength-routed networks.

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

    Science.gov (United States)

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

    2017-01-01

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

  6. Understanding Alternative Food Networks: Exploring the Role of Food Supply Chains in Rural Development

    NARCIS (Netherlands)

    Renting, H.; Marsden, T.; Banks, J.

    2003-01-01

    In this paper we explore the development and incidence of alternative food networks within a European-wide context. By developing a consistent definition of short food supply chains, we address both the morphology and the dynamics of these, and then examine empirical evidence concerning their

  7. Building Alternative Agri-Food Networks: Certification, Embeddedness and Agri-Environmental Governance

    Science.gov (United States)

    Higgins, Vaughan; Dibden, Jacqui; Cocklin, Chris

    2008-01-01

    This paper examines the role of certification in alternative agri-food networks (AAFNs), which are "in the process" of building markets for their produce outside conventional supply chains. Drawing upon recent writing on "embeddedness", we argue that certification provides an important focus for exploring the relationship and…

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

    Directory of Open Access Journals (Sweden)

    M. Metz

    2011-02-01

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

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

    Directory of Open Access Journals (Sweden)

    Manuel Perez Malumbres

    2013-02-01

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

  10. Examining the role of implementation quality in school-based prevention using the PATHS curriculum. Promoting Alternative THinking Skills Curriculum.

    Science.gov (United States)

    Kam, Chi-Ming; Greenberg, Mark T; Walls, Carla T

    2003-03-01

    In order for empirically validated school-based prevention programs to "go to scale," it is important to understand the processes underlying program dissemination. Data collected in effectiveness trials, especially those measuring the quality of program implementation and administrative support, are valuable in explicating important factors influencing implementation. This study describes findings regarding quality of implementation in a recent effectiveness trial conducted in a high-risk, American urban community. This delinquency prevention trial is a locally owned intervention, which used the Promoting Alternative THinking Skills Curriculum as its major program component. The intervention involved 350 first graders in 6 inner-city public schools. Three schools implemented the intervention and the other 3 were comparison schools from the same school district. Although intervention effects were not found for all the intervention schools, the intervention was effective in improving children's emotional competence and reducing their aggression in schools which effectively supported the intervention. This study, utilizing data from the 3 intervention schools (13 classrooms and 164 students), suggested that 2 factors contributed to the success of the intervention: (a) adequate support from school principals and (b) high degree of classroom implementation by teachers. These findings are discussed in light of the theory-driven models in program evaluation that emphasized the importance of the multiple factors influencing the implementation of school-based interventions.

  11. Alternative paths to success in a parasite community: within-host competition can favor higher virulence or direct interference.

    Science.gov (United States)

    Bashey, Farrah; Hawlena, Hadas; Lively, Curtis M

    2013-03-01

    Selection imposed by coinfection may vary with the mechanism of within-host competition between parasites. Exploitative competition is predicted to favor more virulent parasites, whereas interference competition may result in lower virulence. Here, we examine whether exploitative or interference competition determines the outcome of competition between two nematode species (Steinernema spp.), which in combination with their bacterial symbionts (Xenorhabdus spp.), infect and kill insect hosts. Multiple isolates of each nematode species, carrying their naturally associated bacteria, were characterized by (1) the rate at which they killed insect hosts, and by (2) the ability of their bacteria to interfere with each other's growth via bacteriocidal toxins called "bacteriocins." We found that both exploitative and interference abilities were important in predicting which species had a selective advantage in pairwise competition experiments. When nematodes carried bacteria that did not interact via bacteriocins, the faster killing isolate had a competitive advantage. Alternatively, nematodes could gain a competitive advantage when they carried bacteria able to inhibit the bacteria of their competitor. Thus, the combination of nematode/bacterial traits that led to competitive success depended on which isolates were paired, suggesting that variation in competitive interactions may be important for maintaining species diversity in this community. © 2012 The Author(s). Evolution© 2012 The Society for the Study of Evolution.

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

    International Nuclear Information System (INIS)

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

    2002-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Dietmar Gerteisen

    2013-09-01

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

  14. Estimating the similarity of alternative Affymetrix probe sets using transcriptional networks

    Science.gov (United States)

    2013-01-01

    Background The usefulness of the data from Affymetrix microarray analysis depends largely on the reliability of the files describing the correspondence between probe sets, genes and transcripts. Particularly, when a gene is targeted by several probe sets, these files should give information about the similarity of each alternative probe set pair. Transcriptional networks integrate the multiple correlations that exist between all probe sets and supply much more information than a simple correlation coefficient calculated for two series of signals. In this study, we used the PSAWN (Probe Set Assignment With Networks) programme we developed to investigate whether similarity of alternative probe sets resulted in some specific properties. Findings PSAWNpy delivered a full textual description of each probe set and information on the number and properties of secondary targets. PSAWNml calculated the similarity of each alternative probe set pair and allowed finding relationships between similarity and localisation of probes in common transcripts or exons. Similar alternative probe sets had very low negative correlation, high positive correlation and similar neighbourhood overlap. Using these properties, we devised a test that allowed grouping similar probe sets in a given network. By considering several networks, additional information concerning the similarity reproducibility was obtained, which allowed defining the actual similarity of alternative probe set pairs. In particular, we calculated the common localisation of probes in exons and in known transcripts and we showed that similarity was correctly correlated with them. The information collected on all pairs of alternative probe sets in the most popular 3’ IVT Affymetrix chips is available in tabular form at http://bns.crbm.cnrs.fr/download.html. Conclusions These processed data can be used to obtain a finer interpretation when comparing microarray data between biological conditions. They are particularly well

  15. Estimating the similarity of alternative Affymetrix probe sets using transcriptional networks.

    Science.gov (United States)

    Bellis, Michel

    2013-03-21

    The usefulness of the data from Affymetrix microarray analysis depends largely on the reliability of the files describing the correspondence between probe sets, genes and transcripts. Particularly, when a gene is targeted by several probe sets, these files should give information about the similarity of each alternative probe set pair. Transcriptional networks integrate the multiple correlations that exist between all probe sets and supply much more information than a simple correlation coefficient calculated for two series of signals. In this study, we used the PSAWN (Probe Set Assignment With Networks) programme we developed to investigate whether similarity of alternative probe sets resulted in some specific properties. PSAWNpy delivered a full textual description of each probe set and information on the number and properties of secondary targets. PSAWNml calculated the similarity of each alternative probe set pair and allowed finding relationships between similarity and localisation of probes in common transcripts or exons. Similar alternative probe sets had very low negative correlation, high positive correlation and similar neighbourhood overlap. Using these properties, we devised a test that allowed grouping similar probe sets in a given network. By considering several networks, additional information concerning the similarity reproducibility was obtained, which allowed defining the actual similarity of alternative probe set pairs. In particular, we calculated the common localisation of probes in exons and in known transcripts and we showed that similarity was correctly correlated with them. The information collected on all pairs of alternative probe sets in the most popular 3' IVT Affymetrix chips is available in tabular form at http://bns.crbm.cnrs.fr/download.html. These processed data can be used to obtain a finer interpretation when comparing microarray data between biological conditions. They are particularly well adapted for searching 3' alternative

  16. Alternate MIMO AF relaying networks with interference alignment: Spectral efficient protocol and linear filter design

    KAUST Repository

    Park, Kihong

    2013-02-01

    In this paper, we study a two-hop relaying network consisting of one source, one destination, and three amplify-and-forward (AF) relays with multiple antennas. To compensate for the capacity prelog factor loss of 1/2$ due to the half-duplex relaying, alternate transmission is performed among three relays, and the inter-relay interference due to the alternate relaying is aligned to make additional degrees of freedom. In addition, suboptimal linear filter designs at the nodes are proposed to maximize the achievable sum rate for different fading scenarios when the destination utilizes a minimum mean-square error filter. © 1967-2012 IEEE.

  17. Alternative oxidase in the branched mitochondrial respiratory network: an overview on structure, function, regulation, and role

    Directory of Open Access Journals (Sweden)

    Sluse F.E.

    1998-01-01

    Full Text Available Plants and some other organisms including protists possess a complex branched respiratory network in their mitochondria. Some pathways of this network are not energy-conserving and allow sites of energy conservation to be bypassed, leading to a decrease of the energy yield in the cells. It is a challenge to understand the regulation of the partitioning of electrons between the various energy-dissipating and -conserving pathways. This review is focused on the oxidase side of the respiratory chain that presents a cyanide-resistant energy-dissipating alternative oxidase (AOX besides the cytochrome pathway. The known structural properties of AOX are described including transmembrane topology, dimerization, and active sites. Regulation of the alternative oxidase activity is presented in detail because of its complexity. The alternative oxidase activity is dependent on substrate availability: total ubiquinone concentration and its redox state in the membrane and O2 concentration in the cell. The alternative oxidase activity can be long-term regulated (gene expression or short-term (post-translational modification, allosteric activation regulated. Electron distribution (partitioning between the alternative and cytochrome pathways during steady-state respiration is a crucial measurement to quantitatively analyze the effects of the various levels of regulation of the alternative oxidase. Three approaches are described with their specific domain of application and limitations: kinetic approach, oxygen isotope differential discrimination, and ADP/O method (thermokinetic approach. Lastly, the role of the alternative oxidase in non-thermogenic tissues is discussed in relation to the energy metabolism balance of the cell (supply in reducing equivalents/demand in energy and carbon and with harmful reactive oxygen species formation.

  18. Stochastic Petri nets for the reliability analysis of communication network applications with alternate-routing

    International Nuclear Information System (INIS)

    Balakrishnan, Meera; Trivedi, Kishor S.

    1996-01-01

    In this paper, we present a comparative reliability analysis of an application on a corporate B-ISDN network under various alternate-routing protocols. For simple cases, the reliability problem can be cast into fault-tree models and solved rapidly by means of known methods. For more complex scenarios, state space (Markov) models are required. However, generation of large state space models can get very labor intensive and error prone. We advocate the use of stochastic reward nets (a variant of stochastic Petri nets) for the concise specification, automated generation and solution of alternate-routing protocols in networks. This paper is written in a tutorial style so as to make it accessible to a large audience

  19. The transformation of trust in China's alternative food networks: disruption, reconstruction, and development

    Directory of Open Access Journals (Sweden)

    Raymond Yu. Wang

    2015-06-01

    Full Text Available Food safety issues in China have received much scholarly attention, yet few studies systematically examined this matter through the lens of trust. More importantly, little is known about the transformation of different types of trust in the dynamic process of food production, provision, and consumption. We consider trust as an evolving interdependent relationship between different actors. We used the Beijing County Fair, a prominent ecological farmers' market in China, as an example to examine the transformation of trust in China's alternative food networks. We argue that although there has been a disruption of institutional trust among the general public since 2008 when the melamine-tainted milk scandal broke out, reconstruction of individual trust and development of organizational trust have been observed, along with the emergence and increasing popularity of alternative food networks. Based on more than six months of fieldwork on the emerging ecological agriculture sector in 13 provinces across China as well as monitoring of online discussions and posts, we analyze how various social factors - including but not limited to direct and indirect reciprocity, information, endogenous institutions, and altruism - have simultaneously contributed to the transformation of trust in China's alternative food networks. The findings not only complement current social theories of trust, but also highlight an important yet understudied phenomenon whereby informal social mechanisms have been partially substituting for formal institutions and gradually have been building trust against the backdrop of the food safety crisis in China.

  20. The Problem of Privacy in Capitalism and the Alternative Social Networking Site Diaspora*

    Directory of Open Access Journals (Sweden)

    Sebastian Sevignani

    2012-05-01

    Full Text Available In this paper, l examine the alternative social networking site Diaspora* from a Marxist standpoint. The investigation focuses on privacy, and contributes to a better understanding of this issue within the context of capitalism in general. First, I describe Diaspora*’s way of production by pointing out its alternative character as part of the free software and copyleft movement. Second, dominant theories of privacy related to individual control, exclusion, and property are introduced. Third, the problem of privacy in capitalism is described wherein dominant concepts of privacy will be contextualised on behalf of a critical political economy analysis that refers to the Marxian concept of ideology critique, Marx’s differentiation between a societal sphere of production and a societal sphere of circulation, and his analysis of capitalist fetishisms. Fourth, taking into account the problem of privacy in capitalism, the alternative potential of Diaspora* is evaluated. Finally, a brief outline of a Marxist theory of privacy is proposed.

  1. Path Dependency

    OpenAIRE

    Mark Setterfield

    2015-01-01

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

  2. Lifetime prediction for organic coating under alternating hydrostatic pressure by artificial neural network

    Science.gov (United States)

    Tian, Wenliang; Meng, Fandi; Liu, Li; Li, Ying; Wang, Fuhui

    2017-01-01

    A concept for prediction of organic coatings, based on the alternating hydrostatic pressure (AHP) accelerated tests, has been presented. An AHP accelerated test with different pressure values has been employed to evaluate coating degradation. And a back-propagation artificial neural network (BP-ANN) has been established to predict the service property and the service lifetime of coatings. The pressure value (P), immersion time (t) and service property (impedance modulus |Z|) are utilized as the parameters of the network. The average accuracies of the predicted service property and immersion time by the established network are 98.6% and 84.8%, respectively. The combination of accelerated test and prediction method by BP-ANN is promising to evaluate and predict coating property used in deep sea. PMID:28094340

  3. Alternations of White Matter Structural Networks in First Episode Untreated Major Depressive Disorder with Short Duration

    Directory of Open Access Journals (Sweden)

    Yi Lu

    2017-10-01

    Full Text Available It is crucial to explore the pathogenesis of major depressive disorder (MDD at the early stage for the better diagnostic and treatment strategies. It was suggested that MDD might be involving in functional or structural alternations at the brain network level. However, at the onset of MDD, whether the whole brain white matter (WM alterations at network level are already evident still remains unclear. In the present study, diffusion MRI scanning was adopt to depict the unique WM structural network topology across the entire brain at the early stage of MDD. Twenty-one first episode, short duration (<1 year and drug-naïve depression patients, and 25 healthy control (HC subjects were recruited. To construct the WM structural network, atlas-based brain regions were used for nodes, and the value of multiplying fiber number by the mean fractional anisotropy along the fiber bundles connected a pair of brain regions were used for edges. The structural network was analyzed by graph theoretic and network-based statistic methods. Pearson partial correlation analysis was also performed to evaluate their correlation with the clinical variables. Compared with HCs, the MDD patients had a significant decrease in the small-worldness (σ. Meanwhile, the MDD patients presented a significantly decreased subnetwork, which mainly involved in the frontal–subcortical and limbic regions. Our results suggested that the abnormal structural network of the orbitofrontal cortex and thalamus, involving the imbalance with the limbic system, might be a key pathology in early stage drug-naive depression. And the structural network analysis might be potential in early detection and diagnosis of MDD.

  4. Designing and evaluation of three alternatives highway routes using the Analytical Hierarchy Process and the least-cost path analysis, application in Sinai Peninsula, Egypt

    Directory of Open Access Journals (Sweden)

    Hala A. Effat

    2013-12-01

    Full Text Available Land use planning in a remote desert zone is usually dependent on an efficient corridor and main road network system. In this paper, Geographic Information System (GIS tools were used to develop a least-cost path for a corridor to link three cities in Sinai Peninsula desert environment. It is supposed to create a backbone for developing the middle part of peninsula by facilitating the transport of mineral resources and accessibility to such region and encourage populating the remote desert city of Nekhel and the coastal cities of Taba and El Shatt. Therefore, such a route should have the least cost and should be protected from the negative impacts that may be caused by the surrounding environment. Environmental and economical factors were integrated through a spatial multicriteria model using the Analytical Hierarchy Process. Cost factors were identified and a cost surface was created for each factor, standardized, weighed and aggregated. Three visions were modelled: an engineering vision, an environmental vision and a hybrid vision. A multicriteria evaluation was used to compare the three routes. The hybrid route was finally recommended.

  5. Alternative cooling water flow path for RHR heat exchanger and its effect on containment response during extended station blackout for Chinshan BWR-4 plant

    Energy Technology Data Exchange (ETDEWEB)

    Yuann, Yng-Ruey, E-mail: ryyuann@iner.gov.tw

    2016-04-15

    Highlights: • Motivating alternative RHR heat exchanger tube-side flow path and determining required capacity. • Calculate NSSS and containment response during 24-h SBO for Chinshan BWR-4 plant. • RETRAN and GOTHIC models are developed for NSSS and containment, respectively. • Safety relief valve blowdown flow and energy to drywell are generated by RETRAN. • Analyses are performed with and without reactor depressurization, respectively. - Abstract: The extended Station Blackout (SBO) of 24 h has been analyzed with respect to the containment response, in particular the suppression pool temperature response, for the Chinshan BWR-4 plant of MARK-I containment. The Chinshan plant, owned by Taiwan Power Company, has twin units with rated core thermal power of 1840 MW each. The analysis is aimed at determining the required alternative cooling water flow capacity for the residual heat removal (RHR) heat exchanger when its tube-side sea water cooling flow path is blocked, due to some reason such as earthquake or tsunami, and is switched to the alternative raw water source. Energy will be dissipated to the suppression pool through safety relief valves (SRVs) of the main steam lines during SBO. The RETRAN model is used to calculate the Nuclear Steam Supply System (NSSS) response and generate the SRV blowdown conditions, including SRV pressure, enthalpy, and mass flow rate. These conditions are then used as the time-dependent boundary conditions for the GOTHIC code to calculate the containment pressure and temperature response. The shaft seals of the two recirculation pumps are conservatively assumed to fail due to loss of seal cooling and a total leakage flow rate of 36 gpm to the drywell is included in the GOTHIC model. Based on the given SRV blowdown conditions, the GOTHIC containment calculation is performed several times, through the adjustment of the heat transfer rate of the RHR heat exchanger, until the criterion that the maximum suppression pool temperature

  6. Alternating Dynamics of Segregation and Integration in Human EEG Functional Networks During Working-memory Task.

    Science.gov (United States)

    Zippo, Antonio G; Della Rosa, Pasquale A; Castiglioni, Isabella; Biella, Gabriele E M

    2018-02-10

    Brain functional networks show high variability in short time windows but mechanisms governing these transient dynamics remain unknown. In this work, we studied the temporal evolution of functional brain networks involved in a working memory (WM) task while recording high-density electroencephalography (EEG) in human normal subjects. We found that functional brain networks showed an initial phase characterized by an increase of the functional segregation index followed by a second phase where the functional segregation faded after the prevailing the functional integration. Notably, wrong trials were associated with different or disrupted sequences of the segregation-integration profiles and measures of network centrality and modularity were able to identify crucial aspects of the oscillatory network dynamics. Additionally, computational investigations further supported the experimental results. The brain functional organization may respond to the information processing demand of a WM task following a 2-step atomic scheme wherein segregation and integration alternately dominate the functional configurations. Copyright © 2017 The Author(s). Published by Elsevier Ltd.. All rights reserved.

  7. LambdaStation: Exploiting Advance Networks In Data Intensive High Energy Physics Applications

    Energy Technology Data Exchange (ETDEWEB)

    Harvey B. Newman

    2009-09-11

    Lambda Station software implements selective, dynamic, secure path control between local storage & analysis facilities, and high bandwidth, wide-area networks (WANs). It is intended to facilitate use of desirable, alternate wide area network paths which may only be intermittently available, or subject to policies that restrict usage to specified traffic. Lambda Station clients gain awareness of potential alternate network paths via Clarens-based web services, including path characteristics such as bandwidth and availability. If alternate path setup is requested and granted, Lambda Station will configure the local network infrastructure to properly forward designated data flows via the alternate path. A fully functional implementation of Lambda Station, capable of dynamic alternate WAN path setup and teardown, has been successfully developed. A limited Lambda Station-awareness capability within the Storage Resource Manager (SRM) product has been developed. Lambda Station has been successfully tested in a number of venues, including Super Computing 2008. LambdaStation software, developed by the Fermilab team, enables dynamic allocation of alternate network paths for high impact traffic and to forward designated flows across LAN. It negotiates with reservation and provisioning systems of WAN control planes, be it based on SONET channels, demand tunnels, or dynamic circuit networks. It creates End-To-End circuit between single hosts, computer farms or networks with predictable performance characteristics, preserving QoS if supported in LAN and WAN and tied security policy allowing only specific traffic to be forwarded or received through created path. Lambda Station project also explores Network Awareness capabilities.

  8. Study of QoS control and reliable routing method for utility communication network. Application of differentiated service to the network and alternative route establishment by the IP routing protocol; Denryokuyo IP network no QoS seigyo to shinraisei kakuho no hoho. DiffServ ni yoru QoS seigyo no koka to IP ni yoru fuku root ka no kento

    Energy Technology Data Exchange (ETDEWEB)

    Oba, E.

    2000-05-01

    QoS control method which satisfies utilities communication network requirement and alternative route establishment method which is for sustaining communication during a failure are studied. Applicability of DiffServ (Differentiated Service), one of the most promising QoS control method on IP network and studying energetically in IETF WG, is studied and it is found most application used in the utility communication network except for relaying system information could he accommodated to the DiffServ network. An example of the napping of the utility communication applications to the DiffServ PHB (Per Hop Behavior) is shown in this paper. Regarding to the alternative route, usual IP routing protocol cannot establish alternative route which doesn't have common links and nodes in their paths for a destination. IP address duplication with some modification of routing protocol enables such alternative route establishment. MPLS, distance vector algorithm and link state algorithm are evaluated qualitatively, and as a result, we found MPLS is promising way to establish the route. Quantitative evaluation will be future work. (author)

  9. PathShuffle: Credit Mixing and Anonymous Payments for Ripple

    OpenAIRE

    Moreno-Sanchez Pedro; Ruffing Tim; Kate Aniket

    2017-01-01

    The I owe you (IOU) credit network Ripple is one of the most prominent alternatives in the burgeoning field of decentralized payment systems. Ripple’s path-based transactions set it apart from cryptocurrencies such as Bitcoin. Its pseudonymous nature, while still maintaining some regulatory capabilities, has motivated several financial institutions across the world to use Ripple for processing their daily transactions. Nevertheless, with its public ledger, a credit network such as Ripple is n...

  10. Audits and agrarianism: The moral economy of an alternative food network

    Directory of Open Access Journals (Sweden)

    Liz Carlisle

    2015-09-01

    Full Text Available Abstract With consumers and producers seeking alternatives to corporate, industrial food, systems of provision that promise greater ecological and social sustainability have gained in popularity. As these Alternative Food Networks (AFNs scale up and go mainstream, both scholars and the general public want to know who is holding them accountable to their purported goals. In response to such questions, previously informal designations - such as organic - have become formalized, standardized, and institutionalized, and new certifications and business models promise improved traceability and transparency. I suggest, however, that successful alternative food networks - those that deliver on their promises of social and ecological sustainability – may be governed primarily by broad-based moral economies and support networks, and only secondarily by specific certification schemes or value chain quality control. Drawing on ethnographic research with a values-based supply chain on the northern Great Plains, I find that what creates incentives for sustainable practices and holds farmers accountable is less the regulatory component of certification or contractual stipulations of the value chain than the peer review aspect of belonging to the self-organized community that participates in these initiatives. While the organic certification process and values-based supply chain provide vehicles through which the moral economy of sustainable agriculture can operate, the moral economy itself precedes the notion of organic standards, dating back three generations to early twentieth century wheat pools. Since community formation and standard formation are achieved in very different ways, these findings have significant implications for policies aimed at encouraging transitions to more sustainable agricultural practices.

  11. Impact of the traffic load on performance of an alternative LTE railway communication network

    DEFF Research Database (Denmark)

    Sniady, Aleksander; Soler, José

    2013-01-01

    communication infrastructure supporting railway signaling. This work is based on OPNET realistic network simulations, which show the relation between the traffic load (the number of trains transmitting and receiving data in an LTE cell) and the delay performance of the European Train Control System (ETCS......Although many countries only now begin to invest in deployment of GSM-Railways (GSM-R) networks, this technology is already obsolete and reveals its significant shortcomings. The most troublesome one is the insufficient number of communication channels offered by GSM-R. This is a major problem...... obstructing railway operations at big train stations and junctions. Hence, other technologies, such as Long Term Evolution (LTE), need to be considered as an alternative to GSM-R. The goal of this paper is to demonstrate the capacity increase that railways can expect, from the introduction of LTE as internal...

  12. Alternative Fuel News: Official Publication of the Clean Cities Network and the Alternative Fuels Data Center, Vol. 4, No. 2

    Energy Technology Data Exchange (ETDEWEB)

    Ficker, C.

    2000-09-08

    This issue of Alternative Fuel News discusses Executive Order 13149 which is designed to not only increase the use of alternative fuel by federal agencies but also to increase the use of fuel efficient vehicles in the federal fleet. Also highlighted is the 6th National Clean Cities Conference and Expo held in San Diego, May 7-10, 2000, which attracted nearly 1,000 people for three action-packed days of alternative fuel activities. The work to develop a market for alternative fuels is more important than ever.

  13. [Child protection network and the intersector implementation of the circle of security as alternatives to medication].

    Science.gov (United States)

    Becker, Ana Laura Martins M M; de Souza, Paulo Haddad; de Oliveira, Mônica Martins; Paraguay, Nestor Luiz Bruzzi B

    2014-09-01

    To describe the clinical history of a child with aggressive behavior and recurring death-theme speech, and report the experience of the team of authors, who proposed an alternative to medication through the establishment of a protection network and the inter-sector implementation of the circle of security concept. A 5-year-old child has a violent and aggressive behavior at the day-care. The child was diagnosed by the healthcare center with depressive disorder and behavioral disorder, and was medicated with sertraline and risperidone. Side effects were observed, and the medications were discontinued. Despite several actions, such as talks, teamwork, psychological and psychiatric follow-up, the child's behavior remained unchanged. A unique therapeutic project was developed by Universidade Estadual de Campinas' Medical School students in order to establish a connection between the entities responsible for the child's care (daycare center, healthcare center, and family). Thus, the team was able to develop a basic care protection network. The implementation of the inter-sector circle of security, as well as the communication and cooperation among the teams, produced very favorable results in this case. This initiative was shown to be a feasible and effective alternative to the use of medication for this child. Copyright © 2014 Sociedade de Pediatria de São Paulo. Publicado por Elsevier Editora Ltda. All rights reserved.

  14. A Comparison of Alternative Distributed Dynamic Cluster Formation Techniques for Industrial Wireless Sensor Networks.

    Science.gov (United States)

    Gholami, Mohammad; Brennan, Robert W

    2016-01-06

    In this paper, we investigate alternative distributed clustering techniques for wireless sensor node tracking in an industrial environment. The research builds on extant work on wireless sensor node clustering by reporting on: (1) the development of a novel distributed management approach for tracking mobile nodes in an industrial wireless sensor network; and (2) an objective comparison of alternative cluster management approaches for wireless sensor networks. To perform this comparison, we focus on two main clustering approaches proposed in the literature: pre-defined clusters and ad hoc clusters. These approaches are compared in the context of their reconfigurability: more specifically, we investigate the trade-off between the cost and the effectiveness of competing strategies aimed at adapting to changes in the sensing environment. To support this work, we introduce three new metrics: a cost/efficiency measure, a performance measure, and a resource consumption measure. The results of our experiments show that ad hoc clusters adapt more readily to changes in the sensing environment, but this higher level of adaptability is at the cost of overall efficiency.

  15. Alternative Fuel News: Official Publication of the Clean Cities Network and the Alternative Fuels Data Center, Vol. 5, No. 3

    Energy Technology Data Exchange (ETDEWEB)

    2001-11-01

    A quarterly magazine with articles on alternative fuel school buses, the market growth of biodiesel fuel, National AFV Day 2002, model year 2002 alternative fuel passenger cars and light trucks, the Michelin Challenge Bibendum road rally, and advanced technology vehicles at Robins Air Force Base, the Top Ten Clean Cities coalitions for 2000, and AFVs on college campuses.

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

    OpenAIRE

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

    2016-01-01

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

  17. Path Expressions

    Science.gov (United States)

    1975-06-01

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

  18. Greek Civil Society’s Online Alternative Networks as Emergent Resilience Strategies in Time of Crisis

    Directory of Open Access Journals (Sweden)

    Maria Zafiropoulou

    2016-12-01

    Full Text Available The use of new communications technologies and social media, in Greece, during the time of crisis, has led to the development of numerous online informal Civil Society Networks (CSNs (i.e. networking-building platforms, self - organized groups in Facebook, forums, exchange platforms proposing a rethinking of the status quo of formal civil organizations. This research, utilizing the methodology of discourse analysis, aims at summarizing the rise of these networks in Greece that incorporates both solidarity initiatives and autonomous political/economic spaces and identify the indicative predictive factors of their survival and growth. Some basic conclusions that have been drawn through this research is that alternative online networks can be proven as indicative sign of the social dynamism of a given period but in order to be resilient and sustainable they should develop focal points of physical reference, pursue national representation, focus mainly on monothematic goods/services and cultivate, in several cases, links with relevant social movements and local or national NGOs. A general induction through this research is that a CSN, during this current crisis, stands between two classical models of reference in a society seeking modernity and flexibility and can be considered as a proposed type of effective experimentation and mobilization that can pursue common social goals and serve needs of deprived people. Some issues that still remain underexplored and need further elaboration are social and political identity of participants, the potential links with local, national and international communities, the functional balance between structure and flexibility as well as the efficient distribution of energy between solidarity and protest.

  19. Alternative Fuel News: Official Publication of the Clean Cities Network and the Alternative Fuels Data Center, Vol. 6, No. 1

    Energy Technology Data Exchange (ETDEWEB)

    2002-07-01

    Quarterly magazine with articles on auctions of used alternative fuel vehicles (AFVs), Royalty Enterprises of Ohio, and introducing AFVs in neglected urban areas. Plus Ford's new CNG school bus and electric buses in Connecticut.

  20. The Best of Both Worlds? Online Ties and the Alternating Use of Social Network Sites in the Context of Migration

    Directory of Open Access Journals (Sweden)

    Jens F. Binder

    2014-12-01

    Full Text Available While an ever-growing body of research is concerned with user behavior on individual social network sites (SNSs—mostly Facebook—studies addressing an alternating use of two or more SNS are rare. Here, we investigate the relationship between alternating SNS use and social capital in the context of migration. Alternating SNS use avoids some of the problems associated with large networks located on one site; in particular the management of different social or cultural spheres. Not only does this strategy hold potential for increased social capital, it also provides a particular incentive for migrants faced with the challenge of staying in touch with back home and managing a new social environment. Two survey studies are presented that focus on the relationship between alternating SNS use and online ties in a migrant context involving Indian nationals. Study 1 looked at migration within India, whereas Study 2 compared international with domestic SNS users. In both studies, alternating SNS use added to the prediction of online network size and accounted for differences in network size found for migrant and non-migrant users. Differences were due to the number of peripheral ties, rather than core ties. Findings suggest that alternating SNS use may constitute a compensatory strategy that helps to overcome lower levels of socializing represented through a single SNS.

  1. The role of propriospinal neuronal network in transmitting the alternating muscular activities of flexor and extensor in parkinsonian tremor.

    Science.gov (United States)

    Hao, M; He, X; Lan, N

    2012-01-01

    It has been shown that normal cyclic movement of human arm and resting limb tremor in Parkinson's disease (PD) are associated with the oscillatory neuronal activities in different cerebral networks, which are transmitted to the antagonistic muscles via the same spinal pathway. There are mono-synaptic and multi-synaptic corticospinal pathways for conveying motor commands. This study investigates the plausible role of propriospinal neuronal (PN) network in the C3-C4 levels in multi-synaptic transmission of cortical commands for oscillatory movements. A PN network model is constructed based on known neurophysiological connections, and is hypothesized to achieve the conversion of cortical oscillations into alternating antagonistic muscle bursts. Simulations performed with a virtual arm (VA) model indicate that without the PN network, the alternating bursts of antagonistic muscle EMG could not be reliably generated, whereas with the PN network, the alternating pattern of bursts were naturally displayed in the three pairs of antagonist muscles. Thus, it is suggested that oscillations in the primary motor cortex (M1) of single and double tremor frequencies are processed at the PN network to compute the alternating burst pattern in the flexor and extensor muscles.

  2. Efficient Routing in Wireless Sensor Networks with Multiple Sessions

    OpenAIRE

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

    2014-01-01

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

  3. Building a sustainable complementary and alternative medicine research network in Europe.

    Science.gov (United States)

    Reiter, Bettina; Baumhöfener, Franziska; Dlaboha, Meike; Odde Madsen, Jesper; Regenfelder, Stephanie; Weidenhammer, Wolfgang

    2012-01-01

    Since CAMbrella is a networking project funded by the European Commission explicitly to build and sustain a complementary and alternative medicine (CAM) research network in Europe, communication and dissemination play a large role and form a work package of their own. The present article gives an outline of the communication and dissemination work in the CAMbrella consortium. The intensive building of sound internal communication is an essential part in establishing a functioning structure for collaboration in a diverse group of 16 partner institutions from 12 countries, as exists in the CAMbrella project. The means and tools for dissemination of results to the scientific community and the European public at large, as well as to the European policy makers, are presented. The development of the corporate design and a dissemination strategy are described in detail. In addition, some basic information regarding previous CAM research efforts, which might be interesting for future consortium building in the field of CAM research, is given. Internal communication within a heterogeneous research group, the maintenance of a work-oriented style of communication and a consensus oriented effort in establishing dissemination tools and products will be essential for any future consortium in the CAM field. The outlook shows the necessity for active political encouragement of CAM research and the desideratum of a Pan-European institution analogous to the NIH (National Institutes of Health) in the USA.

  4. Path-based Queries on Trajectory Data

    DEFF Research Database (Denmark)

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

    2014-01-01

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

  5. Open Source software and social networks: Disruptive alternatives for medical imaging

    International Nuclear Information System (INIS)

    Ratib, Osman; Rosset, Antoine; Heuberger, Joris

    2011-01-01

    In recent decades several major changes in computer and communication technology have pushed the limits of imaging informatics and PACS beyond the traditional system architecture providing new perspectives and innovative approach to a traditionally conservative medical community. Disruptive technologies such as the world-wide-web, wireless networking, Open Source software and recent emergence of cyber communities and social networks have imposed an accelerated pace and major quantum leaps in the progress of computer and technology infrastructure applicable to medical imaging applications. Methods: This paper reviews the impact and potential benefits of two major trends in consumer market software development and how they will influence the future of medical imaging informatics. Open Source software is emerging as an attractive and cost effective alternative to traditional commercial software developments and collaborative social networks provide a new model of communication that is better suited to the needs of the medical community. Observations: Evidence shows that successful Open Source software tools have penetrated the medical market and have proven to be more robust and cost effective than their commercial counterparts. Developed by developers that are themselves part of the user community, these tools are usually better adapted to the user's need and are more robust than traditional software programs being developed and tested by a large number of contributing users. This context allows a much faster and more appropriate development and evolution of the software platforms. Similarly, communication technology has opened up to the general public in a way that has changed the social behavior and habits adding a new dimension to the way people communicate and interact with each other. The new paradigms have also slowly penetrated the professional market and ultimately the medical community. Secure social networks allowing groups of people to easily communicate

  6. Open Source software and social networks: Disruptive alternatives for medical imaging

    Energy Technology Data Exchange (ETDEWEB)

    Ratib, Osman, E-mail: osman.ratib@hcuge.ch [Department of Medical Imaging and Information Sciences, University Hospital of Geneva, 24, rue Micheli-du-Crest, 1205 Geneva (Switzerland); Rosset, Antoine; Heuberger, Joris [Department of Medical Imaging and Information Sciences, University Hospital of Geneva, 24, rue Micheli-du-Crest, 1205 Geneva (Switzerland)

    2011-05-15

    In recent decades several major changes in computer and communication technology have pushed the limits of imaging informatics and PACS beyond the traditional system architecture providing new perspectives and innovative approach to a traditionally conservative medical community. Disruptive technologies such as the world-wide-web, wireless networking, Open Source software and recent emergence of cyber communities and social networks have imposed an accelerated pace and major quantum leaps in the progress of computer and technology infrastructure applicable to medical imaging applications. Methods: This paper reviews the impact and potential benefits of two major trends in consumer market software development and how they will influence the future of medical imaging informatics. Open Source software is emerging as an attractive and cost effective alternative to traditional commercial software developments and collaborative social networks provide a new model of communication that is better suited to the needs of the medical community. Observations: Evidence shows that successful Open Source software tools have penetrated the medical market and have proven to be more robust and cost effective than their commercial counterparts. Developed by developers that are themselves part of the user community, these tools are usually better adapted to the user's need and are more robust than traditional software programs being developed and tested by a large number of contributing users. This context allows a much faster and more appropriate development and evolution of the software platforms. Similarly, communication technology has opened up to the general public in a way that has changed the social behavior and habits adding a new dimension to the way people communicate and interact with each other. The new paradigms have also slowly penetrated the professional market and ultimately the medical community. Secure social networks allowing groups of people to easily

  7. Open Source software and social networks: disruptive alternatives for medical imaging.

    Science.gov (United States)

    Ratib, Osman; Rosset, Antoine; Heuberger, Joris

    2011-05-01

    In recent decades several major changes in computer and communication technology have pushed the limits of imaging informatics and PACS beyond the traditional system architecture providing new perspectives and innovative approach to a traditionally conservative medical community. Disruptive technologies such as the world-wide-web, wireless networking, Open Source software and recent emergence of cyber communities and social networks have imposed an accelerated pace and major quantum leaps in the progress of computer and technology infrastructure applicable to medical imaging applications. This paper reviews the impact and potential benefits of two major trends in consumer market software development and how they will influence the future of medical imaging informatics. Open Source software is emerging as an attractive and cost effective alternative to traditional commercial software developments and collaborative social networks provide a new model of communication that is better suited to the needs of the medical community. Evidence shows that successful Open Source software tools have penetrated the medical market and have proven to be more robust and cost effective than their commercial counterparts. Developed by developers that are themselves part of the user community, these tools are usually better adapted to the user's need and are more robust than traditional software programs being developed and tested by a large number of contributing users. This context allows a much faster and more appropriate development and evolution of the software platforms. Similarly, communication technology has opened up to the general public in a way that has changed the social behavior and habits adding a new dimension to the way people communicate and interact with each other. The new paradigms have also slowly penetrated the professional market and ultimately the medical community. Secure social networks allowing groups of people to easily communicate and exchange information

  8. Alternative fuel news: Official publication of the clean cities network and the alternative fuels data center, Vol. 4, No. 1

    Energy Technology Data Exchange (ETDEWEB)

    NREL

    2000-03-27

    This issue of Alternative Fuel News contains information on the upcoming Clean Cities Conference to be held May 7--10, 2000 in San Diego, California. Highlighted in this issue is the success of the Clean Cities Program in creating clean corridors that permit fleets that serve multiple cities to purchase AFVs with confidence, knowing that fueling convenience and supply will not be a problem. Also look for articles on electric vehicles, transit buses; state and fuel provider enforcement; the Salt Lake and Greater Long Island Clean Cities coalitions, HEVs and fuel cells are a big hit at auto shows; DOE awards alternative fuel grants to 33 National Parks; and the Energy Policy Act (EPAct) Section 506 report.

  9. SR 97 - Alternative models project. Discrete fracture network modelling for performance assessment of Aberg

    International Nuclear Information System (INIS)

    Dershowitz, B.; Eiben, T.; Follin, S.; Andersson, Johan

    1999-08-01

    As part of studies into the siting of a deep repository for nuclear waste, Swedish Nuclear Fuel and Waste Management Company (SKB) has commissioned the Alternative Models Project (AMP). The AMP is a comparison of three alternative modeling approaches for geosphere performance assessment for a single hypothetical site. The hypothetical site, arbitrarily named Aberg is based on parameters from the Aespoe Hard Rock Laboratory in southern Sweden. The Aberg model domain, boundary conditions and canister locations are defined as a common reference case to facilitate comparisons between approaches. This report presents the results of a discrete fracture pathways analysis of the Aberg site, within the context of the SR 97 performance assessment exercise. The Aberg discrete fracture network (DFN) site model is based on consensus Aberg parameters related to the Aespoe HRL site. Discrete fracture pathways are identified from canister locations in a prototype repository design to the surface of the island or to the sea bottom. The discrete fracture pathways analysis presented in this report is used to provide the following parameters for SKB's performance assessment transport codes FARF31 and COMP23: * F-factor: Flow wetted surface normalized with regards to flow rate (yields an appreciation of the contact area available for diffusion and sorption processes) [TL -1 ]. * Travel Time: Advective transport time from a canister location to the environmental discharge [T]. * Canister Flux: Darcy flux (flow rate per unit area) past a representative canister location [LT -1 ]. In addition to the above, the discrete fracture pathways analysis in this report also provides information about: additional pathway parameters such as pathway length, pathway width, transport aperture, reactive surface area and transmissivity, percentage of canister locations with pathways to the surface discharge, spatial pattern of pathways and pathway discharges, visualization of pathways, and statistical

  10. Calculation for the thermodynamic properties of an alternative refrigerant (R508b) using artificial neural network

    International Nuclear Information System (INIS)

    Soezen, Adnan; Ozalp, Mehmet; Arcaklioglu, Erol

    2007-01-01

    This study proposes a alternative approach based on artificial neural networks (ANNs) to determine the thermodynamic properties - specific volume, enthalpy and entropy - of an alternative refrigerant (R508b) for both saturated liquid-vapor region (wet vapor) and superheated vapor region. In the ANN, the back-propagation learning algorithm with two different variants, namely scaled conjugate gradient (SCG) and Levenberg-Marquardt (LM), and Logistic Sigmoid transfer function were used to determine the best approach. The most suitable algorithm and with appropriate number of neurons (i.e. 7) in the hidden layer is found to be the LM algorithm which has provided the minimum error. For wet vapor region, R 2 values - which are errors known as absolute fraction of variance - are 0.983495, 0.969027, 0.999984, 0.999963, 0.999981, and 0.999975, for specific volume, enthalpy and entropy for training and testing, respectively. Similarly, for superheated vapor, they are: 0.995346, 0.996947, 0.999996, 0.999997, 0.999974, and 0.999975, for training and testing, respectively. According to the regression analysis results, R 2 values are 0.9312, 0.9708, 0.9428, 0.9343, 0.967 and 0.9546 for specific volume, enthalpy and entropy for wet vapor region and superheated vapor, respectively. The comparisons of the results suggest that, ANN provided results comfortably within the acceptable range. This study, deals with the potential application of the ANNs to represent PVTx (pressure-specific volume-temperature-vapor quality) data. Therefore, reducing the risk of experimental uncertainties and also removing the need for complex analytic equations requiring long computational time and efforts

  11. SR 97 - Alternative models project. Discrete fracture network modelling for performance assessment of Aberg

    Energy Technology Data Exchange (ETDEWEB)

    Dershowitz, B.; Eiben, T. [Golder Associates Inc., Seattle (United States); Follin, S.; Andersson, Johan [Golder Grundteknik KB, Stockholm (Sweden)

    1999-08-01

    As part of studies into the siting of a deep repository for nuclear waste, Swedish Nuclear Fuel and Waste Management Company (SKB) has commissioned the Alternative Models Project (AMP). The AMP is a comparison of three alternative modeling approaches for geosphere performance assessment for a single hypothetical site. The hypothetical site, arbitrarily named Aberg is based on parameters from the Aespoe Hard Rock Laboratory in southern Sweden. The Aberg model domain, boundary conditions and canister locations are defined as a common reference case to facilitate comparisons between approaches. This report presents the results of a discrete fracture pathways analysis of the Aberg site, within the context of the SR 97 performance assessment exercise. The Aberg discrete fracture network (DFN) site model is based on consensus Aberg parameters related to the Aespoe HRL site. Discrete fracture pathways are identified from canister locations in a prototype repository design to the surface of the island or to the sea bottom. The discrete fracture pathways analysis presented in this report is used to provide the following parameters for SKB's performance assessment transport codes FARF31 and COMP23: * F-factor: Flow wetted surface normalized with regards to flow rate (yields an appreciation of the contact area available for diffusion and sorption processes) [TL{sup -1}]. * Travel Time: Advective transport time from a canister location to the environmental discharge [T]. * Canister Flux: Darcy flux (flow rate per unit area) past a representative canister location [LT{sup -1}]. In addition to the above, the discrete fracture pathways analysis in this report also provides information about: additional pathway parameters such as pathway length, pathway width, transport aperture, reactive surface area and transmissivity, percentage of canister locations with pathways to the surface discharge, spatial pattern of pathways and pathway discharges, visualization of pathways, and

  12. Organivore or organorexic? Examining the relationship between alternative food network engagement, disordered eating, and special diets.

    Science.gov (United States)

    Barnett, Michaela J; Dripps, Weston R; Blomquist, Kerstin K

    2016-10-01

    The alternative food network (AFN) refers to connections between consumers, producers, and sellers of organic, local/regional, "sustainably grown," and other artisanal and niche food not produced by the conventional system (Goodman & Goodman, 2007). Alternative foods are often viewed as the "right" consumption choice while conventional counterparts are positioned as ethically "wrong." A moral positioning of food, avoidance of certain food groups, and anxiety elicited by food consumption choices bears similarities to disordered eating behaviors (Hesse-Biber, Leavy, Quinn, & Zoino, 2006), including a newly proposed eating syndrome, orthorexia nervosa (ON; Vandereycken, 2011; Zamora, Bonaechea, Sánchez, & Rial, 2005). This study examines the relationship among engagement in the AFN, disordered eating behaviors, and special diets. We hypothesized that individuals with higher AFN engagement would be more likely report disordered eating behaviors as well as to follow a special diet. Adult men and women (N = 284) completed a series of measures assessing engagement in the AFN and eating behaviors. We found that individuals with higher AFN engagement were more likely to report ON tendencies but not significantly likely to engage in other disordered eating behaviors. Individuals following a special diet were significantly more engaged in the AFN, more likely to report ON tendencies, and more likely to self-report an eating disorder. Our findings suggest that the most engaged consumers participate in the AFN for the purported benefits reaped by society and the environment and not to moderate their consumption or mask disordered eating behaviors. Future research should prospectively explore associations between AFN engagement, ON and disordered eating behaviors, and special diets as well as consider the utility of incorporating AFN engagement into existing disordered eating prevention programs. Copyright © 2016 Elsevier Ltd. All rights reserved.

  13. Prairie Network Fireballs: Data of motion and ablation of fireball bodies obtained by local-ballistic method applied to variably-sliding path-segment

    Science.gov (United States)

    Kalenichenko, Valentin V.

    2000-11-01

    The electronic version of an extensive catalogue of the results of the fireball physics inverse problem solution for the precise observational data of the Prairie Network Fireballs (DTHM-values) obtained by local-ballistic method of a variably-sliding path-segment contains a set of the physical parameters for the 480 fireball images of the 248 cosmic body entries into the Earth's atmosphere (PNVK-values). The parameters are: the fireball velocity with the corresponding values of the mass to cross-section area ratio for the fireball-generating body a teach measured point of the fireball path, the ablation factor and the ratio of the luminous fireball energy to the drag work for the body in the Earth's atmosphere using a factor inversely proportional to the density of the body. The catalogue of all PNVK-values, about 3.1 Mbytes in ASCII is accessible from ftp://ftp2.mao.kiev.ua/pub/astro/pnvk, files pnvk.cat and pnvks.cat

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

    Science.gov (United States)

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

    2015-06-01

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

  15. Alternative method of highway traffic safety analysis for developing countries using delphi technique and Bayesian network.

    Science.gov (United States)

    Mbakwe, Anthony C; Saka, Anthony A; Choi, Keechoo; Lee, Young-Jae

    2016-08-01

    Highway traffic accidents all over the world result in more than 1.3 million fatalities annually. An alarming number of these fatalities occurs in developing countries. There are many risk factors that are associated with frequent accidents, heavy loss of lives, and property damage in developing countries. Unfortunately, poor record keeping practices are very difficult obstacle to overcome in striving to obtain a near accurate casualty and safety data. In light of the fact that there are numerous accident causes, any attempts to curb the escalating death and injury rates in developing countries must include the identification of the primary accident causes. This paper, therefore, seeks to show that the Delphi Technique is a suitable alternative method that can be exploited in generating highway traffic accident data through which the major accident causes can be identified. In order to authenticate the technique used, Korea, a country that underwent similar problems when it was in its early stages of development in addition to the availability of excellent highway safety records in its database, is chosen and utilized for this purpose. Validation of the methodology confirms the technique is suitable for application in developing countries. Furthermore, the Delphi Technique, in combination with the Bayesian Network Model, is utilized in modeling highway traffic accidents and forecasting accident rates in the countries of research. Copyright © 2016 Elsevier Ltd. All rights reserved.

  16. A New Path-Constrained Rendezvous Planning Approach for Large-Scale Event-Driven Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Ahmadreza Vajdi

    2018-05-01

    Full Text Available We study the problem of employing a mobile-sink into a large-scale Event-Driven Wireless Sensor Networks (EWSNs for the purpose of data harvesting from sensor-nodes. Generally, this employment improves the main weakness of WSNs that is about energy-consumption in battery-driven sensor-nodes. The main motivation of our work is to address challenges which are related to a network’s topology by adopting a mobile-sink that moves in a predefined trajectory in the environment. Since, in this fashion, it is not possible to gather data from sensor-nodes individually, we adopt the approach of defining some of the sensor-nodes as Rendezvous Points (RPs in the network. We argue that RP-planning in this case is a tradeoff between minimizing the number of RPs while decreasing the number of hops for a sensor-node that needs data transformation to the related RP which leads to minimizing average energy consumption in the network. We address the problem by formulating the challenges and expectations as a Mixed Integer Linear Programming (MILP. Henceforth, by proving the NP-hardness of the problem, we propose three effective and distributed heuristics for RP-planning, identifying sojourn locations, and constructing routing trees. Finally, experimental results prove the effectiveness of our approach.

  17. A New Path-Constrained Rendezvous Planning Approach for Large-Scale Event-Driven Wireless Sensor Networks.

    Science.gov (United States)

    Vajdi, Ahmadreza; Zhang, Gongxuan; Zhou, Junlong; Wei, Tongquan; Wang, Yongli; Wang, Tianshu

    2018-05-04

    We study the problem of employing a mobile-sink into a large-scale Event-Driven Wireless Sensor Networks (EWSNs) for the purpose of data harvesting from sensor-nodes. Generally, this employment improves the main weakness of WSNs that is about energy-consumption in battery-driven sensor-nodes. The main motivation of our work is to address challenges which are related to a network’s topology by adopting a mobile-sink that moves in a predefined trajectory in the environment. Since, in this fashion, it is not possible to gather data from sensor-nodes individually, we adopt the approach of defining some of the sensor-nodes as Rendezvous Points (RPs) in the network. We argue that RP-planning in this case is a tradeoff between minimizing the number of RPs while decreasing the number of hops for a sensor-node that needs data transformation to the related RP which leads to minimizing average energy consumption in the network. We address the problem by formulating the challenges and expectations as a Mixed Integer Linear Programming (MILP). Henceforth, by proving the NP-hardness of the problem, we propose three effective and distributed heuristics for RP-planning, identifying sojourn locations, and constructing routing trees. Finally, experimental results prove the effectiveness of our approach.

  18. A New Path-Constrained Rendezvous Planning Approach for Large-Scale Event-Driven Wireless Sensor Networks

    Science.gov (United States)

    Zhang, Gongxuan; Wang, Yongli; Wang, Tianshu

    2018-01-01

    We study the problem of employing a mobile-sink into a large-scale Event-Driven Wireless Sensor Networks (EWSNs) for the purpose of data harvesting from sensor-nodes. Generally, this employment improves the main weakness of WSNs that is about energy-consumption in battery-driven sensor-nodes. The main motivation of our work is to address challenges which are related to a network’s topology by adopting a mobile-sink that moves in a predefined trajectory in the environment. Since, in this fashion, it is not possible to gather data from sensor-nodes individually, we adopt the approach of defining some of the sensor-nodes as Rendezvous Points (RPs) in the network. We argue that RP-planning in this case is a tradeoff between minimizing the number of RPs while decreasing the number of hops for a sensor-node that needs data transformation to the related RP which leads to minimizing average energy consumption in the network. We address the problem by formulating the challenges and expectations as a Mixed Integer Linear Programming (MILP). Henceforth, by proving the NP-hardness of the problem, we propose three effective and distributed heuristics for RP-planning, identifying sojourn locations, and constructing routing trees. Finally, experimental results prove the effectiveness of our approach. PMID:29734718

  19. Path Dependence

    DEFF Research Database (Denmark)

    Madsen, Mogens Ove

    Begrebet Path Dependence blev oprindelig udviklet inden for New Institutionel Economics af bl.a. David, Arthur og North. Begrebet har spredt sig vidt i samfundsvidenskaberne og undergået en udvikling. Dette paper propagerer for at der er sket så en så omfattende udvikling af begrebet, at man nu kan...... tale om 1. og 2. generation af Path Dependence begrebet. Den nyeste udvikling af begrebet har relevans for metodologi-diskusionerne i relation til Keynes...

  20. The Promise of Kickstarter: Extents to Which Social Networks Enable Alternate Avenues of Economic Viability for Independent Musicians Through Crowdfunding

    Directory of Open Access Journals (Sweden)

    Cynthia Wang

    2016-08-01

    Full Text Available Since its inception in 2009, Kickstarter, a crowdsourced funding site, has been a platform for independent creative projects to get funding, ostensibly providing alternate routes of economic viability outside of a traditional framework of creative production and distribution. Kickstarter comes onto the scene after the proliferation of online social networking sites, through which bridging social capital ties are more easily maintained. This article investigates the ways in which independent musicians have used Kickstarter in conjunction with pre-existing social networks to fund their album and sustain themselves and their artistic endeavors economically while also exploring how social networks provide ways for these “Kickstarter campaigns” to reach potential backers (funders. Through three online surveys targeting musicians, their backers, and general Kickstarter backers, yielding a total of 61 respondents, this article finds that pre-existing personal social networks and relations are imperative to the successful funding of Kickstarter campaigns.

  1. A Space Operations Network Alternative: Using Globally Connected Research and Education Networks for Space-Based Science Operations

    Science.gov (United States)

    Bradford, Robert N.

    2006-01-01

    Earth based networking in support of various space agency projects has been based on leased service/circuits which has a high associated cost. This cost is almost always taken from the science side resulting in less science. This is a proposal to use Research and Education Networks (RENs) worldwide to support space flight operations in general and space-based science operations in particular. The RENs were developed to support scientific and educational endeavors. They do not provide support for general Internet traffic. The connectivity and performance of the research and education networks is superb. The connectivity at Layer 3 (IP) virtually encompasses the globe. Most third world countries and all developed countries have their own research and education networks, which are connected globally. Performance of the RENs especially in the developed countries is exceptional. Bandwidth capacity currently exists and future expansion promises that this capacity will continue. REN performance statistics has always exceeded minimum requirements for spaceflight support. Research and Education networks are more loosely managed than a corporate network but are highly managed when compared to the commodity Internet. Management of RENs on an international level is accomplished by the International Network Operations Center at Indiana University at Indianapolis. With few exceptions, each regional and national REN has its own network ops center. The acceptable use policies (AUP), although differing by country, allows any scientific program or project the use of their networks. Once in compliance with the first RENs AUP, all others will accept that specific traffic including regional and transoceanic networks. RENs can support spaceflight related scientific programs and projects. Getting the science to the researcher is obviously key to any scientific project. RENs provide a pathway to virtually any college or university in the world, as well as many governmental institutes and

  2. Path synthesis of four-bar mechanisms using synergy of polynomial neural network and Stackelberg game theory

    Science.gov (United States)

    Ahmadi, Bahman; Nariman-zadeh, Nader; Jamali, Ali

    2017-06-01

    In this article, a novel approach based on game theory is presented for multi-objective optimal synthesis of four-bar mechanisms. The multi-objective optimization problem is modelled as a Stackelberg game. The more important objective function, tracking error, is considered as the leader, and the other objective function, deviation of the transmission angle from 90° (TA), is considered as the follower. In a new approach, a group method of data handling (GMDH)-type neural network is also utilized to construct an approximate model for the rational reaction set (RRS) of the follower. Using the proposed game-theoretic approach, the multi-objective optimal synthesis of a four-bar mechanism is then cast into a single-objective optimal synthesis using the leader variables and the obtained RRS of the follower. The superiority of using the synergy game-theoretic method of Stackelberg with a GMDH-type neural network is demonstrated for two case studies on the synthesis of four-bar mechanisms.

  3. Alternative Dispute Resolution ( ADR / ODR and Mitigation of Litigation in the Context of the New Code of Civil Procedure: A Shorter Path to Fair Legal System?

    Directory of Open Access Journals (Sweden)

    Leandro André Francisco Lima

    2016-06-01

    Full Text Available This study addresses the use of Alternative Dispute Resolution (ADR’s methods, owing to the new Civil Law Procedure Code, having as it’s theoretical framework the concept of access to justice as a Right to a fair Law system. It’s asked about the possibilities of using the alternative Online Dispute Resolution (ODR's tools by jurisdiction, provided by the information technology, in order to maximize the effects relating to that Right. The pertinence of this question is glimpsed in view of the broad society accession to the virtual life. It is used the hypothetical-deductive method. The research is theoretical, bibliographical and documentary.

  4. A sum-over-paths algorithm for third-order impulse-response moment extraction within RC IC-interconnect networks

    Science.gov (United States)

    Wojcik, E. A.; Ni, D.; Lam, T. M.; Le Coz, Y. L.

    2015-07-01

    We have created the first stochastic SoP (Sum-over-Paths) algorithm to extract third-order impulse-response (IR) moment within RC IC interconnects. It employs a newly discovered Feynman SoP Postulate. Importantly, our algorithm maintains computational efficiency and full parallelism. Our approach begins with generation of s-domain nodal-voltage equations. We then perform a Taylor-series expansion of the circuit transfer function. These expansions yield transition diagrams involving mathematical coupling constants, or weight factors, in integral powers of complex frequency s. Our SoP Postulate enables stochastic evaluation of path sums within the circuit transition diagram to order s3-corresponding to the order of IR moment (m3) we seek here. We furnish, for the first time, an informal algebraic proof independently validating our SoP Postulate and algorithm. We list, as well, detailed procedural steps, suitable for coding, that define an efficient stochastic algorithm for m3 IR extraction. Origins of the algorithm's statistical "capacitor-number cubed" correction and "double-counting" weight factors are explained, for completeness. Our algorithm was coded and successfully tested against exact analytical solutions for 3-, 5-, and 10-stage RC lines. We achieved better than 0.65% 1-σ error convergence, after only 10K statistical samples, in less than 1 s of 2-GHz Pentium® execution time. These results continue to suggest that stochastic SoP algorithms may find useful application in circuit analysis of massively coupled networks, such as those encountered in high-end digital IC-interconnect CAD.

  5. Cloud Droplet Size and Liquid Water Path Retrievals From Zenith Radiance Measurements: Examples From the Atmospheric Radiation Measurement Program and the Aerosol Robotic Network

    Science.gov (United States)

    Chiu, J. C.; Marshak, A.; Huang, C.-H.; Varnai, T.; Hogan, R. J.; Giles, D. M.; Holben, B. N.; Knyazikhin, Y.; O'Connor, E. J.; Wiscombe, W. J.

    2012-01-01

    The ground-based Atmospheric Radiation Measurement Program (ARM) and NASA Aerosol Robotic Network (AERONET) routinely monitor clouds using zenith radiances at visible and near-infrared wavelengths. Using the transmittance calculated from such measurements, we have developed a new retrieval method for cloud effective droplet size and conducted extensive tests for non-precipitating liquid water clouds. The underlying principle is to combine a water-absorbing wavelength (i.e. 1640 nm) with a nonwater-absorbing wavelength for acquiring information on cloud droplet size and optical depth. For simulated stratocumulus clouds with liquid water path less than 300 g/sq m and horizontal resolution of 201m, the retrieval method underestimates the mean effective radius by 0.8 m, with a root-mean-squared error of 1.7 m and a relative deviation of 13 %. For actual observations with a liquid water path less than 450 gm.2 at the ARM Oklahoma site during 2007-2008, our 1.5 min-averaged retrievals are generally larger by around 1 m than those from combined ground-based cloud radar and microwave radiometer at a 5min temporal resolution. We also compared our retrievals to those from combined shortwave flux and microwave observations for relatively homogeneous clouds, showing that the bias between these two retrieval sets is negligible, but the error of 2.6 m and the relative deviation of 22% are larger than those found in our simulation case. Finally, the transmittance-based cloud effective droplet radii agree to better than 11% with satellite observations and have a negative bias of 1 m. Overall, the retrieval method provides reasonable cloud effective radius estimates, which can enhance the cloud products of both ARM and AERONET.

  6. Path Creation

    DEFF Research Database (Denmark)

    Karnøe, Peter; Garud, Raghu

    2012-01-01

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

  7. Economic critique of Nam Theun-Hinboun Hydropower Project and electricity development in Laos: proposal for an alternative path to development

    International Nuclear Information System (INIS)

    Adams, T.

    1996-01-01

    A proposed alternative to the development of a large-scale hydropower project in Laos was presented. The alternative is intended to help make electricity development sustainable over the long term and to benefit the citizens of Laos. The author carefully analyzed the Asian Development Bank report RRP: Laos 27325 of October 1994. He concluded that as presently constituted, the project is likely to fail as an investment and is likely to result in a significant net financial liability. Water resources are one of Laos' greatest assets and the future uses of Laotian rivers could be lost in order to achieve near-term electricity development. It was suggested that Laos should follow three key principles in the development of its electricity sector: maximize economic efficiency, ensure that the government acts as a regulator and not as an investor, and ensure the protection of property rights of citizens and investors. Relevant aspects of the experience with electricity development in Canada were also outlined

  8. Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming

    Energy Technology Data Exchange (ETDEWEB)

    Song, Hyun-Seob; Goldberg, Noam; Mahajan, Ashutosh; Ramkrishna, Doraiswami

    2017-03-27

    Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Results: Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs.

  9. Alternative approach to automated management of load flow in engineering networks considering functional reliability

    Directory of Open Access Journals (Sweden)

    Ирина Александровна Гавриленко

    2016-02-01

    Full Text Available The approach to automated management of load flow in engineering networks considering functional reliability was proposed in the article. The improvement of the concept of operational and strategic management of load flow in engineering networks was considered. The verbal statement of the problem for thesis research is defined, namely, the problem of development of information technology for exact calculation of the functional reliability of the network, or the risk of short delivery of purpose-oriented product for consumers

  10. Artificial neural networks, a new alternative to Monte Carlo calculations for radiotherapy

    International Nuclear Information System (INIS)

    Martin, E.; Gschwind, R.; Henriet, J.; Sauget, M.; Makovicka, L.

    2010-01-01

    In order to reduce the computing time needed by Monte Carlo codes in the field of irradiation physics, notably in dosimetry, the authors report the use of artificial neural networks in combination with preliminary Monte Carlo calculations. During the learning phase, Monte Carlo calculations are performed in homogeneous media to allow the building up of the neural network. Then, dosimetric calculations (in heterogeneous media, unknown by the network) can be performed by the so-learned network. Results with an equivalent precision can be obtained within less than one minute on a simple PC whereas several days are needed with a Monte Carlo calculation

  11. Histone and RNA-binding protein interaction creates crosstalk network for regulation of alternative splicing.

    Science.gov (United States)

    Kim, Yong-Eun; Park, Chungoo; Kim, Kyoon Eon; Kim, Kee K

    2018-04-30

    Alternative splicing is an essential process in eukaryotes, as it increases the complexity of gene expression by generating multiple proteins from a single pre-mRNA. However, information on the regulatory mechanisms for alternative splicing is lacking, because splicing occurs over a short period via the transient interactions of proteins within functional complexes of the spliceosome. Here, we investigated in detail the molecular mechanisms connecting alternative splicing with epigenetic mechanisms. We identified interactions between histone proteins and splicing factors such as Rbfox2, Rbfox3, and splicing factor proline and glutamine rich protein (SFPQ) by in vivo crosslinking and immunoprecipitation. Furthermore, we confirmed that splicing factors were bound to specific modified residues of histone proteins. Additionally, changes in histone methylation due to histone methyltransferase inhibitor treatment notably affected alternative splicing in selected genes. Therefore, we suggested that there may be crosstalk mechanisms connecting histone modifications and RNA-binding proteins that increase the local concentration of RNA-binding proteins in alternative exon loci of nucleosomes by binding specific modified histone proteins, leading to alternative splicing. This crosstalk mechanism may play a major role in epigenetic processes such as histone modification and the regulation of alternative splicing. Copyright © 2018 Elsevier Inc. All rights reserved.

  12. Alternate transmission with half-duplex relaying in MIMO interference relay networks

    KAUST Repository

    Park, Seongho; Ko, Youngchai; Park, Kihong; Alouini, Mohamed-Slim

    2013-01-01

    In this paper, we consider an alternate transmission scheme for a multiple-input multiple-output interference relay channel where multiple sources transmit their own signals to their corresponding destinations via one of two relaying groups

  13. Small media, big network: alternative media and social movements on the internet

    OpenAIRE

    O'Donnell, Susan

    2000-01-01

    This thesis explores alternative media on the Internet by drawing on a range of theoretical literatures - particularly in the areas of the public sphere, social movements and globalisation. Parallel to this theoretical exploration, a significant body of published research is reviewed on Internet use by social movements and groups in global, national, and local contexts. From this review and analysis, an original conceptual framework for analysing alternative media on the Internet is developed...

  14. Assessing the Liquidity of Firms: Robust Neural Network Regression as an Alternative to the Current Ratio

    Science.gov (United States)

    de Andrés, Javier; Landajo, Manuel; Lorca, Pedro; Labra, Jose; Ordóñez, Patricia

    Artificial neural networks have proven to be useful tools for solving financial analysis problems such as financial distress prediction and audit risk assessment. In this paper we focus on the performance of robust (least absolute deviation-based) neural networks on measuring liquidity of firms. The problem of learning the bivariate relationship between the components (namely, current liabilities and current assets) of the so-called current ratio is analyzed, and the predictive performance of several modelling paradigms (namely, linear and log-linear regressions, classical ratios and neural networks) is compared. An empirical analysis is conducted on a representative data base from the Spanish economy. Results indicate that classical ratio models are largely inadequate as a realistic description of the studied relationship, especially when used for predictive purposes. In a number of cases, especially when the analyzed firms are microenterprises, the linear specification is improved by considering the flexible non-linear structures provided by neural networks.

  15. Alternative transport network designs and their implications for intermodal transhipment technologies

    OpenAIRE

    Woxenius, Johan

    2007-01-01

    Six principles for operation of the rail part of intermodal rail freight transport systems are described: direct link, corridor, hub-and-spoke, connected hubs, static routes, and dynamic routes. The first part is a theoretical discussion of the characteristics of the transport network designs. The theory is then applied to intermodal freight transport by analysing how each transport network design affects the need for terminal performance. The discussion includes a classification of existing ...

  16. Motif Penggunaan dan Kepuasan Menggunakan Path (Studi Korelasional Tentang Pengaruh Motif Penggunaan dan Kepuasan Menggunakan Jejaring sosial Path di Kalangan Masyarakat Pasar VI Kelurahan Padang Bulan Medan)

    OpenAIRE

    Dipta, Anna Mira

    2015-01-01

    This study entitled Effect of using and gratification of using social networking Path among the people in Padang Bulan Medan (CorrelationalEffect of using and gratification of using social networking Path among the people in Padang Bulan Medan). Path is a social network similar to its predecessor facebook. Path exclusive can only be used with smartphones based on IOS and android operating system. Path is a private social networking service application designed to bring users closer to family....

  17. Three-dimensional tetranuclear Cd(II) coordination network based on a 1,3-alternate calix[4]arene derivative

    International Nuclear Information System (INIS)

    Lee, Eun Ji; Ju, Hui Yeong; Park, Ki Min; Moon, ASuk Hee; Kang, Young Jin

    2015-01-01

    Polynuclear coordination polymers can exhibit more intriguing network topologies and better functionalities than those of common complexes because they have metal-cluster nodes for the construction of multidimensional frameworks and the potential applications induced by collaborative activities between metal ions. New tetranuclear Cd(II) coordination polymer 1 based on 1,3-alternate calix arene derivative (H_4 CTA) with four carboxyl pendant arms has been synthesized by the solvo thermal reaction at 110 .deg. C for 2 days. Compound 1 shows a 3-D framework consisting of tetranuclear Cd(II) cluster core as a metal-cluster node and 1,3-alternate H_4CTA as a multidentate linker. The coordination polymer 1 displays intense blue emission, implying that this tetranuclear Cd(II) coordination polymer could be a suitable material in the area of luminescence research

  18. Three-dimensional tetranuclear Cd(II) coordination network based on a 1,3-alternate calix[4]arene derivative

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Eun Ji; Ju, Hui Yeong; Park, Ki Min [Dept. of Chemistry and Research Institute of Natural Science, Gyeongsang National University, Jinju (Korea, Republic of); Moon, ASuk Hee [Dept. of Food and Nutrition, Kyungnam College of Inform ation and Technology, Busan (Korea, Republic of); Kang, Young Jin [Div. of cience Education, Kangwon National University, Chuncheon (Korea, Republic of)

    2015-08-15

    Polynuclear coordination polymers can exhibit more intriguing network topologies and better functionalities than those of common complexes because they have metal-cluster nodes for the construction of multidimensional frameworks and the potential applications induced by collaborative activities between metal ions. New tetranuclear Cd(II) coordination polymer 1 based on 1,3-alternate calix arene derivative (H{sub 4} CTA) with four carboxyl pendant arms has been synthesized by the solvo thermal reaction at 110 .deg. C for 2 days. Compound 1 shows a 3-D framework consisting of tetranuclear Cd(II) cluster core as a metal-cluster node and 1,3-alternate H{sub 4}CTA as a multidentate linker. The coordination polymer 1 displays intense blue emission, implying that this tetranuclear Cd(II) coordination polymer could be a suitable material in the area of luminescence research.

  19. Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming.

    Science.gov (United States)

    Song, Hyun-Seob; Goldberg, Noam; Mahajan, Ashutosh; Ramkrishna, Doraiswami

    2017-08-01

    Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs. The software is implemented in Matlab, and is provided as supplementary information . hyunseob.song@pnnl.gov. Supplementary data are available at Bioinformatics online. Published by Oxford University Press 2017. This work is written by US Government employees and are in the public domain in the US.

  20. Boosted decision trees as an alternative to artificial neural networks for particle identification

    International Nuclear Information System (INIS)

    Roe, Byron P.; Yang Haijun; Zhu Ji; Liu Yong; Stancu, Ion; McGregor, Gordon

    2005-01-01

    The efficacy of particle identification is compared using artificial neutral networks and boosted decision trees. The comparison is performed in the context of the MiniBooNE, an experiment at Fermilab searching for neutrino oscillations. Based on studies of Monte Carlo samples of simulated data, particle identification with boosting algorithms has better performance than that with artificial neural networks for the MiniBooNE experiment. Although the tests in this paper were for one experiment, it is expected that boosting algorithms will find wide application in physics

  1. EU FP7 project 'CAMbrella' to build European research network for complementary and alternative medicine

    DEFF Research Database (Denmark)

    Weidenhammer, Wolfgang; Lewith, George; Falkenberg, Torkel

    2011-01-01

    BACKGROUND: The status of complementary and alternative medicine (CAM) within the EU needs clarification. The definition and terminology of CAM is heterogeneous. The therapies, legal status, regulations and approaches used vary from country to country but there is widespread use by EU citizens. A...... review open access publications and a final conference, with emphasis on current and future EU policies, addressing different target audiences....

  2. Alternative Entrepreneurship in Thailand: Weavers and the Northeastern Handicraft and Women's Development Network.

    Science.gov (United States)

    Jongeward, Carolyn

    2001-01-01

    The crafts sector is a significant arena of rural nonfarm employment in Thailand. A handicrafts network focused on women's development helps rural women weavers not only with enterprise development and marketing but also environmental and health issues for appropriate and sustainable development. (SK)

  3. Evaluation of ETCS performance with LTE as alternative railway communication network using OPNET

    DEFF Research Database (Denmark)

    Sniady, Aleksander; Soler, José

    2013-01-01

    GSM-Railways (GSM-R) is a communication mobile network designed to fulfill specific communication needs of railways. GSM-R is being widely deployed across Europe and other countries around the world for providing railway voice and train control services (ETCS). Despite that, GSM-R already shows...

  4. Alternate MIMO AF relaying networks with interference alignment: Spectral efficient protocol and linear filter design

    KAUST Repository

    Park, Kihong; Alouini, Mohamed-Slim

    2013-01-01

    In this paper, we study a two-hop relaying network consisting of one source, one destination, and three amplify-and-forward (AF) relays with multiple antennas. To compensate for the capacity prelog factor loss of 1/2$ due to the half-duplex relaying

  5. Beyond the network effect: towards an alternative understanding of global urban organizations

    NARCIS (Netherlands)

    James, P.; Verrest, H.; Gupta, J.; Pfeffer, K.; Verrest, H.; Ros-Tonen, M.

    2015-01-01

    Global organizations providing network relations for cities are bourgeoning. Organizations such as Metropolis, UN-Habitat, ICLEI - Local Governments for Sustainability, the Global Compact Cities Programme, and the C40, as well as City-to-City arrangements, have become increasingly important to

  6. Dual-mode operation of neuronal networks involved in left-right alternation

    DEFF Research Database (Denmark)

    Talpalar, Adolfo E.; Bouvier, Julien; Borgius, Lotta

    2013-01-01

    All forms of locomotion are repetitive motor activities that require coordinated bilateral activation of muscles. The executive elements of locomotor control are networks of spinal neurons that determine gait pattern through the sequential activation of motor-neuron pools on either side of the bo...

  7. Forming of the regional core transport network taking into account the allocation of alternative energy sources based on artificial intelligence methods

    OpenAIRE

    Marina ZHURAVSKAYA; Vladimir TARASYAN

    2014-01-01

    In the modern world the alternative energy sources, which considerably depend on a region, play more and more significant role. However, the transition of regions to new energy sources lead to the change of transport and logistic network configuration. The formation of optimal core transport network today is a guarantee of the successful economic development of a region tomorrow. The present article studies the issue of advanced core transport network development in a region based on the ...

  8. Reformulated Neural Network (ReNN): a New Alternative for Data-driven Modelling in Hydrology and Water Resources Engineering

    Science.gov (United States)

    Razavi, S.; Tolson, B.; Burn, D.; Seglenieks, F.

    2012-04-01

    Reformulated Neural Network (ReNN) has been recently developed as an efficient and more effective alternative to feedforward multi-layer perceptron (MLP) neural networks [Razavi, S., and Tolson, B. A. (2011). "A new formulation for feedforward neural networks." IEEE Transactions on Neural Networks, 22(10), 1588-1598, DOI: 1510.1109/TNN.2011.2163169]. This presentation initially aims to introduce the ReNN to the water resources community and then demonstrates ReNN applications to water resources related problems. ReNN is essentially equivalent to a single-hidden-layer MLP neural network but defined on a new set of network variables which is more effective than the traditional set of network weights and biases. The main features of the new network variables are that they are geometrically interpretable and each variable has a distinct role in forming the network response. ReNN is more efficiently trained as it has a less complex error response surface. In addition to the ReNN training efficiency, the interpretability of the ReNN variables enables the users to monitor and understand the internal behaviour of the network while training. Regularization in the ReNN response can be also directly measured and controlled. This feature improves the generalization ability of the network. The appeal of the ReNN is demonstrated with two ReNN applications to water resources engineering problems. In the first application, the ReNN is used to model the rainfall-runoff relationships in multiple watersheds in the Great Lakes basin located in northeastern North America. Modelling inflows to the Great Lakes are of great importance to the management of the Great Lakes system. Due to the lack of some detailed physical data about existing control structures in many subwatersheds of this huge basin, the data-driven approach to modelling such as the ReNN are required to replace predictions from a physically-based rainfall runoff model. Unlike traditional MLPs, the ReNN does not necessarily

  9. Alternate transmission with half-duplex relaying in MIMO interference relay networks

    KAUST Repository

    Park, Seongho

    2013-12-01

    In this paper, we consider an alternate transmission scheme for a multiple-input multiple-output interference relay channel where multiple sources transmit their own signals to their corresponding destinations via one of two relaying groups alternately every time phase. Each of the relaying groups has arbitrary number of relays, and each relay operates in half-duplex amplify-and-forward mode. In our scheme, the received signals at the relay nodes consist of desired signals and two different interference signals such as the inter-source interferences and the inter-group interferences which are caused by the phase incoherence of relaying. As such, we propose an iterative interference alignment algorithm to mitigate the interferences. We show that our proposed scheme achieves additional degrees of freedom compared to the conventional half-duplex relaying system in the interference relay channels. © 2013 IEEE.

  10. Social network predicts loss of fertilizations in nesting males of a fish with alternative reproductive tactics

    OpenAIRE

    Cardoso, Sara D.; Faustino, Ana Isabel Soares; Costa, Silvia S.; Valério, Fábio; Gonçalves, David; Oliveira, Rui Filipe

    2016-01-01

    Material suplementar está disponível online em doi: 10.1007/s10211-016-0249-9, disponibilizado a todos os utilizadores autorizados. Alternative reproductive tactics (ARTs) evolve when there is strong intra-sexual competition between conspecifics for access to mates. Typically, larger Bbourgeois^ males reproduce by securing the access to reproductive resources while smaller Bparasitic^ males reproduce by stealing fertilizations from larger males. A number of factors can influ...

  11. Interception and modification of network authentication packets with the purpose of allowing alternative authentication modes

    Science.gov (United States)

    Kent, Alexander Dale [Los Alamos, NM

    2008-09-02

    Methods and systems in a data/computer network for authenticating identifying data transmitted from a client to a server through use of a gateway interface system which are communicately coupled to each other are disclosed. An authentication packet transmitted from a client to a server of the data network is intercepted by the interface, wherein the authentication packet is encrypted with a one-time password for transmission from the client to the server. The one-time password associated with the authentication packet can be verified utilizing a one-time password token system. The authentication packet can then be modified for acceptance by the server, wherein the response packet generated by the server is thereafter intercepted, verified and modified for transmission back to the client in a similar but reverse process.

  12. The Dark Side of Alternative Asset Markets: Networks, Performance and Risk Taking

    OpenAIRE

    Baden-Fuller, C.; Ferriani, S.; Mengoli, S.; Torlo, V. J.

    2011-01-01

    When actors invest in making strong network ties (relationships) with other actors, such ties can potentially influence behavior and subsequent financial performance, but the strength and direction of these effects is debated. Using original fine-grained data that documents the nature and extent of the relationships between Hedge Funds through their Prime Brokers (banks that provide leverage, issue credit lines and serve as bridges between Hedge Funds) we probe the social topology of Hedge Fu...

  13. Alternating optimization method based on nonnegative matrix factorizations for deep neural networks

    OpenAIRE

    Sakurai, Tetsuya; Imakura, Akira; Inoue, Yuto; Futamura, Yasunori

    2016-01-01

    The backpropagation algorithm for calculating gradients has been widely used in computation of weights for deep neural networks (DNNs). This method requires derivatives of objective functions and has some difficulties finding appropriate parameters such as learning rate. In this paper, we propose a novel approach for computing weight matrices of fully-connected DNNs by using two types of semi-nonnegative matrix factorizations (semi-NMFs). In this method, optimization processes are performed b...

  14. Calculating the Prior Probability Distribution for a Causal Network Using Maximum Entropy: Alternative Approaches

    Directory of Open Access Journals (Sweden)

    Michael J. Markham

    2011-07-01

    Full Text Available Some problems occurring in Expert Systems can be resolved by employing a causal (Bayesian network and methodologies exist for this purpose. These require data in a specific form and make assumptions about the independence relationships involved. Methodologies using Maximum Entropy (ME are free from these conditions and have the potential to be used in a wider context including systems consisting of given sets of linear and independence constraints, subject to consistency and convergence. ME can also be used to validate results from the causal network methodologies. Three ME methods for determining the prior probability distribution of causal network systems are considered. The first method is Sequential Maximum Entropy in which the computation of a progression of local distributions leads to the over-all distribution. This is followed by development of the Method of Tribus. The development takes the form of an algorithm that includes the handling of explicit independence constraints. These fall into two groups those relating parents of vertices, and those deduced from triangulation of the remaining graph. The third method involves a variation in the part of that algorithm which handles independence constraints. Evidence is presented that this adaptation only requires the linear constraints and the parental independence constraints to emulate the second method in a substantial class of examples.

  15. Network Partnership Diplomatic Mechanism: The New Path in Sino-Russian Cooperation - On the Sino-Russian Joint Dominance of BRICS Governance Mechanism

    Directory of Open Access Journals (Sweden)

    Zhijie Cheng

    2014-01-01

    mechanisms, and providing a new path for Sino-Russian cooperation. The BRICS countries should establish a BRICS governance mechanism which has to be promoted by a leading force. The network partnership diplomatic mechanism could play a leading role in shaping this type of governance mechanism with Sino-Russian cooperation at its core.

  16. Study of Alternative GPS Network Meteorological Sensors in Taiwan: Case Studies of the Plum Rains and Typhoon Sinlaku

    Directory of Open Access Journals (Sweden)

    Kwo-Hwa Chen

    2009-06-01

    Full Text Available Plum rains and typhoons are important weather systems in the Taiwan region. They can cause huge economic losses, but they are also considered as important water resources as they strike Taiwan annually and fill the reservoirs around the island. There are many meteorological sensors available for investigating the characteristics of weather and climate systems. Recently, the use of GPS as an alternative meteorological sensor has become popular due to the catastrophic impact of global climate change. GPS provides meteorological parameters mainly from the atmosphere. Precise Point Positioning (PPP is a proven algorithm that has attracted attention in GPS related studies. This study uses GPS measurements collected at more than fifty reference stations of the e-GPS network in Taiwan. The first data set was collected from June 1st 2008 to June 7th 2008, which corresponds to the middle of the plum rain season in Taiwan. The second data set was collected from September 11th to September 17th 2008 during the landfall of typhoon Sinlaku. The data processing strategy is to process the measurements collected at the reference stations of the e-GPS network using the PPP technique to estimate the zenith tropospheric delay (ZTD values of the sites; thus, the correlations between the ZTD values and the variation of rainfall during the plum rains and typhoon are analyzed. In addition, several characteristics of the meteorological events are identified using spatial and temporal analyses of the ZTD values estimated with the GPS network PPP technique.

  17. EU FP7 project 'CAMbrella' to build European research network for complementary and alternative medicine

    DEFF Research Database (Denmark)

    Weidenhammer, Wolfgang; Lewith, George; Falkenberg, Torkel

    2011-01-01

    BACKGROUND: The status of complementary and alternative medicine (CAM) within the EU needs clarification. The definition and terminology of CAM is heterogeneous. The therapies, legal status, regulations and approaches used vary from country to country but there is widespread use by EU citizens...... governing CAM provision, and to explore the needs and attitudes of EU citizens with respect to CAM. Based on this information a roadmap will be created that will enable sustainable and prioritised future European research in CAM. CAMbrella encompasses 16 academic research groups from 12 European countries...... review open access publications and a final conference, with emphasis on current and future EU policies, addressing different target audiences....

  18. Customer Satisfaction in Networked Narratives – Exploring the applicability of ECT in Alternate Reality Games

    OpenAIRE

    Regelin, Tilman; Staar, Henning; Janneck, Monique

    2018-01-01

    Alternate Reality Games (ARG) have been one of the first and most prominent viral marketing tools. In a dynamic marketing world, where new practices appear every other day and seemingly ‘old’ practices lose their appeal very quickly, Blizzard Entertainment – a leading video game developer – gained much attention regarding its marketing strategy promoting the release of a new playable hero called ‘Sombra’ for their online game Overwatch, which is the third most-played game in the world with ov...

  19. Pore Network Modeling: Alternative Methods to Account for Trapping and Spatial Correlation

    KAUST Repository

    De La Garza Martinez, Pablo

    2016-05-01

    Pore network models have served as a predictive tool for soil and rock properties with a broad range of applications, particularly in oil recovery, geothermal energy from underground reservoirs, and pollutant transport in soils and aquifers [39]. They rely on the representation of the void space within porous materials as a network of interconnected pores with idealised geometries. Typically, a two-phase flow simulation of a drainage (or imbibition) process is employed, and by averaging the physical properties at the pore scale, macroscopic parameters such as capillary pressure and relative permeability can be estimated. One of the most demanding tasks in these models is to include the possibility of fluids to remain trapped inside the pore space. In this work I proposed a trapping rule which uses the information of neighboring pores instead of a search algorithm. This approximation reduces the simulation time significantly and does not perturb the accuracy of results. Additionally, I included spatial correlation to generate the pore sizes using a matrix decomposition method. Results show higher relative permeabilities and smaller values for irreducible saturation, which emphasizes the effects of ignoring the intrinsic correlation seen in pore sizes from actual porous media. Finally, I implemented the algorithm from Raoof et al. (2010) [38] to generate the topology of a Fontainebleau sandstone by solving an optimization problem using the steepest descent algorithm with a stochastic approximation for the gradient. A drainage simulation is performed on this representative network and relative permeability is compared with published results. The limitations of this algorithm are discussed and other methods are suggested to create a more faithful representation of the pore space.

  20. Pore Network Modeling: Alternative Methods to Account for Trapping and Spatial Correlation

    KAUST Repository

    De La Garza Martinez, Pablo

    2016-01-01

    Pore network models have served as a predictive tool for soil and rock properties with a broad range of applications, particularly in oil recovery, geothermal energy from underground reservoirs, and pollutant transport in soils and aquifers [39]. They rely on the representation of the void space within porous materials as a network of interconnected pores with idealised geometries. Typically, a two-phase flow simulation of a drainage (or imbibition) process is employed, and by averaging the physical properties at the pore scale, macroscopic parameters such as capillary pressure and relative permeability can be estimated. One of the most demanding tasks in these models is to include the possibility of fluids to remain trapped inside the pore space. In this work I proposed a trapping rule which uses the information of neighboring pores instead of a search algorithm. This approximation reduces the simulation time significantly and does not perturb the accuracy of results. Additionally, I included spatial correlation to generate the pore sizes using a matrix decomposition method. Results show higher relative permeabilities and smaller values for irreducible saturation, which emphasizes the effects of ignoring the intrinsic correlation seen in pore sizes from actual porous media. Finally, I implemented the algorithm from Raoof et al. (2010) [38] to generate the topology of a Fontainebleau sandstone by solving an optimization problem using the steepest descent algorithm with a stochastic approximation for the gradient. A drainage simulation is performed on this representative network and relative permeability is compared with published results. The limitations of this algorithm are discussed and other methods are suggested to create a more faithful representation of the pore space.

  1. Agroecology in Europe: Research, Education, Collective Action Networks, and Alternative Food Systems

    Directory of Open Access Journals (Sweden)

    Alexander Wezel

    2018-04-01

    Full Text Available Agroecology is considered with different focus and weight in different parts of the world as a social and political movement, as science, and as practice. Despite its multitude of definitions, agroecology has begun in Europe to develop in different regional, national and continental networks of researchers, practitioners, advocates and movements. However, there is a lack of a comprehensive overview about these different developments and networks. Therefore, this paper attempts to document and provide a mapping of the development of European agroecology in its diverse forms. Through a literature review, interviews, active conference participation, and an extensive internet search we have collected information about the current state and development of agroecology in Europe. Agroecological research and higher education exist more in western and northern Europe, but farm schools and farmer-to-farmer training are also present in other regions. Today a large variety of topics are studied at research institutions. There is an increasing number of bottom-up agroecological initiatives and national or continental networks and movements. Important movements are around food sovereignty, access to land and seeds. Except for France, there are very few concrete policies for agroecology in Europe. Agroecology is increasingly linked to different fields of agri-food systems. This includes Community Supported Agriculture systems, but also agroecological territories, and some examples of labelling products. To amplify agroecology in Europe in the coming years, policy development will be crucial and proponents of agroecology must join forces and work hand-in-hand with the many stakeholders engaged in initiatives to develop more sustainable agriculture and food systems.

  2. SR 97. Alternative models project. Channel network modelling of Aberg. Performance assessment using CHAN3D

    International Nuclear Information System (INIS)

    Gylling, B.; Moreno, L.; Neretnieks, I.

    1999-06-01

    In earlier papers, discussions of the mechanisms which are important in performance assessment in fractured media are given. The influence of the mechanisms have been demonstrated using CHAN3D. In this study CHAN3D has been used to simulate production of input data to COMP23 and FARF31. CHAN3D has been integrated with COMP23 in earlier studies, but it has not been used before to calculate input data to FARF31. In the normal use of CHAN3D, the transport part of the concept simulates far field migration. The task in this study was to produce input data according to a specification and using a defined hypothetical repository located at Aespoe HRL as a platform. During the process of applying CHAN3D to the site, the scaling of conductivity was studied, using both data from Aespoe HRL and synthetic data. From the realisations performed, ensemble statistics of water travel time, flux at repository scale, flow-wetted surface and F-ratio values were calculated. Two typical realisations were studied in more detail. The results for three specified canister positions were also highlighted. Exit locations for the released particles were studied. In each realisation statistics were calculated over the entities. The values were post-processed to obtain performance measures of higher order. From the averaging over all the realisations it can be concluded that the Monte Carlo stability is reached for the ensemble statistics. The presence of fracture zones has a large influence on flow and transport in the rock. However, for a single canister the result may be very different between realisations. In some realisations there may be a fast path to a fracture zone whereas in other realisations the opposite may be valid. From the calculation of the flow over the boundaries between the regional model and the smaller local model the consistency seem to be acceptable considering that a perfect match of properties is hard to obtain

  3. Shortest Path Problems in a Stochastic and Dynamic Environment

    National Research Council Canada - National Science Library

    Cho, Jae

    2003-01-01

    .... Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network...

  4. Evaluation of Calcine Disposition Path Forward

    International Nuclear Information System (INIS)

    Birrer, S.A.; Heiser, M.B.

    2003-01-01

    This document describes an evaluation of the baseline and two alternative disposition paths for the final disposition of the calcine wastes stored at the Idaho Nuclear Technology and Engineering Center at the Idaho National Engineering and Environmental Laboratory. The pathways are evaluated against a prescribed set of criteria and a recommendation is made for the path forward

  5. PathShuffle: Credit Mixing and Anonymous Payments for Ripple

    Directory of Open Access Journals (Sweden)

    Moreno-Sanchez Pedro

    2017-07-01

    Full Text Available The I owe you (IOU credit network Ripple is one of the most prominent alternatives in the burgeoning field of decentralized payment systems. Ripple’s path-based transactions set it apart from cryptocurrencies such as Bitcoin. Its pseudonymous nature, while still maintaining some regulatory capabilities, has motivated several financial institutions across the world to use Ripple for processing their daily transactions. Nevertheless, with its public ledger, a credit network such as Ripple is no different from a cryptocurrency in terms of weak privacy; recent demonstrative deanonymization attacks raise important concerns regarding the privacy of the Ripple users and their transactions. However, unlike for cryptocurrencies, there is no known privacy solution compatible with the existing credit networks such as Ripple.

  6. [Transcranial alternating current stimulation. Entrainment and function control of neuronal networks].

    Science.gov (United States)

    Vosskuhl, J; Strüber, D; Herrmann, C S

    2015-12-01

    Transcranial alternating current stimulation (tACS) is a new technique for the modulation of oscillatory brain activity as measured in the electroencephalogram (EEG). In contrast to well-established stimulation techniques, such as transcranial direct current stimulation and transcranial magnetic stimulation, tACS applies a sinusoidal alternating current at a specific frequency. This enables the modulation of the amplitude and frequency of endogenous brain oscillations as well as related cognitive processes. Therefore, the use of tACS has the possibility to evaluate well-known correlations between brain oscillations and cognitive processes in terms of causality. Such causal relationships have been documented in numerous neurocognitive studies on sensory, motor and perceptual processes; however, the clinical application of tACS is still in its infancy. In principle, any pathology that can reliably be connected with brain oscillations of a defined frequency is treatable. A current main focus of clinical research is on symptoms of Parkinson's disease and to a lesser degree, tinnitus. For an effective application of tACS it is important to choose the electrode positions as well as the frequency, intensity and duration of the stimulation in a theory-based and symptom-related manner. A successful therapeutic intervention requires the persistence of the tACS effect after stimulation has ceased. A mechanism that offers not only an explanation to the origin of persistent tACS effects but is also of high therapeutic benefit is neural plasticity. Therefore, one current focus of research aims at a better understanding of tACS after effects.

  7. Path Creation, Path Dependence and Breaking Away from the Path

    OpenAIRE

    Wang, Jens; Hedman, Jonas; Tuunainen, Virpi Kristiina

    2016-01-01

    The explanation of how and why firms succeed or fail is a recurrent research challenge. This is particularly important in the context of technological innovations. We focus on the role of historical events and decisions in explaining such success and failure. Using a case study of Nokia, we develop and extend a multi-layer path dependence framework. We identify four layers of path dependence: technical, strategic and leadership, organizational, and external collaboration. We show how path dep...

  8. Accounting for water management issues within hydrological simulation: Alternative modelling options and a network optimization approach

    Science.gov (United States)

    Efstratiadis, Andreas; Nalbantis, Ioannis; Rozos, Evangelos; Koutsoyiannis, Demetris

    2010-05-01

    In mixed natural and artificialized river basins, many complexities arise due to anthropogenic interventions in the hydrological cycle, including abstractions from surface water bodies, groundwater pumping or recharge and water returns through drainage systems. Typical engineering approaches adopt a multi-stage modelling procedure, with the aim to handle the complexity of process interactions and the lack of measured abstractions. In such context, the entire hydrosystem is separated into natural and artificial sub-systems or components; the natural ones are modelled individually, and their predictions (i.e. hydrological fluxes) are transferred to the artificial components as inputs to a water management scheme. To account for the interactions between the various components, an iterative procedure is essential, whereby the outputs of the artificial sub-systems (i.e. abstractions) become inputs to the natural ones. However, this strategy suffers from multiple shortcomings, since it presupposes that pure natural sub-systems can be located and that sufficient information is available for each sub-system modelled, including suitable, i.e. "unmodified", data for calibrating the hydrological component. In addition, implementing such strategy is ineffective when the entire scheme runs in stochastic simulation mode. To cope with the above drawbacks, we developed a generalized modelling framework, following a network optimization approach. This originates from the graph theory, which has been successfully implemented within some advanced computer packages for water resource systems analysis. The user formulates a unified system which is comprised of the hydrographical network and the typical components of a water management network (aqueducts, pumps, junctions, demand nodes etc.). Input data for the later include hydraulic properties, constraints, targets, priorities and operation costs. The real-world system is described through a conceptual graph, whose dummy properties

  9. Formal language constrained path problems

    Energy Technology Data Exchange (ETDEWEB)

    Barrett, C.; Jacob, R.; Marathe, M.

    1997-07-08

    In many path finding problems arising in practice, certain patterns of edge/vertex labels in the labeled graph being traversed are allowed/preferred, while others are disallowed. Motivated by such applications as intermodal transportation planning, the authors investigate the complexity of finding feasible paths in a labeled network, where the mode choice for each traveler is specified by a formal language. The main contributions of this paper include the following: (1) the authors show that the problem of finding a shortest path between a source and destination for a traveler whose mode choice is specified as a context free language is solvable efficiently in polynomial time, when the mode choice is specified as a regular language they provide algorithms with improved space and time bounds; (2) in contrast, they show that the problem of finding simple paths between a source and a given destination is NP-hard, even when restricted to very simple regular expressions and/or very simple graphs; (3) for the class of treewidth bounded graphs, they show that (i) the problem of finding a regular language constrained simple path between source and a destination is solvable in polynomial time and (ii) the extension to finding context free language constrained simple paths is NP-complete. Several extensions of these results are presented in the context of finding shortest paths with additional constraints. These results significantly extend the results in [MW95]. As a corollary of the results, they obtain a polynomial time algorithm for the BEST k-SIMILAR PATH problem studied in [SJB97]. The previous best algorithm was given by [SJB97] and takes exponential time in the worst case.

  10. World nuclear energy paths

    International Nuclear Information System (INIS)

    Connolly, T.J.; Hansen, U.; Jaek, W.; Beckurts, K.H.

    1979-01-01

    In examing the world nuclear energy paths, the following assumptions were adopted: the world economy will grow somewhat more slowly than in the past, leading to reductions in electricity demand growth rates; national and international political impediments to the deployment of nuclear power will gradually disappear over the next few years; further development of nuclear power will proceed steadily, without serious interruption but with realistic lead times for the introduction of advanced technologies. Given these assumptions, this paper attempts a study of possible world nuclear energy developments, disaggregated on a regional and national basis. The scenario technique was used and a few alternative fuel-cycle scenarios were developed. Each is an internally consistent model of technically and economically feasible paths to the further development of nuclear power in an aggregate of individual countries and regions of the world. The main purpose of this modeling exercise was to gain some insight into the probable international locations of reactors and other nuclear facilities, the future requirements for uranium and for fuel-cycle services, and the problems of spent-fuel storage and waste management. The study also presents an assessment of the role that nuclear power might actually play in meeting future world energy demand

  11. Feynman's path integrals and Bohm's particle paths

    International Nuclear Information System (INIS)

    Tumulka, Roderich

    2005-01-01

    Both Bohmian mechanics, a version of quantum mechanics with trajectories, and Feynman's path integral formalism have something to do with particle paths in space and time. The question thus arises how the two ideas relate to each other. In short, the answer is, path integrals provide a re-formulation of Schroedinger's equation, which is half of the defining equations of Bohmian mechanics. I try to give a clear and concise description of the various aspects of the situation. (letters and comments)

  12. Path coupling and aggregate path coupling

    CERN Document Server

    Kovchegov, Yevgeniy

    2018-01-01

    This book describes and characterizes an extension to the classical path coupling method applied to statistical mechanical models, referred to as aggregate path coupling. In conjunction with large deviations estimates, the aggregate path coupling method is used to prove rapid mixing of Glauber dynamics for a large class of statistical mechanical models, including models that exhibit discontinuous phase transitions which have traditionally been more difficult to analyze rigorously. The book shows how the parameter regions for rapid mixing for several classes of statistical mechanical models are derived using the aggregate path coupling method.

  13. Network features and pathway analyses of a signal transduction cascade

    Directory of Open Access Journals (Sweden)

    Ryoji Yanashima

    2009-05-01

    Full Text Available 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.

  14. Effects of consumer-producer interactions in alternative food networks on consumers’ learning about food and agriculture

    Directory of Open Access Journals (Sweden)

    Opitz Ina

    2017-09-01

    Full Text Available In the recent literature, Alternative Food Networks (AFN are discussed as a promising approach, at the urban-rural interface, to meeting the challenges of the current agri-food system. Consumer-producer collaboration is seen as a characteristic feature in this context. What is lacking, however, are general concepts for describing the topics of consumer-producer interactions (CPI. The present study aims (1 to develop an analytical framework relying on six CPI domains and (2 to apply it to investigate CPI effects on consumers’ learning about and appreciation of agriculture. We conducted 26 guided interviews with consumers and producers of the three most frequent AFN types in Germany: community-supported agriculture (CSA, food coops, and self-harvest gardens. The results show that AFN participation enhances consumers’ learning about food (seasonality, cooking/nutrition, housekeeping aspects and agricultural production (farmers’ perspectives, cultivation. Our results show that consumer’s learning is influenced by certain CPI domains, and each AFN type can be described by distinctive CPI domains. This led to the conclusion that specific AFN types open up specific learning channels and contents, with consumers learning from producers. AFNs at the urban-rural interface exploit knowledge of rurality.

  15. Analysis of construction dynamic plan using fuzzy critical path method

    Directory of Open Access Journals (Sweden)

    Kurij Kazimir V.

    2014-01-01

    Full Text Available Critical Path Method (CPM technique has become widely recognized as valuable tool for the planning and scheduling large construction projects. The aim of this paper is to present an analytical method for finding the Critical Path in the precedence network diagram where the duration of each activity is represented by a trapezoidal fuzzy number. This Fuzzy Critical Path Method (FCPM uses a defuzzification formula for trapezoidal fuzzy number and applies it on the total float (slack time for each activity in the fuzzy precedence network to find the critical path. The method presented in this paper is very effective in determining the critical activities and finding the critical paths.

  16. Revisión del sistema de gestión de pavimentos de la red ciclorrutas de Bogotá Review of the pavement management system of the Bogotá bike-path network

    Directory of Open Access Journals (Sweden)

    Gilberto Martínez Arguelles

    2011-08-01

    Full Text Available El documento presenta una revisión objetiva sobre el sistema de gestión de ciclorrutas de la ciudad de Bogotá. Los resultados de la revisión muestran la necesidad de establecer un manual de fallas para ciclorrutas, que contenga los deterioros reales en este tipo de estructuras y las causas generadoras. La predicción del deterioro de las ciclorrutas, requiere de la definición de tramos testigos que alimenten una base de datos que permita el desarrollo de modelos empíricos. El documento propone elementos claves que se deben complementar y que debe tener como mínimo un sistema de gestión de infraestructura, tales como; el desarrollo de modelos de deterioro, definición de estándares de mantenimiento y la evaluación social en la fase de priorización de intervenciones. Estos elementos deben ser considerados para estructurar una próxima versión del SGC. Los resultados del estudio muestran diferentes aspectos que se deben mejorar y desarrollar, como es el caso de curvas de deterioro para las ciclorrutas, el desarrollo de un índice de confort para usuarios de las ciclorrutas y la definición de una guía de intervenciones en función del estado del tramo.The paper presents a review of the Bogota bike-path network management system. The results of the study showed that it is necessary to establish a specific manual for bicycle paths with the potential damage in such structures. The prediction of the distress on the bike paths requires the definition of monitoring sections to feed a database that allows the development of empirical models. The document proposed key elements that must contain an infrastructure management system, such as: models for deterioration development, definition of maintenance standards and social assessment at the stage of prioritizing interventions. These factors should be considered to structure a future version of the bike-path management system. The results of the study showed different topic that must be

  17. Does where you stand depend on who you behave? Networking behavior as an alternative explanation for gender differences in network structure

    NARCIS (Netherlands)

    Gremmen, I.; Akkerman, A.; Benschop, Y.

    2013-01-01

    The purpose of this study is to gain insight into the relations between gender, networking behavior and network structure, in order to investigate the relevance of gender for organizational networks. Semi-structured interviews with 39 white, Dutch, women and men account managers were analyzed both

  18. Fractional path planning and path tracking

    International Nuclear Information System (INIS)

    Melchior, P.; Jallouli-Khlif, R.; Metoui, B.

    2011-01-01

    This paper presents the main results of the application of fractional approach in path planning and path tracking. A new robust path planning design for mobile robot was studied in dynamic environment. The normalized attractive force applied to the robot is based on a fictitious fractional attractive potential. This method allows to obtain robust path planning despite robot mass variation. The danger level of each obstacles is characterized by the fractional order of the repulsive potential of the obstacles. Under these conditions, the robot dynamic behavior was studied by analyzing its X - Y path planning with dynamic target or dynamic obstacles. The case of simultaneously mobile obstacles and target is also considered. The influence of the robot mass variation is studied and the robustness analysis of the obtained path shows the robustness improvement due to the non integer order properties. Pre shaping approach is used to reduce system vibration in motion control. Desired systems inputs are altered so that the system finishes the requested move without residual vibration. This technique, developed by N.C. Singer and W.P.Seering, is used for flexible structure control, particularly in the aerospace field. In a previous work, this method was extended for explicit fractional derivative systems and applied to second generation CRONE control, the robustness was also studied. CRONE (the French acronym of C ommande Robuste d'Ordre Non Entier ) control system design is a frequency-domain based methodology using complex fractional integration.

  19. The inherited path: contribution to the study of the least-cost pathways network between Neolithic habitats and rock art sites in the Massif of Caroig (Valencia, Spain

    Directory of Open Access Journals (Sweden)

    Trinidad MARTÍNEZ I RUBIO

    2013-01-01

    Full Text Available Neolithic Art includes a wide range of expressions, among which we focus on both Levantine Art and Old Schematic Art. The paper intends to establish the optimum routes between the habitat sites –and their chronology– and Rock Art site carried out by GIS. On the other hand, and in an inverse way, it tries to infer the changes occurred in this network during the Neolithic period according to sequences of style established for Levantine Art and Old Schematic art. In conclusion, how territory is inhabited and travelled across, how the communication network is structured among the different habitat sites and the role that painted shelters have.

  20. Acupuncture and related therapies used as add-on or alternative to prokinetics for functional dyspepsia: overview of systematic reviews and network meta-analysis

    OpenAIRE

    Ho, Robin S. T.; Chung, Vincent C. H.; Wong, Charlene H. L.; Wu, Justin C. Y.; Wong, Samuel Y. S.; Wu, Irene X. Y.

    2017-01-01

    Prokinetics for functional dyspepsia (FD) have relatively higher number needed to treat values. Acupuncture and related therapies could be used as add-on or alternative. An overview of systematic reviews (SRs) and network meta-analyses (NMA) were performed to evaluate the comparative effectiveness of different acupuncture and related therapies. We conducted a comprehensive literature search for SRs of randomized controlled trials (RCTs) in eight international and Chinese databases. Data from ...

  1. An Alternative to Optimize the Indonesian’s Airport Network Design: An Application of Minimum Spanning Tree (MST Technique

    Directory of Open Access Journals (Sweden)

    Luluk Lusiantoro

    2012-09-01

    Full Text Available Using minimum spanning tree technique (MST, this exploratory research was done to optimize the interrelation and hierarchical network design of Indonesian’s airports. This research also identifies the position of the Indonesian’s airports regionally based on the ASEAN Open Sky Policy 2015. The secondary data containing distance between airports (both in Indonesia and in ASEAN, flight frequency, and correlation of Gross Domestic Regional Product (GDRP for each region in Indonesia are used as inputs to form MST networks. The result analysis is done by comparing the MST networks with the existing network in Indonesia. This research found that the existing airport network in Indonesia does not depict the optimal network connecting all airports with the shortest distance and maximizing the correlation of regional economic potential in the country. This research then suggests the optimal networks and identifies the airports and regions as hubs and spokes formed by the networks. Lastly, this research indicates that the Indonesian airports have no strategic position in the ASEAN Open Sky network, but they have an opportunity to get strategic positions if 33 airports in 33 regions in Indonesia are included in the network.

  2. Economic assessment of smart grids solutions. Analysis carried out by the distribution network operators. Executive Summary 2017. The new paths of electricity

    International Nuclear Information System (INIS)

    2017-05-01

    The economic viability of the Smart grids solutions is a key concern. This was highlighted in a letter from the ministries for the Environment, Sustainable Development and Energy and for the Economy, Industry and Digital Technology, which requested additional information regarding this question with regard to the distribution and transmission networks. Enedis and ADEeF (Association gathering electricity distributors in France), have realized a study on the economic assessment of smart grids solutions, in order to analyze associated costs and benefits. This study is part of a global approach conducted by the Ministries and in collaboration with ADEME and RTE. The functions featured in this study concern the transmission substation and MV network: Operational planning system, Extension of self-healing capabilities of the distribution network, Centralised dynamic voltage control, Self-adaptive reactive power control by MV producers, Active power curtailment of MV production, Use of flexibility for demand constraints. The results presented in this study are coherent with actual investment decisions and foreshadow future action plans

  3. Carotenoid Biosynthetic Pathways Are Regulated by a Network of Multiple Cascades of Alternative Sigma Factors in Azospirillum brasilense Sp7.

    Science.gov (United States)

    Rai, Ashutosh Kumar; Dubey, Ashutosh Prakash; Kumar, Santosh; Dutta, Debashis; Mishra, Mukti Nath; Singh, Bhupendra Narain; Tripathi, Anil Kumar

    2016-11-01

    Carotenoids constitute an important component of the defense system against photooxidative stress in bacteria. In Azospirillum brasilense Sp7, a nonphotosynthetic rhizobacterium, carotenoid synthesis is controlled by a pair of extracytoplasmic function sigma factors (RpoEs) and their cognate zinc-binding anti-sigma factors (ChrRs). Its genome harbors two copies of the gene encoding geranylgeranyl pyrophosphate synthase (CrtE), the first critical step in the carotenoid biosynthetic pathway in bacteria. Inactivation of each of two crtE paralogs found in A. brasilense caused reduction in carotenoid content, suggesting their involvement in carotenoid synthesis. However, the effect of crtE1 deletion was more pronounced than that of crtE2 deletion. Out of the five paralogs of rpoH in A. brasilense, overexpression of rpoH1 and rpoH2 enhanced carotenoid synthesis. Promoters of crtE2 and rpoH2 were found to be dependent on RpoH2 and RpoE1, respectively. Using a two-plasmid system in Escherichia coli, we have shown that the crtE2 gene of A. brasilense Sp7 is regulated by two cascades of sigma factors: one consisting of RpoE1and RpoH2 and the other consisting of RpoE2 and RpoH1. In addition, expression of crtE1 was upregulated indirectly by RpoE1 and RpoE2. This study shows, for the first time in any carotenoid-producing bacterium, that the regulation of carotenoid biosynthetic pathway involves a network of multiple cascades of alternative sigma factors. Carotenoids play a very important role in coping with photooxidative stress in prokaryotes and eukaryotes. Although extracytoplasmic function (ECF) sigma factors are known to directly regulate the expression of carotenoid biosynthetic genes in bacteria, regulation of carotenoid biosynthesis by one or multiple cascades of sigma factors had not been reported. This study provides the first evidence of the involvement of multiple cascades of sigma factors in the regulation of carotenoid synthesis in any bacterium by showing the

  4. Path-dependent functions

    International Nuclear Information System (INIS)

    Khrapko, R.I.

    1985-01-01

    A uniform description of various path-dependent functions is presented with the help of expansion of the type of the Taylor series. So called ''path-integrals'' and ''path-tensor'' are introduced which are systems of many-component quantities whose values are defined for arbitrary paths in coordinated region of space in such a way that they contain a complete information on the path. These constructions are considered as elementary path-dependent functions and are used instead of power monomials in the usual Taylor series. Coefficients of such an expansion are interpreted as partial derivatives dependent on the order of the differentiations or else as nonstandard cavariant derivatives called two-point derivatives. Some examples of pathdependent functions are presented.Space curvature tensor is considered whose geometrica properties are determined by the (non-transitive) translator of parallel transport of a general type. Covariant operation leading to the ''extension'' of tensor fiels is pointed out

  5. Iterated Leavitt Path Algebras

    International Nuclear Information System (INIS)

    Hazrat, R.

    2009-11-01

    Leavitt path algebras associate to directed graphs a Z-graded algebra and in their simplest form recover the Leavitt algebras L(1,k). In this note, we introduce iterated Leavitt path algebras associated to directed weighted graphs which have natural ± Z grading and in their simplest form recover the Leavitt algebras L(n,k). We also characterize Leavitt path algebras which are strongly graded. (author)

  6. Pulled Motzkin paths

    Energy Technology Data Exchange (ETDEWEB)

    Janse van Rensburg, E J, E-mail: rensburg@yorku.c [Department of Mathematics and Statistics, York University, Toronto, ON, M3J 1P3 (Canada)

    2010-08-20

    In this paper the models of pulled Dyck paths in Janse van Rensburg (2010 J. Phys. A: Math. Theor. 43 215001) are generalized to pulled Motzkin path models. The generating functions of pulled Motzkin paths are determined in terms of series over trinomial coefficients and the elastic response of a Motzkin path pulled at its endpoint (see Orlandini and Whittington (2004 J. Phys. A: Math. Gen. 37 5305-14)) is shown to be R(f) = 0 for forces pushing the endpoint toward the adsorbing line and R(f) = f(1 + 2cosh f))/(2sinh f) {yields} f as f {yields} {infinity}, for forces pulling the path away from the X-axis. In addition, the elastic response of a Motzkin path pulled at its midpoint is shown to be R(f) = 0 for forces pushing the midpoint toward the adsorbing line and R(f) = f(1 + 2cosh (f/2))/sinh (f/2) {yields} 2f as f {yields} {infinity}, for forces pulling the path away from the X-axis. Formal combinatorial identities arising from pulled Motzkin path models are also presented. These identities are the generalization of combinatorial identities obtained in directed paths models to their natural trinomial counterparts.

  7. Pulled Motzkin paths

    Science.gov (United States)

    Janse van Rensburg, E. J.

    2010-08-01

    In this paper the models of pulled Dyck paths in Janse van Rensburg (2010 J. Phys. A: Math. Theor. 43 215001) are generalized to pulled Motzkin path models. The generating functions of pulled Motzkin paths are determined in terms of series over trinomial coefficients and the elastic response of a Motzkin path pulled at its endpoint (see Orlandini and Whittington (2004 J. Phys. A: Math. Gen. 37 5305-14)) is shown to be R(f) = 0 for forces pushing the endpoint toward the adsorbing line and R(f) = f(1 + 2cosh f))/(2sinh f) → f as f → ∞, for forces pulling the path away from the X-axis. In addition, the elastic response of a Motzkin path pulled at its midpoint is shown to be R(f) = 0 for forces pushing the midpoint toward the adsorbing line and R(f) = f(1 + 2cosh (f/2))/sinh (f/2) → 2f as f → ∞, for forces pulling the path away from the X-axis. Formal combinatorial identities arising from pulled Motzkin path models are also presented. These identities are the generalization of combinatorial identities obtained in directed paths models to their natural trinomial counterparts.

  8. Pulled Motzkin paths

    International Nuclear Information System (INIS)

    Janse van Rensburg, E J

    2010-01-01

    In this paper the models of pulled Dyck paths in Janse van Rensburg (2010 J. Phys. A: Math. Theor. 43 215001) are generalized to pulled Motzkin path models. The generating functions of pulled Motzkin paths are determined in terms of series over trinomial coefficients and the elastic response of a Motzkin path pulled at its endpoint (see Orlandini and Whittington (2004 J. Phys. A: Math. Gen. 37 5305-14)) is shown to be R(f) = 0 for forces pushing the endpoint toward the adsorbing line and R(f) = f(1 + 2cosh f))/(2sinh f) → f as f → ∞, for forces pulling the path away from the X-axis. In addition, the elastic response of a Motzkin path pulled at its midpoint is shown to be R(f) = 0 for forces pushing the midpoint toward the adsorbing line and R(f) = f(1 + 2cosh (f/2))/sinh (f/2) → 2f as f → ∞, for forces pulling the path away from the X-axis. Formal combinatorial identities arising from pulled Motzkin path models are also presented. These identities are the generalization of combinatorial identities obtained in directed paths models to their natural trinomial counterparts.

  9. Investment dimensions in a universal service perspective: Next generation networks, alternative funding mechanisms and public-private partnerships

    DEFF Research Database (Denmark)

    Falch, Morten; Henten, Anders

    2008-01-01

    This paper seeks to examine the investment dimensions of next generation networks from a universal service perspective in a European context. The question is how new network infrastructures for providing access for everyone to communication, information and entertainment services in the present...

  10. Multi-Dimensional Path Queries

    DEFF Research Database (Denmark)

    Bækgaard, Lars

    1998-01-01

    to create nested path structures. We present an SQL-like query language that is based on path expressions and we show how to use it to express multi-dimensional path queries that are suited for advanced data analysis in decision support environments like data warehousing environments......We present the path-relationship model that supports multi-dimensional data modeling and querying. A path-relationship database is composed of sets of paths and sets of relationships. A path is a sequence of related elements (atoms, paths, and sets of paths). A relationship is a binary path...

  11. Forming of the regional core transport network taking into account the allocation of alternative energy sources based on artificial intelligence methods

    Directory of Open Access Journals (Sweden)

    Marina ZHURAVSKAYA

    2014-12-01

    Full Text Available In the modern world the alternative energy sources, which considerably depend on a region, play more and more significant role. However, the transition of regions to new energy sources lead to the change of transport and logistic network configuration. The formation of optimal core transport network today is a guarantee of the successful economic development of a region tomorrow. The present article studies the issue of advanced core transport network development in a region based on the experience of European and Asian countries and the opportunity to adapt the best foreign experience to Russian conditions. On the basis of artificial intelligence methods for forest industry complex of Sverdlovskaya Oblast the algorithm of problem solution of an optimal logistic infrastructure allocation is offered and some results of a regional transport network are presented. These methods allowed to solve the set task in the conditions of information uncertainty. There are suggestions on the improvement of transport and logistic network in the territory of Sverdlovskaya Oblast. Traditionally the logistics of mineral fuel plays main role in regions development. Actually it is required to develop logistic strategic plans to be able to provide different possibilities of power-supply, flexible enough to change with the population density, transport infrastructure and demographics of different regions. The problem of logistic centers allocation was studied by many authors. The approach, offered by the authors of this paper is to solve the set of tasks by applying artificial intelligence methods, such as fuzzy set theory and genetic algorithms.

  12. "We definitely need an audience": experiences of Twitter, Twitter networks and tweet content in adults with severe communication disabilities who use augmentative and alternative communication (AAC).

    Science.gov (United States)

    Hemsley, Bronwyn; Dann, Stephen; Palmer, Stuart; Allan, Meredith; Balandin, Susan

    2015-01-01

    The aim of this study was to investigate the Twitter experiences of adults with severe communication disabilities who use augmentative and alternative communication (AAC) to inform Twitter training and further research on the use of Twitter in populations with communication disabilities. This mixed methods research included five adults with severe communication disabilities who use AAC. It combined (a) quantitative analysis of Twitter networks and (b) manual coding of tweets with (c) narrative interviews with participants on their Twitter experiences and results. The five participants who used AAC and Twitter were diverse in their patterns and experiences of using Twitter. Twitter networks reflected interaction with a close-knit network of people rather than with the broader publics on Twitter. Conversational, Broadcast and Pass Along tweets featured most prominently, with limited use of News or Social Presence tweets. Tweets appeared mostly within each participant's micro- or meso-structural layers of Twitter. People who use AAC report positive experiences in using Twitter. Obtaining help in Twitter, and engaging in hashtag communities facilitated higher frequency of tweets and establishment of Twitter networks. Results reflected an inter-connection of participant Twitter networks that might form part of a larger as yet unexplored emergent community of people who use AAC in Twitter.

  13. Unique Path Partitions

    DEFF Research Database (Denmark)

    Bessenrodt, Christine; Olsson, Jørn Børling; Sellers, James A.

    2013-01-01

    We give a complete classification of the unique path partitions and study congruence properties of the function which enumerates such partitions.......We give a complete classification of the unique path partitions and study congruence properties of the function which enumerates such partitions....

  14. Hamiltonian path integrals

    International Nuclear Information System (INIS)

    Prokhorov, L.V.

    1982-01-01

    The properties of path integrals associated with the allowance for nonstandard terms reflecting the operator nature of the canonical variables are considered. Rules for treating such terms (''equivalence rules'') are formulated. Problems with a boundary, the behavior of path integrals under canonical transformations, and the problem of quantization of dynamical systems with constraints are considered in the framework of the method

  15. Modeling and Solving the Train Pathing Problem

    Directory of Open Access Journals (Sweden)

    Chuen-Yih Chen

    2009-04-01

    Full Text Available In a railroad system, train pathing is concerned with the assignment of trains to links and tracks, and train timetabling allocates time slots to trains. In this paper, we present an optimization heuristic to solve the train pathing and timetabling problem. This heuristic allows the dwell time of trains in a station or link to be dependent on the assigned tracks. It also allows the minimum clearance time between the trains to depend on their relative status. The heuristic generates a number of alternative paths for each train service in the initialization phase. Then it uses a neighborhood search approach to find good feasible combinations of these paths. A linear program is developed to evaluate the quality of each combination that is encountered. Numerical examples are provided.

  16. A Dynamic Network Approach to the Assessment of Terrorist Groups and the Impact of Alternative Courses of Action

    National Research Council Canada - National Science Library

    Carley, Kathleen M

    2006-01-01

    Dynamic network analysis (DNA) is an emergent field centered on the collection, analysis, understanding and prediction of dynamic relations among various entities such as actors, events and resources and the impact...

  17. A Multipath Routing Protocol Based on Bloom Filter for Multihop Wireless Networks

    Directory of Open Access Journals (Sweden)

    Junwei Jin

    2016-01-01

    Full Text Available On-demand multipath routing in a wireless ad hoc network is effective in achieving load balancing over the network and in improving the degree of resilience to mobility. In this paper, the salvage capable opportunistic node-disjoint multipath routing (SNMR protocol is proposed, which forms multiple routes for data transmission and supports packet salvaging with minimum overhead. The proposed mechanism constructs a primary path and a node-disjoint backup path together with alternative paths for the intermediate nodes in the primary path. It can be achieved by considering the reverse route back to the source stored in the route cache and the primary path information compressed by a Bloom filter. Our protocol presents higher capability in packet salvaging and lower overhead in forming multiple routes. Simulation results show that SNMR outperforms the compared protocols in terms of packet delivery ratio, normalized routing load, and throughput.

  18. Hippocampal “Time Cells”: Time versus Path Integration

    Science.gov (United States)

    Kraus, Benjamin J.; Robinson, Robert J.; White, John A.; Eichenbaum, Howard; Hasselmo, Michael E.

    2014-01-01

    SUMMARY Recent studies have reported the existence of hippocampal “time cells,” neurons that fire at particular moments during periods when behavior and location are relatively constant. However, an alternative explanation of apparent time coding is that hippocampal neurons “path integrate” to encode the distance an animal has traveled. Here, we examined hippocampal neuronal firing patterns as rats ran in place on a treadmill, thus “clamping” behavior and location, while we varied the treadmill speed to distinguish time elapsed from distance traveled. Hippocampal neurons were strongly influenced by time and distance, and less so by minor variations in location. Furthermore, the activity of different neurons reflected integration over time and distance to varying extents, with most neurons strongly influenced by both factors and some significantly influenced by only time or distance. Thus, hippocampal neuronal networks captured both the organization of time and distance in a situation where these dimensions dominated an ongoing experience. PMID:23707613

  19. An Approach for Indoor Path Computation among Obstacles that Considers User Dimension

    Directory of Open Access Journals (Sweden)

    Liu Liu

    2015-12-01

    Full Text Available People often transport objects within indoor environments, who need enough space for the motion. In such cases, the accessibility of indoor spaces relies on the dimensions, which includes a person and her/his operated objects. This paper proposes a new approach to avoid obstacles and compute indoor paths with respect to the user dimension. The approach excludes inaccessible spaces for a user in five steps: (1 compute the minimum distance between obstacles and find the inaccessible gaps; (2 group obstacles according to the inaccessible gaps; (3 identify groups of obstacles that influence the path between two locations; (4 compute boundaries for the selected groups; and (5 build a network in the accessible area around the obstacles in the room. Compared to the Minkowski sum method for outlining inaccessible spaces, the proposed approach generates simpler polygons for groups of obstacles that do not contain inner rings. The creation of a navigation network becomes easier based on these simple polygons. By using this approach, we can create user- and task-specific networks in advance. Alternatively, the accessible path can be generated on the fly before the user enters a room.

  20. Path integration quantization

    International Nuclear Information System (INIS)

    DeWitt-Morette, C.

    1983-01-01

    Much is expected of path integration as a quantization procedure. Much more is possible if one recognizes that path integration is at the crossroad of stochastic and differential calculus and uses the full power of both stochastic and differential calculus in setting up and computing path integrals. In contrast to differential calculus, stochastic calculus has only comparatively recently become an instrument of thought. It has nevertheless already been used in a variety of challenging problems, for instance in the quantization problem. The author presents some applications of the stochastic scheme. (Auth.)

  1. Two dimensional simplicial paths

    International Nuclear Information System (INIS)

    Piso, M.I.

    1994-07-01

    Paths on the R 3 real Euclidean manifold are defined as 2-dimensional simplicial strips which are orbits of the action of a discrete one-parameter group. It is proven that there exists at least one embedding of R 3 in the free Z-module generated by S 2 (x 0 ). The speed is defined as the simplicial derivative of the path. If mass is attached to the simplex, the free Lagrangian is proportional to the width of the path. In the continuum limit, the relativistic form of the Lagrangian is recovered. (author). 7 refs

  2. Synaptic excitation in spinal motoneurons alternates with synaptic inhibition and is balanced by outward rectification during rhythmic motor network activity

    DEFF Research Database (Denmark)

    Guzulaitis, Robertas; Hounsgaard, Jorn

    2017-01-01

    channels. Intrinsic outward rectification facilitates spiking by focusing synaptic depolarization near threshold for action potentials. By direct recording of synaptic currents, we also show that motoneurons are activated by out-of-phase peaks in excitation and inhibition during network activity, whereas......Regular firing in spinal motoneurons of red-eared turtles (Trachemys scripta elegans, either sex) evoked by steady depolarization at rest is replaced by irregular firing during functional network activity. The transition caused by increased input conductance and synaptic fluctuations in membrane...... potential was suggested to originate from intense concurrent inhibition and excitation. We show that the conductance increase in motoneurons during functional network activity is mainly caused by intrinsic outward rectification near threshold for action potentials by activation of voltage and Ca2+ gated K...

  3. SDN-based path hopping communication against eavesdropping attack

    Science.gov (United States)

    Zhang, Chuanhao; Bu, Youjun; Zhao, Zheng

    2016-10-01

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

  4. Exploring Embedded Path Capacity Estimation in TCP Receiver

    NARCIS (Netherlands)

    Marcondes, Cesar; Sanadidi, M.Y.; Gerla, Mario; Martinello, Magnos; de Souza Schwartz, Ramon

    2007-01-01

    Accurate estimation of network characteristics, such as capacity, based on non-intrusive measurements is a fundamental desire of several applications. For instance, P2P applications that build overlay networks can use path capacity for optimizing network performance. We present a simple technique to

  5. Groebner Finite Path Algebras

    OpenAIRE

    Leamer, Micah J.

    2004-01-01

    Let K be a field and Q a finite directed multi-graph. In this paper I classify all path algebras KQ and admissible orders with the property that all of their finitely generated ideals have finite Groebner bases. MS

  6. Alternative Food Networks and Social Media in Marketing : A multiple case study exploring how Alternative Food Networks use social media in order to help small local food producers reach the market

    OpenAIRE

    Puranen, Niklas; Jansson, Markus

    2017-01-01

    The food provision system of today has been argued to be unsustainable with large scale production, price-pressure and outbreaks of diseases. Many consumers in the EU and Sweden are reacting to these issues and are becoming increasingly interested in finding local food alternatives that they consider to be safer and of higher quality. However, the small local food producers due to scarce budgets and marketing skills have problems in reaching this target market. Partly due to this, there has b...

  7. Synthesis, crystal structure and magnetic properties of an alternating manganese chain

    International Nuclear Information System (INIS)

    Ramos Silva, Manuela; Matos Beja, Ana; Antonio Paixao, Jose; Martin-Gil, Jesus

    2006-01-01

    A new 1D complex has been prepared and characterized. X-ray single crystal structure confirms that the Mn(II) ions assemble in alternating chains with Mn-Mn distances of 3.8432(13) and 4.4428(14) A. A 3D network of hydrogen bonds links the chains together. The temperature dependence of the magnetic susceptibility reveals that this compound undergoes a magnetic transition and exhibits an antiferromagnetic interaction in the low-temperature phase with two alternating exchange interactions of -2.32(1) and -5.55(1) cm -1 . - Graphical abstract: Portion of the dimeric manganese chain showing the two alternating exchange interactions paths

  8. Path planning in changeable environments

    NARCIS (Netherlands)

    Nieuwenhuisen, D.

    2007-01-01

    This thesis addresses path planning in changeable environments. In contrast to traditional path planning that deals with static environments, in changeable environments objects are allowed to change their configurations over time. In many cases, path planning algorithms must facilitate quick

  9. MMC with parallel-connected MOSFETs as an alternative to wide bandgap converters for LVDC distribution networks

    Directory of Open Access Journals (Sweden)

    Yanni Zhong

    2017-03-01

    Full Text Available Low-voltage direct-current (LVDC networks offer improved conductor utilisation on existing infrastructure and reduced conversion stages, which can lead to a simpler and more efficient distribution network. However, LVDC networks must continue to support AC loads, requiring efficient, low-distortion DC–AC converters. Additionally, increasing numbers of DC loads on the LVAC network require controlled, low-distortion, unity power factor AC-DC converters with large capacity, and bi-directional capability. An AC–DC/DC–AC converter design is therefore proposed in this study to minimise conversion loss and maximise power quality. Comparative analysis is performed for a conventional IGBT two-level converter, a SiC MOSFET two-level converter, a Si MOSFET modular multi-level converter (MMC and a GaN HEMT MMC, in terms of power loss, reliability, fault tolerance, converter cost and heatsink size. The analysis indicates that the five-level MMC with parallel-connected Si MOSFETs is an efficient, cost-effective converter for low-voltage converter applications. MMC converters suffer negligible switching loss, which enables reduced device switching without loss penalty from increased harmonics and filtering. Optimal extent of parallel-connection for MOSFETs in an MMC is investigated. Experimental results are presented to show the reduction in device stress and electromagnetic interference generating transients through the use of reduced switching and device parallel-connection.

  10. Evolutionary neural networks: a new alternative for neutron spectrometry; Redes neuronales evolutivas: una nueva alternativa para la espectrometria de neutrones

    Energy Technology Data Exchange (ETDEWEB)

    Ortiz R, J. M. [Departamento de Electrotecnia y Electronica, Escuela Politecnica Superior, Av. Menendez Pidal s/n, 14004 Cordoba (Spain); Martinez B, M. R.; Vega C, H. R. [Unidad Academica de Estudios Nucleares, Universidad Autonoma de Zacatecas, Cipres 10, Fracc. La Penuela, 98068 Zacatecas (Mexico); Galleo, E. [Departamento de Ingenieria Nuclear, Universidad Politecnica de Madrid, Jose Gutierrez Abascal 2, 28006 Madrid (Spain)], e-mail: morvymm@yahoo.com.mx

    2009-10-15

    A device used to perform neutron spectroscopy is the system known as a system of Bonner spheres spectrometer, this system has some disadvantages, one of these is the need for reconstruction using a code that is based on an iterative reconstruction algorithm, whose greater inconvenience is the need for a initial spectrum, as close as possible to the spectrum that is desired to avoid this inconvenience has been reported several procedures in reconstruction, combined with various types of experimental methods, based on artificial intelligence technology how genetic algorithms, artificial neural networks and hybrid systems evolved artificial neural networks using genetic algorithms. This paper analyzes the intersection of neural networks and evolutionary algorithms applied in the neutron spectroscopy and dosimetry. Due to this is an emerging technology, there are not tools for doing analysis of the obtained results, by what this paper presents a computing tool to analyze the neutron spectra and the equivalent doses obtained through the hybrid technology of neural networks and genetic algorithms. The toolmaker offers a user graphical environment, friendly and easy to operate. (author)

  11. A NEW APPROACH ON SHORTEST PATH IN FUZZY ENVIRONMENT

    OpenAIRE

    A. Nagoorgani; A. Mumtaj Begam

    2010-01-01

    This paper introduces a new type of fuzzy shortest path network problem using triangular fuzzy number. To find the smallest edge by the fuzzy distance using graded mean integration representation of generalized fuzzy number for every node. Thus the optimum shortest path for the given problem is obtained.

  12. “We definitely need an audience”: experiences of Twitter, Twitter networks and tweet content in adults with severe communication disabilities who use augmentative and alternative communication (AAC)

    Science.gov (United States)

    Hemsley, Bronwyn; Dann, Stephen; Palmer, Stuart; Allan, Meredith; Balandin, Susan

    2015-01-01

    Abstract Purpose: The aim of this study was to investigate the Twitter experiences of adults with severe communication disabilities who use augmentative and alternative communication (AAC) to inform Twitter training and further research on the use of Twitter in populations with communication disabilities. Method: This mixed methods research included five adults with severe communication disabilities who use AAC. It combined (a) quantitative analysis of Twitter networks and (b) manual coding of tweets with (c) narrative interviews with participants on their Twitter experiences and results. Results: The five participants who used AAC and Twitter were diverse in their patterns and experiences of using Twitter. Twitter networks reflected interaction with a close-knit network of people rather than with the broader publics on Twitter. Conversational, Broadcast and Pass Along tweets featured most prominently, with limited use of News or Social Presence tweets. Tweets appeared mostly within each participant's micro- or meso-structural layers of Twitter. Conclusions: People who use AAC report positive experiences in using Twitter. Obtaining help in Twitter, and engaging in hashtag communities facilitated higher frequency of tweets and establishment of Twitter networks. Results reflected an inter-connection of participant Twitter networks that might form part of a larger as yet unexplored emergent community of people who use AAC in Twitter.Implications for RehabilitationTwitter can be used as an important vehicle for conversation and a forum for people with communication disabilities to exchange information and participate socially in online communities.It is important that information and resources relating to the effective use of Twitter for a range of purposes are made available to people with communication disabilities who wish to take up or maintain use of Twitter.People with communication disabilities might benefit from support in using Twitter to meet their goals

  13. On the reachability and observability of path and cycle graphs

    OpenAIRE

    Parlangeli, Gianfranco; Notarstefano, Giuseppe

    2011-01-01

    In this paper we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary and sufficient conditions, based on simple algebraic rules from number theory, to characterize all and only the nodes from which the network system is reachable (respectively observable). Interesting immediate corollaries of our results are: (i) a path graph...

  14. Quivers of Bound Path Algebras and Bound Path Coalgebras

    Directory of Open Access Journals (Sweden)

    Dr. Intan Muchtadi

    2010-09-01

    Full Text Available bras and coalgebras can be represented as quiver (directed graph, and from quiver we can construct algebras and coalgebras called path algebras and path coalgebras. In this paper we show that the quiver of a bound path coalgebra (resp. algebra is the dual quiver of its bound path algebra (resp. coalgebra.

  15. Paths correlation matrix.

    Science.gov (United States)

    Qian, Weixian; Zhou, Xiaojun; Lu, Yingcheng; Xu, Jiang

    2015-09-15

    Both the Jones and Mueller matrices encounter difficulties when physically modeling mixed materials or rough surfaces due to the complexity of light-matter interactions. To address these issues, we derived a matrix called the paths correlation matrix (PCM), which is a probabilistic mixture of Jones matrices of every light propagation path. Because PCM is related to actual light propagation paths, it is well suited for physical modeling. Experiments were performed, and the reflection PCM of a mixture of polypropylene and graphite was measured. The PCM of the mixed sample was accurately decomposed into pure polypropylene's single reflection, pure graphite's single reflection, and depolarization caused by multiple reflections, which is consistent with the theoretical derivation. Reflection parameters of rough surface can be calculated from PCM decomposition, and the results fit well with the theoretical calculations provided by the Fresnel equations. These theoretical and experimental analyses verify that PCM is an efficient way to physically model light-matter interactions.

  16. Leavitt path algebras

    CERN Document Server

    Abrams, Gene; Siles Molina, Mercedes

    2017-01-01

    This book offers a comprehensive introduction by three of the leading experts in the field, collecting fundamental results and open problems in a single volume. Since Leavitt path algebras were first defined in 2005, interest in these algebras has grown substantially, with ring theorists as well as researchers working in graph C*-algebras, group theory and symbolic dynamics attracted to the topic. Providing a historical perspective on the subject, the authors review existing arguments, establish new results, and outline the major themes and ring-theoretic concepts, such as the ideal structure, Z-grading and the close link between Leavitt path algebras and graph C*-algebras. The book also presents key lines of current research, including the Algebraic Kirchberg Phillips Question, various additional classification questions, and connections to noncommutative algebraic geometry. Leavitt Path Algebras will appeal to graduate students and researchers working in the field and related areas, such as C*-algebras and...

  17. The Thinnest Path Problem

    Science.gov (United States)

    2016-07-22

    be reduced to TP in -D UDH for any . We then show that the 2-D disk hypergraph constructed in the proof of Theorem 1 can be modified to an exposed...transmission range that induces hy- peredge , i.e., (3) GAO et al.: THINNEST PATH PROBLEM 1181 Theorem 5 shows that the covered area of the path...representation of (the two hyperedges rooted at from the example given in Fig. 6 are illustrated in green and blue, respectively). step, we show in this

  18. Path dependence and creation

    DEFF Research Database (Denmark)

    Garud, Raghu; Karnøe, Peter

    This edited volume stems from a conference held in Copenhagen that the authors ran in August of 1997. The authors, aware of the recent work in evolutionary theory and the science of chaos and complexity, challenge the sometimes deterministic flavour of this work. They are interested in uncovering...... the place of agency in these theories that take history so seriously. In the end, they are as interested in path creation and destruction as they are in path dependence. This book is compiled of both theoretical and empirical writing. It shows relatively well-known industries such as the automobile...

  19. A Network of Resistances against a Multiple Crisis. SOS Rosarno and the Experimentation of Socio-Economic Alternative Models

    Directory of Open Access Journals (Sweden)

    Federico Oliveri

    2015-07-01

    Full Text Available SOS Rosarno was launched in 2011 by a group of small farmers and activists based in the Gioia Tauro Plain, Calabria, Southern Italy. The idea was to sell organic citrus fruits through short self-organized supply chains, essentially based on Solidarity Purchase Groups, in order to allow producers to pay migrant workers according to the law, to receive a fair remuneration, to guarantee healthy and affordable food to consumers, to protect the integrity of the environment. This paper aims to reconstruct the ideological frame and the genealogy, the organization and the practices, the impact and the limits of SOS Rosarno, drawing mainly on the political documents produced by the association and in-depth interviews with its diverse members. It clarifies, on one side, the strategies of alternative economy and the new social alliances implemented in order to challenge those conditions which impoverish small producers and let migrant farmworkers be exploited and become the target of racism in many Italian countrysides. It explores, on the other side, the development of a new peasant civilization as alternative to the current economic and environmental crises, in terms of de-commodification of nature and labour, construction of a convivial democratic society, transition from monoculture to food sovereignty.

  20. Reparametrization in the path integral

    International Nuclear Information System (INIS)

    Storchak, S.N.

    1983-01-01

    The question of the invariance of a measure in the n-dimensional path integral under the path reparametrization is considered. The non-invariance of the measure through the jacobian is suggeste. After the path integral reparametrization the representatioq for the Green's function of the Hamilton operator in terms of the path integral with the classical Hamiltonian has been obtained

  1. The Global Optimal Algorithm of Reliable Path Finding Problem Based on Backtracking Method

    Directory of Open Access Journals (Sweden)

    Liang Shen

    2017-01-01

    Full Text Available There is a growing interest in finding a global optimal path in transportation networks particularly when the network suffers from unexpected disturbance. This paper studies the problem of finding a global optimal path to guarantee a given probability of arriving on time in a network with uncertainty, in which the travel time is stochastic instead of deterministic. Traditional path finding methods based on least expected travel time cannot capture the network user’s risk-taking behaviors in path finding. To overcome such limitation, the reliable path finding algorithms have been proposed but the convergence of global optimum is seldom addressed in the literature. This paper integrates the K-shortest path algorithm into Backtracking method to propose a new path finding algorithm under uncertainty. The global optimum of the proposed method can be guaranteed. Numerical examples are conducted to demonstrate the correctness and efficiency of the proposed algorithm.

  2. Which coordinate system for modelling path integration?

    Science.gov (United States)

    Vickerstaff, Robert J; Cheung, Allen

    2010-03-21

    Path integration is a navigation strategy widely observed in nature where an animal maintains a running estimate, called the home vector, of its location during an excursion. Evidence suggests it is both ancient and ubiquitous in nature, and has been studied for over a century. In that time, canonical and neural network models have flourished, based on a wide range of assumptions, justifications and supporting data. Despite the importance of the phenomenon, consensus and unifying principles appear lacking. A fundamental issue is the neural representation of space needed for biological path integration. This paper presents a scheme to classify path integration systems on the basis of the way the home vector records and updates the spatial relationship between the animal and its home location. Four extended classes of coordinate systems are used to unify and review both canonical and neural network models of path integration, from the arthropod and mammalian literature. This scheme demonstrates analytical equivalence between models which may otherwise appear unrelated, and distinguishes between models which may superficially appear similar. A thorough analysis is carried out of the equational forms of important facets of path integration including updating, steering, searching and systematic errors, using each of the four coordinate systems. The type of available directional cue, namely allothetic or idiothetic, is also considered. It is shown that on balance, the class of home vectors which includes the geocentric Cartesian coordinate system, appears to be the most robust for biological systems. A key conclusion is that deducing computational structure from behavioural data alone will be difficult or impossible, at least in the absence of an analysis of random errors. Consequently it is likely that further theoretical insights into path integration will require an in-depth study of the effect of noise on the four classes of home vectors. Copyright 2009 Elsevier Ltd

  3. MEASURING PATH DEPENDENCY

    Directory of Open Access Journals (Sweden)

    Peter Juhasz

    2017-03-01

    Full Text Available While risk management gained popularity during the last decades even some of the basic risk types are still far out of focus. One of these is path dependency that refers to the uncertainty of how we reach a certain level of total performance over time. While decision makers are careful in accessing how their position will look like the end of certain periods, little attention is given how they will get there through the period. The uncertainty of how a process will develop across a shorter period of time is often “eliminated” by simply choosing a longer planning time interval, what makes path dependency is one of the most often overlooked business risk types. After reviewing the origin of the problem we propose and compare seven risk measures to access path. Traditional risk measures like standard deviation of sub period cash flows fail to capture this risk type. We conclude that in most cases considering the distribution of the expected cash flow effect caused by the path dependency may offer the best method, but we may need to use several measures at the same time to include all the optimisation limits of the given firm

  4. Irreversible Conversion of a Water-Ethanol Solution into an Organized Two-Dimensional Network of Alternating Supramolecular Units in a Hydrophobic Zeolite under Pressure.

    Science.gov (United States)

    Arletti, Rossella; Fois, Ettore; Gigli, Lara; Vezzalini, Giovanna; Quartieri, Simona; Tabacchi, Gloria

    2017-02-13

    Turning disorder into organization is a key issue in science. By making use of X-ray powder diffraction and modeling studies, we show herein that high pressures in combination with the shape and space constraints of the hydrophobic all-silica zeolite ferrierite separate an ethanol-water liquid mixture into ethanol dimer wires and water tetramer squares. The confined supramolecular blocks alternate in a binary two-dimensional (2D) architecture that remains stable upon complete pressure release. These results support the combined use of high pressures and porous networks as a viable strategy for driving the organization of molecules or nano-objects towards complex, pre-defined patterns relevant for the realization of novel functional nanocomposites. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

  5. A novel communication mechanism based on node potential multi-path routing

    Science.gov (United States)

    Bu, Youjun; Zhang, Chuanhao; Jiang, YiMing; Zhang, Zhen

    2016-10-01

    With the network scales rapidly and new network applications emerge frequently, bandwidth supply for today's Internet could not catch up with the rapid increasing requirements. Unfortunately, irrational using of network sources makes things worse. Actual network deploys single-next-hop optimization paths for data transmission, but such "best effort" model leads to the imbalance use of network resources and usually leads to local congestion. On the other hand Multi-path routing can use the aggregation bandwidth of multi paths efficiently and improve the robustness of network, security, load balancing and quality of service. As a result, multi-path has attracted much attention in the routing and switching research fields and many important ideas and solutions have been proposed. This paper focuses on implementing the parallel transmission of multi next-hop data, balancing the network traffic and reducing the congestion. It aimed at exploring the key technologies of the multi-path communication network, which could provide a feasible academic support for subsequent applications of multi-path communication networking. It proposed a novel multi-path algorithm based on node potential in the network. And the algorithm can fully use of the network link resource and effectively balance network link resource utilization.

  6. Path optimization method for the sign problem

    Directory of Open Access Journals (Sweden)

    Ohnishi Akira

    2018-01-01

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

  7. Networking

    OpenAIRE

    Rauno Lindholm, Daniel; Boisen Devantier, Lykke; Nyborg, Karoline Lykke; Høgsbro, Andreas; Fries, de; Skovlund, Louise

    2016-01-01

    The purpose of this project was to examine what influencing factor that has had an impact on the presumed increasement of the use of networking among academics on the labour market and how it is expressed. On the basis of the influence from globalization on the labour market it can be concluded that the globalization has transformed the labour market into a market based on the organization of networks. In this new organization there is a greater emphasis on employees having social qualificati...

  8. Acupuncture and related therapies used as add-on or alternative to prokinetics for functional dyspepsia: overview of systematic reviews and network meta-analysis.

    Science.gov (United States)

    Ho, Robin S T; Chung, Vincent C H; Wong, Charlene H L; Wu, Justin C Y; Wong, Samuel Y S; Wu, Irene X Y

    2017-09-04

    Prokinetics for functional dyspepsia (FD) have relatively higher number needed to treat values. Acupuncture and related therapies could be used as add-on or alternative. An overview of systematic reviews (SRs) and network meta-analyses (NMA) were performed to evaluate the comparative effectiveness of different acupuncture and related therapies. We conducted a comprehensive literature search for SRs of randomized controlled trials (RCTs) in eight international and Chinese databases. Data from eligible RCTs were extracted for random effect pairwise meta-analyses. NMA was used to explore the most effective treatment among acupuncture and related therapies used alone or as add-on to prokinetics, compared to prokinetics alone. From five SRs, 22 RCTs assessing various acupuncture and related therapies were included. No serious adverse events were reported. Two pairwise meta-analyses showed manual acupuncture has marginally stronger effect in alleviating global FD symptoms, compared to domperidone or itopride. Results from NMA showed combination of manual acupuncture and clebopride has the highest probability in alleviating patient reported global FD symptom. Combination of manual acupuncture and clebopride has the highest probability of being the most effective treatment for FD symptoms. Patients who are contraindicated for prokinetics may use manual acupuncture or moxibustion as alternative. Future confirmatory comparative effectiveness trials should compare clebopride add-on manual acupuncture with domperidone add-on manual acupuncture and moxibustion.

  9. Evaluation of Electronic Commerce (E-Commerce with SWOT Analysis as an Alternative Network Marketing at Agricultural Marketing

    Directory of Open Access Journals (Sweden)

    Nuray Kızılaslan

    2015-07-01

    Full Text Available Compulsory competition occurring in the world trade has led the enterprises to different marketing system. Marketing problems seems to be a problem in Turkey rather than agricultural production problems. In this aspect, marketing alternatives are sought. E-commerce is a system with more opportunities in agricultural marketing. Increasing the applicability of this system in Turkey will eliminate many problems associated with marketing in agriculture. With an active use of E-commerce in agricultural marketing, it provides convenience at marketing products of agro-related industries agencies and producers and all country will have a potential market position. In this study, possibilities offered by e-commerce to the agricultural sector, opportunities, threats, deficiencies and contributions to agricultural sector have been addressed. Without the limitations of place and time via the internet and computers, establishing national and international supply and demand balance of e-commerce seems to play important roles in maintaining an active and alive marketing. Furthermore, it is an important tool in reducing agricultural marketing problems.

  10. Alternative splicing studies of the reactive oxygen species gene network in Populus reveal two isoforms of high-isoelectric-point superoxide dismutase.

    Science.gov (United States)

    Srivastava, Vaibhav; Srivastava, Manoj Kumar; Chibani, Kamel; Nilsson, Robert; Rouhier, Nicolas; Melzer, Michael; Wingsle, Gunnar

    2009-04-01

    Recent evidence has shown that alternative splicing (AS) is widely involved in the regulation of gene expression, substantially extending the diversity of numerous proteins. In this study, a subset of expressed sequence tags representing members of the reactive oxygen species gene network was selected from the PopulusDB database to investigate AS mechanisms in Populus. Examples of all known types of AS were detected, but intron retention was the most common. Interestingly, the closest Arabidopsis (Arabidopsis thaliana) homologs of half of the AS genes identified in Populus are not reportedly alternatively spliced. Two genes encoding the protein of most interest in our study (high-isoelectric-point superoxide dismutase [hipI-SOD]) have been found in black cottonwood (Populus trichocarpa), designated PthipI-SODC1 and PthipI-SODC2. Analysis of the expressed sequence tag libraries has indicated the presence of two transcripts of PthipI-SODC1 (hipI-SODC1b and hipI-SODC1s). Alignment of these sequences with the PthipI-SODC1 gene showed that hipI-SODC1b was 69 bp longer than hipI-SODC1s due to an AS event involving the use of an alternative donor splice site in the sixth intron. Transcript analysis showed that the splice variant hipI-SODC1b was differentially expressed, being clearly expressed in cambial and xylem, but not phloem, regions. In addition, immunolocalization and mass spectrometric data confirmed the presence of hipI-SOD proteins in vascular tissue. The functionalities of the spliced gene products were assessed by expressing recombinant hipI-SOD proteins and in vitro SOD activity assays.

  11. Alternative Splicing Studies of the Reactive Oxygen Species Gene Network in Populus Reveal Two Isoforms of High-Isoelectric-Point Superoxide Dismutase1[C][W

    Science.gov (United States)

    Srivastava, Vaibhav; Srivastava, Manoj Kumar; Chibani, Kamel; Nilsson, Robert; Rouhier, Nicolas; Melzer, Michael; Wingsle, Gunnar

    2009-01-01

    Recent evidence has shown that alternative splicing (AS) is widely involved in the regulation of gene expression, substantially extending the diversity of numerous proteins. In this study, a subset of expressed sequence tags representing members of the reactive oxygen species gene network was selected from the PopulusDB database to investigate AS mechanisms in Populus. Examples of all known types of AS were detected, but intron retention was the most common. Interestingly, the closest Arabidopsis (Arabidopsis thaliana) homologs of half of the AS genes identified in Populus are not reportedly alternatively spliced. Two genes encoding the protein of most interest in our study (high-isoelectric-point superoxide dismutase [hipI-SOD]) have been found in black cottonwood (Populus trichocarpa), designated PthipI-SODC1 and PthipI-SODC2. Analysis of the expressed sequence tag libraries has indicated the presence of two transcripts of PthipI-SODC1 (hipI-SODC1b and hipI-SODC1s). Alignment of these sequences with the PthipI-SODC1 gene showed that hipI-SODC1b was 69 bp longer than hipI-SODC1s due to an AS event involving the use of an alternative donor splice site in the sixth intron. Transcript analysis showed that the splice variant hipI-SODC1b was differentially expressed, being clearly expressed in cambial and xylem, but not phloem, regions. In addition, immunolocalization and mass spectrometric data confirmed the presence of hipI-SOD proteins in vascular tissue. The functionalities of the spliced gene products were assessed by expressing recombinant hipI-SOD proteins and in vitro SOD activity assays. PMID:19176719

  12. PathSys: integrating molecular interaction graphs for systems biology

    Directory of Open Access Journals (Sweden)

    Raval Alpan

    2006-02-01

    Full Text Available Abstract Background The goal of information integration in systems biology is to combine information from a number of databases and data sets, which are obtained from both high and low throughput experiments, under one data management scheme such that the cumulative information provides greater biological insight than is possible with individual information sources considered separately. Results Here we present PathSys, a graph-based system for creating a combined database of networks of interaction for generating integrated view of biological mechanisms. We used PathSys to integrate over 14 curated and publicly contributed data sources for the budding yeast (S. cerevisiae and Gene Ontology. A number of exploratory questions were formulated as a combination of relational and graph-based queries to the integrated database. Thus, PathSys is a general-purpose, scalable, graph-data warehouse of biological information, complete with a graph manipulation and a query language, a storage mechanism and a generic data-importing mechanism through schema-mapping. Conclusion Results from several test studies demonstrate the effectiveness of the approach in retrieving biologically interesting relations between genes and proteins, the networks connecting them, and of the utility of PathSys as a scalable graph-based warehouse for interaction-network integration and a hypothesis generator system. The PathSys's client software, named BiologicalNetworks, developed for navigation and analyses of molecular networks, is available as a Java Web Start application at http://brak.sdsc.edu/pub/BiologicalNetworks.

  13. Nonadiabatic transition path sampling

    International Nuclear Information System (INIS)

    Sherman, M. C.; Corcelli, S. A.

    2016-01-01

    Fewest-switches surface hopping (FSSH) is combined with transition path sampling (TPS) to produce a new method called nonadiabatic path sampling (NAPS). The NAPS method is validated on a model electron transfer system coupled to a Langevin bath. Numerically exact rate constants are computed using the reactive flux (RF) method over a broad range of solvent frictions that span from the energy diffusion (low friction) regime to the spatial diffusion (high friction) regime. The NAPS method is shown to quantitatively reproduce the RF benchmark rate constants over the full range of solvent friction. Integrating FSSH within the TPS framework expands the applicability of both approaches and creates a new method that will be helpful in determining detailed mechanisms for nonadiabatic reactions in the condensed-phase.

  14. Path diversity improves the identification of influential spreaders

    Science.gov (United States)

    Chen, Duan-Bing; Xiao, Rui; Zeng, An; Zhang, Yi-Cheng

    2013-12-01

    Identifying influential spreaders in complex networks is a crucial problem which relates to wide applications. Many methods based on the global information such as K-shell and PageRank have been applied to rank spreaders. However, most of the related previous works overwhelmingly focus on the number of paths for propagation, while whether the paths are diverse enough is usually overlooked. Generally, the spreading ability of a node might not be strong if its propagation depends on one or two paths while the other paths are dead ends. In this letter, we introduced the concept of path diversity and find that it can largely improve the ranking accuracy. We further propose a local method combining the information of path number and path diversity to identify influential nodes in complex networks. This method is shown to outperform many well-known methods in both undirected and directed networks. Moreover, the efficiency of our method makes it possible to apply it to very large systems.

  15. PATHS groundwater hydrologic model

    Energy Technology Data Exchange (ETDEWEB)

    Nelson, R.W.; Schur, J.A.

    1980-04-01

    A preliminary evaluation capability for two-dimensional groundwater pollution problems was developed as part of the Transport Modeling Task for the Waste Isolation Safety Assessment Program (WISAP). Our approach was to use the data limitations as a guide in setting the level of modeling detail. PATHS Groundwater Hydrologic Model is the first level (simplest) idealized hybrid analytical/numerical model for two-dimensional, saturated groundwater flow and single component transport; homogeneous geology. This document consists of the description of the PATHS groundwater hydrologic model. The preliminary evaluation capability prepared for WISAP, including the enhancements that were made because of the authors' experience using the earlier capability is described. Appendixes A through D supplement the report as follows: complete derivations of the background equations are provided in Appendix A. Appendix B is a comprehensive set of instructions for users of PATHS. It is written for users who have little or no experience with computers. Appendix C is for the programmer. It contains information on how input parameters are passed between programs in the system. It also contains program listings and test case listing. Appendix D is a definition of terms.

  16. Forces in Motzkin paths in a wedge

    International Nuclear Information System (INIS)

    Janse van Rensburg, E J

    2006-01-01

    Entropic forces in models of Motzkin paths in a wedge geometry are considered as models of forces in polymers in confined geometries. A Motzkin path in the square lattice is a path from the origin to a point in the line Y = X while it never visits sites below this line, and it is constrained to give unit length steps only in the north and east directions and steps of length √2 in the north-east direction. Motzkin path models may be generalized to ensembles of NE-oriented paths above the line Y = rX, where r > 0 is an irrational number. These are paths giving east, north and north-east steps from the origin in the square lattice, and confined to the r-wedge formed by the Y-axis and the line Y = rX. The generating function g r of these paths is not known, but if r > 1, then I determine its radius of convergence to be t r = min (r-1)/r≤y≤r/(r+1) [y y (1-r(1-y)) 1-r(1-y) (r(1-y)-y) r(1-y)-y ] and if r is an element of (0, 1), then t r = 1/3. The entropic force the path exerts on the line Y rX may be computed from this. An asymptotic expression for the force for large values of r is given by F(r) = log(2r)/r 2 - (1+2log(2r))/2r 3 + O (log(2r)/r 4 ). In terms of the vertex angle α of the r-wedge, the moment of the force about the origin has leading terms F(α) log(2/α) - (α/2)(1+2log(2/α)) + O(α 2 log(2/α)) as α → 0 + and F(α) = 0 if α is element of [π/4, π/2]. Moreover, numerical integration of the force shows that the total work done by closing the wedge is 1.085 07... lattice units. An alternative ensemble of NE-oriented paths may be defined by slightly changing the generating function g r . In this model, it is possible to determine closed-form expressions for the limiting free energy and the force. The leading term in an asymptotic expansions for this force agrees with the leading term in the asymptotic expansion of the above model, and the subleading term only differs by a factor of 2

  17. Integrated assignment and path planning

    Science.gov (United States)

    Murphey, Robert A.

    2005-11-01

    A surge of interest in unmanned systems has exposed many new and challenging research problems across many fields of engineering and mathematics. These systems have the potential of transforming our society by replacing dangerous and dirty jobs with networks of moving machines. This vision is fundamentally separate from the modern view of robotics in that sophisticated behavior is realizable not by increasing individual vehicle complexity, but instead through collaborative teaming that relies on collective perception, abstraction, decision making, and manipulation. Obvious examples where collective robotics will make an impact include planetary exploration, space structure assembly, remote and undersea mining, hazardous material handling and clean-up, and search and rescue. Nonetheless, the phenomenon driving this technology trend is the increasing reliance of the US military on unmanned vehicles, specifically, aircraft. Only a few years ago, following years of resistance to the use of unmanned systems, the military and civilian leadership in the United States reversed itself and have recently demonstrated surprisingly broad acceptance of increasingly pervasive use of unmanned platforms in defense surveillance, and even attack. However, as rapidly as unmanned systems have gained acceptance, the defense research community has discovered the technical pitfalls that lie ahead, especially for operating collective groups of unmanned platforms. A great deal of talent and energy has been devoted to solving these technical problems, which tend to fall into two categories: resource allocation of vehicles to objectives, and path planning of vehicle trajectories. An extensive amount of research has been conducted in each direction, yet, surprisingly, very little work has considered the integrated problem of assignment and path planning. This dissertation presents a framework for studying integrated assignment and path planning and then moves on to suggest an exact

  18. Shortest Paths and Vehicle Routing

    DEFF Research Database (Denmark)

    Petersen, Bjørn

    This thesis presents how to parallelize a shortest path labeling algorithm. It is shown how to handle Chvátal-Gomory rank-1 cuts in a column generation context. A Branch-and-Cut algorithm is given for the Elementary Shortest Paths Problem with Capacity Constraint. A reformulation of the Vehicle...... Routing Problem based on partial paths is presented. Finally, a practical application of finding shortest paths in the telecommunication industry is shown....

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

    Science.gov (United States)

    Koumakis, Lefteris; Kartsaki, Evgenia; Chatzimina, Maria; Zervakis, Michalis; Vassou, Despoina; Marias, Kostas; Moustakis, Vassilis; Potamias, George

    2016-01-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

  20. Understanding and applying open-path optical sensing data

    Science.gov (United States)

    Virag, Peter; Kricks, Robert J.

    1999-02-01

    During the last 10 years, open-path air monitors have evolved to yield reliable and effective measurements of single and multiple compounds on a real-time basis. To many individuals within the optical remote sensing community, the attributes of open-path and its the potential uses seem unlimited. Then why has the market has been stagnant for the last few years? The reason may center on how open-path information is applied and how well the end user understands that information. We constantly try to compare open-path data to risk/health or safety levels that are based for use at a single point and for a specific averaging period often far longer than a typical open-path data point. Often this approach is perceived as putting a square peg in a round hole. This perception may be well founded, as open-path data at times may need to go through extensive data manipulation and assumptions before it can be applied. This paper will review pervious open-path monitoring programs and their success in applying the data collected. We will also look at how open-path data is being currently used, some previous pitfalls in data use, alternate methods of data interpretation, and how open-path data can be best practically applied to fit current needs.

  1. Rocket Flight Path

    Directory of Open Access Journals (Sweden)

    Jamie Waters

    2014-09-01

    Full Text Available This project uses Newton’s Second Law of Motion, Euler’s method, basic physics, and basic calculus to model the flight path of a rocket. From this, one can find the height and velocity at any point from launch to the maximum altitude, or apogee. This can then be compared to the actual values to see if the method of estimation is a plausible. The rocket used for this project is modeled after Bullistic-1 which was launched by the Society of Aeronautics and Rocketry at the University of South Florida.

  2. JAVA PathFinder

    Science.gov (United States)

    Mehhtz, Peter

    2005-01-01

    JPF is an explicit state software model checker for Java bytecode. Today, JPF is a swiss army knife for all sort of runtime based verification purposes. This basically means JPF is a Java virtual machine that executes your program not just once (like a normal VM), but theoretically in all possible ways, checking for property violations like deadlocks or unhandled exceptions along all potential execution paths. If it finds an error, JPF reports the whole execution that leads to it. Unlike a normal debugger, JPF keeps track of every step how it got to the defect.

  3. Hamiltonian path integrals

    International Nuclear Information System (INIS)

    Prokhorov, L.V.

    1982-01-01

    Problems related to consideration of operator nonpermutability in Hamiltonian path integral (HPI) are considered in the review. Integrals are investigated using trajectories in configuration space (nonrelativistic quantum mechanics). Problems related to trajectory integrals in HPI phase space are discussed: the problem of operator nonpermutability consideration (extra terms problem) and corresponding equivalence rules; ambiguity of HPI usual recording; transition to curvilinear coordinates. Problem of quantization of dynamical systems with couplings has been studied. As in the case of canonical transformations, quantization of the systems with couplings of the first kind requires the consideration of extra terms

  4. Path to Prosperity

    OpenAIRE

    Wolfowitz,Paul

    2006-01-01

    Paul Wolfowitz, President of the World Bank, discussed Singapore's remarkable progress along the road from poverty to prosperity which has also been discovered by many other countries in East Asia and around the world. He spoke of how each country must find its own path for people to pursue the same dreams of the chance to go to school, the security of a good job, and the ability to provide a better future for their children. Throughout the world, and importantly in the developing world, ther...

  5. Fast orthogonal transforms and generation of Brownian paths.

    Science.gov (United States)

    Leobacher, Gunther

    2012-04-01

    We present a number of fast constructions of discrete Brownian paths that can be used as alternatives to principal component analysis and Brownian bridge for stratified Monte Carlo and quasi-Monte Carlo. By fast we mean that a path of length [Formula: see text] can be generated in [Formula: see text] floating point operations. We highlight some of the connections between the different constructions and we provide some numerical examples.

  6. Directed paths in a layered environment

    International Nuclear Information System (INIS)

    Alvarez, J; Janse van Rensburg, E J

    2008-01-01

    A polymer in a layered environment is modeled as a directed path in a layered square lattice composed of alternating A-layers of width w a and B-layers of width w b . In this paper we consider general cases of this model, where edges in the path interact with the layers, and vertices in the path interact with interfaces between adjacent layers. The phase diagram exhibits different regimes. In particular, we found that the path may be localized to one layer, be adsorbed on an interface between two layers or be delocalized across layers. We examine special aspects of the model in detail: the asymptotic regimes of the models are examined, and entropic forces on the interfaces are determined. We focus on several different cases, including models with layers of equal or similar width. More general models of layers with different but finite widths, or with one layer of infinite width, are also examined in detail. Several of these models exhibit phase behavior which relate to well-studied polymer phase behavior such as adsorption at an impenetrable wall, pinning at an interface between two immiscible solvents, steric stabilization of colloidal particles and sensitized flocculation of colloidal particles by polymers

  7. Optimal Path Planner for Mobile Robot in 2D Environment

    Directory of Open Access Journals (Sweden)

    Valeri Kroumov

    2004-06-01

    Full Text Available The problem of path planning for the case of a mobile robot moving in an environment filled with obstacles with known shapes and positions is studied. A path planner based on the genetic algorithm approach, which generates optimal in length path is proposed. The population member paths are generated by another algorithm, which uses for description of the obstacles an artificial annealing neural network and is based on potential field approach. The resulting path is piecewise linear with changing directions at the corners of the obstacles. Because of this feature, the inverse kinematics problems in controlling differential drive robots are simply solved: to drive the robot to some goal pose (x, y, theta, the robot can be spun in place until it is aimed at (x, y, then driven forward until it is at (x, y, and then spun in place until the required goal orientation

  8. Learning to improve path planning performance

    International Nuclear Information System (INIS)

    Chen, Pang C.

    1995-04-01

    In robotics, path planning refers to finding a short. collision-free path from an initial robot configuration to a desired configuratioin. It has to be fast to support real-time task-level robot programming. Unfortunately, current planning techniques are still too slow to be effective, as they often require several minutes, if not hours of computation. To remedy this situation, we present and analyze a learning algorithm that uses past experience to increase future performance. The algorithm relies on an existing path planner to provide solutions to difficult tasks. From these solutions, an evolving sparse network of useful robot configurations is learned to support faster planning. More generally, the algorithm provides a speedup-learning framework in which a slow but capable planner may be improved both cost-wise and capability-wise by a faster but less capable planner coupled with experience. The basic algorithm is suitable for stationary environments, and can be extended to accommodate changing environments with on-demand experience repair and object-attached experience abstraction. To analyze the algorithm, we characterize the situations in which the adaptive planner is useful, provide quantitative bounds to predict its behavior, and confirm our theoretical results with experiments in path planning of manipulators. Our algorithm and analysis are sufficiently, general that they may also be applied to other planning domains in which experience is useful

  9. Alternative security

    International Nuclear Information System (INIS)

    Weston, B.H.

    1990-01-01

    This book contains the following chapters: The Military and Alternative Security: New Missions for Stable Conventional Security; Technology and Alternative Security: A Cherished Myth Expires; Law and Alternative Security: Toward a Just World Peace; Politics and Alternative Security: Toward a More Democratic, Therefore More Peaceful, World; Economics and Alternative Security: Toward a Peacekeeping International Economy; Psychology and Alternative Security: Needs, Perceptions, and Misperceptions; Religion and Alternative Security: A Prophetic Vision; and Toward Post-Nuclear Global Security: An Overview

  10. MultiPaths Revisited - A novel approach using OpenFlow-enabled devices

    CERN Document Server

    Al-Shabibi, Ali; Martin, Brian

    2011-06-11

    This thesis presents novel approaches enhancing the performance of computer networks using multipaths. Our enhancements take the form of congestion-aware routing protocols. We present three protocols called MultiRoute, Step-Route, and finally PathRoute. Each of these protocols leverage both local and remote congestion statistics and build different representations (or views) of the network congestion by using an innovative representation of congestion for router-router links. These congestion statistics are then distributed via an aggregation protocol to other routers in the network. For many years, multipath routing protocols have only been used in simple situations, such as Link Aggregation and/or networks where paths of equal cost (and therefore equal delay) exist. But, paths of unequal costs are often discarded to the benefit of shortest path only routing because it is known that paths of unequal length present different delays and therefore cause out of order packets which cause catastrophic network per...

  11. Active Path Planning for Drones in Object Search

    OpenAIRE

    Wang, Zeyangyi

    2017-01-01

    Object searching is one of the most popular applications of unmanned aerial vehicles. Low cost small drones are particularly suited for surveying tasks in difficult conditions. With their limited on-board processing power and battery life, there is a need for more efficient search algorithm. The proposed path planning algorithm utilizes AZ-net, a deep learning network to process images captured on drones for adaptive flight path planning. Search simulation based on videos and actual experimen...

  12. Effect of random edge failure on the average path length

    Energy Technology Data Exchange (ETDEWEB)

    Guo Dongchao; Liang Mangui; Li Dandan; Jiang Zhongyuan, E-mail: mgliang58@gmail.com, E-mail: 08112070@bjtu.edu.cn [Institute of Information Science, Beijing Jiaotong University, 100044, Beijing (China)

    2011-10-14

    We study the effect of random removal of edges on the average path length (APL) in a large class of uncorrelated random networks in which vertices are characterized by hidden variables controlling the attachment of edges between pairs of vertices. A formula for approximating the APL of networks suffering random edge removal is derived first. Then, the formula is confirmed by simulations for classical ER (Erdoes and Renyi) random graphs, BA (Barabasi and Albert) networks, networks with exponential degree distributions as well as random networks with asymptotic power-law degree distributions with exponent {alpha} > 2. (paper)

  13. Decision paths in complex tasks

    Science.gov (United States)

    Galanter, Eugene

    1991-01-01

    Complex real world action and its prediction and control has escaped analysis by the classical methods of psychological research. The reason is that psychologists have no procedures to parse complex tasks into their constituents. Where such a division can be made, based say on expert judgment, there is no natural scale to measure the positive or negative values of the components. Even if we could assign numbers to task parts, we lack rules i.e., a theory, to combine them into a total task representation. We compare here two plausible theories for the amalgamation of the value of task components. Both of these theories require a numerical representation of motivation, for motivation is the primary variable that guides choice and action in well-learned tasks. We address this problem of motivational quantification and performance prediction by developing psychophysical scales of the desireability or aversiveness of task components based on utility scaling methods (Galanter 1990). We modify methods used originally to scale sensory magnitudes (Stevens and Galanter 1957), and that have been applied recently to the measure of task 'workload' by Gopher and Braune (1984). Our modification uses utility comparison scaling techniques which avoid the unnecessary assumptions made by Gopher and Braune. Formula for the utility of complex tasks based on the theoretical models are used to predict decision and choice of alternate paths to the same goal.

  14. Verifying the Relative Efficacy between Continuous Positive Airway Pressure Therapy and Its Alternatives for Obstructive Sleep Apnea: A Network Meta-analysis

    Directory of Open Access Journals (Sweden)

    Tingwei Liu

    2017-06-01

    Full Text Available Obstructive sleep apnea (OSA is a common breathing disorder, and continuous positive airway pressure (CPAP therapy together with its alternatives has been developed to treat this disease. This network meta-analysis (NMA was aimed to compare the efficacy of treatments for OSA. Cochrane Library, MEDLINE, and Embase were searched for eligible studies. A conventional and NMA was carried out to compare all therapies. Sleeping characteristics, including Apnea–Hypopnea Index (AHI, Epworth Sleepiness Scale (ESS, arterial oxygen saturation, and arousal index (AI, and changes of blood pressure were selected as outcomes. A total of 84 studies were finally included after rigorous screenings. For the primary outcomes of AHI and ESS, the value of auto-adjusting positive airway pressure (APAP, CPAP, and oral appliance (OA all showed statistically reduction compared with inactive control (IC. Similar observation was obtained in AI, with treatments of the three active interventions. A lower effect of IC in SaO2 was exhibited when compared with APAP, CPAP, and OA. Similar statistically significant results were presented in 24 h systolic blood pressure and 24 h DBP when comparing with CPAP. Our NMA identified CPAP as the most efficacious treatment for OSA patients after the evaluation of sleeping characteristics and blood pressures. In addition, more clinical trials are needed for further investigation due to the existence of inconsistency observed in this study.

  15. High-speed quantum networking by ship

    Science.gov (United States)

    Devitt, Simon J.; Greentree, Andrew D.; Stephens, Ashley M.; van Meter, Rodney

    2016-11-01

    Networked entanglement is an essential component for a plethora of quantum computation and communication protocols. Direct transmission of quantum signals over long distances is prevented by fibre attenuation and the no-cloning theorem, motivating the development of quantum repeaters, designed to purify entanglement, extending its range. Quantum repeaters have been demonstrated over short distances, but error-corrected, global repeater networks with high bandwidth require new technology. Here we show that error corrected quantum memories installed in cargo containers and carried by ship can provide a exible connection between local networks, enabling low-latency, high-fidelity quantum communication across global distances at higher bandwidths than previously proposed. With demonstrations of technology with sufficient fidelity to enable topological error-correction, implementation of the quantum memories is within reach, and bandwidth increases with improvements in fabrication. Our approach to quantum networking avoids technological restrictions of repeater deployment, providing an alternate path to a worldwide Quantum Internet.

  16. Secure Path Selection under Random Fading

    Directory of Open Access Journals (Sweden)

    Furqan Jameel

    2017-05-01

    Full Text Available Application-oriented Wireless Sensor Networks (WSNs promises to be one of the most useful technologies of this century. However, secure communication between nodes in WSNs is still an unresolved issue. In this context, we propose two protocols (i.e. Optimal Secure Path (OSP and Sub-optimal Secure Path (SSP to minimize the outage probability of secrecy capacity in the presence of multiple eavesdroppers. We consider dissimilar fading at the main and wiretap link and provide detailed evaluation of the impact of Nakagami-m and Rician-K factors on the secrecy performance of WSNs. Extensive simulations are performed to validate our findings. Although the optimal scheme ensures more security, yet the sub-optimal scheme proves to be a more practical approach to secure wireless links.

  17. Paths of Cultural Systems

    Directory of Open Access Journals (Sweden)

    Paul Ballonoff

    2017-12-01

    Full Text Available A theory of cultural structures predicts the objects observed by anthropologists. We here define those which use kinship relationships to define systems. A finite structure we call a partially defined quasigroup (or pdq, as stated by Definition 1 below on a dictionary (called a natural language allows prediction of certain anthropological descriptions, using homomorphisms of pdqs onto finite groups. A viable history (defined using pdqs states how an individual in a population following such history may perform culturally allowed associations, which allows a viable history to continue to survive. The vector states on sets of viable histories identify demographic observables on descent sequences. Paths of vector states on sets of viable histories may determine which histories can exist empirically.

  18. Propagators and path integrals

    Energy Technology Data Exchange (ETDEWEB)

    Holten, J.W. van

    1995-08-22

    Path-integral expressions for one-particle propagators in scalar and fermionic field theories are derived, for arbitrary mass. This establishes a direct connection between field theory and specific classical point-particle models. The role of world-line reparametrization invariance of the classical action and the implementation of the corresponding BRST-symmetry in the quantum theory are discussed. The presence of classical world-line supersymmetry is shown to lead to an unwanted doubling of states for massive spin-1/2 particles. The origin of this phenomenon is traced to a `hidden` topological fermionic excitation. A different formulation of the pseudo-classical mechanics using a bosonic representation of {gamma}{sub 5} is shown to remove these extra states at the expense of losing manifest supersymmetry. (orig.).

  19. innovation path exploration

    Directory of Open Access Journals (Sweden)

    Li Jian

    2016-01-01

    Full Text Available The world has entered the information age, all kinds of information technologies such as cloud technology, big data technology are in rapid development, and the “Internet plus” appeared. The main purpose of “Internet plus” is to provide an opportunity for the further development of the enterprise, the enterprise technology, business and other aspects of factors combine. For enterprises, grasp the “Internet plus” the impact of the market economy will undoubtedly pave the way for the future development of enterprises. This paper will be on the innovation path of the enterprise management “Internet plus” era tied you study, hope to be able to put forward some opinions and suggestions.

  20. Advance Network Reservation and Provisioning for Science

    Energy Technology Data Exchange (ETDEWEB)

    Balman, Mehmet; Chaniotakis, Evangelos; Shoshani, Arie; Sim, Alex

    2009-07-10

    We are witnessing a new era that offers new opportunities to conduct scientific research with the help of recent advancements in computational and storage technologies. Computational intensive science spans multiple scientific domains, such as particle physics, climate modeling, and bio-informatics simulations. These large-scale applications necessitate collaborators to access very large data sets resulting from simulations performed in geographically distributed institutions. Furthermore, often scientific experimental facilities generate massive data sets that need to be transferred to validate the simulation data in remote collaborating sites. A major component needed to support these needs is the communication infrastructure which enables high performance visualization, large volume data analysis, and also provides access to computational resources. In order to provide high-speed on-demand data access between collaborating institutions, national governments support next generation research networks such as Internet 2 and ESnet (Energy Sciences Network). Delivering network-as-a-service that provides predictable performance, efficient resource utilization and better coordination between compute and storage resources is highly desirable. In this paper, we study network provisioning and advanced bandwidth reservation in ESnet for on-demand high performance data transfers. We present a novel approach for path finding in time-dependent transport networks with bandwidth guarantees. We plan to improve the current ESnet advance network reservation system, OSCARS [3], by presenting to the clients, the possible reservation options and alternatives for earliest completion time and shortest transfer duration. The Energy Sciences Network (ESnet) provides high bandwidth connections between research laboratories and academic institutions for data sharing and video/voice communication. The ESnet On-Demand Secure Circuits and Advance Reservation System (OSCARS) establishes

  1. Inflation and balanced-path growth with alternative payment mechanisms

    Czech Academy of Sciences Publication Activity Database

    Gillman, M.; Kejak, Michal

    -, E2005/15 (2005), s. 1-34 ISSN 1749-6101 Institutional research plan: CEZ:AV0Z70850503 Keywords : inflation * payment mechanisms * human capital Subject RIV: AH - Economics http://www.cardiff.ac.uk/carbs/econ/ working papers/papers/2005_15.pdf

  2. Women Using Physics: Alternate Career Paths, The Private Sector

    Science.gov (United States)

    Tams, Jessica

    2006-12-01

    For those who have spent their careers inside the safe walls of academia, the word is a little scary. Can I compete? Will I fit in? What do I need to know? Am I prepared? Will I succeed? While many would say: Yes! You are ready to excel! This isn’t actually the case. The private sector comes with many unanticipated shocks to many of us, especially women. This isn’t a group project. This session will discuss entering a quickly growing and competitive technical field and what one can do to prepare for continued success. Preparing and Entering the Private Sector * Women with technical skills are a desired part of the private workforcein general women posses stronger people skills, are more reliable and often more well rounded than their male counterparts. Key factors we will discuss to landing that first job: · Expand your knowledge base with current applications of technology · Preparing a solid employment pitch to highlight strengths: Overcoming stereotypes · Don’t show them your bad side: Why some student projects may hurt you · The private sector attitude toward performance and entry level expectations Excelling in the Private Sector * Now that we have landed a job * for better or worse we are now all about making money and exerting control. What to keep in mind while working in the private sector: · The formative first years: focus on your weaknesses and practice, practice, practice · Men & Women in the workplace: what women subconsciously do to hurt their careers · Politics: Working in a team environment · Polish & Detail & Reliabilit

  3. Social contention in Denmark over alternative wind power development paths

    DEFF Research Database (Denmark)

    Nyborg, Sophie; Kirkegaard, Julia Kirch; Clausen, Laura Tolnov

    of Nørrekær Enge in Jutland. The paper traces protracted negotiations between a large energy company acting as wind farm developer who bought up dwellings to make space for extending an existing wind farm, land-owners, a farmers' association, and municipalities, as well as with an emergent coalition...

  4. Inflation and balanced-path growth with alternative payment mechanisms

    Czech Academy of Sciences Publication Activity Database

    Gillman, M.; Kejak, Michal

    -, 2004/2 (2004), s. 1-33. ISBN 978-963-9796-21-8. ISSN 1785-377X Institutional research plan: CEZ:AV0Z7085904 Keywords : human capital * cash-in-advance * interest-elasticity Subject RIV: AH - Economics http://econ.core.hu/doc/dp/dp/mtdp0402.pdf

  5. Inflation and balanced-path growth with alternative payment mechanisms

    Czech Academy of Sciences Publication Activity Database

    Gillman, M.; Kejak, Michal

    2005-01-01

    Roč. 115, č. 500 (2005), s. 247-270 ISSN 0013-0133 R&D Projects: GA ČR GA402/05/2172 Institutional research plan: CEZ:AV0Z70850503 Keywords : inflation * payment mechanisms Subject RIV: AH - Economics Impact factor: 1.440, year: 2005 http://www.blackwell-synergy.com/doi/full/10.1111/j.1468-0297.2004.00968.x

  6. Alternative additives; Alternative additiver

    Energy Technology Data Exchange (ETDEWEB)

    2007-08-15

    In this project a number of industrial and agricultural waste products have been characterised and evaluated in terms of alkali-getter performance. The intended use is for biomass-fired power stations aiming at reducing corrosion or slagging related problems. The following products have been obtained, characterised and evaluated: 1) Brewery draff 2) Danish de-gassed manure 3) Paper sludge 4) Moulding sand 5) Spent bleaching earth 6) Anorthosite 7) Sand 8) Clay-sludge. Most of the above alternative additive candidates are deemed unsuitable due to insufficient chemical effect and/or expensive requirements for pre-treatment (such as drying and transportation). 3 products were selected for full-scale testing: de-gassed manure, spent bleaching earth and clay slugde. The full scale tests were undertaken at the biomass-fired power stations in Koege, Slagelse and Ensted. Spent bleaching earth (SBE) and clay sludge were the only tested additive candidates that had a proven ability to react with KCl, to thereby reduce Cl-concentrations in deposits, and reduce the deposit flux to superheater tubes. Their performance was shown to nearly as good as commercial additives. De-gassed manure, however, did not evaluate positively due to inhibiting effects of Ca in the manure. Furthermore, de-gassed manure has a high concentration of heavy metals, which imposes a financial burden with regard to proper disposal of the ash by-products. Clay-sludge is a wet clay slurring, and drying and transportation of this product entails substantial costs. Spent bleaching does not require much pre-treatment and is therefore the most promising alternative additive. On the other hand, bleaching earth contains residual plant oil which means that a range of legislation relating to waste combustion comes into play. Not least a waste combustion fee of 330 DKK/tonne. For all alternative (and commercial) additives disposal costs of the increase ash by-products represents a significant cost. This is

  7. Path integral in Snyder space

    Energy Technology Data Exchange (ETDEWEB)

    Mignemi, S., E-mail: smignemi@unica.it [Dipartimento di Matematica e Informatica, Università di Cagliari, Viale Merello 92, 09123 Cagliari (Italy); INFN, Sezione di Cagliari, Cittadella Universitaria, 09042 Monserrato (Italy); Štrajn, R. [Dipartimento di Matematica e Informatica, Università di Cagliari, Viale Merello 92, 09123 Cagliari (Italy); INFN, Sezione di Cagliari, Cittadella Universitaria, 09042 Monserrato (Italy)

    2016-04-29

    The definition of path integrals in one- and two-dimensional Snyder space is discussed in detail both in the traditional setting and in the first-order formalism of Faddeev and Jackiw. - Highlights: • The definition of the path integral in Snyder space is discussed using phase space methods. • The same result is obtained in the first-order formalism of Faddeev and Jackiw. • The path integral formulation of the two-dimensional Snyder harmonic oscillator is outlined.

  8. Path integral in Snyder space

    International Nuclear Information System (INIS)

    Mignemi, S.; Štrajn, R.

    2016-01-01

    The definition of path integrals in one- and two-dimensional Snyder space is discussed in detail both in the traditional setting and in the first-order formalism of Faddeev and Jackiw. - Highlights: • The definition of the path integral in Snyder space is discussed using phase space methods. • The same result is obtained in the first-order formalism of Faddeev and Jackiw. • The path integral formulation of the two-dimensional Snyder harmonic oscillator is outlined.

  9. On optimal population paths

    CERN Document Server

    Lane, John S

    1977-01-01

    The overall purpose of this monograph is to integrate and critically evaluate the existing literature in the area of optimal joint savings population programs. The existing diverse presentations are all seen to be discussions within a unified framework. The central problem is to compare the desirability of alternative inter-temporal sequences of total savings and population sizes. Of critical importance is whether one regards persons as the fundamental moral entities or whether one takes Sidgwick's viewpoint that something good being the result of one's action is the baSic reason for dOing anything. The latter viewpoint is consistent with defining a complete social preference ordering over these alternative sequences. Since part of one's interest is to evaluate the consequences of various ethical beliefs a com­ parative study of several such orderings is presented; in particular the Mill-Wolfe average utilitarian, and Sidgwick-Meade classical utilitarian) formulations. A possible problem with the social pref...

  10. Support vector machine regression (LS-SVM)--an alternative to artificial neural networks (ANNs) for the analysis of quantum chemistry data?

    Science.gov (United States)

    Balabin, Roman M; Lomakina, Ekaterina I

    2011-06-28

    A multilayer feed-forward artificial neural network (MLP-ANN) with a single, hidden layer that contains a finite number of neurons can be regarded as a universal non-linear approximator. Today, the ANN method and linear regression (MLR) model are widely used for quantum chemistry (QC) data analysis (e.g., thermochemistry) to improve their accuracy (e.g., Gaussian G2-G4, B3LYP/B3-LYP, X1, or W1 theoretical methods). In this study, an alternative approach based on support vector machines (SVMs) is used, the least squares support vector machine (LS-SVM) regression. It has been applied to ab initio (first principle) and density functional theory (DFT) quantum chemistry data. So, QC + SVM methodology is an alternative to QC + ANN one. The task of the study was to estimate the Møller-Plesset (MPn) or DFT (B3LYP, BLYP, BMK) energies calculated with large basis sets (e.g., 6-311G(3df,3pd)) using smaller ones (6-311G, 6-311G*, 6-311G**) plus molecular descriptors. A molecular set (BRM-208) containing a total of 208 organic molecules was constructed and used for the LS-SVM training, cross-validation, and testing. MP2, MP3, MP4(DQ), MP4(SDQ), and MP4/MP4(SDTQ) ab initio methods were tested. Hartree-Fock (HF/SCF) results were also reported for comparison. Furthermore, constitutional (CD: total number of atoms and mole fractions of different atoms) and quantum-chemical (QD: HOMO-LUMO gap, dipole moment, average polarizability, and quadrupole moment) molecular descriptors were used for the building of the LS-SVM calibration model. Prediction accuracies (MADs) of 1.62 ± 0.51 and 0.85 ± 0.24 kcal mol(-1) (1 kcal mol(-1) = 4.184 kJ mol(-1)) were reached for SVM-based approximations of ab initio and DFT energies, respectively. The LS-SVM model was more accurate than the MLR model. A comparison with the artificial neural network approach shows that the accuracy of the LS-SVM method is similar to the accuracy of ANN. The extrapolation and interpolation results show that LS-SVM is

  11. A numerical scheme for optimal transition paths of stochastic chemical kinetic systems

    International Nuclear Information System (INIS)

    Liu Di

    2008-01-01

    We present a new framework for finding the optimal transition paths of metastable stochastic chemical kinetic systems with large system size. The optimal transition paths are identified to be the most probable paths according to the Large Deviation Theory of stochastic processes. Dynamical equations for the optimal transition paths are derived using the variational principle. A modified Minimum Action Method (MAM) is proposed as a numerical scheme to solve the optimal transition paths. Applications to Gene Regulatory Networks such as the toggle switch model and the Lactose Operon Model in Escherichia coli are presented as numerical examples

  12. Alternative Fuel News: Official Publication of the U.S. Department of Energy's Clean Cities Network and the Alternative Fuels Data Center; Vol. 5, No. 1

    Energy Technology Data Exchange (ETDEWEB)

    LaRocque, T.

    2001-04-18

    A quarterly magazine with articles on recent changes to the Clean Cities Program; the SuperTruck student engineering challenge; alternative fuel use in delivery fleets; and a propane vehicle rally and conference in February 2001, in Kansas City, Mo.

  13. Two Generations of Path Dependence

    DEFF Research Database (Denmark)

    Madsen, Mogens Ove

      Even if there is no fully articulated and generally accepted theory of Path Dependence it has eagerly been taken up across a wide range of social sciences - primarily coming from economics. Path Dependence is most of all a metaphor that offers reason to believe, that some political, social...

  14. Chromatic roots and hamiltonian paths

    DEFF Research Database (Denmark)

    Thomassen, Carsten

    2000-01-01

    We present a new connection between colorings and hamiltonian paths: If the chromatic polynomial of a graph has a noninteger root less than or equal to t(n) = 2/3 + 1/3 (3)root (26 + 6 root (33)) + 1/3 (3)root (26 - 6 root (33)) = 1.29559.... then the graph has no hamiltonian path. This result...

  15. On Hilbert space of paths

    International Nuclear Information System (INIS)

    Exner, P.; Kolerov, G.I.

    1980-01-01

    A Hilbert space of paths, the elements of which are determined by trigonometric series, was proposed and used recently by Truman. This space is shown to consist precisely of all absolutely continuous paths ending in the origin with square-integrable derivatives

  16. Network clustering coefficient approach to DNA sequence analysis

    Energy Technology Data Exchange (ETDEWEB)

    Gerhardt, Guenther J.L. [Universidade Federal do Rio Grande do Sul-Hospital de Clinicas de Porto Alegre, Rua Ramiro Barcelos 2350/sala 2040/90035-003 Porto Alegre (Brazil); Departamento de Fisica e Quimica da Universidade de Caxias do Sul, Rua Francisco Getulio Vargas 1130, 95001-970 Caxias do Sul (Brazil); Lemke, Ney [Programa Interdisciplinar em Computacao Aplicada, Unisinos, Av. Unisinos, 950, 93022-000 Sao Leopoldo, RS (Brazil); Corso, Gilberto [Departamento de Biofisica e Farmacologia, Centro de Biociencias, Universidade Federal do Rio Grande do Norte, Campus Universitario, 59072 970 Natal, RN (Brazil)]. E-mail: corso@dfte.ufrn.br

    2006-05-15

    In this work we propose an alternative DNA sequence analysis tool based on graph theoretical concepts. The methodology investigates the path topology of an organism genome through a triplet network. In this network, triplets in DNA sequence are vertices and two vertices are connected if they occur juxtaposed on the genome. We characterize this network topology by measuring the clustering coefficient. We test our methodology against two main bias: the guanine-cytosine (GC) content and 3-bp (base pairs) periodicity of DNA sequence. We perform the test constructing random networks with variable GC content and imposed 3-bp periodicity. A test group of some organisms is constructed and we investigate the methodology in the light of the constructed random networks. We conclude that the clustering coefficient is a valuable tool since it gives information that is not trivially contained in 3-bp periodicity neither in the variable GC content.

  17. Hard paths, soft paths or no paths? Cross-cultural perceptions of water solutions

    Science.gov (United States)

    Wutich, A.; White, A. C.; White, D. D.; Larson, K. L.; Brewis, A.; Roberts, C.

    2014-01-01

    In this study, we examine how development status and water scarcity shape people's perceptions of "hard path" and "soft path" water solutions. Based on ethnographic research conducted in four semi-rural/peri-urban sites (in Bolivia, Fiji, New Zealand, and the US), we use content analysis to conduct statistical and thematic comparisons of interview data. Our results indicate clear differences associated with development status and, to a lesser extent, water scarcity. People in the two less developed sites were more likely to suggest hard path solutions, less likely to suggest soft path solutions, and more likely to see no path to solutions than people in the more developed sites. Thematically, people in the two less developed sites envisioned solutions that involve small-scale water infrastructure and decentralized, community-based solutions, while people in the more developed sites envisioned solutions that involve large-scale infrastructure and centralized, regulatory water solutions. People in the two water-scarce sites were less likely to suggest soft path solutions and more likely to see no path to solutions (but no more likely to suggest hard path solutions) than people in the water-rich sites. Thematically, people in the two water-rich sites seemed to perceive a wider array of unrealized potential soft path solutions than those in the water-scarce sites. On balance, our findings are encouraging in that they indicate that people are receptive to soft path solutions in a range of sites, even those with limited financial or water resources. Our research points to the need for more studies that investigate the social feasibility of soft path water solutions, particularly in sites with significant financial and natural resource constraints.

  18. Teacher Perspectives on the Implementation of the PATHS Curriculum

    Science.gov (United States)

    Honess, Andrea; Hunter, Deborah

    2014-01-01

    The research was designed to add to the UK-based literature around the Promoting Alternative Thinking Strategies (PATHS) curriculum, a whole school emotional literacy and social competence intervention. Seven semi-structured interviews were carried out with class teachers and pastoral leads. Questionnaires were designed to explore a number of…

  19. Efficient Routing in Wireless Sensor Networks with Multiple Sessions

    Directory of Open Access Journals (Sweden)

    Dianjie Lu

    2014-05-01

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

  20. Appendices for: Improper Signaling in Two-Path Relay Channels

    KAUST Repository

    Gaafar, Mohamed

    2016-12-01

    This document contains the appendices for the work in “Improper Signaling in Two-Path Relay Channels,” which is submitted to 2017 IEEE International Conference on Communications (ICC) Workshop on Full-Duplex Communications for Future Wireless Networks, Paris, France.

  1. Appendices for: Improper Signaling in Two-Path Relay Channels

    KAUST Repository

    Gaafar, Mohamed; Amin, Osama; Schaefer, Rafael F.; Alouini, Mohamed-Slim

    2016-01-01

    This document contains the appendices for the work in “Improper Signaling in Two-Path Relay Channels,” which is submitted to 2017 IEEE International Conference on Communications (ICC) Workshop on Full-Duplex Communications for Future Wireless Networks, Paris, France.

  2. Effective caching of shortest paths for location-based services

    DEFF Research Database (Denmark)

    Jensen, Christian S.; Thomsen, Jeppe Rishede; Yiu, Man Lung

    2012-01-01

    Web search is ubiquitous in our daily lives. Caching has been extensively used to reduce the computation time of the search engine and reduce the network traffic beyond a proxy server. Another form of web search, known as online shortest path search, is popular due to advances in geo...

  3. Optimal Paths in Gliding Flight

    Science.gov (United States)

    Wolek, Artur

    Underwater gliders are robust and long endurance ocean sampling platforms that are increasingly being deployed in coastal regions. This new environment is characterized by shallow waters and significant currents that can challenge the mobility of these efficient (but traditionally slow moving) vehicles. This dissertation aims to improve the performance of shallow water underwater gliders through path planning. The path planning problem is formulated for a dynamic particle (or "kinematic car") model. The objective is to identify the path which satisfies specified boundary conditions and minimizes a particular cost. Several cost functions are considered. The problem is addressed using optimal control theory. The length scales of interest for path planning are within a few turn radii. First, an approach is developed for planning minimum-time paths, for a fixed speed glider, that are sub-optimal but are guaranteed to be feasible in the presence of unknown time-varying currents. Next the minimum-time problem for a glider with speed controls, that may vary between the stall speed and the maximum speed, is solved. Last, optimal paths that minimize change in depth (equivalently, maximize range) are investigated. Recognizing that path planning alone cannot overcome all of the challenges associated with significant currents and shallow waters, the design of a novel underwater glider with improved capabilities is explored. A glider with a pneumatic buoyancy engine (allowing large, rapid buoyancy changes) and a cylindrical moving mass mechanism (generating large pitch and roll moments) is designed, manufactured, and tested to demonstrate potential improvements in speed and maneuverability.

  4. Alternative Remedies

    Science.gov (United States)

    ... Home › Aging & Health A to Z › Alternative Remedies Font ... medical treatment prescribed by their healthcare provider. Using this type of alternative therapy along with traditional treatments is ...

  5. Alternative Fuels

    Science.gov (United States)

    Alternative fuels include gaseous fuels such as hydrogen, natural gas, and propane; alcohols such as ethanol, methanol, and butanol; vegetable and waste-derived oils; and electricity. Overview of alternative fuels is here.

  6. Alternating Hemiplegia

    Science.gov (United States)

    ... to the symptoms of the disorder. View Full Definition Treatment Drug therapy including verapamil may help to reduce the ... the more serious form of alternating hemiplegia × ... Definition Alternating hemiplegia is a rare neurological disorder that ...

  7. A Networks Approach to Modeling Enzymatic Reactions.

    Science.gov (United States)

    Imhof, P

    2016-01-01

    Modeling enzymatic reactions is a demanding task due to the complexity of the system, the many degrees of freedom involved and the complex, chemical, and conformational transitions associated with the reaction. Consequently, enzymatic reactions are not determined by precisely one reaction pathway. Hence, it is beneficial to obtain a comprehensive picture of possible reaction paths and competing mechanisms. By combining individually generated intermediate states and chemical transition steps a network of such pathways can be constructed. Transition networks are a discretized representation of a potential energy landscape consisting of a multitude of reaction pathways connecting the end states of the reaction. The graph structure of the network allows an easy identification of the energetically most favorable pathways as well as a number of alternative routes. © 2016 Elsevier Inc. All rights reserved.

  8. Perfect discretization of path integrals

    International Nuclear Information System (INIS)

    Steinhaus, Sebastian

    2012-01-01

    In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

  9. Perfect discretization of path integrals

    Science.gov (United States)

    Steinhaus, Sebastian

    2012-05-01

    In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

  10. Bioprinting: Functional droplet networks

    Science.gov (United States)

    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.

  11. An Introduction to Path Analysis

    Science.gov (United States)

    Wolfe, Lee M.

    1977-01-01

    The analytical procedure of path analysis is described in terms of its use in nonexperimental settings in the social sciences. The description assumes a moderate statistical background on the part of the reader. (JKS)

  12. Probabilistic simulation of fermion paths

    International Nuclear Information System (INIS)

    Zhirov, O.V.

    1989-01-01

    Permutation symmetry of fermion path integral allows (while spin degrees of freedom are ignored) to use in its simulation any probabilistic algorithm, like Metropolis one, heat bath, etc. 6 refs., 2 tabs

  13. Effective distances for epidemics spreading on complex networks

    Science.gov (United States)

    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.

  14. The Path Ahead

    Science.gov (United States)

    Tuszynski, Jack A.; Woolf, Nancy

    This chapter provides an introduction to the rest of the book, which has a multidisciplinary approach to the physics of consciousness. We summarize the various contributions and present our own point of view, which is that there are some deficiencies in defining higher-order consciousness in strict terms of classic physics. We favor a proposal that considers some aspects of quantum-mechanical operations among molecules involved with neurotransmission and mechanical transport of synaptic proteins. In our view, the wiring of the brain is not as complex, and certainly not as integrated, as commonly assumed. Instead, the wiring pattern redundantly obeys a few general principles focused on high resolution rather than crossmodal integration. Basing cognitive functions, such as higher-order consciousness, solely on electrophysiological responses in neural networks thus wired may not suffice. On the other hand, coherent quantum computing, executed by tubulins, the protein subunits of microtubules, may exert en masse influences over the transport of many receptor and scaffolding proteins to various activated synapses, thereby accounting for the unity of conscious experience. We discuss the potential problems of quantum computing, such as decoherence, and also present counterarguments, as well as recent empirical results consistent with the notion that quantum computing in the interiors of neurons, in particular, within the interiors of dendrites may indeed be possible.

  15. Perfect discretization of path integrals

    OpenAIRE

    Steinhaus, Sebastian

    2011-01-01

    In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discu...

  16. Path integration in conical space

    International Nuclear Information System (INIS)

    Inomata, Akira; Junker, Georg

    2012-01-01

    Quantum mechanics in conical space is studied by the path integral method. It is shown that the curvature effect gives rise to an effective potential in the radial path integral. It is further shown that the radial path integral in conical space can be reduced to a form identical with that in flat space when the discrete angular momentum of each partial wave is replaced by a specific non-integral angular momentum. The effective potential is found proportional to the squared mean curvature of the conical surface embedded in Euclidean space. The path integral calculation is compatible with the Schrödinger equation modified with the Gaussian and the mean curvature. -- Highlights: ► We study quantum mechanics on a cone by the path integral approach. ► The path integral depends only on the metric and the curvature effect is built in. ► The approach is consistent with the Schrödinger equation modified by an effective potential. ► The effective potential is found to be of the “Jensen–Koppe” and “da Costa” type.

  17. Path integrals on curved manifolds

    International Nuclear Information System (INIS)

    Grosche, C.; Steiner, F.

    1987-01-01

    A general framework for treating path integrals on curved manifolds is presented. We also show how to perform general coordinate and space-time transformations in path integrals. The main result is that one has to subtract a quantum correction ΔV ∝ ℎ 2 from the classical Lagrangian L, i.e. the correct effective Lagrangian to be used in the path integral is L eff = L-ΔV. A general prescription for calculating the quantum correction ΔV is given. It is based on a canonical approach using Weyl-ordering and the Hamiltonian path integral defined by the midpoint prescription. The general framework is illustrated by several examples: The d-dimensional rotator, i.e. the motion on the sphere S d-1 , the path integral in d-dimensional polar coordinates, the exact treatment of the hydrogen atom in R 2 and R 3 by performing a Kustaanheimo-Stiefel transformation, the Langer transformation and the path integral for the Morse potential. (orig.)

  18. Graphene-based battery electrodes having continuous flow paths

    Science.gov (United States)

    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.

  19. Non-Gasoline Alternative Fueling Stations

    Data.gov (United States)

    Department of Homeland Security — Through a nationwide network of local coalitions, Clean Citiesprovides project assistance to help stakeholders in the public and private sectors deploy alternative...

  20. Settling Payments Fast and Private: Efficient Decentralized Routing for Path-Based Transactions

    OpenAIRE

    Roos, Stefanie; Moreno-Sanchez, Pedro; Kate, Aniket; Goldberg, Ian

    2017-01-01

    Path-based transaction (PBT) networks, which settle payments from one user to another via a path of intermediaries, are a growing area of research. They overcome the scalability and privacy issues in cryptocurrencies like Bitcoin and Ethereum by replacing expensive and slow on-chain blockchain operations with inexpensive and fast off-chain transfers. In the form of credit networks such as Ripple and Stellar, they also enable low-price real-time gross settlements across different currencies. F...

  1. The shortest-path problem analysis and comparison of methods

    CERN Document Server

    Ortega-Arranz, Hector; Gonzalez-Escribano, Arturo

    2014-01-01

    Many applications in different domains need to calculate the shortest-path between two points in a graph. In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques. Since several of these improvements involve subtle changes to the search space, it may be difficult to appreciate their benefits in terms of time or space requirements. To make methods more comprehensive and to facilitate their co

  2. Cyclic subway networks are less risky in metropolises

    Science.gov (United States)

    Xiao, Ying; Zhang, Hai-Tao; Xu, Bowen; Zhu, Tao; Chen, Guanrong; Chen, Duxin

    2018-02-01

    Subways are crucial in modern transportation systems of metropolises. To quantitatively evaluate the potential risks of subway networks suffered from natural disasters or deliberate attacks, real data from seven Chinese subway systems are collected and their population distributions and anti-risk capabilities are analyzed. Counterintuitively, it is found that transfer stations with large numbers of connections are not the most crucial, but the stations and lines with large betweenness centrality are essential, if subway networks are being attacked. It is also found that cycles reduce such correlations due to the existence of alternative paths. To simulate the data-based observations, a network model is proposed to characterize the dynamics of subway systems under various intensities of attacks on stations and lines. This study sheds some light onto risk assessment of subway networks in metropolitan cities.

  3. Nuclear energy: a sensible alternative

    International Nuclear Information System (INIS)

    Ott, K.O.; Spinrad, B.I.

    1985-01-01

    This book presents information on energy futures; energy demand, energy supplies; exclusive paths and difficult choices--hard, soft, and moderate energy paths; an energy-deficient society; energy shortages; economics of light-water reactors; fast breeder reactor economics; international cooperation in the nuclear field; nuclear recycling; alternative fuels, fuel cycles, and reactors; the nuclear weapons proliferation issue; paths to a world with more reliable nuclear safeguards; the homemade bomb issue; LWR risk assessment; accident analysis and risk assessment; the waste disposal risk; radon problems; risks in our society; health effects of low-level radiation; routine releases of radioactivity from the nuclear industry; low-level radioactivity and infant mortality; the myth of plutonium toxicity; myths about high-level radioactive waste; the aging reactor myth; the police state myth; insurance and nuclear power--the Price-Anderson Act; and solar and nuclear power as partners

  4. Path integration on hyperbolic spaces

    Energy Technology Data Exchange (ETDEWEB)

    Grosche, C [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik

    1991-11-01

    Quantum mechanics on the hyperbolic spaces of rank one is discussed by path integration technique. Hyperbolic spaces are multi-dimensional generalisation of the hyperbolic plane, i.e. the Poincare upper half-plane endowed with a hyperbolic geometry. We evalute the path integral on S{sub 1} {approx equal} SO (n,1)/SO(n) and S{sub 2} {approx equal} SU(n,1)/S(U(1) x U(n)) in a particular coordinate system, yielding explicitly the wave-functions and the energy spectrum. Futhermore we can exploit a general property of all these spaces, namely that they can be parametrized by a pseudopolar coordinate system. This allows a separation in path integration over spheres and an additional path integration over the remaining hyperbolic coordinate, yielding effectively a path integral for a modified Poeschl-Teller potential. Only continuous spectra can exist in all the cases. For all the hyperbolic spaces of rank one we find a general formula for the largest lower bound (zero-point energy) of the spectrum which is given by E{sub O} = h{sup 2} /8m(m{sub {alpha}} +2m{sub 2} {alpha}){sup 2} (m {alpha} and m{sub 2}{alpha} denote the dimension of the root subspace corresponding to the roots {alpha} and 2{alpha}, respectively). I also discuss the case, where a constant magnetic field on H{sup n} is incorporated. (orig.).

  5. Path integration on hyperbolic spaces

    International Nuclear Information System (INIS)

    Grosche, C.

    1991-11-01

    Quantum mechanics on the hyperbolic spaces of rank one is discussed by path integration technique. Hyperbolic spaces are multi-dimensional generalisation of the hyperbolic plane, i.e. the Poincare upper half-plane endowed with a hyperbolic geometry. We evalute the path integral on S 1 ≅ SO (n,1)/SO(n) and S 2 ≅ SU(n,1)/S[U(1) x U(n)] in a particular coordinate system, yielding explicitly the wave-functions and the energy spectrum. Futhermore we can exploit a general property of all these spaces, namely that they can be parametrized by a pseudopolar coordinate system. This allows a separation in path integration over spheres and an additional path integration over the remaining hyperbolic coordinate, yielding effectively a path integral for a modified Poeschl-Teller potential. Only continuous spectra can exist in all the cases. For all the hyperbolic spaces of rank one we find a general formula for the largest lower bound (zero-point energy) of the spectrum which is given by E O = h 2 /8m(m α +2m 2 α) 2 (m α and m 2 α denote the dimension of the root subspace corresponding to the roots α and 2α, respectively). I also discuss the case, where a constant magnetic field on H n is incorporated. (orig.)

  6. A Dynamic Hidden Forwarding Path Planning Method Based on Improved Q-Learning in SDN Environments

    Directory of Open Access Journals (Sweden)

    Yun Chen

    2018-01-01

    Full Text Available Currently, many methods are available to improve the target network’s security. The vast majority of them cannot obtain an optimal attack path and interdict it dynamically and conveniently. Almost all defense strategies aim to repair known vulnerabilities or limit services in target network to improve security of network. These methods cannot response to the attacks in real-time because sometimes they need to wait for manufacturers releasing corresponding countermeasures to repair vulnerabilities. In this paper, we propose an improved Q-learning algorithm to plan an optimal attack path directly and automatically. Based on this path, we use software-defined network (SDN to adjust routing paths and create hidden forwarding paths dynamically to filter vicious attack requests. Compared to other machine learning algorithms, Q-learning only needs to input the target state to its agents, which can avoid early complex training process. We improve Q-learning algorithm in two aspects. First, a reward function based on the weights of hosts and attack success rates of vulnerabilities is proposed, which can adapt to different network topologies precisely. Second, we remove the actions and merge them into every state that reduces complexity from O(N3 to O(N2. In experiments, after deploying hidden forwarding paths, the security of target network is boosted significantly without having to repair network vulnerabilities immediately.

  7. Alternative wastewatersystems

    DEFF Research Database (Denmark)

    Dyck-Madsen, Søren; Hoffmann, Birgitte; Gabriel, Søren

    1999-01-01

    The report:-  Communicates experiences from Swedish buildings from the establishment and running of alternative wastewater systems. Communicates pictures of alternative buildings and wastewater systems in Sweden. Gives a short evaluation of the performance and the sustainability of the systems....

  8. Computing paths and cycles in biological interaction graphs

    Directory of Open Access Journals (Sweden)

    von Kamp Axel

    2009-06-01

    Full Text Available Abstract Background Interaction graphs (signed directed graphs provide an important qualitative modeling approach for Systems Biology. They enable the analysis of causal relationships in cellular networks and can even be useful for predicting qualitative aspects of systems dynamics. Fundamental issues in the analysis of interaction graphs are the enumeration of paths and cycles (feedback loops and the calculation of shortest positive/negative paths. These computational problems have been discussed only to a minor extent in the context of Systems Biology and in particular the shortest signed paths problem requires algorithmic developments. Results We first review algorithms for the enumeration of paths and cycles and show that these algorithms are superior to a recently proposed enumeration approach based on elementary-modes computation. The main part of this work deals with the computation of shortest positive/negative paths, an NP-complete problem for which only very few algorithms are described in the literature. We propose extensions and several new algorithm variants for computing either exact results or approximations. Benchmarks with various concrete biological networks show that exact results can sometimes be obtained in networks with several hundred nodes. A class of even larger graphs can still be treated exactly by a new algorithm combining exhaustive and simple search strategies. For graphs, where the computation of exact solutions becomes time-consuming or infeasible, we devised an approximative algorithm with polynomial complexity. Strikingly, in realistic networks (where a comparison with exact results was possible this algorithm delivered results that are very close or equal to the exact values. This phenomenon can probably be attributed to the particular topology of cellular signaling and regulatory networks which contain a relatively low number of negative feedback loops. Conclusion The calculation of shortest positive

  9. Path Integrals in Quantum Mechanics

    International Nuclear Information System (INIS)

    Louko, J

    2005-01-01

    Jean Zinn-Justin's textbook Path Integrals in Quantum Mechanics aims to familiarize the reader with the path integral as a calculational tool in quantum mechanics and field theory. The emphasis is on quantum statistical mechanics, starting with the partition function Tr exp(-β H) and proceeding through the diffusion equation to barrier penetration problems and their semiclassical limit. The 'real time' path integral is defined via analytic continuation and used for the path-integral representation of the nonrelativistic S-matrix and its perturbative expansion. Holomorphic and Grassmannian path integrals are introduced and applied to nonrelativistic quantum field theory. There is also a brief discussion of path integrals in phase space. The introduction includes a brief historical review of path integrals, supported by a bibliography with some 40 entries. As emphasized in the introduction, mathematical rigour is not a central issue in the book. This allows the text to present the calculational techniques in a very readable manner: much of the text consists of worked-out examples, such as the quartic anharmonic oscillator in the barrier penetration chapter. At the end of each chapter there are exercises, some of which are of elementary coursework type, but the majority are more in the style of extended examples. Most of the exercises indeed include the solution or a sketch thereof. The book assumes minimal previous knowledge of quantum mechanics, and some basic quantum mechanical notation is collected in an appendix. The material has a large overlap with selected chapters in the author's thousand-page textbook Quantum Field Theory and Critical Phenomena (2002 Oxford: Clarendon). The stand-alone scope of the present work has, however, allowed a more focussed organization of this material, especially in the chapters on, respectively, holomorphic and Grassmannian path integrals. In my view the book accomplishes its aim admirably and is eminently usable as a textbook

  10. From path integrals to anyons

    International Nuclear Information System (INIS)

    Canright, G.S.

    1992-01-01

    I offer a pedagogical review of the homotopy arguments for fractional statistics in two dimensions. These arguments arise naturally in path-integral language since they necessarily consider the properties of paths rather than simply permutations. The braid group replaces the permutation group as the basic structure for quantum statistics; hence properties of the braid group on several surfaces are briefly discussed. Finally, the question of multiple (real-space) occupancy is addressed; I suggest that the ''traditional'' treatment of this question (ie, an assumption that many-anyon wavefunctions necessarily vanish for multiple occupancy) needs reexamination

  11. Jarzynski equality in the context of maximum path entropy

    Science.gov (United States)

    González, Diego; Davis, Sergio

    2017-06-01

    In the global framework of finding an axiomatic derivation of nonequilibrium Statistical Mechanics from fundamental principles, such as the maximum path entropy - also known as Maximum Caliber principle -, this work proposes an alternative derivation of the well-known Jarzynski equality, a nonequilibrium identity of great importance today due to its applications to irreversible processes: biological systems (protein folding), mechanical systems, among others. This equality relates the free energy differences between two equilibrium thermodynamic states with the work performed when going between those states, through an average over a path ensemble. In this work the analysis of Jarzynski's equality will be performed using the formalism of inference over path space. This derivation highlights the wide generality of Jarzynski's original result, which could even be used in non-thermodynamical settings such as social systems, financial and ecological systems.

  12. Isomorphisms and traversability of directed path graphs

    NARCIS (Netherlands)

    Broersma, Haitze J.; Li, Xueliang; Li, X.

    1998-01-01

    The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\\forw P_k(D)$ of a digraph $D$ is obtained by representing the directed paths on $k$ vertices of $D$ by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in $D$

  13. Network Ambivalence

    Directory of Open Access Journals (Sweden)

    Patrick Jagoda

    2015-08-01

    Full Text Available The language of networks now describes everything from the Internet to the economy to terrorist organizations. In distinction to a common view of networks as a universal, originary, or necessary form that promises to explain everything from neural structures to online traffic, this essay emphasizes the contingency of the network imaginary. Network form, in its role as our current cultural dominant, makes scarcely imaginable the possibility of an alternative or an outside uninflected by networks. If so many things and relationships are figured as networks, however, then what is not a network? If a network points towards particular logics and qualities of relation in our historical present, what others might we envision in the future? In  many ways, these questions are unanswerable from within the contemporary moment. Instead of seeking an avant-garde approach (to move beyond networks or opting out of networks (in some cases, to recover elements of pre-networked existence, this essay proposes a third orientation: one of ambivalence that operates as a mode of extreme presence. I propose the concept of "network aesthetics," which can be tracked across artistic media and cultural forms, as a model, style, and pedagogy for approaching interconnection in the twenty-first century. The following essay is excerpted from Network Ambivalence (Forthcoming from University of Chicago Press. 

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

    Science.gov (United States)

    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.

  15. Data center networks and network architecture

    Science.gov (United States)

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

  16. Constraint-Based Local Search for Constrained Optimum Paths Problems

    Science.gov (United States)

    Pham, Quang Dung; Deville, Yves; van Hentenryck, Pascal

    Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algorithms, which are often hard to extend with side constraints and to apply widely. This paper proposes a constraint-based local search (CBLS) framework for COP applications, bringing the compositionality, reuse, and extensibility at the core of CBLS and CP systems. The modeling contribution is the ability to express compositional models for various COP applications at a high level of abstraction, while cleanly separating the model and the search procedure. The main technical contribution is a connected neighborhood based on rooted spanning trees to find high-quality solutions to COP problems. The framework, implemented in COMET, is applied to Resource Constrained Shortest Path (RCSP) problems (with and without side constraints) and to the edge-disjoint paths problem (EDP). Computational results show the potential significance of the approach.

  17. How alternative are alternative fuels?

    OpenAIRE

    Soffritti, Tiziana; Danielis, Romeo

    1998-01-01

    Could alternative fuel vehicles contribute to a substantial reduction of air pollution? Is there a market for alternative fuel vehicles? Could a market be created via a pollution tax? The article answers these questions on the basis of the available estimates.

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

    Directory of Open Access Journals (Sweden)

    Hyunseok Park

    Full Text Available 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.

  19. Alternative detox.

    Science.gov (United States)

    Ernst, E

    2012-01-01

    The concept that alternative therapies can eliminate toxins and toxicants from the body, i.e. 'alternative detox' (AD) is popular. Selected textbooks and articles on the subject of AD. The principles of AD make no sense from a scientific perspective and there is no clinical evidence to support them. The promotion of AD treatments provides income for some entrepreneurs but has the potential to cause harm to patients and consumers. In alternative medicine, simplistic but incorrect concepts such as AD abound. AREAS TIMELY FOR RESEARCH: All therapeutic claims should be scientifically tested before being advertised-and AD cannot be an exception.

  20. Adaptive Dynamics, Control, and Extinction in Networked Populations

    Science.gov (United States)

    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

  1. Minimum dose method for walking-path planning of nuclear facilities

    International Nuclear Information System (INIS)

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

    2015-01-01

    Highlights: • For radiation environment, the environment model is proposed. • For the least dose walking path problem, a path-planning method is designed. • The path-planning virtual–real mixed simulation program is developed. • The program can plan walking path and simulate. - Abstract: A minimum dose method based on staff walking road network model was proposed for the walking-path planning in nuclear facilities. A virtual–reality simulation program was developed using C# programming language and Direct X engine. The simulation program was used in simulations dealing with virtual nuclear facilities. Simulation results indicated that the walking-path planning method was effective in providing safety for people walking in nuclear facilities

  2. Networks of recyclable material waste-picker’s cooperatives: An alternative for the solid waste management in the city of Rio de Janeiro

    Energy Technology Data Exchange (ETDEWEB)

    Tirado-Soto, Magda Martina, E-mail: magda@pep.ufrj.br [Program of Production Engineering, School and Research in Engineering, Federal University of Rio de Janeiro (Brazil); Zamberlan, Fabio Luiz, E-mail: fabio@pep.ufrj.br [Program of Production Engineering, School and Research in Engineering, Federal University of Rio de Janeiro (Brazil)

    2013-04-15

    Highlights: ► In the marketing of recyclable materials, the waste-pickers are the least wins. ► It is proposed creating a network of recycling cooperatives to achieve viability. ► The waste-pickers contribute to waste management to the city. - Abstract: The objective of this study is to discuss the role of networks formed of waste-picker cooperatives in ameliorating problems of final disposal of solid waste in the city of Rio de Janeiro, since the city’s main landfill will soon have to close because of exhausted capacity. However, it is estimated that in the city of Rio de Janeiro there are around five thousand waste-pickers working in poor conditions, with lack of physical infrastructure and training, but contributing significantly by diverting solid waste from landfills. According to the Sustainable Development Indicators (IBGE, 2010a,b) in Brazil, recycling rates hover between 45% and 55%. In the municipality of Rio de Janeiro, only 1% of the waste produced is collected selectively by the government (COMLURB, 2010), demonstrating that recycling is mainly performed by waste-pickers. Furthermore, since the recycling market is an oligopsony that requires economies of scale to negotiate directly with industries, the idea of working in networks of cooperatives meets the demands for joint marketing of recyclable materials. Thus, this work presents a method for creating and structuring a network of recycling cooperatives, with prior training for working in networks, so that the expected synergies and joint efforts can lead to concrete results. We intend to demonstrate that it is first essential to strengthen the waste-pickers’ cooperatives in terms of infrastructure, governance and training so that solid waste management can be environmentally, socially and economically sustainable in the city of Rio de Janeiro.

  3. Networks of recyclable material waste-picker’s cooperatives: An alternative for the solid waste management in the city of Rio de Janeiro

    International Nuclear Information System (INIS)

    Tirado-Soto, Magda Martina; Zamberlan, Fabio Luiz

    2013-01-01

    Highlights: ► In the marketing of recyclable materials, the waste-pickers are the least wins. ► It is proposed creating a network of recycling cooperatives to achieve viability. ► The waste-pickers contribute to waste management to the city. - Abstract: The objective of this study is to discuss the role of networks formed of waste-picker cooperatives in ameliorating problems of final disposal of solid waste in the city of Rio de Janeiro, since the city’s main landfill will soon have to close because of exhausted capacity. However, it is estimated that in the city of Rio de Janeiro there are around five thousand waste-pickers working in poor conditions, with lack of physical infrastructure and training, but contributing significantly by diverting solid waste from landfills. According to the Sustainable Development Indicators (IBGE, 2010a,b) in Brazil, recycling rates hover between 45% and 55%. In the municipality of Rio de Janeiro, only 1% of the waste produced is collected selectively by the government (COMLURB, 2010), demonstrating that recycling is mainly performed by waste-pickers. Furthermore, since the recycling market is an oligopsony that requires economies of scale to negotiate directly with industries, the idea of working in networks of cooperatives meets the demands for joint marketing of recyclable materials. Thus, this work presents a method for creating and structuring a network of recycling cooperatives, with prior training for working in networks, so that the expected synergies and joint efforts can lead to concrete results. We intend to demonstrate that it is first essential to strengthen the waste-pickers’ cooperatives in terms of infrastructure, governance and training so that solid waste management can be environmentally, socially and economically sustainable in the city of Rio de Janeiro

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

    Science.gov (United States)

    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

  5. Improving network management with Software Defined Networking

    International Nuclear Information System (INIS)

    Dzhunev, Pavel

    2013-01-01

    Software-defined networking (SDN) is developed as an alternative to closed networks in centers for data processing by providing a means to separate the control layer data layer switches, and routers. SDN introduces new possibilities for network management and configuration methods. In this article, we identify problems with the current state-of-the-art network configuration and management mechanisms and introduce mechanisms to improve various aspects of network management

  6. DiversePathsJ: diverse shortest paths for bioimage analysis.

    Science.gov (United States)

    Uhlmann, Virginie; Haubold, Carsten; Hamprecht, Fred A; Unser, Michael

    2018-02-01

    We introduce a formulation for the general task of finding diverse shortest paths between two end-points. Our approach is not linked to a specific biological problem and can be applied to a large variety of images thanks to its generic implementation as a user-friendly ImageJ/Fiji plugin. It relies on the introduction of additional layers in a Viterbi path graph, which requires slight modifications to the standard Viterbi algorithm rules. This layered graph construction allows for the specification of various constraints imposing diversity between solutions. The software allows obtaining a collection of diverse shortest paths under some user-defined constraints through a convenient and user-friendly interface. It can be used alone or be integrated into larger image analysis pipelines. http://bigwww.epfl.ch/algorithms/diversepathsj. michael.unser@epfl.ch or fred.hamprecht@iwr.uni-heidelberg.de. Supplementary data are available at Bioinformatics online. © The Author(s) 2017. Published by Oxford University Press.

  7. The Japanese energy sector: Current situation, and future paths

    International Nuclear Information System (INIS)

    Takase, Kae; Suzuki, Tatsujiro

    2011-01-01

    As the world's third leading economy and a major importer of fuels, the choice of future energy paths and policies that Japan makes in the next few years will have a significant influence on the energy security of the world as a whole, and of the Northeast Asia region in particular. In this article we describe the current status of and recent trends in the Japanese energy sector, including energy demand and supply by fuel and by sector. We then discuss the current energy policy situation in Japan, focusing on policies related to climate change targets, renewable energy development and deployment, liberalization of energy markets, and the evolution of the Japanese nuclear power sector. The final section of the article presents the structure of the Japan LEAP (long-range energy alternatives planning software system) dataset, describes several alternative energy paths for Japan - with an emphasis on alternative paths for nuclear power development and GHG emission abatement - and touches upon key current issues of energy policy facing Japan, as reflected in the modeling inputs and results.

  8. Physical Layer Security Using Two-Path Successive Relaying

    Directory of Open Access Journals (Sweden)

    Qian Yu Liau

    2016-06-01

    Full Text Available Relaying is one of the useful techniques to enhance wireless physical-layer security. Existing literature shows that employing full-duplex relay instead of conventional half-duplex relay improves secrecy capacity and secrecy outage probability, but this is at the price of sophisticated implementation. As an alternative, two-path successive relaying has been proposed to emulate operation of full-duplex relay by scheduling a pair of half-duplex relays to assist the source transmission alternately. However, the performance of two-path successive relaying in secrecy communication remains unexplored. This paper proposes a secrecy two-path successive relaying protocol for a scenario with one source, one destination and two half-duplex relays. The relays operate alternately in a time division mode to forward messages continuously from source to destination in the presence of an eavesdropper. Analytical results reveal that the use of two half-duplex relays in the proposed scheme contributes towards a quadratically lower probability of interception compared to full-duplex relaying. Numerical simulations show that the proposed protocol achieves the ergodic achievable secrecy rate of full-duplex relaying while delivering the lowest probability of interception and secrecy outage probability compared to the existing half duplex relaying, full duplex relaying and full duplex jamming schemes.

  9. The Japanese energy sector: Current situation, and future paths

    Energy Technology Data Exchange (ETDEWEB)

    Takase, Kae, E-mail: kae@gdl.jp [Governance Design Laboratory, Inc., 2301 City Tower Bashamichi 5-71 Onoe-cho, Naka-ku, Yokohama, Kanagawa 231-0015 (Japan); Suzuki, Tatsujiro [University of Tokyo, Graduate School of Public Policy, 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-0081 (Japan)

    2011-11-15

    As the world's third leading economy and a major importer of fuels, the choice of future energy paths and policies that Japan makes in the next few years will have a significant influence on the energy security of the world as a whole, and of the Northeast Asia region in particular. In this article we describe the current status of and recent trends in the Japanese energy sector, including energy demand and supply by fuel and by sector. We then discuss the current energy policy situation in Japan, focusing on policies related to climate change targets, renewable energy development and deployment, liberalization of energy markets, and the evolution of the Japanese nuclear power sector. The final section of the article presents the structure of the Japan LEAP (long-range energy alternatives planning software system) dataset, describes several alternative energy paths for Japan - with an emphasis on alternative paths for nuclear power development and GHG emission abatement - and touches upon key current issues of energy policy facing Japan, as reflected in the modeling inputs and results.

  10. Networks of recyclable material waste-picker's cooperatives: an alternative for the solid waste management in the city of Rio de Janeiro.

    Science.gov (United States)

    Tirado-Soto, Magda Martina; Zamberlan, Fabio Luiz

    2013-04-01

    The objective of this study is to discuss the role of networks formed of waste-picker cooperatives in ameliorating problems of final disposal of solid waste in the city of Rio de Janeiro, since the city's main landfill will soon have to close because of exhausted capacity. However, it is estimated that in the city of Rio de Janeiro there are around five thousand waste-pickers working in poor conditions, with lack of physical infrastructure and training, but contributing significantly by diverting solid waste from landfills. According to the Sustainable Development Indicators (IBGE, 2010a,b) in Brazil, recycling rates hover between 45% and 55%. In the municipality of Rio de Janeiro, only 1% of the waste produced is collected selectively by the government (COMLURB, 2010), demonstrating that recycling is mainly performed by waste-pickers. Furthermore, since the recycling market is an oligopsony that requires economies of scale to negotiate directly with industries, the idea of working in networks of cooperatives meets the demands for joint marketing of recyclable materials. Thus, this work presents a method for creating and structuring a network of recycling cooperatives, with prior training for working in networks, so that the expected synergies and joint efforts can lead to concrete results. We intend to demonstrate that it is first essential to strengthen the waste-pickers' cooperatives in terms of infrastructure, governance and training so that solid waste management can be environmentally, socially and economically sustainable in the city of Rio de Janeiro. Copyright © 2012 Elsevier Ltd. All rights reserved.

  11. Common Virtual Path and Its Expedience for VBR Video Traffic

    Directory of Open Access Journals (Sweden)

    E. Chromy

    2008-04-01

    Full Text Available The paper deals with utilization of common Virtual Path (VP for variable bit rate (VBR video service. Video service is one of the main services for broadband networks. Research is oriented to statistical properties of common and separate VPs. Separate VP means that for each VBR traffic source one VP will be allocated. Common VP means that for multiple VBR sources one common VP is allocated. VBR video traffic source is modeled by discrete Markov chain.

  12. Field-controlled randomness of colloidal paths on a magnetic bubble lattice

    International Nuclear Information System (INIS)

    Jungnickel, C; Fischer, Th M; Khattari, Z; Johansen, T H

    2011-01-01

    Paramagnetic colloidal particles move in the potential energy landscape of a magnetically modulated bubble lattice of a magnetic garnet film. The modulation causes the energy minima to alternate between positions above the centres of the bubbles and interstitial positions. The particles deterministically follow the time-dependent positions of the energy minima until the minima become unstable in one or several directions and allow the particles to hop to a new minimum. We control the time delay between instabilities of the minima in alternative directions by the angle of the external magnetic field with the crystallographic directions of the bubble lattice. When the time delay is large, the particles deterministically hop to the next minimum along the direction that becomes unstable first. When the time delay is short, diffusion of the particle in the marginal potential randomizes the choice of the hopping directions or the choice of the transport network. Gradual changes of the external field direction from 0 0 to 30 0 lead to a continuous crossover from a deterministic to a fully stochastic path of the colloids.

  13. Enhancement of cortical network activity in vitro and promotion of GABAergic neurogenesis by stimulation with an electromagnetic field with a 150 MHz carrier wave pulsed with an alternating 10 and 16 Hz modulation.

    Directory of Open Access Journals (Sweden)

    Alexandra eGramowski-Voss

    2015-07-01

    Full Text Available In recent years, various stimuli were identified capable of enhancing neurogenesis, a process which is dysfunctional in the senescent brain and in neurodegenerative and certain neuropsychiatric diseases. Applications of electromagnetic fields to brain tissue have been shown to affect cellular properties and their importance for therapies in medicine is recognized.In this study, differentiating murine cortical networks on multiwell microelectrode arrays were repeatedly exposed to an extremely low electromagnetic field (ELEMF with alternating 10 and 16 Hz frequencies piggy-backed onto a 150 MHz carrier frequency. The ELEMF exposure stimulated the electrical network activity and intensified the structure of bursts. Further, the exposure with an electromagnetic field within the first 28 days of the differentiation the network activity induced also reorganization within the burst structure. This effect was already most pronounced at 14 days in vitro after 10 days of exposure. Overall, the development of cortical activity under these conditions was accelerated. These functional electrophysiological changes were accompanied by morphological ones. The percentage of neurons in the neuron glia co-culture was increased without affecting the total number of cells, indicating an enhancement of neurogenesis. The ELEMF exposure selectively promoted the proliferation of a particular population of neurons, evidenced by the increased proportion of GABAergic neurons. The results support the initial hypothesis that this kind of ELEMF stimulation is a treatment option for specific indications with promising potential for CNS applications, especially for degenerative diseases such as Alzheimer’s disease and other dementias.

  14. Cortical hubs form a module for multisensory integration on top of the hierarchy of cortical networks

    Directory of Open Access Journals (Sweden)

    Gorka Zamora-López

    2010-03-01

    Full Text Available Sensory stimuli entering the nervous system follow particular paths of processing, typically separated (segregated from the paths of other modal information. However, sensory perception, awareness and cognition emerge from the combination of information (integration. The corticocortical networks of cats and macaque monkeys display three prominent characteristics: (i modular organisation (facilitating the segregation, (ii abundant alternative processing paths and (iii the presence of highly connected hubs. Here, we study in detail the organisation and potential function of the cortical hubs by graph analysis and information theoretical methods. We find that the cortical hubs form a spatially delocalised, but topologically central module with the capacity to integrate multisensory information in a collaborative manner. With this, we resolve the underlying anatomical substrate that supports the simultaneous capacity of the cortex to segregate and to integrate multisensory information.

  15. Stochastic control with rough paths

    International Nuclear Information System (INIS)

    Diehl, Joscha; Friz, Peter K.; Gassiat, Paul

    2017-01-01

    We study a class of controlled differential equations driven by rough paths (or rough path realizations of Brownian motion) in the sense of Lyons. It is shown that the value function satisfies a HJB type equation; we also establish a form of the Pontryagin maximum principle. Deterministic problems of this type arise in the duality theory for controlled diffusion processes and typically involve anticipating stochastic analysis. We make the link to old work of Davis and Burstein (Stoch Stoch Rep 40:203–256, 1992) and then prove a continuous-time generalization of Roger’s duality formula [SIAM J Control Optim 46:1116–1132, 2007]. The generic case of controlled volatility is seen to give trivial duality bounds, and explains the focus in Burstein–Davis’ (and this) work on controlled drift. Our study of controlled rough differential equations also relates to work of Mazliak and Nourdin (Stoch Dyn 08:23, 2008).

  16. Stochastic control with rough paths

    Energy Technology Data Exchange (ETDEWEB)

    Diehl, Joscha [University of California San Diego (United States); Friz, Peter K., E-mail: friz@math.tu-berlin.de [TU & WIAS Berlin (Germany); Gassiat, Paul [CEREMADE, Université Paris-Dauphine, PSL Research University (France)

    2017-04-15

    We study a class of controlled differential equations driven by rough paths (or rough path realizations of Brownian motion) in the sense of Lyons. It is shown that the value function satisfies a HJB type equation; we also establish a form of the Pontryagin maximum principle. Deterministic problems of this type arise in the duality theory for controlled diffusion processes and typically involve anticipating stochastic analysis. We make the link to old work of Davis and Burstein (Stoch Stoch Rep 40:203–256, 1992) and then prove a continuous-time generalization of Roger’s duality formula [SIAM J Control Optim 46:1116–1132, 2007]. The generic case of controlled volatility is seen to give trivial duality bounds, and explains the focus in Burstein–Davis’ (and this) work on controlled drift. Our study of controlled rough differential equations also relates to work of Mazliak and Nourdin (Stoch Dyn 08:23, 2008).

  17. Path modeling and process control

    DEFF Research Database (Denmark)

    Høskuldsson, Agnar; Rodionova, O.; Pomerantsev, A.

    2007-01-01

    and having three or more stages. The methods are applied to a process control of a multi-stage production process having 25 variables and one output variable. When moving along the process, variables change their roles. It is shown how the methods of path modeling can be applied to estimate variables...... be performed regarding the foreseeable output property y, and with respect to an admissible range of correcting actions for the parameters of the next stage. In this paper the basic principles of path modeling is presented. The mathematics is presented for processes having only one stage, having two stages...... of the next stage with the purpose of obtaining optimal or almost optimal quality of the output variable. An important aspect of the methods presented is the possibility of extensive graphic analysis of data that can provide the engineer with a detailed view of the multi-variate variation in data....

  18. Critical path method applied to research project planning: Fire Economics Evaluation System (FEES)

    Science.gov (United States)

    Earl B. Anderson; R. Stanton Hales

    1986-01-01

    The critical path method (CPM) of network analysis (a) depicts precedence among the many activities in a project by a network diagram; (b) identifies critical activities by calculating their starting, finishing, and float times; and (c) displays possible schedules by constructing time charts. CPM was applied to the development of the Forest Service's Fire...

  19. Cosmic alternatives?

    Science.gov (United States)

    Gregory, Ruth

    2009-04-01

    "Cosmologists are often in error but never in doubt." This pithy characterization by the Soviet physicist Lev Landau sums up the raison d'être of Facts and Speculations in Cosmology. Authors Jayant Narlikar and Geoffrey Burbidge are proponents of a "steady state" theory of cosmology, and they argue that the cosmological community has become fixated on a "Big Bang" dogma, suppressing alternative viewpoints. This book very much does what it says on the tin: it sets out what is known in cosmology, and puts forward the authors' point of view on an alternative to the Big Bang.

  20. Factorization-algebraization-path integration

    International Nuclear Information System (INIS)

    Inomata, A.; Wilson, R.

    1986-01-01

    The authors review the method of factorization proposed by Schroedinger of a quantum mechanical second-order linear differential equation into a product of two first-order differential operators, often referred to as ladder operators, as well as the modifications made to Schroedinger's method by Infeld and Hull. They then review the group theoretical treatments proposed by Miller of the Schroedinger-Infeld-Hull factorizations and go on to demonstrate the application of dynamical symmetry to path integral calculations. 30 references

  1. The path of code linting

    CERN Multimedia

    CERN. Geneva

    2017-01-01

    Join the path of code linting and discover how it can help you reach higher levels of programming enlightenment. Today we will cover how to embrace code linters to offload cognitive strain on preserving style standards in your code base as well as avoiding error-prone constructs. Additionally, I will show you the journey ahead for integrating several code linters in the programming tools your already use with very little effort.

  2. Career path for operations personnel

    International Nuclear Information System (INIS)

    Asher, J.A.

    1985-01-01

    This paper explains how selected personnel can now obtain a Bachelor of Science degree in Physics with a Nuclear Power Operations option. The program went into effect the Fall of 1984. Another program was worked out in 1982 whereby students attending the Nuclear Operators Training Program could obtain an Associates of Science degree in Mechanical Engineering Technology at the end of two years of study. This paper presents tables and charts which describe these programs and outline the career path for operators

  3. Conditionally solvable path integral problems

    International Nuclear Information System (INIS)

    Grosche, C.

    1995-05-01

    Some specific conditionally exactly solvable potentials are discussed within the path integral formalism. They generalize the usually known potentials by the incorporation of a fractional power behaviour and strongly anharmonic terms. We find four different kinds of such potentials, the first is related to the Coulomb potential, the second is an anharmonic confinement potential, and the third and the fourth are related to the Manning-Rosen potential. (orig.)

  4. Path integrals in curvilinear coordinates

    International Nuclear Information System (INIS)

    Prokhorov, L.V.

    1984-01-01

    Integration limits are studied for presenting the path integral curvilinear coordinates. For spherical (and topoloqically equivalent) coordinates it is shown that in formulas involving classical action in the exponent integration over all variables should be carried out within infinite limits. Another peculiarity is associated with appearance of the operator q which provides a complete definition of the wave functions out of the physical region. arguments are given upporting the validity of the cited statament in the general case

  5. Polygonal-path approximations on the path spaces of quantum-mechanical systems: properties of the polygonal paths

    International Nuclear Information System (INIS)

    Exner, P.; Kolerov, G.I.

    1981-01-01

    Properties of the subset of polygonal paths in the Hilbert space H of paths referring to a d-dimensional quantum-mechanical system are examined. Using the reproduction kernel technique we prove that each element of H is approximated by polygonal paths uniformly with respect to the ''norm'' of time-interval partitions. This result will be applied in the second part of the present paper to prove consistency of the uniform polygonal-path extension of the Feynman maps [ru

  6. Path Integrals in Quantum Mechanics

    International Nuclear Information System (INIS)

    Chetouani, L

    2005-01-01

    By treating path integrals the author, in this book, places at the disposal of the reader a modern tool for the comprehension of standard quantum mechanics. Thus the most important applications, such as the tunnel effect, the diffusion matrix, etc, are presented from an original point of view on the action S of classical mechanics while having it play a central role in quantum mechanics. What also emerges is that the path integral describes these applications more richly than are described traditionally by differential equations, and consequently explains them more fully. The book is certainly of high quality in all aspects: original in presentation, rigorous in the demonstrations, judicious in the choice of exercises and, finally, modern, for example in the treatment of the tunnel effect by the method of instantons. Moreover, the correspondence that exists between classical and quantum mechanics is well underlined. I thus highly recommend this book (the French version being already available) to those who wish to familiarize themselves with formulation by path integrals. They will find, in addition, interesting topics suitable for exploring further. (book review)

  7. Nonperturbative path integral expansion II

    International Nuclear Information System (INIS)

    Kaiser, H.J.

    1976-05-01

    The Feynman path integral representation of the 2-point function for a self-interacting Bose field is investigated using an expansion ('Path Integral Expansion', PIE) of the exponential of the kinetic term of the Lagrangian. This leads to a series - illustrated by a graph scheme - involving successively a coupling of more and more points of the lattice space commonly employed in the evaluation of path integrals. The values of the individual PIE graphs depend of course on the lattice constant. Two methods - Pade approximation and Borel-type extrapolation - are proposed to extract information about the continuum limit from a finite-order PIE. A more flexible PIE is possible by expanding besides the kinetic term a suitably chosen part of the interaction term too. In particular, if the co-expanded part is a mass term the calculation becomes only slightly more complicated than in the original formulation and the appearance of the graph scheme is unchanged. A significant reduction of the number of graphs and an improvement of the convergence of the PIE can be achieved by performing certain sums over an infinity of graph elements. (author)

  8. Distribution definition of path integrals

    International Nuclear Information System (INIS)

    Kerler, W.

    1979-01-01

    By starting from quantum mechanics it turns out that a rather general definition of quantum functional integrals can be given which is based on distribution theory. It applies also to curved space and provides clear rules for non-linear transformations. The refinements necessary in usual definitions of path integrals are pointed out. Since the quantum nature requires special care with time sequences, it is not the classical phase space which occurs in the phase-space form of the path integral. Feynman's configuration-space form only applies to a highly specialized situation, and therefore is not a very advantageous starting point for general investigations. It is shown that the commonly used substitutions of variables do not properly account for quantum effects. The relation to the traditional ordering problem is clarified. The distribution formulation has allowed to treat constrained systems directly at the quantum level, to complete the path integral formulation of the equivalence theorem, and to define functional integrals also for space translation after the transition to fields. (orig.)

  9. Critiques of World-Systems Analysis and Alternatives: Unequal Exchange and Three Forms of Class and Struggle in the Japan–US Silk Network, 1880–1890

    Directory of Open Access Journals (Sweden)

    Elson E. Boles

    2015-08-01

    Full Text Available Sympathetic critics of world-system analysis contend that its systemic level of abstraction results in one-sided generalizations of systemic change. Unequal exchange theory and commodity chain analysis similarly reduce distinct and historical forms of labor and their interrelationships to common functional and ahistorical essences. This paper applies an incorporated comparisons method to give historical content to an understanding of unequal exchange and global inequality through a study of the Japan–US silk network’s formation and change during the mid 1880–1890s. Analysis of unequal exchange processes requires, in this case, an examination of the mutual integration and transformation of distinct labor and value forms —peasant sericulture, ?lature wage-labor, and industrial silk factory wage-labor—and the infundibular market forces they structured. These relations were decisively conditioned by new landlordism and debt-peonage, class-patriarchy, state mediations, migration, and by peasant and worker struggles against deteriorating conditions. Indeed, the transitional nature of the silk network’s formation, which concluded the Tokugawa system and decisively contributed to Japan’s emergence as a nation-state of the capitalist world-economy, was signi?ed by the very last millenarian and quasi-modern peasant uprising in 1884 among indebted sericulturists, the very ?rst recorded factory strikes in 1885–86, by women raw silk reelers in K?fu, and by strikes among unionizing workers in patriarchal and mechanized silk factories in Paterson, New Jersey, 1885–86 (Boles 1996, 1998. The “local” conditions of each con?ict were molded by the interdependence of those conditions that constituted a formative part of the world-system and its development. In the face of struggles and intensifying world-market competition, Japanese and US manufacturers took opposite spatial strategies of regional expansion to overcome the structural constraints of

  10. Growing Alternatives

    DEFF Research Database (Denmark)

    Bagger-Petersen, Mai Corlin

    2014-01-01

    From 2014, Anhui Province will pilot a reform of the residential land market in China, thus integrating rural Anhui in the national housing market. In contrast, artist and activist Ou Ning has proposed the Bishan time money currency, intending to establish an alternative economic circuit in Bishan...

  11. Alternative Veier

    DEFF Research Database (Denmark)

    Kruse, Tove Elisabeth; Salamonsen, Anita

    reflektioner omkring patienters brug af og erfaringer med alternativ behandling. Patientorganisationer, organisatoner for alternative behandlere og organisationer for læger og medicinstuderende har læst bogens patienthistorier og deres perspektiver lægges frem. Til slut i bogen diskuteres betydningen af de...

  12. Lessons learned from the design of chemical space networks and opportunities for new applications.

    Science.gov (United States)

    Vogt, Martin; Stumpfe, Dagmar; Maggiora, Gerald M; Bajorath, Jürgen

    2016-03-01

    The concept of chemical space is of fundamental relevance in chemical informatics and computer-aided drug discovery. In a series of articles published in the Journal of Computer-Aided Molecular Design, principles of chemical space design were evaluated, molecular networks proposed as an alternative to conventional coordinate-based chemical reference spaces, and different types of chemical space networks (CSNs) constructed and analyzed. Central to the generation of CSNs was the way in which molecular similarity relationships were assessed and a primary focal point was the network-based representation of biologically relevant chemical space. The design and comparison of CSNs based upon alternative similarity measures can be viewed as an evolutionary path with interesting lessons learned along the way. CSN design has matured to the point that such chemical space representations can be used in practice. In this contribution, highlights from the sequence of CSN design efforts are discussed in context, providing a perspective for future practical applications.

  13. Lessons learned from the design of chemical space networks and opportunities for new applications

    Science.gov (United States)

    Vogt, Martin; Stumpfe, Dagmar; Maggiora, Gerald M.; Bajorath, Jürgen

    2016-03-01

    The concept of chemical space is of fundamental relevance in chemical informatics and computer-aided drug discovery. In a series of articles published in the Journal of Computer- Aided Molecular Design, principles of chemical space design were evaluated, molecular networks proposed as an alternative to conventional coordinate-based chemical reference spaces, and different types of chemical space networks (CSNs) constructed and analyzed. Central to the generation of CSNs was the way in which molecular similarity relationships were assessed and a primary focal point was the network-based representation of biologically relevant chemical space. The design and comparison of CSNs based upon alternative similarity measures can be viewed as an evolutionary path with interesting lessons learned along the way. CSN design has matured to the point that such chemical space representations can be used in practice. In this contribution, highlights from the sequence of CSN design efforts are discussed in context, providing a perspective for future practical applications.

  14. Cooperative path planning of unmanned aerial vehicles

    CERN Document Server

    Tsourdos, Antonios; Shanmugavel, Madhavan

    2010-01-01

    An invaluable addition to the literature on UAV guidance and cooperative control, Cooperative Path Planning of Unmanned Aerial Vehicles is a dedicated, practical guide to computational path planning for UAVs. One of the key issues facing future development of UAVs is path planning: it is vital that swarm UAVs/ MAVs can cooperate together in a coordinated manner, obeying a pre-planned course but able to react to their environment by communicating and cooperating. An optimized path is necessary in order to ensure a UAV completes its mission efficiently, safely, and successfully. Focussing on the path planning of multiple UAVs for simultaneous arrival on target, Cooperative Path Planning of Unmanned Aerial Vehicles also offers coverage of path planners that are applicable to land, sea, or space-borne vehicles. Cooperative Path Planning of Unmanned Aerial Vehicles is authored by leading researchers from Cranfield University and provides an authoritative resource for researchers, academics and engineers working in...

  15. Electron Inelastic-Mean-Free-Path Database

    Science.gov (United States)

    SRD 71 NIST Electron Inelastic-Mean-Free-Path Database (PC database, no charge)   This database provides values of electron inelastic mean free paths (IMFPs) for use in quantitative surface analyses by AES and XPS.

  16. Time optimal paths for high speed maneuvering

    Energy Technology Data Exchange (ETDEWEB)

    Reister, D.B.; Lenhart, S.M.

    1993-01-01

    Recent theoretical results have completely solved the problem of determining the minimum length path for a vehicle with a minimum turning radius moving from an initial configuration to a final configuration. Time optimal paths for a constant speed vehicle are a subset of the minimum length paths. This paper uses the Pontryagin maximum principle to find time optimal paths for a constant speed vehicle. The time optimal paths consist of sequences of axes of circles and straight lines. The maximum principle introduces concepts (dual variables, bang-bang solutions, singular solutions, and transversality conditions) that provide important insight into the nature of the time optimal paths. We explore the properties of the optimal paths and present some experimental results for a mobile robot following an optimal path.

  17. Detection of deregulated modules using deregulatory linked path.

    Directory of Open Access Journals (Sweden)

    Yuxuan Hu

    Full Text Available The identification of deregulated modules (such as induced by oncogenes is a crucial step for exploring the pathogenic process of complex diseases. Most of the existing methods focus on deregulation of genes rather than the links of the path among them. In this study, we emphasize on the detection of deregulated links, and develop a novel and effective regulatory path-based approach in finding deregulated modules. Observing that a regulatory pathway between two genes might involve in multiple rather than a single path, we identify condition-specific core regulatory path (CCRP to detect the significant deregulation of regulatory links. Using time-series gene expression, we define the regulatory strength within each gene pair based on statistical dependence analysis. The CCRPs in regulatory networks can then be identified using the shortest path algorithm. Finally, we derive the deregulated modules by integrating the differential edges (as deregulated links of the CCRPs between the case and the control group. To demonstrate the effectiveness of our approach, we apply the method to expression data associated with different states of Human Epidermal Growth Factor Receptor 2 (HER2. The experimental results show that the genes as well as the links in the deregulated modules are significantly enriched in multiple KEGG pathways and GO biological processes, most of which can be validated to suffer from impact of this oncogene based on previous studies. Additionally, we find the regulatory mechanism associated with the crucial gene SNAI1 significantly deregulated resulting from the activation of HER2. Hence, our method provides not only a strategy for detecting the deregulated links in regulatory networks, but also a way to identify concerning deregulated modules, thus contributing to the target selection of edgetic drugs.

  18. Classical and quantum dynamics from classical paths to path integrals

    CERN Document Server

    Dittrich, Walter

    2016-01-01

    Graduate students who want to become familiar with advanced computational strategies in classical and quantum dynamics will find here both the fundamentals of a standard course and a detailed treatment of the time-dependent oscillator, Chern-Simons mechanics, the Maslov anomaly and the Berry phase, to name a few. Well-chosen and detailed examples illustrate the perturbation theory, canonical transformations, the action principle and demonstrate the usage of path integrals. This new edition has been revised and enlarged with chapters on quantum electrodynamics, high energy physics, Green’s functions and strong interaction.

  19. Path Integral Formulation of Anomalous Diffusion Processes

    OpenAIRE

    Friedrich, Rudolf; Eule, Stephan

    2011-01-01

    We present the path integral formulation of a broad class of generalized diffusion processes. Employing the path integral we derive exact expressions for the path probability densities and joint probability distributions for the class of processes under consideration. We show that Continuous Time Random Walks (CTRWs) are included in our framework. A closed expression for the path probability distribution of CTRWs is found in terms of their waiting time distribution as the solution of a Dyson ...

  20. Structural factoring approach for analyzing stochastic networks

    Science.gov (United States)

    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.

  1. Air Pollution alongside Bike-Paths in Bogota - Colombia

    Directory of Open Access Journals (Sweden)

    Juan Felipe Franco

    2016-11-01

    Full Text Available The study we present in this paper aims at characterizing the range of fine particulate matter (PM2.5 and black carbon (BC concentrations to which bike-path users in Bogotá are exposed to. Using a bike equipped with a DustTrak and a micro-aethalometer we measured PM2.5 and BC concentration levels along bike-paths corridors, during weekdays and weekends. Experiments were conducted in fours streets, representing four typical configurations of bike-paths in the city. Traffic data for workdays was also available from local mobility authority. Results indicate that bike-paths users in Bogota are exposed to air pollution levels far exceeding the threshold values established as potentially dangerous for human health. Average concentrations for PM2.5 ranged between 80 and 136 ug/m3 in workdays and between 30 and 72 ug/m3 in weekends. BC mean concentrations were between 16 and 38 µg/m3 during workdays and in the range 10 to 32 µg/m3 during weekends. A statistically significant difference exists in the levels of pollutants concentrations measured during workdays and weekends for all the considered bike paths. According to our results, both traffic volume and diffusions conditions, which are affected by many factors including street geometry, affect bike-path user’s exposure levels. Taking into account the important role that bicycling is playing as an alternative transport mode in Latin American cities, we consider these results provide useful insights to increase the appreciation of the excessive bikers´ exposure to air pollution in Bogotá. Moreover, these findings contribute with technical elements that should lead to the inclusion of air quality variable when designing and planning sustainable urban mobility infrastructures.

  2. Partial Path Column Generation for the ESPPRC

    DEFF Research Database (Denmark)

    Jepsen, Mads Kehlet; Petersen, Bjørn

    This talk introduces a decomposition of the Elementary Shortest Path Problem with Resource Constraints(ESPPRC), where the path is combined by smaller sub paths. We show computational result by comparing different approaches for the decomposition and compare the best of these with existing algorit...

  3. Strain path dependency in metal plasticity

    NARCIS (Netherlands)

    Viatkina, E.M.; Brekelmans, W.A.M.; Geers, M.G.D.

    2003-01-01

    A change in strain path has a significant effect on the mechanical response of metals. Strain path change effects physically originate from a complex microstructure evolution. This paper deals with the contribution of cell structure evolution to the strain path change effect. The material with cells

  4. Artificial pheromone for path selection by a foraging swarm of robots.

    Science.gov (United States)

    Campo, Alexandre; Gutiérrez, Alvaro; Nouyan, Shervin; Pinciroli, Carlo; Longchamp, Valentin; Garnier, Simon; Dorigo, Marco

    2010-11-01

    Foraging robots involved in a search and retrieval task may create paths to navigate faster in their environment. In this context, a swarm of robots that has found several resources and created different paths may benefit strongly from path selection. Path selection enhances the foraging behavior by allowing the swarm to focus on the most profitable resource with the possibility for unused robots to stop participating in the path maintenance and to switch to another task. In order to achieve path selection, we implement virtual ants that lay artificial pheromone inside a network of robots. Virtual ants are local messages transmitted by robots; they travel along chains of robots and deposit artificial pheromone on the robots that are literally forming the chain and indicating the path. The concentration of artificial pheromone on the robots allows them to decide whether they are part of a selected path. We parameterize the mechanism with a mathematical model and provide an experimental validation using a swarm of 20 real robots. We show that our mechanism favors the selection of the closest resource is able to select a new path if a selected resource becomes unavailable and selects a newly detected and better resource when possible. As robots use very simple messages and behaviors, the system would be particularly well suited for swarms of microrobots with minimal abilities.

  5. Effects of Optimizing the Scan-Path on Scanning Keyboards with QWERTY-Layout for English Text.

    Science.gov (United States)

    Sandnes, Frode Eika; Medola, Fausto Orsi

    2017-01-01

    Scanning keyboards can be essential tools for individuals with reduced motor function. However, most research addresses layout optimization. Learning new layouts is time-consuming. This study explores the familiar QWERTY layout with alternative scanning paths intended for English text. The results show that carefully designed scan-paths can help QWERTY nearly match optimized layouts in performance.

  6. Energy alternatives

    International Nuclear Information System (INIS)

    Sweet, C.

    1987-01-01

    The designated successor to fossil fuels is nuclear fission/fusion and that turns out to be problematic. Alternative Energy Systems have great potential but political forces seem to be hampering their development and introduction. The technologies are flexible in their use and scale of operation. The learning curve will not be short but neither will it be as long and as costly as nuclear power. It is time that this is recognised and some serious rethinking takes place in what presently passes for energy policies both in the industrialised countries and in the Third World. Alternative energy systems are defined and some of them which are relevant to the United Kingdom are discussed. (author)

  7. Space charge models and PATH

    International Nuclear Information System (INIS)

    Wald, H.B.

    1990-01-01

    The 'PATH' codes are used to design magnetic optics subsystems for neutral particle beam systems. They include a 2-1/2D and three 3-D space charge models, two of which have recently been added. This paper describes the 3-D models and reports on preliminary benchmark studies in which these models are checked for stability as the cloud size is varied and for consistency with each other. Differences between the models are investigated and the computer time requirements for running these models are established

  8. Innovation paths in wind power

    DEFF Research Database (Denmark)

    Lema, Rasmus; Nordensvärd, Johan; Urban, Frauke

    Denmark and Germany both make substantial investments in low carbon innovation, not least in the wind power sector. These investments in wind energy are driven by the twin objectives of reducing carbon emissions and building up international competitive advantage. Support for wind power dates back....... The ‘Danish Design’ remains the global standard. The direct drive design, while uncommon in Denmark, dominates the German installation base. Direct drive technology has thus emerged as a distinctly German design and sub-trajectory within the overall technological innovation path. When it comes to organising...... global interconnectedness of wind technology markets and the role of emerging new players, such as China and India....

  9. Uncommon paths in quantum physics

    CERN Document Server

    Kazakov, Konstantin V

    2014-01-01

    Quantum mechanics is one of the most fascinating, and at the same time most controversial, branches of contemporary science. Disputes have accompanied this science since its birth and have not ceased to this day. Uncommon Paths in Quantum Physics allows the reader to contemplate deeply some ideas and methods that are seldom met in the contemporary literature. Instead of widespread recipes of mathematical physics, based on the solutions of integro-differential equations, the book follows logical and partly intuitional derivations of non-commutative algebra. Readers can directly penetrate the

  10. Current distribution in parallel paths of the coils of a 50 Hz prototype dipole magnet

    International Nuclear Information System (INIS)

    Otter, A.J.

    1995-06-01

    The prototype dipole made for TRIUMF's Kaon Factory proposal used coils with 12 parallel paths to reduce eddy current losses in the conductors. The ac current distribution in these paths was non-uniform due to different self and mutual inductances. Small differences in inductance can cause large circulating currents in the parallel windings. This paper describes the measurement of the inductances and shows an attempt to predict the current distribution for two alternative connection schemes. (author). 4 refs., 8 figs

  11. Continuous-Curvature Path Generation Using Fermat's Spiral

    Directory of Open Access Journals (Sweden)

    Anastasios M. Lekkas

    2013-10-01

    Full Text Available This paper proposes a novel methodology, based on Fermat's spiral (FS, for constructing curvature-continuous parametric paths in a plane. FS has a zero curvature at its origin, a property that allows it to be connected with a straight line smoothly, that is, without the curvature discontinuity which occurs at the transition point between a line and a circular arc when constructing Dubins paths. Furthermore, contrary to the computationally expensive clothoids, FS is described by very simple parametric equations that are trivial to compute. On the downside, computing the length of an FS arc involves a Gaussian hypergeometric function. However, this function is absolutely convergent and it is also shown that it poses no restrictions to the domain within which the length can be calculated. In addition, we present an alternative parametrization of FS which eliminates the parametric speed singularity at the origin, hence making the spiral suitable for path-tracking applications. A detailed description of how to construct curvature-continuous paths with FS is given.

  12. Generalized causal mediation and path analysis: Extensions and practical considerations.

    Science.gov (United States)

    Albert, Jeffrey M; Cho, Jang Ik; Liu, Yiying; Nelson, Suchitra

    2018-01-01

    Causal mediation analysis seeks to decompose the effect of a treatment or exposure among multiple possible paths and provide casually interpretable path-specific effect estimates. Recent advances have extended causal mediation analysis to situations with a sequence of mediators or multiple contemporaneous mediators. However, available methods still have limitations, and computational and other challenges remain. The present paper provides an extended causal mediation and path analysis methodology. The new method, implemented in the new R package, gmediation (described in a companion paper), accommodates both a sequence (two stages) of mediators and multiple mediators at each stage, and allows for multiple types of outcomes following generalized linear models. The methodology can also handle unsaturated models and clustered data. Addressing other practical issues, we provide new guidelines for the choice of a decomposition, and for the choice of a reference group multiplier for the reduction of Monte Carlo error in mediation formula computations. The new method is applied to data from a cohort study to illuminate the contribution of alternative biological and behavioral paths in the effect of socioeconomic status on dental caries in adolescence.

  13. Robust Path Planning and Feedback Design Under Stochastic Uncertainty

    Science.gov (United States)

    Blackmore, Lars

    2008-01-01

    Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. This requires that mission constraint violation can occur with a probability less than a prescribed value.In this paper we describe a novel method for optimal chance constrained path planning with feedback design. The approach optimizes both the reference trajectory to be followed and the feedback controller used to reject uncertainty. Our method extends recent results in constrained control synthesis based on convex optimization to solve control problems with nonconvex constraints. This extension is essential for path planning problems, which inherently have nonconvex obstacle avoidance constraints. Unlike previous approaches to chance constrained path planning, the new approach optimizes the feedback gain as wellas the reference trajectory.The key idea is to couple a fast, nonconvex solver that does not take into account uncertainty, with existing robust approaches that apply only to convex feasible regions. By alternating between robust and nonrobust solutions, the new algorithm guarantees convergence to a global optimum. We apply the new method to an unmanned aircraft and show simulation results that demonstrate the efficacy of the approach.

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

    Science.gov (United States)

    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.

  15. Arctic curves in path models from the tangent method

    Science.gov (United States)

    Di Francesco, Philippe; Lapa, Matthew F.

    2018-04-01

    Recently, Colomo and Sportiello introduced a powerful method, known as the tangent method, for computing the arctic curve in statistical models which have a (non- or weakly-) intersecting lattice path formulation. We apply the tangent method to compute arctic curves in various models: the domino tiling of the Aztec diamond for which we recover the celebrated arctic circle; a model of Dyck paths equivalent to the rhombus tiling of a half-hexagon for which we find an arctic half-ellipse; another rhombus tiling model with an arctic parabola; the vertically symmetric alternating sign matrices, where we find the same arctic curve as for unconstrained alternating sign matrices. The latter case involves lattice paths that are non-intersecting but that are allowed to have osculating contact points, for which the tangent method was argued to still apply. For each problem we estimate the large size asymptotics of a certain one-point function using LU decomposition of the corresponding Gessel–Viennot matrices, and a reformulation of the result amenable to asymptotic analysis.

  16. Welding Robot Collision-Free Path Optimization

    Directory of Open Access Journals (Sweden)

    Xuewu Wang

    2017-02-01

    Full Text Available Reasonable welding path has a significant impact on welding efficiency, and a collision-free path should be considered first in the process of welding robot path planning. The shortest path length is considered as an optimization objective, and obstacle avoidance is considered as the constraint condition in this paper. First, a grid method is used as a modeling method after the optimization objective is analyzed. For local collision-free path planning, an ant colony algorithm is selected as the search strategy. Then, to overcome the shortcomings of the ant colony algorithm, a secondary optimization is presented to improve the optimization performance. Finally, the particle swarm optimization algorithm is used to realize global path planning. Simulation results show that the desired welding path can be obtained based on the optimization strategy.

  17. Alternative Immune Systems

    Directory of Open Access Journals (Sweden)

    Luis Fernando Cadavid Gutierrez

    2011-09-01

    Full Text Available The immune system in animals is a complex network of molecules, cells and tissues that coordinately maintain the physiological and genetic integrity of the organism. Traditionally, two classes of immunity have been considered, the innate immunity and the adaptive immunity. The former is ancestral, with limited variability and low discrimination. The latter is highly variable, specific and limited to jawed vertebrates. Adaptive immunity is based on antigen receptors that rearrange somatically to generate a nearly unlimited diversity of molecules. Likely, this mechanism of somatic recombination arose as a consequence of a horizontal transfer of transposons and transposases from bacterial genomes in the ancestor of jawed vertebrates. The recent discovery in jawless vertebrates and invertebrates of alternative adaptive immune mechanisms, suggests during evolution different animal groups have found alternative solutions to the problem of immune recognition.

  18. Debris extrusion by glide-path establishing endodontic instruments with different geometries

    Directory of Open Access Journals (Sweden)

    Jung-Hong Ha

    2016-06-01

    Conclusion: Creating the glide-path using nickel-titanium rotary files produced lower amounts of debris extrusion than using manual stainless-steel files. The progressive taper design of ProGlider, the center-off cross-section of One G, and the alternative-pitch design of ScoutRace may have increased the efficiencies of debris removal with minimal extrusion during glide-path preparation. Glide-path preparation using NiTi rotary files have better clinical efficiency than the manual stainless-steel file.

  19. Redes alternativas de comunicación, framing y la construcción del poder político (Alternative communication networks, framing and construction of political power

    Directory of Open Access Journals (Sweden)

    Mayra Martínez Avidad

    2011-12-01

    Full Text Available El objetivo del presente artículo es analizar el papel de las redes alternativas de comunicación en la construcción del poder político a través del proceso de framing o enmarcado. En los últimos años, la capacidad del público para producir (nuestros propios mensajes que potencialmente desafíen los encuadres fijados por la elite política se ha expandido enormemente con la llegada de Internet y las comunicaciones móviles. En este sentido, las redes virtuales son importantes porque pueden aumentar la capacidad de las masas para comunicarse entre sí transformando los marcos de referencia individuales en marcos interpretativos de carácter colectivo.The aim of this paper is to analyze the role of alternative communication networks in the construction of political power through the process of framing. In recent years, the ability of the public to produce (our own messages that potentially challenge those frames established by political elites has been importantly expanded by the advent of Internet and mobile communications. In this sense, virtual networks are important because they can influence the capacity of masses to communicate with each other transforming individual frames of reference into collective interpretative frames.

  20. Pheromone based alternative route planning

    Directory of Open Access Journals (Sweden)

    Liangbing Feng

    2016-08-01

    Full Text Available In this work, we propose an improved alternative route calculation based on alternative figures, which is suitable for practical environments. The improvement is based on the fact that the main traffic route is the road network skeleton in a city. Our approach using nodes may generate a higher possibility of overlapping. We employ a bidirectional Dijkstra algorithm to search the route. To measure the quality of an Alternative Figures (AG, three quotas are proposed. The experiment results indicate that the improved algorithm proposed in this paper is more effective than others.