An Application of Multi-Criteria Shortest Path to a Customizable Hex-Map Environment

Science.gov (United States)

2015-03-26

47 Appendix A. Shortest Path Code ( VBA ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 Appendix B. Quad Chart...efficient shortest path algorithm into the modeling environment, namely Excel VBA . While various algorithms offer the potential for more efficiency in...graphical interface is extremely intuitive and easily accessible to a user with no prior knowledge of the system. Since the Metz model is based on the

External Memory Algorithms for Diameter and All-Pair Shortest-Paths on Sparse Graphs

DEFF Research Database (Denmark)

Arge, Lars; Meyer, Ulrich; Toma, Laura

2004-01-01

We present several new external-memory algorithms for finding all-pairs shortest paths in a V -node, Eedge undirected graph. For all-pairs shortest paths and diameter in unweighted undirected graphs we present cache-oblivious algorithms with O(V · E B logM B E B) I/Os, where B is the block-size a...

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.

Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

Directory of Open Access Journals (Sweden)

Zhenghao Xi

2014-01-01

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

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

Science.gov (United States)

Bakar, Sumarni Abu; Ibrahim, Milbah

2017-08-01

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

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

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

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.

The Shortest Path Problems in Battery-Electric Vehicle Dispatching with Battery Renewal

Directory of Open Access Journals (Sweden)

Minfang Huang

2016-06-01

Full Text Available Electric vehicles play a key role for developing an eco-sustainable transport system. One critical component of an electric vehicle is its battery, which can be quickly charged or exchanged before it runs out. The problem of electric vehicle dispatching falls into the category of the shortest path problem with resource renewal. In this paper, we study the shortest path problems in (1 electric transit bus scheduling and (2 electric truck routing with time windows. In these applications, a fully-charged battery allows running a limited operational distance, and the battery before depletion needs to be quickly charged or exchanged with a fully-charged one at a battery management facility. The limited distance and battery renewal result in a shortest path problem with resource renewal. We develop a label-correcting algorithm with state space relaxation to find optimal solutions. In the computational experiments, real-world road geometry data are used to generate realistic travel distances, and other types of data are obtained from the real world or randomly generated. The computational results show that the label-correcting algorithm performs very well.

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.

Spatial interpolation of fine particulate matter concentrations using the shortest wind-field path distance.

Directory of Open Access Journals (Sweden)

Longxiang Li

Full Text Available Effective assessments of air-pollution exposure depend on the ability to accurately predict pollutant concentrations at unmonitored locations, which can be achieved through spatial interpolation. However, most interpolation approaches currently in use are based on the Euclidean distance, which cannot account for the complex nonlinear features displayed by air-pollution distributions in the wind-field. In this study, an interpolation method based on the shortest path distance is developed to characterize the impact of complex urban wind-field on the distribution of the particulate matter concentration. In this method, the wind-field is incorporated by first interpolating the observed wind-field from a meteorological-station network, then using this continuous wind-field to construct a cost surface based on Gaussian dispersion model and calculating the shortest wind-field path distances between locations, and finally replacing the Euclidean distances typically used in Inverse Distance Weighting (IDW with the shortest wind-field path distances. This proposed methodology is used to generate daily and hourly estimation surfaces for the particulate matter concentration in the urban area of Beijing in May 2013. This study demonstrates that wind-fields can be incorporated into an interpolation framework using the shortest wind-field path distance, which leads to a remarkable improvement in both the prediction accuracy and the visual reproduction of the wind-flow effect, both of which are of great importance for the assessment of the effects of pollutants on human health.

Experiments with the auction algorithm for the shortest path problem

DEFF Research Database (Denmark)

Larsen, Jesper; Pedersen, Ib

1999-01-01

The auction approach for the shortest path problem (SPP) as introduced by Bertsekas is tested experimentally. Parallel algorithms using the auction approach are developed and tested. Both the sequential and parallel auction algorithms perform significantly worse than a state-of-the-art Dijkstra-l......-like reference algorithm. Experiments are run on a distributed-memory MIMD class Meiko parallel computer....

Study on k-shortest paths with behavioral impedance domain from the intermodal public transportation system perspective

OpenAIRE

Pereira, Hernane Borges de Barros; Pérez Vidal, Lluís; Lozada, Eleazar G. Madrid

2003-01-01

Behavioral impedance domain consists of a theory on route planning for pedestrians, within which constraint management is considered. The goal of this paper is to present the k-shortest path model using the behavioral impedance approach. After the mathematical model building, optimization problem and resolution problem by a behavioral impedance algorithm, it is discussed how behavioral impedance cost function is embedded in the k-shortest path model. From the pedestrian's route planning persp...

ESHOPPS: A COMPUTATIONAL TOOL TO AID THE TEACHING OF SHORTEST PATH ALGORITHMS

Directory of Open Access Journals (Sweden)

S. J. de A. LIMA

2015-07-01

Full Text Available The development of a computational tool called EShoPPS – Environment for Shortest Path Problem Solving, which is used to assist students in understanding the working of Dijkstra, Greedy search and A*(star algorithms is presented in this paper. Such algorithms are commonly taught in graduate and undergraduate courses of Engineering and Informatics and are used for solving many optimization problems that can be characterized as Shortest Path Problem. The EShoPPS is an interactive tool that allows students to create a graph representing the problem and also helps in developing their knowledge of each specific algorithm. Experiments performed with 155 students of undergraduate and graduate courses such as Industrial Engineering, Computer Science and Information Systems have shown that by using the EShoPPS tool students were able to improve their interpretation of investigated algorithms.

The Resource constrained shortest path problem implemented in a lazy functional language

NARCIS (Netherlands)

Hartel, Pieter H.; Glaser, Hugh

The resource constrained shortest path problem is an NP-hard problem for which many ingenious algorithms have been developed. These algorithms are usually implemented in Fortran or another imperative programming language. We have implemented some of the simpler algorithms in a lazy functional

Floyd-warshall algorithm to determine the shortest path based on android

Science.gov (United States)

Ramadiani; Bukhori, D.; Azainil; Dengen, N.

2018-04-01

The development of technology has made all areas of life easier now, one of which is the ease of obtaining geographic information. The use of geographic information may vary according to need, for example, the digital map learning, navigation systems, observations area, and much more. With the support of adequate infrastructure, almost no one will ever get lost to a destination even to foreign places or that have never been visited before. The reasons why many institutions and business entities use technology to improve services to consumers and to streamline the production process undertaken and so forth. Speaking of the efficient, there are many elements related to efficiency in navigation systems, and one of them is the efficiency in terms of distance. The shortest distance determination algorithm required in this research is used Floyd-Warshall Algorithm. Floyd-Warshall algorithm is the algorithm to find the fastest path and the shortest distance between 2 nodes, while the program is intended to find the path of more than 2 nodes.

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.

An Efficient Shortest Path Routing Algorithm for Directed Indoor Environments

Directory of Open Access Journals (Sweden)

Sultan Alamri

2018-03-01

Full Text Available Routing systems for outdoor space have become the focus of many research works. Such routing systems are based on spatial road networks where moving objects (such as cars are affected by the directed roads and the movement of traffic, which may include traffic jams. Indoor routing, on the other hand, must take into account the features of indoor space such as walls and rooms. In this paper, we take indoor routing in a new direction whereby we consider the features that a building has in common with outdoor spaces. Inside some buildings, there may be directed floors where moving objects must move in a certain direction through directed corridors in order to reach a certain location. For example, on train platforms or in museums, movement in the corridors may be directed. In these directed floor spaces, a routing system enabling a visitor to take the shortest path to a certain location is essential. Therefore, this work proposes a new approach for buildings with directed indoor spaces, where each room can be affected by the density of the moving objects. The proposed system obtains the shortest path between objects or rooms taking into consideration the directed indoor space and the capacity of the objects to move within each room/cell.

Training shortest-path tractography: Automatic learning of spatial priors

DEFF Research Database (Denmark)

Kasenburg, Niklas; Liptrot, Matthew George; Reislev, Nina Linde

2016-01-01

Tractography is the standard tool for automatic delineation of white matter tracts from diffusion weighted images. However, the output of tractography often requires post-processing to remove false positives and ensure a robust delineation of the studied tract, and this demands expert prior...... knowledge. Here we demonstrate how such prior knowledge, or indeed any prior spatial information, can be automatically incorporated into a shortest-path tractography approach to produce more robust results. We describe how such a prior can be automatically generated (learned) from a population, and we...

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.

Efficient evaluation of shortest travel-time path queries through spatial mashups

KAUST Repository

Zhang, Detian

2017-01-07

In the real world, the route/path with the shortest travel time in a road network is more meaningful than that with the shortest network distance for location-based services (LBS). However, not every LBS provider has adequate resources to compute/estimate travel time for routes by themselves. A cost-effective way for LBS providers to estimate travel time for routes is to issue external route requests to Web mapping services (e.g., Google Maps, Bing Maps, and MapQuest Maps). Due to the high cost of processing such external route requests and the usage limits of Web mapping services, we take the advantage of direction sharing, parallel requesting and waypoints supported by Web mapping services to reduce the number of external route requests and the query response time for shortest travel-time route queries in this paper. We first give the definition of sharing ability to reflect the possibility of sharing the direction information of a route with others, and find out the queries that their query routes are independent with each other for parallel processing. Then, we model the problem of selecting the optimal waypoints for an external route request as finding the longest simple path in a weighted complete digraph. As it is a MAX SNP-hard problem, we propose a greedy algorithm with performance guarantee to find the best set of waypoints in an external route request. We evaluate the performance of our approach using a real Web mapping service, a real road network, real and synthetic data sets. Experimental results show the efficiency, scalability, and applicability of our approach.

Efficient evaluation of shortest travel-time path queries through spatial mashups

KAUST Repository

Zhang, Detian; Chow, Chi-Yin; Liu, An; Zhang, Xiangliang; Ding, Qingzhu; Li, Qing

2017-01-01

In the real world, the route/path with the shortest travel time in a road network is more meaningful than that with the shortest network distance for location-based services (LBS). However, not every LBS provider has adequate resources to compute/estimate travel time for routes by themselves. A cost-effective way for LBS providers to estimate travel time for routes is to issue external route requests to Web mapping services (e.g., Google Maps, Bing Maps, and MapQuest Maps). Due to the high cost of processing such external route requests and the usage limits of Web mapping services, we take the advantage of direction sharing, parallel requesting and waypoints supported by Web mapping services to reduce the number of external route requests and the query response time for shortest travel-time route queries in this paper. We first give the definition of sharing ability to reflect the possibility of sharing the direction information of a route with others, and find out the queries that their query routes are independent with each other for parallel processing. Then, we model the problem of selecting the optimal waypoints for an external route request as finding the longest simple path in a weighted complete digraph. As it is a MAX SNP-hard problem, we propose a greedy algorithm with performance guarantee to find the best set of waypoints in an external route request. We evaluate the performance of our approach using a real Web mapping service, a real road network, real and synthetic data sets. Experimental results show the efficiency, scalability, and applicability of our approach.

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

Science.gov (United States)

Kröger, Martin

2005-06-01

We present an algorithm which returns a shortest path and related number of entanglements for a given configuration of a polymeric system in 2 or 3 dimensions. Rubinstein and Helfand, and later Everaers et al. introduced a concept to extract primitive paths for dense polymeric melts made of linear chains (a multiple disconnected multibead 'path'), where each primitive path is defined as a path connecting the (space-fixed) ends of a polymer under the constraint of non-interpenetration (excluded volume) between primitive paths of different chains, such that the multiple disconnected path fulfills a minimization criterion. The present algorithm uses geometrical operations and provides a—model independent—efficient approximate solution to this challenging problem. Primitive paths are treated as 'infinitely' thin (we further allow for finite thickness to model excluded volume), and tensionless lines rather than multibead chains, excluded volume is taken into account without a force law. The present implementation allows to construct a shortest multiple disconnected path (SP) for 2D systems (polymeric chain within spherical obstacles) and an optimal SP for 3D systems (collection of polymeric chains). The number of entanglements is then simply obtained from the SP as either the number of interior kinks, or from the average length of a line segment. Further, information about structure and potentially also the dynamics of entanglements is immediately available from the SP. We apply the method to study the 'concentration' dependence of the degree of entanglement in phantom chain systems. Program summaryTitle of program:Z Catalogue number:ADVG Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVG Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: Silicon Graphics (Irix), Sun (Solaris), PC (Linux) Operating systems or monitors under which the

Solving fuzzy shortest path problem by genetic algorithm

Science.gov (United States)

Syarif, A.; Muludi, K.; Adrian, R.; Gen, M.

2018-03-01

Shortest Path Problem (SPP) is known as one of well-studied fields in the area Operations Research and Mathematical Optimization. It has been applied for many engineering and management designs. The objective is usually to determine path(s) in the network with minimum total cost or traveling time. In the past, the cost value for each arc was usually assigned or estimated as a deteministic value. For some specific real world applications, however, it is often difficult to determine the cost value properly. One way of handling such uncertainty in decision making is by introducing fuzzy approach. With this situation, it will become difficult to solve the problem optimally. This paper presents the investigations on the application of Genetic Algorithm (GA) to a new SPP model in which the cost values are represented as Triangular Fuzzy Number (TFN). We adopts the concept of ranking fuzzy numbers to determine how good the solutions. Here, by giving his/her degree value, the decision maker can determine the range of objective value. This would be very valuable for decision support system in the real world applications.Simulation experiments were carried out by modifying several test problems with 10-25 nodes. It is noted that the proposed approach is capable attaining a good solution with different degree of optimism for the tested problems.

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.

Comparison of Genetic Algorithm and Hill Climbing for Shortest Path Optimization Mapping

Directory of Open Access Journals (Sweden)

Fronita Mona

2018-01-01

Full Text Available Traveling Salesman Problem (TSP is an optimization to find the shortest path to reach several destinations in one trip without passing through the same city and back again to the early departure city, the process is applied to the delivery systems. This comparison is done using two methods, namely optimization genetic algorithm and hill climbing. Hill Climbing works by directly selecting a new path that is exchanged with the neighbour’s to get the track distance smaller than the previous track, without testing. Genetic algorithms depend on the input parameters, they are the number of population, the probability of crossover, mutation probability and the number of generations. To simplify the process of determining the shortest path supported by the development of software that uses the google map API. Tests carried out as much as 20 times with the number of city 8, 16, 24 and 32 to see which method is optimal in terms of distance and time computation. Based on experiments conducted with a number of cities 3, 4, 5 and 6 producing the same value and optimal distance for the genetic algorithm and hill climbing, the value of this distance begins to differ with the number of city 7. The overall results shows that these tests, hill climbing are more optimal to number of small cities and the number of cities over 30 optimized using genetic algorithms.

A shortest-path graph kernel for estimating gene product semantic similarity

Directory of Open Access Journals (Sweden)

Alvarez Marco A

2011-07-01

Full Text Available Abstract Background Existing methods for calculating semantic similarity between gene products using the Gene Ontology (GO often rely on external resources, which are not part of the ontology. Consequently, changes in these external resources like biased term distribution caused by shifting of hot research topics, will affect the calculation of semantic similarity. One way to avoid this problem is to use semantic methods that are "intrinsic" to the ontology, i.e. independent of external knowledge. Results We present a shortest-path graph kernel (spgk method that relies exclusively on the GO and its structure. In spgk, a gene product is represented by an induced subgraph of the GO, which consists of all the GO terms annotating it. Then a shortest-path graph kernel is used to compute the similarity between two graphs. In a comprehensive evaluation using a benchmark dataset, spgk compares favorably with other methods that depend on external resources. Compared with simUI, a method that is also intrinsic to GO, spgk achieves slightly better results on the benchmark dataset. Statistical tests show that the improvement is significant when the resolution and EC similarity correlation coefficient are used to measure the performance, but is insignificant when the Pfam similarity correlation coefficient is used. Conclusions Spgk uses a graph kernel method in polynomial time to exploit the structure of the GO to calculate semantic similarity between gene products. It provides an alternative to both methods that use external resources and "intrinsic" methods with comparable performance.

External Data Structures for Shortest Path Queries on Planar Digraphs

DEFF Research Database (Denmark)

Arge, Lars; Toma, Laura

2005-01-01

In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N 1 + ε) and S = O(N2/B), our main result is a family of structures that use S space and answer queries in O(N2/ S B) I/Os, thus obtaining...... optimal space-query product O(N2/B). An S space structure can be constructed in O(√S · sort(N)) I/Os, where sort(N) is the number of I/Os needed to sort N elements, B is the disk block size, and N is the size of the graph....

Impacts of Different Mobile User Interfaces on Students’ Satisfaction for Learning Dijkstra’s Shortest Path Algorithm

Directory of Open Access Journals (Sweden)

Mazyar Seraj

2014-10-01

Full Text Available This paper describes an experimental study of learning Dijkstra’s shortest path algorithm on mobile devices. The aim of the study is to investigate and compare the impacts of two different mobile screen user interfaces on students’ satisfaction for learning the technical subject. A mobile learning prototype was developed for learning Dijkstra’s shortest path algorithm on Apple iPhone 4 operated on iPhone operating system (iOS, and Acer Inconia Tab operated on an Android operating system. Thirty students, who are either currently studying or had previously studied Computer Networks, were recruited for the usability trial. At the end of each single session, students’ satisfaction interacting with the two mobile devices was measured using QUIS questionnaire. Although there is no significant difference in students’ satisfaction between the two different mobile screen interfaces, the subjective findings indicate that Acer Inconia Tab gained higher scores as compared to Apple iPhone 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.

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.

Comparison of the efficiency of two algorithms which solve the shortest path problem with an emotional agent

Directory of Open Access Journals (Sweden)

Petruseva Silvana

2006-01-01

Full Text Available This paper discusses the comparison of the efficiency of two algorithms, by estimation of their complexity. For solving the problem, the Neural Network Crossbar Adaptive Array (NN-CAA is used as the agent architecture, implementing a model of an emotion. The problem discussed is how to find the shortest path in an environment with n states. The domains concerned are environments with n states, one of which is the starting state, one is the goal state, and some states are undesirable and they should be avoided. It is obtained that finding one path (one solution is efficient, i.e. in polynomial time by both algorithms. One of the algorithms is faster than the other only in the multiplicative constant, and it shows a step forward toward the optimality of the learning process. However, finding the optimal solution (the shortest path by both algorithms is in exponential time which is asserted by two theorems. It might be concluded that the concept of subgoal is one step forward toward the optimality of the process of the agent learning. Yet, it should be explored further on, in order to obtain an efficient, polynomial algorithm.

Finding the K shortest hyperpaths using reoptimization

DEFF Research Database (Denmark)

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

2006-01-01

The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen, Nielsen and Pretolani. In this paper we improve...... the worst-case computational complexity of an algorithm for finding the K shortest hyperpaths in an acyclic hypergraph. This result is obtained by applying new reoptimization techniques for shortest hyperpaths. The algorithm turns out to be quite effective in practice and has already been successfully...

Fast and accurate global multiphase arrival tracking: the irregular shortest-path method in a 3-D spherical earth model

Science.gov (United States)

Huang, Guo-Jiao; Bai, Chao-Ying; Greenhalgh, Stewart

2013-09-01

The traditional grid/cell-based wavefront expansion algorithms, such as the shortest path algorithm, can only find the first arrivals or multiply reflected (or mode converted) waves transmitted from subsurface interfaces, but cannot calculate the other later reflections/conversions having a minimax time path. In order to overcome the above limitations, we introduce the concept of a stationary minimax time path of Fermat's Principle into the multistage irregular shortest path method. Here we extend it from Cartesian coordinates for a flat earth model to global ray tracing of multiple phases in a 3-D complex spherical earth model. The ray tracing results for 49 different kinds of crustal, mantle and core phases show that the maximum absolute traveltime error is less than 0.12 s and the average absolute traveltime error is within 0.09 s when compared with the AK135 theoretical traveltime tables for a 1-D reference model. Numerical tests in terms of computational accuracy and CPU time consumption indicate that the new scheme is an accurate, efficient and a practical way to perform 3-D multiphase arrival tracking in regional or global traveltime tomography.

ACL2 Meets the GPU: Formalizing a CUDA-based Parallelizable All-Pairs Shortest Path Algorithm in ACL2

Directory of Open Access Journals (Sweden)

David S. Hardin

2013-04-01

Full Text Available As Graphics Processing Units (GPUs have gained in capability and GPU development environments have matured, developers are increasingly turning to the GPU to off-load the main host CPU of numerically-intensive, parallelizable computations. Modern GPUs feature hundreds of cores, and offer programming niceties such as double-precision floating point, and even limited recursion. This shift from CPU to GPU, however, raises the question: how do we know that these new GPU-based algorithms are correct? In order to explore this new verification frontier, we formalized a parallelizable all-pairs shortest path (APSP algorithm for weighted graphs, originally coded in NVIDIA's CUDA language, in ACL2. The ACL2 specification is written using a single-threaded object (stobj and tail recursion, as the stobj/tail recursion combination yields the most straightforward translation from imperative programming languages, as well as efficient, scalable executable specifications within ACL2 itself. The ACL2 version of the APSP algorithm can process millions of vertices and edges with little to no garbage generation, and executes at one-sixth the speed of a host-based version of APSP coded in C – a very respectable result for a theorem prover. In addition to formalizing the APSP algorithm (which uses Dijkstra's shortest path algorithm at its core, we have also provided capability that the original APSP code lacked, namely shortest path recovery. Path recovery is accomplished using a secondary ACL2 stobj implementing a LIFO stack, which is proven correct. To conclude the experiment, we ported the ACL2 version of the APSP kernels back to C, resulting in a less than 5% slowdown, and also performed a partial back-port to CUDA, which, surprisingly, yielded a slight performance increase.

The tomography of human mobility - what do shortest-path trees reveal?

Energy Technology Data Exchange (ETDEWEB)

Thiemann, Christian [Eng. Sci. and Appl. Math, Northwestern University, Evanston, IL (United States); Max-Planck-Institute for Dynamics and Self-Organization, Goettingen (Germany); Grady, Daniel; Brockmann, Dirk [Eng. Sci. and Appl. Math, Northwestern University, Evanston, IL (United States)

2010-07-01

Similar to illustrating the anatomy of organs using pictures of tissue slices taken at various depths, we construct shortest-path trees of different nodes to create tomograms of large-scale human mobility networks. This tomography allows us to measure global properties of the system conditioned on a reference location in the network to gain a fuller characterization of a node. It also suggests a canonical coordinate system for representing complex networks and dynamical processes thereon in a simplified way, revealing a new symmetry in the human mobility networks we investigated. Furthermore, introducing the notion of tree similarity, we devised a new technique for clustering nodes with similar topological footprint, yielding a unique and efficient method for community identification and topological backbone extraction. We applied these methods to a multi-scale human mobility network obtained from the dollar-bill-tracking site wheresgoerge.com and to the U.S. and world-wide air transportation network.

Finding Shortest Paths on Terrains by Killing Two Birds with One Stone

DEFF Research Database (Denmark)

Kaul, Manohar; Wong, Raymond Chi-Wing; Yang, Bin

2013-01-01

With the increasing availability of terrain data, e.g., from aerial laser scans, the management of such data is attracting increasing at- tention in both industry and academia. In particular, spatial queries, e.g., k -nearest neighbor and reverse nearest neighbor queries, in Euclidean and spatial...... network spaces are being extended to ter- rains. Such queries all rely on an important operation, that of finding shortest surface distances. However, shortest surface dis- tance computation is very time consuming. We propose techniques that enable efficient computation of lower and upper bounds...... of the shortest surface distance, which enable faster query processing by eliminating expensive distance computations. Empirical studies show that our bounds are much tighter than the best-known bounds in many cases and that they enable speedups of up to 43 times for some well-known spatial querie...

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.

A Shortest-Path-Based Method for the Analysis and Prediction of Fruit-Related Genes in Arabidopsis thaliana.

Science.gov (United States)

Zhu, Liucun; Zhang, Yu-Hang; Su, Fangchu; Chen, Lei; Huang, Tao; Cai, Yu-Dong

2016-01-01

Biologically, fruits are defined as seed-bearing reproductive structures in angiosperms that develop from the ovary. The fertilization, development and maturation of fruits are crucial for plant reproduction and are precisely regulated by intrinsic genetic regulatory factors. In this study, we used Arabidopsis thaliana as a model organism and attempted to identify novel genes related to fruit-associated biological processes. Specifically, using validated genes, we applied a shortest-path-based method to identify several novel genes in a large network constructed using the protein-protein interactions observed in Arabidopsis thaliana. The described analyses indicate that several of the discovered genes are associated with fruit fertilization, development and maturation in Arabidopsis thaliana.

Approximate shortest homotopic paths in weighted regions

KAUST Repository

Cheng, Siuwing; Jin, Jiongxin; Vigneron, Antoine E.; Wang, Yajun

2012-01-01

A path P between two points s and t in a polygonal subdivision T with obstacles and weighted regions defines a class of paths that can be deformed to P without passing over any obstacle. We present the first algorithm that, given P and a relative

Approximate Shortest Homotopic Paths in Weighted Regions

KAUST Repository

Cheng, Siu-Wing; Jin, Jiongxin; Vigneron, Antoine; Wang, Yajun

2010-01-01

Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈(0,1), we present the first algorithm to compute a path between s and t that can be deformed to P

Technical note: Quantification of neurocranial shape variation using the shortest paths connecting pairs of anatomical landmarks.

Science.gov (United States)

Morita, Yusuke; Ogihara, Naomichi; Kanai, Takashi; Suzuki, Hiromasa

2013-08-01

Three-dimensional geometric morphometric techniques have been widely used in quantitative comparisons of craniofacial morphology in humans and nonhuman primates. However, few anatomical landmarks can actually be defined on the neurocranium. In this study, an alternative method is proposed for defining semi-landmarks on neurocranial surfaces for use in detailed analysis of cranial shape. Specifically, midsagittal, nuchal, and temporal lines were approximated using Bezier curves and equally spaced points along each of the curves were defined as semi-landmarks. The shortest paths connecting pairs of anatomical landmarks as well as semi-landmarks were then calculated in order to represent the surface morphology between landmarks using equally spaced points along the paths. To evaluate the efficacy of this method, the previously outlined technique was used in morphological analysis of sexual dimorphism in modern Japanese crania. The study sample comprised 22 specimens that were used to generate 110 anatomical semi-landmarks, which were used in geometric morphometric analysis. Although variations due to sexual dimorphism in human crania are very small, differences could be identified using the proposed landmark placement, which demonstrated the efficacy of the proposed method. Copyright © 2013 Wiley Periodicals, Inc.

Approximate Shortest Homotopic Paths in Weighted Regions

KAUST Repository

Cheng, Siu-Wing

2010-01-01

Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈(0,1), we present the first algorithm to compute a path between s and t that can be deformed to P without passing over any obstacle and the path cost is within a factor 1 + ε of the optimum. The running time is O(h 3/ε2 kn polylog(k, n, 1/ε)), where k is the number of segments in P and h and n are the numbers of obstacles and vertices in T, respectively. The constant in the running time of our algorithm depends on some geometric parameters and the ratio of the maximum region weight to the minimum region weight. © 2010 Springer-Verlag.

Approximate shortest homotopic paths in weighted regions

KAUST Repository

Cheng, Siuwing

2012-02-01

A path P between two points s and t in a polygonal subdivision T with obstacles and weighted regions defines a class of paths that can be deformed to P without passing over any obstacle. We present the first algorithm that, given P and a relative error tolerance ε (0, 1), computes a path from this class with cost at most 1 + ε times the optimum. The running time is O(h 3/ε 2kn polylog (k,n,1/ε)), where k is the number of segments in P and h and n are the numbers of obstacles and vertices in T, respectively. The constant in the running time of our algorithm depends on some geometric parameters and the ratio of the maximum region weight to the minimum region weight. © 2012 World Scientific Publishing Company.

Lecturers' and Students’ Perception on Learning Dijkstra’s Shortest Path Algorithm Through Mobile Devices

Directory of Open Access Journals (Sweden)

Mazyar Seraj

2014-06-01

Full Text Available In recent years, many studies have been carried out on how to engage and support students in e-learning environments. Portable devices such as Personal Digital Assistants (PDAs, Tablet PCs, mobile phones and other mobile equipment have been used as parts of electronic learning environments to facilitate learning and teaching for both lecturers and students. However, there is still a dearth of study investigating the effects of small screen interfaces on mobile-based learning environments. This study aims to address two objectives: (i investigate lecturer and student difficulties encountered in teaching-learning process in traditional face-to-face classroom settings, and (ii to explore lecturer and student perceptions about learning the subject through mobile devices. This paper presents the results of a qualitative study using structured interviews to investigate lecturer and student experiences and perceptions on teaching and learning Dijkstra’s shortest path algorithm via mobile devices. The interview insights were then used as inputs to define user requirements for a mobile learning prototype. The findings show that the lecturers and students raised many issues about interactivity and the flexibility of effective learning applications on small screen devices, especially for a technical subject.

Finding shortest non-trivial cycles in directed graphs on surfaces

Directory of Open Access Journals (Sweden)

Sergio Cabello

2016-04-01

Full Text Available Let $D$ be a weighted directed graph cellularly embedded in a surface of genus $g$, orientable or not, possibly with boundary.  We describe algorithms to compute shortest non-contractible and shortest surface non-separating cycles in $D$, generalizing previous results that dealt with undirected graphs.Our first algorithm computes such cycles in $O(n^2\\log n$ time, where $n$ is the total number of vertices and edges of $D$, thus matching the complexity of the best general algorithm in the undirected case.  It revisits and extends Thomassen's 3-path condition; the technique applies to other families of cycles as well.We also provide more efficient algorithms in special cases, such as graphs with small genus or bounded treewidth, using a divide-and-conquer technique that simplifies the graph while preserving the topological properties of its cycles.  Finally, we give an efficient output-sensitive algorithm, whose running time depends on the length of the shortest non-contractible or non-separating cycle.

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.

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 .

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

An Adaptive Multi-Objective Particle Swarm Optimization Algorithm for Multi-Robot Path Planning

Directory of Open Access Journals (Sweden)

Nizar Hadi Abbas

2016-07-01

Full Text Available This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In order to evaluate the proposed algorithm in term of finding the best solution, six benchmark test functions are used to make a comparison between AMOPSO and the standard MOPSO. The results show that the AMOPSO has a better ability to get away from local optimums with a quickest convergence than the MOPSO. The simulation results using Matlab 2014a, indicate that this methodology is extremely valuable for every robot in multi-robot framework to discover its own particular proper pa‌th from the start to the destination position with minimum distance and time.

On the Organization of Parallel Operation of Some Algorithms for Finding the Shortest Path on a Graph on a Computer System with Multiple Instruction Stream and Single Data Stream

Directory of Open Access Journals (Sweden)

V. E. Podol'skii

2015-01-01

Full Text Available The paper considers the implementing Bellman-Ford and Lee algorithms to find the shortest graph path on a computer system with multiple instruction stream and single data stream (MISD. The MISD computer is a computer that executes commands of arithmetic-logical processing (on the CPU and commands of structures processing (on the structures processor in parallel on a single data stream. Transformation of sequential programs into the MISD programs is a labor intensity process because it requires a stream of the arithmetic-logical processing to be manually separated from that of the structures processing. Algorithms based on the processing of data structures (e.g., algorithms on graphs show high performance on a MISD computer. Bellman-Ford and Lee algorithms for finding the shortest path on a graph are representatives of these algorithms. They are applied to robotics for automatic planning of the robot movement in-situ. Modification of Bellman-Ford and Lee algorithms for finding the shortest graph path in coprocessor MISD mode and the parallel MISD modification of these algorithms were first obtained in this article. Thus, this article continues a series of studies on the transformation of sequential algorithms into MISD ones (Dijkstra and Ford-Fulkerson 's algorithms and has a pronouncedly applied nature. The article also presents the analysis results of Bellman-Ford and Lee algorithms in MISD mode. The paper formulates the basic trends of a technique for parallelization of algorithms into arithmetic-logical processing stream and structures processing stream. Among the key areas for future research, development of the mathematical approach to provide a subsequently formalized and automated process of parallelizing sequential algorithms between the CPU and structures processor is highlighted. Among the mathematical models that can be used in future studies there are graph models of algorithms (e.g., dependency graph of a program. Due to the high

Approaching the Brachistochrone Using Inclined Planes--Striving for Shortest or Equal Travelling Times

Science.gov (United States)

Theilmann, Florian

2017-01-01

The classical "brachistochrone" problem asks for the path on which a mobile point M just driven by its own gravity will travel in the shortest possible time between two given points "A" and "B." The resulting curve, the cycloid, will also be the "tautochrone" curve, i.e. the travelling time of the mobile…

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

Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

Directory of Open Access Journals (Sweden)

Vatutin Eduard

2017-12-01

Full Text Available The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

Science.gov (United States)

Vatutin, Eduard

2017-12-01

The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

Solving the replacement paths problem for planar directed graphs in O(n logn) time

DEFF Research Database (Denmark)

Wulff-Nilsen, Christian

2010-01-01

In a graph G with non-negative edge lengths, let P be a shortest path from a vertex s to a vertex t. We consider the problem of computing, for each edge e on P, the length of a shortest path in G from s to t that avoids e. This is known as the replacement paths problem. We give a linearspace...

Multi-AGV path planning with double-path constraints by using an improved genetic algorithm.

Directory of Open Access Journals (Sweden)

Zengliang Han

Full Text Available This paper investigates an improved genetic algorithm on multiple automated guided vehicle (multi-AGV path planning. The innovations embody in two aspects. First, three-exchange crossover heuristic operators are used to produce more optimal offsprings for getting more information than with the traditional two-exchange crossover heuristic operators in the improved genetic algorithm. Second, double-path constraints of both minimizing the total path distance of all AGVs and minimizing single path distances of each AGV are exerted, gaining the optimal shortest total path distance. The simulation results show that the total path distance of all AGVs and the longest single AGV path distance are shortened by using the improved genetic algorithm.

Path planning of decentralized multi-quadrotor based on fuzzy-cell decomposition algorithm

Science.gov (United States)

Iswanto, Wahyunggoro, Oyas; Cahyadi, Adha Imam

2017-04-01

The paper aims to present a design algorithm for multi quadrotor lanes in order to move towards the goal quickly and avoid obstacles in an area with obstacles. There are several problems in path planning including how to get to the goal position quickly and avoid static and dynamic obstacles. To overcome the problem, therefore, the paper presents fuzzy logic algorithm and fuzzy cell decomposition algorithm. Fuzzy logic algorithm is one of the artificial intelligence algorithms which can be applied to robot path planning that is able to detect static and dynamic obstacles. Cell decomposition algorithm is an algorithm of graph theory used to make a robot path map. By using the two algorithms the robot is able to get to the goal position and avoid obstacles but it takes a considerable time because they are able to find the shortest path. Therefore, this paper describes a modification of the algorithms by adding a potential field algorithm used to provide weight values on the map applied for each quadrotor by using decentralized controlled, so that the quadrotor is able to move to the goal position quickly by finding the shortest path. The simulations conducted have shown that multi-quadrotor can avoid various obstacles and find the shortest path by using the proposed algorithms.

RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules

Directory of Open Access Journals (Sweden)

Michaeli Shulamit

2007-10-01

Full Text Available Abstract Background In recent years, RNA molecules that are not translated into proteins (ncRNAs have drawn a great deal of attention, as they were shown to be involved in many cellular functions. One of the most important computational problems regarding ncRNA is to predict the secondary structure of a molecule from its sequence. In particular, we attempted to predict the secondary structure for a set of unaligned ncRNA molecules that are taken from the same family, and thus presumably have a similar structure. Results We developed the RNAspa program, which comparatively predicts the secondary structure for a set of ncRNA molecules in linear time in the number of molecules. We observed that in a list of several hundred suboptimal minimal free energy (MFE predictions, as provided by the RNAsubopt program of the Vienna package, it is likely that at least one suggested structure would be similar to the true, correct one. The suboptimal solutions of each molecule are represented as a layer of vertices in a graph. The shortest path in this graph is the basis for structural predictions for the molecule. We also show that RNA secondary structures can be compared very rapidly by a simple string Edit-Distance algorithm with a minimal loss of accuracy. We show that this approach allows us to more deeply explore the suboptimal structure space. Conclusion The algorithm was tested on three datasets which include several ncRNA families taken from the Rfam database. These datasets allowed for comparison of the algorithm with other methods. In these tests, RNAspa performed better than four other programs.

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

Path-integral method for the source apportionment of photochemical pollutants

Science.gov (United States)

Dunker, A. M.

2015-06-01

A new, path-integral method is presented for apportioning the concentrations of pollutants predicted by a photochemical model to emissions from different sources. A novel feature of the method is that it can apportion the difference in a species concentration between two simulations. For example, the anthropogenic ozone increment, which is the difference between a simulation with all emissions present and another simulation with only the background (e.g., biogenic) emissions included, can be allocated to the anthropogenic emission sources. The method is based on an existing, exact mathematical equation. This equation is applied to relate the concentration difference between simulations to line or path integrals of first-order sensitivity coefficients. The sensitivities describe the effects of changing the emissions and are accurately calculated by the decoupled direct method. The path represents a continuous variation of emissions between the two simulations, and each path can be viewed as a separate emission-control strategy. The method does not require auxiliary assumptions, e.g., whether ozone formation is limited by the availability of volatile organic compounds (VOCs) or nitrogen oxides (NOx), and can be used for all the species predicted by the model. A simplified configuration of the Comprehensive Air Quality Model with Extensions (CAMx) is used to evaluate the accuracy of different numerical integration procedures and the dependence of the source contributions on the path. A Gauss-Legendre formula using three or four points along the path gives good accuracy for apportioning the anthropogenic increments of ozone, nitrogen dioxide, formaldehyde, and nitric acid. Source contributions to these increments were obtained for paths representing proportional control of all anthropogenic emissions together, control of NOx emissions before VOC emissions, and control of VOC emissions before NOx emissions. There are similarities in the source contributions from the

Establishment Of The Shortest Route A Prototype For Facilitation In Road Network

Directory of Open Access Journals (Sweden)

Sumaira Yousuf Khan

2015-08-01

Full Text Available Calculating the shortest path between two locations in a road network is a significant problem in network analysis. Roads play a pivotal role in day to day activities of masses live in places and areas. They travel for various purposes that are to study to work to shop and to supply their goods and the like from one place to another place. Even in this modern era roads remain one of the mediums used most frequently for travel and transportation. Being ignorant of the shortest routes people sometimes have to travel long distances consume extra precious time money and bare undesirable mental stress. Karachi is the second most populated and the seventh biggest city of the world. It is the central place of Pakistan which is famous for industry banking trade and economic activity and there are places which frequently visit by the inhabitants for their miscellaneous requirements. Federal Board of Revenue FBR is one of the departments that deal with taxation and revenue generation in the country. A common man residing near or distant areas often visit FBR to settle their business property and tax related issues. In order to facilitate the masses an effort is being made to develop a prototype based on Dijkstras Algorithm DA to establish a shortest route that will help individuals in navigation and subsequently alleviate difficulties faced by them in travelling road networks.

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.

Inferring anatomical therapeutic chemical (ATC) class of drugs using shortest path and random walk with restart algorithms.

Science.gov (United States)

Chen, Lei; Liu, Tao; Zhao, Xian

2018-06-01

The anatomical therapeutic chemical (ATC) classification system is a widely accepted drug classification scheme. This system comprises five levels and includes several classes in each level. Drugs are classified into classes according to their therapeutic effects and characteristics. The first level includes 14 main classes. In this study, we proposed two network-based models to infer novel potential chemicals deemed to belong in the first level of ATC classification. To build these models, two large chemical networks were constructed using the chemical-chemical interaction information retrieved from the Search Tool for Interactions of Chemicals (STITCH). Two classic network algorithms, shortest path (SP) and random walk with restart (RWR) algorithms, were executed on the corresponding network to mine novel chemicals for each ATC class using the validated drugs in a class as seed nodes. Then, the obtained chemicals yielded by these two algorithms were further evaluated by a permutation test and an association test. The former can exclude chemicals produced by the structure of the network, i.e., false positive discoveries. By contrast, the latter identifies the most important chemicals that have strong associations with the ATC class. Comparisons indicated that the two models can provide quite dissimilar results, suggesting that the results yielded by one model can be essential supplements for those obtained by the other model. In addition, several representative inferred chemicals were analyzed to confirm the reliability of the results generated by the two models. This article is part of a Special Issue entitled: Accelerating Precision Medicine through Genetic and Genomic Big Data Analysis edited by Yudong Cai & Tao Huang. Copyright © 2017 Elsevier B.V. All rights reserved.

A Hybrid 3D Path Planning Method for UAVs

DEFF Research Database (Denmark)

Ortiz-Arroyo, Daniel

2015-01-01

This paper presents a hybrid method for path planning in 3D spaces. We propose an improvement to a near-optimal 2D off-line algorithm and a flexible normalized on-line fuzzy controller to find shortest paths. Our method, targeted to low altitude domains, is simple and efficient. Our preliminary resu...

Light Source Estimation with Analytical Path-tracing

OpenAIRE

Kasper, Mike; Keivan, Nima; Sibley, Gabe; Heckman, Christoffer

2017-01-01

We present a novel algorithm for light source estimation in scenes reconstructed with a RGB-D camera based on an analytically-derived formulation of path-tracing. Our algorithm traces the reconstructed scene with a custom path-tracer and computes the analytical derivatives of the light transport equation from principles in optics. These derivatives are then used to perform gradient descent, minimizing the photometric error between one or more captured reference images and renders of our curre...

Vervet monkeys use paths consistent with context-specific spatial movement heuristics.

Science.gov (United States)

Teichroeb, Julie A

2015-10-01

Animal foraging routes are analogous to the computationally demanding "traveling salesman problem" (TSP), where individuals must find the shortest path among several locations before returning to the start. Humans approximate solutions to TSPs using simple heuristics or "rules of thumb," but our knowledge of how other animals solve multidestination routing problems is incomplete. Most nonhuman primate species have shown limited ability to route plan. However, captive vervets were shown to solve a TSP for six sites. These results were consistent with either planning three steps ahead or a risk-avoidance strategy. I investigated how wild vervet monkeys (Chlorocebus pygerythrus) solved a path problem with six, equally rewarding food sites; where site arrangement allowed assessment of whether vervets found the shortest route and/or used paths consistent with one of three simple heuristics to navigate. Single vervets took the shortest possible path in fewer than half of the trials, usually in ways consistent with the most efficient heuristic (the convex hull). When in competition, vervets' paths were consistent with different, more efficient heuristics dependent on their dominance rank (a cluster strategy for dominants and the nearest neighbor rule for subordinates). These results suggest that, like humans, vervets may solve multidestination routing problems by applying simple, adaptive, context-specific "rules of thumb." The heuristics that were consistent with vervet paths in this study are the same as some of those asserted to be used by humans. These spatial movement strategies may have common evolutionary roots and be part of a universal mental navigational toolkit. Alternatively, they may have emerged through convergent evolution as the optimal way to solve multidestination routing problems.

An asymmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1989-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal length. he joins queue 1 say with probability q and queue 2

Based on Short Motion Paths and Artificial Intelligence Method for Chinese Chess Game

Directory of Open Access Journals (Sweden)

Chien-Ming Hung

2017-08-01

Full Text Available The article develops the decision rules to win each set of the Chinese chess game using evaluation algorithm and artificial intelligence method, and uses the mobile robot to be instead of the chess, and presents the movement scenarios using the shortest motion paths for mobile robots. Player can play the Chinese chess game according to the game rules with the supervised computer. The supervised computer decides the optimal motion path to win the set using artificial intelligence method, and controls mobile robots according to the programmed motion paths of the assigned chesses moving on the platform via wireless RF interface. We uses enhance A* searching algorithm to solve the shortest path problem of the assigned chess, and solve the collision problems of the motion paths for two mobile robots moving on the platform simultaneously. We implement a famous set to be called lwild horses run in farmr using the proposed method. First we use simulation method to display the motion paths of the assigned chesses for the player and the supervised computer. Then the supervised computer implements the simulation results on the chessboard platform using mobile robots. Mobile robots move on the chessboard platform according to the programmed motion paths and is guided to move on the centre line of the corridor, and avoid the obstacles (chesses, and detect the cross point of the platform using three reflective IR modules.

Path spectra derived from inversion of source and site spectra for earthquakes in Southern California

Science.gov (United States)

Klimasewski, A.; Sahakian, V. J.; Baltay, A.; Boatwright, J.; Fletcher, J. B.; Baker, L. M.

2017-12-01

A large source of epistemic uncertainty in Ground Motion Prediction Equations (GMPEs) is derived from the path term, currently represented as a simple geometric spreading and intrinsic attenuation term. Including additional physical relationships between the path properties and predicted ground motions would produce more accurate and precise, region-specific GMPEs by reclassifying some of the random, aleatory uncertainty as epistemic. This study focuses on regions of Southern California, using data from the Anza network and Southern California Seismic network to create a catalog of events magnitude 2.5 and larger from 1998 to 2016. The catalog encompasses regions of varying geology and therefore varying path and site attenuation. Within this catalog of events, we investigate several collections of event region-to-station pairs, each of which share similar origin locations and stations so that all events have similar paths. Compared with a simple regional GMPE, these paths consistently have high or low residuals. By working with events that have the same path, we can isolate source and site effects, and focus on the remaining residual as path effects. We decompose the recordings into source and site spectra for each unique event and site in our greater Southern California regional database using the inversion method of Andrews (1986). This model represents each natural log record spectra as the sum of its natural log event and site spectra, while constraining each record to a reference site or Brune source spectrum. We estimate a regional, path-specific anelastic attenuation (Q) and site attenuation (t*) from the inversion site spectra and corner frequency from the inversion event spectra. We then compute the residuals between the observed record data, and the inversion model prediction (event*site spectra). This residual is representative of path effects, likely anelastic attenuation along the path that varies from the regional median attenuation. We examine the

Interpolating between random walks and optimal transportation routes: Flow with multiple sources and targets

Science.gov (United States)

Guex, Guillaume

2016-05-01

In recent articles about graphs, different models proposed a formalism to find a type of path between two nodes, the source and the target, at crossroads between the shortest-path and the random-walk path. These models include a freely adjustable parameter, allowing to tune the behavior of the path toward randomized movements or direct routes. This article presents a natural generalization of these models, namely a model with multiple sources and targets. In this context, source nodes can be viewed as locations with a supply of a certain good (e.g. people, money, information) and target nodes as locations with a demand of the same good. An algorithm is constructed to display the flow of goods in the network between sources and targets. With again a freely adjustable parameter, this flow can be tuned to follow routes of minimum cost, thus displaying the flow in the context of the optimal transportation problem or, by contrast, a random flow, known to be similar to the electrical current flow if the random-walk is reversible. Moreover, a source-targetcoupling can be retrieved from this flow, offering an optimal assignment to the transportation problem. This algorithm is described in the first part of this article and then illustrated with case studies.

Matrix-geometric analysis of the shortest queue problem with threshold jockeying

NARCIS (Netherlands)

Zijm, Willem H.M.; Adan, I.J.B.F.; Wessels, J.

1993-01-01

In this paper we study a system consisting of c parallel servers with possibly different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. An arriving job joins the shortest queue, where in case of multiple shortest queues, one of these

Analysis of the shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1989-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal length, he joins either queue with probability ½. We show

Path Generation by Avoiding Obstacles using the Intersection of Bodies

Directory of Open Access Journals (Sweden)

Komák Martin

2018-02-01

Full Text Available We will discuss the problem of path finding in 3D space with an obstacle. The thesis deals with the problem of searching for the shortest path between the individual points in the space so that this path does not come into collision with an obstacle. A system has been designed to construct paths in cross-sectional planes of the given object representing an obstacle, based on its surface contour. The system solves the issue of loading STL format, creating cross-sectional planes of the object, intersection between geometric shapes, and generation of lines around the contour of the object in 2D. An experiment was performed, in which we have been moving around a model of a jet aircraft and its results are described in the conclusion.

Feasible Path Generation Using Bezier Curves for Car-Like Vehicle

Science.gov (United States)

Latip, Nor Badariyah Abdul; Omar, Rosli

2017-08-01

When planning a collision-free path for an autonomous vehicle, the main criteria that have to be considered are the shortest distance, lower computation time and completeness, i.e. a path can be found if one exists. Besides that, a feasible path for the autonomous vehicle is also crucial to guarantee that the vehicle can reach the target destination considering its kinematic constraints such as non-holonomic and minimum turning radius. In order to address these constraints, Bezier curves is applied. In this paper, Bezier curves are modeled and simulated using Matlab software and the feasibility of the resulting path is analyzed. Bezier curve is derived from a piece-wise linear pre-planned path. It is found that the Bezier curves has the capability of making the planned path feasible and could be embedded in a path planning algorithm for an autonomous vehicle with kinematic constraints. It is concluded that the length of segments of the pre-planned path have to be greater than a nominal value, derived from the vehicle wheelbase, maximum steering angle and maximum speed to ensure the path for the autonomous car is feasible.

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.

Ants Colony Optimisation of a Measuring Path of Prismatic Parts on a CMM

Directory of Open Access Journals (Sweden)

Stojadinovic Slavenko M.

2016-03-01

Full Text Available This paper presents optimisation of a measuring probe path in inspecting the prismatic parts on a CMM. The optimisation model is based on: (i the mathematical model that establishes an initial collision-free path presented by a set of points, and (ii the solution of Travelling Salesman Problem (TSP obtained with Ant Colony Optimisation (ACO. In order to solve TSP, an ACO algorithm that aims to find the shortest path of ant colony movement (i.e. the optimised path is applied. Then, the optimised path is compared with the measuring path obtained with online programming on CMM ZEISS UMM500 and with the measuring path obtained in the CMM inspection module of Pro/ENGINEER® software. The results of comparing the optimised path with the other two generated paths show that the optimised path is at least 20% shorter than the path obtained by on-line programming on CMM ZEISS UMM500, and at least 10% shorter than the path obtained by using the CMM module in Pro/ENGINEER®.

Analysis of the asymmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

Analysis of the asymmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W. H M

1991-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

Shortest-paths preserving metro maps

NARCIS (Netherlands)

Milea, T.Y.; Schrijvers, O.J.; Buchin, K.; Haverkort, H.J.; Kreveld, van M.J.; Speckmann, B.

2012-01-01

A metro map, or subway map, is a schematic representation of a metro system of a city. The main goal of a metro map is to provide a traveler with information on which lines to take to get from station A to station B, and at which stations he needs to switch lines. It is often not beneficial to use

Separation of zeros for source signature identification under reverberant path conditions.

Science.gov (United States)

Hasegawa, Tomomi; Tohyama, Mikio

2011-10-01

This paper presents an approach to distinguishing the zeros representing a sound source from those representing the transfer function on the basis of Lyon's residue-sign model. In machinery noise diagnostics, the source signature must be separated from observation records under reverberant path conditions. In numerical examples and an experimental piano-string vibration analysis, the modal responses could be synthesized by using clustered line-spectrum modeling. The modeling error represented the source signature subject to the source characteristics being given by a finite impulse response. The modeling error can be interpreted as a remainder function necessary for the zeros representing the source signature. © 2011 Acoustical Society of America

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

Directory of Open Access Journals (Sweden)

Gross Benjamin E

2006-11-01

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

Analysis of the symmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On· arrival a job joins the shortest queue and in case both queues have equal lengths, he joins either queue with probability ½. By using

Analysis of the symmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins either queue with probability 1/2. By

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

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.

Mobile Robots Path Planning Using the Overall Conflict Resolution and Time Baseline Coordination

Directory of Open Access Journals (Sweden)

Yong Ma

2014-01-01

Full Text Available This paper aims at resolving the path planning problem in a time-varying environment based on the idea of overall conflict resolution and the algorithm of time baseline coordination. The basic task of the introduced path planning algorithms is to fulfill the automatic generation of the shortest paths from the defined start poses to their end poses with consideration of generous constraints for multiple mobile robots. Building on this, by using the overall conflict resolution, within the polynomial based paths, we take into account all the constraints including smoothness, motion boundary, kinematics constraints, obstacle avoidance, and safety constraints among robots together. And time baseline coordination algorithm is proposed to process the above formulated problem. The foremost strong point is that much time can be saved with our approach. Numerical simulations verify the effectiveness of our approach.

Column Number Density Expressions Through M = 0 and M = 1 Point Source Plumes Along Any Straight Path

Science.gov (United States)

Woronowicz, Michael

2016-01-01

Analytical expressions for column number density (CND) are developed for optical line of sight paths through a variety of steady free molecule point source models including directionally-constrained effusion (Mach number M = 0) and flow from a sonic orifice (M = 1). Sonic orifice solutions are approximate, developed using a fair simulacrum fitted to the free molecule solution. Expressions are also developed for a spherically-symmetric thermal expansion (M = 0). CND solutions are found for the most general paths relative to these sources and briefly explored. It is determined that the maximum CND from a distant location through directed effusion and sonic orifice cases occurs along the path parallel to the source plane that intersects the plume axis. For the effusive case this value is exactly twice the CND found along the ray originating from that point of intersection and extending to infinity along the plume's axis. For sonic plumes this ratio is reduced to about 4/3. For high Mach number cases the maximum CND will be found along the axial centerline path. Keywords: column number density, plume flows, outgassing, free molecule flow.

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

International Nuclear Information System (INIS)

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

2012-01-01

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

The Robot Path Planning Based on Improved Artificial Fish Swarm Algorithm

Directory of Open Access Journals (Sweden)

Yi Zhang

2016-01-01

Full Text Available Path planning is critical to the efficiency and fidelity of robot navigation. The solution of robot path planning is to seek a collision-free and the shortest path from the start node to target node. In this paper, we propose a new improved artificial fish swarm algorithm (IAFSA to process the mobile robot path planning problem in a real environment. In IAFSA, an attenuation function is introduced to improve the visual of standard AFSA and get the balance of global search and local search; also, an adaptive operator is introduced to enhance the adaptive ability of step. Besides, a concept of inertia weight factor is proposed in IAFSA inspired by PSO intelligence algorithm to improve the convergence rate and accuracy of IAFSA. Five unconstrained optimization test functions are given to illustrate the strong searching ability and ideal convergence of IAFSA. Finally, the ROS (robot operation system based experiment is carried out on a Pioneer 3-DX mobile robot; the experiment results also show the superiority of IAFSA.

A source-initiated on-demand routing algorithm based on the Thorup-Zwick theory for mobile wireless sensor networks.

Science.gov (United States)

Mao, Yuxin; Zhu, Ping

2013-01-01

The unreliability and dynamics of mobile wireless sensor networks make it hard to perform end-to-end communications. This paper presents a novel source-initiated on-demand routing mechanism for efficient data transmission in mobile wireless sensor networks. It explores the Thorup-Zwick theory to achieve source-initiated on-demand routing with time efficiency. It is able to find out shortest routing path between source and target in a network and transfer data in linear time. The algorithm is easy to be implemented and performed in resource-constrained mobile wireless sensor networks. We also evaluate the approach by analyzing its cost in detail. It can be seen that the approach is efficient to support data transmission in mobile wireless sensor networks.

FIELD EVALUATION OF A METHOD FOR ESTIMATING GASEOUS FLUXES FROM AREA SOURCES USING OPEN-PATH FOURIER TRANSFORM INFRARED

Science.gov (United States)

The paper describes preliminary results from a field experiment designed to evaluate a new approach to quantifying gaseous fugitive emissions from area air pollution sources. The new approach combines path-integrated concentration data acquired with any path-integrated optical re...

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.

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.

Local search for Steiner tree problems in graphs

NARCIS (Netherlands)

Verhoeven, M.G.A.; Severens, M.E.M.; Aarts, E.H.L.; Rayward-Smith, V.J.; Reeves, C.R.; Smith, G.D.

1996-01-01

We present a local search algorithm for the Steiner tree problem in graphs, which uses a neighbourhood in which paths in a steiner tree are exchanged. The exchange function of this neigbourhood is based on multiple-source shortest path algorithm. We present computational results for a known

Sistem Pengantaran Makanan dengan Pendayagunaan Vehicle Menggunakan Geographical Information System (GIS) dan Algoritma A Star (A*)

OpenAIRE

Lubis, Elita Sari

2016-01-01

Food delivery system is one various of geographical information systems (GIS) that can be applied through digitation process. The main case in food delivery service is the way to acquire shortest path and movement tracking of food delivery vehicle. Therefore, to accomplish the efficient food delivery system digitation process, it is needed to add facility of shortest path determination and food delivery vehicle tracking. This research uses A* shortest path algorithm to determine shortest path...

The Shortest QRS Duration of an Electrocardiogram Might Be an Optimal Electrocardiographic Predictor for Response to Cardiac Resynchronization Therapy.

Science.gov (United States)

Chen, Jan-Yow; Lin, Kuo-Hung; Chang, Kuan-Cheng; Chou, Che-Yi

2017-08-03

QRS duration has been associated with the response to cardiac resynchronization therapy (CRT). However, the methods for defining QRS duration to predict the outcome of CRT have discrepancies in previous reports. The aim of this study was to determine an optimal measurement of QRS duration to predict the response to CRT.Sixty-one patients who received CRT were analyzed. All patients had class III-IV heart failure, left ventricular ejection fraction not more than 35%, and complete left bundle branch block. The shortest, longest, and average QRS durations from the 12 leads of each electrocardiogram (ECG) were measured. The responses to CRT were determined using the changes in echocardiography after 6 months. Thirty-five (57.4%) patients were responders and 26 (42.6%) patients were non-responders. The pre-procedure shortest, average, and longest QRS durations and the QRS shortening (ΔQRS) of the shortest QRS duration were significantly associated with the response to CRT in a univariate logistic regression analysis (P = 0.002, P = 0.03, P = 0.04 and P = 0.04, respectively). Based on the measurement of the area under curve of the receiver operating characteristic curve, only the pre-procedure shortest QRS duration and the ΔQRS of the shortest QRS duration showed significant discrimination for the response to CRT (P = 0.002 and P = 0.038, respectively). Multivariable logistic regression showed the pre-procedure shortest QRS duration is an independent predictor for the response to CRT.The shortest QRS duration from the 12 leads of the electrocardiogram might be an optimal measurement to predict the response to CRT.

MARKETING DATABASES – THE SHORTEST WAY TO CLIENT’S HEART

Directory of Open Access Journals (Sweden)

Popa Adela Laura

2008-05-01

Full Text Available The aim of this paper is to present the potential which could be offered by managing databases in direct marketing through gathering the information that could offer the shortest and efficient way to the clients needs. The paper includes the necessary steps to make this activity a real success

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

Science.gov (United States)

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

2018-05-10

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

Path Planning for Mobile Objects in Four-Dimension Based on Particle Swarm Optimization Method with Penalty Function

Directory of Open Access Journals (Sweden)

Yong Ma

2013-01-01

Full Text Available We present one algorithm based on particle swarm optimization (PSO with penalty function to determine the conflict-free path for mobile objects in four-dimension (three spatial and one-time dimensions with obstacles. The shortest path of the mobile object is set as goal function, which is constrained by conflict-free criterion, path smoothness, and velocity and acceleration requirements. This problem is formulated as a calculus of variation problem (CVP. With parametrization method, the CVP is converted to a time-varying nonlinear programming problem (TNLPP. Constraints of TNLPP are transformed to general TNLPP without any constraints through penalty functions. Then, by using a little calculations and applying the algorithm PSO, the solution of the CVP is consequently obtained. Approach efficiency is confirmed by numerical examples.

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.

Differences in physical environmental characteristics between adolescents' actual and shortest cycling routes: a study using a Google Street View-based audit.

Science.gov (United States)

Verhoeven, Hannah; Van Hecke, Linde; Van Dyck, Delfien; Baert, Tim; Van de Weghe, Nico; Clarys, Peter; Deforche, Benedicte; Van Cauwenberg, Jelle

2018-05-29

The objective evaluation of the physical environmental characteristics (e.g. speed limit, cycling infrastructure) along adolescents' actual cycling routes remains understudied, although it may provide important insights into why adolescents prefer one cycling route over another. The present study aims to gain insight into the physical environmental characteristics determining the route choice of adolescent cyclists by comparing differences in physical environmental characteristics between their actual cycling routes and the shortest possible cycling routes. Adolescents (n = 204; 46.5% boys; 14.4 ± 1.2 years) recruited at secondary schools in and around Ghent (city in Flanders, northern part of Belgium) were instructed to wear a Global Positioning System device in order to identify cycling trips. For all identified cycling trips, the shortest possible route that could have been taken was calculated. Actual cycling routes that were not the shortest possible cycling routes were divided into street segments. Segments were audited with a Google Street View-based tool to assess physical environmental characteristics along actual and shortest cycling routes. Out of 160 actual cycling trips, 73.1% did not differ from the shortest possible cycling route. For actual cycling routes that were not the shortest cycling route, a speed limit of 30 km/h, roads having few buildings with windows on the street side and roads without cycle lane were more frequently present compared to the shortest possible cycling routes. A mixed land use, roads with commercial destinations, arterial roads, cycle lanes separated from traffic by white lines, small cycle lanes and cycle lanes covered by lighting were less frequently present along actual cycling routes compared to the shortest possible cycling routes. Results showed that distance mainly determines the route along which adolescents cycle. In addition, adolescents cycled more along residential streets (even if no cycle lane was

Analysis of the asymmetric shortest queue problem : part 2: numerical analysis

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

Analysis of the asymmetric shortest queue problem : Part 1: theoretical analysis

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths. be joins the first

On Finding Shortest Paths on Convex Polyhedra.

Science.gov (United States)

1985-05-01

versi ty of N laryhrid ml Collge :IJR-. M T) 207-12 COMPUTER SCIENCE TECHNICAL REPR SERWS .UE TE UNIVERSITY OF MARYLAND COLLEGE PARK, MARYLAND S 20742...planar layout can be physically interpreted as cutting the polyhedron along the ridges and unfolding the resulting object onto the plane. o% 4e.. ~16 A o

Minimizing Communication in All-Pairs Shortest Paths

Science.gov (United States)

2013-02-13

on a 16,384 vertex, 5% dense graph, is slightly faster using our approach (18.6 vs . 22.6 seconds) than using the replicated Johnson’s algorithm...Oracle and Samsung , as well as MathWorks. Research is also supported by DOE grants DE-SC0004938, DE-SC0005136, DE-SC0003959, DE-SC0008700, and AC02...Brickell, I. S. Dhillon, S. Sra, and J. A. Tropp. The metric nearness problem. SIAM J. Matrix Anal. Appl ., 30:375–396, 2008. [11] A. Buluç, J. R. Gilbert

The graph-theoretic minimum energy path problem for ionic conduction

Directory of Open Access Journals (Sweden)

Ippei Kishida

2015-10-01

Full Text Available A new computational method was developed to analyze the ionic conduction mechanism in crystals through graph theory. The graph was organized into nodes, which represent the crystal structures modeled by ionic site occupation, and edges, which represent structure transitions via ionic jumps. We proposed a minimum energy path problem, which is similar to the shortest path problem. An effective algorithm to solve the problem was established. Since our method does not use randomized algorithm and time parameters, the computational cost to analyze conduction paths and a migration energy is very low. The power of the method was verified by applying it to α-AgI and the ionic conduction mechanism in α-AgI was revealed. The analysis using single point calculations found the minimum energy path for long-distance ionic conduction, which consists of 12 steps of ionic jumps in a unit cell. From the results, the detailed theoretical migration energy was calculated as 0.11 eV by geometry optimization and nudged elastic band method. Our method can refine candidates for possible jumps in crystals and it can be adapted to other computational methods, such as the nudged elastic band method. We expect that our method will be a powerful tool for analyzing ionic conduction mechanisms, even for large complex crystals.

Tracking development paths: Monitoring driving forces and the impact of carbon-free energy sources in Spain

International Nuclear Information System (INIS)

O’ Mahony, Tadhg; Dufour, Javier

2015-01-01

Highlights: • The development path of Spain is analysed using an extended Kaya identity. • Effect of carbon free energy sources separated. • Nuclear energy acted to increase emissions as it declined in share. • Renewable energy penetration recently began to reduce carbon emissions. • Future policy must address wider factors of sustainable development. - Abstract: The evolution of the national development path has gravity in determining the future emissions outcomes of all nations. Deep reductions in emissions require a focus not just on energy and mitigation policy but on factors underlying this development. The Kaya identity has been recommended to track national progress with respect to sustainability and carbon emissions in the development path. This study applies an extended Kaya identity to the energy-related carbon emissions of Spain. Implemented through a divisia index decomposition annually from 1990 to 2011, it highlights the impact of factors such as affluence and energy intensity. A marked departure from previous studies is the separation of the effects of the carbon-free energy sources; both renewables and nuclear as fundamental mitigation measures. The results show that affluence and population have acted to increase emissions and energy intensity was increasing until recent years. Fuel substitution has acted to decrease emissions but while renewable energy has reduced emissions with the increasing importance of biomass, wind and solar, the decline in share of nuclear has acted to increase emissions. Implications for the development path and policy are discussed and lessons are relevant both for industrialised and industrialising nations

Shortest triplet clustering: reconstructing large phylogenies using representative sets

Directory of Open Access Journals (Sweden)

Sy Vinh Le

2005-04-01

Full Text Available Abstract Background Understanding the evolutionary relationships among species based on their genetic information is one of the primary objectives in phylogenetic analysis. Reconstructing phylogenies for large data sets is still a challenging task in Bioinformatics. Results We propose a new distance-based clustering method, the shortest triplet clustering algorithm (STC, to reconstruct phylogenies. The main idea is the introduction of a natural definition of so-called k-representative sets. Based on k-representative sets, shortest triplets are reconstructed and serve as building blocks for the STC algorithm to agglomerate sequences for tree reconstruction in O(n2 time for n sequences. Simulations show that STC gives better topological accuracy than other tested methods that also build a first starting tree. STC appears as a very good method to start the tree reconstruction. However, all tested methods give similar results if balanced nearest neighbor interchange (BNNI is applied as a post-processing step. BNNI leads to an improvement in all instances. The program is available at http://www.bi.uni-duesseldorf.de/software/stc/. Conclusion The results demonstrate that the new approach efficiently reconstructs phylogenies for large data sets. We found that BNNI boosts the topological accuracy of all methods including STC, therefore, one should use BNNI as a post-processing step to get better topological accuracy.

Integrated flight path planning system and flight control system for unmanned helicopters.

Science.gov (United States)

Jan, Shau Shiun; Lin, Yu Hsiang

2011-01-01

This paper focuses on the design of an integrated navigation and guidance system for unmanned helicopters. The integrated navigation system comprises two systems: the Flight Path Planning System (FPPS) and the Flight Control System (FCS). The FPPS finds the shortest flight path by the A-Star (A*) algorithm in an adaptive manner for different flight conditions, and the FPPS can add a forbidden zone to stop the unmanned helicopter from crossing over into dangerous areas. In this paper, the FPPS computation time is reduced by the multi-resolution scheme, and the flight path quality is improved by the path smoothing methods. Meanwhile, the FCS includes the fuzzy inference systems (FISs) based on the fuzzy logic. By using expert knowledge and experience to train the FIS, the controller can operate the unmanned helicopter without dynamic models. The integrated system of the FPPS and the FCS is aimed at providing navigation and guidance to the mission destination and it is implemented by coupling the flight simulation software, X-Plane, and the computing software, MATLAB. Simulations are performed and shown in real time three-dimensional animations. Finally, the integrated system is demonstrated to work successfully in controlling the unmanned helicopter to operate in various terrains of a digital elevation model (DEM).

Integrated Flight Path Planning System and Flight Control System for Unmanned Helicopters

Science.gov (United States)

Jan, Shau Shiun; Lin, Yu Hsiang

2011-01-01

This paper focuses on the design of an integrated navigation and guidance system for unmanned helicopters. The integrated navigation system comprises two systems: the Flight Path Planning System (FPPS) and the Flight Control System (FCS). The FPPS finds the shortest flight path by the A-Star (A*) algorithm in an adaptive manner for different flight conditions, and the FPPS can add a forbidden zone to stop the unmanned helicopter from crossing over into dangerous areas. In this paper, the FPPS computation time is reduced by the multi-resolution scheme, and the flight path quality is improved by the path smoothing methods. Meanwhile, the FCS includes the fuzzy inference systems (FISs) based on the fuzzy logic. By using expert knowledge and experience to train the FIS, the controller can operate the unmanned helicopter without dynamic models. The integrated system of the FPPS and the FCS is aimed at providing navigation and guidance to the mission destination and it is implemented by coupling the flight simulation software, X-Plane, and the computing software, MATLAB. Simulations are performed and shown in real time three-dimensional animations. Finally, the integrated system is demonstrated to work successfully in controlling the unmanned helicopter to operate in various terrains of a digital elevation model (DEM). PMID:22164029

Optimal path planning for a mobile robot using cuckoo search algorithm

Science.gov (United States)

Mohanty, Prases K.; Parhi, Dayal R.

2016-03-01

The shortest/optimal path planning is essential for efficient operation of autonomous vehicles. In this article, a new nature-inspired meta-heuristic algorithm has been applied for mobile robot path planning in an unknown or partially known environment populated by a variety of static obstacles. This meta-heuristic algorithm is based on the levy flight behaviour and brood parasitic behaviour of cuckoos. A new objective function has been formulated between the robots and the target and obstacles, which satisfied the conditions of obstacle avoidance and target-seeking behaviour of robots present in the terrain. Depending upon the objective function value of each nest (cuckoo) in the swarm, the robot avoids obstacles and proceeds towards the target. The smooth optimal trajectory is framed with this algorithm when the robot reaches its goal. Some simulation and experimental results are presented at the end of the paper to show the effectiveness of the proposed navigational controller.

Research on Navigation Path Planning for An Underground Load Haul Dump

Directory of Open Access Journals (Sweden)

Qi Yulong

2015-11-01

Full Text Available The improved A * algorithm is a method of navigation path planning for articulated underground scrapers. Firstly, an environment model based on a mining Geographic Information System (GIS map is established, and then combined with improved A * algorithm, the underground global path planning problem of the intelligent Load Haul Dump (LHD is solved. In this paper, for the articulated structure, the method of expanding nodes by articulation angle is adopted to make expanded nodes meet the trajectory characteristics. In addition, collision threat cost is introduced in the evaluation function to avoid collisions between the LHD and the tunnel walls. As peran analysis of the simulation test to verify the effectiveness of the improved A * algorithm and a comparison with the traditional A * algorithm, the improved A * algorithm can enhance search efficiency. Acontrast of multiple sets of test parameters suggests that when the price weighted coefficient of collision is 0.2, the shortest path can be derived to avoid impact. Finally, tracking results indicate that the proposed algorithm for navigation path planning can maintain the tracking error to within 0.2 m in line with the structural characteristics of the scraper in the laboratory environment to realize the path planning of unmanned scrapers and trajectory tracking. Moreover, the algorithm can enhance the safety of scrapers and prevent roadway collisions. The feasibility and practicality of the proposed method is verified in this work.

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.

Epidemic metapopulation model with traffic routing in scale-free networks

International Nuclear Information System (INIS)

Huang, Wei; Chen, Shengyong

2011-01-01

In this paper, we propose a model incorporating both the traffic routing dynamics and the virus prevalence dynamics. In this model, each packet may be isolated from the network on its transporting path, which means that the packet cannot be successfully delivered to its destination. In contrast, a successful transport means that a packet can be delivered from source to destination without being isolated. The effects of model parameters on the delivery success rate and the delivery failure rate are intensively studied and analyzed. Several routing strategies are performed for our model. Results show that the shortest path routing strategy is the most effective for enhancing the delivery success rate, especially when each packet is only allowed to be delivered to the neighbor with the lowest degree along the shortest path. We also find that, by minimizing the sum of the nodes' degree along the transporting path, we can also obtain a satisfactory delivery success rate

A 2D analytical cylindrical gate tunnel FET (CG-TFET) model: impact of shortest tunneling distance

Science.gov (United States)

Dash, S.; Mishra, G. P.

2015-09-01

A 2D analytical tunnel field-effect transistor (FET) potential model with cylindrical gate (CG-TFET) based on the solution of Laplace’s equation is proposed. The band-to-band tunneling (BTBT) current is derived by the help of lateral electric field and the shortest tunneling distance. However, the analysis is extended to obtain the subthreshold swing (SS) and transfer characteristics of the device. The dependency of drain current, SS and transconductance on gate voltage and shortest tunneling distance is discussed. Also, the effect of scaling the gate oxide thickness and the cylindrical body diameter on the electrical parameters of the device is analyzed.

A 2D analytical cylindrical gate tunnel FET (CG-TFET) model: impact of shortest tunneling distance

International Nuclear Information System (INIS)

Dash, S; Mishra, G P

2015-01-01

A 2D analytical tunnel field-effect transistor (FET) potential model with cylindrical gate (CG-TFET) based on the solution of Laplace’s equation is proposed. The band-to-band tunneling (BTBT) current is derived by the help of lateral electric field and the shortest tunneling distance. However, the analysis is extended to obtain the subthreshold swing (SS) and transfer characteristics of the device. The dependency of drain current, SS and transconductance on gate voltage and shortest tunneling distance is discussed. Also, the effect of scaling the gate oxide thickness and the cylindrical body diameter on the electrical parameters of the device is analyzed. (paper)

Children's route choice during active transportation to school: Difference between shortest and actual route

NARCIS (Netherlands)

Dessing, D.; Vries, S.I. de; Hegeman, G.; Verhagen, E.; Mechelen, W. van; Pierik, F.H.

2016-01-01

Background: The purpose of this study is to increase our understanding of environmental correlates that are associated with route choice during active transportation to school (ATS) by comparing characteristics of actual walking and cycling routes between home and school with the shortest possible

DESIGNING APPLICATION OF ANT COLONY SYSTEM ALGORITHM FOR THE SHORTEST ROUTE OF BANDA ACEH CITY AND ACEH BESAR REGENCY TOURISM BY USING GRAPHICAL USER INTERFACE MATLAB

Directory of Open Access Journals (Sweden)

Durisman Durisman

2017-09-01

Full Text Available Banda Aceh city and Aceh Besar Regency are two of the leading tourism areas located in the province of Aceh. For travelling, there are some important things to be considered, such as determining schedule and distance of tourism. Every tourist certainly chooses the shortest route to reach the destination since it can save time, energy, and money. The purpose of this reserach is to develop a method that can be used in calculating the shortest route and applied to the tourism of Banda Aceh city and Aceh Besar regency. In this reserach, Ant Colony Optimization algorithm is used to determine the shortest route to tourism of Banda Aceh city and Aceh Besar regency. From the analysis made by using both manual calculation and  GUI MATLAB program application test, the shortest route can be obtained with a minimum distance of 120.85 km in one travel. Based on the test result, the application for tourism (in Banda Aceh city and Aceh Besar regency shortest route searching built by utilizing the Ant Colony Optimization algorithm can find optimal route.  Keyword: tourism, the shortest route, Ant Colony Optimization

Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism

NARCIS (Netherlands)

van Houtum, Geert-Jan; Adan, I.J.B.F.; Wessels, J.; Zijm, Willem H.M.

In this paper we study a production system consisting of a group of parallel machines producing multiple job types. Each machine has its own queue and it can process a restricted set of job types only. On arrival a job joins the shortest queue among all queues capable of serving that job. Under the

Comparison of Estimation Techniques for Vibro-Acoustic Transfer Path Analysis

Directory of Open Access Journals (Sweden)

Paulo Eduardo França Padilha

2006-01-01

Full Text Available Vibro-acoustic Transfer Path Analysis (TPA is a tool to evaluate the contribution of different energy propagation paths between a source and a receiver, linked to each other by a number of connections. TPA is typically used to quantify and rank the relative importance of these paths in a given frequency band, determining the most significant one to the receiver. Basically, two quantities have to be determined for TPA: the operational forces at each transfer path and the Frequency Response Functions (FRF of these paths. The FRF are obtained either experimentally or analytically, and the influence of the mechanical impedance of the source can be taken into account or not. The operational forces can be directly obtained from measurements using force transducers or indirectly estimated from auxiliary response measurements. Two methods to obtain the operational forces indirectly – the Complex Stiffness Method (CSM and the Matrix Inversion Method (MIM – associated with two possible configurations to determine the FRF – including and excluding the source impedance – are presented and discussed in this paper. The effect of weak and strong coupling among the paths is also commented considering the techniques previously presented. The main conclusion is that, with the source removed, CSM gives more accurate results. On the other hand, with the source present, MIM is preferable. In the latter case, CSM should be used only if there is a high impedance mismatch between the source and the receiver. Both methods are not affected by a higher or lower degree of coupling among the transfer paths.

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

Modified Pagerank Algorithm Based Real-Time Metropolitan Vehicular Traffic Routing Using GPS Crowdsourcing Data

Directory of Open Access Journals (Sweden)

Adithya Guru Vaishnav.S

2015-08-01

Full Text Available This paper aims at providing a theoretical framework to find an optimized route from any source to destination considering the real-time traffic congestion issues. The distance of various possible routes from the source and destination are calculated and a PathRank is allocated in the descending order of distance to each possible path. Each intermediate locations are considered as nodes of a graph and the edges are represented by real-time traffic flow monitored using GoogleMaps GPS crowdsourcing data. The Page Rank is calculated for each intermediate node. From the values of PageRank and PathRank the minimum sum term is used to find an optimized route with minimal trade-off between shortest path and real-time traffic.

Vervet monkey (Chlorocebus pygerythrus) behavior in a multi-destination route: Evidence for planning ahead when heuristics fail.

Science.gov (United States)

Teichroeb, Julie Annette; Smeltzer, Eve Ann

2018-01-01

Animal paths are analogous to intractable mathematical problems like the Traveling Salesman Problem (TSP) and the shortest path problem (SPP). Both the TSP and SPP require an individual to find the shortest path through multiple targets but the TSP demands a return to the start, while the SPP does not. Vervet monkeys are very efficient in solving TSPs but this species is a multiple central place forager that does not always return to the same sleeping site and thus theoretically should be selected to find solutions to SPPs rather than TSPs. We examined path choice by wild vervets in an SPP experimental array where the shortest paths usually differed from those consistent with common heuristic strategies, the nearest-neighbor rule (NNR-go to the closest resource that has not been visited), and the convex hull (put a mental loop around sites, adding inner targets in order of distance from the edge)-an efficient strategy for TSPs but not SPPs. In addition, humans solving SPPs use an initial segment strategy (ISS-choose the straightest path at the beginning, only turning when necessary) and we looked at vervet paths consistent with this strategy. In 615 trials by single foragers, paths usually conformed to the NNR and rarely the slightly more efficient convex hull, supporting that vervets may be selected to solve SPPs. Further, like humans solving SPPs, vervets showed a tendency to use the ISS. Paths consistent with heuristics dropped off sharply, and use of the shortest path increased, when heuristics led to longer paths showing trade-offs in efficiency versus cognitive load. Two individuals out of 17, found the shortest path most often, showing inter-individual variation in path planning. Given support for the NNR and the ISS, we propose a new rule-of-thumb termed the "region heuristic" that vervets may apply in multi-destination routes.

Cell_motility: a cross-platform, open source application for the study of cell motion paths

Directory of Open Access Journals (Sweden)

Gevaert Kris

2006-06-01

Full Text Available Abstract Background Migration is an important aspect of cellular behaviour and is therefore widely studied in cell biology. Numerous components are known to participate in this process in a highly dynamic manner. In order to obtain a better insight in cell migration, mutants or drugs are used and their motive phenotype is then linked with the disturbing factors. One of the typical approaches to study motion paths of individual cells relies on fitting mean square displacements to a persistent random walk function. Since the numerous calculations involved often rely on diverse commercial software packages, the analysis can be expensive, labour-intensive and error-prone work. Additionally, due to the nature of algorithms employed the calculations involved are not readily reproducible without access to the exact software package(s used. Results We here present the cell_motility software, an open source Java application under the GNU-GPL license that provides a clear and concise analysis workbench for large amounts of cell motion data. Apart from performing the necessary calculations, the software also visualizes the original motion paths as well as the results of the calculations to help the user interpret the data. The application features an intuitive graphical user interface as well as full user and developer documentation and both source and binary files can be freely downloaded from the project website at http://genesis.UGent.be/cell_motility . Conclusion In providing a free, open source software solution for the automated processing of cell motion data, we aim to achieve two important goals: labs can greatly simplify their data analysis pipeline as switching between different computational software packages becomes obsolete (thus reducing the chances for human error during data manipulation and transfer and secondly, to provide scientists in the field with a freely available common platform to perform their analyses, enabling more efficient

Column Number Density Expressions Through M = 0 and M = 1 Point Source Plumes Along Any Straight Path

Science.gov (United States)

Woronowicz, Michael

2017-01-01

Providers of payloads carried aboard the International Space Station must conduct analyses to demonstrate that any planned gaseous venting events generate no more than a certain level of material that may interfere with optical measurements from other experiments or payloads located nearby. This requirement is expressed in terms of a maximum column number density (CND). Depending on the level of rarefaction, such venting may be characterized by effusion for low flow rates, or by a sonic distribution at higher levels. Since the relative locations of other sensitive payloads are often unknown because they may refer to future projects, this requirement becomes a search for the maximum CND along any path.In another application, certain astronomical observations make use of CND to estimate light attenuation from a distant star through gaseous plumes, such as the Fermi Bubbles emanating from the vicinity of the black hole at the center of our Milky Way galaxy, in order to infer the amount of material being expelled via those plumes.This paper presents analytical CND expressions developed for general straight paths based upon a free molecule point source model for steady effusive flow and for a distribution fitted to model flows from a sonic orifice. Among other things, in this Mach number range it is demonstrated that the maximum CND from a distant location occurs along the path parallel to the source plane that intersects the plume axis. For effusive flows this value is exactly twice the CND found along the ray originating from that point of intersection and extending to infinity along the plumes axis. For sonic plumes this ratio is reduced to about 43.

Small flow rate can supply inwardly migrating shortest-period planets

Directory of Open Access Journals (Sweden)

Taylor S.F.

2013-04-01

Full Text Available The number of exoplanets found with periods as short as one day and less was surprising given how fast these planets had been expected to migrate into the star due to the tides raised on the star by planets at such close distances. It has been seen as improbable that we would find planets in such a small final fraction of their lives [1]. The favored solution has been that the tidal dissipation is much weaker than expected, which would mean that the final infall would be a larger fraction of the planets’ life. We find no reason, however, to exclude the explanation that a small number of planets are continuously sent migrating inwards such that these planets indeed are in the last fraction of their lives. Following the observation that the distribution of medium planets disfavors tidal dissipation being significantly weaker than has been found from observations of binary stars [2], we now show that the numbers of planets in such a “flow” of excess planets migrating inwards is low enough that even depletion of the three-day pileup is a plausible source. Then the shortest period occurrence distribution would be shaped by planets continuously being sent into the star, which may explain the depletion of the pileup in the Kepler field relative to the solar neighborhood [3]. Because Kepler observes above the galactic plan, [3] suggested the Kepler field may include an older population of stars. The tidal dissipation strength in stars due to giant planets may be not greatly weaker than it is in binary stars.

Identification of the excitation source of the pressure vessel vibration in a Soviet built WWER PWR with signal transmission path analysis

International Nuclear Information System (INIS)

Antonopoulos-Domis, M.; Mourtzanos, K.; Por, G.

1996-01-01

Signal transmission path analysis via multivariate auto-regressive modelling was applied at signals recorded at a WWER power reactor (Paks reactor, Hungary). The core is equipped with strings of self-powered neutron detectors (SPNDs). Each string has seven SPNDs. The signals were high pass filtered with cut-off at 0.03 Hz and low pass-filtered with cut-off at 25 Hz. The analysis suggests that the source of excitation of all signals at 25 Hz is due to main coolant pump vibration. It was confirmed that there is vibration of main coolant pumps at this frequency due to a bearing problem. Signal transmission path analysis also suggests direct paths from outlet coolant to inlet coolant pressure and in-core neutron detectors at the upper part of the core. (author)

Alpha current flow betweenness centrality

NARCIS (Netherlands)

Avrachenkov, K.; Litvak, Nelli; Medyanikov, V.; Sokol, M.

2013-01-01

A class of centrality measures called betweenness centralities reflects degree of participation of edges or nodes in communication between different parts of the network. The original shortest-path betweenness centrality is based on counting shortest paths which go through a node or an edge. One of

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.

Measurements of isocenter path characteristics of the gantry rotation axis with a smartphone application

International Nuclear Information System (INIS)

Schiefer, H.; Peters, S.; Plasswilm, L.; Ingulfsen, N.; Kluckert, J.

2015-01-01

Purpose: For stereotactic radiosurgery, the AAPM Report No. 54 [AAPM Task Group 42 (AAPM, 1995)] requires the overall stability of the isocenter (couch, gantry, and collimator) to be within a 1 mm radius. In reality, a rotating system has no rigid axis and thus no isocenter point which is fixed in space. As a consequence, the isocenter concept is reviewed here. It is the aim to develop a measurement method following the revised definitions. Methods: The mechanical isocenter is defined here by the point which rotates on the shortest path in the room coordinate system. The path is labeled as “isocenter path.” Its center of gravity is assumed to be the mechanical isocenter. Following this definition, an image-based and radiation-free measurement method was developed. Multiple marker pairs in a plane perpendicular to the assumed gantry rotation axis of a linear accelerator are imaged with a smartphone application from several rotation angles. Each marker pair represents an independent measuring system. The room coordinates of the isocenter path and the mechanical isocenter are calculated based on the marker coordinates. The presented measurement method is by this means strictly focused on the mechanical isocenter. Results: The measurement result is available virtually immediately following completion of measurement. When 12 independent measurement systems are evaluated, the standard deviations of the isocenter path points and mechanical isocenter coordinates are 0.02 and 0.002 mm, respectively. Conclusions: The measurement is highly accurate, time efficient, and simple to adapt. It is therefore suitable for regular checks of the mechanical isocenter characteristics of the gantry and collimator rotation axis. When the isocenter path is reproducible and its extent is in the range of the needed geometrical accuracy, it should be taken into account in the planning process. This is especially true for stereotactic treatments and radiosurgery

Measurements of isocenter path characteristics of the gantry rotation axis with a smartphone application

Energy Technology Data Exchange (ETDEWEB)

Schiefer, H., E-mail: johann.schiefer@kssg.ch; Peters, S.; Plasswilm, L. [Klinik für Radio-Onkologie, Kantonsspital St.Gallen, Rorschacherstrasse 107, St.Gallen CH-9007 (Switzerland); Ingulfsen, N.; Kluckert, J. [Kantonsschule am Burggraben St.Gallen, Burggraben 21, St.Gallen CH-9000 (Switzerland)

2015-03-15

Purpose: For stereotactic radiosurgery, the AAPM Report No. 54 [AAPM Task Group 42 (AAPM, 1995)] requires the overall stability of the isocenter (couch, gantry, and collimator) to be within a 1 mm radius. In reality, a rotating system has no rigid axis and thus no isocenter point which is fixed in space. As a consequence, the isocenter concept is reviewed here. It is the aim to develop a measurement method following the revised definitions. Methods: The mechanical isocenter is defined here by the point which rotates on the shortest path in the room coordinate system. The path is labeled as “isocenter path.” Its center of gravity is assumed to be the mechanical isocenter. Following this definition, an image-based and radiation-free measurement method was developed. Multiple marker pairs in a plane perpendicular to the assumed gantry rotation axis of a linear accelerator are imaged with a smartphone application from several rotation angles. Each marker pair represents an independent measuring system. The room coordinates of the isocenter path and the mechanical isocenter are calculated based on the marker coordinates. The presented measurement method is by this means strictly focused on the mechanical isocenter. Results: The measurement result is available virtually immediately following completion of measurement. When 12 independent measurement systems are evaluated, the standard deviations of the isocenter path points and mechanical isocenter coordinates are 0.02 and 0.002 mm, respectively. Conclusions: The measurement is highly accurate, time efficient, and simple to adapt. It is therefore suitable for regular checks of the mechanical isocenter characteristics of the gantry and collimator rotation axis. When the isocenter path is reproducible and its extent is in the range of the needed geometrical accuracy, it should be taken into account in the planning process. This is especially true for stereotactic treatments and radiosurgery.

Food Delivery System with the Utilization of Vehicle Using Geographical Information System (GIS) and A Star Algorithm

Science.gov (United States)

Siregar, B.; Gunawan, D.; Andayani, U.; Sari Lubis, Elita; Fahmi, F.

2017-01-01

Food delivery system is one kind of geographical information systems (GIS) that can be applied through digitation process. The main case in food delivery system is the way to determine the shortest path and food delivery vehicle movement tracking. Therefore, to make sure that the digitation process of food delivery system can be applied efficiently, it is needed to add shortest path determination facility and food delivery vehicle tracking. This research uses A Star (A*) algorithm for determining shortest path and location-based system (LBS) programming for moving food delivery vehicle object tracking. According to this research, it is generated the integrated system that can be used by food delivery driver, customer, and administrator in terms of simplifying the food delivery system. Through the application of shortest path and the tracking of moving vehicle, thus the application of food delivery system in the scope of geographical information system (GIS) can be executed.

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.

A Random Riemannian Metric for Probabilistic Shortest-Path Tractography

DEFF Research Database (Denmark)

Hauberg, Søren; Schober, Michael; Liptrot, Matthew George

2015-01-01

of the diffusion tensor as a “random Riemannian metric”, where a geodesic is a distribution over tracts. We approximate this distribution with a Gaussian process and present a probabilistic numerics algorithm for computing the geodesic distribution. We demonstrate SPT improvements on data from the Human Connectome...

Distance estimation by computer vision and shortest path planning ...

African Journals Online (AJOL)

Journal Home > Vol 10, No 6S (2018) > ... The proposed way also detects and avoids obstacles in an environment using a single ... This paper has a great importance because of its fast execution speed also vision is a smart sensor as it helps ...

Distance estimation by computer vision and shortest path planning ...

African Journals Online (AJOL)

pc

2018-03-22

Mar 22, 2018 ... static or dynamic obstacle environment [1] [2] [3]. Several sensors as laser sensors, ultrasonic sensors ... decrement in processing time with higher speed. .... [1] A. Kynova, "Indoor Spatial Data Model for Wayfinding: A Case.

Source and path characteristics of earthquakes occurring off the Kii peninsula

International Nuclear Information System (INIS)

Shiba, Yoshiaki; Sato, Hiroaki

2007-01-01

The characteristics of strong ground motions during the 2004 off the Kii peninsula earthquake sequence are examined based on the records observed on the rock outcrops. These events, including the foreshock of M JMA 7.1, the main shock of M JMA 7.4, and the largest aftershock of M JMA 6.5, are all the intra-plate earthquakes occurring in the outer rise region of the Philippine Sea plate close to the Nankai-Trough. Very large long-period ground motions are observed in sedimentary basins far from source area during the foreshock and the main shock, however, the excitation of short-period motions agrees well with the empirical relations assuming the inter-plate or inland events, rather than the intra-plate ones. Furthermore the spectral inversion analysis exhibits the Q s values beneath the Kii peninsula region are higher than average ones estimated at other areas in Japan, due to relatively long propagating path through the high-Q oceanic plate. The local site effects derived from the spectral inversion analysis correspond to the residual spectra in the rock-outcrop site, and also to the one-dimensional amplification function based on the PS logging data in the KiK-net site with S-wave velocity at basement higher than 2.2 km/s. Finally we verified that the amplitude levels of acceleration source spectra in the shorter periods of the Kii-peninsula events distribute near the empirical relationships to the seismic moments. (author)

Nearby Search Indekos Based Android Using A Star (A*) Algorithm

Science.gov (United States)

Siregar, B.; Nababan, EB; Rumahorbo, JA; Andayani, U.; Fahmi, F.

2018-03-01

Indekos or rented room is a temporary residence for months or years. Society of academicians who come from out of town need a temporary residence, such as Indekos or rented room during their education, teaching, or duties. They are often found difficulty in finding a Indekos because lack of information about the Indekos. Besides, new society of academicians don’t recognize the areas around the campus and desire the shortest path from Indekos to get to the campus. The problem can be solved by implementing A Star (A*) algorithm. This algorithm is one of the shortest path algorithm to a finding shortest path from campus to the Indekos application, where the faculties in the campus as the starting point of the finding. Determination of the starting point used in this study aims to allow students to determine the starting point in finding the Indekos. The mobile based application facilitates the finding anytime and anywhere. Based on the experimental results, A* algorithm can find the shortest path with 86,67% accuracy.

Influence of drag force upon the shortest time trajectory of an aircraft

Directory of Open Access Journals (Sweden)

Andrei CRAIFALEANU

2015-06-01

Full Text Available The shortest time trajectory of an aircraft between two given locations is determined using a simple mathematical model. By taking into account the drag force (viscous friction force with the air, a problem of variational calculus is obtained which consists in determining two functions that minimize a functional, subject to a non-holonomic constraint. The trajectory is determined directly, by numerical integration of Euler equations with multipliers. Three types of drag forces were considered: constant, linear and quadratic. The results are verified through comparison to the values obtained from numerical minimization of the involved functional approximate forms.

Depolarization on Earth-space paths

Science.gov (United States)

1981-01-01

Sources of depolarization effects on the propagation paths of orthogonally-polarized information channels are considered. The main sources of depolarization at millimeter wave frequencies are hydrometeor absorption and scattering in the troposphere. Terms are defined. Mathematical formulations for the effects of the propagation medium characteristics and antenna performance on signals in dual polarization Earth-space links are presented. Techniques for modeling rain and ice depolarization are discussed.

Kudi: A free open-source python library for the analysis of properties along reaction paths.

Science.gov (United States)

Vogt-Geisse, Stefan

2016-05-01

With increasing computational capabilities, an ever growing amount of data is generated in computational chemistry that contains a vast amount of chemically relevant information. It is therefore imperative to create new computational tools in order to process and extract this data in a sensible way. Kudi is an open source library that aids in the extraction of chemical properties from reaction paths. The straightforward structure of Kudi makes it easy to use for users and allows for effortless implementation of new capabilities, and extension to any quantum chemistry package. A use case for Kudi is shown for the tautomerization reaction of formic acid. Kudi is available free of charge at www.github.com/stvogt/kudi.

Personal computer based decision support system for routing nuclear spent fuel

International Nuclear Information System (INIS)

Chin, Shih-Miao; Joy, D.S.; Johnson, P.E.; Bobic, S.M.; Miaou, Shaw-Pin

1989-01-01

An approach has been formulated to route nuclear spent fuel over the US Interstate highway network. This approach involves the generation of alternative routes so that any potential adverse impacts will not only concentrate on regions along the shortest path between the nuclear power plant and repository. Extensive literature research on the shortest path finding algorithms has been carried out. Consequently, an extremely efficient shortest path algorithm has been implemented and significantly increases the overall system performance. State-of-the-art interactive computer graphics is used. In addition to easy-to-use pop-up menus, full color mapping and display capabilities are also incorporated. All of these features have been implemented on commonly available personal computers. 6 figs., 2 tabs

Fair sharing of resources in a supply network with constraints

Science.gov (United States)

Carvalho, Rui; Buzna, Lubos; Just, Wolfram; Helbing, Dirk; Arrowsmith, David K.

2012-04-01

This paper investigates the effect of network topology on the fair allocation of network resources among a set of agents, an all-important issue for the efficiency of transportation networks all around us. We analyze a generic mechanism that distributes network capacity fairly among existing flow demands. The problem can be solved by semianalytical methods on a nearest-neighbor graph with one source and sink pair, when transport occurs over shortest paths. For this setup, we uncover a broad range of patterns of intersecting shortest paths as a function of the distance between the source and the sink. When the number of intersections is the maximum and the distance between the source and the sink is large, we find that a fair allocation implies a decrease of at least 50% from the maximum throughput. We also find that the histogram of the flow allocations assigned to the agents decays as a power law with exponent -1. Our semianalytical framework suggests possible explanations for the well-known reduction of the throughput in fair allocations. It also suggests that the combination of network topology and routing rules can lead to highly uneven (but fair) distributions of resources, a remark of caution to network designers.

Drosophila learn efficient paths to a food source.

Science.gov (United States)

Navawongse, Rapeechai; Choudhury, Deepak; Raczkowska, Marlena; Stewart, James Charles; Lim, Terrence; Rahman, Mashiur; Toh, Alicia Guek Geok; Wang, Zhiping; Claridge-Chang, Adam

2016-05-01

Elucidating the genetic, and neuronal bases for learned behavior is a central problem in neuroscience. A leading system for neurogenetic discovery is the vinegar fly Drosophila melanogaster; fly memory research has identified genes and circuits that mediate aversive and appetitive learning. However, methods to study adaptive food-seeking behavior in this animal have lagged decades behind rodent feeding analysis, largely due to the challenges presented by their small scale. There is currently no method to dynamically control flies' access to food. In rodents, protocols that use dynamic food delivery are a central element of experimental paradigms that date back to the influential work of Skinner. This method is still commonly used in the analysis of learning, memory, addiction, feeding, and many other subjects in experimental psychology. The difficulty of microscale food delivery means this is not a technique used in fly behavior. In the present manuscript we describe a microfluidic chip integrated with machine vision and automation to dynamically control defined liquid food presentations and sensory stimuli. Strikingly, repeated presentations of food at a fixed location produced improvements in path efficiency during food approach. This shows that improved path choice is a learned behavior. Active control of food availability using this microfluidic system is a valuable addition to the methods currently available for the analysis of learned feeding behavior in flies. Copyright © 2016 The Authors. Published by Elsevier Inc. All rights reserved.

Complexity in human transportation networks: a comparative analysis of worldwide air transportation and global cargo-ship movements

Science.gov (United States)

Woolley-Meza, O.; Thiemann, C.; Grady, D.; Lee, J. J.; Seebens, H.; Blasius, B.; Brockmann, D.

2011-12-01

We present a comparative network-theoretic analysis of the two largest global transportation networks: the worldwide air-transportation network (WAN) and the global cargo-ship network (GCSN). We show that both networks exhibit surprising statistical similarities despite significant differences in topology and connectivity. Both networks exhibit a discontinuity in node and link betweenness distributions which implies that these networks naturally segregate into two different classes of nodes and links. We introduce a technique based on effective distances, shortest paths and shortest path trees for strongly weighted symmetric networks and show that in a shortest path tree representation the most significant features of both networks can be readily seen. We show that effective shortest path distance, unlike conventional geographic distance measures, strongly correlates with node centrality measures. Using the new technique we show that network resilience can be investigated more precisely than with contemporary techniques that are based on percolation theory. We extract a functional relationship between node characteristics and resilience to network disruption. Finally we discuss the results, their implications and conclude that dynamic processes that evolve on both networks are expected to share universal dynamic characteristics.

Particle swarm optimization for determining shortest distance to voltage collapse

Energy Technology Data Exchange (ETDEWEB)

Arya, L.D.; Choube, S.C. [Electrical Engineering Department, S.G.S.I.T.S. Indore, MP 452 003 (India); Shrivastava, M. [Electrical Engineering Department, Government Engineering College Ujjain, MP 456 010 (India); Kothari, D.P. [Centre for Energy Studies, Indian Institute of Technology, Delhi (India)

2007-12-15

This paper describes an algorithm for computing shortest distance to voltage collapse or determination of CSNBP using PSO technique. A direction along CSNBP gives conservative results from voltage security view point. This information is useful to the operator to steer the system away from this point by taking corrective actions. The distance to a closest bifurcation is a minimum of the loadability given a slack bus or participation factors for increasing generation as the load increases. CSNBP determination has been formulated as an optimization problem to be used in PSO technique. PSO is a new evolutionary algorithm (EA) which is population based inspired by the social behavior of animals such as fish schooling and birds flocking. It can handle optimization problems with any complexity since mechanization is simple with few parameters to be tuned. The developed algorithm has been implemented on two standard test systems. (author)

Gibbon travel paths are goal oriented.

Science.gov (United States)

Asensio, Norberto; Brockelman, Warren Y; Malaivijitnond, Suchinda; Reichard, Ulrich H

2011-05-01

Remembering locations of food resources is critical for animal survival. Gibbons are territorial primates which regularly travel through small and stable home ranges in search of preferred, limited and patchily distributed resources (primarily ripe fruit). They are predicted to profit from an ability to memorize the spatial characteristics of their home range and may increase their foraging efficiency by using a 'cognitive map' either with Euclidean or with topological properties. We collected ranging and feeding data from 11 gibbon groups (Hylobates lar) to test their navigation skills and to better understand gibbons' 'spatial intelligence'. We calculated the locations at which significant travel direction changes occurred using the change-point direction test and found that these locations primarily coincided with preferred fruit sources. Within the limits of biologically realistic visibility distances observed, gibbon travel paths were more efficient in detecting known preferred food sources than a heuristic travel model based on straight travel paths in random directions. Because consecutive travel change-points were far from the gibbons' sight, planned movement between preferred food sources was the most parsimonious explanation for the observed travel patterns. Gibbon travel appears to connect preferred food sources as expected under the assumption of a good mental representation of the most relevant sources in a large-scale space.

Reaction-diffusion path planning in a hybrid chemical and cellular-automaton processor

International Nuclear Information System (INIS)

Adamatzky, Andrew; Lacy Costello, Benjamin de

2003-01-01

To find the shortest collision-free path in a room containing obstacles we designed a chemical processor and coupled it with a cellular-automaton processor. In the chemical processor obstacles are represented by sites of high concentration of potassium iodide and a planar substrate is saturated with palladium chloride. Potassium iodide diffuses into the substrate and reacts with palladium chloride. A dark coloured precipitate of palladium iodide is formed almost everywhere except sites where two or more diffusion wavefronts collide. The less coloured sites are situated at the furthest distance from obstacles. Thus, the chemical processor develops a repulsive field, generated by obstacles. A snapshot of the chemical processor is inputted to a cellular automaton. The automaton behaves like a discrete excitable media; also, every cell of the automaton is supplied with a pointer that shows an origin of the cell's excitation. The excitation spreads along the cells corresponding to precipitate depleted sites of the chemical processor. When the destination-site is excited, waves travel on the lattice and update the orientations of the pointers. Thus, the automaton constructs a spanning tree, made of pointers, that guides a traveler towards the destination point. Thus, the automaton medium generates an attractive field and combination of this attractive field with the repulsive field, generated by the chemical processor, provides us with a solution of the collision-free path problem

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

[Not Available].

Science.gov (United States)

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

2009-01-01

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

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.

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.

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

NSRD-10: Leak Path Factor Guidance Using MELCOR

Energy Technology Data Exchange (ETDEWEB)

Louie, David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Humphries, Larry L. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2017-03-01

Estimates of the source term from a U.S. Department of Energy (DOE) nuclear facility requires that the analysts know how to apply the simulation tools used, such as the MELCOR code, particularly for a complicated facility that may include an air ventilation system and other active systems that can influence the environmental pathway of the materials released. DOE has designated MELCOR 1.8.5, an unsupported version, as a DOE ToolBox code in its Central Registry, which includes a leak-path-factor guidance report written in 2004 that did not include experimental validation data. To continue to use this MELCOR version requires additional verification and validations, which may not be feasible from a project cost standpoint. Instead, the recent MELCOR should be used. Without any developer support and lack of experimental data validation, it is difficult to convince regulators that the calculated source term from the DOE facility is accurate and defensible. This research replaces the obsolete version in the 2004 DOE leak path factor guidance report by using MELCOR 2.1 (the latest version of MELCOR with continuing modeling development and user support) and by including applicable experimental data from the reactor safety arena and from applicable experimental data used in the DOE-HDBK-3010. This research provides best practice values used in MELCOR 2.1 specifically for the leak path determination. With these enhancements, the revised leak-path-guidance report should provide confidence to the DOE safety analyst who would be using MELCOR as a source-term determination tool for mitigated accident evaluations.

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.

Investigating scintillometer source areas

Science.gov (United States)

Perelet, A. O.; Ward, H. C.; Pardyjak, E.

2017-12-01

Scintillometry is an indirect ground-based method for measuring line-averaged surface heat and moisture fluxes on length scales of 0.5 - 10 km. These length scales are relevant to urban and other complex areas where setting up traditional instrumentation like eddy covariance is logistically difficult. In order to take full advantage of scintillometry, a better understanding of the flux source area is needed. The source area for a scintillometer is typically calculated as a convolution of point sources along the path. A weighting function is then applied along the path to compensate for a total signal contribution that is biased towards the center of the beam path, and decreasing near the beam ends. While this method of calculating the source area provides an estimate of the contribution of the total flux along the beam, there are still questions regarding the physical meaning of the weighted source area. These questions are addressed using data from an idealized experiment near the Salt Lake City International Airport in northern Utah, U.S.A. The site is a flat agricultural area consisting of two different land uses. This simple heterogeneity in the land use facilitates hypothesis testing related to source areas. Measurements were made with a two wavelength scintillometer system spanning 740 m along with three standard open-path infrared gas analyzer-based eddy-covariance stations along the beam path. This configuration allows for direct observations of fluxes along the beam and comparisons to the scintillometer average. The scintillometer system employed measures the refractive index structure parameter of air for two wavelengths of electromagnetic radiation, 880 μm and 1.86 cm to simultaneously estimate path-averaged heat and moisture fluxes, respectively. Meteorological structure parameters (CT2, Cq2, and CTq) as well as surface fluxes are compared for various amounts of source area overlap between eddy covariance and scintillometry. Additionally, surface

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.

Path to Market for Compact Modular Fusion Power Cores

Science.gov (United States)

Woodruff, Simon; Baerny, Jennifer K.; Mattor, Nathan; Stoulil, Don; Miller, Ronald; Marston, Theodore

2012-08-01

The benefits of an energy source whose reactants are plentiful and whose products are benign is hard to measure, but at no time in history has this energy source been more needed. Nuclear fusion continues to promise to be this energy source. However, the path to market for fusion systems is still regularly a matter for long-term (20 + year) plans. This white paper is intended to stimulate discussion of faster commercialization paths, distilling guidance from investors, utilities, and the wider energy research community (including from ARPA-E). There is great interest in a small modular fusion system that can be developed quickly and inexpensively. A simple model shows how compact modular fusion can produce a low cost development path by optimizing traditional systems that burn deuterium and tritium, operating not only at high magnetic field strength, but also by omitting some components that allow for the core to become more compact and easier to maintain. The dominant hurdles to the development of low cost, practical fusion systems are discussed, primarily in terms of the constraints placed on the cost of development stages in the private sector. The main finding presented here is that the bridge from DOE Office of Science to the energy market can come at the Proof of Principle development stage, providing the concept is sufficiently compact and inexpensive that its development allows for a normal technology commercialization path.

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.

Path Transmissibility Analysis Considering Two Types of Correlations in Hydropower Stations

Directory of Open Access Journals (Sweden)

Baoping Zhi

2013-01-01

Full Text Available A new vibration model is built by introducing the head-cover vibration transfer path based on a previous analysis of the vertical vibration model for hydropower station units and powerhouses. This research focuses on disturbance- and parameter-related transfer paths in a practical situation. In a complex situation, the application of the stochastic perturbation method is expanded using an algebra synthesis method the Hadamard product, and theoretical analyses, and numerical simulations of transfer paths in the new vibration model are carried out through the expanded perturbation method. The path transfer force, the path transmissibility, and the path disturbance ranges in the frequency domain are provided. The results indicate that the methods proposed in this study can efficiently reduce the disturbance range and can accurately analyze the transfer paths of hydraulic-source vertical vibration in hydropower stations.

Towards use of Dijkstra Algorithm for Optimal Navigation of an Unmanned Surface Vehicle in a Real-Time Marine Environment with results from Artificial Potential Field

Directory of Open Access Journals (Sweden)

Yogang Singh

2018-03-01

Full Text Available The growing need of ocean surveying and exploration for scientific and industrial application has led to the requirement of routing strategies for ocean vehicles which are optimal in nature. Most of the op-timal path planning for marine vehicles had been conducted offline in a self-made environment. This paper takes into account a practical marine environment, i.e. Portsmouth Harbour, for finding an optimal path in terms of computational time between source and end points on a real time map for an USV. The current study makes use of a grid map generated from original and uses a Dijkstra algorithm to find the shortest path for a single USV. In order to benchmark the study, a path planning study using a well-known local path planning method artificial path planning (APF has been conducted in a real time marine environment and effectiveness is measured in terms of path length and computational time.

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.

Potential paths for male-mediated gene flow to and from an isolated grizzly bear population

Science.gov (United States)

Peck, Christopher P.; van Manen, Frank T.; Costello, Cecily M.; Haroldson, Mark A.; Landenburger, Lisa; Roberts, Lori L.; Bjornlie, Daniel D.; Mace, Richard D.

2017-01-01

For several decades, grizzly bear populations in the Greater Yellowstone Ecosystem (GYE) and the Northern Continental Divide Ecosystem (NCDE) have increased in numbers and range extent. The GYE population remains isolated and although effective population size has increased since the early 1980s, genetic connectivity between these populations remains a long-term management goal. With only ~110 km distance separating current estimates of occupied range for these populations, the potential for gene flow is likely greater now than it has been for many decades. We sought to delineate potential paths that would provide the opportunity for male-mediated gene flow between the two populations. We first developed step-selection functions to generate conductance layers using ecological, physical, and anthropogenic landscape features associated with non-stationary GPS locations of 124 male grizzly bears (199 bear-years). We then used a randomized shortest path (RSP) algorithm to estimate the average number of net passages for all grid cells in the study region, when moving from an origin to a destination node. Given habitat characteristics that were the basis for the conductance layer, movements follow certain grid cell sequences more than others and the resulting RSP values thus provide a measure of movement potential. Repeating this process for 100 pairs of random origin and destination nodes, we identified paths for three levels of random deviation (θ) from the least-cost path. We observed broad-scale concordance between model predictions for paths originating in the NCDE and those originating in the GYE for all three levels of movement exploration. Model predictions indicated that male grizzly bear movement between the ecosystems could involve a variety of routes, and verified observations of grizzly bears outside occupied range supported this finding. Where landscape features concentrated paths into corridors (e.g., because of anthropogenic influence), they typically

Polarization measurements through space-to-ground atmospheric propagation paths by using a highly polarized laser source in space.

Science.gov (United States)

Toyoshima, Morio; Takenaka, Hideki; Shoji, Yozo; Takayama, Yoshihisa; Koyama, Yoshisada; Kunimori, Hiroo

2009-12-07

The polarization characteristics of an artificial laser source in space were measured through space-to-ground atmospheric transmission paths. An existing Japanese laser communication satellite and optical ground station were used to measure Stokes parameters and the degree of polarization of the laser beam transmitted from the satellite. As a result, the polarization was preserved within an rms error of 1.6 degrees, and the degree of polarization was 99.4+/-4.4% through the space-to-ground atmosphere. These results contribute to the link estimation for quantum key distribution via space and provide the potential for enhancements in quantum cryptography worldwide in the future.

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.

Resilience of electricity grids against transmission line overloads under wind power injection at different nodes.

Science.gov (United States)

Schiel, Christoph; Lind, Pedro G; Maass, Philipp

2017-09-14

A steadily increasing fraction of renewable energy sources for electricity production requires a better understanding of how stochastic power generation affects the stability of electricity grids. Here, we assess the resilience of an IEEE test grid against single transmission line overloads under wind power injection based on the dc power flow equations and a quasi-static grid response to wind fluctuations. Thereby we focus on the mutual influence of wind power generation at different nodes. We find that overload probabilities vary strongly between different pairs of nodes and become highly affected by spatial correlations of wind fluctuations. An unexpected behaviour is uncovered: for a large number of node pairs, increasing wind power injection at one node can increase the power threshold at the other node with respect to line overloads in the grid. We find that this seemingly paradoxical behaviour is related to the topological distance of the overloaded line from the shortest path connecting the wind nodes. In the considered test grid, it occurs for all node pairs, where the overloaded line belongs to the shortest path.

Improving Estimation of Betweenness Centrality for Scale-Free Graphs

Energy Technology Data Exchange (ETDEWEB)

Bromberger, Seth A. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Klymko, Christine F. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Henderson, Keith A. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Pearce, Roger [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Sanders, Geoff [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

2017-11-07

Betweenness centrality is a graph statistic used to nd vertices that are participants in a large number of shortest paths in a graph. This centrality measure is commonly used in path and network interdiction problems and its complete form requires the calculation of all-pairs shortest paths for each vertex. This leads to a time complexity of O(jV jjEj), which is impractical for large graphs. Estimation of betweenness centrality has focused on performing shortest-path calculations on a subset of randomly- selected vertices. This reduces the complexity of the centrality estimation to O(jSjjEj); jSj < jV j, which can be scaled appropriately based on the computing resources available. An estimation strategy that uses random selection of vertices for seed selection is fast and simple to implement, but may not provide optimal estimation of betweenness centrality when the number of samples is constrained. Our experimentation has identi ed a number of alternate seed-selection strategies that provide lower error than random selection in common scale-free graphs. These strategies are discussed and experimental results are presented.

PATH ANALYSIS OF RECORDING SYSTEM INNOVATION FACTORS AFFECTING ADOPTION OF GOAT FARMERS

Directory of Open Access Journals (Sweden)

S. Okkyla

2014-09-01

Full Text Available The objective of this study was to evaluate the path analysis of recording system innovation factorsaffecting adoption of goat farmers. This study was conducted from January to February 2014 inPringapus District, Semarang Regency by using survey method. For determining the location, this studyused purposive sampling method. The amount of respondents were determined by quota samplingmethod. Total respondents randomly chosed were 146 farmers. The data were descriptively andquantitatively analyzed by using path analysis of statistical package for the social science (SPSS 16.Independent variables in this study were internal factor, motivation, innovation characteristics,information source, and dependent variable was adoption. Analysis of linear regression showed thatthere was no significant effect of internal factor on adoption, so that it was important to use the trimmingmethod in path analysis. The result of path analysis showed that the influence of motivation, innovationcharacteristics and information source on adoption were 0.168; 0.720 and 0.09, respectively. Innovationcharacteristics were the greatest effect on adoption. In conclusion, by improving innovationcharacteristics of respondent through motivation and information source may significantly increase theadoption of recording system in goat farmers.

Rotational error in path integration: encoding and execution errors in angle reproduction.

Science.gov (United States)

Chrastil, Elizabeth R; Warren, William H

2017-06-01

Path integration is fundamental to human navigation. When a navigator leaves home on a complex outbound path, they are able to keep track of their approximate position and orientation and return to their starting location on a direct homebound path. However, there are several sources of error during path integration. Previous research has focused almost exclusively on encoding error-the error in registering the outbound path in memory. Here, we also consider execution error-the error in the response, such as turning and walking a homebound trajectory. In two experiments conducted in ambulatory virtual environments, we examined the contribution of execution error to the rotational component of path integration using angle reproduction tasks. In the reproduction tasks, participants rotated once and then rotated again to face the original direction, either reproducing the initial turn or turning through the supplementary angle. One outstanding difficulty in disentangling encoding and execution error during a typical angle reproduction task is that as the encoding angle increases, so does the required response angle. In Experiment 1, we dissociated these two variables by asking participants to report each encoding angle using two different responses: by turning to walk on a path parallel to the initial facing direction in the same (reproduction) or opposite (supplementary angle) direction. In Experiment 2, participants reported the encoding angle by turning both rightward and leftward onto a path parallel to the initial facing direction, over a larger range of angles. The results suggest that execution error, not encoding error, is the predominant source of error in angular path integration. These findings also imply that the path integrator uses an intrinsic (action-scaled) rather than an extrinsic (objective) metric.

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.

Incorporation prior belief in the general path model: A comparison of information sources

International Nuclear Information System (INIS)

Coble, Jamie; Hines, Wesley

2014-01-01

The general path model (GPM) is one approach for performing degradation-based, or Type III, prognostics. The GPM fits a parametric function to the collected observations of a prognostic parameter and extrapolates the fit to a failure threshold. This approach has been successfully applied to a variety of systems when a sufficient number of prognostic parameter observations are available. However, the parametric fit can suffer significantly when few data are available or the data are very noisy. In these instances, it is beneficial to include additional information to influence the fit to conform to a prior belief about the evolution of system degradation. Bayesian statistical approaches have been proposed to include prior information in the form of distributions of expected model parameters. This requires a number of run-to-failure cases with tracked prognostic parameters; these data may not be readily available for many systems. Reliability information and stressor-based (Type I and Type II, respectively) prognostic estimates can provide the necessary prior belief for the GPM. This article presents the Bayesian updating framework to include prior information in the GPM and compares the efficacy of including different information sources on two data sets.

Load Balancing Routing with Bounded Stretch

Directory of Open Access Journals (Sweden)

Chen Siyuan

2010-01-01

Full Text Available Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However, shortest path-based routing protocols suffer from uneven load distribution in the network, such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load, we propose a novel routing method, called Circular Sailing Routing (CSR, which can distribute the traffic more evenly in the network. The proposed method first maps the network onto a sphere via a simple stereographic projection, and then the route decision is made by a newly defined "circular distance" on the sphere instead of the Euclidean distance in the plane. We theoretically prove that for a network, the distance traveled by the packets using CSR is no more than a small constant factor of the minimum (the distance of the shortest path. We also extend CSR to a localized version, Localized CSR, by modifying greedy routing without any additional communication overhead. In addition, we investigate how to design CSR routing for 3D networks. For all proposed methods, we conduct extensive simulations to study their performances and compare them with global shortest path routing or greedy routing in 2D and 3D wireless networks.

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.

MARRT: Medial Axis biased rapidly-exploring random trees

KAUST Repository

Denny, Jory; Greco, Evan; Thomas, Shawna; Amato, Nancy M.

2014-01-01

© 2014 IEEE. Motion planning is a difficult and widely studied problem in robotics. Current research aims not only to find feasible paths, but to ensure paths have certain properties, e.g., shortest or safest paths. This is difficult for current

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.

Ranking the Stars: Network Analysis of Bilateral Tax Treaties

OpenAIRE

Maarten van 't Riet; Arjan Lejour

2014-01-01

With a novel approach this paper sheds light on the international tax planning possibilities of multinationals. The international corporate tax system is considered a network, just like for transportation, and ‘shortest’ paths are computed, minimizing tax payments for the multinationals when repatriating profits. Read the accompanying press release and background document A and B . The network consists of 108 jurisdictions, and the ‘shortest’ paths are constructed from the rates of co...

On the optical path length in refracting media

Science.gov (United States)

Hasbun, Javier E.

2018-04-01

The path light follows as it travels through a substance depends on the substance's index of refraction. This path is commonly known as the optical path length (OPL). In geometrical optics, the laws of reflection and refraction are simple examples for understanding the path of light travel from source to detector for constant values of the traveled substances' refraction indices. In more complicated situations, the Euler equation can be quite useful and quite important in optics courses. Here, the well-known Euler differential equation (EDE) is used to obtain the OPL for several index of refraction models. For pedagogical completeness, the OPL is also obtained through a modified Monte Carlo (MC) method, versus which the various results obtained through the EDE are compared. The examples developed should be important in projects involving undergraduate as well as graduate students in an introductory optics course. A simple matlab script (program) is included that can be modified by students who wish to pursue the subject further.

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

Flexible integration of path-planning capabilities

Science.gov (United States)

Stobie, Iain C.; Tambe, Milind; Rosenbloom, Paul S.

1993-05-01

Robots pursuing complex goals must plan paths according to several criteria of quality, including shortness, safety, speed and planning time. Many sources and kinds of knowledge, such as maps, procedures and perception, may be available or required. Both the quality criteria and sources of knowledge may vary widely over time, and in general they will interact. One approach to address this problem is to express all criteria and goals numerically in a single weighted graph, and then to search this graph to determine a path. Since this is problematic with symbolic or uncertain data and interacting criteria, we propose that what is needed instead is an integration of many kinds of planning capabilities. We describe a hybrid approach to integration, based on experiments with building simulated mobile robots using Soar, an integrated problem-solving and learning system. For flexibility, we have implemented a combination of internal planning, reactive capabilities and specialized tools. We illustrate how these components can complement each other's limitations and produce plans which integrate geometric and task knowledge.

Dynamic route guidance algorithm based algorithm based on artificial immune system

Institute of Scientific and Technical Information of China (English)

无

2007-01-01

To improve the performance of the K-shortest paths search in intelligent traffic guidance systems,this paper proposes an optimal search algorithm based on the intelligent optimization search theory and the memphor mechanism of vertebrate immune systems.This algorithm,applied to the urban traffic network model established by the node-expanding method,can expediently realize K-shortest paths search in the urban traffic guidance systems.Because of the immune memory and global parallel search ability from artificial immune systems,K shortest paths can be found without any repeat,which indicates evidently the superiority of the algorithm to the conventional ones.Not only does it perform a better parallelism,the algorithm also prevents premature phenomenon that often occurs in genetic algorithms.Thus,it is especially suitable for real-time requirement of the traffic guidance system and other engineering optimal applications.A case study verifies the efficiency and the practicability of the algorithm aforementioned.

Filtered backprojection proton CT reconstruction along most likely paths

Energy Technology Data Exchange (ETDEWEB)

Rit, Simon; Dedes, George; Freud, Nicolas; Sarrut, David; Letang, Jean Michel [Universite de Lyon, CREATIS, CNRS UMR5220, Inserm U1044, INSA-Lyon, Universite Lyon 1, Centre Leon Berard, 69008 Lyon (France)

2013-03-15

Purpose: Proton CT (pCT) has the potential to accurately measure the electron density map of tissues at low doses but the spatial resolution is prohibitive if the curved paths of protons in matter is not accounted for. The authors propose to account for an estimate of the most likely path of protons in a filtered backprojection (FBP) reconstruction algorithm. Methods: The energy loss of protons is first binned in several proton radiographs at different distances to the proton source to exploit the depth-dependency of the estimate of the most likely path. This process is named the distance-driven binning. A voxel-specific backprojection is then used to select the adequate radiograph in the distance-driven binning in order to propagate in the pCT image the best achievable spatial resolution in proton radiographs. The improvement in spatial resolution is demonstrated using Monte Carlo simulations of resolution phantoms. Results: The spatial resolution in the distance-driven binning depended on the distance of the objects from the source and was optimal in the binned radiograph corresponding to that distance. The spatial resolution in the reconstructed pCT images decreased with the depth in the scanned object but it was always better than previous FBP algorithms assuming straight line paths. In a water cylinder with 20 cm diameter, the observed range of spatial resolutions was 0.7 - 1.6 mm compared to 1.0 - 2.4 mm at best with a straight line path assumption. The improvement was strongly enhanced in shorter 200 Degree-Sign scans. Conclusions: Improved spatial resolution was obtained in pCT images with filtered backprojection reconstruction using most likely path estimates of protons. The improvement in spatial resolution combined with the practicality of FBP algorithms compared to iterative reconstruction algorithms makes this new algorithm a candidate of choice for clinical pCT.

Two path transport measurements on a triple quantum dot

Energy Technology Data Exchange (ETDEWEB)

Rogge, Maximilian C.; Haug, Rolf J. [Institut fuer Festkoerperphysik, Leibniz Universitaet Hannover, Appelstr. 2, 30167 Hannover (Germany)

2008-07-01

We present a novel triple quantum dot device made with local anodic oxidation on a GaAs/AlGaAs heterostructure. The geometry provides two path transport via a three lead setup with each lead connected to one of the three quantum dots. In addition charge detection is implemented via a quantum point contact. One lead is used as a common source contact, the other two are used as two separate drain contacts with independent current measurement. Thus two paths are formed with two dots in each path. Along both paths serial transport is observed at the triple points of the two corresponding dots. With four side gates a wide tunability is given. Thus the system can be tuned in and out of triple dot resonances. When all three dots come into resonance, quadruple points are formed with simultaneous transport along both paths. The data are analysed in combined two colour plots and compared to the charge detection showing sets of three different lines, one for each dot. This way the two path setup allows to investigate the transition from double dot physics to triple dot physics.

The Threshold Shortest Path Interdiction Problem for Critical Infrastructure Resilience Analysis

Science.gov (United States)

2017-09-01

offered in the past by pizza delivery stores. A pizza parlor provides a delivery service to people living within a certain range from the restaurant ...disruptions that are outside of the pizza parlor’s control. Given this data, the owner of the restaurant can make decisions on offering the guarantee

Probabilistic shortest path tractography in DTI using Gaussian Process ODE solvers

DEFF Research Database (Denmark)

Schober, Michael; Kasenburg, Niklas; Feragen, Aasa

2014-01-01

Tractography in diffusion tensor imaging estimates connectivity in the brain through observations of local diffusivity. These observations are noisy and of low resolution and, as a consequence, connections cannot be found with high precision. We use probabilistic numerics to estimate connectivity...

Large and Dense Swarms: Simulation of a Shortest Path Alarm Propagation

Directory of Open Access Journals (Sweden)

Claudia Snels

2015-07-01

Full Text Available This paper deals with the transmission of alarm messages in large and dense underwater swarms of Autonomous Underwater Vehicles (AUVs and describes the verification process of the derived algorithm results by means of two simulation tools realized by the authors. A collision-free communication protocol has been developed, tailored to a case where a single AUV needs to send a message to a specific subset of swarm members regarding a perceived danger. The protocol includes a handshaking procedure that creates a silence region before the transmission of the message obtained through specific acoustic tones out of the normal transmission frequencies or through optical signals. This region will include all members of the swarm involved in the alarm message and their neighbours, preventing collisions between them. The AUV sending messages to a target area computes a delay function on appropriate arcs and runs a Dijkstra-like algorithm obtaining a multicast tree. After an explanation of the whole building of this collision-free multicast tree, a simulation has been carried out assuming different scenarios relevant to swarm density, signal power of the modem and the geometrical configuration of the nodes.

Combinatorial algorithms

CERN Document Server

Hu, T C

2002-01-01

Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9

A semi-empirical analysis of strong-motion peaks in terms of seismic source, propagation path, and local site conditions

Science.gov (United States)

Kamiyama, M.; Orourke, M. J.; Flores-Berrones, R.

1992-09-01

A new type of semi-empirical expression for scaling strong-motion peaks in terms of seismic source, propagation path, and local site conditions is derived. Peak acceleration, peak velocity, and peak displacement are analyzed in a similar fashion because they are interrelated. However, emphasis is placed on the peak velocity which is a key ground motion parameter for lifeline earthquake engineering studies. With the help of seismic source theories, the semi-empirical model is derived using strong motions obtained in Japan. In the derivation, statistical considerations are used in the selection of the model itself and the model parameters. Earthquake magnitude M and hypocentral distance r are selected as independent variables and the dummy variables are introduced to identify the amplification factor due to individual local site conditions. The resulting semi-empirical expressions for the peak acceleration, velocity, and displacement are then compared with strong-motion data observed during three earthquakes in the U.S. and Mexico.

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)

Global Qualitative Flow-Path Modeling for Local State Determination in Simulation and Analysis

Science.gov (United States)

Malin, Jane T. (Inventor); Fleming, Land D. (Inventor)

1998-01-01

For qualitative modeling and analysis, a general qualitative abstraction of power transmission variables (flow and effort) for elements of flow paths includes information on resistance, net flow, permissible directions of flow, and qualitative potential is discussed. Each type of component model has flow-related variables and an associated internal flow map, connected into an overall flow network of the system. For storage devices, the implicit power transfer to the environment is represented by "virtual" circuits that include an environmental junction. A heterogeneous aggregation method simplifies the path structure. A method determines global flow-path changes during dynamic simulation and analysis, and identifies corresponding local flow state changes that are effects of global configuration changes. Flow-path determination is triggered by any change in a flow-related device variable in a simulation or analysis. Components (path elements) that may be affected are identified, and flow-related attributes favoring flow in the two possible directions are collected for each of them. Next, flow-related attributes are determined for each affected path element, based on possibly conflicting indications of flow direction. Spurious qualitative ambiguities are minimized by using relative magnitudes and permissible directions of flow, and by favoring flow sources over effort sources when comparing flow tendencies. The results are output to local flow states of affected components.

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

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

Intercomparison of open-path trace gas measurements with two dual-frequency-comb spectrometers

Directory of Open Access Journals (Sweden)

E. M. Waxman

2017-09-01

Full Text Available We present the first quantitative intercomparison between two open-path dual-comb spectroscopy (DCS instruments which were operated across adjacent 2 km open-air paths over a 2-week period. We used DCS to measure the atmospheric absorption spectrum in the near infrared from 6023 to 6376 cm−1 (1568 to 1660 nm, corresponding to a 355 cm−1 bandwidth, at 0.0067 cm−1 sample spacing. The measured absorption spectra agree with each other to within 5 × 10−4 in absorbance without any external calibration of either instrument. The absorption spectra are fit to retrieve path-integrated concentrations for carbon dioxide (CO2, methane (CH4, water (H2O, and deuterated water (HDO. The retrieved dry mole fractions agree to 0.14 % (0.57 ppm for CO2, 0.35 % (7 ppb for CH4, and 0.40 % (36 ppm for H2O at  ∼  30 s integration time over the 2-week measurement campaign, which included 24 °C outdoor temperature variations and periods of strong atmospheric turbulence. This agreement is at least an order of magnitude better than conventional active-source open-path instrument intercomparisons and is particularly relevant to future regional flux measurements as it allows accurate comparisons of open-path DCS data across locations and time. We additionally compare the open-path DCS retrievals to a World Meteorological Organization (WMO-calibrated cavity ring-down point sensor located along the path with good agreement. Short-term and long-term differences between the open-path DCS and point sensor are attributed, respectively, to spatial sampling discrepancies and to inaccuracies in the current spectral database used to fit the DCS data. Finally, the 2-week measurement campaign yields diurnal cycles of CO2 and CH4 that are consistent with the presence of local sources of CO2 and absence of local sources of CH4.

Reviewing career paths of the OpenStack developers

NARCIS (Netherlands)

van Wesel, P.M.M.; Lin, B.; Robles, G.; Serebrenik, A.

2017-01-01

Career perspectives are known to motivate software engineers. However, so far, career perspectives have been mostly studied within traditional software development companies. In our work we take a complementary approach and study career paths of open source developers, focusing on their advancement

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.

Exploring How Age, Accession Source, Childbearing and the SWO Career Path Influence Female SWO Retention

Science.gov (United States)

2017-03-01

single legacy career path (Cooper, 2015). Although it seems to better accommodate women SWOs, each option still poses challenges for women who want to...role in the stages of identity. G. TIMING According to the American Business Collaboration for Quality Dependent Care 2002 report, “ Women tend to...CAREER PATH INFLUENCE FEMALE SWO RETENTION 5. FUNDING NUMBERS 6. AUTHOR(S) Audra M. Vance 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Naval

Effect of crosstalk on component savings in multi-core fiber networks

DEFF Research Database (Denmark)

Nooruzzaman, Md; Morioka, Toshio

2017-01-01

We estimate potential component savings in MCF-based networks by using shortest path traffic routing and compare them with the current SCF-based systems. We also investigate the potential impact of various inter-core crosstalk values on the number of needed transponders in MCF networks.......We estimate potential component savings in MCF-based networks by using shortest path traffic routing and compare them with the current SCF-based systems. We also investigate the potential impact of various inter-core crosstalk values on the number of needed transponders in MCF networks....

Optimal improvement of graphs related to nuclear safeguards problems

International Nuclear Information System (INIS)

Jacobsen, S.E.

1977-08-01

This report develops the methodology for optimally improving graphs related to nuclear safeguards issues. In particular, given a fixed number of dollars, the report provides a method for optimally allocating such dollars over the arcs of a weighted graph (the weights vary as a function of dollars spent on arcs) so as to improve the system effectiveness measure which is the shortest of all shortest paths to several targets. Arc weights can be either clock times or detection probabilities and the algorithm does not explicitly consider all paths to the targets

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

Energy Technology Data Exchange (ETDEWEB)

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

2011-08-01

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

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

International Nuclear Information System (INIS)

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

2011-01-01

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

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.

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.

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.

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.

Age differences in virtual environment and real world path integration

Directory of Open Access Journals (Sweden)

Diane E Adamo

2012-09-01

Full Text Available Accurate path integration requires the integration of visual, proprioceptive, and vestibular self-motion cues and age effects associated with alterations in processing information from these systems may contribute to declines in path integration abilities. The present study investigated age-related differences in path integration in conditions that varied as a function of available sources of sensory information. Twenty-two healthy, young (23.8 ± 3.0 yrs. and 16 older (70.1 ± 6.4 yrs. adults participated in distance reproduction and triangle completion tasks performed in a virtual environment and two real world conditions: guided walking and wheelchair propulsion. For walking and wheelchair propulsion conditions, participants wore a blindfold and wore noise-blocking headphones and were guided through the workspace by the experimenter. For the virtual environment (VE condition, participants viewed self-motion information on a computer monitor and used a joystick to navigate through the environment. For triangle completion tasks, older compared to younger individuals showed greater errors in rotation estimations performed in the wheelchair condition; and for rotation and distance estimations in the VE condition. Distance reproduction tasks, in contrast, did not show any age effects. These findings demonstrate that age differences in path integration vary as a function of the available sources of information and by the complexity of outbound pathway.

A Low-Noise CMOS THz Imager Based on Source Modulation and an In-Pixel High-Q Passive Switched-Capacitor N-Path Filter

Science.gov (United States)

Boukhayma, Assim; Dupret, Antoine; Rostaing, Jean-Pierre; Enz, Christian

2016-01-01

This paper presents the first low noise complementary metal oxide semiconductor (CMOS) terahertz (THz) imager based on source modulation and in-pixel high-Q filtering. The 31×31 focal plane array has been fully integrated in a 0.13μm standard CMOS process. The sensitivity has been improved significantly by modulating the active THz source that lights the scene and performing on-chip high-Q filtering. Each pixel encompass a broadband bow tie antenna coupled to an N-type metal-oxide-semiconductor (NMOS) detector that shifts the THz radiation, a low noise adjustable gain amplifier and a high-Q filter centered at the modulation frequency. The filter is based on a passive switched-capacitor (SC) N-path filter combined with a continuous-time broad-band Gm-C filter. A simplified analysis that helps in designing and tuning the passive SC N-path filter is provided. The characterization of the readout chain shows that a Q factor of 100 has been achieved for the filter with a good matching between the analytical calculation and the measurement results. An input-referred noise of 0.2μV RMS has been measured. Characterization of the chip with different THz wavelengths confirms the broadband feature of the antenna and shows that this THz imager reaches a total noise equivalent power of 0.6 nW at 270 GHz and 0.8 nW at 600 GHz. PMID:26950131

A Low-Noise CMOS THz Imager Based on Source Modulation and an In-Pixel High-Q Passive Switched-Capacitor N-Path Filter.

Science.gov (United States)

Boukhayma, Assim; Dupret, Antoine; Rostaing, Jean-Pierre; Enz, Christian

2016-03-03

This paper presents the first low noise complementary metal oxide semiconductor (CMOS) deletedCMOS terahertz (THz) imager based on source modulation and in-pixel high-Q filtering. The 31 × 31 focal plane array has been fully integrated in a 0 . 13 μ m standard CMOS process. The sensitivity has been improved significantly by modulating the active THz source that lights the scene and performing on-chip high-Q filtering. Each pixel encompass a broadband bow tie antenna coupled to an N-type metal-oxide-semiconductor (NMOS) detector that shifts the THz radiation, a low noise adjustable gain amplifier and a high-Q filter centered at the modulation frequency. The filter is based on a passive switched-capacitor (SC) N-path filter combined with a continuous-time broad-band Gm-C filter. A simplified analysis that helps in designing and tuning the passive SC N-path filter is provided. The characterization of the readout chain shows that a Q factor of 100 has been achieved for the filter with a good matching between the analytical calculation and the measurement results. An input-referred noise of 0 . 2 μ V RMS has been measured. Characterization of the chip with different THz wavelengths confirms the broadband feature of the antenna and shows that this THz imager reaches a total noise equivalent power of 0 . 6 nW at 270 GHz and 0 . 8 nW at 600 GHz.

Schwinger's quantum action principle from Dirac’s formulation through Feynman’s path integrals, the Schwinger-Keldysh method, quantum field theory, to source theory

CERN Document Server

Milton, Kimball A

2015-01-01

Starting from the earlier notions of stationary action principles, these tutorial notes shows how Schwinger’s Quantum Action Principle descended from Dirac’s formulation, which independently led Feynman to his path-integral formulation of quantum mechanics. Part I brings out in more detail the connection between the two formulations, and applications are discussed. Then, the Keldysh-Schwinger time-cycle method of extracting matrix elements is described. Part II will discuss the variational formulation of quantum electrodynamics and the development of source theory.

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

Bootstrap inversion technique for atmospheric trace gas source detection and quantification using long open-path laser measurements

Science.gov (United States)

Alden, Caroline B.; Ghosh, Subhomoy; Coburn, Sean; Sweeney, Colm; Karion, Anna; Wright, Robert; Coddington, Ian; Rieker, Gregory B.; Prasad, Kuldeep

2018-03-01

Advances in natural gas extraction technology have led to increased activity in the production and transport sectors in the United States and, as a consequence, an increased need for reliable monitoring of methane leaks to the atmosphere. We present a statistical methodology in combination with an observing system for the detection and attribution of fugitive emissions of methane from distributed potential source location landscapes such as natural gas production sites. We measure long (> 500 m), integrated open-path concentrations of atmospheric methane using a dual frequency comb spectrometer and combine measurements with an atmospheric transport model to infer leak locations and strengths using a novel statistical method, the non-zero minimum bootstrap (NZMB). The new statistical method allows us to determine whether the empirical distribution of possible source strengths for a given location excludes zero. Using this information, we identify leaking source locations (i.e., natural gas wells) through rejection of the null hypothesis that the source is not leaking. The method is tested with a series of synthetic data inversions with varying measurement density and varying levels of model-data mismatch. It is also tested with field observations of (1) a non-leaking source location and (2) a source location where a controlled emission of 3.1 × 10-5 kg s-1 of methane gas is released over a period of several hours. This series of synthetic data tests and outdoor field observations using a controlled methane release demonstrates the viability of the approach for the detection and sizing of very small leaks of methane across large distances (4+ km2 in synthetic tests). The field tests demonstrate the ability to attribute small atmospheric enhancements of 17 ppb to the emitting source location against a background of combined atmospheric (e.g., background methane variability) and measurement uncertainty of 5 ppb (1σ), when measurements are averaged over 2 min. The

Planning of optimal work path for minimizing exposure dose during radiation work in radwaste storage

International Nuclear Information System (INIS)

Kim, Yoon Hyuk; Park, Won Man; Kim, Kyung Soo; Whang, Joo Ho

2005-01-01

Since the safety of nuclear power plant has been becoming a big social issue, the exposure dose of radiation for workers has been one of the important factors concerning the safety problem. The existing calculation methods of radiation dose used in the planning of radiation work assume that dose rate dose not depend on the location within a work space, thus the variation of exposure dose by different work path is not considered. In this study, a modified numerical method was presented to estimate the exposure dose during radiation work in radwaste storage considering the effects of the distance between a worker and sources. And a new numerical algorithm was suggested to search the optimal work path minimizing the exposure dose in pre-defined work space with given radiation sources. Finally, a virtual work simulation program was developed to visualize the exposure dose of radiation during radiation works in radwaste storage and provide the capability of simulation for work planning. As a numerical example, a test radiation work was simulated under given space and two radiation sources, and the suggested optimal work path was compared with three predefined work paths. The optimal work path obtained in the study could reduce the exposure dose for the given test work. Based on the results, the developed numerical method and simulation program could be useful tools in the planning of radiation work

All new custom path photo book creation

Science.gov (United States)

Wang, Wiley; Muzzolini, Russ

2012-03-01

In this paper, we present an all new custom path to allow consumers to have full control to their photos and the format of their books, while providing them with guidance to make their creation fast and easy. The users can choose to fully automate the initial creation, and then customize every page. The system manage many design themes along with numerous design elements, such as layouts, backgrounds, embellishments and pattern bands. The users can also utilize photos from multiple sources including their computers, Shutterfly accounts, Shutterfly Share sites and Facebook. The users can also use a photo as background, add, move and resize photos and text - putting what they want where they want instead of being confined to templates. The new path allows users to add embellishments anywhere in the book, and the high-performance platform can support up to 1,000 photos per book and up to 25 pictures per page. The path offers either Smart Autofill or Storyboard features allowing customers to populate their books with photos so they can add captions and customize the pages.

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…

Is a wind turbine a point source? (L).

Science.gov (United States)

Makarewicz, Rufin

2011-02-01

Measurements show that practically all noise of wind turbine noise is produced by turbine blades, sometimes a few tens of meters long, despite that the model of a point source located at the hub height is commonly used. The plane of rotating blades is the critical location of the receiver because the distances to the blades are the shortest. It is shown that such location requires certain condition to be met. The model is valid far away from the wind turbine as well.

Cooperative path planning for multi-USV based on improved artificial bee colony algorithm

Science.gov (United States)

Cao, Lu; Chen, Qiwei

2018-03-01

Due to the complex constraints, more uncertain factors and critical real-time demand of path planning for multiple unmanned surface vehicle (multi-USV), an improved artificial bee colony (I-ABC) algorithm were proposed to solve the model of cooperative path planning for multi-USV. First the Voronoi diagram of battle field space is conceived to generate the optimal area of USVs paths. Then the chaotic searching algorithm is used to initialize the collection of paths, which is regard as foods of the ABC algorithm. With the limited data, the initial collection can search the optimal area of paths perfectly. Finally simulations of the multi-USV path planning under various threats have been carried out. Simulation results verify that the I-ABC algorithm can improve the diversity of nectar source and the convergence rate of algorithm. It can increase the adaptability of dynamic battlefield and unexpected threats for USV.

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.

Graph reconstruction with a betweenness oracle

DEFF Research Database (Denmark)

Abrahamsen, Mikkel; Bodwin, Greg; Rotenberg, Eva

2016-01-01

Graph reconstruction algorithms seek to learn a hidden graph by repeatedly querying a blackbox oracle for information about the graph structure. Perhaps the most well studied and applied version of the problem uses a distance oracle, which can report the shortest path distance between any pair...... of nodes. We introduce and study the betweenness oracle, where bet(a, m, z) is true iff m lies on a shortest path between a and z. This oracle is strictly weaker than a distance oracle, in the sense that a betweenness query can be simulated by a constant number of distance queries, but not vice versa...

Reduction of wind power induced reserve requirements by advanced shortest-term forecasts and prediction intervals

Energy Technology Data Exchange (ETDEWEB)

Dobschinski, Jan; Wessel, Arne; Lange, Bernhard; Bremen, Lueder von [Fraunhofer Institut fuer Windenergie und Energiesystemtechnik (IWES), Kassel (Germany)

2009-07-01

In electricity systems with large penetration of wind power, the limited predictability of the wind power generation leads to an increase in reserve and balancing requirements. At first the present study concentrates on the capability of dynamic day-ahead prediction intervals to reduce the wind power induced reserve and balancing requirements. Alternatively the reduction of large forecast errors of the German wind power generation by using advanced shortest-term predictions has been evaluated in a second approach. With focus on the allocation of minute reserve power the aim is to estimate the maximal remaining uncertainty after trading activities on the intraday market. Finally both approaches were used in a case study concerning the reserve requirements induced by the total German wind power expansion in 2007. (orig.)

Path Creation, Path Dependence and Breaking Away from the Path: Re-Examining the Case of Nokia

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

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

Inverse Compton scattering X-ray source yield optimization with a laser path folding system inserted in a pre-existent RF linac

Energy Technology Data Exchange (ETDEWEB)

Chaleil, A.; Le Flanchec, V.; Binet, A.; Nègre, J.P.; Devaux, J.F.; Jacob, V.; Millerioux, M.; Bayle, A.; Balleyguier, P. [CEA DAM DIF, F-91297 Arpajon (France); Prazeres, R. [CLIO/LCP, Bâtiment 201, Université Paris-Sud, F-91450 Orsay (France)

2016-12-21

An inverse Compton scattering source is under development at the ELSA linac of CEA, Bruyères-le-Châtel. Ultra-short X-ray pulses are produced by inverse Compton scattering of 30 ps-laser pulses by relativistic electron bunches. The source will be able to operate in single shot mode as well as in recurrent mode with 72.2 MHz pulse trains. Within this framework, an optical multipass system that multiplies the number of emitted X-ray photons in both regimes has been designed in 2014, then implemented and tested on ELSA facility in the course of 2015. The device is described from both geometrical and timing viewpoints. It is based on the idea of folding the laser optical path to pile-up laser pulses at the interaction point, thus increasing the interaction probability. The X-ray output gain measurements obtained using this system are presented and compared with calculated expectations.

Substructuring of multibody systems for numerical transfer path analysis in internal combustion engines

Science.gov (United States)

Acri, Antonio; Offner, Guenter; Nijman, Eugene; Rejlek, Jan

2016-10-01

Noise legislations and the increasing customer demands determine the Noise Vibration and Harshness (NVH) development of modern commercial vehicles. In order to meet the stringent legislative requirements for the vehicle noise emission, exact knowledge of all vehicle noise sources and their acoustic behavior is required. Transfer path analysis (TPA) is a fairly well established technique for estimating and ranking individual low-frequency noise or vibration contributions via the different transmission paths. Transmission paths from different sources to target points of interest and their contributions can be analyzed by applying TPA. This technique is applied on test measurements, which can only be available on prototypes, at the end of the designing process. In order to overcome the limits of TPA, a numerical transfer path analysis methodology based on the substructuring of a multibody system is proposed in this paper. Being based on numerical simulation, this methodology can be performed starting from the first steps of the designing process. The main target of the proposed methodology is to get information of noise sources contributions of a dynamic system considering the possibility to have multiple forces contemporary acting on the system. The contributions of these forces are investigated with particular focus on distribute or moving forces. In this paper, the mathematical basics of the proposed methodology and its advantages in comparison with TPA will be discussed. Then, a dynamic system is investigated with a combination of two methods. Being based on the dynamic substructuring (DS) of the investigated model, the methodology proposed requires the evaluation of the contact forces at interfaces, which are computed with a flexible multi-body dynamic (FMBD) simulation. Then, the structure-borne noise paths are computed with the wave based method (WBM). As an example application a 4-cylinder engine is investigated and the proposed methodology is applied on the

Bootstrap inversion technique for atmospheric trace gas source detection and quantification using long open-path laser measurements

Directory of Open Access Journals (Sweden)

C. B. Alden

2018-03-01

Full Text Available Advances in natural gas extraction technology have led to increased activity in the production and transport sectors in the United States and, as a consequence, an increased need for reliable monitoring of methane leaks to the atmosphere. We present a statistical methodology in combination with an observing system for the detection and attribution of fugitive emissions of methane from distributed potential source location landscapes such as natural gas production sites. We measure long (> 500 m, integrated open-path concentrations of atmospheric methane using a dual frequency comb spectrometer and combine measurements with an atmospheric transport model to infer leak locations and strengths using a novel statistical method, the non-zero minimum bootstrap (NZMB. The new statistical method allows us to determine whether the empirical distribution of possible source strengths for a given location excludes zero. Using this information, we identify leaking source locations (i.e., natural gas wells through rejection of the null hypothesis that the source is not leaking. The method is tested with a series of synthetic data inversions with varying measurement density and varying levels of model–data mismatch. It is also tested with field observations of (1 a non-leaking source location and (2 a source location where a controlled emission of 3.1  ×  10−5 kg s−1 of methane gas is released over a period of several hours. This series of synthetic data tests and outdoor field observations using a controlled methane release demonstrates the viability of the approach for the detection and sizing of very small leaks of methane across large distances (4+ km2 in synthetic tests. The field tests demonstrate the ability to attribute small atmospheric enhancements of 17 ppb to the emitting source location against a background of combined atmospheric (e.g., background methane variability and measurement uncertainty of 5 ppb (1σ, when

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

In-line optical fiber metallic mirror reflector for monolithic common path optical coherence tomography probes.

Science.gov (United States)

Singh, Kanwarpal; Reddy, Rohith; Sharma, Gargi; Verma, Yogesh; Gardecki, Joseph A; Tearney, Guillermo

2018-03-01

Endoscopic optical coherence tomography probes suffer from various artifacts due to dispersion imbalance and polarization mismatch between reference and sample arm light. Such artifacts can be minimized using a common path approach. In this work, we demonstrate a miniaturized common path probe for optical coherence tomography using an inline fiber mirror. A common path optical fiber probe suitable for performing high-resolution endoscopic optical coherence tomography imaging was developed. To achieve common path functionality, an inline fiber mirror was fabricated using a thin gold layer. A commercially available swept source engine was used to test the designed probe in a cadaver human coronary artery ex vivo. We achieved a sensitivity of 104 dB for this probe using a swept source optical coherence tomography system. To test the probe, images of a cadaver human coronary artery were obtained, demonstrating the quality that is comparable to those obtained by OCT systems with separate reference arms. Additionally, we demonstrate recovery of ranging depth by use of a Michelson interferometer in the detection path. We developed a miniaturized monolithic inline fiber mirror-based common path probe for optical coherence tomography. Owing to its simplicity, our design will be helpful in endoscopic applications that require high-resolution probes in a compact form factor while reducing system complexity. Lasers Surg. Med. 50:230-235, 2018. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

OPEN PATH TUNABLE DIODE LASER ABSORPTION SPECTROSCOPY FOR ACQUISITION OF FUGITIVE EMISSION FLUX DATA

Science.gov (United States)

Air pollutant emission from unconfined sources is an increasingly important environmental issue. The U.S. EPA has developed a gorund-based optical remote sensing method that enables direct measurement of fugitive emission flux from large area sources. Open-path Fourier transfor...

Determination of Optimal Flow Paths for Safety Injection According to Accident Conditions

Energy Technology Data Exchange (ETDEWEB)

Yoo, Kwae Hwan; Kim, Ju Hyun; Kim, Dong Yeong; Na, Man Gyun [Chosun Univ., Gwangju (Korea, Republic of); Hur, Seop; Kim, Changhwoi [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)

2014-05-15

In case severe accidents happen, major safety parameters of nuclear reactors are rapidly changed. Therefore, operators are unable to respond appropriately. This situation causes the human error of operators that led to serious accidents at Chernobyl. In this study, we aimed to develop an algorithm that can be used to select the optimal flow path for cold shutdown in serious accidents, and to recover an NPP quickly and efficiently from the severe accidents. In order to select the optimal flow path, we applied a Dijkstra algorithm. The Dijkstra algorithm is used to find the path of minimum total length between two given nodes and needs a weight (or length) matrix. In this study, the weight between nodes was calculated from frictional and minor losses inside pipes. That is, the optimal flow path is found so that the pressure drop between a starting node (water source) and a destination node (position that cooling water is injected) is minimized. In case a severe accident has happened, if we inject cooling water through the optimized flow path, then the nuclear reactor will be safely and effectively returned into the cold shutdown state. In this study, we have analyzed the optimal flow paths for safety injection as a preliminary study for developing an accident recovery system. After analyzing the optimal flow path using the Dijkstra algorithm, and the optimal flow paths were selected by calculating the head loss according to path conditions.

Graphs and matroids weighted in a bounded incline algebra.

Science.gov (United States)

Lu, Ling-Xia; Zhang, Bei

2014-01-01

Firstly, for a graph weighted in a bounded incline algebra (or called a dioid), a longest path problem (LPP, for short) is presented, which can be considered the uniform approach to the famous shortest path problem, the widest path problem, and the most reliable path problem. The solutions for LPP and related algorithms are given. Secondly, for a matroid weighted in a linear matroid, the maximum independent set problem is studied.

An efficient strategy for enhancing traffic capacity by removing links in scale-free networks

International Nuclear Information System (INIS)

Huang, Wei; Chow, Tommy W S

2010-01-01

An efficient link-removal strategy, called the variance-of-neighbor-degree-reduction (VNDR) strategy, for enhancing the traffic capacity of scale-free networks is proposed in this paper. The VNDR strategy, which considers the important role of hub nodes, balances the amounts of packets routed from each node to the node's neighbors. Compared against the outcomes of strategies that remove links among hub nodes, our results show that the traffic capacity can be greatly enhanced, especially under the shortest path routing strategy. It is also found that the average transport time is effectively reduced by using the VNDR strategy only under the shortest path routing strategy

Study of integrated optimization design of wind farm in complex terrain

DEFF Research Database (Denmark)

Xu, Chang; Chen, Dandan; Han, Xingxing

2017-01-01

wind farm design in complex terrain and setting up integrated optimization mathematical model for micro-site selection, power lines and road maintenance design etc.. Based on the existing 1-year wind measurement data in the wind farm area, the genetic algorithm was used to optimize the micro......-site selection. On the basis of location optimization of wind turbine, the optimization algorithms such as single-source shortest path algorithm and minimum spanning tree algorithm were used to optimize electric lines and maintenance roads. The practice shows that the research results can provide important...

A Parallel Priority Queue with Constant Time Operations

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Träff, Jesper Larsson; Zaroliagis, Christos D.

1998-01-01

We present a parallel priority queue that supports the following operations in constant time:parallel insertionof a sequence of elements ordered according to key,parallel decrease keyfor a sequence of elements ordered according to key,deletion of the minimum key element, anddeletion of an arbitrary...... application is a parallel implementation of Dijkstra's algorithm for the single-source shortest path problem, which runs inO(n) time andO(mlogn) work on a CREW PRAM on graphs withnvertices andmedges. This is a logarithmic factor improvement in the running time compared with previous approaches....

The collection of the main issues for wind farm optimisation in complex terrain

DEFF Research Database (Denmark)

Xu, Chang; Chen, Dandan; Han, Xingxing

2016-01-01

The paper aims at establishing the collection of the main issues for wind farm optimisation in complex terrain. To make wind farm cost effective, this paper briefly analyses the main factors influencing wind farm design in complex terrain and sets up a series of mathematical model that includes...... micro-siting, collector circuits, access roads design for optimization problems. The paper relies on the existing one year wind data in the wind farm area and uses genetic algorithm to optimize the micro-siting problem. After optimization of the turbine layout, single-source shortest path algorithm...

A local search heuristic for the Multi-Commodity k-splittable Maximum Flow Problem

DEFF Research Database (Denmark)

Gamst, Mette

2014-01-01

, a local search heuristic for solving the problem is proposed. The heuristic is an iterative shortest path procedure on a reduced graph combined with a local search procedure to modify certain path flows and prioritize the different commodities. The heuristic is tested on benchmark instances from...

A new algorithm for least-cost path analysis by correcting digital elevation models of natural landscapes

Science.gov (United States)

Baek, Jieun; Choi, Yosoon

2017-04-01

Most algorithms for least-cost path analysis usually calculate the slope gradient between the source cell and the adjacent cells to reflect the weights for terrain slope into the calculation of travel costs. However, these algorithms have limitations that they cannot analyze the least-cost path between two cells when obstacle cells with very high or low terrain elevation exist between the source cell and the target cell. This study presents a new algorithm for least-cost path analysis by correcting digital elevation models of natural landscapes to find possible paths satisfying the constraint of maximum or minimum slope gradient. The new algorithm calculates the slope gradient between the center cell and non-adjacent cells using the concept of extended move-sets. If the algorithm finds possible paths between the center cell and non-adjacent cells with satisfying the constraint of slope condition, terrain elevation of obstacle cells existing between two cells is corrected from the digital elevation model. After calculating the cumulative travel costs to the destination by reflecting the weight of the difference between the original and corrected elevations, the algorithm analyzes the least-cost path. The results of applying the proposed algorithm to the synthetic data sets and the real-world data sets provide proof that the new algorithm can provide more accurate least-cost paths than other conventional algorithms implemented in commercial GIS software such as ArcGIS.

Integral transforms of the quantum mechanical path integral: Hit function and path-averaged potential

Science.gov (United States)

Edwards, James P.; Gerber, Urs; Schubert, Christian; Trejo, Maria Anabel; Weber, Axel

2018-04-01

We introduce two integral transforms of the quantum mechanical transition kernel that represent physical information about the path integral. These transforms can be interpreted as probability distributions on particle trajectories measuring respectively the relative contribution to the path integral from paths crossing a given spatial point (the hit function) and the likelihood of values of the line integral of the potential along a path in the ensemble (the path-averaged potential).

IntPath--an integrated pathway gene relationship database for model organisms and important pathogens.

Science.gov (United States)

Zhou, Hufeng; Jin, Jingjing; Zhang, Haojun; Yi, Bo; Wozniak, Michal; Wong, Limsoon

2012-01-01

Pathway data are important for understanding the relationship between genes, proteins and many other molecules in living organisms. Pathway gene relationships are crucial information for guidance, prediction, reference and assessment in biochemistry, computational biology, and medicine. Many well-established databases--e.g., KEGG, WikiPathways, and BioCyc--are dedicated to collecting pathway data for public access. However, the effectiveness of these databases is hindered by issues such as incompatible data formats, inconsistent molecular representations, inconsistent molecular relationship representations, inconsistent referrals to pathway names, and incomprehensive data from different databases. In this paper, we overcome these issues through extraction, normalization and integration of pathway data from several major public databases (KEGG, WikiPathways, BioCyc, etc). We build a database that not only hosts our integrated pathway gene relationship data for public access but also maintains the necessary updates in the long run. This public repository is named IntPath (Integrated Pathway gene relationship database for model organisms and important pathogens). Four organisms--S. cerevisiae, M. tuberculosis H37Rv, H. Sapiens and M. musculus--are included in this version (V2.0) of IntPath. IntPath uses the "full unification" approach to ensure no deletion and no introduced noise in this process. Therefore, IntPath contains much richer pathway-gene and pathway-gene pair relationships and much larger number of non-redundant genes and gene pairs than any of the single-source databases. The gene relationships of each gene (measured by average node degree) per pathway are significantly richer. The gene relationships in each pathway (measured by average number of gene pairs per pathway) are also considerably richer in the integrated pathways. Moderate manual curation are involved to get rid of errors and noises from source data (e.g., the gene ID errors in WikiPathways and

Localization of Energy Harvesting Empowered Underwater Optical Wireless Sensor Networks

KAUST Repository

Saeed, Nasir

2017-12-20

In this paper, a received signal strength (RSS) based localization technique is developed for energy harvesting underwater optical wireless sensor networks (EH-UOWSNs), where the optical noise sources and channel impairments of seawater pose significant challenges for range estimation. Energy limitation is another major problem due to the limited battery power and difficulty in replacing or recharging the battery of an underwater sensor node. In the proposed framework, sensor nodes with insufficient battery, harvest the energy and starts communicating once it has sufficient energy storage. Network localization is carried out by measuring the RSSs of active nodes, which are modeled based on the underwater optical communication channel characteristics. Thereafter, block kernel matrices are computed for the RSS based range measurements. Unlike the traditional shortest-path approach, the proposed technique reduces the shortest path estimation for each block kernel matrix. Once the complete block kernel matrices are available, a closed form localization technique is developed to find the location of every optical sensor node in the network. Furthermore, an analytical expression for Cramer Rao lower bound (CRLB) is derived as a benchmark to compare the localization performance of the proposed technique. Finally, extensive simulations show that the proposed technique outperforms the well-known network localization techniques.

Constraints on equivalent elastic source models from near-source data

International Nuclear Information System (INIS)

Stump, B.

1993-01-01

A phenomenological based seismic source model is important in quantifying the important physical processes that affect the observed seismic radiation in the linear-elastic regime. Representations such as these were used to assess yield effects on seismic waves under a Threshold Test Ban Treaty and to help transport seismic coupling experience at one test site to another. These same characterizations in a non-proliferation environment find applications in understanding the generation of the different types of body and surface waves from nuclear explosions, single chemical explosions, arrays of chemical explosions used in mining, rock bursts and earthquakes. Seismologists typically begin with an equivalent elastic representation of the source which when convolved with the propagation path effects produces a seismogram. The Representation Theorem replaces the true source with an equivalent set of body forces, boundary conditions or initial conditions. An extension of this representation shows the equivalence of the body forces, boundary conditions and initial conditions and replaces the source with a set of force moments, the first degree moment tensor for a point source representation. The difficulty with this formulation, which can completely describe the observed waveforms when the propagation path effects are known, is in the physical interpretation of the actual physical processes acting in the source volume. Observational data from within the source region, where processes are often nonlinear, linked to numerical models of the important physical processes in this region are critical to a unique physical understanding of the equivalent elastic source function

PathJam: a new service for integrating biological pathway information

Directory of Open Access Journals (Sweden)

Glez-Peña Daniel

2010-03-01

Full Text Available Biological pathways are crucial to much of the scientific research today including the study of specific biological processes related with human diseases. PathJam is a new comprehensive and freely accessible web-server application integrating scattered human pathway annotation from several public sources. The tool has been designed for both (i being intuitive for wet-lab users providing statistical enrichment analysis of pathway annotations and (ii giving support to the development of new integrative pathway applications. PathJam’s unique features and advantages include interactive graphs linking pathways and genes of interest, downloadable results in fully compatible formats, GSEA compatible output files and a standardized RESTful API.

Path Planning for Unmanned Underwater Vehicle in 3D Space with Obstacles Using Spline-Imperialist Competitive Algorithm and Optimal Interval Type-2 Fuzzy Logic Controller

Directory of Open Access Journals (Sweden)

Ehsan Zakeri

Full Text Available Abstract In this research, generation of a short and smooth path in three-dimensional space with obstacles for guiding an Unmanned Underwater Vehicle (UUV without collision is investigated. This is done by utilizing spline technique, in which the spline control points positions are determined by Imperialist Competitive Algorithm (ICA in three-dimensional space such that the shortest possible path from the starting point to the target point without colliding with obstacles is achieved. Furthermore, for guiding the UUV in the generated path, an Interval Type-2 Fuzzy Logic Controller (IT2FLC, the coefficients of which are optimized by considering an objective function that includes quadratic terms of the input forces and state error of the system, is used. Selecting such objective function reduces the control error and also the force applied to the UUV, which consequently leads to reduction of energy consumption. Therefore, by using a special method, desired signals of UUV state are obtained from generated three-dimensional optimal path such that tracking these signals by the controller leads to the tracking of this path by UUV. In this paper, the dynamical model of the UUV, entitled as "mUUV-WJ-1" , is derived and its hydrodynamic coefficients are calculated by CFD in order to be used in the simulations. For simulation by the method presented in this study, three environments with different obstacles are intended in order to check the performance of the IT2FLC controller in generating optimal paths for guiding the UUV. In this article, in addition to ICA, Particle Swarm Optimization (PSO and Artificial Bee Colony (ABC are also used for generation of the paths and the results are compared with each other. The results show the appropriate performance of ICA rather than ABC and PSO. Moreover, to evaluate the performance of the IT2FLC, optimal Type-1 Fuzzy Logic Controller (T1FLC and Proportional Integrator Differentiator (PID controller are designed

Correlation function of gravitational deflection angles of light paths

International Nuclear Information System (INIS)

Watanabe, Kazuya; Tomita, Kenji.

1990-04-01

The correlation function of gravitational deflection angles of light paths is investigated in a simplified cosmological model universe. Under several reasonable assumptions, an analytic formula for the correlation function is derived. The implication to the cosmic microwave background anisotropy and the distance defined by the observed angular (linear) scale of a source is also discussed. (author)

Energetic and Economic Assessment of Pipe Network Effects on Unused Energy Source System Performance in Large-Scale Horticulture Facilities

Directory of Open Access Journals (Sweden)

Jae Ho Lee

2015-04-01

Full Text Available As the use of fossil fuel has increased, not only in construction, but also in agriculture due to the drastic industrial development in recent times, the problems of heating costs and global warming are getting worse. Therefore, the introduction of more reliable and environmentally-friendly alternative energy sources has become urgent and the same trend is found in large-scale horticulture facilities. In this study, among many alternative energy sources, we investigated the reserves and the potential of various different unused energy sources which have infinite potential, but are nowadays wasted due to limitations in their utilization. This study investigated the effects of the distance between the greenhouse and the actual heat source by taking into account the heat transfer taking place inside the pipe network. This study considered CO2 emissions and economic aspects to determine the optimal heat source. Payback period analysis against initial investment cost shows that a heat pump based on a power plant’s waste heat has the shortest payback period of 7.69 years at a distance of 0 km. On the other hand, the payback period of a heat pump based on geothermal heat showed the shortest payback period of 10.17 year at the distance of 5 km, indicating that heat pumps utilizing geothermal heat were the most effective model if the heat transfer inside the pipe network between the greenhouse and the actual heat source is taken into account.

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

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.

A new 3-D ray tracing method based on LTI using successive partitioning of cell interfaces and traveltime gradients

Science.gov (United States)

Zhang, Dong; Zhang, Ting-Ting; Zhang, Xiao-Lei; Yang, Yan; Hu, Ying; Qin, Qian-Qing

2013-05-01

We present a new method of three-dimensional (3-D) seismic ray tracing, based on an improvement to the linear traveltime interpolation (LTI) ray tracing algorithm. This new technique involves two separate steps. The first involves a forward calculation based on the LTI method and the dynamic successive partitioning scheme, which is applied to calculate traveltimes on cell boundaries and assumes a wavefront that expands from the source to all grid nodes in the computational domain. We locate several dynamic successive partition points on a cell's surface, the traveltimes of which can be calculated by linear interpolation between the vertices of the cell's boundary. The second is a backward step that uses Fermat's principle and the fact that the ray path is always perpendicular to the wavefront and follows the negative traveltime gradient. In this process, the first-arriving ray path can be traced from the receiver to the source along the negative traveltime gradient, which can be calculated by reconstructing the continuous traveltime field with cubic B-spline interpolation. This new 3-D ray tracing method is compared with the LTI method and the shortest path method (SPM) through a number of numerical experiments. These comparisons show obvious improvements to computed traveltimes and ray paths, both in precision and computational efficiency.

DOA Estimation of Audio Sources in Reverberant Environments

DEFF Research Database (Denmark)

Jensen, Jesper Rindom; Nielsen, Jesper Kjær; Heusdens, Richard

2016-01-01

Reverberation is well-known to have a detrimental impact on many localization methods for audio sources. We address this problem by imposing a model for the early reflections as well as a model for the audio source itself. Using these models, we propose two iterative localization methods...... that estimate the direction-of-arrival (DOA) of both the direct path of the audio source and the early reflections. In these methods, the contribution of the early reflections is essentially subtracted from the signal observations before localization of the direct path component, which may reduce the estimation...

Modelling information flow along the human connectome using maximum flow.

Science.gov (United States)

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

2018-01-01

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

INNOVATIVE APPROACH FOR MEASURING AMMONIA AND METHANE FLUXES FROM A HOG FARM USING OPEN-PATH FOURIER TRANSFORM INFRARED SPECTROSCOPY

Science.gov (United States)

The paper describes a new approach to quantify emissions from area air pollution sources. The approach combines path-integrated concentration data acquired with any path-integrated optical remote sensing (PI-ORS) technique and computed tomography (CT) technique. In this study, an...

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.)

Integrated doses calculation in evacuation scenarios of the neutron generator facility at Missouri S&T

Energy Technology Data Exchange (ETDEWEB)

Sharma, Manish K.; Alajo, Ayodeji B., E-mail: alajoa@mst.edu

2016-08-11

Any source of ionizing radiations could lead to considerable dose acquisition to individuals in a nuclear facility. Evacuation may be required when elevated levels of radiation is detected within a facility. In this situation, individuals are more likely to take the closest exit. This may not be the most expedient decision as it may lead to higher dose acquisition. The strategy followed in preventing large dose acquisitions should be predicated on the path that offers least dose acquisition. In this work, the neutron generator facility at Missouri University of Science and Technology was analyzed. The Monte Carlo N-Particle (MCNP) radiation transport code was used to model the entire floor of the generator's building. The simulated dose rates in the hallways were used to estimate the integrated doses for different paths leading to exits. It was shown that shortest path did not always lead to minimum dose acquisition and the approach was successful in predicting the expedient path as opposed to the approach of taking the nearest exit.

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

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

Reactive searching and infotaxis in odor source localization.

Directory of Open Access Journals (Sweden)

Nicole Voges

2014-10-01

Full Text Available Male moths aiming to locate pheromone-releasing females rely on stimulus-adapted search maneuvers complicated by a discontinuous distribution of pheromone patches. They alternate sequences of upwind surge when perceiving the pheromone and cross- or downwind casting when the odor is lost. We compare four search strategies: three reactive versus one cognitive. The former consist of pre-programmed movement sequences triggered by pheromone detections while the latter uses Bayesian inference to build spatial probability maps. Based on the analysis of triphasic responses of antennal lobe neurons (On, inhibition, Off, we propose three reactive strategies. One combines upwind surge (representing the On response to a pheromone detection and spiral casting, only. The other two additionally include crosswind (zigzag casting representing the Off phase. As cognitive strategy we use the infotaxis algorithm which was developed for searching in a turbulent medium. Detection events in the electroantennogram of a moth attached to a robot indirectly control this cyborg, depending on the strategy in use. The recorded trajectories are analyzed with regard to success rates, efficiency, and other features. In addition, we qualitatively compare our robotic trajectories to behavioral search paths. Reactive searching is more efficient (yielding shorter trajectories for higher pheromone doses whereas cognitive searching works better for lower doses. With respect to our experimental conditions (2 m from starting position to pheromone source, reactive searching with crosswind zigzag yields the shortest trajectories (for comparable success rates. Assuming that the neuronal Off response represents a short-term memory, zigzagging is an efficient movement to relocate a recently lost pheromone plume. Accordingly, such reactive strategies offer an interesting alternative to complex cognitive searching.

Reactive searching and infotaxis in odor source localization.

Science.gov (United States)

Voges, Nicole; Chaffiol, Antoine; Lucas, Philippe; Martinez, Dominique

2014-10-01

Male moths aiming to locate pheromone-releasing females rely on stimulus-adapted search maneuvers complicated by a discontinuous distribution of pheromone patches. They alternate sequences of upwind surge when perceiving the pheromone and cross- or downwind casting when the odor is lost. We compare four search strategies: three reactive versus one cognitive. The former consist of pre-programmed movement sequences triggered by pheromone detections while the latter uses Bayesian inference to build spatial probability maps. Based on the analysis of triphasic responses of antennal lobe neurons (On, inhibition, Off), we propose three reactive strategies. One combines upwind surge (representing the On response to a pheromone detection) and spiral casting, only. The other two additionally include crosswind (zigzag) casting representing the Off phase. As cognitive strategy we use the infotaxis algorithm which was developed for searching in a turbulent medium. Detection events in the electroantennogram of a moth attached to a robot indirectly control this cyborg, depending on the strategy in use. The recorded trajectories are analyzed with regard to success rates, efficiency, and other features. In addition, we qualitatively compare our robotic trajectories to behavioral search paths. Reactive searching is more efficient (yielding shorter trajectories) for higher pheromone doses whereas cognitive searching works better for lower doses. With respect to our experimental conditions (2 m from starting position to pheromone source), reactive searching with crosswind zigzag yields the shortest trajectories (for comparable success rates). Assuming that the neuronal Off response represents a short-term memory, zigzagging is an efficient movement to relocate a recently lost pheromone plume. Accordingly, such reactive strategies offer an interesting alternative to complex cognitive searching.

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.

An adaptive routing strategy for packet delivery in complex networks

International Nuclear Information System (INIS)

Zhang, Huan; Liu, Zonghua; Tang, Ming; Hui, P.M.

2007-01-01

We present an efficient routing approach for delivering packets in complex networks. On delivering a message from a node to a destination, a node forwards the message to a neighbor by estimating the waiting time along the shortest path from each of its neighbors to the destination. This projected waiting time is dynamical in nature and the path through which a message is delivered would be adapted to the distribution of messages in the network. Implementing the approach on scale-free networks, we show that the present approach performs better than the shortest-path approach and another approach that takes into account of the waiting time only at the neighboring nodes. Key features in numerical results are explained by a mean field theory. The approach has the merit that messages are distributed among the nodes according to the capabilities of the nodes in handling messages

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

Science.gov (United States)

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

2017-12-01

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

Locating the source of spreading in temporal networks

Science.gov (United States)

Huang, Qiangjuan; Zhao, Chengli; Zhang, Xue; Yi, Dongyun

2017-02-01

The topological structure of many real networks changes with time. Thus, locating the sources of a temporal network is a creative and challenging problem, as the enormous size of many real networks makes it unfeasible to observe the state of all nodes. In this paper, we propose an algorithm to solve this problem, named the backward temporal diffusion process. The proposed algorithm calculates the shortest temporal distance to locate the transmission source. We assume that the spreading process can be modeled as a simple diffusion process and by consensus dynamics. To improve the location accuracy, we also adopt four strategies to select which nodes should be observed by ranking their importance in the temporal network. Our paper proposes a highly accurate method for locating the source in temporal networks and is, to the best of our knowledge, a frontier work in this field. Moreover, our framework has important significance for controlling the transmission of diseases or rumors and formulating immediate immunization strategies.

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)

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

Two-dimensional velocity models for paths from Pahute Mesa and Yucca Flat to Yucca Mountain

International Nuclear Information System (INIS)

Walck, M.C.; Phillips, J.S.

1990-11-01

Vertical acceleration recordings of 21 underground nuclear explosions recorded at stations at Yucca Mountain provide the data for development of three two-dimensional crystal velocity profiles for portions of the Nevada Test Site. Paths from Area 19, Area 20 (both Pahute Mesa), and Yucca Flat to Yucca Mountain have been modeled using asymptotic ray theory travel time and synthetic seismogram techniques. Significant travel time differences exist between the Yucca Flat and Pahute Mesa source areas; relative amplitude patterns at Yucca Mountain also shift with changing source azimuth. The three models, UNEPM1, UNEPM2, and UNEYF1, successfully predict the travel time and amplitude data for all three paths. 24 refs., 34 figs., 8 tabs

Application of Rudoe’s Formula in Long Seismic Surface Wave Paths Determination

Directory of Open Access Journals (Sweden)

Jorge L. de Souza

2005-12-01

Full Text Available An algorithm to compute accurate distances over grid cells crossed by seismic surface wave paths by Rudoe’s formula is proposed. The intersection coordinates between paths and the geodetic grid are also computed, which data are exhibited in an azimuthal equidistant projection to check the results. GRS-80 is the adopted ellipsoidal Earth model. The algorithm computes the intermediate intersections, from both forward and reciprocal normal sections given by Rudoe’s method, which separation may be greater than the cell size. It was tested on a data set including 3,269 source-station paths, which seismic events were recorded at 23 IRIS stations. The epicentral distances range from 1,634 km to 16,400 km, which the grid spreads over 149°E x 21°W, and 50°N x 90°S. The results show that the estimated intersections accuracy depends on the path azimuth and latitude, which influence may be significative for very long distances as in teleseismic applications, which argues for the algorithm application.

The diverging paths of German and United States policies for renewable energy: Sources of difference

International Nuclear Information System (INIS)

Laird, Frank N.; Stefes, Christoph

2009-01-01

The United States and Germany started out with very similar policies for renewable energy after the energy crisis of the 1970s. By the year 2000 they were on very different policy paths and, as a result, the German renewable energy industry has moved well ahead of that in the United States, both in terms of installed capacity in the country and in terms of creating a highly successful export market. In this paper, we reject some of the conventional explanations for this difference. Instead, these differences arise from the intersection of contingent historical events with the distinctive institutional and social structures that affect policy making in each country. Our analysis of the historical path-dependent dynamics of each country suggests that those who wish to further renewable energy policy in the United States need to take into account these institutional and social factors so that they will better be able to exploit the next set of favorable historical circumstances.

Controlling low-rate signal path microdischarge for an ultra-low-background proportional counter

International Nuclear Information System (INIS)

Mace, E.K.; Aalseth, C.E.; Bonicalzi, R.M.; Day, A.R.; Hoppe, E.W.; Keillor, M.E.; Myers, A.W.; Overman, C.T.; Seifert, A.

2013-01-01

Pacific Northwest National Laboratory (PNNL) has developed an ultra-low-background proportional counter (ULBPC) made of high purity copper. These detectors are part of an ultra-low-background counting system (ULBCS) in the newly constructed shallow underground laboratory at PNNL (at a depth of ∼30 m water-equivalent). To control backgrounds, the current preamplifier electronics are located outside the ULBCS shielding. Thus the signal from the detector travels through ∼1 m of cable and is potentially susceptible to high voltage microdischarge and other sources of electronic noise. Based on initial successful tests, commercial cables and connectors were used for this critical signal path. Subsequent testing across different batches of commercial cables and connectors, however, showed unwanted (but still low) rates of microdischarge noise. To control this noise source, two approaches were pursued: first, to carefully validate cables, connectors, and other commercial components in this critical signal path, making modifications where necessary; second, to develop a custom low-noise, low-background preamplifier that can be integrated with the ULBPC and thus remove most commercial components from the critical signal path. This integrated preamplifier approach is based on the Amptek A250 low-noise charge-integrating preamplifier module. The initial microdischarge signals observed are presented and characterized according to the suspected source. Each of the approaches for mitigation is described, and the results from both are compared with each other and with the original performance seen with commercial cables and connectors. (author)

[Dual insertion paths design characteristics and short-term clinical observation of rotational path removable partial dentures].

Science.gov (United States)

Li, Jian; Jiang, Ting; Li, Sai; Chen, Wei

2013-02-18

To investigate design methods of dual insertion paths and observe a short-term clinic overview of rotational path removable partial dentures (RPDs). In the study, 40 patients with partial edentulous arches were included and divided into two groups. The patients in group one were restored with rotational path RPDs (10 Kennedy class III and 10 Kennedy class IV respectively). The patients in group two (20 patients), whose edentulous area was matched with the patients' in group one, were restored with the linear path RPDs. After surveying and simulative preparation on diagnostic casts, the basic laws of designing rotational path RPDs were summarized. The oral preparation was accurately performed under the guidance of indices made on diagnostic casts after simulative preparation. The 40 dentures were recalled two weeks and one year after the insertion. The evaluations of the clinic outcome, including retention, stability, mastication function, esthetics and wearing convenience, were marked out as good, acceptable, and poor. The comparison of the evaluation results was performed between the two groups. In the rotational path design for Kennedy class III or IV RPDs, the angles (α) of dual insertion paths should be designed within a scope, approximate 10°-15°.When the angle (α) became larger, the denture retention turned to be better, but accordingly the posterior abutments needed more preparation. In the clinical application, the first insertions of the 40 dentures were all favorably accomplished. When the rotational path RPDs were compared to linear path RPDs, the time consuming on first insertion had no statistical difference[(32±8) min and (33±8) min respectively, P>0.05]. Recalled two weeks and one year after the insertion, in the esthetics evaluation, 20 rotational path RPDs were all evaluated as "A", but only 7(two weeks after) and 6 (one year after) linear path RPDs were evaluated as "A"(P<0.05). There was no significant difference in other evaluation results

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

Capacity Constrained Routing Algorithms for Evacuation Route Planning

National Research Council Canada - National Science Library

Lu, Qingsong; George, Betsy; Shekhar, Shashi

2006-01-01

.... In this paper, we propose a new approach, namely a capacity constrained routing planner which models capacity as a time series and generalizes shortest path algorithms to incorporate capacity constraints...

Comparison of classical reaction paths and tunneling paths studied with the semiclassical instanton theory.

Science.gov (United States)

Meisner, Jan; Markmeyer, Max N; Bohner, Matthias U; Kästner, Johannes

2017-08-30

Atom tunneling in the hydrogen atom transfer reaction of the 2,4,6-tri-tert-butylphenyl radical to 3,5-di-tert-butylneophyl, which has a short but strongly curved reaction path, was investigated using instanton theory. We found the tunneling path to deviate qualitatively from the classical intrinsic reaction coordinate, the steepest-descent path in mass-weighted Cartesian coordinates. To perform that comparison, we implemented a new variant of the predictor-corrector algorithm for the calculation of the intrinsic reaction coordinate. We used the reaction force analysis method as a means to decompose the reaction barrier into structural and electronic components. Due to the narrow energy barrier, atom tunneling is important in the abovementioned reaction, even above room temperature. Our calculated rate constants between 350 K and 100 K agree well with experimental values. We found a H/D kinetic isotope effect of almost 10 6 at 100 K. Tunneling dominates the protium transfer below 400 K and the deuterium transfer below 300 K. We compared the lengths of the tunneling path and the classical path for the hydrogen atom transfer in the reaction HCl + Cl and quantified the corner cutting in this reaction. At low temperature, the tunneling path is about 40% shorter than the classical path.

Beam-based model of broad-band impedance of the Diamond Light Source

Science.gov (United States)

Smaluk, Victor; Martin, Ian; Fielder, Richard; Bartolini, Riccardo

2015-06-01

In an electron storage ring, the interaction between a single-bunch beam and a vacuum chamber impedance affects the beam parameters, which can be measured rather precisely. So we can develop beam-based numerical models of longitudinal and transverse impedances. At the Diamond Light Source (DLS) to get the model parameters, a set of measured data has been used including current-dependent shift of betatron tunes and synchronous phase, chromatic damping rates, and bunch lengthening. A matlab code for multiparticle tracking has been developed. The tracking results and analytical estimations are quite consistent with the measured data. Since Diamond has the shortest natural bunch length among all light sources in standard operation, the studies of collective effects with short bunches are relevant to many facilities including next generation of light sources.

Beam-based model of broad-band impedance of the Diamond Light Source

Directory of Open Access Journals (Sweden)

Victor Smaluk

2015-06-01

Full Text Available In an electron storage ring, the interaction between a single-bunch beam and a vacuum chamber impedance affects the beam parameters, which can be measured rather precisely. So we can develop beam-based numerical models of longitudinal and transverse impedances. At the Diamond Light Source (DLS to get the model parameters, a set of measured data has been used including current-dependent shift of betatron tunes and synchronous phase, chromatic damping rates, and bunch lengthening. A matlab code for multiparticle tracking has been developed. The tracking results and analytical estimations are quite consistent with the measured data. Since Diamond has the shortest natural bunch length among all light sources in standard operation, the studies of collective effects with short bunches are relevant to many facilities including next generation of light sources.

Pathfinding in graph-theoretic sabotage models. I. Simultaneous attack by several teams

International Nuclear Information System (INIS)

Hulme, B.L.

1976-07-01

Graph models are developed for fixed-site safeguards systems. The problem of finding optimal routes for several sabotage teams is cast as a problem of finding shortest paths in a graph. The motivation, rationale, and interpretation of the mathematical models are discussed in detail, and an algorithm for efficiently solving the associated path problem is described

NQAR: Network Quality Aware Routing in Error-Prone Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jaewon Choi

2010-01-01

Full Text Available We propose a network quality aware routing (NQAR mechanism to provide an enabling method of the delay-sensitive data delivery over error-prone wireless sensor networks. Unlike the existing routing methods that select routes with the shortest arrival latency or the minimum hop count, the proposed scheme adaptively selects the route based on the network qualities including link errors and collisions with minimum additional complexity. It is designed to avoid the paths with potential noise and collision that may cause many non-deterministic backoffs and retransmissions. We propose a generic framework to select a minimum cost route that takes the packet loss rate and collision history into account. NQAR uses a data centric approach to estimate a single-hop delay based on processing time, propagation delay, packet loss rate, number of backoffs, and the retransmission timeout between two neighboring nodes. This enables a source node to choose the shortest expected end-to-end delay path to send a delay-sensitive data. The experiment results show that NQAR reduces the end-to-end transfer delay up to approximately 50% in comparison with the latency-based directed diffusion and the hop count-based directed diffusion under the error-prone network environments. Moreover, NQAR shows better performance than those routing methods in terms of jitter, reachability, and network lifetime.

Fast network centrality analysis using GPUs

Directory of Open Access Journals (Sweden)

Shi Zhiao

2011-05-01

Full Text Available Abstract Background With the exploding volume of data generated by continuously evolving high-throughput technologies, biological network analysis problems are growing larger in scale and craving for more computational power. General Purpose computation on Graphics Processing Units (GPGPU provides a cost-effective technology for the study of large-scale biological networks. Designing algorithms that maximize data parallelism is the key in leveraging the power of GPUs. Results We proposed an efficient data parallel formulation of the All-Pairs Shortest Path problem, which is the key component for shortest path-based centrality computation. A betweenness centrality algorithm built upon this formulation was developed and benchmarked against the most recent GPU-based algorithm. Speedup between 11 to 19% was observed in various simulated scale-free networks. We further designed three algorithms based on this core component to compute closeness centrality, eccentricity centrality and stress centrality. To make all these algorithms available to the research community, we developed a software package gpu-fan (GPU-based Fast Analysis of Networks for CUDA enabled GPUs. Speedup of 10-50× compared with CPU implementations was observed for simulated scale-free networks and real world biological networks. Conclusions gpu-fan provides a significant performance improvement for centrality computation in large-scale networks. Source code is available under the GNU Public License (GPL at http://bioinfo.vanderbilt.edu/gpu-fan/.

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.)

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

Symbolic PathFinder v7

DEFF Research Database (Denmark)

Luckow, Kasper Søe; Păsăreanu, Corina

2014-01-01

We describe Symbolic PathFinder v7 in terms of its updated design addressing the changes of Java PathFinder v7 and of its new optimization when computing path conditions. Furthermore, we describe the Symbolic Execution Tree Extension; a newly added feature that allows for outputting the symbolic...... execution tree that characterizes the execution paths covered during symbolic execution. The new extension can be tailored to the needs of subsequent analyses/processing facilities, and we demonstrate this by presenting SPF-Visualizer, which is a tool for customizable visualization of the symbolic execution...

Teaching quantum physics by the sum over paths approach and GeoGebra simulations

International Nuclear Information System (INIS)

Malgieri, M; Onorato, P; De Ambrosis, A

2014-01-01

We present a research-based teaching sequence in introductory quantum physics using the Feynman sum over paths approach. Our reconstruction avoids the historical pathway, and starts by reconsidering optics from the standpoint of the quantum nature of light, analysing both traditional and modern experiments. The core of our educational path lies in the treatment of conceptual and epistemological themes, peculiar of quantum theory, based on evidence from quantum optics, such as the single photon Mach–Zehnder and Zhou–Wang–Mandel experiments. The sequence is supported by a collection of interactive simulations, realized in the open source GeoGebra environment, which we used to assist students in learning the basics of the method, and help them explore the proposed experimental situations as modeled in the sum over paths perspective. We tested our approach in the context of a post-graduate training course for pre-service physics teachers; according to the data we collected, student teachers displayed a greatly improved understanding of conceptual issues, and acquired significant abilities in using the sum over path method for problem solving. (paper)

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

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.

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

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Science.gov (United States)

Alena, Richard I.; Lee, Charles

2004-01-01

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the

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.

Cooperative organic mine avoidance path planning

Science.gov (United States)

McCubbin, Christopher B.; Piatko, Christine D.; Peterson, Adam V.; Donnald, Creighton R.; Cohen, David

2005-06-01

The JHU/APL Path Planning team has developed path planning techniques to look for paths that balance the utility and risk associated with different routes through a minefield. Extending on previous years' efforts, we investigated real-world Naval mine avoidance requirements and developed a tactical decision aid (TDA) that satisfies those requirements. APL has developed new mine path planning techniques using graph based and genetic algorithms which quickly produce near-minimum risk paths for complicated fitness functions incorporating risk, path length, ship kinematics, and naval doctrine. The TDA user interface, a Java Swing application that obtains data via Corba interfaces to path planning databases, allows the operator to explore a fusion of historic and in situ mine field data, control the path planner, and display the planning results. To provide a context for the minefield data, the user interface also renders data from the Digital Nautical Chart database, a database created by the National Geospatial-Intelligence Agency containing charts of the world's ports and coastal regions. This TDA has been developed in conjunction with the COMID (Cooperative Organic Mine Defense) system. This paper presents a description of the algorithms, architecture, and application produced.

Optimal Patrol to Detect Attacks at Dispersed Heterogeneous Locations

Science.gov (United States)

2013-12-01

solution RALP Random-attacker linear program SALP Strategic-attacker linear program SMDP Semi-Markov decision process SP Shortest path SPR1 Shortest...average cost per attack among all vertices, which we refer to as the strategic-attacker linear program ( SALP ): min x zOPT (3.1a) subject to ∑ (k,l)∈A c...the SALP is indicated by zOPT. The lower bound that is obtained from using the LBLP is indicated by zLB. Solutions obtained from using a heuristic

The effect of solar and lunar currents on simultaneous phase path, group path and amplitude measurements

International Nuclear Information System (INIS)

Baulch, R.N.E.; Butcher, E.C.

1984-01-01

The solar and lunar variations in the phase path, group path and amplitude of a fixed frequency transmission were obtained at the September equinox over a slightly oblique path. The phase of the lunar semi-diurnal tide in the phase path and amplitude were similar, the maxima occurring near 0200 lunar time, whereas the group path had a maximum near 0800 lunar time. These results were compared with other results obtained near the same location. The results suggest a complex situation in the E-region, where the height of the lunar current depends on season, and also suggest that the location and distribution of the solar and lunar currents may be different. (author)

Determination of collective behavior of the financial market.

Science.gov (United States)

Li, Shouwei; Xu, Tao; He, Jianmin

2016-01-01

In this paper, we adopt the network synchronization to measure the collective behavior in the financial market, and then analyze the factors that affect the collective behavior. Based on the data from the Chinese financial market, we find that the clustering coefficient, the average shortest path length and the volatility fluctuation have a positive effect on the collective behavior respectively, while the average return has a negative effect on it; the effect of the average shortest path length on the collective behavior is the greatest in the above four variables; the above results are robust against the window size and the time interval between adjacent windows of the stock network; the effect of network structures and stock market properties on the collective behavior during the financial crisis is the same as those during other periods.

On the structure of path-like trees

OpenAIRE

Muntaner Batle, Francesc Antoni; Rius Font, Miquel

2007-01-01

We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.

Recent equivalent source methods for quantifying airborne and structureborne sound transfer

NARCIS (Netherlands)

Verheij, J.W.

1992-01-01

Characteristically noise reduction in technical products like road vehicles, ships, aircraft and machines is complicated by the multitude of primary sources and transfer paths. Examples of well-known approaches for transfer path investigations are selective shielding, mechanical uncoupling,

Controlling the optical path length in turbid media using differential path-length spectroscopy: fiber diameter dependence

NARCIS (Netherlands)

Kaspers, O. P.; Sterenborg, H. J. C. M.; Amelink, A.

2008-01-01

We have characterized the path length for the differential path-length spectroscopy (DPS) fiber optic geometry for a wide range of optical properties and for fiber diameters ranging from 200 mu m to 1000 mu m. Phantom measurements show that the path length is nearly constant for scattering

High-Resolution Source Parameter and Site Characteristics Using Near-Field Recordings - Decoding the Trade-off Problems Between Site and Source

Science.gov (United States)

Chen, X.; Abercrombie, R. E.; Pennington, C.

2017-12-01

Recorded seismic waveforms include contributions from earthquake source properties and propagation effects, leading to long-standing trade-off problems between site/path effects and source effects. With near-field recordings, the path effect is relatively small, so the trade-off problem can be simplified to between source and site effects (commonly referred as "kappa value"). This problem is especially significant for small earthquakes where the corner frequencies are within similar ranges of kappa values, so direct spectrum fitting often leads to systematic biases due to corner frequency and magnitude. In response to the significantly increased seismicity rate in Oklahoma, several local networks have been deployed following major earthquakes: the Prague, Pawnee and Fairview earthquakes. Each network provides dense observations within 20 km surrounding the fault zone, recording tens of thousands of aftershocks between M1 to M3. Using near-field recordings in the Prague area, we apply a stacking approach to separate path/site and source effects. The resulting source parameters are consistent with parameters derived from ground motion and spectral ratio methods from other studies; they exhibit spatial coherence within the fault zone for different fault patches. We apply these source parameter constraints in an analysis of kappa values for stations within 20 km of the fault zone. The resulting kappa values show significantly reduced variability compared to those from direct spectral fitting without constraints on the source spectrum; they are not biased by earthquake magnitudes. With these improvements, we plan to apply the stacking analysis to other local arrays to analyze source properties and site characteristics. For selected individual earthquakes, we will also use individual-pair empirical Green's function (EGF) analysis to validate the source parameter estimations.

Low sound level source path contribution on a HVAC

NARCIS (Netherlands)

Bree, H.E. de; Basten, T.G.H.

2008-01-01

For compliance test purposes, the noise level of a HVAC is usually measured with a pressure microphone positioned at a certain distance. This measurement is normally performed in an anechoic room. However, this method doesn't provide the engineer any insight on what noise sources do contribute to

Long open-path measurements of greenhouse gases in air using near-infrared Fourier transform spectroscopy

Science.gov (United States)

Griffith, David W. T.; Pöhler, Denis; Schmitt, Stefan; Hammer, Samuel; Vardag, Sanam N.; Platt, Ulrich

2018-03-01

In complex and urban environments, atmospheric trace gas composition is highly variable in time and space. Point measurement techniques for trace gases with in situ instruments are well established and accurate, but do not provide spatial averaging to compare against developing high-resolution atmospheric models of composition and meteorology with resolutions of the order of a kilometre. Open-path measurement techniques provide path average concentrations and spatial averaging which, if sufficiently accurate, may be better suited to assessment and interpretation with such models. Open-path Fourier transform spectroscopy (FTS) in the mid-infrared region, and differential optical absorption spectroscopy (DOAS) in the UV and visible, have been used for many years for open-path spectroscopic measurements of selected species in both clean air and in polluted environments. Near infrared instrumentation allows measurements over longer paths than mid-infrared FTS for species such as greenhouse gases which are not easily accessible to DOAS.In this pilot study we present the first open-path near-infrared (4000-10 000 cm-1, 1.0-2.5 µm) FTS measurements of CO2, CH4, O2, H2O and HDO over a 1.5 km path in urban Heidelberg, Germany. We describe the construction of the open-path FTS system, the analysis of the collected spectra, several measures of precision and accuracy of the measurements, and the results a four-month trial measurement period in July-November 2014. The open-path measurements are compared to calibrated in situ measurements made at one end of the open path. We observe significant differences of the order of a few ppm for CO2 and a few tens of ppb for CH4 between the open-path and point measurements which are 2 to 4 times the measurement repeatability, but we cannot unequivocally assign the differences to specific local sources or sinks. We conclude that open-path FTS may provide a valuable new tool for investigations of atmospheric trace gas composition in

Shielded transient self-interaction of a bunch entering a circle from a straight path

International Nuclear Information System (INIS)

Li, R.; Bohn, C.L.; Bisognano, J.J.

1997-01-01

When a short (mm-length) bunch with high (nC-regime) charge is transported through a magnetic bending system, self-interaction via coherent synchrotron radiation (CSR) and space charge may alter the bunch dynamics significantly. The authors consider a Gaussian rigid-line-charge bunch following a straight-path trajectory into a circle, with the trajectory centered between two infinite, parallel, perfectly conducting plates. Transients associated with CSR and space charge generated from source particles both on the straight path and the circle are calculated, and their net effect on the radiated power is contrasted with that of shielded steady-state CSR

Walking path-planning method for multiple radiation areas

International Nuclear Information System (INIS)

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

2016-01-01

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

TP-Space RRT – Kinematic Path Planning of Non-Holonomic Any-Shape Vehicles

Directory of Open Access Journals (Sweden)

Jose Luis Blanco

2015-05-01

Full Text Available The autonomous navigation of vehicles typically combines two kinds of methods: a path is first planned, and then the robot is driven by a local obstacle-avoidance controller. The present work, which focuses on path planning, proposes an extension to the well-known rapidly-exploring random tree (RRT algorithm to allow its integration with a trajectory parameter-space (TP-space as an efficient method to detect collision-free, kinematically-feasible paths for arbitrarily-shaped vehicles. In contrast to original RRT, this proposal generates navigation trees, with poses as nodes, whose edges are all kinematically-feasible paths, suitable to being accurately followed by vehicles driven by pure reactive algorithms. Initial experiments demonstrate the suitability of the method with an Ackermann-steering vehicle model whose severe kinematic constraints cannot be obviated. An important result that sets this work apart from previous research is the finding that employing several families of potential trajectories to expand the tree, which can be done efficiently under the TP-space formalism, improves the optimality of the planned trajectories. A reference C++ implementation has been released as open-source.

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.

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

Effects of T-type Channel on Natural Convection Flows in Airflow-Path of Concrete Storage Cask

Energy Technology Data Exchange (ETDEWEB)

Kang, Gyeong Uk; Kim, Hyoung Jin; Cho, Chun Hyung [KORAD, Daejeon (Korea, Republic of)

2016-05-15

The natural convection flows occurring in airflow-path are not simple due to complex flow-path configurations such as horizontal ducts, bent tube and annular flow-path. In addition, 16 T type channels acting as the shroud are attached vertically and 16 channel supporting the canister are attached horizontally on the inner surface of over-pack. The existence and nonexistence of T type channels have influences on the flow fields in airflow- path. The concrete storage cask has to satisfy the requirements to secure the thermal integrity under the normal, off-normal, and accident conditions. The present work is aiming at investigating the effects of T type channels on the flows in airflow-path under the normal conditions using the FLUENT 16.1 code. In order to focus on the flows in airflow-path, fuel regions in the canister are regarded as a single cylinder with heat sources and other components are fully modeled. This study investigated the flow fields in airflow-path of concrete storage cask, numerically. It was found that excepting for the fuel regions, maximum temperatures on other components were evaluated below allowable values. The location of maximum velocities depended on support channels, T type channels and flow area. The flows through air inlets developed along annular flow- path with forming the hot plumes. According to the existence and nonexistence of T type channel, the plume behavior showed the different flow patterns.

Excitation of Structures Near Railway Tracks-Analysis of the Wave Propagation Path

DEFF Research Database (Denmark)

Bucinskas, Paulius; Andersen, Lars Vabbersgaard

2017-01-01

High-speed rails are an attractive alternative to other forms of intercity transportation. It is a fast, cost-efficient and environmentally friendly solution, which is being developed in various countries across the world. However, in order to be successful, high-speed rails need to transport...... trains. Unfortunately, the prediction of vibrations in nearby structures is difficult, as wave propagation from the vibration source to the structure is a complex phenomenon. The behaviour of the structure is highly dependent on the path along which the vibrations travel between their source...

Energy consumption of ProTaper Next X1 after glide path with PathFiles and ProGlider.

Science.gov (United States)

Berutti, Elio; Alovisi, Mario; Pastorelli, Michele Angelo; Chiandussi, Giorgio; Scotti, Nicola; Pasqualini, Damiano

2014-12-01

Instrument failure caused by excessive torsional stress can be controlled by creating a manual or mechanical glide path. The ProGlider single-file system (Dentsply Maillefer, Ballaigues, Switzerland) was recently introduced to perform a mechanical glide path. This study was designed to compare the effect of a glide path performed with PathFiles (Dentsply Maillefer) and ProGlider on torque, time, and pecking motion required for ProTaper Next X1 (Dentsply Maillefer) to reach the full working length in simulated root canals. Forty Endo Training Blocks (Dentsply Maillefer) were used. Twenty were prepared with a mechanical glide path using PathFiles 1 and 2 (the PathFile group), and 20 were prepared with a mechanical glide path using a ProGlider single file (the ProGlider group). All samples were shaped with ProTaper Next X1 driven by an endodontic motor connected to a digital wattmeter. The required torque for root canal instrumentation was analyzed by evaluating the electrical power consumption of the endodontic engine. Electric power consumption (mW/h), elapsed time (seconds), and number of pecking motions required to reach the full working length with ProTaper Next X1 were calculated. Differences among groups were analyzed with the parametric Student t test for independent data (P < .05). Elapsed time and electric power consumption were significantly different between groups (P = .0001 for both). ProGlider appears to perform more efficiently than PathFiles in decreasing electric power consumption of ProTaper Next X1 to reach the full working length. This study confirmed the ability of ProGlider to reduce stress in ProTaper Next X1 during shaping through a glide path and preliminary middle and coronal preflaring. Copyright © 2014 American Association of Endodontists. Published by Elsevier Inc. All rights reserved.

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

Shortest loops are pacemakers in random networks of electrically coupled axons

Directory of Open Access Journals (Sweden)

Nikita eVladimirov

2012-04-01

Full Text Available High-frequency oscillations (HFOs are an important part of brain activity in health and disease. However, their origins remain obscure and controversial. One possible mechanism depends on the presence of sparsely distributed gap junctions that electrically couple the axons of principal cells. A plexus of electrically coupled axons is modeled as a random network with bidirectional connections between its nodes. Under certain conditions the network can demonstrate one of two types of oscillatory activity. Type I oscillations (100-200 Hz are predicted to be caused by spontaneously spiking axons in a network with strong (high-conductance gap junctions. Type II oscillations (200-300 Hz require no spontaneous spiking and relatively weak (low-conductance gap junctions, across which spike propagation failures occur. The type II oscillations are reentrant and self-sustained. Here we examine what determines the frequency of type II oscillations. Using simulations we show that the distribution of loop lengths is the key factor for determining frequency in type II network oscillations. We first analyze spike failure between two electrically coupled cells using a model of anatomically reconstructed CA1 pyramidal neuron. Then network oscillations are studied by a cellular automaton model with random network connectivity, in which we control loop statistics. We show that oscillation periods can be predicted from the network's loop statistics. The shortest loop, around which a spike can travel, is the most likely pacemaker candidate.The principle of one loop as a pacemaker is remarkable, because random networks contain a large number of loops juxtaposed and superimposed, and their number rapidly grows with network size. This principle allows us to predict the frequency of oscillations from network connectivity and visa versa. We finally propose that type I oscillations may correspond to ripples, while type II oscillations correspond to so-called fast ripples.

Path-Goal Theory of Leadership

Science.gov (United States)

1975-04-01

Leadership and Turnover Among Managers ," Organization Behavior and Human Performance, 10(1973), pp. 184-200; R. J. House, "A Path-Goal Theory of...of Leadership ." 6R. J. House and G. Dessler, "Path-Goal Theory of Leadership " R. M. Stqg- dill. Managers , Employees, Organization (Ohio State...of Control." 23 R. J. House, "Notes on the Path-Goal Theory of Leadership " (University of Toronto, Faculty of Management Studies, May 1974). 24 R

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.

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.

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

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.

Techniques and applications of path integration

CERN Document Server

Schulman, L S

2005-01-01

A book of techniques and applications, this text defines the path integral and illustrates its uses by example. It is suitable for advanced undergraduates and graduate students in physics; its sole prerequisite is a first course in quantum mechanics. For applications requiring specialized knowledge, the author supplies background material.The first part of the book develops the techniques of path integration. Topics include probability amplitudes for paths and the correspondence limit for the path integral; vector potentials; the Ito integral and gauge transformations; free particle and quadra

Joint modeling of constrained path enumeration and path choice behavior: a semi-compensatory approach

DEFF Research Database (Denmark)

Kaplan, Sigal; Prato, Carlo Giacomo

2010-01-01

A behavioural and a modelling framework are proposed for representing route choice from a path set that satisfies travellers’ spatiotemporal constraints. Within the proposed framework, travellers’ master sets are constructed by path generation, consideration sets are delimited according to spatio...

A Leader-path-following formation system for AGVs with multi-sensor data fusion based vehicle tracking

Science.gov (United States)

Yao, Wen; Zhao, Xijun; Yu, Yufeng; Fang, Yongkun; Wang, Chao; Yang, Tianfu

2017-09-01

Caravans composed of vehicles with different functionality or trafficability raise the demand that formation system structure shall allow vehicles to deviate from the path to be followed when necessary. In this paper, a formation system is developed for autonomous ground vehicles (AGVs) who follow the path of a leader vehicle while retaining the ability of deviation from the reference path. In addition, it improves robustness of preceding vehicle localization by fusing Lidar tracking, camera tracking results with predecessor’s global position within an extended Kalman filter (EKF) in case that one or more sources of preceding vehicle localization is not reliable. The system is applied on real AGV platforms and won the 3rd place in an AGV competition in China.

Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time

DEFF Research Database (Denmark)

Wulff-Nilsen, Christian

2008-01-01

We consider the problem of computing the Wiener index of a graph, defined as the sum of distances between all pairs of its vertices. It is an open problem whether the Wiener index of a planar graph can be found in subquadratic time. We solve this problem by presenting an algorithm with O(n^2*log...

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$

A Hybrid Optimized Weighted Minimum Spanning Tree for the Shortest Intrapath Selection in Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Matheswaran Saravanan

2014-01-01

Full Text Available Wireless sensor network (WSN consists of sensor nodes that need energy efficient routing techniques as they have limited battery power, computing, and storage resources. WSN routing protocols should enable reliable multihop communication with energy constraints. Clustering is an effective way to reduce overheads and when this is aided by effective resource allocation, it results in reduced energy consumption. In this work, a novel hybrid evolutionary algorithm called Bee Algorithm-Simulated Annealing Weighted Minimal Spanning Tree (BASA-WMST routing is proposed in which randomly deployed sensor nodes are split into the best possible number of independent clusters with cluster head and optimal route. The former gathers data from sensors belonging to the cluster, forwarding them to the sink. The shortest intrapath selection for the cluster is selected using Weighted Minimum Spanning Tree (WMST. The proposed algorithm computes the distance-based Minimum Spanning Tree (MST of the weighted graph for the multihop network. The weights are dynamically changed based on the energy level of each sensor during route selection and optimized using the proposed bee algorithm simulated annealing algorithm.

Selective epidemic vaccination under the performant routing algorithms

Science.gov (United States)

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

2018-04-01

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

Penerapan Metode Hill Climbing Pada Sistem Informasi Geografis Untuk Mencari Lintasan Terpendek

Directory of Open Access Journals (Sweden)

Eka Vickraien Dangkua

2016-04-01

Full Text Available Heuristic search methods is one of the methods commonly in use in finding the shortest path, one of which, namely the methods Hill Climbing process where testing is done using heuristic functions. Problems generally encountered is the shortest path search to solve the problem of distance can be changed into a graph structure, where the point of declaring the city and the State line that connects the two cities. From the logic so that it can locate destinations and save on travel costs. The hallmarks of this algorithm are all possible solutions will have then checked one by one from the left side, so it will be obtained solutions with optimal results. On a Hill Climbing method according to case using geographic information systems as a tool in making a decision, by way of collect, examine, and analyze information related to digital map. with a combination of Hill Climbing method and geographic information systems can result in an application that is certainly feasible for use in the search path problems.   Keywords: Hill Climbin method; digital map; Geographic Information Systems

Improved routing strategies for data traffic in scale-free networks

International Nuclear Information System (INIS)

Wu, Zhi-Xi; Peng, Gang; Wong, Wing-Ming; Yeung, Kai-Hau

2008-01-01

We study the information packet routing process in scale-free networks by mimicking Internet traffic delivery. We incorporate both the global shortest paths information and local degree information of the network in the dynamic process, via two tunable parameters, α and β, to guide the packet routing. We measure the performance of the routing method by both the average transit times of packets and the critical packet generation rate (above which packet aggregation occurs in the network). We found that the routing strategies which integrate ingredients of both global and local topological information of the underlying networks perform much better than the traditional shortest path routing protocol taking into account the global topological information only. Moreover, by doing comparative studies with some related works, we found that the performance of our proposed method shows universal efficiency characteristic against the amount of traffic

Modeling Physarum space exploration using memristors

International Nuclear Information System (INIS)

Ntinas, V; Sirakoulis, G Ch; Vourkas, I; Adamatzky, A I

2017-01-01

Slime mold Physarum polycephalum optimizes its foraging behaviour by minimizing the distances between the sources of nutrients it spans. When two sources of nutrients are present, the slime mold connects the sources, with its protoplasmic tubes, along the shortest path. We present a two-dimensional mesh grid memristor based model as an approach to emulate Physarum’s foraging strategy, which includes space exploration and reinforcement of the optimally formed interconnection network in the presence of multiple aliment sources. The proposed algorithmic approach utilizes memristors and LC contours and is tested in two of the most popular computational challenges for Physarum, namely maze and transportation networks. Furthermore, the presented model is enriched with the notion of noise presence, which positively contributes to a collective behavior and enables us to move from deterministic to robust results. Consequently, the corresponding simulation results manage to reproduce, in a much better qualitative way, the expected transportation networks. (paper)

Off-great-circle paths in transequatorial propagation: 2. Nonmagnetic-field-aligned reflections

Science.gov (United States)

Tsunoda, Roland T.; Maruyama, Takashi; Tsugawa, Takuya; Yokoyama, Tatsuhiro; Ishii, Mamoru; Nguyen, Trang T.; Ogawa, Tadahiko; Nishioka, Michi

2016-11-01

There is considerable evidence that plasma structure in nighttime equatorial F layer develops from large-scale wave structure (LSWS) in bottomside F layer. However, crucial details of how this process proceeds, from LSWS to equatorial plasma bubbles (EPBs), remain to be sorted out. A major obstacle to success is the paucity of measurements that provide a space-time description of the bottomside F layer over a broad geographical region. The transequatorial propagation (TEP) experiment is one of few methods that can do so. New findings using a TEP experiment, between Shepparton (SHP), Australia, and Oarai (ORI), Japan, are presented in two companion papers. In Paper 1 (P1), (1) off-great-circle (OGC) paths are described in terms of discrete and diffuse types, (2) descriptions of OGC paths are generalized from a single-reflection to a multiple-reflection process, and (3) discrete type is shown to be associated with an unstructured but distorted upwelling, whereas the diffuse type is shown to be associated with EPBs. In Paper 2 (P2), attention is placed on differences in east-west (EW) asymmetry, found between OGC paths from the SHP-ORI experiment and those from another near-identical TEP experiment. Differences are reconciled by allowing three distinct sources for the EW asymmetries: (1) reflection properties within an upwelling (see P1), (2) OGC paths that depend on magnetic declination of geomagnetic field (B), and (3) OGC paths supported by non-B-aligned reflectors at latitudes where inclination of B is finite.

Graphs with not all possible path-kernels

DEFF Research Database (Denmark)

Aldred, Robert; Thomassen, Carsten

2004-01-01

The Path Partition Conjecture states that the vertices of a graph G with longest path of length c may be partitioned into two parts X and Y such that the longest path in the subgraph of G induced by X has length at most a and the longest path in the subgraph of G induced by Y has length at most b...

Design of Active N-path Filters

NARCIS (Netherlands)

Darvishi, M.; van der Zee, Ronan A.R.; Nauta, Bram

2013-01-01

A design methodology for synthesis of active N-path bandpass filters is introduced. Based on this methodology, a 0.1-to-1.2 GHz tunable 6th-order N-path channel-select filter in 65 nm LP CMOS is introduced. It is based on coupling N-path filters with gyrators, achieving a “flat‿ passband shape and

Combining Vertex-centric Graph Processing with SPARQL for Large-scale RDF Data Analytics

KAUST Repository

Abdelaziz, Ibrahim; Al-Harbi, Mohammad Razen; Salihoglu, Semih; Kalnis, Panos

2017-01-01

, but not both. We bridge the gap by introducing Spartex, a versatile framework for complex RDF analytics. Spartex extends SPARQL to support programs that combine seamlessly generic graph algorithms (e.g., PageRank, Shortest Paths, etc.) with SPARQL queries

Path integrals and geometry of trajectories

International Nuclear Information System (INIS)

Blau, M.; Keski-Vakkuri, E.; Niemi, A.J.

1990-01-01

A geometrical interpretation of path integrals is developed in the space of trajectories. This yields a supersymmetric formulation of a generic path integral, with the supersymmetry resembling the BRST supersymmetry of a first class constrained system. If the classical equation of motion is a Killing vector field in the space of trajectories, the supersymmetry localizes the path integral to classical trajectories and the WKB approximation becomes exact. This can be viewed as a path integral generalization of the Duistermaat-Heckman theorem, which states the conditions for the exactness of the WKB approximation for integrals in a compact phase space. (orig.)

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.

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.

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

Long open-path measurements of greenhouse gases in air using near-infrared Fourier transform spectroscopy

Directory of Open Access Journals (Sweden)

D. W. T. Griffith

2018-03-01

Full Text Available In complex and urban environments, atmospheric trace gas composition is highly variable in time and space. Point measurement techniques for trace gases with in situ instruments are well established and accurate, but do not provide spatial averaging to compare against developing high-resolution atmospheric models of composition and meteorology with resolutions of the order of a kilometre. Open-path measurement techniques provide path average concentrations and spatial averaging which, if sufficiently accurate, may be better suited to assessment and interpretation with such models. Open-path Fourier transform spectroscopy (FTS in the mid-infrared region, and differential optical absorption spectroscopy (DOAS in the UV and visible, have been used for many years for open-path spectroscopic measurements of selected species in both clean air and in polluted environments. Near infrared instrumentation allows measurements over longer paths than mid-infrared FTS for species such as greenhouse gases which are not easily accessible to DOAS.In this pilot study we present the first open-path near-infrared (4000–10 000 cm−1, 1.0–2.5 µm FTS measurements of CO2, CH4, O2, H2O and HDO over a 1.5 km path in urban Heidelberg, Germany. We describe the construction of the open-path FTS system, the analysis of the collected spectra, several measures of precision and accuracy of the measurements, and the results a four-month trial measurement period in July–November 2014. The open-path measurements are compared to calibrated in situ measurements made at one end of the open path. We observe significant differences of the order of a few ppm for CO2 and a few tens of ppb for CH4 between the open-path and point measurements which are 2 to 4 times the measurement repeatability, but we cannot unequivocally assign the differences to specific local sources or sinks. We conclude that open-path FTS may provide a valuable new tool for investigations of

Tool path in torus tool CNC machining

Directory of Open Access Journals (Sweden)

XU Ying

2016-10-01

Full Text Available This paper is about tool path in torus tool CNC machining.The mathematical model of torus tool is established.The tool path planning algorithm is determined through calculation of the cutter location,boundary discretization,calculation of adjacent tool path and so on,according to the conversion formula,the cutter contact point will be converted to the cutter location point and then these points fit a toolpath.Lastly,the path planning algorithm is implemented by using Matlab programming.The cutter location points for torus tool are calculated by Matlab,and then fit these points to a toolpath.While using UG software,another tool path of free surface is simulated of the same data.It is drew compared the two tool paths that using torus tool is more efficient.

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

How to solve path integrals in quantum mechanics

International Nuclear Information System (INIS)

Grosche, C.

1994-10-01

A systematic classification of Feynman path integrals in quantum mechanics is presented and a table of solvable path integrals is given which reflects the progress made during the last 15 years, including, of course, the main contributions since the invention of the path integral by Feynman in 1942. An outline of the general theory is given which will serve as a quick reference for solving path integrals. Explicit formulae for the so-called basic path integrals are presented on which our general scheme to classify and calculate path integrals in quantum mechanics is based. (orig.)

Path integrals for arbitrary canonical transformations

International Nuclear Information System (INIS)

Oliveira, L.A.R. de.

1980-01-01

Some aspects of the path integral formulation of quantum mechanics are studied. This formalism is generalized to arbitrary canonical transformations, by means of an association between path integral probalility amplitudes and classical generators of transformations, analogous to the usual Hamiltonian time development phase space expression. Such association turns out to be equivalent to the Weyl quantization rule, and it is also shown that this formalism furnishes a path integral representation for a Lie algebra of a given set of classical generators. Some physical considerations about the path integral quantization procedure and about the relationship between classical and quantum dynamical structures are also discussed. (Author) [pt

Sink-oriented Dynamic Location Service Protocol for Mobile Sinks with an Energy Efficient Grid-Based Approach

Directory of Open Access Journals (Sweden)

Hyunseung Choo

2009-03-01

Full Text Available Sensor nodes transmit the sensed information to the sink through wireless sensor networks (WSNs. They have limited power, computational capacities and memory. Portable wireless devices are increasing in popularity. Mechanisms that allow information to be efficiently obtained through mobile WSNs are of significant interest. However, a mobile sink introduces many challenges to data dissemination in large WSNs. For example, it is important to efficiently identify the locations of mobile sinks and disseminate information from multi-source nodes to the multi-mobile sinks. In particular, a stationary dissemination path may no longer be effective in mobile sink applications, due to sink mobility. In this paper, we propose a Sink-oriented Dynamic Location Service (SDLS approach to handle sink mobility. In SDLS, we propose an Eight-Direction Anchor (EDA system that acts as a location service server. EDA prevents intensive energy consumption at the border sensor nodes and thus provides energy balancing to all the sensor nodes. Then we propose a Location-based Shortest Relay (LSR that efficiently forwards (or relays data from a source node to a sink with minimal delay path. Our results demonstrate that SDLS not only provides an efficient and scalable location service, but also reduces the average data communication overhead in scenarios with multiple and moving sinks and sources.

Sink-oriented Dynamic Location Service Protocol for Mobile Sinks with an Energy Efficient Grid-Based Approach.

Science.gov (United States)

Jeon, Hyeonjae; Park, Kwangjin; Hwang, Dae-Joon; Choo, Hyunseung

2009-01-01

Sensor nodes transmit the sensed information to the sink through wireless sensor networks (WSNs). They have limited power, computational capacities and memory. Portable wireless devices are increasing in popularity. Mechanisms that allow information to be efficiently obtained through mobile WSNs are of significant interest. However, a mobile sink introduces many challenges to data dissemination in large WSNs. For example, it is important to efficiently identify the locations of mobile sinks and disseminate information from multi-source nodes to the multi-mobile sinks. In particular, a stationary dissemination path may no longer be effective in mobile sink applications, due to sink mobility. In this paper, we propose a Sink-oriented Dynamic Location Service (SDLS) approach to handle sink mobility. In SDLS, we propose an Eight-Direction Anchor (EDA) system that acts as a location service server. EDA prevents intensive energy consumption at the border sensor nodes and thus provides energy balancing to all the sensor nodes. Then we propose a Location-based Shortest Relay (LSR) that efficiently forwards (or relays) data from a source node to a sink with minimal delay path. Our results demonstrate that SDLS not only provides an efficient and scalable location service, but also reduces the average data communication overhead in scenarios with multiple and moving sinks and sources.

Split-plot designs for robotic serial dilution assays.

Science.gov (United States)

Buzas, Jeffrey S; Wager, Carrie G; Lansky, David M

2011-12-01

This article explores effective implementation of split-plot designs in serial dilution bioassay using robots. We show that the shortest path for a robot to fill plate wells for a split-plot design is equivalent to the shortest common supersequence problem in combinatorics. We develop an algorithm for finding the shortest common supersequence, provide an R implementation, and explore the distribution of the number of steps required to implement split-plot designs for bioassay through simulation. We also show how to construct collections of split plots that can be filled in a minimal number of steps, thereby demonstrating that split-plot designs can be implemented with nearly the same effort as strip-plot designs. Finally, we provide guidelines for modeling data that result from these designs. © 2011, The International Biometric Society.

A Bio-Inspired Approach to Traffic Network Equilibrium Assignment Problem.

Science.gov (United States)

Zhang, Xiaoge; Mahadevan, Sankaran

2018-04-01

Finding an equilibrium state of the traffic assignment plays a significant role in the design of transportation networks. We adapt the path finding mathematical model of slime mold Physarum polycephalum to solve the traffic equilibrium assignment problem. We make three contributions in this paper. First, we propose a generalized Physarum model to solve the shortest path problem in directed and asymmetric graphs. Second, we extend it further to resolve the network design problem with multiple source nodes and sink nodes. At last, we demonstrate that the Physarum solver converges to the user-optimized (Wardrop) equilibrium by dynamically updating the costs of links in the network. In addition, convergence of the developed algorithm is proved. Numerical examples are used to demonstrate the efficiency of the proposed algorithm. The superiority of the proposed algorithm is demonstrated in comparison with several other algorithms, including the Frank-Wolfe algorithm, conjugate Frank-Wolfe algorithm, biconjugate Frank-Wolfe algorithm, and gradient projection algorithm.

Path probability distribution of stochastic motion of non dissipative systems: a classical analog of Feynman factor of path integral

International Nuclear Information System (INIS)

Lin, T.L.; Wang, R.; Bi, W.P.; El Kaabouchi, A.; Pujos, C.; Calvayrac, F.; Wang, Q.A.

2013-01-01

We investigate, by numerical simulation, the path probability of non dissipative mechanical systems undergoing stochastic motion. The aim is to search for the relationship between this probability and the usual mechanical action. The model of simulation is a one-dimensional particle subject to conservative force and Gaussian random displacement. The probability that a sample path between two fixed points is taken is computed from the number of particles moving along this path, an output of the simulation, divided by the total number of particles arriving at the final point. It is found that the path probability decays exponentially with increasing action of the sample paths. The decay rate increases with decreasing randomness. This result supports the existence of a classical analog of the Feynman factor in the path integral formulation of quantum mechanics for Hamiltonian systems

Simulated Annealing Technique for Routing in a Rectangular Mesh Network

Directory of Open Access Journals (Sweden)

Noraziah Adzhar

2014-01-01

Full Text Available In the process of automatic design for printed circuit boards (PCBs, the phase following cell placement is routing. On the other hand, routing process is a notoriously difficult problem, and even the simplest routing problem which consists of a set of two-pin nets is known to be NP-complete. In this research, our routing region is first tessellated into a uniform Nx×Ny array of square cells. The ultimate goal for a routing problem is to achieve complete automatic routing with minimal need for any manual intervention. Therefore, shortest path for all connections needs to be established. While classical Dijkstra’s algorithm guarantees to find shortest path for a single net, each routed net will form obstacles for later paths. This will add complexities to route later nets and make its routing longer than the optimal path or sometimes impossible to complete. Today’s sequential routing often applies heuristic method to further refine the solution. Through this process, all nets will be rerouted in different order to improve the quality of routing. Because of this, we are motivated to apply simulated annealing, one of the metaheuristic methods to our routing model to produce better candidates of sequence.

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

Strategic Team AI Path Plans: Probabilistic Pathfinding

Directory of Open Access Journals (Sweden)

Tng C. H. John

2008-01-01

Full Text Available This paper proposes a novel method to generate strategic team AI pathfinding plans for computer games and simulations using probabilistic pathfinding. This method is inspired by genetic algorithms (Russell and Norvig, 2002, in that, a fitness function is used to test the quality of the path plans. The method generates high-quality path plans by eliminating the low-quality ones. The path plans are generated by probabilistic pathfinding, and the elimination is done by a fitness test of the path plans. This path plan generation method has the ability to generate variation or different high-quality paths, which is desired for games to increase replay values. This work is an extension of our earlier work on team AI: probabilistic pathfinding (John et al., 2006. We explore ways to combine probabilistic pathfinding and genetic algorithm to create a new method to generate strategic team AI pathfinding plans.

P-wave pulse analysis to retrieve source and propagation effects in the case of Vrancea earthquakes

International Nuclear Information System (INIS)

Popescu, E.; Popa, M.; Placinta, A.; Grecu, B.; Radulian, M.

2004-01-01

Seismic source parameters and attenuation structure properties are obtained from the first P-wave pulse analysis and empirical Green's function deconvolution. The P pulse characteristics are combined effects of source and path properties. To reproduce the real source and structure parameters it is crucial to apply a method able to distinguish between the different factors affecting the observed seismograms. For example the empirical Green's function deconvolution method (Hartzell, 1978) allows the retrieval of the apparent source time function or source spectrum corrected for path, site and instrumental effects. The apparent source duration is given by the width of the deconvoluted source pulse and is directly related to the source dimension. Once the source time function established, next we can extract the parameters related to path effects. The difference between the pulse recorded at a given station and the source pulse obtained by deconvolution is a measure of the attenuation along the path from focus to the station. On the other hand, the pulse width variations with azimuth depend critically on the fault plane orientation and source directivity. In favourable circumstances (high signal/noise ratio, high resolution and station coverage), the method of analysis proposed in this paper allows the constraint of the rupture plane among the two nodal planes characterizing the fault plane solution, even for small events. P-wave pulse analysis was applied for 25 Vrancea earthquakes recorded between 1999 and 2003 by the Romanian local network to determine source parameters and attenuation properties. Our results outline high-stress drop seismic energy release with relatively simple rupture process for the considered events and strong lateral variation of attenuation of seismic waves across Carpathians Arc. (authors)

An Energy-Efficient Target-Tracking Strategy for Mobile Sensor Networks.

Science.gov (United States)

Mahboubi, Hamid; Masoudimansour, Walid; Aghdam, Amir G; Sayrafian-Pour, Kamran

2017-02-01

In this paper, an energy-efficient strategy is proposed for tracking a moving target in an environment with obstacles, using a network of mobile sensors. Typically, the most dominant sources of energy consumption in a mobile sensor network are sensing, communication, and movement. The proposed algorithm first divides the field into a grid of sufficiently small cells. The grid is then represented by a graph whose edges are properly weighted to reflect the energy consumption of sensors. The proposed technique searches for near-optimal locations for the sensors in different time instants to route information from the target to destination, using a shortest path algorithm. Simulations confirm the efficacy of the proposed algorithm.

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

An energy-aware engineered control plane for wavelength-routed networks

DEFF Research Database (Denmark)

Ricciardi, Sergio; Wang, Jiayuan; Palmieri, Francesco

2015-01-01

' operational expenditures. To face this problem, we propose a single-stage routing and wavelength assignment scheme, based on several network engineering extensions to the Generalised Multi-Protocol Label Switching (GMPLS) control plane protocols, mainly Open Shortest Path First, with new composed metrics...

The influence of NDT-Bobath and PNF methods on the field support and total path length measure foot pressure (COP) in patients after stroke.

Science.gov (United States)

Krukowska, Jolanta; Bugajski, Marcin; Sienkiewicz, Monika; Czernicki, Jan

In stroke patients, the NDT - (Bobath - Neurodevelopmental Treatment) and PNF (Proprioceptive Neuromuscular Facilitation) methods are used to achieve the main objective of rehabilitation, which aims at the restoration of maximum patient independence in the shortest possible period of time (especially the balance of the body). The aim of the study is to evaluate the effect of the NDT-Bobath and PNF methods on the field support and total path length measure foot pressure (COP) in patients after stroke. The study included 72 patients aged from 20 to 69 years after ischemic stroke with Hemiparesis. The patients were divided into 4 groups by a simple randomization. The criteria for this division were: the body side (right or left) affected by paresis and the applied rehabilitation methods. All the patients were applied the recommended kinesitherapeutic method (randomized), 35 therapy sessions, every day for a period of six weeks. Before initiation of therapy and after 6 weeks was measured the total area of the support and path length (COP (Center Of Pressure) measure foot pressure) using stabilometer platform - alpha. The results were statistically analyzed. After treatment studied traits decreased in all groups. The greatest improvement was obtained in groups with NDT-Bobath therapy. NDT-Bobath method for improving the balance of the body is a more effective method of treatment in comparison with of the PNF method. In stroke patients, the effectiveness of NDT-Bobath method does not depend on hand paresis. Copyright © 2016 Polish Neurological Society. Published by Elsevier Urban & Partner Sp. z o.o. All rights reserved.

Perbandingan Algoritma Simulated Annealing dan Harmony Search dalam Penerapan Picking Order Sequence

Directory of Open Access Journals (Sweden)

Tanti Octavia

2017-12-01

Full Text Available Implementation of mobile rack warehouse is commonly used in manufacturing industry because it can minimize the warehouse area used. Applying picking orders in taking of Stock Keeping Unit (SKU on mobile rack warehouses could give fast loading order. This research aims to find out which algorithm is better in applying picking order sequence in mobile rack warehouse. The algorithm used is Simualted Annealing (SA and Harmony Search (HS algorithm. Both of these algorithms will be compared in terms of the gap with the shortest path method.The result shows that the HS algorithm produces a better solution than the SA algorithm with lower CPU time, but the convergence rate of HS is lower than that of SA.HS was able to produce a better solution than the shortest path method of 9 cases, while SA only 8 cases from 15 cases.

Optimal parallel algorithms for problems modeled by a family of intervals

Science.gov (United States)

Olariu, Stephan; Schwing, James L.; Zhang, Jingyuan

1992-01-01

A family of intervals on the real line provides a natural model for a vast number of scheduling and VLSI problems. Recently, a number of parallel algorithms to solve a variety of practical problems on such a family of intervals have been proposed in the literature. Computational tools are developed, and it is shown how they can be used for the purpose of devising cost-optimal parallel algorithms for a number of interval-related problems including finding a largest subset of pairwise nonoverlapping intervals, a minimum dominating subset of intervals, along with algorithms to compute the shortest path between a pair of intervals and, based on the shortest path, a parallel algorithm to find the center of the family of intervals. More precisely, with an arbitrary family of n intervals as input, all algorithms run in O(log n) time using O(n) processors in the EREW-PRAM model of computation.

Association of manual or engine-driven glide path preparation with canal centring and apical transportation: a systematic review.

Science.gov (United States)

Hartmann, R C; Peters, O A; de Figueiredo, J A P; Rossi-Fedele, G

2018-04-28

The role and effect of glide path preparation in root canal treatment remain controversial. This systematic review aims to compare apical transportation and canal centring of different glide path preparation techniques, with or without subsequent engine-driven root canal preparation. A database search in PubMed, PubMed Central, Embase, Scopus, EBSCO Dentistry & Oral Sciences Source and Virtual Health Library was conducted, using appropriate key words to identify the effect of glide path preparation (or its absence) on apical transportation and canal centring. An assessment for the risk of bias in included studies was carried out. Amongst 2146 studies, 18 satisfied the inclusion criteria. Nine studies assessed glide path preparation per se, comparing apical transportation and canal centring of rotary systems and/or manual files; eleven further investigations examined the efficacy of the glide path prior to final canal preparation with different engine-driven systems. Risk of bias and other study design features with potential influence on study outcomes and clinical implications were assessed. Based on the available evidence, and within the limitation of the studies included, preparation of a glide path using rotary sequences performs similarly (in most of the component studies) or significantly better than manual preparation when assessing apical transportation or canal centring. When compared to the absence of a glide path, canal shaping following glide path preparation was of similar, or significantly better quality, in regard to apical transportation or canal centring. © 2018 International Endodontic Journal. Published by John Wiley & Sons Ltd.

Astronomers Trace Microquasar's Path Back in Time

Science.gov (United States)

2003-01-01

Astronomers have traced the orbit through our Milky Way Galaxy of a voracious neutron star and a companion star it is cannibalizing, and conclude that the pair joined more than 30 million years ago and probably were catapulted out of a cluster of stars far from the Galaxy's center. Path of Microquasar and Sun Path of Microquasar (red) and Sun (yellow) through the Milky Way Galaxy for the past 230 million years. Animations: GIF Version MPEG Version CREDIT: Mirabel & Rodrigues, NRAO/AUI/NSF The pair of stars, called Scorpius X-1, form a "microquasar," in which material sucked from the "normal" star forms a rapidly-rotating disk around the superdense neutron star. The disk becomes so hot it emits X-rays, and also spits out "jets" of subatomic particles at nearly the speed of light. Using precise positional data from the National Science Foundation's Very Long Baseline Array (VLBA) and from optical telescopes, Felix Mirabel, an astrophysicist at the Institute for Astronomy and Space Physics of Argentina and French Atomic Energy Commission, and Irapuan Rodrigues, also of the French Atomic Energy Commission, calculated that Scorpius X-1 is not orbiting the Milky Way's center in step with most other stars, but instead follows an eccentric path far above and below the Galaxy's plane. Scorpius X-1, discovered with a rocket-borne X-ray telescope in 1962, is about 9,000 light-years from Earth. It is the brightest continuous source of X-rays beyond the Solar System. The 1962 discovery and associated work earned a share of the 2002 Nobel Prize in physics for Riccardo Giacconi. Mirabel and Rodrigues used a number of published observations to calculate the path of Scorpius X-1 over the past few million years. "This is the most accurate determination we have made of the path of an X-ray binary," said Mirabel. By tracing the object's path backward in time, the scientists were able to conclude that the neutron star and its companion have been traveling together for more than 30

OPTIMIZATION OF DISJOINTS FOR MINIMIZATION OF FAILURE IN WDM OPTICAL NETWORK

Directory of Open Access Journals (Sweden)

A. Renugadevi

2015-06-01

Full Text Available In an optical network, the fiber optic cable is used for communication between the nodes in a network by passing lights. The main problem in optical network is finding the link disjoints as well as optimal solution for the disjoints. To tolerate a single link failure in the network, the enhanced active path first algorithm is used which computes the re-routed back-up path. The multiple link failure in a network called fibre span disjoint path problem is solved using integer linear programming algorithm. The loop back recovery is used to provide pre-planned recovery of link or node failures in a network which allows dynamic choice of routes over pre-planned directions. Considering reliability in a mesh networks, the reliability algorithm helps to achieve the maximum reliability in two-path protection. It addresses the multiple disjoint failures that arise in a network and discusses the best solution between paths shared nodes or links. The unified algorithm is used to generate the optimal results with minimum cost for multiple link failures. The heuristic algorithm namely maximum arbitrary double-link protection algorithm helps to pre-compute the back-up path for double-link failures. In all the above approaches the shortest optimized path must be improved. To find the best shortest path, link-disjoint lightpath algorithm is designed to compute the disjoint occurred in a network and it also satisfies the wavelength continuity constraint in wavelength division multiplexing. A polynomial time algorithm Wavelength Division Multiplexing – Passive Optical Networking is used to compute the disjoint happen in the network. The overall time efficiency is analyzed and performance is evaluated through simulations.

An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks

Directory of Open Access Journals (Sweden)

Huanlin Liu

2014-01-01

Full Text Available Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of optical RAM. In the paper, the network coding operation is defined to evaluate the number of network coding operation cost in the paper. An optical multicast routing algorithm based on minimal number of network coding operations is proposed to improve the multicast capacity. Two heuristic criteria are designed to establish the multicast routing with low network coding cost and high multicast capacity. One is to select one path from the former K shortest paths with the least probability of dropping the multicast maximal capacity. The other is to select the path with lowest potential coding operations with the highest link shared degree among the multiple wavelength disjoint paths cluster from source to each destination. Comparing with the other multicast routing based on network coding, simulation results show that the proposed multicast routing algorithm can effectively reduce the times of network coding operations, can improve the probability of reaching multicast maximal capacity, and can keep the less multicast routing link cost for optical WDM networks.

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.).

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.)

Improved initial guess for minimum energy path calculations

International Nuclear Information System (INIS)

Smidstrup, Søren; Pedersen, Andreas; Stokbro, Kurt; Jónsson, Hannes

2014-01-01

A method is presented for generating a good initial guess of a transition path between given initial and final states of a system without evaluation of the energy. An objective function surface is constructed using an interpolation of pairwise distances at each discretization point along the path and the nudged elastic band method then used to find an optimal path on this image dependent pair potential (IDPP) surface. This provides an initial path for the more computationally intensive calculations of a minimum energy path on an energy surface obtained, for example, by ab initio or density functional theory. The optimal path on the IDPP surface is significantly closer to a minimum energy path than a linear interpolation of the Cartesian coordinates and, therefore, reduces the number of iterations needed to reach convergence and averts divergence in the electronic structure calculations when atoms are brought too close to each other in the initial path. The method is illustrated with three examples: (1) rotation of a methyl group in an ethane molecule, (2) an exchange of atoms in an island on a crystal surface, and (3) an exchange of two Si-atoms in amorphous silicon. In all three cases, the computational effort in finding the minimum energy path with DFT was reduced by a factor ranging from 50% to an order of magnitude by using an IDPP path as the initial path. The time required for parallel computations was reduced even more because of load imbalance when linear interpolation of Cartesian coordinates was used

Private information alone can trigger trapping of ant colonies in local feeding optima.

Science.gov (United States)

Czaczkes, Tomer J; Salmane, Anete K; Klampfleuthner, Felicia A M; Heinze, Jürgen

2016-03-01

Ant colonies are famous for using trail pheromones to make collective decisions. Trail pheromone systems are characterised by positive feedback, which results in rapid collective decision making. However, in an iconic experiment, ants were shown to become 'trapped' in exploiting a poor food source, if it was discovered earlier. This has conventionally been explained by the established pheromone trail becoming too strong for new trails to compete. However, many social insects have a well-developed memory, and private information often overrules conflicting social information. Thus, route memory could also explain this collective 'trapping' effect. Here, we disentangled the effects of social and private information in two 'trapping' experiments: one in which ants were presented with a good and a poor food source, and one in which ants were presented with a long and a short path to the same food source. We found that private information is sufficient to trigger trapping in selecting the poorer of two food sources, and may be sufficient to cause it altogether. Memories did not trigger trapping in the shortest path experiment, probably because sufficiently detailed memories did not form. The fact that collective decisions can be triggered by private information alone may require other collective patterns previously attributed solely to social information use to be reconsidered. © 2016. Published by The Company of Biologists Ltd.

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.

On the strong metric dimension of generalized butterfly graph, starbarbell graph, and {C}_{m}\\odot {P}_{n} graph

Science.gov (United States)

Yunia Mayasari, Ratih; Atmojo Kusmayadi, Tri

2018-04-01

Let G be a connected graph with vertex set V(G) and edge set E(G). For every pair of vertices u,v\\in V(G), the interval I[u, v] between u and v to be the collection of all vertices that belong to some shortest u ‑ v path. A vertex s\\in V(G) strongly resolves two vertices u and v if u belongs to a shortest v ‑ s path or v belongs to a shortest u ‑ s path. A vertex set S of G is a strong resolving set of G if every two distinct vertices of G are strongly resolved by some vertex of S. The strong metric basis of G is a strong resolving set with minimal cardinality. The strong metric dimension sdim(G) of a graph G is defined as the cardinality of strong metric basis. In this paper we determine the strong metric dimension of a generalized butterfly graph, starbarbell graph, and {C}mȯ {P}n graph. We obtain the strong metric dimension of generalized butterfly graph is sdim(BFn ) = 2n ‑ 2. The strong metric dimension of starbarbell graph is sdim(S{B}{m1,{m}2,\\ldots,{m}n})={\\sum }i=1n({m}i-1)-1. The strong metric dimension of {C}mȯ {P}n graph are sdim({C}mȯ {P}n)=2m-1 for m > 3 and n = 2, and sdim({C}mȯ {P}n)=2m-2 for m > 3 and n > 2.

Vulnerabilities, Influences and Interaction Paths: Failure Data for Integrated System Risk Analysis

Science.gov (United States)

Malin, Jane T.; Fleming, Land

2006-01-01

We describe graph-based analysis methods for identifying and analyzing cross-subsystem interaction risks from subsystem connectivity information. By discovering external and remote influences that would be otherwise unexpected, these methods can support better communication among subsystem designers at points of potential conflict and to support design of more dependable and diagnosable systems. These methods identify hazard causes that can impact vulnerable functions or entities if propagated across interaction paths from the hazard source to the vulnerable target. The analysis can also assess combined impacts of And-Or trees of disabling influences. The analysis can use ratings of hazards and vulnerabilities to calculate cumulative measures of the severity and importance. Identification of cross-subsystem hazard-vulnerability pairs and propagation paths across subsystems will increase coverage of hazard and risk analysis and can indicate risk control and protection strategies.

Path Integration on the Upper Half-Plane

OpenAIRE

Reijiro, KUBO; Research Institute for Theoretical Physics Hiroshima University

1987-01-01

Feynman's path integral is considered on the Poincare upper half-plane. It is shown that the fundamental solution to the heat equation ∂f/∂t=Δ_Hf can be expressed in terms of a path integral. A simple relation between the path integral and the Selberg trace formula is discussed briefly.

Sensitivity Analysis of Deviation Source for Fast Assembly Precision Optimization

Directory of Open Access Journals (Sweden)

Jianjun Tang

2014-01-01

Full Text Available Assembly precision optimization of complex product has a huge benefit in improving the quality of our products. Due to the impact of a variety of deviation source coupling phenomena, the goal of assembly precision optimization is difficult to be confirmed accurately. In order to achieve optimization of assembly precision accurately and rapidly, sensitivity analysis of deviation source is proposed. First, deviation source sensitivity is defined as the ratio of assembly dimension variation and deviation source dimension variation. Second, according to assembly constraint relations, assembly sequences and locating, deviation transmission paths are established by locating the joints between the adjacent parts, and establishing each part’s datum reference frame. Third, assembly multidimensional vector loops are created using deviation transmission paths, and the corresponding scalar equations of each dimension are established. Then, assembly deviation source sensitivity is calculated by using a first-order Taylor expansion and matrix transformation method. Finally, taking assembly precision optimization of wing flap rocker as an example, the effectiveness and efficiency of the deviation source sensitivity analysis method are verified.

Pedestrian paths: why path-dependence theory leaves health policy analysis lost in space.

Science.gov (United States)

Brown, Lawrence D

2010-08-01

Path dependence, a model first advanced to explain puzzles in the diffusion of technology, has lately won allegiance among analysts of the politics of public policy, including health care policy. Though the central premise of the model--that past events and decisions shape options for innovation in the present and future--is indisputable (indeed path dependence is, so to speak, too shallow to be false), the approach, at least as applied to health policy, suffers from ambiguities that undercut its claims to illuminate policy projects such as managed care, on which this article focuses. Because path dependence adds little more than marginal value to familiar images of the politics of policy--incrementalism, for one--analysts might do well to put it on the back burner and pursue instead "thick descriptions" that help them to distinguish different degrees of openness to exogenous change among diverse policy arenas.

Identifying the source, transport path and sinks of sewage derived organic matter

International Nuclear Information System (INIS)

Mudge, Stephen M.; Duce, Caroline E.

2005-01-01

Since sewage discharges can significantly contribute to the contaminant loadings in coastal areas, it is important to identify sources, pathways and environmental sinks. Sterol and fatty alcohol biomarkers were quantified in source materials, suspended sediments and settling matter from the Ria Formosa Lagoon. Simple ratios between key biomarkers including 5β-coprostanol, cholesterol and epi-coprostanol were able to identify the sewage sources and effected deposition sites. Multivariate methods (PCA) were used to identify co-varying sites. PLS analysis using the sewage discharge as the signature indicated ∼ 25% of the variance in the sites could be predicted by the sewage signature. A new source of sewage derived organic matter was found with a high sewage predictable signature. The suspended sediments had relatively low sewage signatures as the material was diluted with other organic matter from in situ production. From a management viewpoint, PLS provides a useful tool in identifying the pathways and accumulation sites for such contaminants. - Multivariate statistical analysis was used to identify pathways and accumulation sites for contaminants in coastal waters

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

Curvature-Continuous 3D Path-Planning Using QPMI Method

Directory of Open Access Journals (Sweden)

Seong-Ryong Chang

2015-06-01

Full Text Available It is impossible to achieve vertex movement and rapid velocity control in aerial robots and aerial vehicles because of momentum from the air. A continuous-curvature path ensures such robots and vehicles can fly with stable and continuous movements. General continuous path-planning methods use spline interpolation, for example B-spline and Bézier curves. However, these methods cannot be directly applied to continuous path planning in a 3D space. These methods use a subset of the waypoints to decide curvature and some waypoints are not included in the planned path. This paper proposes a method for constructing a curvature-continuous path in 3D space that includes every waypoint. The movements in each axis, x, y and z, are separated by the parameter u. Waypoint groups are formed, each with its own continuous path derived using quadratic polynomial interpolation. The membership function then combines each continuous path into one continuous path. The continuity of the path is verified and the curvature-continuous path is produced using the proposed method.

Application of supernetworks in modeling activity-travel behaviour

NARCIS (Netherlands)

Liao, F.; Arentze, T.A.; Timmermans, H.J.P.

2011-01-01

Network representation and optimization has for long been applied to address vast engineering and scientific problems. Examples are originated from the Seven Bridges of Konigsberg, to a variety of classic P and NP-hard problems such minimum spanning tree, shortest path, and traveling salesman

Path integration on the upper half-plane

International Nuclear Information System (INIS)

Kubo, Reijiro.

1987-06-01

Feynman's path integral is considered on the Poincare upper half-plane. It is shown that the fundamental solution to the heat equation δf/δt = Δ H f can be expressed in terms of a path integral. A simple relation between the path integral and the Selberg trace formula is discussed briefly. (author)

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

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.

Identification of dust storm source areas in West Asia using multiple environmental datasets.

Science.gov (United States)

Cao, Hui; Amiraslani, Farshad; Liu, Jian; Zhou, Na

2015-01-01

Sand and Dust storms are common phenomena in arid and semi-arid areas. West Asia Region, especially Tigris-Euphrates alluvial plain, has been recognized as one of the most important dust source areas in the world. In this paper, a method is applied to extract SDS (Sand and Dust Storms) sources in West Asia region using thematic maps, climate and geography, HYSPLIT model and satellite images. Out of 50 dust storms happened during 2000-2013 and collected in form of MODIS images, 27 events were incorporated as demonstrations of the simulated trajectories by HYSPLIT model. Besides, a dataset of the newly released Landsat images was used as base-map for the interpretation of SDS source regions. As a result, six main clusters were recognized as dust source areas. Of which, 3 clusters situated in Tigris-Euphrates plain were identified as severe SDS sources (including 70% dust storms in this research). Another cluster in Sistan plain is also a potential source area. This approach also confirmed six main paths causing dust storms. These paths are driven by the climate system including Siberian and Polar anticyclones, monsoon from Indian Subcontinent and depression from north of Africa. The identification of SDS source areas and paths will improve our understandings on the mechanisms and impacts of dust storms on socio-economy and environment of the region. Copyright © 2014 Elsevier B.V. All rights reserved.

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.

White light Sagnac interferometer—a common (path) tale of light

International Nuclear Information System (INIS)

Schwartz, Eyal

2017-01-01

White or polychromatic light sources are vastly abundant in nature and lie in our most basic understanding of the theory of light, beginning from stars like our Sun and extending to every common household light bulb or street lamp. In this paper, I present concepts of white light interferometery using a common-path Sagnac interferometer, manifested in a straightforward laboratory experiment. I further show the use of this as a Fourier transform spectrometer while presenting a basic overview of the theoretical concepts and spectrum of different light sources obtained experimentally. This work, both experimentally and analytically, is suitable for upper-level undergraduate physics or engineering courses where electromagnetic theory and optics are discussed. The experiment and theory presents important deep concepts and aspects in modern optics and physics that every science student should acquire. (paper)

White light Sagnac interferometer—a common (path) tale of light

Science.gov (United States)

Schwartz, Eyal

2017-11-01

White or polychromatic light sources are vastly abundant in nature and lie in our most basic understanding of the theory of light, beginning from stars like our Sun and extending to every common household light bulb or street lamp. In this paper, I present concepts of white light interferometery using a common-path Sagnac interferometer, manifested in a straightforward laboratory experiment. I further show the use of this as a Fourier transform spectrometer while presenting a basic overview of the theoretical concepts and spectrum of different light sources obtained experimentally. This work, both experimentally and analytically, is suitable for upper-level undergraduate physics or engineering courses where electromagnetic theory and optics are discussed. The experiment and theory presents important deep concepts and aspects in modern optics and physics that every science student should acquire.

Triple-Pulse Integrated Path Differential Absorption Lidar for Carbon Dioxide Measurement - Novel Lidar Technologies and Techniques with Path to Space

Science.gov (United States)

Singh, Upendra N.; Refaat, Tamer F.; Petros, Mulugeta

2017-01-01

The societal benefits of understanding climate change through identification of global carbon dioxide sources and sinks led to the desired NASA's active sensing of carbon dioxide emissions over nights, days, and seasons (ASCENDS) space-based missions of global carbon dioxide measurements. For more than 15 years, NASA Langley Research Center (LaRC) have developed several carbon dioxide active remote sensors using the differential absorption lidar (DIAL) technique operating at the two-micron wavelength. Currently, an airborne two-micron triple-pulse integrated path differential absorption (IPDA) lidar is under development. This IPDA lidar measures carbon dioxide as well as water vapor, the dominant interfering molecule on carbon dioxide remote sensing. Advancement of this triple-pulse IPDA lidar development is presented.

UV laser long-path absorption spectroscopy

Science.gov (United States)

Dorn, Hans-Peter; Brauers, Theo; Neuroth, Rudolf

1994-01-01

Long path Differential Optical Absorption Spectroscopy (DOAS) using a picosecond UV laser as a light source was developed in our institute. Tropospheric OH radicals are measured by their rotational absorption lines around 308 nm. The spectra are obtained using a high resolution spectrograph. The detection system has been improved over the formerly used optomechanical scanning device by application of a photodiode array which increased the observed spectral range by a factor of 6 and which utilizes the light much more effectively leading to a considerable reduction of the measurement time. This technique provides direct measurements of OH because the signal is given by the product of the absorption coefficient and the OH concentration along the light path according to Lambert-Beers law. No calibration is needed. Since the integrated absorption coefficient is well known the accuracy of the measurement essentially depends on the extent to which the OH absorption pattern can be detected in the spectra. No interference by self generated OH radicals in the detection lightpath has been observed. The large bandwidth (greater than 0.15 nm) and the high spectral resolution (1.5 pm) allows absolute determination of interferences by other trace gas absorptions. The measurement error is directly accessible from the absorption-signal to baseline-noise ratio in the spectra. The applicability of the method strongly depends on visibility. Elevated concentrations of aerosols lead to considerable attenuation of the laser light which reduces the S/N-ratio. In the moderately polluted air of Julich, where we performed a number of OH measurement spectra. In addition absorption features of unidentified species were frequently detected. A quantitative deconvolution even of the known species is not easy to achieve and can leave residual structures in the spectra. Thus interferences usually increase the noise and deteriorate the OH detection sensitivity. Using diode arrays for sensitive

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.

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

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.

Unusual bond paths in organolithium compounds

International Nuclear Information System (INIS)

Bachrach, S.M.; Ritchie, J.P.

1986-01-01

We have applied the topological method to a number of organolithium compounds. The wavefunctions were determined with GAUSSIAN-82 using 3-21G basis set and fully optimized geometries. Gradient paths were obtained using the RHODER package and critical points were located using EXTREME. These results indicate the unusual nature of organolithium compounds. The strange bond paths arise mainly from the ionic nature of the C-Li interaction. We suggest that the term ''bond path'' may best be suited for covalent bonds. 4 figs., 1 tab

Effective regulatory control of radioactive sources

International Nuclear Information System (INIS)

Meserve, R.A.

2001-01-01

This paper provides an overview of the situation in the USA regarding government control over use of radiation sources, the challenges it faces and the potential paths to their resolution. In the light of the large number of radiation sources in use worldwide, the safety record on balance is remarkably good. But there is still considerable room for improvement. The IAEA has an important role to play, and it is playing it effectively

Two-path plasmonic interferometer with integrated detector

Science.gov (United States)

Dyer, Gregory Conrad; Shaner, Eric A.; Aizin, Gregory

2016-03-29

An electrically tunable terahertz two-path plasmonic interferometer with an integrated detection element can down convert a terahertz field to a rectified DC signal. The integrated detector utilizes a resonant plasmonic homodyne mixing mechanism that measures the component of the plasma waves in-phase with an excitation field that functions as the local oscillator in the mixer. The plasmonic interferometer comprises two independently tuned electrical paths. The plasmonic interferometer enables a spectrometer-on-a-chip where the tuning of electrical path length plays an analogous role to that of physical path length in macroscopic Fourier transform interferometers.

Using water chemistry, isotopes and microbiology to evaluate groundwater sources, flow paths and geochemical reactions in the Death Valley flow system, USA

Energy Technology Data Exchange (ETDEWEB)

Thomas, James M.; Hershey, Ronald L. [Desert Research Institute, 2215 Raggio Pwky, Reno, NV, USA 89512 (United States); Moser, Duane P.; Fisher, Jenny C.; Reihle, Jessica; Wheatley, Alexandra [Desert Research Institute, 755 E. Flamingo Rd, Las Vegas, NV, USA 89130 (United States); Baldino, Cristi; Weissenfluh, Darrick [US Fish and Wildlife Service, Ash Meadows NWR, Amargosa Valley, NV, USA 89020 (United States)

2013-07-01

Springs of Ash Meadows and Furnace Creek (near or in Death Valley, CA) have nearly constant flow, temperature, chemistry, and similar δ{sup 2}H and δ{sup 18}O signatures. These factors indicate shared water sources and/or analogous geochemical reactions along similar flow paths. DNA-based (16S rRNA gene) microbial diversity assessments further illuminate these relationships. Whereas, all Ash Meadows springs share related archaea populations, variations in carbon-14 (Crystal Spring) and strontium isotopes, Na{sup +}, SO{sub 4}{sup 2-}, and methane concentrations (Big Spring), correspond with microbial differences within and between the two discharge areas. Similar geochemical signatures linking Ash Meadows and Furnace Creek springs appear to support a distinct end member at Big Spring in Ash Meadows, which is also supported by coincident enrichment in microbial methanogens and methanotrophs. Conversely, DNA libraries from a deep carbonate well (878 m) located between Ash Meadows and Furnace Creek (BLM-1), indicate no shared microbial diversity between Ash Meadows or Furnace Creek springs. (authors)

Optimization of educational paths for higher education

Science.gov (United States)

Tarasyev, Alexandr A.; Agarkov, Gavriil; Medvedev, Aleksandr

2017-11-01

In our research, we combine the theory of economic behavior and the methodology of increasing efficiency of the human capital to estimate the optimal educational paths. We provide an optimization model for higher education process to analyze possible educational paths for each rational individual. The preferences of each rational individual are compared to the best economically possible educational path. The main factor of the individual choice, which is formed by the formation of optimal educational path, deals with higher salaries level in the chosen economic sector after graduation. Another factor that influences on the economic profit is the reduction of educational costs or the possibility of the budget support for the student. The main outcome of this research consists in correction of the governmental policy of investment in human capital based on the results of educational paths optimal control.

Path operator algebras in conformal quantum field theories

International Nuclear Information System (INIS)

Roesgen, M.

2000-10-01

Two different kinds of path algebras and methods from noncommutative geometry are applied to conformal field theory: Fusion rings and modular invariants of extended chiral algebras are analyzed in terms of essential paths which are a path description of intertwiners. As an example, the ADE classification of modular invariants for minimal models is reproduced. The analysis of two-step extensions is included. Path algebras based on a path space interpretation of character identities can be applied to the analysis of fusion rings as well. In particular, factorization properties of character identities and therefore of the corresponding path spaces are - by means of K-theory - related to the factorization of the fusion ring of Virasoro- and W-algebras. Examples from nonsupersymmetric as well as N=2 supersymmetric minimal models are discussed. (orig.)

Simple indicators for Lorentzian causets

Science.gov (United States)

Bolognesi, Tommaso; Lamb, Alexander

2016-09-01

Several classes of directed acyclic graphs have been investigated in the last two decades, in the context of the causal set program, in search for good discrete models of spacetime. We introduce some statistical indicators that can be used for comparing these graphs and for assessing their closeness to the ideal Lorentzian causal sets (‘causets’)—those obtained by sprinkling points in a Lorentzian manifold. In particular, with the reversed triangular inequality of Special Relativity in mind, we introduce ‘longest/shortest path plots’, an easily implemented tool to visually detect the extent to which a generic causet matches the wide range of path lengths between events of Lorentzian causets. This tool can attribute some degree of ‘Lorentzianity’—in particular ‘non-locality’—also to causets that are not (directly) embeddable and that, due to some regularity in their structure, would not pass the key test for Lorentz invariance: the absence of preferred reference frames. We compare the discussed indicators and use them for assessing causets both of stochastic and of deterministic, algorithmic origin, finding examples of the latter that behave optimally w.r.t. our longest/shortest path plots.

Empirical study of long-range connections in a road network offers new ingredient for navigation optimization models

Science.gov (United States)

Wang, Pu; Liu, Like; Li, Xiamiao; Li, Guanliang; González, Marta C.

2014-01-01

Navigation problem in lattices with long-range connections has been widely studied to understand the design principles for optimal transport networks; however, the travel cost of long-range connections was not considered in previous models. We define long-range connection in a road network as the shortest path between a pair of nodes through highways and empirically analyze the travel cost properties of long-range connections. Based on the maximum speed allowed in each road segment, we observe that the time needed to travel through a long-range connection has a characteristic time Th ˜ 29 min, while the time required when using the alternative arterial road path has two different characteristic times Ta ˜ 13 and 41 min and follows a power law for times larger than 50 min. Using daily commuting origin-destination matrix data, we additionally find that the use of long-range connections helps people to save about half of the travel time in their daily commute. Based on the empirical results, we assign a more realistic travel cost to long-range connections in two-dimensional square lattices, observing dramatically different minimum average shortest path but similar optimal navigation conditions.

Review of A* (A Star Navigation Mesh Pathfinding as the Alternative of Artificial Intelligent for Ghosts Agent on the Pacman Game

Directory of Open Access Journals (Sweden)

Moh. Zikky

2016-08-01

Full Text Available Shortest pathfinding problem has become a populer issue in Game’s Artificial Intelligent (AI. This paper discussed the effective way to optimize the shortest pathfinding problem, namely Navigation Mesh (NavMesh. This method is very interesting because it has a large area of implementation, especially in games world. In this paper, NavMesh was implemented by using A* (A star algorithm and examined in Unity 3D game engine. A* was an effective algorithm in shortest pathfinding problem because its optimization was made with effective tracing using segmentation line. Pac-Man game was chosen as the example of the shortest pathfinding by using NavMesh in Unity 3D. A* algorithm was implemented on the enemies of Pac-Man (three ghosts,  which path was designed by using NavMesh concept. Thus, the movement of ghosts in catching Pac-Man was the result of this review of the effectiveness of this concept. In further research, this method could be implemented on several optimization programmes, such as Geographic Information System (GIS, robotics, and statistics.

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

Science.gov (United States)

Łęgowski, Adrian; Niezabitowski, Michał

2016-06-01

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

An Approximation Approach for Solving the Subpath Planning Problem

OpenAIRE

Safilian, Masoud; Tashakkori, S. Mehdi; Eghbali, Sepehr; Safilian, Aliakbar

2016-01-01

The subpath planning problem is a branch of the path planning problem, which has widespread applications in automated manufacturing process as well as vehicle and robot navigation. This problem is to find the shortest path or tour subject for travelling a set of given subpaths. The current approaches for dealing with the subpath planning problem are all based on meta-heuristic approaches. It is well-known that meta-heuristic based approaches have several deficiencies. To address them, we prop...

Computing the optimal path in stochastic dynamical systems

International Nuclear Information System (INIS)

Bauver, Martha; Forgoston, Eric; Billings, Lora

2016-01-01

In stochastic systems, one is often interested in finding the optimal path that maximizes the probability of escape from a metastable state or of switching between metastable states. Even for simple systems, it may be impossible to find an analytic form of the optimal path, and in high-dimensional systems, this is almost always the case. In this article, we formulate a constructive methodology that is used to compute the optimal path numerically. The method utilizes finite-time Lyapunov exponents, statistical selection criteria, and a Newton-based iterative minimizing scheme. The method is applied to four examples. The first example is a two-dimensional system that describes a single population with internal noise. This model has an analytical solution for the optimal path. The numerical solution found using our computational method agrees well with the analytical result. The second example is a more complicated four-dimensional system where our numerical method must be used to find the optimal path. The third example, although a seemingly simple two-dimensional system, demonstrates the success of our method in finding the optimal path where other numerical methods are known to fail. In the fourth example, the optimal path lies in six-dimensional space and demonstrates the power of our method in computing paths in higher-dimensional spaces.

Path lumping: An efficient algorithm to identify metastable path channels for conformational dynamics of multi-body systems

Science.gov (United States)

Meng, Luming; Sheong, Fu Kit; Zeng, Xiangze; Zhu, Lizhe; Huang, Xuhui

2017-07-01

Constructing Markov state models from large-scale molecular dynamics simulation trajectories is a promising approach to dissect the kinetic mechanisms of complex chemical and biological processes. Combined with transition path theory, Markov state models can be applied to identify all pathways connecting any conformational states of interest. However, the identified pathways can be too complex to comprehend, especially for multi-body processes where numerous parallel pathways with comparable flux probability often coexist. Here, we have developed a path lumping method to group these parallel pathways into metastable path channels for analysis. We define the similarity between two pathways as the intercrossing flux between them and then apply the spectral clustering algorithm to lump these pathways into groups. We demonstrate the power of our method by applying it to two systems: a 2D-potential consisting of four metastable energy channels and the hydrophobic collapse process of two hydrophobic molecules. In both cases, our algorithm successfully reveals the metastable path channels. We expect this path lumping algorithm to be a promising tool for revealing unprecedented insights into the kinetic mechanisms of complex multi-body processes.

COMPARATIVE ANALYSIS AND IMPLEMENTATION OF ...

African Journals Online (AJOL)

TransRoute: a web-based vehicle route planning application is proposed in this paper. This application leverages existing input-output (I/O) efficient implementations of shortest path algorithms (SPAs) to implement the proposed system that will fundamentally address the problems experienced in moving people, goods and ...

A new technique for accelerating routing information process in ...

African Journals Online (AJOL)

Previous works on the shortest path are limited to sequential and parallel algorithms on general-purpose architectures. Researchers are increasingly interested in hardware's solutions. In this work , we propose an approach for implementing a routing algorithm which is effective than Dijkstra using a FPGA development ...

Efficient graph algorithms

Indian Academy of Sciences (India)

Shortest path problems. Road network on cities and we want to navigate between cities. . – p.8/30 ..... The rest of the talk... Computing connectivities between all pairs of vertices good algorithm wrt both space and time to compute the exact solution. . – p.15/30 ...

A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes

DEFF Research Database (Denmark)

Masson, Renaud; Røpke, Stefan; Lehuédé, Fabien

2014-01-01

for the PDPS and a branch-and-cut-and-price algorithm to solve it. The pricing sub-problem, an Elementary Shortest Path Problem with Resource Constraints (ESPPRC), is solved with a labeling algorithm enhanced with efficient dominance rules. Three families of valid inequalities are used to strengthen...

Evaluation of Network Reliability for Computer Networks with Multiple Sources

Directory of Open Access Journals (Sweden)

Yi-Kuei Lin

2012-01-01

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

Long open-path instrument for simultaneously monitoring of methane, CO2 and water vapor

Science.gov (United States)

Simeonov, Valentin; Parlange, Marc

2013-04-01

A new, long open-path instrument for monitoring of path-averaged methane, CO2 and water vapor concentrations will be presented. The instrument is built on the monostatic scheme (transceiver -distant retroreflector). A VCSEL with a central wavelength of 1654 nm is used as a light source. The receiver is built around a 20 cm Newtonian telescope. The design optical path length is 2000 m but can be further extended. To avoid distortions in the shape of the spectral lines caused by atmospheric turbulences they are scanned within 1 µs. The expected concentration resolution for the above mentioned path length is of the order of 2 ppb for methane, 100 ppb for CO2 and 100 ppm for water vapor. The instrument is developed at the Swiss Federal Institute of Technology - Lausanne (EPFL) Switzerland and will be used within the GAW+ CH program for long-term monitoring of background methane and CO2 concentrations in the Swiss Alps. The initial calibration validation tests at EPFL were completed in December 2012 and the instrument will be installed at the beginning of 2013 at the High Altitude Research Station Jungfraujoch (HARSJ). The HARSJ is located at 3580 m ASL and is one of the 24 global GAW stations. One of the goals of the project is to compare path-averaged to the ongoing point measurements of methane in order to identify possible influence of the station. Future deployments of a copy of the instrument include the Canadian arctic and Siberian wetlands. The instrument can be used for ground truthing of satellite observation as well.

Moments of inertia and the shapes of Brownian paths

International Nuclear Information System (INIS)

Fougere, F.; Desbois, J.

1993-01-01

The joint probability law of the principal moments of inertia of Brownian paths (open or closed) is computed, using constrained path integrals and Random Matrix Theory. The case of two-dimensional paths is discussed in detail. In particular, it is shown that the ratio of the average values of the largest and smallest moments is equal to 4.99 (open paths) and 3.07 (closed paths). Results of numerical simulations are also presented, which include investigation of the relationships between the moments of inertia and the arithmetic area enclosed by a path. (authors) 28 refs., 2 figs

Edge- and Node-Disjoint Paths in P Systems

Directory of Open Access Journals (Sweden)

Michael J. Dinneen

2010-10-01

Full Text Available In this paper, we continue our development of algorithms used for topological network discovery. We present native P system versions of two fundamental problems in graph theory: finding the maximum number of edge- and node-disjoint paths between a source node and target node. We start from the standard depth-first-search maximum flow algorithms, but our approach is totally distributed, when initially no structural information is available and each P system cell has to even learn its immediate neighbors. For the node-disjoint version, our P system rules are designed to enforce node weight capacities (of one, in addition to edge capacities (of one, which are not readily available in the standard network flow algorithms.

Blocked All-Pairs Shortest Paths Algorithm on Intel Xeon Phi KNL Processor: A Case Study

OpenAIRE

Rucci, Enzo; De Giusti, Armando Eduardo; Naiouf, Marcelo

2017-01-01

Manycores are consolidating in HPC community as a way of improving performance while keeping power efficiency. Knights Landing is the recently released second generation of Intel Xeon Phi architec- ture.While optimizing applications on CPUs, GPUs and first Xeon Phi’s has been largely studied in the last years, the new features in Knights Landing processors require the revision of programming and optimization techniques for these devices. In this work, we selected the Floyd-Warshall algorithm ...

INTERLINE, a railroad routing model: program description and user's manual

International Nuclear Information System (INIS)

Peterson, B.E.

1985-11-01

INTERLINE is an interactive computer program that finds likely routes for shipments over the US railroad system. It is based on a shortest path algorithm modified both to reflect the nature of railroad company operations and to accommodate computer resource limitations in dealing with a large transportation network. The first section of the report discusses the nature of railroad operations and routing practices in the United States, including the tendency to concentrate traffic on a limited number of mainlines, the competition for traffic by different companies operating in the same corridors, and the tendency of originating carriers to retain traffic on their systems before transferring it to terminating carriers. The theoretical foundation and operation of shortest path algorithms are described, as well as the techniques used to simulate actual operating practices within this framework. The second section is a user's guide that describes the program operation and data structures, program features, and user access. 11 refs., 11 figs

Closed-time-path functional formalism in curved spacetime: Application to cosmological back-reaction problems

International Nuclear Information System (INIS)

Calzetta, E.; Hu, B.L.

1987-01-01

We discuss the generalization to curved spacetime of a path-integral formalism of quantum field theory based on the sum over paths first going forward in time in the presence of one external source from an in vacuum to a state defined on a hypersurface of constant time in the future, and then backwards in time in the presence of a different source to the same in vacuum. This closed-time-path formalism which generalizes the conventional method based on in-out vacuum persistence amplitudes yields real and causal effective actions, field equations, and expectation values. We apply this method to two problems in semiclassical cosmology. First we study the back reaction of particle production in a radiation-filled Bianchi type-I universe with a conformal scalar field. Unlike the in-out formalism which yields complex geometries the real and causal effective action here yields equations for real effective geometries, with more readily interpretable results. It also provides a clear identification of particle production as a dissipative process in semiclassical theories. In the second problem we calculate the vacuum expectation value of the stress-energy tensor for a nonconformal massive λphi 4 theory in a Robertson-Walker universe. This study serves to illustrate the use of Feynman diagrams and higher-loop calculations in this formalism. It also demonstrates the economy of this method in the calculation of expectation values over the mode-sum Bogolubov transformation methods ordinarily applied to matrix elements calculated in the conventional in-out approach

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

76 FR 17064 - Shared Use Path Accessibility Guidelines

Science.gov (United States)

2011-03-28

...] RIN 3014-AA41 Shared Use Path Accessibility Guidelines AGENCY: Architectural and Transportation... (ANPRM) to develop accessibility guidelines for shared use paths. Shared use paths are designed for both... users. The guidelines will include technical provisions for making newly constructed and altered shared...

A focussed dynamic path finding algorithm with constraints

CSIR Research Space (South Africa)

Leenen, L

2013-11-01

Full Text Available heuristic to focus the search for an optimal path. Existing approaches to solving path planning problems tend to combine path costs with various other criteria such as obstacle avoidance in the objective function which is being optimised. The authors...

Path probability of stochastic motion: A functional approach

Science.gov (United States)

Hattori, Masayuki; Abe, Sumiyoshi

2016-06-01

The path probability of a particle undergoing stochastic motion is studied by the use of functional technique, and the general formula is derived for the path probability distribution functional. The probability of finding paths inside a tube/band, the center of which is stipulated by a given path, is analytically evaluated in a way analogous to continuous measurements in quantum mechanics. Then, the formalism developed here is applied to the stochastic dynamics of stock price in finance.

Land-mobile satellite excess path loss measurements

Science.gov (United States)

Hess, G. C.

1980-05-01

An experiment conducted with the ATS-6 satellite to determine the additional path loss over free-space loss experienced by land-mobile communication links is described. This excess path loss is measured as a function of 1) local environment, 2) vehicle heading, 3) link frequency, 4) satellite elevation angle, and 5) street side. A statistical description of excess loss developed from the data shows that the first two parameters dominate. Excess path loss on the order of 25 dB is typical in urban situations, but decreases to under 10 dB in suburban/rural areas. Spaced antenna selection diversity is found to provide only a slight decrease (4 dB, typically) in the urban excess path loss observed. Level crossing rates are depressed in satellite links relative to those of Rayleigh-faded terrestrial links, but increases in average fade durations tend to offset that advantage. The measurements show that the excess path loss difference between 860-MHz links and 1550-MHz links is generally negligible.

Perfect discretization of reparametrization invariant path integrals

International Nuclear Information System (INIS)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-01-01

To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

Perfect discretization of reparametrization invariant path integrals

Science.gov (United States)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-05-01

To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

Path integral for relativistic particle theory

International Nuclear Information System (INIS)

Fradkin, E.S.; Gitman, D.M.; Shvartsman, Sh.M.

1990-06-01

An action for a relativistic spinning particle interacting with external electromagnetic field is considered in reparametrization and local supergauge invariant form. It is shown that various path integral representations derived for the causal Green function correspond to the different forms of the relativistic particle action. The analogy of the path integral derived with the Lagrangian path integral of the field theory is discussed. It is shown that to obtain the causal propagator, the integration over the null mode of the Lagrangian multiplier corresponding to the reparametrization invariance, has to be performed in the (0,+infinity) limits. (author). 23 refs

Positroids Induced by Rational Dyck Paths

OpenAIRE

Gotti, Felix

2017-01-01

A rational Dyck path of type $(m,d)$ is an increasing unit-step lattice path from $(0,0)$ to $(m,d) \\in \\mathbb{Z}^2$ that never goes above the diagonal line $y = (d/m)x$. On the other hand, a positroid of rank $d$ on the ground set $[d+m]$ is a special type of matroid coming from the totally nonnegative Grassmannian. In this paper we describe how to naturally assign a rank $d$ positroid on the ground set $[d+m]$, which we name rational Dyck positroid, to each rational Dyck path of type $(m,d...

Realizing spaces as path-component spaces

OpenAIRE

Banakh, Taras; Brazas, Jeremy

2018-01-01

The path component space of a topological space $X$ is the quotient space $\\pi_0(X)$ whose points are the path components of $X$. We show that every Tychonoff space $X$ is the path-component space of a Tychonoff space $Y$ of weight $w(Y)=w(X)$ such that the natural quotient map $Y\\to \\pi_0(Y)=X$ is a perfect map. Hence, many topological properties of $X$ transfer to $Y$. We apply this result to construct a compact space $X\\subset \\mathbb{R}^3$ for which the fundamental group $\\pi_1(X,x_0)$ is...

Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?

Science.gov (United States)

Penney, Mark D.; Enshan Koh, Dax; Spekkens, Robert W.

2017-07-01

It is straightforward to compute the transition amplitudes of a quantum circuit using the sum-over-paths methodology when the gates in the circuit are balanced, where a balanced gate is one for which all non-zero transition amplitudes are of equal magnitude. Here we consider the question of whether, for such circuits, the relative phases of different discrete-time paths through the configuration space can be defined in terms of a classical action, as they are for continuous-time paths. We show how to do so for certain kinds of quantum circuits, namely, Clifford circuits where the elementary systems are continuous-variable systems or discrete systems of odd-prime dimension. These types of circuit are distinguished by having phase-space representations that serve to define their classical counterparts. For discrete systems, the phase-space coordinates are also discrete variables. We show that for each gate in the generating set, one can associate a symplectomorphism on the phase-space and to each of these one can associate a generating function, defined on two copies of the configuration space. For discrete systems, the latter association is achieved using tools from algebraic geometry. Finally, we show that if the action functional for a discrete-time path through a sequence of gates is defined using the sum of the corresponding generating functions, then it yields the correct relative phases for the path-sum expression. These results are likely to be relevant for quantizing physical theories where time is fundamentally discrete, characterizing the classical limit of discrete-time quantum dynamics, and proving complexity results for quantum circuits.

Purely geometric path integral for spin-foams

International Nuclear Information System (INIS)

Shirazi, Atousa Chaharsough; Engle, Jonathan

2014-01-01

Spin-foams are a proposal for defining the dynamics of loop quantum gravity via path integral. In order for a path integral to be at least formally equivalent to the corresponding canonical quantization, at each point in the space of histories it is important that the integrand have not only the correct phase—a topic of recent focus in spin-foams—but also the correct modulus, usually referred to as the measure factor. The correct measure factor descends from the Liouville measure on the reduced phase space, and its calculation is a task of canonical analysis. The covariant formulation of gravity from which spin-foams are derived is the Plebanski–Holst formulation, in which the basic variables are a Lorentz connection and a Lorentz-algebra valued 2-form, called the Plebanski 2-form. However, in the final spin-foam sum, one usually sums over only spins and intertwiners, which label eigenstates of the Plebanski 2-form alone. The spin-foam sum is therefore a discretized version of a Plebanski–Holst path integral in which only the Plebanski 2-form appears, and in which the connection degrees of freedom have been integrated out. We call this a purely geometric Plebanski–Holst path integral. In prior work in which one of the authors was involved, the measure factor for the Plebanski–Holst path integral with both connection and 2-form variables was calculated. Before one discretizes this measure and incorporates it into a spin-foam sum, however, one must integrate out the connection in order to obtain the purely geometric version of the path integral. To calculate this purely geometric path integral is the principal task of the present paper, and it is done in two independent ways. Background independence of the resulting path integral is discussed in the final section, and gauge-fixing is discussed in appendix B. (paper)

Acquisition Path Analysis as a Collaborative Activity

International Nuclear Information System (INIS)

Nakao, A.; Grundule, R.; Gushchyn, K.; El Gebaly, A.; Higgy, R.; Tsvetkov, I.; Mandl, W.

2015-01-01

In the International Atomic Energy Agency, acquisition path analysis (APA) is indispensable to safeguards implementation. It is an integral part of both State evaluation process and the development of State level safeguards approaches, all performed through ongoing collaborative analysis of all available safeguards relevant information by State evaluation groups (SEG) with participation of other contributors, as required. To perform comprehensive State evaluation, to develop and revise State-level safeguards approaches, and to prepare annual implementation plans, the SEG in its collaborative analysis follows accepted safeguards methodology and guidance. In particular, the guide ''Performing Acquisition Path Analysis for the Development of a State-level Safeguards Approach for a State with a CSA'' is used. This guide identifies four major steps of the APA process: 1. Consolidating information about the State's past, present and planned nuclear fuel cycle-related capabilities and infrastructure; 2. Identifying and visually presenting technically plausible acquisition paths for the State; 3. Assessing acquisition path steps (State's technical capabilities and possible actions) along the identified acquisition paths; and 4. Assessing the time needed to accomplish each identified technically plausible acquisition path for the State. The paper reports on SEG members' and other contributors' experience with APA when following the above steps, including the identification of plausible acquisition pathways, estimation of time frames for all identified steps and determination of the time needed to accomplish each acquisition path. The difficulties that the SEG encountered during the process of performing the APA are also addressed. Feedback in the form of practical suggestions for improving the clarity of the acquisition path step assessment forms and a proposal for software support are also included. (author)

Using the Curriculum Vita To Study the Career Paths of Scientists and Engineers: An Assessment.

Science.gov (United States)

Lane, Eliesh O'Neil; Dietz, James S.; Chompalov, Ivan; Bozeman, Barry; Park, Jongwon

The usefulness of the curriculum vita (CV) as a data source for examining the career paths of scientists and engineers was studied. CVs were obtained in response to an e-mail message sent to researchers working in the area of biotechnology who were funded by the National Science Foundation (55 responses) or listed as authors (industry only) in the…

Prediction of crack paths in WC-Co alloys

International Nuclear Information System (INIS)

Spiegler, R.; Fischmeister, H.F.

1992-01-01

This paper reports on a crack propagating through the WC-o microstructure which has to choose between paths along the binder/carbide interface and paths across binder regions. The latter paths are selected when the crack enters a binder region at a large angle from the nearest carbide interface, while the interface paths are preferred by cracks entering at a small angle. A critical angle can be defined for the switch from one type of crack path to the other. Empirical data for the area fractions of the two crack paths in widely different WC-Co alloys can be accounted for by a single critical angle, var-phi c = 25 degrees. Finite element analysis of the stress field in a region of binder enclosed between carbide grains shows that the preferred site for the growth of stress-induced microvoids will move from the carbide grain flanks to the interior of the binder region when the entry angle of the crack exceeds 24 degrees. Thus the observation of a critical angle deciding the crack path is verified by the stress field analysis and given a physical explanation in terms of the most likely site for microvoid formation

Quantum cosmology based on discrete Feynman paths

International Nuclear Information System (INIS)

Chew, Geoffrey F.

2002-01-01

Although the rules for interpreting local quantum theory imply discretization of process, Lorentz covariance is usually regarded as precluding time quantization. Nevertheless a time-discretized quantum representation of redshifting spatially-homogeneous universe may be based on discrete-step Feynman paths carrying causal Lorentz-invariant action--paths that not only propagate the wave function but provide a phenomenologically-promising elementary-particle Hilbert-space basis. In a model under development, local path steps are at Planck scale while, at a much larger ''wave-function scale'', global steps separate successive wave-functions. Wave-function spacetime is but a tiny fraction of path spacetime. Electromagnetic and gravitational actions are ''at a distance'' in Wheeler-Feynman sense while strong (color) and weak (isospin) actions, as well as action of particle motion, are ''local'' in a sense paralleling the action of local field theory. ''Nonmaterial'' path segments and ''trivial events'' collaborate to define energy and gravity. Photons coupled to conserved electric charge enjoy privileged model status among elementary fermions and vector bosons. Although real path parameters provide no immediate meaning for ''measurement'', the phase of the complex wave function allows significance for ''information'' accumulated through ''gentle'' electromagnetic events involving charged matter and ''soft'' photons. Through its soft-photon content the wave function is an ''information reservoir''

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

Strain path and work-hardening behavior of brass

International Nuclear Information System (INIS)

Sakharova, N.A.; Fernandes, J.V.; Vieira, M.F.

2009-01-01

Plastic straining in metal forming usually includes changes of strain path, which are frequently not taken into account in the analysis of forming processes. Moreover, strain path change can significantly affect the mechanical behavior and microstructural evolution of the material. For this reason, a combination of several simple loading test sequences is an effective way to investigate the dislocation microstructure of sheet metals under such forming conditions. Pure tension and rolling strain paths and rolling-tension strain path sequences were performed on brass sheets. A study of mechanical behavior and microstructural evolution during the simple and the complex strain paths was carried out, within a wide range of strain values. The appearance and development of deformation twinning was evident. It was shown that strain path change promotes the onset of premature twinning. The work-hardening behavior is discussed in terms of the twinning and dislocation microstructure evolution, as revealed by transmission electron microscopy

Capacitated Vehicle Routing with Nonuniform Speeds

DEFF Research Database (Denmark)

Gørtz, Inge Li; Molinaro, Marco; Nagarajan, Viswanath

2016-01-01

is the distance traveled divided by its speed.Our algorithm relies on a new approximate minimum spanning tree construction called Level-Prim, which is related to but different from Light Approximate Shortest-path Trees. We also extend the widely used tour-splitting technique to nonuniform speeds, using ideas from...

Efficient Guiding Towards Cost-Optimality in Uppaal

DEFF Research Database (Denmark)

Behrmann, Gerd; Fehnker, Ansgar; Hune, Thomas S.

2001-01-01

with prices on both locations and transitions. The presented algorithm is based on a symbolic semantics of UTPA, and an efficient representation and operations based on difference bound matrices. In analogy with Dijkstra’s shortest path algorithm, we show that the search order of the algorithm can be chosen...

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

A Graduated Cylinder Colorimeter: An Investigation of Path Length and the Beer-Lambert Law

Science.gov (United States)

Gordon, James; Harman, Stephanie

2002-05-01

A 10-mL graduated cylinder was used to construct a colorimeter to investigate the relationship between absorbance and path length found in the Beer-Lambert law. Light-emitting diodes (LEDs) were used as the light sources and filter monochromators. The experiments were conducted on intensely colored permanganate and tetraamminecopper(II) solutions. The device also was useful for demonstrating the relationship between absorbance and concentration.

28 CFR 36.403 - Alterations: Path of travel.

Science.gov (United States)

2010-07-01

... 28 Judicial Administration 1 2010-07-01 2010-07-01 false Alterations: Path of travel. 36.403... Alterations: Path of travel. (a) General. An alteration that affects or could affect the usability of or... the maximum extent feasible, the path of travel to the altered area and the restrooms, telephones, and...

Paths and cycles in colored graphs

NARCIS (Netherlands)

Li, Xueliang; Zhang, Shenggui; Hurink, Johann L.; Pickl, Stefan; Broersma, Haitze J.; Faigle, U.

2001-01-01

Let G be an (edge-)colored graph. A path (cycle) is called monochromatic if all the edges of it have the same color, and is called heterochromatic if all the edges of it have different colors. In this note, some sufficient conditions for the existence of monochromatic and heterochromatic paths and

Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?

International Nuclear Information System (INIS)

Penney, Mark D; Koh, Dax Enshan; Spekkens, Robert W

2017-01-01

It is straightforward to compute the transition amplitudes of a quantum circuit using the sum-over-paths methodology when the gates in the circuit are balanced, where a balanced gate is one for which all non-zero transition amplitudes are of equal magnitude. Here we consider the question of whether, for such circuits, the relative phases of different discrete-time paths through the configuration space can be defined in terms of a classical action, as they are for continuous-time paths. We show how to do so for certain kinds of quantum circuits, namely, Clifford circuits where the elementary systems are continuous-variable systems or discrete systems of odd-prime dimension. These types of circuit are distinguished by having phase-space representations that serve to define their classical counterparts. For discrete systems, the phase-space coordinates are also discrete variables. We show that for each gate in the generating set, one can associate a symplectomorphism on the phase-space and to each of these one can associate a generating function, defined on two copies of the configuration space. For discrete systems, the latter association is achieved using tools from algebraic geometry. Finally, we show that if the action functional for a discrete-time path through a sequence of gates is defined using the sum of the corresponding generating functions, then it yields the correct relative phases for the path-sum expression. These results are likely to be relevant for quantizing physical theories where time is fundamentally discrete, characterizing the classical limit of discrete-time quantum dynamics, and proving complexity results for quantum circuits. (paper)

Convolutive Blind Source Separation Methods

DEFF Research Database (Denmark)

Pedersen, Michael Syskind; Larsen, Jan; Kjems, Ulrik

2008-01-01

During the past decades, much attention has been given to the separation of mixed sources, in particular for the blind case where both the sources and the mixing process are unknown and only recordings of the mixtures are available. In several situations it is desirable to recover all sources from...... the recorded mixtures, or at least to segregate a particular source. Furthermore, it may be useful to identify the mixing process itself to reveal information about the physical mixing system. In some simple mixing models each recording consists of a sum of differently weighted source signals. However, in many...... real-world applications, such as in acoustics, the mixing process is more complex. In such systems, the mixtures are weighted and delayed, and each source contributes to the sum with multiple delays corresponding to the multiple paths by which an acoustic signal propagates to a microphone...

The formal path integral and quantum mechanics

International Nuclear Information System (INIS)

Johnson-Freyd, Theo

2010-01-01

Given an arbitrary Lagrangian function on R d and a choice of classical path, one can try to define Feynman's path integral supported near the classical path as a formal power series parameterized by 'Feynman diagrams', although these diagrams may diverge. We compute this expansion and show that it is (formally, if there are ultraviolet divergences) invariant under volume-preserving changes of coordinates. We prove that if the ultraviolet divergences cancel at each order, then our formal path integral satisfies a 'Fubini theorem' expressing the standard composition law for the time evolution operator in quantum mechanics. Moreover, we show that when the Lagrangian is inhomogeneous quadratic in velocity such that its homogeneous-quadratic part is given by a matrix with constant determinant, then the divergences cancel at each order. Thus, by 'cutting and pasting' and choosing volume-compatible local coordinates, our construction defines a Feynman-diagrammatic 'formal path integral' for the nonrelativistic quantum mechanics of a charged particle moving in a Riemannian manifold with an external electromagnetic field.

A New Method of Global Path Planning for AGV

Institute of Scientific and Technical Information of China (English)

SHI En-xiu; HUANG Yu-mei

2006-01-01

Path planning is important in the research of a mobile robot (MR). Methods for it have been used in different applications. An automated guided vehicle(AGV), which is a kind of MR, is used in a flexible manufacturing system(FMS). Path planning for it is essential to improve the efficiency of FMS. A new method was proposed with known obstacle space FMS in this paper. FMS is described by the Augmented Pos Matrix of a Machine (APMM) and Relative Pos Matrix of Machines (RPMM), which is smaller. The optimum path can be obtained according to the probability of the path and the maximal probability path. The suggested algorithm of path planning was good performance through simulation result: simplicity, saving time and reliability.

Phase-space path-integral calculation of the Wigner function

International Nuclear Information System (INIS)

Samson, J H

2003-01-01

The Wigner function W(q, p) is formulated as a phase-space path integral, whereby its sign oscillations can be seen to follow from interference between the geometrical phases of the paths. The approach has similarities to the path-centroid method in the configuration-space path integral. Paths can be classified by the midpoint of their ends; short paths where the midpoint is close to (q, p) and which lie in regions of low energy (low P function of the Hamiltonian) will dominate, and the enclosed area will determine the sign of the Wigner function. As a demonstration, the method is applied to a sequence of density matrices interpolating between a Poissonian number distribution and a number state, each member of which can be represented exactly by a discretized path integral with a finite number of vertices. Saddle-point evaluation of these integrals recovers (up to a constant factor) the WKB approximation to the Wigner function of a number state

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.

State interest as an explanatory factor in the failure of the soft-path energy vision

International Nuclear Information System (INIS)

Macdonald, Douglas

2012-01-01

Despite its prominence in the policy discourse, countries of the world have not adopted soft-path energy policy. Current explanations of this failure look to the nature of different fuels, various barriers in the market and political opposition by hard-path energy industries. Such factors provide only partial explanation. The explanation is incomplete because those factors cannot explain the larger subject of the evolution of fuel types during the past two hundred years. For that, we must add the role of the state, through ownership and regulation, in energy generation. That role has expanded regularly with the evolution of fuel types from coal to oil, electricity and nuclear power, but not with the introduction of new renewables in the 1970s. That pattern is explained by the inherent interest of the state in the use of energy for physical, military force and the fact that new renewables have not had immediate military applications. Although renewable energy is increasing, unless the state is motivated for military reasons to play a greater role, the soft-path vision will continue to languish. - Highlights: ► The subject is the historical interest of the state in energy as a means to enhance its military power. ► The state has played a key role in the emergence of hard-path energy sources, but not renewables. ► The paper argues this is because renewable energy does not have immediate military application. ► This factor of state interest helps explain the failure to date to fully adopt soft-path fuels.

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.

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

Creativity, Spirituality, and Transcendence: Paths to Integrity and Wisdom in the Mature Self. Publications in Creativity Research.

Science.gov (United States)

Miller, Melvin E., Ed.; Cook-Greuter, Susanne R., Ed.

This book contains 11 papers on creativity, spirituality, and transcendence as paths to integrity and wisdom in the mature self. The book begins with the paper "Introduction--Creativity in Adulthood: Personal Maturity and Openness to Extraordinary Sources of Inspiration" (Susanne R. Cook-Greuter, Melvin E. Miller). The next four papers,…

A method of signal transmission path analysis for multivariate random processes

International Nuclear Information System (INIS)

Oguma, Ritsuo

1984-04-01

A method for noise analysis called ''STP (signal transmission path) analysis'' is presentd as a tool to identify noise sources and their propagation paths in multivariate random proceses. Basic idea of the analysis is to identify, via time series analysis, effective network for the signal power transmission among variables in the system and to make use of its information to the noise analysis. In the present paper, we accomplish this through two steps of signal processings; first, we estimate, using noise power contribution analysis, variables which have large contribution to the power spectrum of interest, and then evaluate the STPs for each pair of variables to identify STPs which play significant role for the generated noise to transmit to the variable under evaluation. The latter part of the analysis is executed through comparison of partial coherence function and newly introduced partial noise power contribution function. This paper presents the procedure of the STP analysis and demonstrates, using simulation data as well as Borssele PWR noise data, its effectiveness for investigation of noise generation and propagation mechanisms. (author)

A Key Event Path Analysis Approach for Integrated Systems

Directory of Open Access Journals (Sweden)

Jingjing Liao

2012-01-01

Full Text Available By studying the key event paths of probabilistic event structure graphs (PESGs, a key event path analysis approach for integrated system models is proposed. According to translation rules concluded from integrated system architecture descriptions, the corresponding PESGs are constructed from the colored Petri Net (CPN models. Then the definitions of cycle event paths, sequence event paths, and key event paths are given. Whereafter based on the statistic results after the simulation of CPN models, key event paths are found out by the sensitive analysis approach. This approach focuses on the logic structures of CPN models, which is reliable and could be the basis of structured analysis for discrete event systems. An example of radar model is given to characterize the application of this approach, and the results are worthy of trust.

E-Learning Technologies: Employing Matlab Web Server to Facilitate the Education of Mathematical Programming

Science.gov (United States)

Karagiannis, P.; Markelis, I.; Paparrizos, K.; Samaras, N.; Sifaleras, A.

2006-01-01

This paper presents new web-based educational software (webNetPro) for "Linear Network Programming." It includes many algorithms for "Network Optimization" problems, such as shortest path problems, minimum spanning tree problems, maximum flow problems and other search algorithms. Therefore, webNetPro can assist the teaching process of courses such…

Comparison of neural networks for solving the travelling salesman problem

NARCIS (Netherlands)

Maire, La B.F.J.; Mladenov, V.M.

2012-01-01

The TSP deals with finding a shortest path through a number of cities. This seemingly simple problem is hard to solve because of the amount of possible solutions. Which is why methods that give a good suboptimal solution in a reasonable time are generally used. In this paper three methods were

Development of the PEBLebl Traveling Salesman Problem Computerized Testbed

Science.gov (United States)

Mueller, Shane T.; Perelman, Brandon S.; Tan, Yin Yin; Thanasuan, Kejkaew

2015-01-01

The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding the shortest path through a set of points ("cities") that returns to the starting point. Because humans provide heuristic near-optimal solutions to Euclidean versions of the problem, it has sometimes been used to investigate human visual…

Comparison of tool feed influence in CNC polishing between a novel circular-random path and other pseudo-random paths.

Science.gov (United States)

Takizawa, Ken; Beaucamp, Anthony

2017-09-18

A new category of circular pseudo-random paths is proposed in order to suppress repetitive patterns and improve surface waviness on ultra-precision polished surfaces. Random paths in prior research had many corners, therefore deceleration of the polishing tool affected the surface waviness. The new random path can suppress velocity changes of the polishing tool and thus restrict degradation of the surface waviness, making it suitable for applications with stringent mid-spatial-frequency requirements such as photomask blanks for EUV lithography.

Lateral, Vertical, and Longitudinal Source Area Connectivity Drive Runoff and Carbon Export Across Watershed Scales

Science.gov (United States)

Zimmer, Margaret A.; McGlynn, Brian L.

2018-03-01

Watersheds are three-dimensional hydrologic systems where the longitudinal expansion/contraction of stream networks, vertical connection/disconnection between shallow and deep groundwater systems, and lateral connectivity of these water sources to streams mediate runoff production and nutrient export. The connectivity of runoff source areas during both baseflow and stormflow conditions and their combined influence on biogeochemical fluxes remain poorly understood. Here we focused on a set of 3.3 and 48.4 ha nested watersheds (North Carolina, USA). These watersheds comprise ephemeral and intermittent runoff-producing headwaters and perennial runoff-producing lowlands. Within these landscape elements, we characterized the timing and magnitude of precipitation, runoff, and runoff-generating flow paths. The active surface drainage network (ASDN) reflected connectivity to, and contributions from, source areas that differed under baseflow and stormflow conditions. The baseflow-associated ASDN expanded and contracted seasonally, driven by the rise and fall of the seasonal water table. Superimposed on this were event-activated source area contributions driven by connectivity to surficial and shallow subsurface flow paths. Frequently activated shallow flow paths also caused increased in-stream dissolved organic carbon (DOC) concentrations with increases in runoff across both watershed scales. The spread and variability within this DOC-runoff relationship was driven by a seasonal depletion of DOC from continual shallow subsurface flow path activation and subsequent replenishment from autumn litterfall. Our findings suggest that hydrobiogeochemical signals at larger watershed outlets can be driven by the expansion, contraction, and connection of lateral, longitudinal, and vertical source areas with distinct runoff generation processes.

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

Path probabilities of continuous time random walks

International Nuclear Information System (INIS)

Eule, Stephan; Friedrich, Rudolf

2014-01-01

Employing the path integral formulation of a broad class of anomalous diffusion processes, we derive the exact relations for the path probability densities of these processes. In particular, we obtain a closed analytical solution for the path probability distribution of a Continuous Time Random Walk (CTRW) process. This solution is given in terms of its waiting time distribution and short time propagator of the corresponding random walk as a solution of a Dyson equation. Applying our analytical solution we derive generalized Feynman–Kac formulae. (paper)

Path-integral approach to resonant electron-molecule scattering

International Nuclear Information System (INIS)

Winterstetter, M.; Domcke, W.

1993-01-01

A path-integral formulation of resonant electron-molecule scattering is developed within the framework of the projection-operator formalism of scattering theory. The formation and decay of resonances is treated in real time as a quantum-mechanical electronic-tunneling process, modified by the coupling of the electronic motion with the nuclear degrees of freedom. It is shown that the electronic continuum can be summed over in the path-integral formulation, resulting formally in the path integral for an effective two-state system with coupling to vibrations. The harmonic-oscillator approximation is adopted for the vibrational motion in the present work. Approximation methods are introduced which render the numerical evaluation of the sum over paths feasible for up to ∼10 3 elementary time slices. The theory is numerically realized for simple but nontrivial models representing the 2 Π g d-wave shape resonance in e - +N 2 collisions and the 2 Σ u + p-wave shape resonance in e - +H 2 collisions, respectively. The accuracy of the path-integral results is assessed by comparison with exact numerical reference data for these models. The essential virtue of the path-integral approach is the fact that the computational effort scales at most linearly with the number of vibrational degrees of freedom. The path-integral method is thus well suited to treat electron collisions with polyatomic molecules and molecular aggregates

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

Quadcopter Path Following Control Design Using Output Feedback with Command Generator Tracker LOS Based At Square Path

Science.gov (United States)

Nugraha, A. T.; Agustinah, T.

2018-01-01

Quadcopter an unstable system, underactuated and nonlinear in quadcopter control research developments become an important focus of attention. In this study, following the path control method for position on the X and Y axis, used structure-Generator Tracker Command (CGT) is tested. Attitude control and position feedback quadcopter is compared using the optimal output. The addition of the H∞ performance optimal output feedback control is used to maintain the stability and robustness of quadcopter. Iterative numerical techniques Linear Matrix Inequality (LMI) is used to find the gain controller. The following path control problems is solved using the method of LQ regulators with output feedback. Simulations show that the control system can follow the paths that have been defined in the form of a reference signal square shape. The result of the simulation suggest that the method which used can bring the yaw angle at the expected value algorithm. Quadcopter can do automatically following path with cross track error mean X=0.5 m and Y=0.2 m.

Bosonic path integral for spin-1/2 particles

International Nuclear Information System (INIS)

Jacobson, T.

1989-01-01

The 3D Dirac propagator is expressed as a path integral over curves of commuting two-component spinors. This is related to the path integral recently employed by Polyakov to demonstrate Fermi-Bose transmutation for solitons in the gauged CP 1 model with Chern-Simons term. Several difficulties concerning the latter path integral are identified and corrected from our point of view. (orig.)

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

A middle path for electricity options and sustainable development

International Nuclear Information System (INIS)

Mills, J.I.; Herring, J.S.

1994-01-01

In a landmark article in Foreign Affairs in October 1976, Amory Lovins presented his vision of two vastly different and seemingly irreconcilable paths that energy provision might take into the future. One path was a ''hard'' path, characterized by extensive development of large, capital-intensive centralized electrical generating facilities and their peripherals, designed with little consideration given to the matching of these facilities to the requirements of the end-use needs. The second, ''soft'' path was characterized by energy technologies that are diverse, operate on renewable energy flows, are relatively simple, less capital-intensive, and matched in scale and energy quality to end-use needs. One of the most controversial arguments in the Lovins' paper was that the ''hard'' and ''soft'' paths are culturally and institutionally antagonistic. In retrospect, it seems this argument was self-fulfilling, for the history of the energy debate throughout the developed world since the appearance of the Lovins' article has been marked by an either-or antagonism that has left little room for serious discussion of a ''middle-path.'' In this paper, we argue that ''middle-path,'' paved with elements of both the soft and hard, is especially suited for developing countries, since they do not now carry the burden of an existing and extensive ''hard path'' energy infrastructure

Computing Diffeomorphic Paths for Large Motion Interpolation.

Science.gov (United States)

Seo, Dohyung; Jeffrey, Ho; Vemuri, Baba C

2013-06-01

In this paper, we introduce a novel framework for computing a path of diffeomorphisms between a pair of input diffeomorphisms. Direct computation of a geodesic path on the space of diffeomorphisms Diff (Ω) is difficult, and it can be attributed mainly to the infinite dimensionality of Diff (Ω). Our proposed framework, to some degree, bypasses this difficulty using the quotient map of Diff (Ω) to the quotient space Diff ( M )/ Diff ( M ) μ obtained by quotienting out the subgroup of volume-preserving diffeomorphisms Diff ( M ) μ . This quotient space was recently identified as the unit sphere in a Hilbert space in mathematics literature, a space with well-known geometric properties. Our framework leverages this recent result by computing the diffeomorphic path in two stages. First, we project the given diffeomorphism pair onto this sphere and then compute the geodesic path between these projected points. Second, we lift the geodesic on the sphere back to the space of diffeomerphisms, by solving a quadratic programming problem with bilinear constraints using the augmented Lagrangian technique with penalty terms. In this way, we can estimate the path of diffeomorphisms, first, staying in the space of diffeomorphisms, and second, preserving shapes/volumes in the deformed images along the path as much as possible. We have applied our framework to interpolate intermediate frames of frame-sub-sampled video sequences. In the reported experiments, our approach compares favorably with the popular Large Deformation Diffeomorphic Metric Mapping framework (LDDMM).

Source composition of cosmic rays at high energy

International Nuclear Information System (INIS)

Juliusson, E.; Cesarsky, C.J.; Meneguzzi, M.; Casse, M.

1975-01-01

The source composition of the cosmic ray is usually calculated at an energy of a few GeV per nucleon. Recent measurements have however indicated that the source composition may be energy dependent. In order to give a quantitative answer to this question the source composition at 50GeV/nucleon has been calculated using an exponential distribution of path lengths and in the slab approximation. The results obtained at high energy agree very well with the source composition obtained at lower energies, except the abundance of carbon which is significantly lower than the generally accepted value of low energies [fr

Path integral discussion for Smorodinsky-Winternitz potentials. Pt. 1

International Nuclear Information System (INIS)

Grosche, C.; Pogosyan, G.S.; Sissakian, A.N.