Prograph Based Analysis of Single Source Shortest Path Problem with Few Distinct Positive Lengths
Directory of Open Access Journals (Sweden)
B. Bhowmik
2011-08-01
Full Text Available In this paper we propose an experimental study model S3P2 of a fast fully dynamic programming algorithm design technique in finite directed graphs with few distinct nonnegative real edge weights. The Bellman-Ford’s approach for shortest path problems has come out in various implementations. In this paper the approach once again is re-investigated with adjacency matrix selection in associate least running time. The model tests proposed algorithm against arbitrarily but positive valued weighted digraphs introducing notion of Prograph that speeds up finding the shortest path over previous implementations. Our experiments have established abstract results with the intention that the proposed algorithm can consistently dominate other existing algorithms for Single Source Shortest Path Problems. A comparison study is also shown among Dijkstra’s algorithm, Bellman-Ford algorithm, and our algorithm.
Shortest Paths and Vehicle Routing
DEFF Research Database (Denmark)
Petersen, Bjørn
This thesis presents how to parallelize a shortest path labeling algorithm. It is shown how to handle Chvátal-Gomory rank-1 cuts in a column generation context. A Branch-and-Cut algorithm is given for the Elementary Shortest Paths Problem with Capacity Constraint. A reformulation of the Vehicle...... Routing Problem based on partial paths is presented. Finally, a practical application of finding shortest paths in the telecommunication industry is shown....
Evaluation of Shortest Paths in Road Network
Directory of Open Access Journals (Sweden)
Farrukh Shehzad
2009-06-01
Full Text Available Optimization is a key factor in almost all the topics of operations research / management science and economics.The road networks can be optimized within different constraints like time, distance, cost and traffic running onthe roads.This study is based on optimization of real road network by means of distances. Two main objectives arepursued in this research: 1 road distances among different routes are composed in detail; 2 two standardalgorithms (Dijkstra and Floyd-Warshall algoritms are applied to optimize/minimize these distances for bothsingle-source and all-pairs shortest path problems.
Euclidean shortest paths exact or approximate algorithms
Li, Fajie
2014-01-01
This book reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. The coverage includes mathematical proofs for many of the given statements.
Structural parcellation of the thalamus using shortest-path tractography
DEFF Research Database (Denmark)
Kasenburg, Niklas; Darkner, Sune; Hahn, Ute
2016-01-01
that parcellation of the thalamus results in p-value maps that are spatially coherent across subjects. Comparing to the state-of-the-art parcellation of Behrens et al. [1], we observe some agreement, but the soft segmentation exhibits better stability for voxels connected to multiple target regions.......We demonstrate how structural parcellation can be implemented using shortest-path tractography, thereby addressing some of the shortcomings of the conventional approaches. In particular, our algorithm quantifies, via p-values, the confidence that a voxel in the parcellated region is connected...... to each cortical target region. Calculation of these statistical measures is derived from a rank-based test on the histogram of tract-based scores from all the shortest paths found between the source voxel and each voxel within the target region. Using data from the Human Connectome Project, we show...
comparative analysis and implementation of dijkstra's shortest path
African Journals Online (AJOL)
user
path problem requires finding a single shortest-path between given vertices s and t; ... Bridge in 1735, [5 – 10]. This problem led to the .... their advancements from new design paradigms, data structures ..... .
Shortest Path Problems in a Stochastic and Dynamic Environment
National Research Council Canada - National Science Library
Cho, Jae
2003-01-01
.... Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network...
A NEW APPROACH ON SHORTEST PATH IN FUZZY ENVIRONMENT
A. Nagoorgani; A. Mumtaj Begam
2010-01-01
This paper introduces a new type of fuzzy shortest path network problem using triangular fuzzy number. To find the smallest edge by the fuzzy distance using graded mean integration representation of generalized fuzzy number for every node. Thus the optimum shortest path for the given problem is obtained.
DiversePathsJ: diverse shortest paths for bioimage analysis.
Uhlmann, Virginie; Haubold, Carsten; Hamprecht, Fred A; Unser, Michael
2018-02-01
We introduce a formulation for the general task of finding diverse shortest paths between two end-points. Our approach is not linked to a specific biological problem and can be applied to a large variety of images thanks to its generic implementation as a user-friendly ImageJ/Fiji plugin. It relies on the introduction of additional layers in a Viterbi path graph, which requires slight modifications to the standard Viterbi algorithm rules. This layered graph construction allows for the specification of various constraints imposing diversity between solutions. The software allows obtaining a collection of diverse shortest paths under some user-defined constraints through a convenient and user-friendly interface. It can be used alone or be integrated into larger image analysis pipelines. http://bigwww.epfl.ch/algorithms/diversepathsj. michael.unser@epfl.ch or fred.hamprecht@iwr.uni-heidelberg.de. Supplementary data are available at Bioinformatics online. © The Author(s) 2017. Published by Oxford University Press.
The time-varying shortest path problem with fuzzy transit costs and speedup
Directory of Open Access Journals (Sweden)
Rezapour Hassan
2016-08-01
Full Text Available In this paper, we focus on the time-varying shortest path problem, where the transit costs are fuzzy numbers. Moreover, we consider this problem in which the transit time can be shortened at a fuzzy speedup cost. Speedup may also be a better decision to find the shortest path from a source vertex to a specified vertex.
Calculating Graph Algorithms for Dominance and Shortest Path
DEFF Research Database (Denmark)
Sergey, Ilya; Midtgaard, Jan; Clarke, Dave
2012-01-01
We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algorithm and an algorithm for the single-source shortest path problem. Both algorithms are calculated directly from the definition of the properties by fixed-point fusion of (1) a least fixed point...... expressing all finite paths through a directed graph and (2) Galois connections that capture dominance and path length. The approach illustrates that reasoning in the style of fixed-point calculus extends gracefully to the domain of graph algorithms. We thereby bridge common practice from the school...... of program calculation with common practice from the school of static program analysis, and build a novel view on iterative graph algorithms as instances of abstract interpretation...
Special cases of the quadratic shortest path problem
Sotirov, Renata; Hu, Hao
2017-01-01
The quadratic shortest path problem (QSPP) is the problem of finding a path with prespecified start vertex s and end vertex t in a digraph such that the sum of weights of arcs and the sum of interaction costs over all pairs of arcs on the path is minimized. We first consider a variant of the QSPP
Approximate Shortest Homotopic Paths in Weighted Regions
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
Approximate shortest homotopic paths in weighted regions
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
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
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.
SPTH3: subroutine for finding shortest sabotage paths
International Nuclear Information System (INIS)
Hulme, B.L.; Holdridge, D.B.
1977-07-01
This document explains how to construct a sabotage graph which models any fixed-site facility and how to use the subroutine SPTH3 to find shortest paths in the graph. The shortest sabotage paths represent physical routes through the site which would allow an adversary to take advantage of the greatest weaknesses in the system of barriers and alarms. The subroutine SPTH3 is a tool with which safeguards designers and analysts can study the relative effects of design changes on the adversary routing problem. In addition to showing how to use SPTH3, this report discusses the methods used to find shortest paths and several implementation details which cause SPTH3 to be extremely efficient
The shortest-path problem analysis and comparison of methods
Ortega-Arranz, Hector; Gonzalez-Escribano, Arturo
2014-01-01
Many applications in different domains need to calculate the shortest-path between two points in a graph. In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques. Since several of these improvements involve subtle changes to the search space, it may be difficult to appreciate their benefits in terms of time or space requirements. To make methods more comprehensive and to facilitate their co
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....
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...
Ranking shortest paths in Stochastic time-denpendent networks
DEFF Research Database (Denmark)
Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the ...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective.......A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks...
K shortest paths in stochastic time-dependent networks
DEFF Research Database (Denmark)
Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim Allan
2004-01-01
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the ...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective.......A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks...
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.
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...
Degree distribution of shortest path trees and bias of network sampling algorithms
Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.
2013-01-01
In this article, we explicitly derive the limiting distribution of the degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the power-law exponent of the degree distribution of this tree and compare it to the degree
Degree distribution of shortest path trees and bias of network sampling algorithms
Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.
2015-01-01
In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the asymptotics of the degree distribution for large degrees of this tree and compare it to the degree distribution
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.
Extended shortest path selection for package routing of complex networks
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.
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....
Solving fuzzy shortest path problem by genetic algorithm
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.
An Application of Multi-Criteria Shortest Path to a Customizable Hex-Map Environment
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...
Directory of Open Access Journals (Sweden)
Jean Chamberlain Chedjou
2015-01-01
Full Text Available This paper develops a flexible analytical concept for robust shortest path detection in dynamically reconfigurable graphs. The concept is expressed by a mathematical model representing the shortest path problem solver. The proposed mathematical model is characterized by three fundamental parameters expressing (a the graph topology (through the “incidence matrix”, (b the edge weights (with dynamic external weights’ setting capability, and (c the dynamic reconfigurability through external input(s of the source-destination nodes pair. In order to demonstrate the universality of the developed concept, a general algorithm is proposed to determine the three fundamental parameters (of the mathematical model developed for all types of graphs regardless of their topology, magnitude, and size. It is demonstrated that the main advantage of the developed concept is that arc costs, the origin-destination pair setting, and the graph topology are dynamically provided by external commands, which are inputs of the shortest path solver model. This enables high flexibility and full reconfigurability of the developed concept, without any retraining need. To validate the concept developed, benchmarking is performed leading to a comparison of its performance with the performances of two well-known concepts based on neural networks.
Algorithm for shortest path search in Geographic Information Systems by using reduced graphs.
Rodríguez-Puente, Rafael; Lazo-Cortés, Manuel S
2013-01-01
The use of Geographic Information Systems has increased considerably since the eighties and nineties. As one of their most demanding applications we can mention shortest paths search. Several studies about shortest path search show the feasibility of using graphs for this purpose. Dijkstra's algorithm is one of the classic shortest path search algorithms. This algorithm is not well suited for shortest path search in large graphs. This is the reason why various modifications to Dijkstra's algorithm have been proposed by several authors using heuristics to reduce the run time of shortest path search. One of the most used heuristic algorithms is the A* algorithm, the main goal is to reduce the run time by reducing the search space. This article proposes a modification of Dijkstra's shortest path search algorithm in reduced graphs. It shows that the cost of the path found in this work, is equal to the cost of the path found using Dijkstra's algorithm in the original graph. The results of finding the shortest path, applying the proposed algorithm, Dijkstra's algorithm and A* algorithm, are compared. This comparison shows that, by applying the approach proposed, it is possible to obtain the optimal path in a similar or even in less time than when using heuristic algorithms.
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.
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.
A minimum resource neural network framework for solving multiconstraint shortest path problems.
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 Resource constrained shortest path problem implemented in a lazy functional language
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
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.
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 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.
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 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.
Shortest path problem on a grid network with unordered intermediate points
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.
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.
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...
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
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.
Efficient evaluation of shortest travel-time path queries through spatial mashups
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.
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.
Floyd-warshall algorithm to determine the shortest path based on android
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.
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.
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.
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.
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
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 .
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.
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
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...
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.
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.
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.
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.
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.
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.
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.
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.
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...
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...
Spreading paths in partially observed social networks
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.
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.
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
On Finding Shortest Paths on Convex Polyhedra.
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
Shortest-paths preserving metro maps
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
Light Source Estimation with Analytical Path-tracing
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...
An asymmetric shortest queue problem
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
Drosophila learn efficient paths to a food source.
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.
Dynamic shortest path problems : hybrid routing policies considering network disruptions
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
Minimizing Communication in All-Pairs Shortest Paths
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
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)
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.
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 ...
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.
Low sound level source path contribution on a HVAC
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
Path-integral method for the source apportionment of photochemical pollutants
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
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
Analysis of the asymmetric shortest queue problem
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
Analysis of the shortest queue problem
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
Analysis of the symmetric shortest queue problem
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
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
Analysis of the asymmetric shortest queue problem
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
Separation of zeros for source signature identification under reverberant path conditions.
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
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…
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.
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...
Kudi: A free open-source python library for the analysis of properties along reaction paths.
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.
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...
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.
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)
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...
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.
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.
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.
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
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
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.
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 path from the start to the destination position with minimum distance and time.
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.
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.
Zuffa, G.G.; De Rosa, R.; Normark, W.R.
1997-01-01
Escanaba Trough, which forms the southernmost part of the axial valley of the actively spreading Gorda Ridge, is filled with several hundred meters of sediment of presumed late Quaternary age. Surficial sediment samples from gravity cores, deeper samples (as much as 390 m) from Site 35 of the Deep Sea Drilling Program (Leg 5), and the acoustic character of the sediment fill observed on seismic-reflection profiles indicate that much of the sediment fill is of turbidite origin. Gross composition and heavy- mineral analyses of sand samples show that two distinct petrofacies comprise the sediment fill. The lower part of the fill was derived primarily from the Klamath River source of northern California while the younger fill, including the surficial sand beds, are from the Columbia River drainage much farther north. The Escanaba Trough sediment provides an opportunity to evaluate concepts for paleogeographic and paleotectonic reconstructions that are based on facies analysis and compositional and textural data for the volcanic components because both intrabasinal and extrabasinal sources are present as well as coeval (neovolcanic) and non coeval (paleovolcanic) sourcre This study of a modern basin shows, that although the sediment sources could be identified, it was useful to have some knowledge of the sediment pathway(s), the effects of diagenesis, and the possible effects of sediment sorting as a result of long transport distances from the source area for some components. Application of these same techniques to ancient deposits without benefit of the additional parameters will face limitations.
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
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
Source and path effects in the wave fields of tremor and explosions at Stromboli Volcano, Italy
Chouet, B.; Saccorotti, G.; Martini, M.; Dawson, P.; De Luca, G.; Milana, G.; Scarpa, R.
1997-01-01
The wave fields generated by Strombolian activity are investigated using data from small-aperture seismic arrays deployed on the north flank of Stromboli and data from seismic and pressure transducers set up near the summit crater. Measurements of slowness and azimuth as a function of time clearly indicate that the sources of tremor and explosions are located beneath the summit crater at depths shallower than 200 m with occasional bursts of energy originating from sources extending to a depth of 3 km. Slowness, azimuth, and particle motion measurements reveal a complex composition of body and surface waves associated with topography, structure, and source properties. Body waves originating at depths shallower than 200 m dominate the wave field at frequencies of 0.5-2.5 Hz, and surface waves generated by the surficial part of the source and by scattering sources distributed around the island dominate at frequencies above 2.5 Hz. The records of tremor and explosions are both dominated by SH motion. Far-field records from explosions start with radial motion, and near-field records from those events show dominantly horizontal motion and often start with a low-frequency (1-2 Hz) precursor characterized by elliptical particle motion, followed within a few seconds by a high-frequency radial phase (1-10 Hz) accompanying the eruption of pyroclastics. The dominant component of the near- and far-field particle motions from explosions, and the timing of air and body wave phases observed in the near field, are consistent with a gaspiston mechanism operating on a shallow (<200 m deep), vertical crack-like conduit. Models of a degassing fluid column suggest that noise emissions originating in the collective oscillations of bubbles ascending in the magma conduit may provide an adequate self-excitation mechanism for sustained tremor generation at Stromboli. Copyright 1997 by the American Geophysical Union.
Blocked All-Pairs Shortest Paths Algorithm on Intel Xeon Phi KNL Processor: A Case Study
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 ...
The Threshold Shortest Path Interdiction Problem for Critical Infrastructure Resilience Analysis
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
2012-09-13
46, 1989. [75] S. Melkote and M.S. Daskin . An integrated model of facility location and transportation network design. Transportation Research Part A ... a work of the U.S. Government and is not subject to copyright protection in the United States. AFIT/DS/ENS/12-09 THE AVERAGE NETWORK FLOW PROBLEM...focused thinking (VFT) are used sparingly, as is the case across the entirety of the supply chain literature. We provide a VFT tutorial for supply chain
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.
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...
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.
Open-source LIMS in Vietnam: The path toward sustainability and host country ownership.
Landgraf, Kenneth M; Kakkar, Reshma; Meigs, Michelle; Jankauskas, Paul T; Phan, Thi Thu Huong; Nguyen, Viet Nga; Nguyen, Duy Thai; Duong, Thanh Tung; Nguyen, Thi Hoa; Bond, Kyle B
2016-09-01
The objectives of this case report are as follows: to describe the process of establishing a national laboratory information management system (LIMS) program for clinical and public health laboratories in Vietnam; to evaluate the outcomes and lessons learned; and to present a model for sustainability based on the program outcomes that could be applied to diverse laboratory programs. This case report comprises a review of program documentation and records, including planning and budgetary records of the donor, monthly reports from the implementer, direct observation, and ad-hoc field reports from technical advisors and governmental agencies. Additional data on program efficacy and user acceptance were collected from routine monitoring of laboratory policies and operational practices. LIMS software was implemented at 38 hospital, public health and HIV testing laboratories in Vietnam. This LIMS was accepted by users and program managers as a useful tool to support laboratory processes. Implementation cost per laboratory and average duration of deployment decreased over time, and project stakeholders initiated transition of financing (from the donor to local institutions) and of system maintenance functions (from the implementer to governmental and site-level staff). Collaboration between the implementer in Vietnam and the global LIMS user community was strongly established, and knowledge was successfully transferred to staff within Vietnam. Implementing open-sourced LIMS with local development and support was a feasible approach towards establishing a sustainable laboratory informatics program that met the needs of health laboratories in Vietnam. Further effort to institutionalize IT support capacity within key government agencies is ongoing. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.
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
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
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)
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 ﬂexible normalized on-line fuzzy controller to ﬁnd shortest paths. Our method, targeted to low altitude domains, is simple and efﬁcient. Our preliminary resu...
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
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.
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)
Matrix-geometric analysis of the shortest queue problem with threshold jockeying
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
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.
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.
Directory of Open Access Journals (Sweden)
Wagner Gerd
2016-01-01
Full Text Available Integrated path concentrations of ambient levels of carbon dioxide and methane have been measured during nighttime periods at NIST, Boulder (CO, USA, using a ground-based, eyesafe laser system. In this contribution, we describe the transmitter and receiver system, demonstrate measurements of CO2 and CH4 in comparison with an in situ point sensor measurement using a commercial cavity ring-down instrument, and demonstrate a speckle noise reduction method.
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.
Schmied, S.A.
2014-01-01
The aim of the research presented in this work was to investigate the novel idea to produce continuous breaking waves, whereby a pressure source was rotated within an annular wave pool. The concept was that the pressure source generates non-breaking waves that propagate inward to the inner ring of
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
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.
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.
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.
Weight of the Shortest Path to the First Encountered Peer in a Peer Group of Size m
Van Mieghem, P.; Tang, S.
We model the weight (e.g. delay, distance or cost) from an arbitrary node to the nearest (in weight) peer in a peer-to-peer (P2P) network. The exact probability generating function and an asymptotic analysis is presented for a random graph with i.i.d. exponential link weights. The asymptotic
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.
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
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
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
Analysis of the asymmetric shortest queue problem : part 2: numerical analysis
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
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
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
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...
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...
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)
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.
Path planning of decentralized multi-quadrotor based on fuzzy-cell decomposition algorithm
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.
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.
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.
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.
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.)
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.
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 Creation, Path Dependence and Breaking Away from the Path
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...
A 2D analytical cylindrical gate tunnel FET (CG-TFET) model: impact of shortest tunneling distance
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)
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.
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)
Constraint-Based Local Search for Constrained Optimum Paths Problems
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.
Path coupling and aggregate path coupling
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.
Directory of Open Access Journals (Sweden)
Ousmane Sy Savane
2015-03-01
Full Text Available Studies show a divergence in correlation between aerosol and cloud proxies, which has been thought of in the past as the results of varying physical mechanisms. Though modeling studies have supported this idea, from an observational standpoint it is difficult to attribute with confidence the correlations to specific physical mechanisms. We explore a methodology to assess the correlation between cloud water path and aerosol optical depth using Moderate-resolution Imaging Spectroradiometer (MODIS Aqua retrieved aerosol and cloud properties for absorbing and non-absorbing aerosol types over land and over the Atlantic Ocean for various meteorological conditions. The data covers a three-month period, June through August, during which different aerosol types are predominant in specific regions. Our approach eliminates outliers; sorts the data into aerosol bins; and the mean Aerosol Optical Depth (AOD value for each bin and the corresponding mean Cloud Water Path (CWP value are determined. The mean CWP is plotted against the mean AOD. The response curve for all aerosol types shows a peak CWP value corresponding to an aerosol loading value AODpeak. The peak is used to divide the total range of aerosol loading into two sub ranges. For AOD value below AODpeak, mean CWP and mean AOD are positively correlated. The correlation between mean CWP and mean AOD is negative for aerosol loading above AODpeak. Irrespective of aerosol type, atmospheric water vapor content and lower tropospheric static stability, the peak observed for each aerosol type seems to describe a universal feature that calls for further investigation. It has been observed for a variety of geographical locations and different seasons.
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.
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.
The highest velocity and the shortest duration permitting attainment of VO2max during running
Directory of Open Access Journals (Sweden)
Tiago Turnes
2015-02-01
Full Text Available DOI: http://dx.doi.org/10.5007/1980-0037.2015v17n2p226 The severe-intensity domain has important applications for the prescription of running training and the elaboration of experimental designs. The objectives of this study were: 1 to investigate the validity of a previously proposed model to estimate the shortest exercise duration (TLOW and the highest velocity (VHIGH at which VO2max is reached during running, and 2 to evaluate the effects of aerobic training status on these variables. Eight runners and eight physically active subjects performed several treadmill running exercise tests to fatigue in order to mathematically estimate and to experimentally determine TLOW and VHIGH. The relationship between the time to achieve VO2max and time to exhaustion (Tlim was used to estimate TLOW. VHIGH was estimated using the critical velocity model. VHIGH was assumed to be the highest velocity at which VO2 was equal to or higher than the average VO2max minus one standard deviation. TLOW was defined as Tlim associated with VHIGH. Runners presented better aerobic fitness and higher VHIGH (22.2 ± 1.9 km.h-1 than active subjects (20.0 ± 2.1 km.h-1. However, TLOW did not differ between groups (runners: 101 ± 39 s; active subjects: 100 ± 35 s. TLOW and VHIGH were not well estimated by the model proposed, with high coefficients of variation (> 6% and a low correlation coefficient (r<0.70, a fact reducing the validity of the model. It was concluded that aerobic training status positively affected only VHIGH. Furthermore, the model proposed presented low validity to estimate the upper boundary of the severe-intensity domain (i.e., VHIGH, irrespective of the subjects’ training status.
Kendler, Kenneth S; Ohlsson, Henrik; Sundquist, Kristina; Sundquist, Jan
2018-04-01
To clarify the origins of parent-child resemblance for drug abuse (DA), using national Swedish data, we fit path models to information on DA in parents and children from six informative family types: i) not-lived-with father, ii) not-lived-with mother, iii) stepfather, iv) stepmother, v) triparental, and vi) adoptive. From these families, we estimated parent-offspring resemblance reflecting the effects of genes + rearing, genes only, and rearing only. The estimates of parent-offspring correlations were statistically homogenous across family types. The weighted estimate of the father-offspring correlation for DA for genes + rearing, genes-only, and rearing-only relationships were, respectively, +0.26, +0.19, and +0.06. Parallel figures for mother-offspring relationships were +0.19, +0.13, and +0.09. In both genes + rearing and genes-only parent-offspring relationships, DA correlations were stronger for fathers than for mothers. Both genetic and environmental factors contribute substantially to parent-offspring resemblance for DA and seem to be additive.
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®.
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.
MultiPaths Revisited - A novel approach using OpenFlow-enabled devices
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...
International Nuclear Information System (INIS)
Duffy, L.P.
1991-01-01
This paper discusses the sources of radiation in the narrow perspective of radioactivity and the even narrow perspective of those sources that concern environmental management and restoration activities at DOE facilities, as well as a few related sources. Sources of irritation, Sources of inflammatory jingoism, and Sources of information. First, the sources of irritation fall into three categories: No reliable scientific ombudsman to speak without bias and prejudice for the public good, Technical jargon with unclear definitions exists within the radioactive nomenclature, and Scientific community keeps a low-profile with regard to public information. The next area of personal concern are the sources of inflammation. This include such things as: Plutonium being described as the most dangerous substance known to man, The amount of plutonium required to make a bomb, Talk of transuranic waste containing plutonium and its health affects, TMI-2 and Chernobyl being described as Siamese twins, Inadequate information on low-level disposal sites and current regulatory requirements under 10 CFR 61, Enhanced engineered waste disposal not being presented to the public accurately. Numerous sources of disinformation regarding low level radiation high-level radiation, Elusive nature of the scientific community, The Federal and State Health Agencies resources to address comparative risk, and Regulatory agencies speaking out without the support of the scientific community
International Nuclear Information System (INIS)
Tirumalesh, K.; Shivanna, K.; Noble, J.
2007-01-01
Hydrochemical, environmental isotope and injected radiotracer investigations were carried out in order to investigate the possible source of contaminants and their movement in groundwater at Indian Rare Earths (IRE) site. Water samples were collected from piezometers, dug wells and river in and around IRE site for measurement of physical parameters, chemistry and isotopes. Chemical results show high fluoride, nitrate, sulphate and phosphate concentrations in piezometers whereas dug wells and river samples are free from contamination. Isotope data indicate that the contaminated groundwaters are enriched in δ 2 H and δ 18 O compared to dug well and river samples. Radiotracer experiments were carried out using single-well and multi-well techniques (radiotracers: 82 Br and 3 H) for determining groundwater filtration velocity and flow direction, respectively. Groundwater filtration velocity was found to be about 1.3 cm/day and flow direction is from south to north. Based on the investigations it can be concluded that groundwater is getting contamination from southern part of IRE campus and the possible source for these contaminants could be the Fertilizer and Chemical of Travancore (FACT) industry. (author)
Information spread of emergency events: path searching on social networks.
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.
Vervet monkeys use paths consistent with context-specific spatial movement heuristics.
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.
Directory of Open Access Journals (Sweden)
Shu-Yin Chiang
2002-01-01
Full Text Available In this paper, we study the simplified models of the ATM (Asynchronous Transfer Mode multiplexer network with Bernoulli random traffic sources. Based on the model, the performance measures are analyzed by the different output service schemes.
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
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)
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.
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.
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.
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...
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....
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
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
VLBI observations of the shortest orbital period black hole binary, MAXI J1659-152
Paragi, Z.; van der Horst, A.J.; Belloni, T.; Miller-Jones, J.C.A.; Linford, J.; Taylor, G.; Yang, J.; Garrett, M.A.; Granot, J.; Kouveliotou, C.; Kuulkers, E.; Wijers, R.A.M.J.
2013-01-01
The X-ray transient MAXI J1659−152 was discovered by Swift/Burst Alert Telescope and it was initially identified as a gamma-ray burst. Soon its Galactic origin and binary nature were established. There exists a wealth of multiwavelength monitoring data for this source, providing a great coverage of
MAXI J1659-152: the shortest orbital period black-hole binary
DEFF Research Database (Denmark)
Kuulkers, E.; Kouveliotou, C.; van der Horst, A. J.
Following the detection of a bright new X-ray source, MAXI J1659-152, a series of observations was triggered with almost all currently flying high-energy missions. We report here on XMM-Newton, INTEGRAL and RXTE observations during the early phase of the X-ray outburst of this transient black-hol...
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.
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.
Feasible Path Generation Using Bezier Curves for Car-Like Vehicle
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.
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.)
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
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…
Leamer, Micah J.
2004-01-01
Let K be a field and Q a finite directed multi-graph. In this paper I classify all path algebras KQ and admissible orders with the property that all of their finitely generated ideals have finite Groebner bases. MS
Path planning in changeable environments
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
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
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.
Directory of Open Access Journals (Sweden)
Michele Angelo Di Bari
2013-03-01
Full Text Available In order to assess the susceptibility of bank voles to chronic wasting disease (CWD, we inoculated voles carrying isoleucine or methionine at codon 109 (Bv109I and Bv109M, respectively with CWD isolates from elk, mule deer and white-tailed deer. Efficient transmission rate (100% was observed with mean survival times ranging from 156 to 281 days post inoculation. Subsequent passages in Bv109I allowed us to isolate from all CWD sources the same vole-adapted CWD strain (Bv(109ICWD, typified by unprecedented short incubation times of 25-28 days and survival times of ∼35 days. Neuropathological and molecular characterisation of Bv(109ICWD showed that the classical features of mammalian prion diseases were all recapitulated in less than one month after intracerebral inoculation. Bv(109ICWD was characterised by a mild and discrete distribution of spongiosis and relatively low levels of protease-resistant PrP(Sc (PrP(res in the same brain regions. Despite the low PrP(res levels and the short time lapse available for its accumulation, end-point titration revealed that brains from terminally-ill voles contained up to 10(8,4 i.c. ID50 infectious units per gram. Bv(109ICWD was efficiently replicated by protein misfolding cyclic amplification (PMCA and the infectivity faithfully generated in vitro, as demonstrated by the preservation of the peculiar Bv(109ICWD strain features on re-isolation in Bv109I. Overall, we provide evidence that the same CWD strain was isolated in Bv109I from the three-cervid species. Bv(109ICWD showed unique characteristics of "virulence", low PrP(res accumulation and high infectivity, thus providing exceptional opportunities to improve basic knowledge of the relationship between PrP(Sc, neurodegeneration and infectivity.
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.
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...
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
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...
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
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
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.
Depolarization on Earth-space paths
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.
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.
Nonadiabatic transition path sampling
International Nuclear Information System (INIS)
Sherman, M. C.; Corcelli, S. A.
2016-01-01
Fewest-switches surface hopping (FSSH) is combined with transition path sampling (TPS) to produce a new method called nonadiabatic path sampling (NAPS). The NAPS method is validated on a model electron transfer system coupled to a Langevin bath. Numerically exact rate constants are computed using the reactive flux (RF) method over a broad range of solvent frictions that span from the energy diffusion (low friction) regime to the spatial diffusion (high friction) regime. The NAPS method is shown to quantitatively reproduce the RF benchmark rate constants over the full range of solvent friction. Integrating FSSH within the TPS framework expands the applicability of both approaches and creates a new method that will be helpful in determining detailed mechanisms for nonadiabatic reactions in the condensed-phase.
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.
Directory of Open Access Journals (Sweden)
Jamie Waters
2014-09-01
Full Text Available This project uses Newton’s Second Law of Motion, Euler’s method, basic physics, and basic calculus to model the flight path of a rocket. From this, one can find the height and velocity at any point from launch to the maximum altitude, or apogee. This can then be compared to the actual values to see if the method of estimation is a plausible. The rocket used for this project is modeled after Bullistic-1 which was launched by the Society of Aeronautics and Rocketry at the University of South Florida.
Mehhtz, Peter
2005-01-01
JPF is an explicit state software model checker for Java bytecode. Today, JPF is a swiss army knife for all sort of runtime based verification purposes. This basically means JPF is a Java virtual machine that executes your program not just once (like a normal VM), but theoretically in all possible ways, checking for property violations like deadlocks or unhandled exceptions along all potential execution paths. If it finds an error, JPF reports the whole execution that leads to it. Unlike a normal debugger, JPF keeps track of every step how it got to the defect.
International Nuclear Information System (INIS)
Prokhorov, L.V.
1982-01-01
Problems related to consideration of operator nonpermutability in Hamiltonian path integral (HPI) are considered in the review. Integrals are investigated using trajectories in configuration space (nonrelativistic quantum mechanics). Problems related to trajectory integrals in HPI phase space are discussed: the problem of operator nonpermutability consideration (extra terms problem) and corresponding equivalence rules; ambiguity of HPI usual recording; transition to curvilinear coordinates. Problem of quantization of dynamical systems with couplings has been studied. As in the case of canonical transformations, quantization of the systems with couplings of the first kind requires the consideration of extra terms
Wolfowitz,Paul
2006-01-01
Paul Wolfowitz, President of the World Bank, discussed Singapore's remarkable progress along the road from poverty to prosperity which has also been discovered by many other countries in East Asia and around the world. He spoke of how each country must find its own path for people to pursue the same dreams of the chance to go to school, the security of a good job, and the ability to provide a better future for their children. Throughout the world, and importantly in the developing world, ther...
International Nuclear Information System (INIS)
Connolly, T.J.; Hansen, U.; Jaek, W.; Beckurts, K.H.
1979-01-01
In examing the world nuclear energy paths, the following assumptions were adopted: the world economy will grow somewhat more slowly than in the past, leading to reductions in electricity demand growth rates; national and international political impediments to the deployment of nuclear power will gradually disappear over the next few years; further development of nuclear power will proceed steadily, without serious interruption but with realistic lead times for the introduction of advanced technologies. Given these assumptions, this paper attempts a study of possible world nuclear energy developments, disaggregated on a regional and national basis. The scenario technique was used and a few alternative fuel-cycle scenarios were developed. Each is an internally consistent model of technically and economically feasible paths to the further development of nuclear power in an aggregate of individual countries and regions of the world. The main purpose of this modeling exercise was to gain some insight into the probable international locations of reactors and other nuclear facilities, the future requirements for uranium and for fuel-cycle services, and the problems of spent-fuel storage and waste management. The study also presents an assessment of the role that nuclear power might actually play in meeting future world energy demand
Optimal path planning for a mobile robot using cuckoo search algorithm
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.
Benefit of adaptive FEC in shared backup path protected elastic optical network.
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.
Directory of Open Access Journals (Sweden)
Paul Ballonoff
2017-12-01
Full Text Available A theory of cultural structures predicts the objects observed by anthropologists. We here define those which use kinship relationships to define systems. A finite structure we call a partially defined quasigroup (or pdq, as stated by Definition 1 below on a dictionary (called a natural language allows prediction of certain anthropological descriptions, using homomorphisms of pdqs onto finite groups. A viable history (defined using pdqs states how an individual in a population following such history may perform culturally allowed associations, which allows a viable history to continue to survive. The vector states on sets of viable histories identify demographic observables on descent sequences. Paths of vector states on sets of viable histories may determine which histories can exist empirically.
Propagators and path integrals
Energy Technology Data Exchange (ETDEWEB)
Holten, J.W. van
1995-08-22
Path-integral expressions for one-particle propagators in scalar and fermionic field theories are derived, for arbitrary mass. This establishes a direct connection between field theory and specific classical point-particle models. The role of world-line reparametrization invariance of the classical action and the implementation of the corresponding BRST-symmetry in the quantum theory are discussed. The presence of classical world-line supersymmetry is shown to lead to an unwanted doubling of states for massive spin-1/2 particles. The origin of this phenomenon is traced to a `hidden` topological fermionic excitation. A different formulation of the pseudo-classical mechanics using a bosonic representation of {gamma}{sub 5} is shown to remove these extra states at the expense of losing manifest supersymmetry. (orig.).
Directory of Open Access Journals (Sweden)
Li Jian
2016-01-01
Full Text Available The world has entered the information age, all kinds of information technologies such as cloud technology, big data technology are in rapid development, and the “Internet plus” appeared. The main purpose of “Internet plus” is to provide an opportunity for the further development of the enterprise, the enterprise technology, business and other aspects of factors combine. For enterprises, grasp the “Internet plus” the impact of the market economy will undoubtedly pave the way for the future development of enterprises. This paper will be on the innovation path of the enterprise management “Internet plus” era tied you study, hope to be able to put forward some opinions and suggestions.
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.
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.
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.
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.
Time optimized path-choice in the termite hunting ant Megaponera analis.
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.
Gibbon travel paths are goal oriented.
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.
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...
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...
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
International Nuclear Information System (INIS)
Webb, T.
1979-01-01
Energy policy is discussed, with particular reference to Scotland. The plans for nuclear power are analyzed in comparison with developments in coal mining, use of oil and gas and other possible energy sources such as wind and wave power. Arguments against the development of nuclear power are raised on grounds of economics, employment potential, and problems of waste disposal. (U.K.)
Hard paths, soft paths or no paths? Cross-cultural perceptions of water solutions
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.
Optimal Paths in Gliding Flight
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.
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
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.
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.
Integrated flight path planning system and flight control system for unmanned helicopters.
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).
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.
Integrated Flight Path Planning System and Flight Control System for Unmanned Helicopters
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
An Introduction to Path Analysis
Wolfe, Lee M.
1977-01-01
The analytical procedure of path analysis is described in terms of its use in nonexperimental settings in the social sciences. The description assumes a moderate statistical background on the part of the reader. (JKS)
Probabilistic simulation of fermion paths
International Nuclear Information System (INIS)
Zhirov, O.V.
1989-01-01
Permutation symmetry of fermion path integral allows (while spin degrees of freedom are ignored) to use in its simulation any probabilistic algorithm, like Metropolis one, heat bath, etc. 6 refs., 2 tabs
All new custom path photo book creation
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.
Perfect discretization of path integrals
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...
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.
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.)
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.
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...
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
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.
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.)
International Nuclear Information System (INIS)
Liu Yingling
2008-01-01
The recent policy tools have also consolidated and advanced traditional renewable energy industries, including hydropower and solar thermal panels, where China has already been a world leader. The technologies are comparatively simple and low-cost, and the country has developed fairly strong construction, manufacturing and installation industries for both sources. They are still dominant in China's renewable energy use, and are expected to see continuous strong growth. Hydropower accounts for about two-thirds of China's current renewable energy use. It has grown by over 8 per cent annually from 2002 to 2006, and installed capacity will reach 190 GW by 2010 and 300 GW by 2020. China also has nearly two-thirds of the world's solar hot water capacity: more than one in every ten households bathe in water heated by the sun. Such solar thermal has witnessed 20-25 per cent annual growth in recent years, with installed capacity rising from 35 million square metres in 2000 to 100 million square metres by the end of 2006. The government aims for 150 million square metres by 2010 and double that figure by 2020. A more optimistic prediction envisages 800 million square metres installed capacity by 2030, which would mean that more than half of all Chinese households would be using solar energy for water heating. Renewable energy has become a strategic industry in China. The country has more than 50 domestic wind turbine manufacturers, over 15 major solar cell manufacturers and roughly 50 companies constructing, expanding or planning for polysilicon production lines, the key components for solar PV systems. Those two industries together employ some 80,000 people. The country also has thousands of hydropower manufacturers and engineering and design firms. More than a thousand solar water heater manufacturers throughout the country - and associated design, installation and service providers - provide some 600,000 jobs. As renewable industries are scaled up, costs will come down
Flexible integration of path-planning capabilities
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.
Integrated path towards geological storage
International Nuclear Information System (INIS)
Bouchard, R.; Delaytermoz, A.
2004-01-01
Among solutions to contribute to CO 2 emissions mitigation, sequestration is a promising path that presents the main advantage of being able to cope with the large volume at stake when considering the growing energy demand. Of particular importance, geological storage has widely been seen as an effective solution for large CO 2 sources like power plants or refineries. Many R and D projects have been initiated, whereby research institutes, government agencies and end-users achieve an effective collaboration. So far, progress has been made towards reinjection of CO 2 , in understanding and then predicting the phenomenon and fluid dynamics inside the geological target, while monitoring the expansion of the CO 2 bubble in the case of demonstration projects. A question arises however when talking about sequestration, namely the time scale to be taken into account. Time is indeed of the essence, and points out the need to understand leakage as well as trapping mechanisms. It is therefore of prime importance to be able to predict the fate of the injected fluids, in an accurate manner and over a relevant period of time. On the grounds of geology, four items are involved in geological storage reliability: the matrix itself, which is the recipient of the injected fluids; the seal, that is the mechanistic trap preventing the injected fluids to flow upward and escape; the lower part of the concerned structure, usually an aquifer, that can be a migration way for dissolved fluids; and the man- made injecting hole, the well, whose characteristics should be as good as the geological formation itself. These issues call for specific competencies such as reservoir engineering, geology and hydrodynamics, mineral chemistry, geomechanics, and well engineering. These competencies, even if put to use to a large extent in the oil industry, have never been connected with the reliability of geological storage as ultimate goal. This paper aims at providing an introduction to these
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
International Nuclear Information System (INIS)
Canright, G.S.
1992-01-01
I offer a pedagogical review of the homotopy arguments for fractional statistics in two dimensions. These arguments arise naturally in path-integral language since they necessarily consider the properties of paths rather than simply permutations. The braid group replaces the permutation group as the basic structure for quantum statistics; hence properties of the braid group on several surfaces are briefly discussed. Finally, the question of multiple (real-space) occupancy is addressed; I suggest that the ''traditional'' treatment of this question (ie, an assumption that many-anyon wavefunctions necessarily vanish for multiple occupancy) needs reexamination
Isomorphisms and traversability of directed path graphs
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$
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.
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.
Reviewing career paths of the OpenStack developers
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
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)
Astronomers Trace Microquasar's Path Back in Time
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
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.
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.
Path Searching Based Fault Automated Recovery Scheme for Distribution Grid with DG
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.
UV laser long-path absorption spectroscopy
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
Path to Market for Compact Modular Fusion Power Cores
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.
Stochastic control with rough paths
International Nuclear Information System (INIS)
Diehl, Joscha; Friz, Peter K.; Gassiat, Paul
2017-01-01
We study a class of controlled differential equations driven by rough paths (or rough path realizations of Brownian motion) in the sense of Lyons. It is shown that the value function satisfies a HJB type equation; we also establish a form of the Pontryagin maximum principle. Deterministic problems of this type arise in the duality theory for controlled diffusion processes and typically involve anticipating stochastic analysis. We make the link to old work of Davis and Burstein (Stoch Stoch Rep 40:203–256, 1992) and then prove a continuous-time generalization of Roger’s duality formula [SIAM J Control Optim 46:1116–1132, 2007]. The generic case of controlled volatility is seen to give trivial duality bounds, and explains the focus in Burstein–Davis’ (and this) work on controlled drift. Our study of controlled rough differential equations also relates to work of Mazliak and Nourdin (Stoch Dyn 08:23, 2008).
Stochastic control with rough paths
Energy Technology Data Exchange (ETDEWEB)
Diehl, Joscha [University of California San Diego (United States); Friz, Peter K., E-mail: friz@math.tu-berlin.de [TU & WIAS Berlin (Germany); Gassiat, Paul [CEREMADE, Université Paris-Dauphine, PSL Research University (France)
2017-04-15
We study a class of controlled differential equations driven by rough paths (or rough path realizations of Brownian motion) in the sense of Lyons. It is shown that the value function satisfies a HJB type equation; we also establish a form of the Pontryagin maximum principle. Deterministic problems of this type arise in the duality theory for controlled diffusion processes and typically involve anticipating stochastic analysis. We make the link to old work of Davis and Burstein (Stoch Stoch Rep 40:203–256, 1992) and then prove a continuous-time generalization of Roger’s duality formula [SIAM J Control Optim 46:1116–1132, 2007]. The generic case of controlled volatility is seen to give trivial duality bounds, and explains the focus in Burstein–Davis’ (and this) work on controlled drift. Our study of controlled rough differential equations also relates to work of Mazliak and Nourdin (Stoch Dyn 08:23, 2008).
Path modeling and process control
DEFF Research Database (Denmark)
Høskuldsson, Agnar; Rodionova, O.; Pomerantsev, A.
2007-01-01
and having three or more stages. The methods are applied to a process control of a multi-stage production process having 25 variables and one output variable. When moving along the process, variables change their roles. It is shown how the methods of path modeling can be applied to estimate variables...... be performed regarding the foreseeable output property y, and with respect to an admissible range of correcting actions for the parameters of the next stage. In this paper the basic principles of path modeling is presented. The mathematics is presented for processes having only one stage, having two stages...... of the next stage with the purpose of obtaining optimal or almost optimal quality of the output variable. An important aspect of the methods presented is the possibility of extensive graphic analysis of data that can provide the engineer with a detailed view of the multi-variate variation in data....
Factorization-algebraization-path integration
International Nuclear Information System (INIS)
Inomata, A.; Wilson, R.
1986-01-01
The authors review the method of factorization proposed by Schroedinger of a quantum mechanical second-order linear differential equation into a product of two first-order differential operators, often referred to as ladder operators, as well as the modifications made to Schroedinger's method by Infeld and Hull. They then review the group theoretical treatments proposed by Miller of the Schroedinger-Infeld-Hull factorizations and go on to demonstrate the application of dynamical symmetry to path integral calculations. 30 references
CERN. Geneva
2017-01-01
Join the path of code linting and discover how it can help you reach higher levels of programming enlightenment. Today we will cover how to embrace code linters to offload cognitive strain on preserving style standards in your code base as well as avoiding error-prone constructs. Additionally, I will show you the journey ahead for integrating several code linters in the programming tools your already use with very little effort.
Career path for operations personnel
International Nuclear Information System (INIS)
Asher, J.A.
1985-01-01
This paper explains how selected personnel can now obtain a Bachelor of Science degree in Physics with a Nuclear Power Operations option. The program went into effect the Fall of 1984. Another program was worked out in 1982 whereby students attending the Nuclear Operators Training Program could obtain an Associates of Science degree in Mechanical Engineering Technology at the end of two years of study. This paper presents tables and charts which describe these programs and outline the career path for operators
Conditionally solvable path integral problems
International Nuclear Information System (INIS)
Grosche, C.
1995-05-01
Some specific conditionally exactly solvable potentials are discussed within the path integral formalism. They generalize the usually known potentials by the incorporation of a fractional power behaviour and strongly anharmonic terms. We find four different kinds of such potentials, the first is related to the Coulomb potential, the second is an anharmonic confinement potential, and the third and the fourth are related to the Manning-Rosen potential. (orig.)
Path integrals in curvilinear coordinates
International Nuclear Information System (INIS)
Prokhorov, L.V.
1984-01-01
Integration limits are studied for presenting the path integral curvilinear coordinates. For spherical (and topoloqically equivalent) coordinates it is shown that in formulas involving classical action in the exponent integration over all variables should be carried out within infinite limits. Another peculiarity is associated with appearance of the operator q which provides a complete definition of the wave functions out of the physical region. arguments are given upporting the validity of the cited statament in the general case
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
Path Integrals in Quantum Mechanics
International Nuclear Information System (INIS)
Chetouani, L
2005-01-01
By treating path integrals the author, in this book, places at the disposal of the reader a modern tool for the comprehension of standard quantum mechanics. Thus the most important applications, such as the tunnel effect, the diffusion matrix, etc, are presented from an original point of view on the action S of classical mechanics while having it play a central role in quantum mechanics. What also emerges is that the path integral describes these applications more richly than are described traditionally by differential equations, and consequently explains them more fully. The book is certainly of high quality in all aspects: original in presentation, rigorous in the demonstrations, judicious in the choice of exercises and, finally, modern, for example in the treatment of the tunnel effect by the method of instantons. Moreover, the correspondence that exists between classical and quantum mechanics is well underlined. I thus highly recommend this book (the French version being already available) to those who wish to familiarize themselves with formulation by path integrals. They will find, in addition, interesting topics suitable for exploring further. (book review)
Nonperturbative path integral expansion II
International Nuclear Information System (INIS)
Kaiser, H.J.
1976-05-01
The Feynman path integral representation of the 2-point function for a self-interacting Bose field is investigated using an expansion ('Path Integral Expansion', PIE) of the exponential of the kinetic term of the Lagrangian. This leads to a series - illustrated by a graph scheme - involving successively a coupling of more and more points of the lattice space commonly employed in the evaluation of path integrals. The values of the individual PIE graphs depend of course on the lattice constant. Two methods - Pade approximation and Borel-type extrapolation - are proposed to extract information about the continuum limit from a finite-order PIE. A more flexible PIE is possible by expanding besides the kinetic term a suitably chosen part of the interaction term too. In particular, if the co-expanded part is a mass term the calculation becomes only slightly more complicated than in the original formulation and the appearance of the graph scheme is unchanged. A significant reduction of the number of graphs and an improvement of the convergence of the PIE can be achieved by performing certain sums over an infinity of graph elements. (author)
Distribution definition of path integrals
International Nuclear Information System (INIS)
Kerler, W.
1979-01-01
By starting from quantum mechanics it turns out that a rather general definition of quantum functional integrals can be given which is based on distribution theory. It applies also to curved space and provides clear rules for non-linear transformations. The refinements necessary in usual definitions of path integrals are pointed out. Since the quantum nature requires special care with time sequences, it is not the classical phase space which occurs in the phase-space form of the path integral. Feynman's configuration-space form only applies to a highly specialized situation, and therefore is not a very advantageous starting point for general investigations. It is shown that the commonly used substitutions of variables do not properly account for quantum effects. The relation to the traditional ordering problem is clarified. The distribution formulation has allowed to treat constrained systems directly at the quantum level, to complete the path integral formulation of the equivalence theorem, and to define functional integrals also for space translation after the transition to fields. (orig.)
Cooperative path planning of unmanned aerial vehicles
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...
Electron Inelastic-Mean-Free-Path Database
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.
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.
Classical and quantum dynamics from classical paths to path integrals
Dittrich, Walter
2016-01-01
Graduate students who want to become familiar with advanced computational strategies in classical and quantum dynamics will find here both the fundamentals of a standard course and a detailed treatment of the time-dependent oscillator, Chern-Simons mechanics, the Maslov anomaly and the Berry phase, to name a few. Well-chosen and detailed examples illustrate the perturbation theory, canonical transformations, the action principle and demonstrate the usage of path integrals. This new edition has been revised and enlarged with chapters on quantum electrodynamics, high energy physics, Green’s functions and strong interaction.
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.
Path Integral Formulation of Anomalous Diffusion Processes
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 ...
Cooperative path planning for multi-USV based on improved artificial bee colony algorithm
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.
Strain path dependency in metal plasticity
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
Drosophila learn efficient paths to a food source
Stewart, James; Lim, Terrence; Claridge-Chang, Adam; Wang, Zhiping; Toh, Alicia; Rahman, Mashiur; Navawongse, Rapeechai; Raczkowska, Marlena; Choudhury, Deepak
2016-01-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 ...
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.
International Nuclear Information System (INIS)
Wald, H.B.
1990-01-01
The 'PATH' codes are used to design magnetic optics subsystems for neutral particle beam systems. They include a 2-1/2D and three 3-D space charge models, two of which have recently been added. This paper describes the 3-D models and reports on preliminary benchmark studies in which these models are checked for stability as the cloud size is varied and for consistency with each other. Differences between the models are investigated and the computer time requirements for running these models are established
Innovation paths in wind power
DEFF Research Database (Denmark)
Lema, Rasmus; Nordensvärd, Johan; Urban, Frauke
Denmark and Germany both make substantial investments in low carbon innovation, not least in the wind power sector. These investments in wind energy are driven by the twin objectives of reducing carbon emissions and building up international competitive advantage. Support for wind power dates back....... The ‘Danish Design’ remains the global standard. The direct drive design, while uncommon in Denmark, dominates the German installation base. Direct drive technology has thus emerged as a distinctly German design and sub-trajectory within the overall technological innovation path. When it comes to organising...... global interconnectedness of wind technology markets and the role of emerging new players, such as China and India....
Uncommon paths in quantum physics
Kazakov, Konstantin V
2014-01-01
Quantum mechanics is one of the most fascinating, and at the same time most controversial, branches of contemporary science. Disputes have accompanied this science since its birth and have not ceased to this day. Uncommon Paths in Quantum Physics allows the reader to contemplate deeply some ideas and methods that are seldom met in the contemporary literature. Instead of widespread recipes of mathematical physics, based on the solutions of integro-differential equations, the book follows logical and partly intuitional derivations of non-commutative algebra. Readers can directly penetrate the
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.
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.
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
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
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).
Classical and quantum dynamics from classical paths to path integrals
Dittrich, Walter
2017-01-01
Graduate students who wish to become familiar with advanced computational strategies in classical and quantum dynamics will find in this book both the fundamentals of a standard course and a detailed treatment of the time-dependent oscillator, Chern-Simons mechanics, the Maslov anomaly and the Berry phase, to name just a few topics. Well-chosen and detailed examples illustrate perturbation theory, canonical transformations and the action principle, and demonstrate the usage of path integrals. The fifth edition has been revised and enlarged to include chapters on quantum electrodynamics, in particular, Schwinger’s proper time method and the treatment of classical and quantum mechanics with Lie brackets and pseudocanonical transformations. It is shown that operator quantum electrodynamics can be equivalently described with c-numbers, as demonstrated by calculating the propagation function for an electron in a prescribed classical electromagnetic field.
Integrated assignment and path planning
Murphey, Robert A.
2005-11-01
A surge of interest in unmanned systems has exposed many new and challenging research problems across many fields of engineering and mathematics. These systems have the potential of transforming our society by replacing dangerous and dirty jobs with networks of moving machines. This vision is fundamentally separate from the modern view of robotics in that sophisticated behavior is realizable not by increasing individual vehicle complexity, but instead through collaborative teaming that relies on collective perception, abstraction, decision making, and manipulation. Obvious examples where collective robotics will make an impact include planetary exploration, space structure assembly, remote and undersea mining, hazardous material handling and clean-up, and search and rescue. Nonetheless, the phenomenon driving this technology trend is the increasing reliance of the US military on unmanned vehicles, specifically, aircraft. Only a few years ago, following years of resistance to the use of unmanned systems, the military and civilian leadership in the United States reversed itself and have recently demonstrated surprisingly broad acceptance of increasingly pervasive use of unmanned platforms in defense surveillance, and even attack. However, as rapidly as unmanned systems have gained acceptance, the defense research community has discovered the technical pitfalls that lie ahead, especially for operating collective groups of unmanned platforms. A great deal of talent and energy has been devoted to solving these technical problems, which tend to fall into two categories: resource allocation of vehicles to objectives, and path planning of vehicle trajectories. An extensive amount of research has been conducted in each direction, yet, surprisingly, very little work has considered the integrated problem of assignment and path planning. This dissertation presents a framework for studying integrated assignment and path planning and then moves on to suggest an exact
Path Creation, Path Dependence and Breaking Away from the Path: Re-Examining the Case of Nokia
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...
Rainbow paths with prescribed ends
DEFF Research Database (Denmark)
Alishahi, Meysam; Taherkhani, Ali; Thomassen, Carsten
2011-01-01
vertices. We also prove that every connected graph with atleast one edge has a proper k-coloring (for some k) such that every vertex of color i has a neighbor of color i + 1 (mod k). C-5 shows that k may have to be greater than the chromatic number. However, if the graph is connected, infinite and locally...... finite, and has finite chromatic number, then the k-coloring exists for every k >= chi(G). In fact, the k-coloring can be chosen such that every vertex is a starting vertex of an infinite path such that the color increases by 1 (mod k) along each edge. The method is based on the circular chromatic number...... chi(c)(G). In particular, we verify the above conjecture for all connected graphs whose circular chromatic number equals the chromatic number....
Counting paths with Schur transitions
Energy Technology Data Exchange (ETDEWEB)
Díaz, Pablo [Department of Physics and Astronomy, University of Lethbridge, Lethbridge, Alberta, T1K 3M4 (Canada); Kemp, Garreth [Department of Physics, University of Johannesburg, P.O. Box 524, Auckland Park 2006 (South Africa); Véliz-Osorio, Alvaro, E-mail: aveliz@gmail.com [Mandelstam Institute for Theoretical Physics, University of the Witwatersrand, WITS 2050, Johannesburg (South Africa); School of Physics and Astronomy, Queen Mary, University of London, Mile End Road, London E1 4NS (United Kingdom)
2016-10-15
In this work we explore the structure of the branching graph of the unitary group using Schur transitions. We find that these transitions suggest a new combinatorial expression for counting paths in the branching graph. This formula, which is valid for any rank of the unitary group, reproduces known asymptotic results. We proceed to establish the general validity of this expression by a formal proof. The form of this equation strongly hints towards a quantum generalization. Thus, we introduce a notion of quantum relative dimension and subject it to the appropriate consistency tests. This new quantity finds its natural environment in the context of RCFTs and fractional statistics; where the already established notion of quantum dimension has proven to be of great physical importance.
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.
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.
Potential paths for male-mediated gene flow to and from an isolated grizzly bear population
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
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.
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.
Design of Active N-path Filters
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
On the optical path length in refracting media
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.
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.)
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
Techniques and applications of path integration
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
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...
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.
Is a wind turbine a point source? (L).
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.
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...
Decision paths in complex tasks
Galanter, Eugene
1991-01-01
Complex real world action and its prediction and control has escaped analysis by the classical methods of psychological research. The reason is that psychologists have no procedures to parse complex tasks into their constituents. Where such a division can be made, based say on expert judgment, there is no natural scale to measure the positive or negative values of the components. Even if we could assign numbers to task parts, we lack rules i.e., a theory, to combine them into a total task representation. We compare here two plausible theories for the amalgamation of the value of task components. Both of these theories require a numerical representation of motivation, for motivation is the primary variable that guides choice and action in well-learned tasks. We address this problem of motivational quantification and performance prediction by developing psychophysical scales of the desireability or aversiveness of task components based on utility scaling methods (Galanter 1990). We modify methods used originally to scale sensory magnitudes (Stevens and Galanter 1957), and that have been applied recently to the measure of task 'workload' by Gopher and Braune (1984). Our modification uses utility comparison scaling techniques which avoid the unnecessary assumptions made by Gopher and Braune. Formula for the utility of complex tasks based on the theoretical models are used to predict decision and choice of alternate paths to the same goal.
Practicality of diversion path analysis
International Nuclear Information System (INIS)
Murphey, W.M.; Schleter, J.C.
1974-07-01
One can define the safeguards system for nuclear material as the set of all protective actions taken to prevent or to deter attempts to divert nuclear material to unauthorized use. Maintenance of effective safeguards requires a program for routine assessment of plant safeguards systems in terms of their capabilities to satisfy safeguards aims. Plant internal control systems provide capabilities for detection of unprevented diversion and can provide assurance that diversion has not occurred. A procedure called Diversion Path Analysis (DPA) enables routine assessment of the capabilities of internal control systems in this regard and identification of safeguards problem areas in a plant. A framework for safeguards system design is also provided which will allow flexibility to accommodate individual plant circumstances while maintaining acceptable diversion detection capability. The steps of the procedure are described and the practicality of the analytical method is shown by referring to a demonstration test for a high throughput process where plant personnel were major participants. The boundary conditions for the demonstration case are given, along with some conclusions about the general procedure. (U.S.)
Inked Careers: Tattooing Professional Paths
Directory of Open Access Journals (Sweden)
Gabriela DeLuca
2016-12-01
Full Text Available The concept of career has an interdisciplinary and historical constitution, which includes persons, groups, organizations and society. Given that, we aim to deepen the interactionist notion of career from the understanding of a deviant path, supported by a theory and a method appropriated to the cited call for interdisciplinary approaches. Dilemmas (Hughes, 1958 and conflicts (Hughes, 1937 emerged as important analytical categories. Although necessary, these two concepts were not sufficient to contemplate analyses in their entirety. For this reason we conceptualized a third possibility of controversy during a career: the inquiries. The study followed the Narrative method to analyze objective and subjective changes during a tattoo artist’s career through interviews and informal conversations carried out over 22 months. The discussion presents three main contributions. Theoretically, a new understanding of the concept of careers, linking past, present and future and the idea of non-linearity of experienced and envisioned careers. Methodologically, suggesting orientations for future career studies such as the use of turning points as a methodological tool and the investigation of deviant fields. Finally, our defense of the interactionist perspective as suitable for career studies, since it allows the investigation of deviant elements.
Rotational error in path integration: encoding and execution errors in angle reproduction.
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.
Two Generations of Path Dependence in Economics?
DEFF Research Database (Denmark)
Madsen, Mogens Ove
2010-01-01
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...
Cooperative organic mine avoidance path planning
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.
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
Generalized measures and the Feynman path integral
International Nuclear Information System (INIS)
Maslov, V.P.; Chebotarev, A.M.
1976-01-01
Generalizations are obtained for the earlier results by the authors concerning the inclusion of the Feynmann path integral in the momentum representation into the general integration theory. Feynmann path integrals are considered which do not represent T-products. Generalized Feynmann measure in the configuration representation is introduced
Paths and cycles in colored graphs
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
Path Minima Queries in Dynamic Weighted Trees
DEFF Research Database (Denmark)
Davoodi, Pooya; Brodal, Gerth Stølting; Satti, Srinivasa Rao
2011-01-01
In the path minima problem on a tree, each edge is assigned a weight and a query asks for the edge with minimum weight on a path between two nodes. For the dynamic version of the problem, where the edge weights can be updated, we give data structures that achieve optimal query time\\todo{what about...
from synchronic variation to a grammaticalization path
African Journals Online (AJOL)
Kate H
Abstract. The authors argue that the synchronic variation of cognate objects of weather verbs exhibited in six African languages of South Africa (Sepedi, Sesotho, Tshivenda, isiXhosa, Xitsonga, and. isiZulu) has a diachronic explanation, and may be represented as a grammaticalization path. This path gradually leads from ...
Optimization of educational paths for higher education
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.
Investigating scintillometer source areas
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
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.
OPEN PATH TUNABLE DIODE LASER ABSORPTION SPECTROSCOPY FOR ACQUISITION OF FUGITIVE EMISSION FLUX DATA
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...
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
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...
Learning Paths to Offshore Outsourcing
DEFF Research Database (Denmark)
Maskell, Peter; Pedersen, Torben; Petersen, Bent
A corporation’s offshore outsourcing may be seen as the result of a discrete, strategic decision taken in response to an increasing pressure from worldwide competition. However, empirical evidence of a representative cross-sector sample of international Danish firms indicates that offshore sourcing...... in low-cost countries is best described as a learning-by-doing process in which the offshore outsourcing of a corporation goes through a sequence of stages towards sourcing for innovation. Initially, a corporation’s outsourcing is driven by a desire for cost minimization. Over a period of time...... the outsourcing experience lessens the cognitive limitations of decision-makers as to the advantages that can be achieved through outsourcing in low-cost countries: the insourcer/vendor may not only offer cost advantages, but also quality improvement and innovation. The quality improvements that offshore...
Integrated robust controller for vehicle path following
Energy Technology Data Exchange (ETDEWEB)
Mashadi, Behrooz; Ahmadizadeh, Pouyan, E-mail: p-ahmadizadeh@iust.ac.ir; Majidi, Majid, E-mail: m-majidi@iust.ac.ir [Iran University of Science and Technology, School of Automotive Engineering (Iran, Islamic Republic of); Mahmoodi-Kaleybar, Mehdi, E-mail: m-mahmoodi-k@iust.ac.ir [Iran University of Science and Technology, School of Mechanical Engineering (Iran, Islamic Republic of)
2015-02-15
The design of an integrated 4WS+DYC control system to guide a vehicle on a desired path is presented. The lateral dynamics of the path follower vehicle is formulated by considering important parameters. To reduce the effect of uncertainties in vehicle parameters, a robust controller is designed based on a μ-synthesis approach. Numerical simulations are performed using a nonlinear vehicle model in MATLAB environment in order to investigate the effectiveness of the designed controller. Results of simulations show that the controller has a profound ability to making the vehicle track the desired path in the presence of uncertainties.
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
Integrated robust controller for vehicle path following
International Nuclear Information System (INIS)
Mashadi, Behrooz; Ahmadizadeh, Pouyan; Majidi, Majid; Mahmoodi-Kaleybar, Mehdi
2015-01-01
The design of an integrated 4WS+DYC control system to guide a vehicle on a desired path is presented. The lateral dynamics of the path follower vehicle is formulated by considering important parameters. To reduce the effect of uncertainties in vehicle parameters, a robust controller is designed based on a μ-synthesis approach. Numerical simulations are performed using a nonlinear vehicle model in MATLAB environment in order to investigate the effectiveness of the designed controller. Results of simulations show that the controller has a profound ability to making the vehicle track the desired path in the presence of uncertainties
Path-Goal Theory of Leadership
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 representations on the complex sphere
Energy Technology Data Exchange (ETDEWEB)
Grosche, C. [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik
2007-08-15
In this paper we discuss the path integral representations for the coordinate systems on the complex sphere S{sub 3C}. The Schroedinger equation, respectively the path integral, separates in exactly 21 orthogonal coordinate systems. We enumerate these coordinate systems and we are able to present the path integral representations explicitly in the majority of the cases. In each solution the expansion into the wave-functions is stated. Also, the kernel and the corresponding Green function can be stated in closed form in terms of the invariant distance on the sphere, respectively on the hyperboloid. (orig.)
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 representations on the complex sphere
International Nuclear Information System (INIS)
Grosche, C.
2007-08-01
In this paper we discuss the path integral representations for the coordinate systems on the complex sphere S 3C . The Schroedinger equation, respectively the path integral, separates in exactly 21 orthogonal coordinate systems. We enumerate these coordinate systems and we are able to present the path integral representations explicitly in the majority of the cases. In each solution the expansion into the wave-functions is stated. Also, the kernel and the corresponding Green function can be stated in closed form in terms of the invariant distance on the sphere, respectively on the hyperboloid. (orig.)
Positroids Induced by Rational Dyck Paths
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...
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
New framework for the Feynman path integral
International Nuclear Information System (INIS)
Shaharir, M.Z.
1986-01-01
The well-known Fourier integral solution of the free diffusion equation in an arbitrary Euclidean space is reduced to Feynmannian integrals using the method partly contained in the formulation of the Fresnelian integral. By replacing the standard Hilbert space underlying the present mathematical formulation of the Feynman path integral by a new Hilbert space, the space of classical paths on the tangent bundle to the Euclidean space (and more general to an arbitrary Riemannian manifold) equipped with a natural inner product, we show that our Feynmannian integral is in better agreement with the qualitative features of the original Feynman path integral than the previous formulations of the integral
Realizing spaces as path-component spaces
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...
Northern Pintail - Flight Path Telemetry [ds117
California Natural Resource Agency — North-south flight paths of radio-tagged female northern pintails were monitored in a section of Highway 152 near Los Banos, California during 4 and 11 November and...
Ductility behavior of irradiated path B alloys
International Nuclear Information System (INIS)
Yang, W.J.S.; Hamilton, M.L.
1983-01-01
The objective of this study was to assess the practicality of using five Path B alloys in their current form as structural materials in the Fusion First-Wall/Blanket by evaluating both their postirradiation ductility and the corresponding microstructures
AEDT sensor path methods using BADA4
2017-06-01
This report documents the development and use of sensor path data processing in the Federal Aviation Administration's (FAAs) Aviation Environmental Design Tool (AEDT). The methods are primarily intended to assist analysts with using AEDT to determ...
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.
Search Path Evaluation Incorporating Object Placement Structure
National Research Council Canada - National Science Library
Baylog, John G; Wettergren, Thomas A
2007-01-01
This report describes a computationally robust approach to search path performance evaluation where the objects of search interest exhibit structure in the way in which they occur within the search space...
Multiagent path-finding in strategic games
Mihevc, Simon
2014-01-01
In this thesis I worked on creating, comparing and improving algorithms for multi-agent path planning on a domain typical for real-time strategy games. I implemented and compared Multiagent pathfinding using clearance and Multiagent pathfinding using independence detection and operator decomposition. I discovered that they had problems maintaining group compactness and took too long to calculate the path. I considerably improved the efficiency of both algorithms.
Diversion Path Analysis Handbook. Volume 1. Methodology
International Nuclear Information System (INIS)
Goodwin, K.E.; Schleter, J.C.; Maltese, M.D.K.
1978-11-01
Diversion Path Analysis (DPA) is a safeguards evaluation tool which is used to determine the vulnerability of the Material Control and Material Accounting (MC and MA) Subsystems to the threat of theft of Special Nuclear Material (SNM) by a knowledgeable Insider. The DPA team should consist of two individuals who have technical backgrounds. The implementation of DPA is divided into five basic steps: Information and Data Gathering, Process Characterization, Analysis of Diversion Paths, Results and Findings, and Documentation
Feasible Path Planning for Autonomous Vehicles
Directory of Open Access Journals (Sweden)
Vu Trieu Minh
2014-01-01
Full Text Available The objective of this paper is to find feasible path planning algorithms for nonholonomic vehicles including flatness, polynomial, and symmetric polynomial trajectories subject to the real vehicle dynamical constraints. Performances of these path planning methods are simulated and compared to evaluate the more realistic and smoother generated trajectories. Results show that the symmetric polynomial algorithm provides the smoothest trajectory. Therefore, this algorithm is recommended for the development of an automatic control for autonomous vehicles.
A career path in clinical pathways.
Bower, K A
1998-03-01
Much like the development of a clinical path, the creation of a career path requires knowledge of patterns of behavior, needs for standardized education and skill development, along with variance analysis and individualized care. This nationally known nursing entrepreneur tells the story of her involvement in the development of case management and clinical pathways and how she turned that into a successful business that has changed how patient care is managed nationally and internationally.
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)
Lattice Paths and the Constant Term
International Nuclear Information System (INIS)
Brak, R; Essam, J; Osborn, J; Owczarek, A L; Rechnitzer, A
2006-01-01
We firstly review the constant term method (CTM), illustrating its combinatorial connections and show how it can be used to solve a certain class of lattice path problems. We show the connection between the CTM, the transfer matrix method (eigenvectors and eigenvalues), partial difference equations, the Bethe Ansatz and orthogonal polynomials. Secondly, we solve a lattice path problem first posed in 1971. The model stated in 1971 was only solved for a special case - we solve the full model
Computing Diffeomorphic Paths for Large Motion Interpolation.
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).
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''
UMDR: Multi-Path Routing Protocol for Underwater Ad Hoc Networks with Directional Antenna
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.
A novel communication mechanism based on node potential multi-path routing
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.
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.
Global Qualitative Flow-Path Modeling for Local State Determination in Simulation and Analysis
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.
Akay, Abdullah E; Wing, Michael G; Sivrikaya, Fatih; Sakar, Dursun
2012-03-01
The ability of firefighting vehicles and staff to reach a fire area as quickly as possible is critical in fighting against forest fires. In this study, a Geographical Information System-based decision support system was developed to assist fire managers in determining the fastest and the safest or more reliable access routes from firefighting headquarters to fire areas. The decision support system was tested in the Kahramanmaras Forestry Regional Directoratein the Mediterranean region of Turkey. The study area consisted of forested lands which had been classified according to fire sensitivity. The fire response routing simulations considered firefighting teams located in 20 firefighting headquarter locations. The road network, the locations of the firefighting headquarters, and possible fire locations were mapped for simulation analysis. In alternative application simulations, inaccessible roads which might be closed due to fire or other reasons were indicated in the network analysis so that the optimum route was not only the fastest but also the safest and most reliable path. The selection of which firefighting headquarters to use was evaluated by considering critical response time to potential fire areas based on fire sensitivity levels. Results indicated that new firefighting headquarters should be established in the region in order to provide sufficient firefighting response to all forested lands. In addition, building new fire access roads and increasing the design speed on current roads could also increase firefighting response capabilities within the study area.
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.
Recent equivalent source methods for quantifying airborne and structureborne sound transfer
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,
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
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
Path optimization method for the sign problem
Directory of Open Access Journals (Sweden)
Ohnishi Akira
2018-01-01
Full Text Available We propose a path optimization method (POM to evade the sign problem in the Monte-Carlo calculations for complex actions. Among many approaches to the sign problem, the Lefschetz-thimble path-integral method and the complex Langevin method are promising and extensively discussed. In these methods, real field variables are complexified and the integration manifold is determined by the flow equations or stochastically sampled. When we have singular points of the action or multiple critical points near the original integral surface, however, we have a risk to encounter the residual and global sign problems or the singular drift term problem. One of the ways to avoid the singular points is to optimize the integration path which is designed not to hit the singular points of the Boltzmann weight. By specifying the one-dimensional integration-path as z = t +if(t(f ϵ R and by optimizing f(t to enhance the average phase factor, we demonstrate that we can avoid the sign problem in a one-variable toy model for which the complex Langevin method is found to fail. In this proceedings, we propose POM and discuss how we can avoid the sign problem in a toy model. We also discuss the possibility to utilize the neural network to optimize the path.
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.
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
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.
Paths to Licensure: Things Physicists Should Know
Stewart, Gay; Stewart, John
2016-03-01
The path to licensure can be quite complicated, and can thwart a physics department's efforts to produce more and better prepared high school physics teachers. Each state has different pathways to licensure. Acronyms like CAEP and SPA are not within the normal physicist's vocabulary. Some understanding of this topic can allow physics faculty advisers to help our students so that fewer are derailed on their path to the classroom, or take a path that will leave them less well prepared if they do find themselves there. Examples of different approaches that work within state licensure systems from two different states will be presented. Physics teacher preparation efforts in both Arkansas and West Virginia have been supported in part by the Physics Teacher Education Coalition (PhysTEC).
A taxonomy of integral reaction path analysis
Energy Technology Data Exchange (ETDEWEB)
Grcar, Joseph F.; Day, Marcus S.; Bell, John B.
2004-12-23
W. C. Gardiner observed that achieving understanding through combustion modeling is limited by the ability to recognize the implications of what has been computed and to draw conclusions about the elementary steps underlying the reaction mechanism. This difficulty can be overcome in part by making better use of reaction path analysis in the context of multidimensional flame simulations. Following a survey of current practice, an integral reaction flux is formulated in terms of conserved scalars that can be calculated in a fully automated way. Conditional analyses are then introduced, and a taxonomy for bidirectional path analysis is explored. Many examples illustrate the resulting path analysis and uncover some new results about nonpremixed methane-air laminar jets.
Path integral solution of the Dirichlet problem
International Nuclear Information System (INIS)
LaChapelle, J.
1997-01-01
A scheme for functional integration developed by Cartier/DeWitt-Morette is first reviewed and then employed to construct the path integral representation for the solution of the Dirichlet problem in terms of first exit time. The path integral solution is then applied to calculate the fixed-energy point-to-point transition amplitude both in configuration and phase space. The path integral solution can also be derived using physical principles based on Feynman close-quote s original reasoning. We check that the Fourier transform in energy of the fixed-energy point-to-point transition amplitude gives the well known time-dependent transition amplitude, and calculate the WKB approximation. copyright 1997 Academic Press, Inc
Reaction path simulations in multicomponent materials
International Nuclear Information System (INIS)
Seifert, H.J.
1999-01-01
The CALPHAD (calculation of phase diagrams) method is used in combination with selected experimental investigations to derive reaction paths in multicomponent systems. The method is illustrated by applying computerized thermodynamic databases and suitable software to explain quantitatively the thermal degradation of precursor-derived Si-C-N ceramics and the nitridation of titanium carbide. Reaction sequences in the Si 3 N 4 -SiC-TiC x N l-x -C-N system are illustrated by graphical representation of compatibility regions and indicated reaction paths. From these results the experimentally known microstructure development of TiC reinforced Si 3 N 4 ceramics is explained and quantitative information is provided to optimize the microstructure of such materials. The concept of reaction paths for the understanding of rapid solidification processes is shown by the example of AZ type Mg casting alloys. (orig.)
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)
Tornado intensity estimated from damage path dimensions.
Directory of Open Access Journals (Sweden)
James B Elsner
Full Text Available The Newcastle/Moore and El Reno tornadoes of May 2013 are recent reminders of the destructive power of tornadoes. A direct estimate of a tornado's power is difficult and dangerous to get. An indirect estimate on a categorical scale is available from a post-storm survery of the damage. Wind speed bounds are attached to the scale, but the scale is not adequate for analyzing trends in tornado intensity separate from trends in tornado frequency. Here tornado intensity on a continuum is estimated from damage path length and width, which are measured on continuous scales and correlated to the EF rating. The wind speeds on the EF scale are treated as interval censored data and regressed onto the path dimensions and fatalities. The regression model indicates a 25% increase in expected intensity over a threshold intensity of 29 m s(-1 for a 100 km increase in path length and a 17% increase in expected intensity for a one km increase in path width. The model shows a 43% increase in the expected intensity when fatalities are observed controlling for path dimensions. The estimated wind speeds correlate at a level of .77 (.34, .93 [95% confidence interval] with a small sample of wind speeds estimated independently from a doppler radar calibration. The estimated wind speeds allow analyses to be done on the tornado database that are not possible with the categorical scale. The modeled intensities can be used in climatology and in environmental and engineering applications. Research is needed to understand the upward trends in path length and width.
Tornado intensity estimated from damage path dimensions.
Elsner, James B; Jagger, Thomas H; Elsner, Ian J
2014-01-01
The Newcastle/Moore and El Reno tornadoes of May 2013 are recent reminders of the destructive power of tornadoes. A direct estimate of a tornado's power is difficult and dangerous to get. An indirect estimate on a categorical scale is available from a post-storm survery of the damage. Wind speed bounds are attached to the scale, but the scale is not adequate for analyzing trends in tornado intensity separate from trends in tornado frequency. Here tornado intensity on a continuum is estimated from damage path length and width, which are measured on continuous scales and correlated to the EF rating. The wind speeds on the EF scale are treated as interval censored data and regressed onto the path dimensions and fatalities. The regression model indicates a 25% increase in expected intensity over a threshold intensity of 29 m s(-1) for a 100 km increase in path length and a 17% increase in expected intensity for a one km increase in path width. The model shows a 43% increase in the expected intensity when fatalities are observed controlling for path dimensions. The estimated wind speeds correlate at a level of .77 (.34, .93) [95% confidence interval] with a small sample of wind speeds estimated independently from a doppler radar calibration. The estimated wind speeds allow analyses to be done on the tornado database that are not possible with the categorical scale. The modeled intensities can be used in climatology and in environmental and engineering applications. Research is needed to understand the upward trends in path length and width.
Which coordinate system for modelling path integration?
Vickerstaff, Robert J; Cheung, Allen
2010-03-21
Path integration is a navigation strategy widely observed in nature where an animal maintains a running estimate, called the home vector, of its location during an excursion. Evidence suggests it is both ancient and ubiquitous in nature, and has been studied for over a century. In that time, canonical and neural network models have flourished, based on a wide range of assumptions, justifications and supporting data. Despite the importance of the phenomenon, consensus and unifying principles appear lacking. A fundamental issue is the neural representation of space needed for biological path integration. This paper presents a scheme to classify path integration systems on the basis of the way the home vector records and updates the spatial relationship between the animal and its home location. Four extended classes of coordinate systems are used to unify and review both canonical and neural network models of path integration, from the arthropod and mammalian literature. This scheme demonstrates analytical equivalence between models which may otherwise appear unrelated, and distinguishes between models which may superficially appear similar. A thorough analysis is carried out of the equational forms of important facets of path integration including updating, steering, searching and systematic errors, using each of the four coordinate systems. The type of available directional cue, namely allothetic or idiothetic, is also considered. It is shown that on balance, the class of home vectors which includes the geocentric Cartesian coordinate system, appears to be the most robust for biological systems. A key conclusion is that deducing computational structure from behavioural data alone will be difficult or impossible, at least in the absence of an analysis of random errors. Consequently it is likely that further theoretical insights into path integration will require an in-depth study of the effect of noise on the four classes of home vectors. Copyright 2009 Elsevier Ltd
The transformation techniques in path integration
International Nuclear Information System (INIS)
Inomata, A.
1989-01-01
In this paper general remarks are made concerning the time transformation techniques in path integration and their implementations. Time transformations may be divided into two classes: global (integrable) time transformations and local (nonintegrable) time transformations. Although a brief account of global time transformations is given, attention is focused on local transformations. First, time transformations in the classical Kepler problem are reviewed. Then, problems encountered in implementing a local time transformation in quantum mechanics are analyzed. A several propositions pertinent to the implementation of local time transformations, particularly basic to the local time rescaling trick in a discretized path integral, are presented
Flight Path Recovery System (FPRS) design study
Energy Technology Data Exchange (ETDEWEB)
1978-09-01
The study contained herein presents a design for a Flight Path Recovery System (FPPS) for use in the NURE Program which will be more accurate than systems presently used, provide position location data in digital form suitable for automatic data processing, and provide for flight path recovery in a more economic and operationally suitable manner. The design is based upon the use of presently available hardware and technoloy, and presents little, it any, development risk. In addition, a Flight Test Plan designed to test the FPRS design concept is presented.
Canonical transformations and hamiltonian path integrals
International Nuclear Information System (INIS)
Prokhorov, L.V.
1982-01-01
Behaviour of the Hamiltonian path integrals under canonical transformations produced by a generator, is investigated. An exact form is determined for the kernel of the unitary operator realizing the corresponding quantum transformation. Equivalence rules are found (the Hamiltonian formalism, one-dimensional case) enabling one to exclude non-standard terms from the action. It is shown that the Hamiltonian path integral changes its form under cononical transformations: in the transformed expression besides the classical Hamiltonian function there appear some non-classical terms
Flight Path Recovery System (FPRS) design study
International Nuclear Information System (INIS)
1978-09-01
The study contained herein presents a design for a Flight Path Recovery System (FPPS) for use in the NURE Program which will be more accurate than systems presently used, provide position location data in digital form suitable for automatic data processing, and provide for flight path recovery in a more economic and operationally suitable manner. The design is based upon the use of presently available hardware and technoloy, and presents little, it any, development risk. In addition, a Flight Test Plan designed to test the FPRS design concept is presented
Field theory a path integral approach
Das, Ashok
2006-01-01
This unique book describes quantum field theory completely within the context of path integrals. With its utility in a variety of fields in physics, the subject matter is primarily developed within the context of quantum mechanics before going into specialized areas.Adding new material keenly requested by readers, this second edition is an important expansion of the popular first edition. Two extra chapters cover path integral quantization of gauge theories and anomalies, and a new section extends the supersymmetry chapter, where singular potentials in supersymmetric systems are described.
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...
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.
On the structure of path-like trees
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.
Using the Curriculum Vita To Study the Career Paths of Scientists and Engineers: An Assessment.
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…
Propagation Effects in Space/Earth Paths.
1980-08-01
0 h In both integrals ds is a differential of curved ray path and includes refractive bending. In either integral, the factor aTar is, by the Rayleigh...interference. Ionospheric modification may also result from the emission of exhaust effluents from HLLV’s. The associated changes in ionospherio chemistry can
Learning to improve path planning performance
International Nuclear Information System (INIS)
Chen, Pang C.
1995-04-01
In robotics, path planning refers to finding a short. collision-free path from an initial robot configuration to a desired configuratioin. It has to be fast to support real-time task-level robot programming. Unfortunately, current planning techniques are still too slow to be effective, as they often require several minutes, if not hours of computation. To remedy this situation, we present and analyze a learning algorithm that uses past experience to increase future performance. The algorithm relies on an existing path planner to provide solutions to difficult tasks. From these solutions, an evolving sparse network of useful robot configurations is learned to support faster planning. More generally, the algorithm provides a speedup-learning framework in which a slow but capable planner may be improved both cost-wise and capability-wise by a faster but less capable planner coupled with experience. The basic algorithm is suitable for stationary environments, and can be extended to accommodate changing environments with on-demand experience repair and object-attached experience abstraction. To analyze the algorithm, we characterize the situations in which the adaptive planner is useful, provide quantitative bounds to predict its behavior, and confirm our theoretical results with experiments in path planning of manipulators. Our algorithm and analysis are sufficiently, general that they may also be applied to other planning domains in which experience is useful
Gender Differences in Career Paths in Banking.
Morgan, Sandra; And Others
1993-01-01
Analyzed career paths of middle managers in bank. Study of matched pairs found that men (n=25) advanced faster and reached middle management through fewer promotions and positions than did women (n=25). Men had significantly more work experience outside of banking. In banking careers, men held more jobs in lending, whereas women occupied more…
Quad-rotor flight path energy optimization
Kemper, Edward
Quad-Rotor unmanned areal vehicles (UAVs) have been a popular area of research and development in the last decade, especially with the advent of affordable microcontrollers like the MSP 430 and the Raspberry Pi. Path-Energy Optimization is an area that is well developed for linear systems. In this thesis, this idea of path-energy optimization is extended to the nonlinear model of the Quad-rotor UAV. The classical optimization technique is adapted to the nonlinear model that is derived for the problem at hand, coming up with a set of partial differential equations and boundary value conditions to solve these equations. Then, different techniques to implement energy optimization algorithms are tested using simulations in Python. First, a purely nonlinear approach is used. This method is shown to be computationally intensive, with no practical solution available in a reasonable amount of time. Second, heuristic techniques to minimize the energy of the flight path are tested, using Ziegler-Nichols' proportional integral derivative (PID) controller tuning technique. Finally, a brute force look-up table based PID controller is used. Simulation results of the heuristic method show that both reliable control of the system and path-energy optimization are achieved in a reasonable amount of time.
Taking a Technological Path to Poetry Prewriting.
Roberts, Sherron Killingsworth
2002-01-01
Offers a strong rationale for the idea that the journey of writing good poetry begins on a path that infuses technology into the first stage of the writing process. Presents several ideas of ways to incorporate technology into the prewriting poetry experience. Concludes that by making technology an ingredient, the true potential for synergy…
Unidirectional Motion of Vehicle on Sinusoidal Path
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 17; Issue 4. Unidirectional Motion of Vehicle on Sinusoidal Path: Can it Cause Illusory Forward and Backward Motion? Anuj Bhatnagar. Classroom Volume 17 Issue 4 April 2012 pp 387-392 ...
Feynman path integral formulation of quantum mechanics
International Nuclear Information System (INIS)
Mizrahi, M.M.
1975-01-01
The subject of this investigation is Feynman's path integral quantization scheme, which is a powerful global formalism with great intuitive appeal. It stems from the simple idea that a probability amplitude for a system to make a transition between two states is the ''sum'' of the amplitudes for all the possible ways the transition can take place
Path integral quantization of parametrized field theory
International Nuclear Information System (INIS)
Varadarajan, Madhavan
2004-01-01
Free scalar field theory on a flat spacetime can be cast into a generally covariant form known as parametrized field theory in which the action is a functional of the scalar field as well as the embedding variables which describe arbitrary, in general curved, foliations of the flat spacetime. We construct the path integral quantization of parametrized field theory in order to analyze issues at the interface of quantum field theory and general covariance in a path integral context. We show that the measure in the Lorentzian path integral is nontrivial and is the analog of the Fradkin-Vilkovisky measure for quantum gravity. We construct Euclidean functional integrals in the generally covariant setting of parametrized field theory using key ideas of Schleich and show that our constructions imply the existence of nonstandard 'Wick rotations' of the standard free scalar field two-point function. We develop a framework to study the problem of time through computations of scalar field two-point functions. We illustrate our ideas through explicit computation for a time independent (1+1)-dimensional foliation. Although the problem of time seems to be absent in this simple example, the general case is still open. We discuss our results in the contexts of the path integral formulation of quantum gravity and the canonical quantization of parametrized field theory
Feature based omnidirectional sparse visual path following
Goedemé, Toon; Tuytelaars, Tinne; Van Gool, Luc; Vanacker, Gerolf; Nuttin, Marnix
2005-01-01
Goedemé T., Tuytelaars T., Van Gool L., Vanacker G., Nuttin M., ''Feature based omnidirectional sparse visual path following'', Proceedings IEEE/RSJ international conference on intelligent robots and systems - IROS2005, pp. 1003-1008, August 2-6, 2005, Edmonton, Alberta, Canada.
Certified higher-order recursive path ordering
Koprowski, A.; Pfenning, F.
2006-01-01
The paper reports on a formalization of a proof of wellfoundedness of the higher-order recursive path ordering (HORPO) in the proof checker Coq. The development is axiom-free and fully constructive. Three substantive parts that could be used also in other developments are the formalizations of the
Path-breaking books in regional science
Waldorf, BS
This article presents a collection of regional science books that long-standing members of the Regional Science Association International (RSAI) identified as path-breaking books. The most frequently nominated books include the "classics" by Isard, the seminal books in urban economics by Alonso,
Covariant path integrals on hyperbolic surfaces
Schaefer, Joe
1997-11-01
DeWitt's covariant formulation of path integration [B. De Witt, "Dynamical theory in curved spaces. I. A review of the classical and quantum action principles," Rev. Mod. Phys. 29, 377-397 (1957)] has two practical advantages over the traditional methods of "lattice approximations;" there is no ordering problem, and classical symmetries are manifestly preserved at the quantum level. Applying the spectral theorem for unbounded self-adjoint operators, we provide a rigorous proof of the convergence of certain path integrals on Riemann surfaces of constant curvature -1. The Pauli-DeWitt curvature correction term arises, as in DeWitt's work. Introducing a Fuchsian group Γ of the first kind, and a continuous, bounded, Γ-automorphic potential V, we obtain a Feynman-Kac formula for the automorphic Schrödinger equation on the Riemann surface ΓH. We analyze the Wick rotation and prove the strong convergence of the so-called Feynman maps [K. D. Elworthy, Path Integration on Manifolds, Mathematical Aspects of Superspace, edited by Seifert, Clarke, and Rosenblum (Reidel, Boston, 1983), pp. 47-90] on a dense set of states. Finally, we give a new proof of some results in C. Grosche and F. Steiner, "The path integral on the Poincare upper half plane and for Liouville quantum mechanics," Phys. Lett. A 123, 319-328 (1987).
Directed paths in a layered environment
International Nuclear Information System (INIS)
Alvarez, J; Janse van Rensburg, E J
2008-01-01
A polymer in a layered environment is modeled as a directed path in a layered square lattice composed of alternating A-layers of width w a and B-layers of width w b . In this paper we consider general cases of this model, where edges in the path interact with the layers, and vertices in the path interact with interfaces between adjacent layers. The phase diagram exhibits different regimes. In particular, we found that the path may be localized to one layer, be adsorbed on an interface between two layers or be delocalized across layers. We examine special aspects of the model in detail: the asymptotic regimes of the models are examined, and entropic forces on the interfaces are determined. We focus on several different cases, including models with layers of equal or similar width. More general models of layers with different but finite widths, or with one layer of infinite width, are also examined in detail. Several of these models exhibit phase behavior which relate to well-studied polymer phase behavior such as adsorption at an impenetrable wall, pinning at an interface between two immiscible solvents, steric stabilization of colloidal particles and sensitized flocculation of colloidal particles by polymers
Random paths with curvature dependent action
International Nuclear Information System (INIS)
Ambjoern, J.; Durhuus, B.
1986-11-01
We study discretized random paths with a curvature dependent action. The scaling limits of the corresponding statistical mechanical models can be constructed explicitly and are either usual Brownian motion or a theory where the correlations of tangents are nonzero and described by diffusion on the unit sphere. In the latter case the two point function has an anomalous dimension η = 1. (orig.)
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.
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.
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.
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.
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.
Path Integrals and Anomalies in Curved Space
International Nuclear Information System (INIS)
Louko, Jorma
2007-01-01
Bastianelli and van Nieuwenhuizen's monograph 'Path Integrals and Anomalies in Curved Space' collects in one volume the results of the authors' 15-year research programme on anomalies that arise in Feynman diagrams of quantum field theories on curved manifolds. The programme was spurred by the path-integral techniques introduced in Alvarez-Gaume and Witten's renowned 1983 paper on gravitational anomalies which, together with the anomaly cancellation paper by Green and Schwarz, led to the string theory explosion of the 1980s. The authors have produced a tour de force, giving a comprehensive and pedagogical exposition of material that is central to current research. The first part of the book develops from scratch a formalism for defining and evaluating quantum mechanical path integrals in nonlinear sigma models, using time slicing regularization, mode regularization and dimensional regularization. The second part applies this formalism to quantum fields of spin 0, 1/2, 1 and 3/2 and to self-dual antisymmetric tensor fields. The book concludes with a discussion of gravitational anomalies in 10-dimensional supergravities, for both classical and exceptional gauge groups. The target audience is researchers and graduate students in curved spacetime quantum field theory and string theory, and the aims, style and pedagogical level have been chosen with this audience in mind. Path integrals are treated as calculational tools, and the notation and terminology are throughout tailored to calculational convenience, rather than to mathematical rigour. The style is closer to that of an exceedingly thorough and self-contained review article than to that of a textbook. As the authors mention, the first part of the book can be used as an introduction to path integrals in quantum mechanics, although in a classroom setting perhaps more likely as supplementary reading than a primary class text. Readers outside the core audience, including this reviewer, will gain from the book a
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
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
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 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.
Epidemic extinction paths in complex networks
Hindes, Jason; Schwartz, Ira B.
2017-05-01
We study the extinction of long-lived epidemics on finite complex networks induced by intrinsic noise. Applying analytical techniques to the stochastic susceptible-infected-susceptible model, we predict the distribution of large fluctuations, the most probable or optimal path through a network that leads to a disease-free state from an endemic state, and the average extinction time in general configurations. Our predictions agree with Monte Carlo simulations on several networks, including synthetic weighted and degree-distributed networks with degree correlations, and an empirical high school contact network. In addition, our approach quantifies characteristic scaling patterns for the optimal path and distribution of large fluctuations, both near and away from the epidemic threshold, in networks with heterogeneous eigenvector centrality and degree distributions.
Technological opportunities and paths of development
DEFF Research Database (Denmark)
Plichta, Kirsten
1993-01-01
the outcome of different firms development effort may also help shape a path at the industry level. This may be because the criteria by which the market selects between the different product may to some extent be anticipated by the developing firms or because the criteria by which the market select betwee...... technological knowledge, their production, development and other routines as well prior investments in products and production equipment play an important role with regard to the technological opportunities that firms' identify and select for development. 3) Because history matters and because firms are bounded...... in the industry. 6) It is argued that such paths of incremental improvement at the industry level may be an outcome of a) the dynamics that produce the technological opportunities; b) the institutions that govern decisions and expectations and c) the criteria by which the chooses between different firms...
Path integral quantization in the temporal gauge
International Nuclear Information System (INIS)
Scholz, B.; Steiner, F.
1983-06-01
The quantization of non-Abelian gauge theories in the temporal gauge is studied within Feynman's path integral approach. The standard asymptotic boundary conditions are only imposed on the transverse gauge fields. The fictituous longitudinal gauge quanta are eliminated asymptotically by modified boundary conditions. This abolishes the residual time-independent gauge transformations and leads to a unique fixing of the temporal gauge. The resulting path integral for the generating functional respects automatically Gauss's law. The correct gauge field propagator is derived. It does not suffer from gauge singularities at n x k = 0 present in the usual treatment of axial gauges. The standard principal value prescription does not work. As a check, the Wilson loop in temporal gauge is calculated with the new propagator. To second order (and to all orders in the Abelian case) the result agrees with the one obtained in the Feynman and Coulomb gauge. (orig.)
Dynamic Path Exploration on Mobile Devices
Birsak, Michael
2017-03-31
We present a novel framework for visualizing routes on mobile devices. Our framework is suitable for helping users explore their environment. First, given a starting point and a maximum route length, the system retrieves nearby points of interest (POIs). Second, we automatically compute an attractive walking path through the environment trying to pass by as many highly ranked POIs as possible. Third, we automatically compute a route visualization that shows the current user position, POI locations via pins, and detail lenses for more information about the POIs. The visualization is an animation of an orthographic map view that follows the current user position. We propose an optimization based on a binary integer program (BIP) that models multiple requirements for an effective placement of detail lenses. We show that our path computation method outperforms recently proposed methods and we evaluate the overall impact of our framework in two user studies.
Path creation in the software industry
DEFF Research Database (Denmark)
Leimbach, Timo
2017-01-01
The article analyzes the development of the German software company Software AG, which was among the few European companies that succeeded in the US market already in the 1970s. Utilizing the concept of "path creation" it examines how early success impacted the development of the company. It shows...... that at least two paths in the development, the focus on the ADABAS product ecosystem and the underlying technology as well as the strong internationalization, relate to the early success and influenced the further evolution of it. The analyses reveal that they played an important role in how the company...... reacted on the rise of relational databases and the vertical disintegration of the computer industry. As a consequence of the late adoption of them they company got into troubles and needed adjust their profile and orientation during the 1990s and early 2000s, which is analyzed in the final part...
Solidification paths of multicomponent monotectic aluminum alloys
Energy Technology Data Exchange (ETDEWEB)
Mirkovic, Djordje; Groebner, Joachim [Clausthal University of Technology, Institute of Metallurgy, Robert-Koch-Street 42, D-38678 Clausthal-Zellerfeld (Germany); Schmid-Fetzer, Rainer [Clausthal University of Technology, Institute of Metallurgy, Robert-Koch-Street 42, D-38678 Clausthal-Zellerfeld (Germany)], E-mail: schmid-fetzer@tu-clausthal.de
2008-10-15
Solidification paths of three ternary monotectic alloy systems, Al-Bi-Zn, Al-Sn-Cu and Al-Bi-Cu, are studied using thermodynamic calculations, both for the pertinent phase diagrams and also for specific details concerning the solidification of selected alloy compositions. The coupled composition variation in two different liquids is quantitatively given. Various ternary monotectic four-phase reactions are encountered during solidification, as opposed to the simple binary monotectic, L' {yields} L'' + solid. These intricacies are reflected in the solidification microstructures, as demonstrated for these three aluminum alloy systems, selected in view of their distinctive features. This examination of solidification paths and microstructure formation may be relevant for advanced solidification processing of multicomponent monotectic alloys.
An alternative path integral for quantum gravity
Energy Technology Data Exchange (ETDEWEB)
Krishnan, Chethan; Kumar, K.V. Pavan; Raju, Avinash [Center for High Energy Physics, Indian Institute of Science,Bangalore 560012 (India)
2016-10-10
We define a (semi-classical) path integral for gravity with Neumann boundary conditions in D dimensions, and show how to relate this new partition function to the usual picture of Euclidean quantum gravity. We also write down the action in ADM Hamiltonian formulation and use it to reproduce the entropy of black holes and cosmological horizons. A comparison between the (background-subtracted) covariant and Hamiltonian ways of semi-classically evaluating this path integral in flat space reproduces the generalized Smarr formula and the first law. This “Neumann ensemble” perspective on gravitational thermodynamics is parallel to the canonical (Dirichlet) ensemble of Gibbons-Hawking and the microcanonical approach of Brown-York.
Secure Path Selection under Random Fading
Directory of Open Access Journals (Sweden)
Furqan Jameel
2017-05-01
Full Text Available Application-oriented Wireless Sensor Networks (WSNs promises to be one of the most useful technologies of this century. However, secure communication between nodes in WSNs is still an unresolved issue. In this context, we propose two protocols (i.e. Optimal Secure Path (OSP and Sub-optimal Secure Path (SSP to minimize the outage probability of secrecy capacity in the presence of multiple eavesdroppers. We consider dissimilar fading at the main and wiretap link and provide detailed evaluation of the impact of Nakagami-m and Rician-K factors on the secrecy performance of WSNs. Extensive simulations are performed to validate our findings. Although the optimal scheme ensures more security, yet the sub-optimal scheme proves to be a more practical approach to secure wireless links.
Rapidly converging path integral formalism. Pt. 1
International Nuclear Information System (INIS)
Bender, I.; Gromes, D.; Marquard, U.
1990-01-01
The action to be used in the path integral formalism is expanded in a systematic way in powers of the time spacing ε in order to optimize the convergence to the continuum limit. This modifies and extends the usual formalism in a transparent way. The path integral approximation to the Green function obtained by this method approaches the continuum Green function with a higher power of ε than the usual one. The general theoretical derivations are exemplified analytically for the harmonic oscillator and by Monte Carlo methods for the anharmonic oscillator. We also show how curvilinear coordinates and curved spaces can naturally be treated within this formalism. Work on field theory is in progress. (orig.)
Spreading paths in partially observed social networks
Onnela, Jukka-Pekka; Christakis, Nicholas A.
2012-01-01
Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using a static, s...
Anomaly extraction from the path integral
International Nuclear Information System (INIS)
Christos, G.A.
1983-01-01
Fujikawa's recently proposed derivation of the anomaly from the path integral is examined. It is attempted to give a better understanding of his work. In particular, evasions of his result are discussed; for example it is shown how chiral U(1) axial invariance can be maintained by employing a gauge variant regularization prescription. A brief connection with the point-splitting method is also made. (orig.)
On path hypercompositions in graphs and automata
Directory of Open Access Journals (Sweden)
Massouros Christos G.
2016-01-01
Full Text Available The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.
Path integral measure for gravitational interactions
Directory of Open Access Journals (Sweden)
Kazuo Fujikawa
1983-10-01
Full Text Available It is pointed out that the path-integral variables as well as the local measure for gravitational interactions are uniquely specified if one imposes the anomaly-free condition on the Becchi-Rouet-Stora supersymmetry associated with general coordinate transformations. This prescription is briefly illustrated for the Einstein gravity and supergravity in four space-time dimensions and the relativistic string theory in two dimensions.
Path dependence and independent utility regulation
DEFF Research Database (Denmark)
Ibsen, Christian Lyhne; Skovgaard Poulsen, Lauge
2007-01-01
The establishment of the Danish independent regulatory authorities for the energy and telecommunications sectors was based upon EU directives as part of their liberalisation process. Following the concepts of transaction costs and path dependency this article analyses differences in independence...... between the two authorities - the Danish Energy Regulatory Authority (Energitilsynet) and the National IT and Telecommunications Agency (IT- og Telestyrelsen) respectively. We find that the state's negligible interest in the energy sector until the 1970s formed the basis for strong energy companies...
Mindfulness as a Path of Women's Empowerment
Nadja FURLAN ŠTANTE
2016-01-01
The paper brings together social mindfulness as a path of empowerment for women within its concept of the interrelatedness of all beings in the web of life. The paradigm of social mindfulness is thus established as the foundation of feminist spirituality. The focus of this work is on the possibility of applying the ethics of mindfulness as a paradigm to interpersonal interrelatedness. The relations among humans, nature, reason and emotion in self-development are confronted with the paradigm o...
Civil Society and Paths to Abolition
Directory of Open Access Journals (Sweden)
Seymour DRESCHER
2015-12-01
Full Text Available Abstract Through a comparative analysis, this article aims to present an overview of British, French, Russian, American and Brazilian abolitionist action, between the late eighteenth century and throughout the nineteenth century. Indicating the struggles of pro-abolition civil associations, the paths taken in Britain, France, the US and Brazil are presented in parallel - either to emphasize approaches, either to highlight the undeniable peculiarities - revealing the marks of violence and negotiation present in the emancipation process.
Critical crack path assessments in failure investigations
Directory of Open Access Journals (Sweden)
Robert D. Caligiuri
2015-10-01
Full Text Available This paper presents a case study in which identification of the controlling crack path was critical to identifying the root cause of the failure. The case involves the rupture of a 30-inch (0.76 m natural gas pipeline in 2010 that tragically led to the destruction of a number of homes and the loss of life. The segment of the pipeline that ruptured was installed in 1956. The longitudinal seam of the segment that ruptured was supposed to have been fabricated by double submerged arc welding. Unfortunately, portions of the segment only received a single submerged arc weld on the outside, leaving unwelded areas on the inside diameter. Post-failure examination of the segment revealed that the rupture originated at one of these unwelded areas. Examination also revealed three additional crack paths or zones emanating from the unwelded area: a zone of ductile tearing, a zone of fatigue, and a zone of cleavage fracture, in that sequence. Initial investigators ignored the ductile tear, assumed the critical crack path was the fatigue component, and (incorrectly concluded that the root cause of the incident was the failure of the operator to hydrotest the segment after it was installed in 1956. However, as discussed in this paper, the critical path or mechanism was the ductile tear. Furthermore, it was determined that the ductile tear was created during the hydrotest at installation by a mechanism known as pressure reversal. Thus the correct root cause of the rupture was the hydrotest the operator subjected the segment to at installation, helping to increase the awareness of operators and regulators about the potential problems associated with hydrotesting.
Covariant path integrals on hyperbolic surfaces
International Nuclear Information System (INIS)
Schaefer, J.
1997-01-01
DeWitt close-quote s covariant formulation of path integration [B. De Witt, open-quotes Dynamical theory in curved spaces. I. A review of the classical and quantum action principles,close quotes Rev. Mod. Phys. 29, 377 endash 397 (1957)] has two practical advantages over the traditional methods of open-quotes lattice approximations;close quotes there is no ordering problem, and classical symmetries are manifestly preserved at the quantum level. Applying the spectral theorem for unbounded self-adjoint operators, we provide a rigorous proof of the convergence of certain path integrals on Riemann surfaces of constant curvature -1. The Pauli endash DeWitt curvature correction term arises, as in DeWitt close-quote s work. Introducing a Fuchsian group Γ of the first kind, and a continuous, bounded, Γ-automorphic potential V, we obtain a Feynman endash Kac formula for the automorphic Schroedinger equation on the Riemann surface Γ backslash H. We analyze the Wick rotation and prove the strong convergence of the so-called Feynman maps [K. D. Elworthy, Path Integration on Manifolds, Mathematical Aspects of Superspace, edited by Seifert, Clarke, and Rosenblum (Reidel, Boston, 1983), pp. 47 endash 90] on a dense set of states. Finally, we give a new proof of some results in C. Grosche and F. Steiner, open-quotes The path integral on the Poincare upper half plane and for Liouville quantum mechanics,close quotes Phys. Lett. A 123, 319 endash 328 (1987). copyright 1997 American Institute of Physics
How Quasar Feedback May Shape the Co-evolutionary Paths
Energy Technology Data Exchange (ETDEWEB)
Ishibashi, Wako, E-mail: wako.ishibashi@physik.uzh.ch [Physik-Institut, University of Zurich, Zürich (Switzerland)
2017-10-17
Observations point toward some form of “co-evolutionary sequence,” from dust-enshrouded starbursts to luminous unobscured quasars. Active galactic nucleus (AGN) feedback is generally invoked to expel the obscuring dusty gas in a blow-out event, eventually revealing the hidden central quasar. However, the physical mechanism driving AGN feedback, either due to winds or radiation, remains uncertain and is still a source of much debate. We consider quasar feedback, based on radiation pressure on dust, which directly acts on the obscuring dusty gas. We show that AGN radiative feedback is capable of efficiently removing the obscuring cocoon, and driving powerful outflows on galactic scales, consistent with recent observations. I will discuss how such quasar feedback may provide a natural physical interpretation of the observed evolutionary path, and the physical implications in the broader context of black hole-host galaxy co-evolution.
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.
Basic sanitation policy in Brazil: discussion of a path.
Sousa, Ana Cristina A de; Costa, Nilson do Rosário
2016-01-01
This article demonstrates that the position of dominance enjoyed by state sanitation companies dictates the public policy decision-making process for sanitation in Brazil. These companies' hegemony is explained here through the analysis of a path that generated political and economic incentives that have permitted its consolidation over time. Through the content analysis of the legislation proposed for the sector and the material produced by the stakeholders involved in the approval of new regulations for the sector in 2007, the study identifies the main sources of incentive introduced by the adoption of the National Sanitation Plan, which explain certain structural features of the current sanitation policy and its strong capacity to withstand the innovations proposed under democratic rule.
Auditory perception of motor vehicle travel paths.
Ashmead, Daniel H; Grantham, D Wesley; Maloff, Erin S; Hornsby, Benjamin; Nakamura, Takabun; Davis, Timothy J; Pampel, Faith; Rushing, Erin G
2012-06-01
These experiments address concerns that motor vehicles in electric engine mode are so quiet that they pose a risk to pedestrians, especially those with visual impairments. The "quiet car" issue has focused on hybrid and electric vehicles, although it also applies to internal combustion engine vehicles. Previous research has focused on detectability of vehicles, mostly in quiet settings. Instead, we focused on the functional ability to perceive vehicle motion paths. Participants judged whether simulated vehicles were traveling straight or turning, with emphasis on the impact of background traffic sound. In quiet, listeners made the straight-or-turn judgment soon enough in the vehicle's path to be useful for deciding whether to start crossing the street. This judgment is based largely on sound level cues rather than the spatial direction of the vehicle. With even moderate background traffic sound, the ability to tell straight from turn paths is severely compromised. The signal-to-noise ratio needed for the straight-or-turn judgment is much higher than that needed to detect a vehicle. Although a requirement for a minimum vehicle sound level might enhance detection of vehicles in quiet settings, it is unlikely that this requirement would contribute to pedestrian awareness of vehicle movements in typical traffic settings with many vehicles present. The findings are relevant to deliberations by government agencies and automobile manufacturers about standards for minimum automobile sounds and, more generally, for solutions to pedestrians' needs for information about traffic, especially for pedestrians with sensory impairments.
Creep analysis by the path function method
International Nuclear Information System (INIS)
Akin, J.E.; Pardue, R.M.
1977-01-01
The finite element method has become a common analysis procedure for the creep analysis of structures. The most recent programs are designed to handle a general class of material properties and are able to calculate elastic, plastic, and creep components of strain under general loading histories. The constant stress approach is too crude a model to accurately represent the actual behaviour of the stress for large time steps. The true path of a point in the effective stress-effective strain (sigmasup(e)-epsilonsup(c)) plane is often one in which the slope is rapidly changing. Thus the stress level quickly moves away from the initial stress level and then gradually approaches the final one. The result is that the assumed constant stress level quickly becomes inaccurate. What is required is a better method of approximation of the true path in the sigmasup(e)-epsilonsup(c) space. The method described here is called the path function approach because it employs an assumed function to estimate the motion of points in the sigmasup(e)-epsilonsup(c) space. (Auth.)
Accelerating cleanup. Paths to closure Hanford Site
International Nuclear Information System (INIS)
Edwards, C.
1998-01-01
This document was previously referred to as the Draft 2006 Plan. As part of the DOE's national strategy, the Richland Operations Office's Paths to Closure summarizes an integrated path forward for environmental cleanup at the Hanford Site. The Hanford Site underwent a concerted effort between 1994 and 1996 to accelerate the cleanup of the Site. These efforts are reflected in the current Site Baseline. This document describes the current Site Baseline and suggests strategies for further improvements in scope, schedule and cost. The Environmental Management program decided to change the name of the draft strategy and the document describing it in response to a series of stakeholder concerns, including the practicality of achieving widespread cleanup by 2006. Also, EM was concerned that calling the document a plan could be misconstrued to be a proposal by DOE or a decision-making document. The change in name, however, does not diminish the 2006 vision. To that end, Paths to Closure retains a focus on 2006, which serves as a point in time around which objectives and goals are established
Path-integral computation of superfluid densities
International Nuclear Information System (INIS)
Pollock, E.L.; Ceperley, D.M.
1987-01-01
The normal and superfluid densities are defined by the response of a liquid to sample boundary motion. The free-energy change due to uniform boundary motion can be calculated by path-integral methods from the distribution of the winding number of the paths around a periodic cell. This provides a conceptually and computationally simple way of calculating the superfluid density for any Bose system. The linear-response formulation relates the superfluid density to the momentum-density correlation function, which has a short-ranged part related to the normal density and, in the case of a superfluid, a long-ranged part whose strength is proportional to the superfluid density. These facts are discussed in the context of path-integral computations and demonstrated for liquid 4 He along the saturated vapor-pressure curve. Below the experimental superfluid transition temperature the computed superfluid fractions agree with the experimental values to within the statistical uncertainties of a few percent in the computations. The computed transition is broadened by finite-sample-size effects
Path Models of Vocal Emotion Communication.
Directory of Open Access Journals (Sweden)
Tanja Bänziger
Full Text Available We propose to use a comprehensive path model of vocal emotion communication, encompassing encoding, transmission, and decoding processes, to empirically model data sets on emotion expression and recognition. The utility of the approach is demonstrated for two data sets from two different cultures and languages, based on corpora of vocal emotion enactment by professional actors and emotion inference by naïve listeners. Lens model equations, hierarchical regression, and multivariate path analysis are used to compare the relative contributions of objectively measured acoustic cues in the enacted expressions and subjective voice cues as perceived by listeners to the variance in emotion inference from vocal expressions for four emotion families (fear, anger, happiness, and sadness. While the results confirm the central role of arousal in vocal emotion communication, the utility of applying an extended path modeling framework is demonstrated by the identification of unique combinations of distal cues and proximal percepts carrying information about specific emotion families, independent of arousal. The statistical models generated show that more sophisticated acoustic parameters need to be developed to explain the distal underpinnings of subjective voice quality percepts that account for much of the variance in emotion inference, in particular voice instability and roughness. The general approach advocated here, as well as the specific results, open up new research strategies for work in psychology (specifically emotion and social perception research and engineering and computer science (specifically research and development in the domain of affective computing, particularly on automatic emotion detection and synthetic emotion expression in avatars.
Zeng, Qiang; Yao, Zhihong; Liu, Lei
2011-03-01
Digital Imaging and Communications in Medicine (DICOM) is a standard for handling, storing, printing, and transmitting information in medical imaging. XML (Extensible Markup Language) is a set of rules for encoding documents in machine-readable form which has become more and more popular. The combination of these two is very necessary and promising. Using XML tags instead of numeric labels in DICOM files will effectively increase the readability and enhance the clear hierarchical structure of DICOM files. However, due to the fact that the XML tags rely heavily on the orders of the tags, the strong data dependency has a lot of influence on the flexibility of inserting and exchanging data. In order to improve the extensibility and sharing of DICOM files, this paper introduces XML Path-Tag to DICOM. When a DICOM file is converted to XML format, adding simple Path-Tag into the DICOM file in place of complex tags will keep the flexibility of a DICOM file while inserting data elements and give full play to the advantages of the structure and readability of an XML file. Our method can solve the weak readability problem of DICOM files and the tedious work of inserting data into an XML file. In addition, we set up a conversion engine that can transform among traditional DICOM files, XML-DCM and XML-DCM files involving XML Path-Tag efficiently.
Designing the Alluvial Riverbeds in Curved Paths
Macura, Viliam; Škrinár, Andrej; Štefunková, Zuzana; Muchová, Zlatica; Majorošová, Martina
2017-10-01
The paper presents the method of determining the shape of the riverbed in curves of the watercourse, which is based on the method of Ikeda (1975) developed for a slightly curved path in sandy riverbed. Regulated rivers have essentially slightly and smoothly curved paths; therefore, this methodology provides the appropriate basis for river restoration. Based on the research in the experimental reach of the Holeška Brook and several alluvial mountain streams the methodology was adjusted. The method also takes into account other important characteristics of bottom material - the shape and orientation of the particles, settling velocity and drag coefficients. Thus, the method is mainly meant for the natural sand-gravel material, which is heterogeneous and the particle shape of the bottom material is very different from spherical. The calculation of the river channel in the curved path provides the basis for the design of optimal habitat, but also for the design of foundations of armouring of the bankside of the channel. The input data is adapted to the conditions of design practice.
Path integral for gauge theories with fermions
International Nuclear Information System (INIS)
Fujikawa, K.
1980-01-01
The Atiyah-Singer index theorem indicates that a naive unitary transformation of basis vectors for fermions interacting with gauge fields is not allowed in general. On the basis of this observation, it was previously shown that the path-integral measure of a gauge-invariant fermion theory is transformed nontrivially under the chiral transformation, and thus leads to a simple derivation of ''anomalous'' chiral Ward-Takahashi identities. We here clarify some of the technical aspects associated with the discussion. It is shown that the Jacobian factor in the path-integral measure, which corresponds to the Adler-Bell-Jackiw anomaly, is independent of any smooth regularization procedure of large eigenvalues of D in Euclidean theory; this property holds in any even-dimensional space-time and also for the gravitational anomaly. The appearance of the anomaly and its connection with the index theorem are thus related to the fact that the primary importance is attached to the Lorentz-covariant ''energy'' operator D and that D and γ 5 do not commute. The abnormal behavior of the path-integral measure at the zero-frequency sector in the presence of instantons and its connection with spontaneous symmetry breaking is also clarified. We comment on several other problems associated with the anomaly and on the Pauli-Villars regularization method
Path integration on space times with symmetry
International Nuclear Information System (INIS)
Low, S.G.
1985-01-01
Path integration on space times with symmetry is investigated using a definition of path integration of Gaussian integrators. Gaussian integrators, systematically developed using the theory of projective distributions, may be defined in terms of a Jacobi operator Green function. This definition of the path integral yields a semiclassical expansion of the propagator which is valid on caustics. The semiclassical approximation to the free particle propagator on symmetric and reductive homogeneous spaces is computed in terms of the complete solution of the Jacobi equation. The results are used to test the validity of using the Schwinger-DeWitt transform to compute an approximation to the coincidence limit of a field theory Green function from a WKB propagator. The method is found not to be valid except for certain special cases. These cases include manifolds constructed from the direct product of flat space and group manifolds, on which the free particle WKB approximation is exact and two sphere. The multiple geodesic contribution to 2 > on Schwarzschild in the neighborhood of rho = 3M is computed using the transform
MinePath: Mining for Phenotype Differential Sub-paths in Molecular Pathways
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
Vapor nucleation paths in lyophobic nanopores.
Tinti, Antonio; Giacomello, Alberto; Casciola, Carlo Massimo
2018-04-19
In recent years, technologies revolving around the use of lyophobic nanopores gained considerable attention in both fundamental and applied research. Owing to the enormous internal surface area, heterogeneous lyophobic systems (HLS), constituted by a nanoporous lyophobic material and a non-wetting liquid, are promising candidates for the efficient storage or dissipation of mechanical energy. These diverse applications both rely on the forced intrusion and extrusion of the non-wetting liquid inside the pores; the behavior of HLS for storage or dissipation depends on the hysteresis between these two processes, which, in turn, are determined by the microscopic details of the system. It is easy to understand that molecular simulations provide an unmatched tool for understanding phenomena at these scales. In this contribution we use advanced atomistic simulation techniques in order to study the nucleation of vapor bubbles inside lyophobic mesopores. The use of the string method in collective variables allows us to overcome the computational challenges associated with the activated nature of the phenomenon, rendering a detailed picture of nucleation in confinement. In particular, this rare event method efficiently searches for the most probable nucleation path(s) in otherwise intractable, high-dimensional free-energy landscapes. Results reveal the existence of several independent nucleation paths associated with different free-energy barriers. In particular, there is a family of asymmetric transition paths, in which a bubble forms at one of the walls; the other family involves the formation of axisymmetric bubbles with an annulus shape. The computed free-energy profiles reveal that the asymmetric path is significantly more probable than the symmetric one, while the exact position where the asymmetric bubble forms is less relevant for the free energetics of the process. A comparison of the atomistic results with continuum models is also presented, showing how, for simple
Ecker, Amir L.; Pietsch, Joseph A.
1982-01-01
What is disclosed is a heat pump apparatus for conditioning a fluid characterized by a fluid handler and path for circulating the fluid in heat exchange relationship with a refrigerant fluid; at least two refrigerant heat exchangers, one for effecting heat exchange with the fluid and a second for effecting heat exchange between refrigerant and a heat exchange fluid and the ambient air; a compressor for efficiently compressing the refrigerant; at least one throttling valve for throttling liquid refrigerant; a refrigerant circuit; refrigerant; a source of heat exchange fluid; heat exchange fluid circulating device and heat exchange fluid circuit for circulating the heat exchange fluid in heat exchange relationship with the refrigerant; and valves or switches for selecting the heat exchangers and direction of flow of the refrigerant therethrough for selecting a particular mode of operation. The heat exchange fluid provides energy for defrosting the second heat exchanger when operating in the air source mode and also provides a alternate source of heat.
Technology Paths in Energy-Efficient and Sustainable Construction
DEFF Research Database (Denmark)
Holm, Jesper; Lund Sørensen, Runa Cecilie
2015-01-01
Various tehcnology paths and regimes, Building codes and standards in energy, eco and sustainable housing......Various tehcnology paths and regimes, Building codes and standards in energy, eco and sustainable housing...
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.
Path integral discussion for Smorodinsky-Winternitz potentials. Pt. 1
International Nuclear Information System (INIS)
Grosche, C.; Pogosyan, G.S.; Sissakian, A.N.
1994-02-01
Path integral formulations for the Smorodinsky-Winternitz potentials in two- and three-dimensional Euclidean space are presented. We mention all coordinate systems which separate the Smorodinsky-Winternitz potentials and state the corresponding path integral formulations. Whereas in many coordinate systems an explicit path integralformulation is not possible, we list in all soluble cases the path integral evaluations explicity in terms of the propagators and the spectral expansions into the wave-functions. (orig.)
Path probability of stochastic motion: A functional approach
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.
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.
Path integral measure for first-order and metric gravities
International Nuclear Information System (INIS)
Aros, Rodrigo; Contreras, Mauricio; Zanelli, Jorge
2003-01-01
The equivalence between the path integrals for first-order gravity and the standard torsion-free, metric gravity in 3 + 1 dimensions is analysed. Starting with the path integral for first-order gravity, the correct measure for the path integral of the metric theory is obtained
28 CFR 36.403 - Alterations: Path of travel.
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...
76 FR 17064 - Shared Use Path Accessibility Guidelines
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...
Generating Approximative Minimum Length Paths in 3D for UAVs
DEFF Research Database (Denmark)
Schøler, Flemming; la Cour-Harbo, Anders; Bisgaard, Morten
2012-01-01
We consider the challenge of planning a minimum length path from an initial position to a desired position for a rotorcraft. The path is found in a 3-dimensional Euclidean space containing a geometric obstacle. We base our approach on visibility graphs which have been used extensively for path pl...
A Path Space Extension for Robust Light Transport Simulation
DEFF Research Database (Denmark)
Hachisuka, Toshiya; Pantaleoni, Jacopo; Jensen, Henrik Wann
2012-01-01
We present a new sampling space for light transport paths that makes it possible to describe Monte Carlo path integration and photon density estimation in the same framework. A key contribution of our paper is the introduction of vertex perturbations, which extends the space of paths with loosely...
Extremal and Degree Conditions for Path Extendability in Digraphs
Zhang, Zan-Bo; Zhang, Xiaoyan; Broersma, Hajo; Lou, Dingjun
2017-01-01
In the study of cycles and paths, the meta-conjecture of Bondy that sufficient conditions for Hamiltonicity often imply pancyclicity has motivated research on the existence of cycles and paths of many lengths. Hendry further introduced the stronger concepts of cycle extendability and path
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 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)
Path Integration on the Upper Half-Plane
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.
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
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
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
Pedestrian paths: why path-dependence theory leaves health policy analysis lost in space.
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.
Noncommutative quantum electrodynamics in path integral framework
Energy Technology Data Exchange (ETDEWEB)
Bourouaine, S; Benslama, A [Departement de Physique, Faculte des Sciences, Universite Mentouri, Constantine (Algeria)
2005-08-19
In this paper, the dynamics of a relativistic particle of spin 1/2, interacting with an external electromagnetic field in noncommutative space, is studied in the path integral framework. By adopting the Fradkin-Gitman formulation, the exact Green's function in noncommutative space (NCGF) for the quadratic case of a constant electromagnetic field is computed, and it is shown that its form is similar to its counterpart given in commutative space. In addition, it is deduced that the effect of noncommutativity has the same effect as an additional constant field depending on a noncommutative {theta} matrix.
Noncommutative quantum electrodynamics in path integral framework
International Nuclear Information System (INIS)
Bourouaine, S; Benslama, A
2005-01-01
In this paper, the dynamics of a relativistic particle of spin 1/2, interacting with an external electromagnetic field in noncommutative space, is studied in the path integral framework. By adopting the Fradkin-Gitman formulation, the exact Green's function in noncommutative space (NCGF) for the quadratic case of a constant electromagnetic field is computed, and it is shown that its form is similar to its counterpart given in commutative space. In addition, it is deduced that the effect of noncommutativity has the same effect as an additional constant field depending on a noncommutative θ matrix
Feynman path integral and the interaction picture
International Nuclear Information System (INIS)
Pugh, R.E.
1986-01-01
The role of interaction-picture fields in the construction of coherent states and in the derivation of the Feynman path integral for interacting scalar quantum fields is examined. Special attention is paid to the dependence of the integrand on the intermediate times and it is shown that the Feynman rules are valid prior to taking the limit wherein the number of intermediate times goes to infinity; thus, this number does not act as a cutoff in divergent amplitudes. Specific normalization factors are determined
Technical Development Path for Gas Foil Bearings
Dellacorte, Christopher
2016-01-01
Foil gas bearings are in widespread commercial use in air cycle machines, turbocompressors and microturbine generators and are emerging in more challenging applications such as turbochargers, auxiliary power units and propulsion gas turbines. Though not well known, foil bearing technology is well over fifty years old. Recent technological developments indicate that their full potential has yet to be realized. This paper investigates the key technological developments that have characterized foil bearing advances. It is expected that a better understanding of foil gas bearing development path will aid in future development and progress towards more advanced applications.
Ductile Damage Evolution and Strain Path Dependency
International Nuclear Information System (INIS)
Tasan, C. C.; Hoefnagels, J. M. P.; Peerlings, R. H. J.; Geers, M. G. D.; ten Horn, C. H. L. J.; Vegter, H.
2007-01-01
Forming limit diagrams are commonly used in sheet metal industry to define the safe forming regions. These diagrams are built to define the necking strains of sheet metals. However, with the rise in the popularity of advance high strength steels, ductile fracture through damage evolution has also emerged as an important parameter in the determination of limit strains. In this work, damage evolution in two different steels used in the automotive industry is examined to observe the relationship between damage evolution and the strain path that is followed during the forming operation
Brexit na perspectiva do Path Dependency
Giorgio Romano Schutte
2018-01-01
Esta pesquisa analisou o Brexit em uma perspectiva histórica, focando a conturbada relação entre a Europa continental e o Reino Unido ao longo do século XX, com ênfase no período pós Segunda Guerra Mundial. Foi utilizado o conceito de path dependency para argumentar sobre o papel de fatores históricos e decisões do passado, embora tomados em outras circunstâncias, ainda com força para influenciar o presente, para entender o Brexit. A premissa básica que será apresentada no ensaio é que o Rein...
On the simplified path integral on spheres
Energy Technology Data Exchange (ETDEWEB)
Bastianelli, Fiorenzo [Universita di Bologna, Dipartimento di Fisica ed Astronomia, Bologna (Italy); INFN, Sezione di Bologna, Bologna (Italy); Albert-Einstein-Institut, Max-Planck-Institut fuer Gravitationsphysik, Golm (Germany); Corradini, Olindo [Universita degli Studi di Modena e Reggio Emilia, Dipartimento di Scienze Fisiche, Informatiche e Matematiche, Modena (Italy); INFN, Sezione di Bologna, Bologna (Italy); Albert-Einstein-Institut, Max-Planck-Institut fuer Gravitationsphysik, Golm (Germany)
2017-11-15
We have recently studied a simplified version of the path integral for a particle on a sphere, and more generally on maximally symmetric spaces, and proved that Riemann normal coordinates allow the use of a quadratic kinetic term in the particle action. The emerging linear sigma model contains a scalar effective potential that reproduces the effects of the curvature. We present here further details of the construction, and extend its perturbative evaluation to orders high enough to read off the type-A trace anomalies of a conformal scalar in dimensions d = 14 and d = 16. (orig.)
Path integral for multi-field inflation
Energy Technology Data Exchange (ETDEWEB)
Gong, Jinn-Ouk [Asia Pacific Center for Theoretical Physics, Pohang 37673 (Korea, Republic of); Department of Physics, Postech, Pohang 37673 (Korea, Republic of); Seo, Min-Seok [Center for Theoretical Physics of the Universe, Institute for Basic Science, 34051 Daejeon (Korea, Republic of); Shiu, Gary [Department of Physics, University of Wisconsin-Madison, Madison, WI 53706 (United States); Department of Physics & Institute for Advanced Study, Hong Kong University of Science and Technology, Clear Water Bay (Hong Kong)
2016-07-20
We develop the path integral formalism for studying cosmological perturbations in multi-field inflation, which is particularly well suited to study quantum theories with gauge symmetries such as diffeomorphism invariance. We formulate the gauge fixing conditions based on the Poisson brackets of the constraints, from which we derive two convenient gauges that are appropriate for multi-field inflation. We then adopt the in-in formalism to derive the most general expression for the power spectrum of the curvature perturbation including the corrections from the interactions of the curvature mode with other light degrees of freedom. We also discuss the contributions of the interactions to the bispectrum.
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
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
Line-of-Sight Path Following for Dubins Paths with Adaptive Sideslip Compensation of Drift Forces
DEFF Research Database (Denmark)
Fossen, Thor Inge; Pettersen, Kristin Ytterstad; Galeazzi, Roberto
2015-01-01
guidance law is intended for maneuvering in the horizontal-plane at given speeds and typical applications are marine craft, autonomous underwater vehicles (AUVs), unmanned aerial vehicles (UAVs) as well as other vehicles and craft where the goal is to follow a predefined parametrized curve without time......-sight (LOS) guidance principle used by ancient navigators, which is here extended to path following of Dubins paths. The unknown sideslip angle is treated as a constant parameter, which is estimated using an adaptation law. The equilibrium points of the cross-track and parameter estimation errors are proven...
Analysis of construction dynamic plan using fuzzy critical path method
Directory of Open Access Journals (Sweden)
Kurij Kazimir V.
2014-01-01
Full Text Available Critical Path Method (CPM technique has become widely recognized as valuable tool for the planning and scheduling large construction projects. The aim of this paper is to present an analytical method for finding the Critical Path in the precedence network diagram where the duration of each activity is represented by a trapezoidal fuzzy number. This Fuzzy Critical Path Method (FCPM uses a defuzzification formula for trapezoidal fuzzy number and applies it on the total float (slack time for each activity in the fuzzy precedence network to find the critical path. The method presented in this paper is very effective in determining the critical activities and finding the critical paths.
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
Automated path length and M56 measurements at Jefferson Lab
International Nuclear Information System (INIS)
Hardy, D.; Tang, J.; Legg, R.
1997-01-01
Accurate measurement of path length and path length changes versus momentum (M 56 ) are critical for maintaining minimum beam energy spread in the CEBAF (Continuous Electron Beam Accelerator Facility) accelerator at the Thomas Jefferson National Accelerator Facility (Jefferson Lab). The relative path length for each circuit of the beam (1256m) must be equal within 1.5 degrees of 1497 MHz RF phase. A relative path length measurement is made by measuring the relative phases of RF signals from a cavity that is separately excited for each pass of a 4.2 μs pulsed beam. This method distinguishes the path length to less than 0.5 path length error. The development of a VME based automated measurement system for path length and M 56 has contributed to faster machine setup time and has the potential for use as a feedback parameter for automated control
Path Dependency of High Pressure Phase Transformations
Cerreta, Ellen
2017-06-01
At high pressures titanium and zirconium are known to undergo a phase transformation from the hexagonal close packed (HCP), alpha-phase to the simple-hexagonal, omega-phase. Under conditions of shock loading, the high-pressure omega-phase can be retained upon release. It has been shown that temperature, peak shock stress, and texture can influence the transformation. Moreover, under these same loading conditions, plastic processes of slip and twinning are also affected by similar differences in the loading path. To understand this path dependency, in-situ velocimetry measurements along with post-mortem metallographic and neutron diffraction characterization of soft recovered specimens have been utilized to qualitatively understand the kinetics of transformation, quantify volume fraction of retained omega-phase and characterize the shocked alpha and omega-phases. Together the work described here can be utilized to map the non-equilibrium phase diagram for these metals and lend insight into the partitioning of plastic processes between phases during high pressure transformation. In collaboration with: Frank Addesssio, Curt Bronkhorst, Donald Brown, David Jones, Turab Lookman, Benjamin Morrow, Carl Trujillo, Los Alamos National Lab.; Juan Pablo Escobedo-Diaz, University of New South Wales; Paulo Rigg, Washington State University.
Diversion path analysis handbook. Volume I. Methodology
International Nuclear Information System (INIS)
Maltese, M.D.K.; Goodwin, K.E.; Schleter, J.C.
1976-10-01
Diversion Path Analysis (DPA) is a procedure for analyzing internal controls of a facility in order to identify vulnerabilities to successful diversion of material by an adversary. The internal covert threat is addressed but the results are also applicable to the external overt threat. The diversion paths are identified. Complexity parameters include records alteration or falsification, multiple removals of sub-threshold quantities, collusion, and access authorization of the individual. Indicators, or data elements and information of significance to detection of unprevented theft, are identified by means of DPA. Indicator sensitivity is developed in terms of the threshold quantity, the elapsed time between removal and indication and the degree of localization of facility area and personnel given by the indicator. Evaluation of facility internal controls in light of these sensitivities defines the capability of interrupting identified adversary action sequences related to acquisition of material at fixed sites associated with the identified potential vulnerabilities. Corrective measures can, in many cases, also be prescribed for management consideration and action. DPA theory and concepts have been developing over the last several years, and initial field testing proved both the feasibility and practicality of the procedure. Follow-on implementation testing verified the ability of facility personnel to perform DPA
Data Science in Radiology: A Path Forward.
Aerts, Hugo J W L
2018-02-01
Artificial intelligence (AI), especially deep learning, has the potential to fundamentally alter clinical radiology. AI algorithms, which excel in quantifying complex patterns in data, have shown remarkable progress in applications ranging from self-driving cars to speech recognition. The AI application within radiology, known as radiomics, can provide detailed quantifications of the radiographic characteristics of underlying tissues. This information can be used throughout the clinical care path to improve diagnosis and treatment planning, as well as assess treatment response. This tremendous potential for clinical translation has led to a vast increase in the number of research studies being conducted in the field, a number that is expected to rise sharply in the future. Many studies have reported robust and meaningful findings; however, a growing number also suffer from flawed experimental or analytic designs. Such errors could not only result in invalid discoveries, but also may lead others to perpetuate similar flaws in their own work. This perspective article aims to increase awareness of the issue, identify potential reasons why this is happening, and provide a path forward. Clin Cancer Res; 24(3); 532-4. ©2017 AACR . ©2017 American Association for Cancer Research.
Robotic Online Path Planning on Point Cloud.
Liu, Ming
2016-05-01
This paper deals with the path-planning problem for mobile wheeled- or tracked-robot which drive in 2.5-D environments, where the traversable surface is usually considered as a 2-D-manifold embedded in a 3-D ambient space. Specially, we aim at solving the 2.5-D navigation problem using raw point cloud as input. The proposed method is independent of traditional surface parametrization or reconstruction methods, such as a meshing process, which generally has high-computational complexity. Instead, we utilize the output of 3-D tensor voting framework on the raw point clouds. The computation of tensor voting is accelerated by optimized implementation on graphics computation unit. Based on the tensor voting results, a novel local Riemannian metric is defined using the saliency components, which helps the modeling of the latent traversable surface. Using the proposed metric, we prove that the geodesic in the 3-D tensor space leads to rational path-planning results by experiments. Compared to traditional methods, the results reveal the advantages of the proposed method in terms of smoothing the robot maneuver while considering the minimum travel distance.
Laser enrichment: a new path to proliferation
International Nuclear Information System (INIS)
Casper, B.M.
1977-01-01
The use of lasers to obtain enriched uranium is an easier and cheaper method than methods currently in use. The immediate concern is that it could promote easy access to nuclear weapons by countries that do not presently have them. Mr. Casper feels that the U.S. government is working against itself; while the State Department is seeking to block one path to proliferation, ERDA laboratories are developing new technology that could open another. The proliferation implications have not been factored in a serious way into the decisions to proceed with this research. It is also clear that the United States does not now have a comprehensive policy that deals with all potentially important paths to proliferation, including laser enrichment. Mr. Casper states that there is still time to stop and consider whether laser enrichment should be developed, in light of its broader consequences. But this will not happen if the decisions are left exclusively in the hands of those promoting the technology, the author says. It is just this sort of situation that prompted the creation of several government institutions to provide independent assessments of new technologies. The Office of Technology Assessment, the Nuclear Regulatory Commission, and the Arms Control and Disarmament Agency all have the authority to intervene. Laser enrichment provides a good test of these institutions and of the viability of the concept of technology assessment. The status, benefits and risks, and the policy needed on laser research are discussed
Quantum gravitation. The Feynman path integral approach
International Nuclear Information System (INIS)
Hamber, Herbert W.
2009-01-01
The book covers the theory of Quantum Gravitation from the point of view of Feynman path integrals. These provide a manifestly covariant approach in which fundamental quantum aspects of the theory such as radiative corrections and the renormalization group can be systematically and consistently addressed. The path integral method is suitable for both perturbative as well as non-perturbative studies, and is known to already provide a framework of choice for the theoretical investigation of non-abelian gauge theories, the basis for three of the four known fundamental forces in nature. The book thus provides a coherent outline of the present status of the theory gravity based on Feynman's formulation, with an emphasis on quantitative results. Topics are organized in such a way that the correspondence to similar methods and results in modern gauge theories becomes apparent. Covariant perturbation theory are developed using the full machinery of Feynman rules, gauge fixing, background methods and ghosts. The renormalization group for gravity and the existence of non-trivial ultraviolet fixed points are investigated, stressing a close correspondence with well understood statistical field theory models. Later the lattice formulation of gravity is presented as an essential tool towards an understanding of key features of the non-perturbative vacuum. The book ends with a discussion of contemporary issues in quantum cosmology such as scale dependent gravitational constants and quantum effects in the early universe. (orig.)
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...
Bad Luck When Joining the Shortest Queue
Blanc, J.P.C.
2008-01-01
A frequent observation in service systems with queues in parallel is that customers in other queues tend to be served faster than those in one’s own queue. This paper quantifies the probability that one’s service would have started earlier if one had joined another queue than the queue that was
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
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)
Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?
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.
A Graduated Cylinder Colorimeter: An Investigation of Path Length and the Beer-Lambert Law
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.
International Nuclear Information System (INIS)
Falabella, S.; Sanders, D.M.
1994-01-01
A continuous, cathodic arc ion source coupled to a macro-particle filter capable of separation or elimination of macro-particles from the ion flux produced by cathodic arc discharge is described. The ion source employs an axial magnetic field on a cathode (target) having tapered sides to confine the arc, thereby providing high target material utilization. A bent magnetic field is used to guide the metal ions from the target to the part to be coated. The macro-particle filter consists of two straight solenoids, end to end, but placed at 45 degree to one another, which prevents line-of-sight from the arc spot on the target to the parts to be coated, yet provides a path for ions and electrons to flow, and includes a series of baffles for trapping the macro-particles. 3 figures
Analysis Of Economic Motivation When Individuals Choose An Educational Path
Directory of Open Access Journals (Sweden)
Viktor Anatolyevich Koksharov
2015-03-01
Full Text Available The authors consider the economic motivations when individuals choose an educational path. This line of research is relevant from both, the point of view of science — research of economic behavior of an individual, and the point of view of practice — allows to increase efficiency of investments in a human capital. The authors have developed the economic and mathematical model of choice of optimum educational paths by individuals. The model is realized in the software and approved on real data on more than 5,5 thousand students. For the analysis of the importance of rational economic expectations when an educational path has to be chosen, the paths chosen by students is compared and the educational paths optimum from the point of view of economic rationality are calculated. The analysis of the results has showed that mainly, the choice of educational paths happens according to the economic motivations. On the considered selection, 66 % of prospective students have chosen an optimum path from the point of view of economic preferences. The most significant factor providing development of optimum educational paths is an expectation of higher income upon completion of education — 22 % of all educational paths, and a possibility of cost-cutting of educating or state-subsidized education — 12 %. In our opinion, one of the most important practical results of the research of optimum educational path is the need to consider expectations of students and prospective student when developing a state policy of investment in human capital.
Superconducting materials - the path to applications
Energy Technology Data Exchange (ETDEWEB)
Evetts, J E; Glowacki, B A [Interdisciplinary Research Centre in Superconductivity and Department of Materials Science, University of Cambridge, Pembroke Street, Cambridge CB2 3QZ (United Kingdom)
2000-05-01
As the application of high-temperature superconductivity gradually becomes a reality it is clear that painstaking incremental progress in the development of materials is the key to success. Superconducting materials can only be applied against an engineering specification that has to be determined for each particular application from the design requirements for economic viability and for operation and safety margins in service. As a consequence the type of research activity appropriate for the development and optimization of a conductor processing route varies depending on the maturity of the technology. In this overview the evolution of research activity will be followed from near market industry driven design and development of fully engineered conductors through to research on basic and enabling science for materials processing that is largely academic and curiosity driven. The most effective path to applications depends on a considered balance of research that is different for each conductor family depending on the state of maturity of the conductor processing route. (author)
Structural equation models from paths to networks
Westland, J Christopher
2015-01-01
This compact reference surveys the full range of available structural equation modeling (SEM) methodologies. It reviews applications in a broad range of disciplines, particularly in the social sciences where many key concepts are not directly observable. This is the first book to present SEM’s development in its proper historical context–essential to understanding the application, strengths and weaknesses of each particular method. This book also surveys the emerging path and network approaches that complement and enhance SEM, and that will grow in importance in the near future. SEM’s ability to accommodate unobservable theory constructs through latent variables is of significant importance to social scientists. Latent variable theory and application are comprehensively explained, and methods are presented for extending their power, including guidelines for data preparation, sample size calculation, and the special treatment of Likert scale data. Tables of software, methodologies and fit st...
Path integral approach to multidimensional quantum tunnelling
International Nuclear Information System (INIS)
Balantekin, A.B.; Takigawa, N.
1985-01-01
Path integral formulation of the coupled channel problem in the case of multidimensional quantum tunneling is presented and two-time influence functionals are introduced. The two-time influence functionals are calculated explicitly for the three simplest cases: Harmonic oscillators linearly or quadratically coupled to the translational motion and a system with finite number of equidistant energy levels linearly coupled to the translational motion. The effects of these couplings on the transmission probability are studied for two limiting cases, adiabatic case and when the internal system has a degenerate energy spectrum. The condition for the transmission probability to show a resonant structure is discussed and exemplified. Finally, the properties of the dissipation factor in the adiabatic limit and its correlation with the friction coefficient in the classically accessible region are studied
Mindfulness as a Path of Women's Empowerment
Directory of Open Access Journals (Sweden)
Nadja FURLAN ŠTANTE
2016-08-01
Full Text Available The paper brings together social mindfulness as a path of empowerment for women within its concept of the interrelatedness of all beings in the web of life. The paradigm of social mindfulness is thus established as the foundation of feminist spirituality. The focus of this work is on the possibility of applying the ethics of mindfulness as a paradigm to interpersonal interrelatedness. The relations among humans, nature, reason and emotion in self-development are confronted with the paradigm of mindfulness. This paper carries out a theoretical analysis of the possibility of integrating the paradigm of mindfulness with the paradigm of feminist spirituality. In this view, the paradigm shift toward integrating spiritual and social justice and ecological balance is examined. It also examines possibility of transformation of negative gender stereotypes with the help of mindfulness, loving kindness, compassion and ethics. From this point of view, the application of mindfulness in education (especially childhood, primary and secondary schools is considered.
Estimation of network path segment delays
Nichols, Kathleen Marie
2018-05-01
A method for estimation of a network path segment delay includes determining a scaled time stamp for each packet of a plurality of packets by scaling a time stamp for each respective packet to minimize a difference of at least one of a frequency and a frequency drift between a transport protocol clock of a host and a monitoring point. The time stamp for each packet is provided by the transport protocol clock of the host. A corrected time stamp for each packet is determined by removing from the scaled time stamp for each respective packet, a temporal offset between the transport protocol clock and the monitoring clock by minimizing a temporal delay variation of the plurality of packets traversing a segment between the host and the monitoring point.
Simulation of car movement along circular path
Fedotov, A. I.; Tikhov-Tinnikov, D. A.; Ovchinnikova, N. I.; Lysenko, A. V.
2017-10-01
Under operating conditions, suspension system performance changes which negatively affects vehicle stability and handling. The paper aims to simulate the impact of changes in suspension system performance on vehicle stability and handling. Methods. The paper describes monitoring of suspension system performance, testing of vehicle stability and handling, analyzes methods of suspension system performance monitoring under operating conditions. The mathematical model of a car movement along a circular path was developed. Mathematical tools describing a circular movement of a vehicle along a horizontal road were developed. Turning car movements were simulated. Calculation and experiment results were compared. Simulation proves the applicability of a mathematical model for assessment of the impact of suspension system performance on vehicle stability and handling.
Hot gas path component cooling system
Lacy, Benjamin Paul; Bunker, Ronald Scott; Itzel, Gary Michael
2014-02-18
A cooling system for a hot gas path component is disclosed. The cooling system may include a component layer and a cover layer. The component layer may include a first inner surface and a second outer surface. The second outer surface may define a plurality of channels. The component layer may further define a plurality of passages extending generally between the first inner surface and the second outer surface. Each of the plurality of channels may be fluidly connected to at least one of the plurality of passages. The cover layer may be situated adjacent the second outer surface of the component layer. The plurality of passages may be configured to flow a cooling medium to the plurality of channels and provide impingement cooling to the cover layer. The plurality of channels may be configured to flow cooling medium therethrough, cooling the cover layer.
Search for minimal paths in modified networks
International Nuclear Information System (INIS)
Yeh, W.-C.
2002-01-01
The problem of searching for all minimal paths (MPs) in a network obtained by modifying the original network, e.g. for network expansion or reinforcement, is discussed and solved in this study. The existing best-known method to solve this problem was a straightforward approach. It needed extensive comparison and verification, and failed to solve some special but important cases. Therefore, a more efficient, intuitive and generalized method to search for all MPs without an extensive research procedure is proposed. In this presentation, first we develop an intuitive algorithm based upon the reformation of all MPs in the original network to search for all MPs in a modified network. Next, the computational complexity of the proposed algorithm is analyzed and compared with the existing methods. Finally, examples illustrate how all MPs are generated in a modified network based upon the reformation of all of the MPs in the corresponding original network
Parallel paths to improve heart failure outcomes
DEFF Research Database (Denmark)
Albert, Nancy M.
2013-01-01
-based, heart failure guidelines improves clinical outcomes. Thus, nurses and patients are on parallel paths related to setting the foundation for improved self-care adherence in advanced heart failure. Through research, we found that nurses were not adequately prepared as heart failure educators...... and that patients did not believe they were able to control heart failure. In 2 educational intervention studies that aimed to help patients understand that they could control fluid management and follow a strict daily fluid limit, patients had improved clinical outcomes. Thus, misperceptions about heart failure......Gaps and disparities in delivery of heart failure education by nurses and performance in accomplishing self-care behaviors by patients with advanced heart failure may be factors in clinical decompensation and unplanned consumption of health care. Is nurse-led education effectively delivered before...