Zero-Slack, Noncritical Paths

Science.gov (United States)

Simons, Jacob V., Jr.

2017-01-01

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

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

OpenAIRE

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

2016-01-01

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

Path-dependent functions

International Nuclear Information System (INIS)

Khrapko, R.I.

1985-01-01

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

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

Science.gov (United States)

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

2016-01-01

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

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.

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

Science.gov (United States)

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

2018-04-01

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

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

Path integration quantization

International Nuclear Information System (INIS)

DeWitt-Morette, C.

1983-01-01

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

Reparametrization in the path integral

International Nuclear Information System (INIS)

Storchak, S.N.

1983-01-01

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

Unique Path Partitions

DEFF Research Database (Denmark)

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

2013-01-01

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

1927-IJBCS-Article-Abdou Maman Mansour

African Journals Online (AJOL)

hp

Six gommeraies des trois bassins gommiers du Niger ont été étudiées : Kiki et Kokoiyé dans le bassin gommier occidental, Bader Goula et Azzaî dans le bassin gommier central et Malam Mainari et N'Guel Kolo dans le bassin gommier oriental. L'objectif de l'étude est d'évaluer l'effet d'Acacia senegal sur la fertilité des.

Iterated Leavitt Path Algebras

International Nuclear Information System (INIS)

Hazrat, R.

2009-11-01

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

Path Dependence

DEFF Research Database (Denmark)

Madsen, Mogens Ove

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

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

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

Science.gov (United States)

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

2013-02-18

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

Path planning in changeable environments

NARCIS (Netherlands)

Nieuwenhuisen, D.

2007-01-01

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

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

Science.gov (United States)

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

2017-08-30

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

DiversePathsJ: diverse shortest paths for bioimage analysis.

Science.gov (United States)

Uhlmann, Virginie; Haubold, Carsten; Hamprecht, Fred A; Unser, Michael

2018-02-01

We introduce a formulation for the general task of finding diverse shortest paths between two end-points. Our approach is not linked to a specific biological problem and can be applied to a large variety of images thanks to its generic implementation as a user-friendly ImageJ/Fiji plugin. It relies on the introduction of additional layers in a Viterbi path graph, which requires slight modifications to the standard Viterbi algorithm rules. This layered graph construction allows for the specification of various constraints imposing diversity between solutions. The software allows obtaining a collection of diverse shortest paths under some user-defined constraints through a convenient and user-friendly interface. It can be used alone or be integrated into larger image analysis pipelines. http://bigwww.epfl.ch/algorithms/diversepathsj. michael.unser@epfl.ch or fred.hamprecht@iwr.uni-heidelberg.de. Supplementary data are available at Bioinformatics online. © The Author(s) 2017. Published by Oxford University Press.

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

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.

Hamiltonian path integrals

International Nuclear Information System (INIS)

Prokhorov, L.V.

1982-01-01

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

Spreading paths in partially observed social networks

Science.gov (United States)

Onnela, Jukka-Pekka; Christakis, Nicholas A.

2012-03-01

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

Spreading paths in partially observed social networks.

Science.gov (United States)

Onnela, Jukka-Pekka; Christakis, Nicholas A

2012-03-01

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

Symbolic PathFinder v7

DEFF Research Database (Denmark)

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

2014-01-01

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

MEASURING PATH DEPENDENCY

Directory of Open Access Journals (Sweden)

Peter Juhasz

2017-03-01

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

Path integration in conical space

International Nuclear Information System (INIS)

Inomata, Akira; Junker, Georg

2012-01-01

Quantum mechanics in conical space is studied by the path integral method. It is shown that the curvature effect gives rise to an effective potential in the radial path integral. It is further shown that the radial path integral in conical space can be reduced to a form identical with that in flat space when the discrete angular momentum of each partial wave is replaced by a specific non-integral angular momentum. The effective potential is found proportional to the squared mean curvature of the conical surface embedded in Euclidean space. The path integral calculation is compatible with the Schrödinger equation modified with the Gaussian and the mean curvature. -- Highlights: ► We study quantum mechanics on a cone by the path integral approach. ► The path integral depends only on the metric and the curvature effect is built in. ► The approach is consistent with the Schrödinger equation modified by an effective potential. ► The effective potential is found to be of the “Jensen–Koppe” and “da Costa” type.

Two dimensional simplicial paths

International Nuclear Information System (INIS)

Piso, M.I.

1994-07-01

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

Time optimal paths for high speed maneuvering

Energy Technology Data Exchange (ETDEWEB)

Reister, D.B.; Lenhart, S.M.

1993-01-01

Recent theoretical results have completely solved the problem of determining the minimum length path for a vehicle with a minimum turning radius moving from an initial configuration to a final configuration. Time optimal paths for a constant speed vehicle are a subset of the minimum length paths. This paper uses the Pontryagin maximum principle to find time optimal paths for a constant speed vehicle. The time optimal paths consist of sequences of axes of circles and straight lines. The maximum principle introduces concepts (dual variables, bang-bang solutions, singular solutions, and transversality conditions) that provide important insight into the nature of the time optimal paths. We explore the properties of the optimal paths and present some experimental results for a mobile robot following an optimal path.

Cooperative organic mine avoidance path planning

Science.gov (United States)

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

2005-06-01

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

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

International Nuclear Information System (INIS)

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

1984-01-01

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

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.

On the structure of path-like trees

OpenAIRE

Muntaner Batle, Francesc Antoni; Rius Font, Miquel

2007-01-01

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

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

NARCIS (Netherlands)

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

2008-01-01

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

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.

Optimal Paths in Gliding Flight

Science.gov (United States)

Wolek, Artur

Underwater gliders are robust and long endurance ocean sampling platforms that are increasingly being deployed in coastal regions. This new environment is characterized by shallow waters and significant currents that can challenge the mobility of these efficient (but traditionally slow moving) vehicles. This dissertation aims to improve the performance of shallow water underwater gliders through path planning. The path planning problem is formulated for a dynamic particle (or "kinematic car") model. The objective is to identify the path which satisfies specified boundary conditions and minimizes a particular cost. Several cost functions are considered. The problem is addressed using optimal control theory. The length scales of interest for path planning are within a few turn radii. First, an approach is developed for planning minimum-time paths, for a fixed speed glider, that are sub-optimal but are guaranteed to be feasible in the presence of unknown time-varying currents. Next the minimum-time problem for a glider with speed controls, that may vary between the stall speed and the maximum speed, is solved. Last, optimal paths that minimize change in depth (equivalently, maximize range) are investigated. Recognizing that path planning alone cannot overcome all of the challenges associated with significant currents and shallow waters, the design of a novel underwater glider with improved capabilities is explored. A glider with a pneumatic buoyancy engine (allowing large, rapid buoyancy changes) and a cylindrical moving mass mechanism (generating large pitch and roll moments) is designed, manufactured, and tested to demonstrate potential improvements in speed and maneuverability.

Cooperative path planning of unmanned aerial vehicles

CERN Document Server

Tsourdos, Antonios; Shanmugavel, Madhavan

2010-01-01

An invaluable addition to the literature on UAV guidance and cooperative control, Cooperative Path Planning of Unmanned Aerial Vehicles is a dedicated, practical guide to computational path planning for UAVs. One of the key issues facing future development of UAVs is path planning: it is vital that swarm UAVs/ MAVs can cooperate together in a coordinated manner, obeying a pre-planned course but able to react to their environment by communicating and cooperating. An optimized path is necessary in order to ensure a UAV completes its mission efficiently, safely, and successfully. Focussing on the path planning of multiple UAVs for simultaneous arrival on target, Cooperative Path Planning of Unmanned Aerial Vehicles also offers coverage of path planners that are applicable to land, sea, or space-borne vehicles. Cooperative Path Planning of Unmanned Aerial Vehicles is authored by leading researchers from Cranfield University and provides an authoritative resource for researchers, academics and engineers working in...

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

Science.gov (United States)

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

2014-12-01

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

Strain path dependency in metal plasticity

NARCIS (Netherlands)

Viatkina, E.M.; Brekelmans, W.A.M.; Geers, M.G.D.

2003-01-01

A change in strain path has a significant effect on the mechanical response of metals. Strain path change effects physically originate from a complex microstructure evolution. This paper deals with the contribution of cell structure evolution to the strain path change effect. The material with cells

Path-Goal Theory of Leadership

Science.gov (United States)

1975-04-01

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

Path integral in Snyder space

Energy Technology Data Exchange (ETDEWEB)

Mignemi, S., E-mail: smignemi@unica.it [Dipartimento di Matematica e Informatica, Università di Cagliari, Viale Merello 92, 09123 Cagliari (Italy); INFN, Sezione di Cagliari, Cittadella Universitaria, 09042 Monserrato (Italy); Štrajn, R. [Dipartimento di Matematica e Informatica, Università di Cagliari, Viale Merello 92, 09123 Cagliari (Italy); INFN, Sezione di Cagliari, Cittadella Universitaria, 09042 Monserrato (Italy)

2016-04-29

The definition of path integrals in one- and two-dimensional Snyder space is discussed in detail both in the traditional setting and in the first-order formalism of Faddeev and Jackiw. - Highlights: • The definition of the path integral in Snyder space is discussed using phase space methods. • The same result is obtained in the first-order formalism of Faddeev and Jackiw. • The path integral formulation of the two-dimensional Snyder harmonic oscillator is outlined.

Path integral in Snyder space

International Nuclear Information System (INIS)

Mignemi, S.; Štrajn, R.

2016-01-01

The definition of path integrals in one- and two-dimensional Snyder space is discussed in detail both in the traditional setting and in the first-order formalism of Faddeev and Jackiw. - Highlights: • The definition of the path integral in Snyder space is discussed using phase space methods. • The same result is obtained in the first-order formalism of Faddeev and Jackiw. • The path integral formulation of the two-dimensional Snyder harmonic oscillator is outlined.

Leavitt path algebras

CERN Document Server

Abrams, Gene; Siles Molina, Mercedes

2017-01-01

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

Paths correlation matrix.

Science.gov (United States)

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

2015-09-15

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

Techniques and applications of path integration

CERN Document Server

Schulman, L S

2005-01-01

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

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

DEFF Research Database (Denmark)

Kaplan, Sigal; Prato, Carlo Giacomo

2010-01-01

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

Isomorphisms and traversability of directed path graphs

NARCIS (Netherlands)

Broersma, Haitze J.; Li, Xueliang; Li, X.

1998-01-01

The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\\forw P_k(D)$ of a digraph $D$ is obtained by representing the directed paths on $k$ vertices of $D$ by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in $D$

Graphs with not all possible path-kernels

DEFF Research Database (Denmark)

Aldred, Robert; Thomassen, Carsten

2004-01-01

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

Design of Active N-path Filters

NARCIS (Netherlands)

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

2013-01-01

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

Path integrals and geometry of trajectories

International Nuclear Information System (INIS)

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

1990-01-01

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

Perfect discretization of path integrals

International Nuclear Information System (INIS)

Steinhaus, Sebastian

2012-01-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

Perfect discretization of path integrals

Science.gov (United States)

Steinhaus, Sebastian

2012-05-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

On Hilbert space of paths

International Nuclear Information System (INIS)

Exner, P.; Kolerov, G.I.

1980-01-01

A Hilbert space of paths, the elements of which are determined by trigonometric series, was proposed and used recently by Truman. This space is shown to consist precisely of all absolutely continuous paths ending in the origin with square-integrable derivatives

Tool path in torus tool CNC machining

Directory of Open Access Journals (Sweden)

XU Ying

2016-10-01

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

Path Creation

DEFF Research Database (Denmark)

Karnøe, Peter; Garud, Raghu

2012-01-01

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

How to solve path integrals in quantum mechanics

International Nuclear Information System (INIS)

Grosche, C.

1994-10-01

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

Path integrals for arbitrary canonical transformations

International Nuclear Information System (INIS)

Oliveira, L.A.R. de.

1980-01-01

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

Indications, outcome and complications of ureteroscopy, at Gezira ...

African Journals Online (AJOL)

Indications, outcome and complications of ureteroscopy, at Gezira Hospital for renal diseases and surgery, Sudan: a seven years 'experience. Mustafa O. Mansour, Sami M. Taha, Abd Elmahmood Abdallah, Mohammed El Imam ...

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

International Nuclear Information System (INIS)

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

2013-01-01

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

Path Integral Formulation of Anomalous Diffusion Processes

OpenAIRE

Friedrich, Rudolf; Eule, Stephan

2011-01-01

We present the path integral formulation of a broad class of generalized diffusion processes. Employing the path integral we derive exact expressions for the path probability densities and joint probability distributions for the class of processes under consideration. We show that Continuous Time Random Walks (CTRWs) are included in our framework. A closed expression for the path probability distribution of CTRWs is found in terms of their waiting time distribution as the solution of a Dyson ...

Strategic Team AI Path Plans: Probabilistic Pathfinding

Directory of Open Access Journals (Sweden)

Tng C. H. John

2008-01-01

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

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

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

Path integration on hyperbolic spaces

Energy Technology Data Exchange (ETDEWEB)

Grosche, C [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik

1991-11-01

Quantum mechanics on the hyperbolic spaces of rank one is discussed by path integration technique. Hyperbolic spaces are multi-dimensional generalisation of the hyperbolic plane, i.e. the Poincare upper half-plane endowed with a hyperbolic geometry. We evalute the path integral on S{sub 1} {approx equal} SO (n,1)/SO(n) and S{sub 2} {approx equal} SU(n,1)/S(U(1) x U(n)) in a particular coordinate system, yielding explicitly the wave-functions and the energy spectrum. Futhermore we can exploit a general property of all these spaces, namely that they can be parametrized by a pseudopolar coordinate system. This allows a separation in path integration over spheres and an additional path integration over the remaining hyperbolic coordinate, yielding effectively a path integral for a modified Poeschl-Teller potential. Only continuous spectra can exist in all the cases. For all the hyperbolic spaces of rank one we find a general formula for the largest lower bound (zero-point energy) of the spectrum which is given by E{sub O} = h{sup 2} /8m(m{sub {alpha}} +2m{sub 2} {alpha}){sup 2} (m {alpha} and m{sub 2}{alpha} denote the dimension of the root subspace corresponding to the roots {alpha} and 2{alpha}, respectively). I also discuss the case, where a constant magnetic field on H{sup n} is incorporated. (orig.).

Path integration on hyperbolic spaces

International Nuclear Information System (INIS)

Grosche, C.

1991-11-01

Quantum mechanics on the hyperbolic spaces of rank one is discussed by path integration technique. Hyperbolic spaces are multi-dimensional generalisation of the hyperbolic plane, i.e. the Poincare upper half-plane endowed with a hyperbolic geometry. We evalute the path integral on S 1 ≅ SO (n,1)/SO(n) and S 2 ≅ SU(n,1)/S[U(1) x U(n)] in a particular coordinate system, yielding explicitly the wave-functions and the energy spectrum. Futhermore we can exploit a general property of all these spaces, namely that they can be parametrized by a pseudopolar coordinate system. This allows a separation in path integration over spheres and an additional path integration over the remaining hyperbolic coordinate, yielding effectively a path integral for a modified Poeschl-Teller potential. Only continuous spectra can exist in all the cases. For all the hyperbolic spaces of rank one we find a general formula for the largest lower bound (zero-point energy) of the spectrum which is given by E O = h 2 /8m(m α +2m 2 α) 2 (m α and m 2 α denote the dimension of the root subspace corresponding to the roots α and 2α, respectively). I also discuss the case, where a constant magnetic field on H n is incorporated. (orig.)

Improved initial guess for minimum energy path calculations

International Nuclear Information System (INIS)

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

2014-01-01

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

Towards understanding the known-key security of block ciphers

DEFF Research Database (Denmark)

Andreeva, Elena; Bogdanov, Andrey; Mennink, Bart

2014-01-01

ciphers based on ideal components such as random permutations and random functions as well as propose new generic known-key attacks on generalized Feistel ciphers. We introduce the notion of known-key indifferentiability to capture the security of such block ciphers under a known key. To show its...... meaningfulness, we prove that the known-key attacks on block ciphers with ideal primitives to date violate security under known-key indifferentiability. On the other hand, to demonstrate its constructiveness, we prove the balanced Feistel cipher with random functions and the multiple Even-Mansour cipher...... with random permutations known-key indifferentiable for a sufficient number of rounds. We note that known-key indifferentiability is more quickly and tightly attained by multiple Even-Mansour which puts it forward as a construction provably secure against known-key attacks....

Path Integration on the Upper Half-Plane

OpenAIRE

Reijiro, KUBO; Research Institute for Theoretical Physics Hiroshima University

1987-01-01

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

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

Science.gov (United States)

Brown, Lawrence D

2010-08-01

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

The Thinnest Path Problem

Science.gov (United States)

2016-07-22

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

Curvature-Continuous 3D Path-Planning Using QPMI Method

Directory of Open Access Journals (Sweden)

Seong-Ryong Chang

2015-06-01

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

Path integration on the upper half-plane

International Nuclear Information System (INIS)

Kubo, Reijiro.

1987-06-01

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

Chromatic roots and hamiltonian paths

DEFF Research Database (Denmark)

Thomassen, Carsten

2000-01-01

We present a new connection between colorings and hamiltonian paths: If the chromatic polynomial of a graph has a noninteger root less than or equal to t(n) = 2/3 + 1/3 (3)root (26 + 6 root (33)) + 1/3 (3)root (26 - 6 root (33)) = 1.29559.... then the graph has no hamiltonian path. This result...

Path diversity improves the identification of influential spreaders

Science.gov (United States)

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

2013-12-01

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

Electron Inelastic-Mean-Free-Path Database

Science.gov (United States)

SRD 71 NIST Electron Inelastic-Mean-Free-Path Database (PC database, no charge)   This database provides values of electron inelastic mean free paths (IMFPs) for use in quantitative surface analyses by AES and XPS.

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

International Nuclear Information System (INIS)

Fulton, J.C.

1994-10-01

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

Understanding and applying open-path optical sensing data

Science.gov (United States)

Virag, Peter; Kricks, Robert J.

1999-02-01

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

Unusual bond paths in organolithium compounds

International Nuclear Information System (INIS)

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

1986-01-01

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

Two-path plasmonic interferometer with integrated detector

Science.gov (United States)

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

2016-03-29

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

Egyptian Journal of Medical Human Genetics - Vol 9, No 1 (2008)

African Journals Online (AJOL)

Indicators of Apoptosis in Duchenne Muscular Dystrophy Patients · EMAIL FREE FULL TEXT EMAIL FREE FULL TEXT DOWNLOAD FULL TEXT DOWNLOAD FULL TEXT. E Abdel-Salam, L Mansour, I Abdel-Meguid, S Korraa, 41-50 ...

Optimization of educational paths for higher education

Science.gov (United States)

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

2017-11-01

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

Path operator algebras in conformal quantum field theories

International Nuclear Information System (INIS)

Roesgen, M.

2000-10-01

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

Computing the optimal path in stochastic dynamical systems

International Nuclear Information System (INIS)

Bauver, Martha; Forgoston, Eric; Billings, Lora

2016-01-01

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

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

Science.gov (United States)

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

2017-07-01

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

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

Path Integrals in Quantum Mechanics

International Nuclear Information System (INIS)

Louko, J

2005-01-01

Jean Zinn-Justin's textbook Path Integrals in Quantum Mechanics aims to familiarize the reader with the path integral as a calculational tool in quantum mechanics and field theory. The emphasis is on quantum statistical mechanics, starting with the partition function Tr exp(-β H) and proceeding through the diffusion equation to barrier penetration problems and their semiclassical limit. The 'real time' path integral is defined via analytic continuation and used for the path-integral representation of the nonrelativistic S-matrix and its perturbative expansion. Holomorphic and Grassmannian path integrals are introduced and applied to nonrelativistic quantum field theory. There is also a brief discussion of path integrals in phase space. The introduction includes a brief historical review of path integrals, supported by a bibliography with some 40 entries. As emphasized in the introduction, mathematical rigour is not a central issue in the book. This allows the text to present the calculational techniques in a very readable manner: much of the text consists of worked-out examples, such as the quartic anharmonic oscillator in the barrier penetration chapter. At the end of each chapter there are exercises, some of which are of elementary coursework type, but the majority are more in the style of extended examples. Most of the exercises indeed include the solution or a sketch thereof. The book assumes minimal previous knowledge of quantum mechanics, and some basic quantum mechanical notation is collected in an appendix. The material has a large overlap with selected chapters in the author's thousand-page textbook Quantum Field Theory and Critical Phenomena (2002 Oxford: Clarendon). The stand-alone scope of the present work has, however, allowed a more focussed organization of this material, especially in the chapters on, respectively, holomorphic and Grassmannian path integrals. In my view the book accomplishes its aim admirably and is eminently usable as a textbook

76 FR 17064 - Shared Use Path Accessibility Guidelines

Science.gov (United States)

2011-03-28

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

A focussed dynamic path finding algorithm with constraints

CSIR Research Space (South Africa)

Leenen, L

2013-11-01

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

Path probability of stochastic motion: A functional approach

Science.gov (United States)

Hattori, Masayuki; Abe, Sumiyoshi

2016-06-01

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

The initial experience of trans-rectal ultrasound and biopsy in ...

African Journals Online (AJOL)

The initial experience of trans-rectal ultrasound and biopsy in diagnosis of carcinoma prostate in Gezira Hospital for Renal Disease and Surgery (GHRDS). Walaa Eldin Ibraheem, Sami Mahjoub Taha, Mustafa Omran Mansour, Mohammed El Imam Mohamed Ahmed ...

Land-mobile satellite excess path loss measurements

Science.gov (United States)

Hess, G. C.

1980-05-01

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

Perfect discretization of reparametrization invariant path integrals

International Nuclear Information System (INIS)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-01-01

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

Perfect discretization of reparametrization invariant path integrals

Science.gov (United States)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-05-01

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

Path integral for relativistic particle theory

International Nuclear Information System (INIS)

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

1990-06-01

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

Positroids Induced by Rational Dyck Paths

OpenAIRE

Gotti, Felix

2017-01-01

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

Realizing spaces as path-component spaces

OpenAIRE

Banakh, Taras; Brazas, Jeremy

2018-01-01

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

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

Science.gov (United States)

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

2017-07-01

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

Purely geometric path integral for spin-foams

International Nuclear Information System (INIS)

Shirazi, Atousa Chaharsough; Engle, Jonathan

2014-01-01

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

Acquisition Path Analysis as a Collaborative Activity

International Nuclear Information System (INIS)

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

2015-01-01

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

Prediction of crack paths in WC-Co alloys

International Nuclear Information System (INIS)

Spiegler, R.; Fischmeister, H.F.

1992-01-01

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

Quantum cosmology based on discrete Feynman paths

International Nuclear Information System (INIS)

Chew, Geoffrey F.

2002-01-01

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

Path dependence and creation

DEFF Research Database (Denmark)

Garud, Raghu; Karnøe, Peter

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

Strain path and work-hardening behavior of brass

International Nuclear Information System (INIS)

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

2009-01-01

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

Journal of Genetics | Indian Academy of Sciences

Indian Academy of Sciences (India)

Author Affiliations. HASSAN MANSOUR1 TOMAS BRYNGELSSON2 LARISA GARKAVA-GUSTAVSSON2. Faculty of Science, Department of Botany, Suez Canal University, 41522 Ismailia, Egypt; Department of Plant Breeding, Swedish University of Agricultural Sciences, Alnarp SE-230 53, Sweden ...

Perfect discretization of path integrals

OpenAIRE

Steinhaus, Sebastian

2011-01-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discu...

28 CFR 36.403 - Alterations: Path of travel.

Science.gov (United States)

2010-07-01

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

Paths and cycles in colored graphs

NARCIS (Netherlands)

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

2001-01-01

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

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

International Nuclear Information System (INIS)

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

2017-01-01

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

The formal path integral and quantum mechanics

International Nuclear Information System (INIS)

Johnson-Freyd, Theo

2010-01-01

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

A New Method of Global Path Planning for AGV

Institute of Scientific and Technical Information of China (English)

SHI En-xiu; HUANG Yu-mei

2006-01-01

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

Phase-space path-integral calculation of the Wigner function

International Nuclear Information System (INIS)

Samson, J H

2003-01-01

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

PATHS groundwater hydrologic model

Energy Technology Data Exchange (ETDEWEB)

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

1980-04-01

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

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.

Special cases of the quadratic shortest path problem

NARCIS (Netherlands)

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

Differential neural network configuration during human path integration

Science.gov (United States)

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

2014-01-01

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

A Key Event Path Analysis Approach for Integrated Systems

Directory of Open Access Journals (Sweden)

Jingjing Liao

2012-01-01

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

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

Science.gov (United States)

Takizawa, Ken; Beaucamp, Anthony

2017-09-18

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

Evaluation of Calcine Disposition Path Forward

International Nuclear Information System (INIS)

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

2003-01-01

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

Path probabilities of continuous time random walks

International Nuclear Information System (INIS)

Eule, Stephan; Friedrich, Rudolf

2014-01-01

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

Path-integral approach to resonant electron-molecule scattering

International Nuclear Information System (INIS)

Winterstetter, M.; Domcke, W.

1993-01-01

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

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

Science.gov (United States)

Nugraha, A. T.; Agustinah, T.

2018-01-01

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

Bosonic path integral for spin-1/2 particles

International Nuclear Information System (INIS)

Jacobson, T.

1989-01-01

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

Forces in Motzkin paths in a wedge

International Nuclear Information System (INIS)

Janse van Rensburg, E J

2006-01-01

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

A middle path for electricity options and sustainable development

International Nuclear Information System (INIS)

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

1994-01-01

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

Computing Diffeomorphic Paths for Large Motion Interpolation.

Science.gov (United States)

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

2013-06-01

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

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

Preparation and tomographic reconstruction of an arbitrary single-photon path qubit

International Nuclear Information System (INIS)

Baek, So-Young; Kim, Yoon-Ho

2011-01-01

We report methods for preparation and tomographic reconstruction of an arbitrary single-photon path qubit. The arbitrary single-photon path qubit is prepared losslessly by passing the heralded single-photon state from spontaneous parametric down-conversion through variable beam splitter. Quantum state tomography of the single-photon path qubit is implemented by introducing path-projection measurements based on the first-order single-photon quantum interference. Using the state preparation and path-projection measurements methods for the single-photon path qubit, we demonstrate preparation and complete tomographic reconstruction of the single-photon path qubit with arbitrary purity. -- Highlights: → We report methods for preparation and tomographic reconstruction of an arbitrary single-photon path qubit. → We implement path-projection measurements based on the first-order single-photon quantum interference. → We demonstrate preparation and complete tomographic reconstruction of the single-photon path qubit with arbitrary purity.

Walking paths to and from a goal differ: on the role of bearing angle in the formation of human locomotion paths.

Directory of Open Access Journals (Sweden)

Manish Sreenivasa

Full Text Available The path that humans take while walking to a goal is the result of a cognitive process modulated by the perception of the environment and physiological constraints. The path shape and timing implicitly embeds aspects of the architecture behind this process. Here, locomotion paths were investigated during a simple task of walking to and from a goal, by looking at the evolution of the position of the human on a horizontal (x,y plane. We found that the path while walking to a goal was not the same as that while returning from it. Forward-return paths were systematically separated by 0.5-1.9m, or about 5% of the goal distance. We show that this path separation occurs as a consequence of anticipating the desired body orientation at the goal while keeping the target in view. The magnitude of this separation was strongly influenced by the bearing angle (difference between body orientation and angle to goal and the final orientation imposed at the goal. This phenomenon highlights the impact of a trade-off between a directional perceptual apparatus-eyes in the head on the shoulders-and and physiological limitations, in the formation of human locomotion paths. Our results give an insight into the influence of environmental and perceptual variables on human locomotion and provide a basis for further mathematical study of these mechanisms.

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

Social network analysis using k-Path centrality method

Science.gov (United States)

Taniarza, Natya; Adiwijaya; Maharani, Warih

2018-03-01

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

Path Planning Method in Multi-obstacle Marine Environment

Science.gov (United States)

Zhang, Jinpeng; Sun, Hanxv

2017-12-01

In this paper, an improved algorithm for particle swarm optimization is proposed for the application of underwater robot in the complex marine environment. Not only did consider to avoid obstacles when path planning, but also considered the current direction and the size effect on the performance of the robot dynamics. The algorithm uses the trunk binary tree structure to construct the path search space and A * heuristic search method is used in the search space to find a evaluation standard path. Then the particle swarm algorithm to optimize the path by adjusting evaluation function, which makes the underwater robot in the current navigation easier to control, and consume less energy.

Lifetime and Path Length of the Virtual Particle

International Nuclear Information System (INIS)

Lyuboshitz, V.L.; Lyuboshitz, V.V.

2005-01-01

The concepts of the lifetime and path length of a virtual particle are introduced. It is shown that, near the mass surface of the real particle, these quantities constitute a 4-vector. At very high energies, the virtual particle can propagate over considerable (even macroscopic) distances. The formulas for the lifetime and path length of an ultrarelativistic virtual electron in the process of bremsstrahlung in the Coulomb field of a nucleus are obtained. The lifetime and path length of the virtual photon at its conversion into an electron-positron pair are discussed. The connection between the path length of the virtual particle and the coherence length (formation length) is analyzed

Feasible Path Generation Using Bezier Curves for Car-Like Vehicle

Science.gov (United States)

Latip, Nor Badariyah Abdul; Omar, Rosli

2017-08-01

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

Points-Based Safe Path Planning of Continuum Robots

Directory of Open Access Journals (Sweden)

Khuram Shahzad

2015-07-01

Full Text Available Continuum robots exhibit great potential in a number of challenging applications where traditional rigid link robots pose certain limitations, e.g., working in unstructured environments. In order to enable the usage of continuum robots in safety-critical applications, such as surgery and nuclear decontamination, it is extremely important to ensure a safe path for the robot's movement. Existing algorithms for continuum robot path planning have certain limitations that need to be addressed. These include the fact that none of the algorithms provide safety assurance parameters and control for path planning. They are computationally expensive, applicable to a specific type of continuum robots, and mostly they do not incorporate design and kinematics constraints. In this paper, we propose a points-based path planning (PoPP algorithm for continuum robots that computes the path by imposing safety constraints and improves upon the limitations of existing approaches. In the algorithm, we exploit the constant curvature-bending property of continuum robots in their path planning process. The algorithm is computationally efficient and provides a good tradeoff between accuracy and efficiency that can be implemented to enable the safety-critical application of continuum robots. This algorithm also provides information regarding path volume and flexibility in movement. Simulation results confirm that the algorithm possesses promising potential for all types of continuum robots (following the constant curvature-bending property. We believe that this effectively balances the desired safety and efficiency requirements.

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

Extremal and Degree Conditions for Path Extendability in Digraphs

NARCIS (Netherlands)

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

Teleconnection Paths via Climate Network Direct Link Detection.

Science.gov (United States)

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

2015-12-31

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

Survey of Robot 3D Path Planning Algorithms

Directory of Open Access Journals (Sweden)

Liang Yang

2016-01-01

Full Text Available Robot 3D (three-dimension path planning targets for finding an optimal and collision-free path in a 3D workspace while taking into account kinematic constraints (including geometric, physical, and temporal constraints. The purpose of path planning, unlike motion planning which must be taken into consideration of dynamics, is to find a kinematically optimal path with the least time as well as model the environment completely. We discuss the fundamentals of these most successful robot 3D path planning algorithms which have been developed in recent years and concentrate on universally applicable algorithms which can be implemented in aerial robots, ground robots, and underwater robots. This paper classifies all the methods into five categories based on their exploring mechanisms and proposes a category, called multifusion based algorithms. For all these algorithms, they are analyzed from a time efficiency and implementable area perspective. Furthermore a comprehensive applicable analysis for each kind of method is presented after considering their merits and weaknesses.

Path entanglement of photons by non-local bunching

International Nuclear Information System (INIS)

Eisenberg, H.; Hodelin, J.; Khoury, G.; Bouwmeester, D.

2005-01-01

Full Text:Path entangled photon states can be used to overcome classical limits on the accuracy of interferometric measurements such as the diffraction limit. These states are superpositions of finding n photons in one out of two (or more) paths. Using stimulated parametric down-conversion, we propose and demonstrate a method for generating heralded multiphoton path entanglement, without applying post-selection. parametric down-conversion is relatively easy to produce compared to pure Fock states as demanded by other proposals. By a special coincidence detection at one down converted arm, the photons of the second arm non-locally bunch into the desired state. Entanglement in photon number is created between two polarization modes rather than two paths. A polarization beam-splitter and a 2 wave plate can translate between the two representations. The experimental generation of a two-photon path entangled state was detected by observing interference at half the photon wavelength. The scheme is generally extendable to higher photon numbers

Tornado intensity estimated from damage path dimensions.

Science.gov (United States)

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.

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.

A fast spectrum dual path flow cermet reactor

International Nuclear Information System (INIS)

Anghaie, S.; Feller, G.J.; Peery, S.D.; Parsley, R.C.

1993-01-01

A cermet fueled, dual path fast reactor for space nuclear propulsion applications is conceptually designed. The reactor utilizes an outer annulus core and an inner cylindrical core with radial and axial reflector. The dual path flow minimizes the impact of power peaking near the radial reflector. Basic neutronics and core design aspects of the reactor are discussed. The dual path reactor is integrated into a 25000 lbf thrust nuclear rocket

Polymer quantum mechanics some examples using path integrals

International Nuclear Information System (INIS)

Parra, Lorena; Vergara, J. David

2014-01-01

In this work we analyze several physical systems in the context of polymer quantum mechanics using path integrals. First we introduce the group averaging method to quantize constrained systems with path integrals and later we use this procedure to compute the effective actions for the polymer non-relativistic particle and the polymer harmonic oscillator. We analyze the measure of the path integral and we describe the semiclassical dynamics of the systems

From path integrals to anyons

International Nuclear Information System (INIS)

Canright, G.S.

1992-01-01

I offer a pedagogical review of the homotopy arguments for fractional statistics in two dimensions. These arguments arise naturally in path-integral language since they necessarily consider the properties of paths rather than simply permutations. The braid group replaces the permutation group as the basic structure for quantum statistics; hence properties of the braid group on several surfaces are briefly discussed. Finally, the question of multiple (real-space) occupancy is addressed; I suggest that the ''traditional'' treatment of this question (ie, an assumption that many-anyon wavefunctions necessarily vanish for multiple occupancy) needs reexamination

Multiagent path-finding in strategic games

OpenAIRE

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.

Multi-rate path-following control for unmanned air vehicles

NARCIS (Netherlands)

Guerreiro Tome Antunes, D.J.; Silvestre, C.J.; Cunha, R.

2008-01-01

A methodology is provided to tackle the path-following integrated guidance and control problem for unmanned air vehicles with measured outputs available at different rates. The path-following problem is addressed by defining a suitable non-linear path dependent error space to express the vehicle’s

Space-efficient path-reporting approximate distance oracles

DEFF Research Database (Denmark)

Elkin, Michael; Neiman, Ofer; Wulff-Nilsen, Christian

2016-01-01

We consider approximate path-reporting distance oracles, distance labeling and labeled routing with extremely low space requirements, for general undirected graphs. For distance oracles, we show how to break the nlog⁡n space bound of Thorup and Zwick if approximate paths rather than distances need...

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.

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

Minimum dose method for walking-path planning of nuclear facilities

International Nuclear Information System (INIS)

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

2015-01-01

Highlights: • For radiation environment, the environment model is proposed. • For the least dose walking path problem, a path-planning method is designed. • The path-planning virtual–real mixed simulation program is developed. • The program can plan walking path and simulate. - Abstract: A minimum dose method based on staff walking road network model was proposed for the walking-path planning in nuclear facilities. A virtual–reality simulation program was developed using C# programming language and Direct X engine. The simulation program was used in simulations dealing with virtual nuclear facilities. Simulation results indicated that the walking-path planning method was effective in providing safety for people walking in nuclear facilities

Sudan Journal of Medical Sciences - Vol 11, No 4 (2016)

African Journals Online (AJOL)

Indications, outcome and complications of ureteroscopy, at Gezira Hospital for renal diseases and surgery, Sudan: a seven years 'experience · EMAIL FULL TEXT EMAIL FULL TEXT DOWNLOAD FULL TEXT DOWNLOAD FULL TEXT. Mustafa O. Mansour, Sami M. Taha, Abd Elmahmood Abdallah, Mohammed El Imam ...

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

Variational nature, integration, and properties of Newton reaction path.

Science.gov (United States)

Bofill, Josep Maria; Quapp, Wolfgang

2011-02-21

The distinguished coordinate path and the reduced gradient following path or its equivalent formulation, the Newton trajectory, are analyzed and unified using the theory of calculus of variations. It is shown that their minimum character is related to the fact that the curve is located in a valley region. In this case, we say that the Newton trajectory is a reaction path with the category of minimum energy path. In addition to these findings a Runge-Kutta-Fehlberg algorithm to integrate these curves is also proposed.

Variational nature, integration, and properties of Newton reaction path

Science.gov (United States)

Bofill, Josep Maria; Quapp, Wolfgang

2011-02-01

The distinguished coordinate path and the reduced gradient following path or its equivalent formulation, the Newton trajectory, are analyzed and unified using the theory of calculus of variations. It is shown that their minimum character is related to the fact that the curve is located in a valley region. In this case, we say that the Newton trajectory is a reaction path with the category of minimum energy path. In addition to these findings a Runge-Kutta-Fehlberg algorithm to integrate these curves is also proposed.

Quantum mechanics on the half-line using path integrals

International Nuclear Information System (INIS)

Clark, T.E.; Menikoff, R.; Sharp, D.H.

1980-01-01

We study the Feynman path-integral formalism for the constrained problem of a free particle moving on the half-line. It is shown that the effect of the boundary condition at the origin can be incorporated into the path integral by a simple modification of the action. The small-time behavior of the Green's function can be obtained from the stationary-phase evaluation of our expression for the path integral, which in this case includes contributions from both the direct and reflected classical paths

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

Hot gas path component having near wall cooling features

Science.gov (United States)

Miranda, Carlos Miguel; Kottilingam, Srikanth Chandrudu; Lacy, Benjamin Paul

2017-11-28

A method for providing micro-channels in a hot gas path component includes forming a first micro-channel in an exterior surface of a substrate of the hot gas path component. A second micro-channel is formed in the exterior surface of the hot gas path component such that it is separated from the first micro-channel by a surface gap having a first width. The method also includes disposing a braze sheet onto the exterior surface of the hot gas path component such that the braze sheet covers at least of portion of the first and second micro-channels, and heating the braze sheet to bond it to at least a portion of the exterior surface of the hot gas path component.

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

Approximate shortest homotopic paths in weighted regions

KAUST Repository

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

2012-01-01

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

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.

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

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)

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

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

Approximate Shortest Homotopic Paths in Weighted Regions

KAUST Repository

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

2010-01-01

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

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

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

Reactive Path Planning Approach for Docking Robots in Unknown Environment

Directory of Open Access Journals (Sweden)

Peng Cui

2017-01-01

Full Text Available Autonomous robots need to be recharged and exchange information with the host through docking in the long-distance tasks. Therefore, feasible path is required in the docking process to guide the robot and adjust its pose. However, when there are unknown obstacles in the work area, it becomes difficult to determine the feasible path for docking. This paper presents a reactive path planning approach named Dubins-APF (DAPF to solve the path planning problem for docking in unknown environment with obstacles. In this proposed approach the Dubins curves are combined with the designed obstacle avoidance potential field to plan the feasible path. Firstly, an initial path is planned and followed according to the configurations of the robot and the docking station. Then when the followed path is evaluated to be infeasible, the intermediate configuration is calculated as well as the replanned path based on the obstacle avoidance potential field. The robot will be navigated to the docking station with proper pose eventually via the DAPF approach. The proposed DAPF approach is efficient and does not require the prior knowledge about the environment. Simulation results are given to validate the effectiveness and feasibility of the proposed approach.

Some instructive examples of Mayer's interference in path integral

International Nuclear Information System (INIS)

Fiziev, P.P.

1984-01-01

A new technique of path integral evaluation by a discretization procedure is proposed. It is based on the requirement, found previously, to single out the set of classical trajectories over which the summation is performed. The notion of Mayer's interference is introduced and illustrated by a number of simple examples. The choice of the set of paths is shown to induce a corresponding quantization procedure and this line is followed to demonstrate its connection with the symmetries of the problem. The possibility of extracting information on the space of quantum states from path integrals has been reviewed. A class of paths has been found; the summation over these paths within the framework of the suggested approach produces the well known results for the motion in a homogeneous field and for the harmonic oscillator

Quad-rotor flight path energy optimization

Science.gov (United States)

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.

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

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

Path space measures for Dirac and Schroedinger equations: Nonstandard analytical approach

International Nuclear Information System (INIS)

Nakamura, T.

1997-01-01

A nonstandard path space *-measure is constructed to justify the path integral formula for the Dirac equation in two-dimensional space endash time. A standard measure as well as a standard path integral is obtained from it. We also show that, even for the Schroedinger equation, for which there is no standard measure appropriate for a path integral, there exists a nonstandard measure to define a *-path integral whose standard part agrees with the ordinary path integral as defined by a limit from time-slice approximant. copyright 1997 American Institute of Physics

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.

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

Interactions of information transfer along separable causal paths

Science.gov (United States)

Jiang, Peishi; Kumar, Praveen

2018-04-01

Complex systems arise as a result of interdependences between multiple variables, whose causal interactions can be visualized in a time-series graph. Transfer entropy and information partitioning approaches have been used to characterize such dependences. However, these approaches capture net information transfer occurring through a multitude of pathways involved in the interaction and as a result mask our ability to discern the causal interaction within a subgraph of interest through specific pathways. We build on recent developments of momentary information transfer along causal paths proposed by Runge [Phys. Rev. E 92, 062829 (2015), 10.1103/PhysRevE.92.062829] to develop a framework for quantifying information partitioning along separable causal paths. Momentary information transfer along causal paths captures the amount of information transfer between any two variables lagged at two specific points in time. Our approach expands this concept to characterize the causal interaction in terms of synergistic, unique, and redundant information transfer through separable causal paths. Through a graphical model, we analyze the impact of the separable and nonseparable causal paths and the causality structure embedded in the graph as well as the noise effect on information partitioning by using synthetic data generated from two coupled logistic equation models. Our approach can provide a valuable reference for an autonomous information partitioning along separable causal paths which form a causal subgraph influencing a target.

Low level constraints on dynamic contour path integration.

Directory of Open Access Journals (Sweden)

Sophie Hall

Full Text Available Contour integration is a fundamental visual process. The constraints on integrating discrete contour elements and the associated neural mechanisms have typically been investigated using static contour paths. However, in our dynamic natural environment objects and scenes vary over space and time. With the aim of investigating the parameters affecting spatiotemporal contour path integration, we measured human contrast detection performance of a briefly presented foveal target embedded in dynamic collinear stimulus sequences (comprising five short 'predictor' bars appearing consecutively towards the fovea, followed by the 'target' bar in four experiments. The data showed that participants' target detection performance was relatively unchanged when individual contour elements were separated by up to 2° spatial gap or 200 ms temporal gap. Randomising the luminance contrast or colour of the predictors, on the other hand, had similar detrimental effect on grouping dynamic contour path and subsequent target detection performance. Randomising the orientation of the predictors reduced target detection performance greater than introducing misalignment relative to the contour path. The results suggest that the visual system integrates dynamic path elements to bias target detection even when the continuity of path is disrupted in terms of spatial (2°, temporal (200 ms, colour (over 10 colours and luminance (-25% to 25% information. We discuss how the findings can be largely reconciled within the functioning of V1 horizontal connections.

Transition paths in single-molecule force spectroscopy.

Science.gov (United States)

Cossio, Pilar; Hummer, Gerhard; Szabo, Attila

2018-03-28

In a typical single-molecule force spectroscopy experiment, the ends of the molecule of interest are connected by long polymer linkers to a pair of mesoscopic beads trapped in the focus of two laser beams. At constant force load, the total extension, i.e., the end-to-end distance of the molecule plus linkers, is measured as a function of time. In the simplest systems, the measured extension fluctuates about two values characteristic of folded and unfolded states, with occasional transitions between them. We have recently shown that molecular (un)folding rates can be recovered from such trajectories, with a small linker correction, as long as the characteristic time of the bead fluctuations is shorter than the residence time in the unfolded (folded) state. Here, we show that accurate measurements of the molecular transition path times require an even faster apparatus response. Transition paths, the trajectory segments in which the molecule (un)folds, are properly resolved only if the beads fluctuate more rapidly than the end-to-end distance of the molecule. Therefore, over a wide regime, the measured rates may be meaningful but not the transition path times. Analytic expressions for the measured mean transition path times are obtained for systems diffusing anisotropically on a two-dimensional free energy surface. The transition path times depend on the properties both of the molecule and of the pulling device.

A career path in clinical pathways.

Science.gov (United States)

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.

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

Science.gov (United States)

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

2010-10-11

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

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

76 FR 64183 - Designation of Five Individuals Pursuant to Executive Order 13224 of September 23, 2001...

Science.gov (United States)

2011-10-17

.... nationals or the national security, foreign policy, or economy of the United States; (3) persons determined... Iran; Passport D9004878 (individual) [SDGT] [IRGC]. ARBABSIAR, Manssor (a.k.a. ARBABSIAR, Mansour), 805...; alt. DOB 6 Mar 1955; POB Iran; citizen United States; Driver's License No. 07442833 (United States...

Toward solving the sign problem with path optimization method

Science.gov (United States)

Mori, Yuto; Kashiwa, Kouji; Ohnishi, Akira

2017-12-01

We propose a new approach to circumvent the sign problem in which the integration path is optimized to control the sign problem. We give a trial function specifying the integration path in the complex plane and tune it to optimize the cost function which represents the seriousness of the sign problem. We call it the path optimization method. In this method, we do not need to solve the gradient flow required in the Lefschetz-thimble method and then the construction of the integration-path contour arrives at the optimization problem where several efficient methods can be applied. In a simple model with a serious sign problem, the path optimization method is demonstrated to work well; the residual sign problem is resolved and precise results can be obtained even in the region where the global sign problem is serious.

Path Following in the Exact Penalty Method of Convex Programming.

Science.gov (United States)

Zhou, Hua; Lange, Kenneth

2015-07-01

Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, the kinks in the penalty and the unknown magnitude of the penalty constant prevent wide application of the exact penalty method in nonlinear programming. In this article, we examine a strategy of path following consistent with the exact penalty method. Instead of performing optimization at a single penalty constant, we trace the solution as a continuous function of the penalty constant. Thus, path following starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. For quadratic programming, the solution path is piecewise linear and takes large jumps from constraint to constraint. For a general convex program, the solution path is piecewise smooth, and path following operates by numerically solving an ordinary differential equation segment by segment. Our diverse applications to a) projection onto a convex set, b) nonnegative least squares, c) quadratically constrained quadratic programming, d) geometric programming, and e) semidefinite programming illustrate the mechanics and potential of path following. The final detour to image denoising demonstrates the relevance of path following to regularized estimation in inverse problems. In regularized estimation, one follows the solution path as the penalty constant decreases from a large value.

Automatic path proposal computation for CT-guided percutaneous liver biopsy.

Science.gov (United States)

Helck, A; Schumann, C; Aumann, J; Thierfelder, K; Strobl, F F; Braunagel, M; Niethammer, M; Clevert, D A; Hoffmann, R T; Reiser, M; Sandner, T; Trumm, C

2016-12-01

To evaluate feasibility of automatic software-based path proposals for CT-guided percutaneous biopsies. Thirty-three patients (60 [Formula: see text] 12 years) referred for CT-guided biopsy of focal liver lesions were consecutively included. Pre-interventional CT and dedicated software (FraunhoferMeVis Pathfinder) were used for (semi)automatic segmentation of relevant structures. The software subsequently generated three path proposals in downward quality for CT-guided biopsy. Proposed needle paths were compared with consensus proposal of two experts (comparable, less suitable, not feasible). In case of comparable results, equivalent approach to software-based path proposal was used. Quality of segmentation process was evaluated (Likert scale, 1 [Formula: see text] best, 6 [Formula: see text] worst), and time for processing was registered. All biopsies were performed successfully without complications. In 91 % one of the three automatic path proposals was rated comparable to experts' proposal. None of the first proposals was rated not feasible, and 76 % were rated comparable to the experts' proposal. 7 % automatic path proposals were rated not feasible, all being second choice ([Formula: see text]) or third choice ([Formula: see text]). In 79 %, segmentation at least was good. Average total time for establishing automatic path proposal was 42 [Formula: see text] 9 s. Automatic software-based path proposal for CT-guided liver biopsies in the majority provides path proposals that are easy to establish and comparable to experts' insertion trajectories.

Which coordinate system for modelling path integration?

Science.gov (United States)

Vickerstaff, Robert J; Cheung, Allen

2010-03-21

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

Continuous-Curvature Path Generation Using Fermat's Spiral

Directory of Open Access Journals (Sweden)

Anastasios M. Lekkas

2013-10-01

Full Text Available This paper proposes a novel methodology, based on Fermat's spiral (FS, for constructing curvature-continuous parametric paths in a plane. FS has a zero curvature at its origin, a property that allows it to be connected with a straight line smoothly, that is, without the curvature discontinuity which occurs at the transition point between a line and a circular arc when constructing Dubins paths. Furthermore, contrary to the computationally expensive clothoids, FS is described by very simple parametric equations that are trivial to compute. On the downside, computing the length of an FS arc involves a Gaussian hypergeometric function. However, this function is absolutely convergent and it is also shown that it poses no restrictions to the domain within which the length can be calculated. In addition, we present an alternative parametrization of FS which eliminates the parametric speed singularity at the origin, hence making the spiral suitable for path-tracking applications. A detailed description of how to construct curvature-continuous paths with FS is given.

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.

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

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

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.

Space-time transformations in radial path integrals

International Nuclear Information System (INIS)

Steiner, F.

1984-09-01

Nonlinear space-time transformations in the radial path integral are discussed. A transformation formula is derived, which relates the original path integral to the Green's function of a new quantum system with an effective potential containing an observable quantum correction proportional(h/2π) 2 . As an example the formula is applied to spherical Brownian motion. (orig.)

MM98.36 Strain Paths in Extrusion

DEFF Research Database (Denmark)

Lindegren, Maria; Wiwe, Birgitte; Wanheim, Tarras

1998-01-01

The extrusion process has been investigated for different geometries, in order to study the strain path of different material elements during their movements through the plastic zone. This is done by using the FEM code DEFORM and physical simulation with wax togehter with the coefficient method. ....... Calculations of strain paths have also been performed by ABAQUS....

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

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)

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.

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

Covariant path integrals on hyperbolic surfaces

Science.gov (United States)

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

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

OpenAIRE

Dipta, Anna Mira

2015-01-01

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

Optimal Path Determination for Flying Vehicle to Search an Object

Science.gov (United States)

Heru Tjahjana, R.; Heri Soelistyo U, R.; Ratnasari, L.; Irawanto, B.

2018-01-01

In this paper, a method to determine optimal path for flying vehicle to search an object is proposed. Background of the paper is controlling air vehicle to search an object. Optimal path determination is one of the most popular problem in optimization. This paper describe model of control design for a flying vehicle to search an object, and focus on the optimal path that used to search an object. In this paper, optimal control model is used to control flying vehicle to make the vehicle move in optimal path. If the vehicle move in optimal path, then the path to reach the searched object also optimal. The cost Functional is one of the most important things in optimal control design, in this paper the cost functional make the air vehicle can move as soon as possible to reach the object. The axis reference of flying vehicle uses N-E-D (North-East-Down) coordinate system. The result of this paper are the theorems which say that the cost functional make the control optimal and make the vehicle move in optimal path are proved analytically. The other result of this paper also shows the cost functional which used is convex. The convexity of the cost functional is use for guarantee the existence of optimal control. This paper also expose some simulations to show an optimal path for flying vehicle to search an object. The optimization method which used to find the optimal control and optimal path vehicle in this paper is Pontryagin Minimum Principle.

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.

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

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.

Master equations and the theory of stochastic path integrals

Science.gov (United States)

Weber, Markus F.; Frey, Erwin

2017-04-01

This review provides a pedagogic and self-contained introduction to master equations and to their representation by path integrals. Since the 1930s, master equations have served as a fundamental tool to understand the role of fluctuations in complex biological, chemical, and physical systems. Despite their simple appearance, analyses of master equations most often rely on low-noise approximations such as the Kramers-Moyal or the system size expansion, or require ad-hoc closure schemes for the derivation of low-order moment equations. We focus on numerical and analytical methods going beyond the low-noise limit and provide a unified framework for the study of master equations. After deriving the forward and backward master equations from the Chapman-Kolmogorov equation, we show how the two master equations can be cast into either of four linear partial differential equations (PDEs). Three of these PDEs are discussed in detail. The first PDE governs the time evolution of a generalized probability generating function whose basis depends on the stochastic process under consideration. Spectral methods, WKB approximations, and a variational approach have been proposed for the analysis of the PDE. The second PDE is novel and is obeyed by a distribution that is marginalized over an initial state. It proves useful for the computation of mean extinction times. The third PDE describes the time evolution of a ‘generating functional’, which generalizes the so-called Poisson representation. Subsequently, the solutions of the PDEs are expressed in terms of two path integrals: a ‘forward’ and a ‘backward’ path integral. Combined with inverse transformations, one obtains two distinct path integral representations of the conditional probability distribution solving the master equations. We exemplify both path integrals in analysing elementary chemical reactions. Moreover, we show how a well-known path integral representation of averaged observables can be recovered from

Master equations and the theory of stochastic path integrals.

Science.gov (United States)

Weber, Markus F; Frey, Erwin

2017-04-01

This review provides a pedagogic and self-contained introduction to master equations and to their representation by path integrals. Since the 1930s, master equations have served as a fundamental tool to understand the role of fluctuations in complex biological, chemical, and physical systems. Despite their simple appearance, analyses of master equations most often rely on low-noise approximations such as the Kramers-Moyal or the system size expansion, or require ad-hoc closure schemes for the derivation of low-order moment equations. We focus on numerical and analytical methods going beyond the low-noise limit and provide a unified framework for the study of master equations. After deriving the forward and backward master equations from the Chapman-Kolmogorov equation, we show how the two master equations can be cast into either of four linear partial differential equations (PDEs). Three of these PDEs are discussed in detail. The first PDE governs the time evolution of a generalized probability generating function whose basis depends on the stochastic process under consideration. Spectral methods, WKB approximations, and a variational approach have been proposed for the analysis of the PDE. The second PDE is novel and is obeyed by a distribution that is marginalized over an initial state. It proves useful for the computation of mean extinction times. The third PDE describes the time evolution of a 'generating functional', which generalizes the so-called Poisson representation. Subsequently, the solutions of the PDEs are expressed in terms of two path integrals: a 'forward' and a 'backward' path integral. Combined with inverse transformations, one obtains two distinct path integral representations of the conditional probability distribution solving the master equations. We exemplify both path integrals in analysing elementary chemical reactions. Moreover, we show how a well-known path integral representation of averaged observables can be recovered from them. Upon

Groebner Finite Path Algebras

OpenAIRE

Leamer, Micah J.

2004-01-01

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

Effect of salt stress on the physiology of Frankia sp strain CcI6

Indian Academy of Sciences (India)

2013-10-01

Oct 1, 2013 ... the strain is closely related to Frankia sp. strain CcI3. ... [Oshone R, Mansour SR and Tisa LS 2013 Effect of salt stress on the physiology of Frankia sp strain CcI6. .... This work was supported in part by US-Egypt Joint Research.

Randomized path optimization for thevMitigated counter detection of UAVS

Science.gov (United States)

2017-06-01

to tracking, such as sea state, altitude, and the position of the sun, could all be used 1 in designing a program that allows for the recovery of...qgoal , an infinite set of possible paths exists in between them. In order to scale down the problem from an infinite number of paths, a polynomial path...flight to a vehicle that used 70%. With 100 potential waypoints and five different time profiles, the set of infinite paths was narrowed down to a set

Paths to Licensure: Things Physicists Should Know

Science.gov (United States)

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

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

Directory of Open Access Journals (Sweden)

Juen Joshua

2015-06-01

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

Path integral solution for some time-dependent potential

International Nuclear Information System (INIS)

Storchak, S.N.

1989-12-01

The quantum-mechanical problem with a time-dependent potential is solved by the path integral method. The solution is obtained by the application of the previously derived general formula for rheonomic homogeneous point transformation and reparametrization in the path integral. (author). 4 refs

Autonomous path planning solution for industrial robot manipulator using backpropagation algorithm

Directory of Open Access Journals (Sweden)

PeiJiang Yuan

2015-12-01

Full Text Available Here, we propose an autonomous path planning solution using backpropagation algorithm. The mechanism of movement used by humans in controlling their arms is analyzed and then applied to control a robot manipulator. Autonomous path planning solution is a numerical method. The model of industrial robot manipulator used in this article is a KUKA KR 210 R2700 EXTRA robot. In order to show the performance of the autonomous path planning solution, an experiment validation of path tracking is provided. Experiment validation consists of implementation of the autonomous path planning solution and the control of physical robot. The process of converging to target solution is provided. The mean absolute error of position for tool center point is also analyzed. Comparison between autonomous path planning solution and the numerical methods based on Newton–Raphson algorithm is provided to demonstrate the efficiency and accuracy of the autonomous path planning solution.

Path connectivity based spectral defragmentation in flexible bandwidth networks.

Science.gov (United States)

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

2013-01-28

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

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

A path finding implementation for multi-layer networks

NARCIS (Netherlands)

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

2009-01-01

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

A path finding implementation for multi-layer network

NARCIS (Netherlands)

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

2009-01-01

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

Road networks as collections of minimum cost paths

Science.gov (United States)

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

2015-10-01

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

Medial temporal lobe roles in human path integration.

Directory of Open Access Journals (Sweden)

Naohide Yamamoto

Full Text Available Path integration is a process in which observers derive their location by integrating self-motion signals along their locomotion trajectory. Although the medial temporal lobe (MTL is thought to take part in path integration, the scope of its role for path integration remains unclear. To address this issue, we administered a variety of tasks involving path integration and other related processes to a group of neurosurgical patients whose MTL was unilaterally resected as therapy for epilepsy. These patients were unimpaired relative to neurologically intact controls in many tasks that required integration of various kinds of sensory self-motion information. However, the same patients (especially those who had lesions in the right hemisphere walked farther than the controls when attempting to walk without vision to a previewed target. Importantly, this task was unique in our test battery in that it allowed participants to form a mental representation of the target location and anticipate their upcoming walking trajectory before they began moving. Thus, these results put forth a new idea that the role of MTL structures for human path integration may stem from their participation in predicting the consequences of one's locomotor actions. The strengths of this new theoretical viewpoint are discussed.

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 Collision-Free G2 Continuous Path-Smoothing Algorithm Using Quadratic Polynomial Interpolation

Directory of Open Access Journals (Sweden)

Seong-Ryong Chang

2014-12-01

Full Text Available Most path-planning algorithms are used to obtain a collision-free path without considering continuity. On the other hand, a continuous path is needed for stable movement. In this paper, the searched path was converted into a G2 continuous path using the modified quadratic polynomial and membership function interpolation algorithm. It is simple, unique and provides a good geometric interpretation. In addition, a collision-checking and improvement algorithm is proposed. The collision-checking algorithm can check the collisions of a smoothed path. If collisions are detected, the collision improvement algorithm modifies the collision path to a collision-free path. The collision improvement algorithm uses a geometric method. This method uses the perpendicular line between a collision position and the collision piecewise linear path. The sub-waypoint is added, and the QPMI algorithm is applied again. As a result, the collision-smoothed path is converted into a collision-free smooth path without changing the continuity.

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

Path Planning Methods in an Environment with Obstacles (A Review

Directory of Open Access Journals (Sweden)

W. Liu

2018-01-01

Full Text Available Planning the path is the most important task in the mobile robot navigation. This task involves basically three aspects. First, the planned path must run from a given starting point to a given endpoint. Secondly, it should ensure robot’s collision-free movement. Thirdly, among all the possible paths that meet the first two requirements it must be, in a certain sense, optimal.Methods of path planning can be classified according to different characteristics. In the context of using intelligent technologies, they can be divided into traditional methods and heuristic ones. By the nature of the environment, it is possible to divide planning methods into planning methods in a static environment and in a dynamic one (it should be noted, however, that a static environment is rare. Methods can also be divided according to the completeness of information about the environment, namely methods with complete information (in this case the issue is a global path planning and methods with incomplete information (usually, this refers to the situational awareness in the immediate vicinity of the robot, in this case it is a local path planning. Note that incomplete information about the environment can be a consequence of the changing environment, i.e. in a dynamic environment, there is, usually, a local path planning.Literature offers a great deal of methods for path planning where various heuristic techniques are used, which, as a rule, result from the denotative meaning of the problem being solved. This review discusses the main approaches to the problem solution. Here we can distinguish five classes of basic methods: graph-based methods, methods based on cell decomposition, use of potential fields, optimization methods, фтв methods based on intelligent technologies.Many methods of path planning, as a result, give a chain of reference points (waypoints connecting the beginning and end of the path. This should be seen as an intermediate result. The problem

Revisiting path steering for 3D manipulation tasks

NARCIS (Netherlands)

L. Liu (Lei); J.-B. Martens; R. van Liere (Robert)

2011-01-01

htmlabstractThe law of path steering, as proposed by Accot and Zhai, describes a quantitative relationship between human temporal performance and the path spatial characteristics. The steering law is formulated as a continuous goal crossing task, in which a large number of goals are crossed along

Revisiting path steering for 3D manipulation tasks

NARCIS (Netherlands)

L. Liu (Lei); J.-B. Martens; R. van Liere (Robert)

2010-01-01

htmlabstractThe law of path steering, as proposed by Accot and Zhai, describes a quantitative relationship between human temporal performance and the path spatial characteristics. The steering law is formulated as a continuous goal crossing task, in which a large number of goals are crossed along

An adaptive dual-optimal path-planning technique for unmanned air vehicles

Directory of Open Access Journals (Sweden)

Whitfield Clifford A.

2016-01-01

Full Text Available A multi-objective technique for unmanned air vehicle path-planning generation through task allocation has been developed. The dual-optimal path-planning technique generates real-time adaptive flight paths based on available flight windows and environmental influenced objectives. The environmentally-influenced flight condition determines the aircraft optimal orientation within a downstream virtual window of possible vehicle destinations that is based on the vehicle’s kinematics. The intermittent results are then pursued by a dynamic optimization technique to determine the flight path. This path-planning technique is a multi-objective optimization procedure consisting of two goals that do not require additional information to combine the conflicting objectives into a single-objective. The technique was applied to solar-regenerative high altitude long endurance flight which can benefit significantly from an adaptive real-time path-planning technique. The objectives were to determine the minimum power required flight paths while maintaining maximum solar power for continual surveillance over an area of interest (AOI. The simulated path generation technique prolonged the flight duration over a sustained turn loiter flight path by approximately 2 months for a year of flight. The potential for prolonged solar powered flight was consistent for all latitude locations, including 2 months of available flight at 60° latitude, where sustained turn flight was no longer capable.

Artificial pheromone for path selection by a foraging swarm of robots.

Science.gov (United States)

Campo, Alexandre; Gutiérrez, Alvaro; Nouyan, Shervin; Pinciroli, Carlo; Longchamp, Valentin; Garnier, Simon; Dorigo, Marco

2010-11-01

Foraging robots involved in a search and retrieval task may create paths to navigate faster in their environment. In this context, a swarm of robots that has found several resources and created different paths may benefit strongly from path selection. Path selection enhances the foraging behavior by allowing the swarm to focus on the most profitable resource with the possibility for unused robots to stop participating in the path maintenance and to switch to another task. In order to achieve path selection, we implement virtual ants that lay artificial pheromone inside a network of robots. Virtual ants are local messages transmitted by robots; they travel along chains of robots and deposit artificial pheromone on the robots that are literally forming the chain and indicating the path. The concentration of artificial pheromone on the robots allows them to decide whether they are part of a selected path. We parameterize the mechanism with a mathematical model and provide an experimental validation using a swarm of 20 real robots. We show that our mechanism favors the selection of the closest resource is able to select a new path if a selected resource becomes unavailable and selects a newly detected and better resource when possible. As robots use very simple messages and behaviors, the system would be particularly well suited for swarms of microrobots with minimal abilities.

Regularizing Feynman path integrals using the generalized Kontsevich-Vishik trace

Science.gov (United States)

Hartung, Tobias

2017-12-01

A fully regulated definition of Feynman's path integral is presented here. The proposed re-formulation of the path integral coincides with the familiar formulation whenever the path integral is well defined. In particular, it is consistent with respect to lattice formulations and Wick rotations, i.e., it can be used in Euclidean and Minkowski space-time. The path integral regularization is introduced through the generalized Kontsevich-Vishik trace, that is, the extension of the classical trace to Fourier integral operators. Physically, we are replacing the time-evolution semi-group by a holomorphic family of operators such that the corresponding path integrals are well defined in some half space of C . The regularized path integral is, thus, defined through analytic continuation. This regularization can be performed by means of stationary phase approximation or computed analytically depending only on the Hamiltonian and the observable (i.e., known a priori). In either case, the computational effort to evaluate path integrals or expectations of observables reduces to the evaluation of integrals over spheres. Furthermore, computations can be performed directly in the continuum and applications (analytic computations and their implementations) to a number of models including the non-trivial cases of the massive Schwinger model and a φ4 theory.

On the optical path length in refracting media

Science.gov (United States)

Hasbun, Javier E.

2018-04-01

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

Remembered landmarks enhance the precision of path integration

Directory of Open Access Journals (Sweden)

Shannon O´Leary

2005-01-01

Full Text Available When navigating by path integration, knowledge of one’s position becomes increasingly uncertain as one walks from a known location. This uncertainty decreases if one perceives a known landmark location nearby. We hypothesized that remembering landmarks might serve a similar purpose for path integration as directly perceiving them. If this is true, walking near a remembered landmark location should enhance response consistency in path integration tasks. To test this, we asked participants to view a target and then attempt to walk to it without vision. Some participants saw the target plus a landmark during the preview. Compared with no-landmark trials, response consistency nearly doubled when participants passed near the remembered landmark location. Similar results were obtained when participants could audibly perceive the landmark while walking. A control experiment ruled out perceptual context effects during the preview. We conclude that remembered landmarks can enhance path integration even though they are not directly perceived.

Field theory a path integral approach

CERN Document Server

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.

Quantum dynamics via Planck-scale-stepped action-carrying 'Graph Paths'

CERN Document Server

Chew, Geoffrey Foucar

2003-01-01

A divergence-free, parameter-free, path-based discrete-time quantum dynamics is designed to not only enlarge the achievements of general relativity and the standard particle model, by approximations at spacetime scales far above Planck scale while far below Hubble scale, but to allow tackling of hitherto inaccessible questions. ''Path space'' is larger than and precursor to Hilbert-space basis. The wave-function-propagating paths are action-carrying structured graphs-cubic and quartic structured vertices connected by structured ''fermionic'' or ''bosonic'' ''particle'' and ''nonparticle'' arcs. A Planck-scale path step determines the gravitational constant while controlling all graph structure. The basis of the theory's (zero-rest-mass) elementary-particle Hilbert space (which includes neither gravitons nor scalar bosons) resides in particle arcs. Nonparticle arcs within a path are responsible for energy and rest mass.

Path Planning with a Lazy Significant Edge Algorithm (LSEA

Directory of Open Access Journals (Sweden)

Joseph Polden

2013-04-01

Full Text Available Probabilistic methods have been proven to be effective for robotic path planning in a geometrically complex environment. In this paper, we propose a novel approach, which utilizes a specialized roadmap expansion phase, to improve lazy probabilistic path planning. This expansion phase analyses roadmap connectivity information to bias sampling towards objects in the workspace that have not yet been navigated by the robot. A new method to reduce the number of samples required to navigate narrow passages is also proposed and tested. Experimental results show that the new algorithm is more efficient than the traditional path planning methodologies. It was able to generate solutions for a variety of path planning problems faster, using fewer samples to arrive at a valid solution.

Path generation algorithm for UML graphic modeling of aerospace test software

Science.gov (United States)

Qu, MingCheng; Wu, XiangHu; Tao, YongChao; Chen, Chao

2018-03-01

Aerospace traditional software testing engineers are based on their own work experience and communication with software development personnel to complete the description of the test software, manual writing test cases, time-consuming, inefficient, loopholes and more. Using the high reliability MBT tools developed by our company, the one-time modeling can automatically generate test case documents, which is efficient and accurate. UML model to describe the process accurately express the need to rely on the path is reached, the existing path generation algorithm are too simple, cannot be combined into a path and branch path with loop, or too cumbersome, too complicated arrangement generates a path is meaningless, for aerospace software testing is superfluous, I rely on our experience of ten load space, tailor developed a description of aerospace software UML graphics path generation algorithm.

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

Complex strain paths in polycrystalline copper: microstructural aspects

Directory of Open Access Journals (Sweden)

M.F. Vieira

1999-07-01

Full Text Available Microstructural aspects of polycrystalline copper sheets subjected to complex strain paths were analysed in this work. Dislocation structures developed during the strain paths (rolling and tension and the evolution of this microstructure during reloading have been studied. The active slip systems developed in each strain path were used to explain the microstructural evolution. The heterogeneous surface deformation observed on polished tensile specimens prestrained in rolling was also analysed. The structural aspects are related with the mechanical behaviour of the material, namely with the increase in yield stress in reloading, the work hardening evolution and the premature occurrence of plastic instability for some prestrain values.

Ted Irving and the Arc of APW Paths

Science.gov (United States)

Kent, D. V.

2014-12-01

Ted Irving's last two published papers neatly encapsulate his seminal contributions to the delineation of ever-important apparent polar wander (APW) paths. His final (210th) paper [Creer & Irving, 2012 Earth Sciences History] describes in detail how Ken Creer and he when still graduate students at Cambridge started to generate and assemble paleomagnetic data for the first APW path, for then only the UK; the paper was published 60 years ago and happened to be Ted's first [Creer, Irving & Runcorn, 1954 JGE]. Only 10 years later, there was already a lengthy reference list of paleomagnetic results available from most continents that had been compiled in pole lists he published in GJRAS from 1960 to 1965 and included in an appendix in his landmark book "Paleomagnetism" [Irving, 1964 Wiley] in support of wide ranging discussions of continental drift and related topics in chapters like 'Paleolatitudes and paleomeridians.' A subsequent innovation was calculating running means of poles indexed to a numerical geologic time scale [Irving, 1977 Nature], which with independent tectonic reconstructions as already for Gondwana allowed constructions of more detailed composite APW paths. His 1977 paper also coined Pangea B for an earlier albeit contentious configuration for the supercontinent that refuses to go away. Gliding over much work on APW tracks and hairpins in the Precambrian, we come to Ted's penultimate (209th) paper [Kent & Irving, 2010 JGR] in which individual poles from short-lived large igneous provinces were grouped and most sedimentary poles, many rather venerable, excluded as likely to be biased by variable degrees of inclination error. The leaner composite APW path helped to resurrect the Baja BC scenario of Cordilleran terrane motions virtually stopped in the 1980s by APW path techniques that relied on a few key but alas often badly skewed poles. The new composite APW path also revealed several major features, such as a huge polar shift of 30° in 15 Myr in the

An empirical typology of hospital nurses' individual learning paths.

Science.gov (United States)

Poell, Rob F; Van der Krogt, Ferd J

2014-03-01

A relatively new theoretical concept is proposed in this paper, namely, the individual learning path. Learning paths are created by individual employees and comprise a set of learning-relevant activities that are both coherent as a whole and meaningful to them. To explore the empirical basis of this theoretical concept. A qualitative study involving semi-structured interviews. Two academic medical centers (university hospitals) and two general hospitals in the Netherlands. A total of 89 nurses were involved in the study. Semi-structured interviews were analyzed qualitatively; cluster analysis was then performed on quantified data from the interviews. Four types of learning path emerged, namely, the formal-external, self-directed, social-emotional, and information-oriented learning paths. The relatively new theoretical concept of an individual learning path can be observed in practice and a number of different learning-path types can be distinguished. Nurses were found to create their own learning paths, that is, select a theme that is relevant primarily to themselves, conduct a variety of learning activities around this theme, participate in social contexts that might help them, and mobilize learning facilities provided by their organization. These activities go way beyond the notion of employees as self-directed learners merely in a didactic sense (establishing learning goals, choosing the right learning activities for these goals, evaluating to what extent their goals have been met as a result). The findings can be interpreted as evidence of employees acting strategically when it comes to their professional development. Providers of continuing professional education/development need to take this into account. Copyright © 2013 Elsevier Ltd. All rights reserved.

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

Fast exploration of an optimal path on the multidimensional free energy surface

Science.gov (United States)

Chen, Changjun

2017-01-01

In a reaction, determination of an optimal path with a high reaction rate (or a low free energy barrier) is important for the study of the reaction mechanism. This is a complicated problem that involves lots of degrees of freedom. For simple models, one can build an initial path in the collective variable space by the interpolation method first and then update the whole path constantly in the optimization. However, such interpolation method could be risky in the high dimensional space for large molecules. On the path, steric clashes between neighboring atoms could cause extremely high energy barriers and thus fail the optimization. Moreover, performing simulations for all the snapshots on the path is also time-consuming. In this paper, we build and optimize the path by a growing method on the free energy surface. The method grows a path from the reactant and extends its length in the collective variable space step by step. The growing direction is determined by both the free energy gradient at the end of the path and the direction vector pointing at the product. With fewer snapshots on the path, this strategy can let the path avoid the high energy states in the growing process and save the precious simulation time at each iteration step. Applications show that the presented method is efficient enough to produce optimal paths on either the two-dimensional or the twelve-dimensional free energy surfaces of different small molecules. PMID:28542475

Memristor-based memory: The sneak paths problem and solutions

KAUST Repository

Zidan, Mohammed A.

2012-10-29

In this paper, we investigate the read operation of memristor-based memories. We analyze the sneak paths problem and provide a noise margin metric to compare the various solutions proposed in the literature. We also analyze the power consumption associated with these solutions. Moreover, we study the effect of the aspect ratio of the memory array on the sneak paths. Finally, we introduce a new technique for solving the sneak paths problem by gating the memory cell using a three-terminal memistor device.

Memristor-based memory: The sneak paths problem and solutions

KAUST Repository

Zidan, Mohammed A.; Fahmy, Hossam A.H.; Hussain, Muhammad Mustafa; Salama, Khaled N.

2012-01-01

In this paper, we investigate the read operation of memristor-based memories. We analyze the sneak paths problem and provide a noise margin metric to compare the various solutions proposed in the literature. We also analyze the power consumption associated with these solutions. Moreover, we study the effect of the aspect ratio of the memory array on the sneak paths. Finally, we introduce a new technique for solving the sneak paths problem by gating the memory cell using a three-terminal memistor device.

Static and Dynamic Path Planning Using Incremental Heuristic Search

OpenAIRE

Khattab, Asem

2018-01-01

Path planning is an important component in any highly automated vehicle system. In this report, the general problem of path planning is considered first in partially known static environments where only static obstacles are present but the layout of the environment is changing as the agent acquires new information. Attention is then given to the problem of path planning in dynamic environments where there are moving obstacles in addition to the static ones. Specifically, a 2D car-like agent t...

Navigating the Path to a Biomedical Science Career

Science.gov (United States)

Zimmerman, Andrea McNeely

The number of biomedical PhD scientists being trained and graduated far exceeds the number of academic faculty positions and academic research jobs. If this trend is compelling biomedical PhD scientists to increasingly seek career paths outside of academia, then more should be known about their intentions, desires, training experiences, and career path navigation. Therefore, the purpose of this study was to understand the process through which biomedical PhD scientists are trained and supported for navigating future career paths. In addition, the study sought to determine whether career development support efforts and opportunities should be redesigned to account for the proportion of PhD scientists following non-academic career pathways. Guided by the social cognitive career theory (SCCT) framework this study sought to answer the following central research question: How does a southeastern tier 1 research university train and support its biomedical PhD scientists for navigating their career paths? Key findings are: Many factors influence PhD scientists' career sector preference and job search process, but the most influential were relationships with faculty, particularly the mentor advisor; Planned activities are a significant aspect of the training process and provide skills for career success; and Planned activities provided skills necessary for a career, but influential factors directed the career path navigated. Implications for practice and future research are discussed.

Spatial Updating Strategy Affects the Reference Frame in Path Integration.

Science.gov (United States)

He, Qiliang; McNamara, Timothy P

2018-06-01

This study investigated how spatial updating strategies affected the selection of reference frames in path integration. Participants walked an outbound path consisting of three successive waypoints in a featureless environment and then pointed to the first waypoint. We manipulated the alignment of participants' final heading at the end of the outbound path with their initial heading to examine the adopted reference frame. We assumed that the initial heading defined the principal reference direction in an allocentric reference frame. In Experiment 1, participants were instructed to use a configural updating strategy and to monitor the shape of the outbound path while they walked it. Pointing performance was best when the final heading was aligned with the initial heading, indicating the use of an allocentric reference frame. In Experiment 2, participants were instructed to use a continuous updating strategy and to keep track of the location of the first waypoint while walking the outbound path. Pointing performance was equivalent regardless of the alignment between the final and the initial headings, indicating the use of an egocentric reference frame. These results confirmed that people could employ different spatial updating strategies in path integration (Wiener, Berthoz, & Wolbers Experimental Brain Research 208(1) 61-71, 2011), and suggested that these strategies could affect the selection of the reference frame for path integration.

Approximate Shortest Homotopic Paths in Weighted Regions

KAUST Repository

Cheng, Siu-Wing

2010-01-01

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

Approximate shortest homotopic paths in weighted regions

KAUST Repository

Cheng, Siuwing

2012-02-01

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

Open-path, closed-path and reconstructed aerosol extinction at a rural site.

Science.gov (United States)

Gordon, Timothy D; Prenni, Anthony J; Renfro, James R; McClure, Ethan; Hicks, Bill; Onasch, Timothy B; Freedman, Andrew; McMeeking, Gavin R; Chen, Ping

2018-04-09

The Handix Scientific Open-Path Cavity Ringdown Spectrometer (OPCRDS) was deployed during summer 2016 in Great Smoky Mountains National Park (GRSM). Extinction coefficients from the relatively new OPCRDS and from a more well-established extinction instrument agreed to within 7%. Aerosol hygroscopic growth (f(RH)) was calculated from the ratio of ambient extinction measured by the OPCRDS to dry extinction measured by a closed-path extinction monitor (Aerodyne's Cavity Attenuated Phase Shift Particulate Matter Extinction Monitor, CAPS PMex). Derived hygroscopicity (RH 1995 at the same site and time of year, which is noteworthy given the decreasing trend for organics and sulfate in the eastern U.S. However, maximum f(RH) values in 1995 were less than half as large as those recorded in 2016-possibly due to nephelometer truncation losses in 1995. Two hygroscopicity parameterizations were investigated using high time resolution OPCRDS+CAPS PMex data, and the K ext model was more accurate than the γ model. Data from the two ambient optical instruments, the OPCRDS and the open-path nephelometer, generally agreed; however, significant discrepancies between ambient scattering and extinction were observed, apparently driven by a combination of hygroscopic growth effects, which tend to increase nephelometer truncation losses and decrease sensitivity to the wavelength difference between the two instruments as a function of particle size. There was not a statistically significant difference in the mean reconstructed extinction values obtained from the original and the revised IMPROVE (Interagency Monitoring of Protected Visual Environments) equations. On average IMPROVE reconstructed extinction was ~25% lower than extinction measured by the OPCRDS, which suggests that the IMPROVE equations and 24-hr aerosol data are moderately successful in estimating current haze levels at GRSM. However, this conclusion is limited by the coarse temporal resolution and the low dynamic range of

Masticatory path pattern during mastication of chewing gum with regard to gender difference.

Science.gov (United States)

Kobayashi, Yoshinori; Shiga, Hiroshi; Arakawa, Ichiro; Yokoyama, Masaoki; Nakajima, Kunihisa

2009-01-01

To clarify the masticatory path patterns of the mandibular incisal point during mastication of softened chewing gum with regard to gender difference. One hundred healthy subjects (50 males and 50 females) were asked to chew softened chewing gum on one side at a time (right side and left side) and the movement of the mandibular incisal point was recorded using MKG K6I. After a catalog of path patterns was made, the movement path was classified into one of the pattern groups, and then the frequency of each pattern was investigated. A catalog of path patterns consisting of the three types of opening path (op1, linear or concave path; op2, path toward the chewing side after toward the non-working side; op3, convex path) and two types of closing path (cl1, convex path; cl2, concave path) was made. The movement path was classified into one of seven patterns, with six patterns being from the catalog and a final extra pattern in which the opening and closing paths crossed. The most common pattern among the subjects was Pattern I, followed by Patterns III, II, IV, V, VII, and VI, in that order. The majority of cases, 149 (74.5%) of 200 cases, showed either Pattern I (op1 and cl1) or Pattern III (op2 and cl1). There was no significant difference between the two genders in the frequency of each pattern. The movement path could be classified into seven patterns and no gender-related difference was found in the frequency of each pattern.

Pseudo-random tool paths for CNC sub-aperture polishing and other applications.

Science.gov (United States)

Dunn, Christina R; Walker, David D

2008-11-10

In this paper we first contrast classical and CNC polishing techniques in regard to the repetitiveness of the machine motions. We then present a pseudo-random tool path for use with CNC sub-aperture polishing techniques and report polishing results from equivalent random and raster tool-paths. The random tool-path used - the unicursal random tool-path - employs a random seed to generate a pattern which never crosses itself. Because of this property, this tool-path is directly compatible with dwell time maps for corrective polishing. The tool-path can be used to polish any continuous area of any boundary shape, including surfaces with interior perforations.

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

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

A constraint programming solution for the military unit path finding problem

CSIR Research Space (South Africa)

Leenen, L

2012-01-01

Full Text Available In this chapter the authors present an algorithm to solve the Dynamic Military Unit Path Finding Problem (DMUPFP) which is based on Stentz’s well-known D* algorithm to solve dynamic path finding problems. The Military Unit Path Finding Problem...

Air Pollution alongside Bike-Paths in Bogota - Colombia

Directory of Open Access Journals (Sweden)

Juan Felipe Franco

2016-11-01

Full Text Available The study we present in this paper aims at characterizing the range of fine particulate matter (PM2.5 and black carbon (BC concentrations to which bike-path users in Bogotá are exposed to. Using a bike equipped with a DustTrak and a micro-aethalometer we measured PM2.5 and BC concentration levels along bike-paths corridors, during weekdays and weekends. Experiments were conducted in fours streets, representing four typical configurations of bike-paths in the city. Traffic data for workdays was also available from local mobility authority. Results indicate that bike-paths users in Bogota are exposed to air pollution levels far exceeding the threshold values established as potentially dangerous for human health. Average concentrations for PM2.5 ranged between 80 and 136 ug/m3 in workdays and between 30 and 72 ug/m3 in weekends. BC mean concentrations were between 16 and 38 µg/m3 during workdays and in the range 10 to 32 µg/m3 during weekends. A statistically significant difference exists in the levels of pollutants concentrations measured during workdays and weekends for all the considered bike paths. According to our results, both traffic volume and diffusions conditions, which are affected by many factors including street geometry, affect bike-path user’s exposure levels. Taking into account the important role that bicycling is playing as an alternative transport mode in Latin American cities, we consider these results provide useful insights to increase the appreciation of the excessive bikers´ exposure to air pollution in Bogotá. Moreover, these findings contribute with technical elements that should lead to the inclusion of air quality variable when designing and planning sustainable urban mobility infrastructures.

DICOM involving XML path-tag

Science.gov (United States)

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.

Optimal Path Planner for Mobile Robot in 2D Environment

Directory of Open Access Journals (Sweden)

Valeri Kroumov

2004-06-01

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

Path covering number and L(2,1)-labeling number of graphs

OpenAIRE

Lu, Changhong; Zhou, Qing

2012-01-01

A {\\it path covering} of a graph $G$ is a set of vertex disjoint paths of $G$ containing all the vertices of $G$. The {\\it path covering number} of $G$, denoted by $P(G)$, is the minimum number of paths in a path covering of $G$. An {\\sl $k$-L(2,1)-labeling} of a graph $G$ is a mapping $f$ from $V(G)$ to the set ${0,1,...,k}$ such that $|f(u)-f(v)|\\ge 2$ if $d_G(u,v)=1$ and $|f(u)-f(v)|\\ge 1$ if $d_G(u,v)=2$. The {\\sl L(2,1)-labeling number $\\lambda (G)$} of $G$ is the smallest number $k$ suc...

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

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

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

A bat algorithm with mutation for UCAV path planning.

Science.gov (United States)

Wang, Gaige; Guo, Lihong; Duan, Hong; Liu, Luo; Wang, Heqi

2012-01-01

Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original bat algorithm (BA) is used to solve the UCAV path planning problem. Furthermore, a new bat algorithm with mutation (BAM) is proposed to solve the UCAV path planning problem, and a modification is applied to mutate between bats during the process of the new solutions updating. Then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA. The realization procedure for original BA and this improved metaheuristic approach BAM is also presented. To prove the performance of this proposed metaheuristic method, BAM is compared with BA and other population-based optimization methods, such as ACO, BBO, DE, ES, GA, PBIL, PSO, and SGA. The experiment shows that the proposed approach is more effective and feasible in UCAV path planning than the other models.

A Minimum Path Algorithm Among 3D-Polyhedral Objects

Science.gov (United States)

Yeltekin, Aysin

1989-03-01

In this work we introduce a minimum path theorem for 3D case. We also develop an algorithm based on the theorem we prove. The algorithm will be implemented on the software package we develop using C language. The theorem we introduce states that; "Given the initial point I, final point F and S be the set of finite number of static obstacles then an optimal path P from I to F, such that PA S = 0 is composed of straight line segments which are perpendicular to the edge segments of the objects." We prove the theorem as well as we develop the following algorithm depending on the theorem to find the minimum path among 3D-polyhedral objects. The algorithm generates the point Qi on edge ei such that at Qi one can find the line which is perpendicular to the edge and the IF line. The algorithm iteratively provides a new set of initial points from Qi and exploits all possible paths. Then the algorithm chooses the minimum path among the possible ones. The flowchart of the program as well as the examination of its numerical properties are included.

Bifurcation of transition paths induced by coupled bistable systems.

Science.gov (United States)

Tian, Chengzhe; Mitarai, Namiko

2016-06-07

We discuss the transition paths in a coupled bistable system consisting of interacting multiple identical bistable motifs. We propose a simple model of coupled bistable gene circuits as an example and show that its transition paths are bifurcating. We then derive a criterion to predict the bifurcation of transition paths in a generalized coupled bistable system. We confirm the validity of the theory for the example system by numerical simulation. We also demonstrate in the example system that, if the steady states of individual gene circuits are not changed by the coupling, the bifurcation pattern is not dependent on the number of gene circuits. We further show that the transition rate exponentially decreases with the number of gene circuits when the transition path does not bifurcate, while a bifurcation facilitates the transition by lowering the quasi-potential energy barrier.

Light Source Estimation with Analytical Path-tracing

OpenAIRE

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

2017-01-01

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

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

A path-integral approach to inclusive processes

International Nuclear Information System (INIS)

Sukumar, C.V.

1995-01-01

The cross section for an inclusive scattering process may be expressed in terms of a double path integral. Evaluation of the double path integral by the stationary-phase approximation yields classical equations of motion for the stationary trajectories and a classical cross section for the inclusive process which depends on the polarization of the initial state. Polarization analyzing powers are calculated from this theory and the results are compared with those obtained in an earlier paper. ((orig.))

Competition between dissociation paths of I2+ NO+ using fast laser fields

International Nuclear Information System (INIS)

Lev, U; Prabhudesai, V S; Natan, A; Schwalm, D; Bruner, B D; Silberberg, Y; Heber, O; Zajfman, D; Zohrabi, M; Gaire, B; Carnes, K D; Ben-Itzhak, I; Strasser, D

2012-01-01

The competition between dissociation paths of I 2 + and NO + molecules was studied using femtosecond laser pulses with different intensities. It was found, both for moderate fields and for strong fields, that the dissociation path strongly prefers the higher energy dissociation path with smaller kinetic energy rather than the lower energy path with higher kinetic energy.

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

Directory of Open Access Journals (Sweden)

Hyunseok Park

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

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

Science.gov (United States)

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

2016-10-01

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

On the path independence conditions for discrete-continuous demand

DEFF Research Database (Denmark)

Batley, Richard; Ibáñez Rivas, Juan Nicolás

2013-01-01

We consider the manner in which the well-established path independence conditions apply to Small and Rosen's (1981) problem of discrete-continuous demand, focussing especially upon the restricted case of discrete choice (probabilistic) demand. We note that the consumer surplus measure promoted...... by Small and Rosen, which is specific to the probabilistic demand, imposes path independence to price changes a priori. We find that path independence to income changes can further be imposed provided a numeraire good is available in the consumption set. We show that, for practical purposes, Mc...

An Introduction to Path Analysis

Science.gov (United States)

Wolfe, Lee M.

1977-01-01

The analytical procedure of path analysis is described in terms of its use in nonexperimental settings in the social sciences. The description assumes a moderate statistical background on the part of the reader. (JKS)

Completely automated open-path FT-IR spectrometry.

Science.gov (United States)

Griffiths, Peter R; Shao, Limin; Leytem, April B

2009-01-01

Atmospheric analysis by open-path Fourier-transform infrared (OP/FT-IR) spectrometry has been possible for over two decades but has not been widely used because of the limitations of the software of commercial instruments. In this paper, we describe the current state-of-the-art of the hardware and software that constitutes a contemporary OP/FT-IR spectrometer. We then describe advances that have been made in our laboratory that have enabled many of the limitations of this type of instrument to be overcome. These include not having to acquire a single-beam background spectrum that compensates for absorption features in the spectra of atmospheric water vapor and carbon dioxide. Instead, an easily measured "short path-length" background spectrum is used for calculation of each absorbance spectrum that is measured over a long path-length. To accomplish this goal, the algorithm used to calculate the concentrations of trace atmospheric molecules was changed from classical least-squares regression (CLS) to partial least-squares regression (PLS). For calibration, OP/FT-IR spectra are measured in pristine air over a wide variety of path-lengths, temperatures, and humidities, ratioed against a short-path background, and converted to absorbance; the reference spectrum of each analyte is then multiplied by randomly selected coefficients and added to these background spectra. Automatic baseline correction for small molecules with resolved rotational fine structure, such as ammonia and methane, is effected using wavelet transforms. A novel method of correcting for the effect of the nonlinear response of mercury cadmium telluride detectors is also incorporated. Finally, target factor analysis may be used to detect the onset of a given pollutant when its concentration exceeds a certain threshold. In this way, the concentration of atmospheric species has been obtained from OP/FT-IR spectra measured at intervals of 1 min over a period of many hours with no operator intervention.

Force characteristics in continuous path controlled crankpin grinding

Science.gov (United States)

Zhang, Manchao; Yao, Zhenqiang

2015-03-01

Recent research on the grinding force involved in cylindrical plunge grinding has focused mainly on steady-state conditions. Unlike in conventional external cylindrical plunge grinding, the conditions between the grinding wheel and the crankpin change periodically in path controlled grinding because of the eccentricity of the crankpin and the constant rotational speed of the crankshaft. The objective of this study is to investigate the effects of various grinding conditions on the characteristics of the grinding force during continuous path controlled grinding. Path controlled plunge grinding is conducted at a constant rotational speed using a cubic boron nitride (CBN) wheel. The grinding force is determined by measuring the torque. The experimental results show that the force and torque vary sinusoidally during dry grinding and load grinding. The variations in the results reveal that the resultant grinding force and torque decrease with higher grinding speeds and increase with higher peripheral speeds of the pin and higher grinding depths. In path controlled grinding, unlike in conventional external cylindrical plunge grinding, the axial grinding force cannot be disregarded. The speeds and speed ratios of the workpiece and wheel are also analyzed, and the analysis results show that up-grinding and down-grinding occur during the grinding process. This paper proposes a method for describing the force behavior under varied process conditions during continuous path controlled grinding, which provides a beneficial reference for describing the material removal mechanism and for optimizing continuous controlled crankpin grinding.

A constructive approach to minimal free resolutions of path ideals of trees

Directory of Open Access Journals (Sweden)

Rachelle R. Bouchat

2017-01-01

Full Text Available For a rooted tree $\\Gamma$, we consider path ideals of $\\Gamma$, which are ideals that are generated by all directed paths of a fixed length in $\\Gamma$. In this paper, we provide a combinatorial description of the minimal free resolution of these path ideals. In particular, we provide a class of subforests of $\\Gamma$ that are in one-to-one correspondence with the multi-graded Betti numbers of the path ideal as well as providing a method for determining the projective dimension and the Castelnuovo-Mumford regularity of a given path ideal.

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

δ'-function perturbations and Neumann boundary-conditions by path integration

International Nuclear Information System (INIS)

Grosche, C.

1994-02-01

δ'-function perturbations and Neumann boundary conditions are incorporated into the path integral formalism. The starting point is the consideration of the path integral representation for the one dimensional Dirac particle together with a relativistic point interaction. The non-relativistic limit yields either a usual δ-function or a δ'-function perturbation; making their strengths infinitely repulsive one obtains Dirichlet, respectively Neumann boundary conditions in the path integral. (orig.)

Path-integral method for the source apportionment of photochemical pollutants

Science.gov (United States)

Dunker, A. M.

2015-06-01

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

Vapor nucleation paths in lyophobic nanopores.

Science.gov (United States)

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

Cyclic fatigue resistance of R-Pilot, HyFlex EDM and PathFile nickel-titanium glide path files in artificial canals with double (S-shaped) curvature.

Science.gov (United States)

Uslu, G; Özyürek, T; Yılmaz, K; Gündoğar, M

2018-05-01

To examine the cyclic fatigue resistances of R-Pilot, HyFlex EDM and PathFile NiTi glide path files in S-shaped artificial canals. Twenty R-Pilot (12.5/.04), 20 HyFlex EDM (10/.05) and 20 PathFile (19/.02) single-file glide path files were included. Sixty files (n: 20/each) were subjected to static cyclic fatigue testing using double-curved canals until fracture occurred (TF). The number of cycles to fracture (NCF) was calculated by multiplying the rpm value by the TF. The length of the fractured fragment (FL) was determined by a digital microcaliper. Six samples of fractured files (n: 2/each) were examined by SEM to determine the fracture mode. The NCF and the FL data were analysed using one-way anova, post hoc Tamhane and Kruskal-Wallis tests using SPPS 21 software. The significance level was set at 5%. In the double-curved canal, all the files fractured first in the apical curvature and then in the coronal curvature. The NCF values revealed that the R-Pilot had the greatest cyclic fatigue resistance, followed by the HyFlex EDM and PathFile in both the apical and coronal curvatures (P < 0.05). R-Pilot NiTi glide path files, used in a reciprocating motion, had the greatest cyclic fatigue resistance amongst the tested NiTi glide path files in an artificial S-shaped canal. © 2017 International Endodontic Journal. Published by John Wiley & Sons Ltd.

Comment on 'Path integral solution for a Mie-type potential'

International Nuclear Information System (INIS)

Steiner, F.

1985-01-01

We comment on several incorrect results given in a recent paper by Erkoc and Sever (ES). In particular, it is pointed out that their path integral formula for the one-dimensional Mie-Lennard-Jones potential is wrong, since a quantum correction proportional to (h/2π) 2 - which is a consequence of the stochastic nature of the Feynman paths - has been overlooked. The correct expression can be obtained from a general path integral formula, which we have derived in a previous paper. For the particular potential discussed in detail by ES, we give a complete path integral treatment, which allows us to derive the energies and normalized wave functions of the discrete spectrum. (orig.)

Safe Maritime Autonomous Path Planning in a High Sea State

Science.gov (United States)

Ono, Masahiro; Quadrelli, Marco; Huntsberger, Terrance L.

2014-01-01

This paper presents a path planning method for sea surface vehicles that prevents capsizing and bow-diving in a high sea-state. A key idea is to use response amplitude operators (RAOs) or, in control terminology, the transfer functions from a sea state to a vessel's motion, in order to find a set of speeds and headings that results in excessive pitch and roll oscillations. This information is translated to arithmetic constraints on the ship's velocity, which are passed to a model predictive control (MPC)-based path planner to find a safe and optimal path that achieves specified goals. An obstacle avoidance capability is also added to the path planner. The proposed method is demonstrated by simulations.

Primal-dual path-following algorithms for circular programming

Directory of Open Access Journals (Sweden)

Baha Alzalg

2017-06-01

Full Text Available Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case‎. ‎Alizadeh and Goldfarb [Math‎. ‎Program‎. ‎Ser‎. ‎A 95 (2003 3--51] introduced primal-dual path-following algorithms for solving second-order cone programming problems‎. ‎In this paper‎, ‎we generalize their work by using the machinery of Euclidean Jordan algebras associated with the circular cones to derive primal-dual path-following interior point algorithms for circular programming problems‎. ‎We prove polynomial convergence of the proposed algorithms by showing that the circular logarithmic barrier is a strongly self-concordant barrier‎. ‎The numerical examples show the path-following algorithms are simple and efficient‎.

Extended charge banking model of dual path shocks for implantable cardioverter defibrillators.

Science.gov (United States)

Dosdall, Derek J; Sweeney, James D

2008-08-01

Single path defibrillation shock methods have been improved through the use of the Charge Banking Model of defibrillation, which predicts the response of the heart to shocks as a simple resistor-capacitor (RC) circuit. While dual path defibrillation configurations have significantly reduced defibrillation thresholds, improvements to dual path defibrillation techniques have been limited to experimental observations without a practical model to aid in improving dual path defibrillation techniques. The Charge Banking Model has been extended into a new Extended Charge Banking Model of defibrillation that represents small sections of the heart as separate RC circuits, uses a weighting factor based on published defibrillation shock field gradient measures, and implements a critical mass criteria to predict the relative efficacy of single and dual path defibrillation shocks. The new model reproduced the results from several published experimental protocols that demonstrated the relative efficacy of dual path defibrillation shocks. The model predicts that time between phases or pulses of dual path defibrillation shock configurations should be minimized to maximize shock efficacy. Through this approach the Extended Charge Banking Model predictions may be used to improve dual path and multi-pulse defibrillation techniques, which have been shown experimentally to lower defibrillation thresholds substantially. The new model may be a useful tool to help in further improving dual path and multiple pulse defibrillation techniques by predicting optimal pulse durations and shock timing parameters.

Dynamic Path Analysis in Life-Course Epidemiology

DEFF Research Database (Denmark)

Gamborg, Michael Orland; Boje Jensen, Gorm; Sørensen, Thorkild I.A.

2011-01-01

it works through other risk factors. In this paper, the dynamic path analysis model is presented as a tool to analyze these dynamic mechanisms in life-course epidemiology. A key feature of dynamic path analysis is its ability to decompose the total effect of a risk factor into a direct effect (not mediated...... by other variables) and indirect effects (mediated through other variables). This is illustrated by examining the associations between repeated measurements of body mass index (BMI) and systolic blood pressure (SBP) and the risk of CHD in a sample of Danish men between 1976 and 2006. The effect of baseline...... BMI on the risk of CHD is decomposed into a direct effect and indirect effects going through later BMI, concurrent SBP, or later SBP. In conclusion, dynamic path analysis is a flexible tool that by the decomposition of effects can be used to increase the understanding of mechanisms that underlie...

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.

A numerical scheme for optimal transition paths of stochastic chemical kinetic systems

International Nuclear Information System (INIS)

Liu Di

2008-01-01

We present a new framework for finding the optimal transition paths of metastable stochastic chemical kinetic systems with large system size. The optimal transition paths are identified to be the most probable paths according to the Large Deviation Theory of stochastic processes. Dynamical equations for the optimal transition paths are derived using the variational principle. A modified Minimum Action Method (MAM) is proposed as a numerical scheme to solve the optimal transition paths. Applications to Gene Regulatory Networks such as the toggle switch model and the Lactose Operon Model in Escherichia coli are presented as numerical examples

Girsanov reweighting for path ensembles and Markov state models

Science.gov (United States)

Donati, L.; Hartmann, C.; Keller, B. G.

2017-06-01

The sensitivity of molecular dynamics on changes in the potential energy function plays an important role in understanding the dynamics and function of complex molecules. We present a method to obtain path ensemble averages of a perturbed dynamics from a set of paths generated by a reference dynamics. It is based on the concept of path probability measure and the Girsanov theorem, a result from stochastic analysis to estimate a change of measure of a path ensemble. Since Markov state models (MSMs) of the molecular dynamics can be formulated as a combined phase-space and path ensemble average, the method can be extended to reweight MSMs by combining it with a reweighting of the Boltzmann distribution. We demonstrate how to efficiently implement the Girsanov reweighting in a molecular dynamics simulation program by calculating parts of the reweighting factor "on the fly" during the simulation, and we benchmark the method on test systems ranging from a two-dimensional diffusion process and an artificial many-body system to alanine dipeptide and valine dipeptide in implicit and explicit water. The method can be used to study the sensitivity of molecular dynamics on external perturbations as well as to reweight trajectories generated by enhanced sampling schemes to the original dynamics.

Algorithm for shortest path search in Geographic Information Systems by using reduced graphs.

Science.gov (United States)

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.

Some illustrative examples of Mayer's interference in the path integral

International Nuclear Information System (INIS)

Fizichev, P.P.

1983-01-01

A new technique is proposed for evaluation of path integrals by means of a discretization procedure. It is based on the previously established necessity to single out the set of classical trajectories along which the summation is performed. The notion of Mayer interference is introduced and is illustrated on a number of simple examples. It is shown that the choice of the set of paths induced a corresponding quantization prosymmetries of the problem. The possibility is shown of extracting information about the space of quantum states from the path integral. A class of paths is established the summation over which in the framework of the suggested approach leads to the well-known results for the motion is a homogeneous field and for the harmonic oscillator

An empirical typology of hospital nurses' individual learning paths

NARCIS (Netherlands)

Poell, R.F.; van der Krogt, F.J.

2014-01-01

Background A relatively new theoretical concept is proposed in this paper, namely, the individual learning path. Learning paths are created by individual employees and comprise a set of learning-relevant activities that are both coherent as a whole and meaningful to them. Objectives To explore the

Defect-vectors and path integrals in fracture mechanics

International Nuclear Information System (INIS)

Roche, R.L.

1979-01-01

It seems necessary to introduce the J integral without hypothesis on material behavior. The aim of this paper is this introduction and its consequences. Successively are presented: introduction to defect-vectors and defect-momentum, definition of J(K) and J(L) integrals, equilibrium and energy momentum tensor, energetic signification of the path J and L integrals, and local aspects of the criteria based on path integrals [fr

Global optimal path planning of an autonomous vehicle for overtaking a moving obstacle

Directory of Open Access Journals (Sweden)

B. Mashadi

Full Text Available In this paper, the global optimal path planning of an autonomous vehicle for overtaking a moving obstacle is proposed. In this study, the autonomous vehicle overtakes a moving vehicle by performing a double lane-change maneuver after detecting it in a proper distance ahead. The optimal path of vehicle for performing the lane-change maneuver is generated by a path planning program in which the sum of lateral deviation of the vehicle from a reference path and the rate of steering angle become minimum while the lateral acceleration of vehicle does not exceed a safe limit value. A nonlinear optimal control theory with the lateral vehicle dynamics equations and inequality constraint of lateral acceleration are used to generate the path. The indirect approach for solving the optimal control problem is used by applying the calculus of variation and the Pontryagin's Minimum Principle to obtain first-order necessary conditions for optimality. The optimal path is generated as a global optimal solution and can be used as the benchmark of the path generated by the local motion planning of autonomous vehicles. A full nonlinear vehicle model in CarSim software is used for path following simulation by importing path data from the MATLAB code. The simulation results show that the generated path for the autonomous vehicle satisfies all vehicle dynamics constraints and hence is a suitable overtaking path for the following vehicle.

A self-interfering clock as a "which path" witness.

Science.gov (United States)

Margalit, Yair; Zhou, Zhifan; Machluf, Shimon; Rohrlich, Daniel; Japha, Yonathan; Folman, Ron

2015-09-11

In Einstein's general theory of relativity, time depends locally on gravity; in standard quantum theory, time is global-all clocks "tick" uniformly. We demonstrate a new tool for investigating time in the overlap of these two theories: a self-interfering clock, comprising two atomic spin states. We prepare the clock in a spatial superposition of quantum wave packets, which evolve coherently along two paths into a stable interference pattern. If we make the clock wave packets "tick" at different rates, to simulate a gravitational time lag, the clock time along each path yields "which path" information, degrading the pattern's visibility. In contrast, in standard interferometry, time cannot yield "which path" information. This proof-of-principle experiment may have implications for the study of time and general relativity and their impact on fundamental effects such as decoherence and the emergence of a classical world. Copyright © 2015, American Association for the Advancement of Science.

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

Science.gov (United States)

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

2018-05-10

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

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

Science.gov (United States)

Chrastil, Elizabeth R; Warren, William H

2017-06-01

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

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.

Path stability of a crack with an eigenstrain

International Nuclear Information System (INIS)

Beom, Hyeon Gyu; Kim, Yu Hwan; Cho, Chong Du; Kim, Chang Boo

2006-01-01

A slightly curved crack with an eigenstrain is considered. Solutions for a slightly curved crack in a linear isotropic material under asymptotic loading as well as for a slightly curved crack in a linear isotropic material with a concentrated force are obtained from perturbation analyses, which are accurate to the first order of the parameter representing the non-straightness. Stress intensity factors for a slightly curved crack with an eigenstrain are obtained from the perturbation solutions by using a body force analogy. Particular attention is given to the crack path stability under mode I loading. A new parameter of crack path stability is proposed for a crack with an eigenstrain. The path stability of a crack with steady state growth in a transforming material and a ferroelectric material is examined

A NEW APPROACH ON SHORTEST PATH IN FUZZY ENVIRONMENT

OpenAIRE

A. Nagoorgani; A. Mumtaj Begam

2010-01-01

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

Simulation and validation of concentrated subsurface lateral flow paths in an agricultural landscape

Science.gov (United States)

Zhu, Q.; Lin, H. S.

2009-08-01

The importance of soil water flow paths to the transport of nutrients and contaminants has long been recognized. However, effective means of detecting concentrated subsurface flow paths in a large landscape are still lacking. The flow direction and accumulation algorithm based on single-direction flow algorithm (D8) in GIS hydrologic modeling is a cost-effective way to simulate potential concentrated flow paths over a large area once relevant data are collected. This study tested the D8 algorithm for simulating concentrated lateral flow paths at three interfaces in soil profiles in a 19.5-ha agricultural landscape in central Pennsylvania, USA. These interfaces were (1) the interface between surface plowed layers of Ap1 and Ap2 horizons, (2) the interface with subsoil water-restricting clay layer where clay content increased to over 40%, and (3) the soil-bedrock interface. The simulated flow paths were validated through soil hydrologic monitoring, geophysical surveys, and observable soil morphological features. The results confirmed that concentrated subsurface lateral flow occurred at the interfaces with the clay layer and the underlying bedrock. At these two interfaces, the soils on the simulated flow paths were closer to saturation and showed more temporally unstable moisture dynamics than those off the simulated flow paths. Apparent electrical conductivity in the soil on the simulated flow paths was elevated and temporally unstable as compared to those outside the simulated paths. The soil cores collected from the simulated flow paths showed significantly higher Mn content at these interfaces than those away from the simulated paths. These results suggest that (1) the D8 algorithm is useful in simulating possible concentrated subsurface lateral flow paths if used with appropriate threshold value of contributing area and sufficiently detailed digital elevation model (DEM); (2) repeated electromagnetic surveys can reflect the temporal change of soil water storage

Classical and quantum dynamics from classical paths to path integrals

CERN Document Server

Dittrich, Walter

2016-01-01

Graduate students who want to become familiar with advanced computational strategies in classical and quantum dynamics will find here both the fundamentals of a standard course and a detailed treatment of the time-dependent oscillator, Chern-Simons mechanics, the Maslov anomaly and the Berry phase, to name a few. Well-chosen and detailed examples illustrate the perturbation theory, canonical transformations, the action principle and demonstrate the usage of path integrals. This new edition has been revised and enlarged with chapters on quantum electrodynamics, high energy physics, Green’s functions and strong interaction.

On load paths and load bearing topology from finite element analysis

International Nuclear Information System (INIS)

Kelly, D; Reidsema, C; Lee, M

2010-01-01

Load paths can be mapped from vector plots of 'pointing stress vectors'. They define a path along which a component of load remains constant as it traverses the solution domain. In this paper the theory for the paths is first defined. Properties of the plots that enable a designer to interpret the structural behavior from the contours are then identified. Because stress is a second order tensor defined on an orthogonal set of axes, the vector plots define separate paths for load transfer in each direction of the set of axes. An algorithm is therefore presented that combines the vectors to define a topology to carry the loads. The algorithm is shown to straighten the paths reducing bending moments and removing stress concentration. Application to a bolted joint, a racing car body and a yacht hull demonstrate the usefulness of the plots.

Kinetic constrained optimization of the golf swing hub path.

Science.gov (United States)

Nesbit, Steven M; McGinnis, Ryan S

2014-12-01

This study details an optimization of the golf swing, where the hand path and club angular trajectories are manipulated. The optimization goal was to maximize club head velocity at impact within the interaction kinetic limitations (force, torque, work, and power) of the golfer as determined through the analysis of a typical swing using a two-dimensional dynamic model. The study was applied to four subjects with diverse swing capabilities and styles. It was determined that it is possible for all subjects to increase their club head velocity at impact within their respective kinetic limitations through combined modifications to their respective hand path and club angular trajectories. The manner of the modifications, the degree of velocity improvement, the amount of kinetic reduction, and the associated kinetic limitation quantities were subject dependent. By artificially minimizing selected kinetic inputs within the optimization algorithm, it was possible to identify swing trajectory characteristics that indicated relative kinetic weaknesses of a subject. Practical implications are offered based upon the findings of the study. Key PointsThe hand path trajectory is an important characteristic of the golf swing and greatly affects club head velocity and golfer/club energy transfer.It is possible to increase the energy transfer from the golfer to the club by modifying the hand path and swing trajectories without increasing the kinetic output demands on the golfer.It is possible to identify relative kinetic output strengths and weakness of a golfer through assessment of the hand path and swing trajectories.Increasing any one of the kinetic outputs of the golfer can potentially increase the club head velocity at impact.The hand path trajectory has important influences over the club swing trajectory.

PathNet: a tool for pathway analysis using topological information

Directory of Open Access Journals (Sweden)

Dutta Bhaskar

2012-09-01

Full Text Available Abstract Background Identification of canonical pathways through enrichment of differentially expressed genes in a given pathway is a widely used method for interpreting gene lists generated from high-throughput experimental studies. However, most algorithms treat pathways as sets of genes, disregarding any inter- and intra-pathway connectivity information, and do not provide insights beyond identifying lists of pathways. Results We developed an algorithm (PathNet that utilizes the connectivity information in canonical pathway descriptions to help identify study-relevant pathways and characterize non-obvious dependencies and connections among pathways using gene expression data. PathNet considers both the differential expression of genes and their pathway neighbors to strengthen the evidence that a pathway is implicated in the biological conditions characterizing the experiment. As an adjunct to this analysis, PathNet uses the connectivity of the differentially expressed genes among all pathways to score pathway contextual associations and statistically identify biological relations among pathways. In this study, we used PathNet to identify biologically relevant results in two Alzheimer’s disease microarray datasets, and compared its performance with existing methods. Importantly, PathNet identified de-regulation of the ubiquitin-mediated proteolysis pathway as an important component in Alzheimer’s disease progression, despite the absence of this pathway in the standard enrichment analyses. Conclusions PathNet is a novel method for identifying enrichment and association between canonical pathways in the context of gene expression data. It takes into account topological information present in pathways to reveal biological information. PathNet is available as an R workspace image from http://www.bhsai.org/downloads/pathnet/.

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

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.

MATHEMATICAL MODELLING OF AIRCRAFT PILOTING PROSSESS UNDER SPECIFIED FLIGHT PATH

Directory of Open Access Journals (Sweden)

И. Кузнецов

2012-04-01

Full Text Available The author suggests mathematical model of pilot’s activity as follow up system and mathematical methods of pilot’s activity description. The main idea of the model is flight path forming and aircraft stabilization on it during instrument flight. Input of given follow up system is offered to be aircraft deflection from given path observed by pilot by means of sight and output is offered to be pilot’s regulating actions for aircraft stabilization on flight path.

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

Directory of Open Access Journals (Sweden)

As'ad Mahmoud As'ad ALNASER

2017-04-01

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

Fast orthogonal transforms and generation of Brownian paths.

Science.gov (United States)

Leobacher, Gunther

2012-04-01

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

Graphs with No Induced Five-Vertex Path or Antipath

DEFF Research Database (Denmark)

Chudnovsky, Maria; Esperet, Louis; Lemoine, Laetitia

2017-01-01

We prove that a graph G contains no induced five-vertex path and no induced complement of a five-vertex path if and only if G is obtained from 5-cycles and split graphs by repeatedly applying the following operations: substitution, split unification, and split unification in the complement, where...

SecureCore Software Architecture: Trusted Path Application (TPA) Requirements

National Research Council Canada - National Science Library

Clark, Paul C; Irvine, Cynthia E; Levin, Timothy E; Nguyen, Thuy D; Vidas, Timothy M

2007-01-01

.... A high-level architecture is described to provide such features. In addition, a usage scenario is described for a potential use of the architecture, with emphasis on the trusted path, a non-spoofable user interface to the trusted components of the system. Detailed requirements for the trusted path are provided.

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.

Alternative Constraint Handling Technique for Four-Bar Linkage Path Generation

Science.gov (United States)

Sleesongsom, S.; Bureerat, S.

2018-03-01

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

Image-based path planning for automated virtual colonoscopy navigation

Science.gov (United States)

Hong, Wei

2008-03-01

Virtual colonoscopy (VC) is a noninvasive method for colonic polyp screening, by reconstructing three-dimensional models of the colon using computerized tomography (CT). In virtual colonoscopy fly-through navigation, it is crucial to generate an optimal camera path for efficient clinical examination. In conventional methods, the centerline of the colon lumen is usually used as the camera path. In order to extract colon centerline, some time consuming pre-processing algorithms must be performed before the fly-through navigation, such as colon segmentation, distance transformation, or topological thinning. In this paper, we present an efficient image-based path planning algorithm for automated virtual colonoscopy fly-through navigation without the requirement of any pre-processing. Our algorithm only needs the physician to provide a seed point as the starting camera position using 2D axial CT images. A wide angle fisheye camera model is used to generate a depth image from the current camera position. Two types of navigational landmarks, safe regions and target regions are extracted from the depth images. Camera position and its corresponding view direction are then determined using these landmarks. The experimental results show that the generated paths are accurate and increase the user comfort during the fly-through navigation. Moreover, because of the efficiency of our path planning algorithm and rendering algorithm, our VC fly-through navigation system can still guarantee 30 FPS.

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

Statistical Analysis of the First Passage Path Ensemble of Jump Processes

Science.gov (United States)

von Kleist, Max; Schütte, Christof; Zhang, Wei

2018-02-01

The transition mechanism of jump processes between two different subsets in state space reveals important dynamical information of the processes and therefore has attracted considerable attention in the past years. In this paper, we study the first passage path ensemble of both discrete-time and continuous-time jump processes on a finite state space. The main approach is to divide each first passage path into nonreactive and reactive segments and to study them separately. The analysis can be applied to jump processes which are non-ergodic, as well as continuous-time jump processes where the waiting time distributions are non-exponential. In the particular case that the jump processes are both Markovian and ergodic, our analysis elucidates the relations between the study of the first passage paths and the study of the transition paths in transition path theory. We provide algorithms to numerically compute statistics of the first passage path ensemble. The computational complexity of these algorithms scales with the complexity of solving a linear system, for which efficient methods are available. Several examples demonstrate the wide applicability of the derived results across research areas.

Planning paths through a spatial hierarchy - Eliminating stair-stepping effects

Science.gov (United States)

Slack, Marc G.

1989-01-01

Stair-stepping effects are a result of the loss of spatial continuity resulting from the decomposition of space into a grid. This paper presents a path planning algorithm which eliminates stair-stepping effects induced by the grid-based spatial representation. The algorithm exploits a hierarchical spatial model to efficiently plan paths for a mobile robot operating in dynamic domains. The spatial model and path planning algorithm map to a parallel machine, allowing the system to operate incrementally, thereby accounting for unexpected events in the operating space.

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.

Robust Adaptive Photon Tracing using Photon Path Visibility

DEFF Research Database (Denmark)

Hachisuka, Toshiya; Jensen, Henrik Wann

2011-01-01

We present a new adaptive photon tracing algorithm which can handle illumination settings that are considered difficult for photon tracing approaches such as outdoor scenes, close-ups of a small part of an illuminated region, and illumination coming through a small gap. The key contribution in our...... algorithm is the use of visibility of photon path as the importance function which ensures that our sampling algorithm focuses on paths that are visible from the given viewpoint. Our sampling algorithm builds on two recent developments in Markov chain Monte Carlo methods: adaptive Markov chain sampling...... and replica exchange. Using these techniques, each photon path is adaptively mutated and it explores the sampling space efficiently without being stuck at a local peak of the importance function. We have implemented this sampling approach in the progressive photon mapping algorithm which provides visibility...

Path Planning Algorithms for Autonomous Border Patrol Vehicles

Science.gov (United States)

Lau, George Tin Lam

This thesis presents an online path planning algorithm developed for unmanned vehicles in charge of autonomous border patrol. In this Pursuit-Evasion game, the unmanned vehicle is required to capture multiple trespassers on its own before any of them reach a target safe house where they are safe from capture. The problem formulation is based on Isaacs' Target Guarding problem, but extended to the case of multiple evaders. The proposed path planning method is based on Rapidly-exploring random trees (RRT) and is capable of producing trajectories within several seconds to capture 2 or 3 evaders. Simulations are carried out to demonstrate that the resulting trajectories approach the optimal solution produced by a nonlinear programming-based numerical optimal control solver. Experiments are also conducted on unmanned ground vehicles to show the feasibility of implementing the proposed online path planning algorithm on physical applications.

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

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

All new custom path photo book creation

Science.gov (United States)

Wang, Wiley; Muzzolini, Russ

2012-03-01

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

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

Designing the Alluvial Riverbeds in Curved Paths

Science.gov (United States)

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.

Interactive multi-objective path planning through a palette-based user interface

Science.gov (United States)

Shaikh, Meher T.; Goodrich, Michael A.; Yi, Daqing; Hoehne, Joseph

2016-05-01

n a problem where a human uses supervisory control to manage robot path-planning, there are times when human does the path planning, and if satisfied commits those paths to be executed by the robot, and the robot executes that plan. In planning a path, the robot often uses an optimization algorithm that maximizes or minimizes an objective. When a human is assigned the task of path planning for robot, the human may care about multiple objectives. This work proposes a graphical user interface (GUI) designed for interactive robot path-planning when an operator may prefer one objective over others or care about how multiple objectives are traded off. The GUI represents multiple objectives using the metaphor of an artist's palette. A distinct color is used to represent each objective, and tradeoffs among objectives are balanced in a manner that an artist mixes colors to get the desired shade of color. Thus, human intent is analogous to the artist's shade of color. We call the GUI an "Adverb Palette" where the word "Adverb" represents a specific type of objective for the path, such as the adverbs "quickly" and "safely" in the commands: "travel the path quickly", "make the journey safely". The novel interactive interface provides the user an opportunity to evaluate various alternatives (that tradeoff between different objectives) by allowing her to visualize the instantaneous outcomes that result from her actions on the interface. In addition to assisting analysis of various solutions given by an optimization algorithm, the palette has additional feature of allowing the user to define and visualize her own paths, by means of waypoints (guiding locations) thereby spanning variety for planning. The goal of the Adverb Palette is thus to provide a way for the user and robot to find an acceptable solution even though they use very different representations of the problem. Subjective evaluations suggest that even non-experts in robotics can carry out the planning tasks with a

A new type of phase-space path integral

International Nuclear Information System (INIS)

Marinov, M.S.

1991-01-01

Evolution of Wigner's quasi-distribution of a quantum system is represented by means of a path integral in phase space. Instead of the Hamiltonian action, a new functional is present in the integral, and its extrema in the functional space are also given by the classical trajectories. The phase-space paths appear in the integral with real weights, so complex integrals are not necessary. The semiclassical approximation and some applications are discussed briefly. (orig.)

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 to Prosperity

OpenAIRE

Wolfowitz,Paul

2006-01-01

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

Aircraft path planning for optimal imaging using dynamic cost functions

Science.gov (United States)

Christie, Gordon; Chaudhry, Haseeb; Kochersberger, Kevin

2015-05-01

Unmanned aircraft development has accelerated with recent technological improvements in sensing and communications, which has resulted in an "applications lag" for how these aircraft can best be utilized. The aircraft are becoming smaller, more maneuverable and have longer endurance to perform sensing and sampling missions, but operating them aggressively to exploit these capabilities has not been a primary focus in unmanned systems development. This paper addresses a means of aerial vehicle path planning to provide a realistic optimal path in acquiring imagery for structure from motion (SfM) reconstructions and performing radiation surveys. This method will allow SfM reconstructions to occur accurately and with minimal flight time so that the reconstructions can be executed efficiently. An assumption is made that we have 3D point cloud data available prior to the flight. A discrete set of scan lines are proposed for the given area that are scored based on visibility of the scene. Our approach finds a time-efficient path and calculates trajectories between scan lines and over obstacles encountered along those scan lines. Aircraft dynamics are incorporated into the path planning algorithm as dynamic cost functions to create optimal imaging paths in minimum time. Simulations of the path planning algorithm are shown for an urban environment. We also present our approach for image-based terrain mapping, which is able to efficiently perform a 3D reconstruction of a large area without the use of GPS data.

A Hybrid 3D Path Planning Method for UAVs

DEFF Research Database (Denmark)

Ortiz-Arroyo, Daniel

2015-01-01

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

Mean free path of nucleons in a Fermi gas at finite temperature

International Nuclear Information System (INIS)

Collins, M.T.; Griffin, J.J.

1980-01-01

The mean free path of a nucleon in a nuclear Fermi gas at finite temperature is calculated by utilizing the free nucleon-nucleon cross section modified to suppress final states excluded by the Pauli principle. The results agree with an earlier zero-temperature calculation but yield substantially smaller values than a previous finite-temperature analysis. The Fermi gas mean free paths are some two to four times shorter than those implied by phenomenological imaginary optical potentials, suggesting that the present Fermi gas model fails to adequately describe the physical processes determining the mean free path. Even so, the present results, taken as lower bounds on te mean free path, require temperatures of some 4.5 MeV before the mean free path of bound nucleons becomes as short as the nuclear diameter. It follows that very high excitation energies are prerequisite to any short mean free path assumption in nuclear heavy-ion collisions. (orig.)

Knowledge-inducing Global Path Planning for Robots in Environment with Hybrid Terrain

Directory of Open Access Journals (Sweden)

Yi-nan Guo

2010-09-01

Full Text Available In complex environment with hybrid terrain, different regions may have different terrain. Path planning for robots in such environment is an open NP-complete problem, which lacks effective methods. The paper develops a novel global path planning method based on common sense and evolution knowledge by adopting dual evolution structure in culture algorithms. Common sense describes terrain information and feasibility of environment, which is used to evaluate and select the paths. Evolution knowledge describes the angle relationship between the path and the obstacles, or the common segments of paths, which is used to judge and repair infeasible individuals. Taken two types of environments with different obstacles and terrain as examples, simulation results indicate that the algorithm can effectively solve path planning problem in complex environment and decrease the computation complexity for judgment and repair of infeasible individuals. It also can improve the convergence speed and have better computation stability.

Cooperative Path-Planning for Multi-Vehicle Systems

Directory of Open Access Journals (Sweden)

Qichen Wang

2014-11-01

Full Text Available In this paper, we propose a collision avoidance algorithm for multi-vehicle systems, which is a common problem in many areas, including navigation and robotics. In dynamic environments, vehicles may become involved in potential collisions with each other, particularly when the vehicle density is high and the direction of travel is unrestricted. Cooperatively planning vehicle movement can effectively reduce and fairly distribute the detour inconvenience before subsequently returning vehicles to their intended paths. We present a novel method of cooperative path planning for multi-vehicle systems based on reinforcement learning to address this problem as a decision process. A dynamic system is described as a multi-dimensional space formed by vectors as states to represent all participating vehicles’ position and orientation, whilst considering the kinematic constraints of the vehicles. Actions are defined for the system to transit from one state to another. In order to select appropriate actions whilst satisfying the constraints of path smoothness, constant speed and complying with a minimum distance between vehicles, an approximate value function is iteratively developed to indicate the desirability of every state-action pair from the continuous state space and action space. The proposed scheme comprises two phases. The convergence of the value function takes place in the former learning phase, and it is then used as a path planning guideline in the subsequent action phase. This paper summarizes the concept and methodologies used to implement this online cooperative collision avoidance algorithm and presents results and analysis regarding how this cooperative scheme improves upon two baseline schemes where vehicles make movement decisions independently.

Epidemic extinction paths in complex networks

Science.gov (United States)

Hindes, Jason; Schwartz, Ira B.

2017-05-01

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

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.

Patterns and singular features of extreme fluctuational paths of a periodically driven system

International Nuclear Information System (INIS)

Chen, Zhen; Liu, Xianbin

2016-01-01

Large fluctuations of an overdamped periodically driven oscillating system are investigated theoretically and numerically in the limit of weak noise. Optimal paths fluctuating to certain point are given by statistical analysis using the concept of prehistory probability distribution. The validity of statistical results is verified by solutions of boundary value problem. Optimal paths are found to change topologically when terminating points lie at opposite side of a switching line. Patterns of extreme paths are plotted through a proper parameterization of Lagrangian manifold having complicated structures. Several extreme paths to the same point are obtained by multiple solutions of boundary value solutions. Actions along various extreme paths are calculated and associated analysis is performed in relation to the singular features of the patterns. - Highlights: • Both extreme and optimal paths are obtained by various methods. • Boundary value problems are solved to ensure the validity of statistical results. • Topological structure of Lagrangian manifold is considered. • Singularities of the pattern of extreme paths are studied.

MultiPaths Revisited - A novel approach using OpenFlow-enabled devices

CERN Document Server

Al-Shabibi, Ali; Martin, Brian

2011-06-11

This thesis presents novel approaches enhancing the performance of computer networks using multipaths. Our enhancements take the form of congestion-aware routing protocols. We present three protocols called MultiRoute, Step-Route, and finally PathRoute. Each of these protocols leverage both local and remote congestion statistics and build different representations (or views) of the network congestion by using an innovative representation of congestion for router-router links. These congestion statistics are then distributed via an aggregation protocol to other routers in the network. For many years, multipath routing protocols have only been used in simple situations, such as Link Aggregation and/or networks where paths of equal cost (and therefore equal delay) exist. But, paths of unequal costs are often discarded to the benefit of shortest path only routing because it is known that paths of unequal length present different delays and therefore cause out of order packets which cause catastrophic network per...

Methodology for using root locus technique for mobile robots path planning

Directory of Open Access Journals (Sweden)

Mario Ricardo Arbulú Saavedra

2015-11-01

Full Text Available This paper shows the analysis and the implementation methodology of the technique of dynamic systems roots location used in free-obstacle path planning for mobile robots. First of all, the analysis and morphologic behavior identification of the paths depending on roots location in complex plane are performed, where paths type and their attraction and repulsion features in the presence of other roots similarly to the obtained with artificial potential fields are identified. An implementation methodology for this technique of mobile robots path planning is proposed, starting from three different methods of roots location for obstacles in the scene. Those techniques change depending on the obstacle key points selected for roots, such as borders, crossing points with original path, center and vertices. Finally, a behavior analysis of general technique and the effectiveness of each tried method is performed, doing 20 tests for each one, obtaining a value of 65% for the selected method. Modifications and possible improvements to this methodology are also proposed.

Inauguration of the Route de l’Europe cycle path

CERN Multimedia

AUTHOR|(CDS)2099575

2016-01-01

The new cycle path, which is 2.4 kilometres long, took seven months to complete. It was financed by CERN, the local authorities and also by funds from the CERN-Pays de Gex Consultation Committee. These funds, earned by renting CERN land to farmers, are used to finance projects benefiting the public, like cycle paths, as in this case.

Solving a Hamiltonian Path Problem with a bacterial computer

Directory of Open Access Journals (Sweden)

Treece Jessica

2009-07-01

Full Text Available Abstract Background The Hamiltonian Path Problem asks whether there is a route in a directed graph from a beginning node to an ending node, visiting each node exactly once. The Hamiltonian Path Problem is NP complete, achieving surprising computational complexity with modest increases in size. This challenge has inspired researchers to broaden the definition of a computer. DNA computers have been developed that solve NP complete problems. Bacterial computers can be programmed by constructing genetic circuits to execute an algorithm that is responsive to the environment and whose result can be observed. Each bacterium can examine a solution to a mathematical problem and billions of them can explore billions of possible solutions. Bacterial computers can be automated, made responsive to selection, and reproduce themselves so that more processing capacity is applied to problems over time. Results We programmed bacteria with a genetic circuit that enables them to evaluate all possible paths in a directed graph in order to find a Hamiltonian path. We encoded a three node directed graph as DNA segments that were autonomously shuffled randomly inside bacteria by a Hin/hixC recombination system we previously adapted from Salmonella typhimurium for use in Escherichia coli. We represented nodes in the graph as linked halves of two different genes encoding red or green fluorescent proteins. Bacterial populations displayed phenotypes that reflected random ordering of edges in the graph. Individual bacterial clones that found a Hamiltonian path reported their success by fluorescing both red and green, resulting in yellow colonies. We used DNA sequencing to verify that the yellow phenotype resulted from genotypes that represented Hamiltonian path solutions, demonstrating that our bacterial computer functioned as expected. Conclusion We successfully designed, constructed, and tested a bacterial computer capable of finding a Hamiltonian path in a three node

Solving a Hamiltonian Path Problem with a bacterial computer

Science.gov (United States)

Baumgardner, Jordan; Acker, Karen; Adefuye, Oyinade; Crowley, Samuel Thomas; DeLoache, Will; Dickson, James O; Heard, Lane; Martens, Andrew T; Morton, Nickolaus; Ritter, Michelle; Shoecraft, Amber; Treece, Jessica; Unzicker, Matthew; Valencia, Amanda; Waters, Mike; Campbell, A Malcolm; Heyer, Laurie J; Poet, Jeffrey L; Eckdahl, Todd T

2009-01-01

Background The Hamiltonian Path Problem asks whether there is a route in a directed graph from a beginning node to an ending node, visiting each node exactly once. The Hamiltonian Path Problem is NP complete, achieving surprising computational complexity with modest increases in size. This challenge has inspired researchers to broaden the definition of a computer. DNA computers have been developed that solve NP complete problems. Bacterial computers can be programmed by constructing genetic circuits to execute an algorithm that is responsive to the environment and whose result can be observed. Each bacterium can examine a solution to a mathematical problem and billions of them can explore billions of possible solutions. Bacterial computers can be automated, made responsive to selection, and reproduce themselves so that more processing capacity is applied to problems over time. Results We programmed bacteria with a genetic circuit that enables them to evaluate all possible paths in a directed graph in order to find a Hamiltonian path. We encoded a three node directed graph as DNA segments that were autonomously shuffled randomly inside bacteria by a Hin/hixC recombination system we previously adapted from Salmonella typhimurium for use in Escherichia coli. We represented nodes in the graph as linked halves of two different genes encoding red or green fluorescent proteins. Bacterial populations displayed phenotypes that reflected random ordering of edges in the graph. Individual bacterial clones that found a Hamiltonian path reported their success by fluorescing both red and green, resulting in yellow colonies. We used DNA sequencing to verify that the yellow phenotype resulted from genotypes that represented Hamiltonian path solutions, demonstrating that our bacterial computer functioned as expected. Conclusion We successfully designed, constructed, and tested a bacterial computer capable of finding a Hamiltonian path in a three node directed graph. This proof

Path-Constrained Motion Planning for Robotics Based on Kinematic Constraints

NARCIS (Netherlands)

Dijk, van N.J.M.; Wouw, van de N.; Pancras, W.C.M.; Nijmeijer, H.

2007-01-01

Common robotic tracking tasks consist of motions along predefined paths. The design of time-optimal path-constrained trajectories for robotic applications is discussed in this paper. To increase industrial applicability, the proposed method accounts for robot kinematics together with actuator

Increase the glyde path diameter improves the centering ability of F6 Skytaper.

Science.gov (United States)

Troiano, Giuseppe; Dioguardi, Mario; Cocco, Armando; Zhurakivska, Khrystyna; Ciavarella, Domenico; Muzio, Lorenzo Lo

2018-01-01

The aim of this study was to assess the impact of glide path preparation, performed with PathGlider 0.15 (Komet Brasseler GmbH & Co., Lemgo, Germany) and PathGlider 0.20 (Komet Brasseler GmbH & Co., Lemgo, Germany), on the centering ability of 25-size F6 Skytaper in J-shape simulated root canals, compared with no glide path executed. Sixty J-shaped ISO 15 0.02 taper endo training blocks (Dentsply Maillefer) were assigned to three groups ( n = 20 for each group). Photographic images were taken on endoblocks before and after shaping procedures. After superimposition, the software AutoCAD 2013 (Autodesk Inc., San Rafael, USA) was used for record the centering and shaping ability at 9 different levels from the apex. Shaping procedures including the using of PathGlider 0.20 resulted in a lower amount of resin removed and in a clear improvement of centering ability of the Skytaper 0.25 at almost all reference point levels. Within the limitations of this study, it could be concluded that the glide path procedure, performed with the PathGlider 0.20 before the shaping with 25-size F6 Skytaper, might determine a lower amount of resin removed and a better centering ability compared with the groups without glide path procedure and those treated with PathGlider 0.15.

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

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

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.

Active Path Planning for Drones in Object Search

OpenAIRE

Wang, Zeyangyi

2017-01-01

Object searching is one of the most popular applications of unmanned aerial vehicles. Low cost small drones are particularly suited for surveying tasks in difficult conditions. With their limited on-board processing power and battery life, there is a need for more efficient search algorithm. The proposed path planning algorithm utilizes AZ-net, a deep learning network to process images captured on drones for adaptive flight path planning. Search simulation based on videos and actual experimen...

The concept of 'optimal' path in classical mechanics

International Nuclear Information System (INIS)

Passos, E.J.V. de; Cruz, F.F. de S.

1986-01-01

The significance of the concept of 'optimal' path in the framework of classical mechanics is discussed. The derivation of the local harmonic approximation and self-consistent collective coordinate method equations of the optimal path is based on a careful study of the concepts of local maximal decoupling and global maximal decoupling respectively. This exhibits the nature of the differences between these two theories and allows one to establish the conditions under which they become equivalent. (author)

Six paths for the future of social epidemiology.

Science.gov (United States)

Galea, Sandro; Link, Bruce G

2013-09-15

Social epidemiology is now an accepted part of the academic intellectual landscape. However, in many ways, social epidemiology also runs the risk of losing the identity that distinguished it as a field during its emergence. In the present article, we scan the strengths of social epidemiology to imagine paths forward that will make the field distinct and useful to the understanding of population health in future. We suggest 6 paths to such a future, each emerging from promising research trends in the field in which social epidemiologists can, and should, lead in coming years. Each of these paths contributes to the formation of distinct capacities that social epidemiologists can claim and use to elaborate or fill in gaps in the already strong history of social epidemiology. They present an opportunity for the field to build on its strengths and move forward while leading in new and critical areas in population health.

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.

A path-following driver/vehicle model with optimized lateral dynamic controller

Directory of Open Access Journals (Sweden)

Behrooz Mashadi

Full Text Available Reduction in traffic congestion and overall number of accidents, especially within the last decade, can be attributed to the enormous progress in active safety. Vehicle path following control with the presence of driver commands can be regarded as one of the important issues in vehicle active safety systems development and more realistic explanation of vehicle path tracking problem. In this paper, an integrated driver/DYC control system is presented that regulates the steering angle and yaw moment, considering driver previewed path. Thus, the driver previewed distance, the heading error and the lateral deviation between the vehicle and desired path are used as inputs. Then, the controller determines and applies a corrective steering angle and a direct yaw moment to make the vehicle follow the desired path. A PID controller with optimized gains is used for the control of integrated driver/DYC system. Genetic Algorithm as an intelligent optimization method is utilized to adapt PID controller gains for various working situations. Proposed integrated driver/DYC controller is examined on lane change manuvers andthe sensitivity of the control system is investigated through the changes in the driver model and vehicle parameters. Simulation results show the pronounced effectiveness of the controller in vehicle path following and stability.

The diagnostic path, a useful visualisation tool in virtual microscopy.

Science.gov (United States)

Schrader, Thomas; Niepage, Sonja; Leuthold, Thomas; Saeger, Kai; Schluns, Karsten; Hufnagl, Peter; Kayser, Klaus; Dietel, Manfred

2006-11-08

The Virtual Microscopy based on completely digitalised histological slide. Concerning this digitalisation many new features in mircoscopy can be processed by the computer. New applications are possible or old, well known techniques of image analyses can be adapted for routine use. A so called diagnostic path observes in the way of a professional sees through a histological virtual slide combined with the text information of the dictation process. This feature can be used for image retrieval, quality assurance or for educational purpose. The diagnostic path implements a metadata structure of image information. It stores and processes the different images seen by a pathologist during his "slide viewing" and the obtained image sequence ("observation path"). Contemporary, the structural details of the pathology reports were analysed. The results were transferred into an XML structure. Based on this structure, a report editor and a search function were implemented. The report editor compiles the "diagnostic path", which is the connection from the image viewing sequence ("observation path") and the oral report sequence of the findings ("dictation path"). The time set ups of speech and image viewing serve for the link between the two sequences. The search tool uses the obtained diagnostic path. It allows the user to search for particular histological hallmarks in pathology reports and in the corresponding images. The new algorithm was tested on 50 pathology reports and 74 attached histological images. The creation of a new individual diagnostic path is automatically performed during the routine diagnostic process. The test prototype experienced an insignificant prolongation of the diagnosis procedure (oral case description and stated diagnosis by the pathologist) and a fast and reliable retrieval, especially useful for continuous education and quality control of case description and diagnostic work. The Digital Virtual Microscope has been designed to handle 1000 images

prediction of path loss estimate for a frequency modulation (fm)

African Journals Online (AJOL)

Orinya

Nigeria, FM station, Makurdi which is normally a major component in the ... and can be used to estimate path losses of FM signals in Benue State of ... limited in equipment to measure all the .... path loss while MATLAB R2007b software was.

Path following mobile robot in the presence of velocity constraints

DEFF Research Database (Denmark)

Bak, Martin; Poulsen, Niels Kjølstad; Ravn, Ole

2001-01-01

This paper focuses on path following algorithms for mobile robots with velocity constraints on the wheels. The path considered consists of straight lines intersected with given angles. We present a fast real-time receding horizon controller which anticipates the intersections and smoothly control...

Rocket Flight Path

Directory of Open Access Journals (Sweden)

Jamie Waters

2014-09-01

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

Hamiltonian path integrals

International Nuclear Information System (INIS)

Prokhorov, L.V.

1982-01-01

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

A SIMPLE ANALYTICAL METHOD TO DETERMINE SOLAR ENERGETIC PARTICLES' MEAN FREE PATH

International Nuclear Information System (INIS)

He, H.-Q.; Qin, G.

2011-01-01

To obtain the mean free path of solar energetic particles (SEPs) for a solar event, one usually has to fit time profiles of both flux and anisotropy from spacecraft observations to numerical simulations of SEPs' transport processes. This method can be called a simulation method. But a reasonably good fitting needs a lot of simulations, which demand a large amount of calculation resources. Sometimes, it is necessary to find an easy way to obtain the mean free path of SEPs quickly, for example, in space weather practice. Recently, Shalchi et al. provided an approximate analytical formula of SEPs' anisotropy time profile as a function of particles' mean free path for impulsive events. In this paper, we determine SEPs' mean free path by fitting the anisotropy time profiles from Shalchi et al.'s analytical formula to spacecraft observations. This new method can be called an analytical method. In addition, we obtain SEPs' mean free path with the traditional simulation methods. Finally, we compare the mean free path obtained with the simulation method to that of the analytical method to show that the analytical method, with some minor modifications, can give us a good, quick approximation of SEPs' mean free path for impulsive events.

A hybrid metaheuristic DE/CS algorithm for UCAV three-dimension path planning.

Science.gov (United States)

Wang, Gaige; Guo, Lihong; Duan, Hong; Wang, Heqi; Liu, Luo; Shao, Mingzhen

2012-01-01

Three-dimension path planning for uninhabited combat air vehicle (UCAV) is a complicated high-dimension optimization problem, which primarily centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. A new hybrid metaheuristic differential evolution (DE) and cuckoo search (CS) algorithm is proposed to solve the UCAV three-dimension path planning problem. DE is applied to optimize the process of selecting cuckoos of the improved CS model during the process of cuckoo updating in nest. The cuckoos can act as an agent in searching the optimal UCAV path. And then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic CS. The realization procedure for this hybrid metaheuristic approach DE/CS is also presented. In order to make the optimized UCAV path more feasible, the B-Spline curve is adopted for smoothing the path. To prove the performance of this proposed hybrid metaheuristic method, it is compared with basic CS algorithm. The experiment shows that the proposed approach is more effective and feasible in UCAV three-dimension path planning than the basic CS model.

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

Science.gov (United States)

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

2016-12-01

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

SDN-based path hopping communication against eavesdropping attack

Science.gov (United States)

Zhang, Chuanhao; Bu, Youjun; Zhao, Zheng

2016-10-01

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

Monte-Carlo approach to the generation of adversary paths

International Nuclear Information System (INIS)

1977-01-01

This paper considers the definition of a threat as the sequence of events that might lead to adversary success. A nuclear facility is characterized as a weighted, labeled, directed graph, with critical adversary paths. A discrete-event, Monte-Carlo simulation model is used to estimate the probability of the critical paths. The model was tested for hypothetical facilities, with promising results

Semi-classical approximation to path integrals - phases and catastrophes

International Nuclear Information System (INIS)

Levit, S.

1977-01-01

Problems of phases and catastrophes were encountered when trying to apply the classical S-matrix theory to the scattering phenomena in nuclear physics. The path integral formulation provided a suitable basis for the treatment of these and related problems. Within conventional mathematical language it was possible to give practical prescriptions and discuss their limitations. Since the semi-classical (stationary phase) approximation is commonly used in any application of the path integral method, the results are not restricted to the scattering problems and may be of general interest. The derivation of the uniform approximations in the energy representation should use the exact path integral expression as the starting point, rather than performing Fourier transforms on the expressions derived in the present lecture. (B.G.)

On the the optical path length in various media

Science.gov (United States)

Hasbun, Javier

As light travels through a substance, the path it follows is a stationary path known as the optical path length (OPL) and Fermat's principle leads to Snell's law as well as the law of reflection. It is possible to apply the variational principle to obtain an Euler equation for the OPL. For a two layer media an analytic expression can be obtained that agrees with Snell's law. The concept is applied to more general media by solving the resulting Euler differential equation numerically. A Monte Carlo simulation method modified for the present systems is applied for comparison with the numerical results obtained by solving the OPL Euler equation. The approaches presented here are beneficial to enhance the understanding of light behavior in an undergraduate optics physics course.

Minimum Time Path Planning for Robotic Manipulator in Drilling/ Spot Welding Tasks

Directory of Open Access Journals (Sweden)

Qiang Zhang

2016-04-01

Full Text Available In this paper, a minimum time path planning strategy is proposed for multi points manufacturing problems in drilling/spot welding tasks. By optimizing the travelling schedule of the set points and the detailed transfer path between points, the minimum time manufacturing task is realized under fully utilizing the dynamic performance of robotic manipulator. According to the start-stop movement in drilling/spot welding task, the path planning problem can be converted into a traveling salesman problem (TSP and a series of point to point minimum time transfer path planning problems. Cubic Hermite interpolation polynomial is used to parameterize the transfer path and then the path parameters are optimized to obtain minimum point to point transfer time. A new TSP with minimum time index is constructed by using point-point transfer time as the TSP parameter. The classical genetic algorithm (GA is applied to obtain the optimal travelling schedule. Several minimum time drilling tasks of a 3-DOF robotic manipulator are used as examples to demonstrate the effectiveness of the proposed approach.

Vision-based path following using the 1D trifocal tensor

CSIR Research Space (South Africa)

Sabatta, D

2013-05-01

Full Text Available In this paper we present a vision-based path following algorithm for a non-holonomic wheeled platform capable of keeping the vehicle on a desired path using only a single camera. The algorithm is suitable for teach and replay or leader...

An UML Statechart Diagram-Based MM-Path Generation Approach for Object-Oriented Integration Testing

OpenAIRE

Ruilian Zhao; Ling Lin

2008-01-01

MM-Path, an acronym for Method/Message Path, describes the dynamic interactions between methods in object-oriented systems. This paper discusses the classifications of MM-Path, based on the characteristics of object-oriented software. We categorize it according to the generation reasons, the effect scope and the composition of MM-Path. A formalized representation of MM-Path is also proposed, which has considered the influence of state on response method sequences of messages. .Moreover, an au...

Haensel and Grethel on the soft energy path

International Nuclear Information System (INIS)

Lyon, W.S.

1983-01-01

Ecological 'thinkers' of our time decry high technology including such activities as nuclear power, personal automobiles, chemical fertilizers, pesticides etc. They espouse the 'soft path' which means solar energy, organic farming and wood burning. However, the mankind's greatest problem is how to meet the power demand of the ever growing population of the world. On the 'soft path' it can be solved by the fairy-tale type way only, i.e. burn wood and let your kids get lost. (A.L.)

Magma paths at Piton de la Fournaise Volcano

OpenAIRE

Michon , Laurent; Ferrazzini , Valérie; Di Muro , Andrea

2016-01-01

International audience; Several patterns of magma paths have been proposed since the 1980s for Piton de la Fournaise volcano. Given the significant differences, which are presented here, we propose a reappraisal of the magma intrusion paths using a 17-years-long database of volcano-tectonic seismic events and a detailed mapping of the scoria cones. At the edifice scale, the magma propagates along two N120 trending rift zones. They are wide, linear, spotted by small to large scoria cones and r...

Reasoning on the Self-Organizing Incremental Associative Memory for Online Robot Path Planning

Science.gov (United States)

Kawewong, Aram; Honda, Yutaro; Tsuboyama, Manabu; Hasegawa, Osamu

Robot path-planning is one of the important issues in robotic navigation. This paper presents a novel robot path-planning approach based on the associative memory using Self-Organizing Incremental Neural Networks (SOINN). By the proposed method, an environment is first autonomously divided into a set of path-fragments by junctions. Each fragment is represented by a sequence of preliminarily generated common patterns (CPs). In an online manner, a robot regards the current path as the associative path-fragments, each connected by junctions. The reasoning technique is additionally proposed for decision making at each junction to speed up the exploration time. Distinct from other methods, our method does not ignore the important information about the regions between junctions (path-fragments). The resultant number of path-fragments is also less than other method. Evaluation is done via Webots physical 3D-simulated and real robot experiments, where only distance sensors are available. Results show that our method can represent the environment effectively; it enables the robot to solve the goal-oriented navigation problem in only one episode, which is actually less than that necessary for most of the Reinforcement Learning (RL) based methods. The running time is proved finite and scales well with the environment. The resultant number of path-fragments matches well to the environment.

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.

Analysis of critical paths for schedule control of nuclear power projects

International Nuclear Information System (INIS)

Shi Liangmin; Ma Limin; Fan Kai

2005-01-01

Study on the critical paths for the schedule control of nuclear power projects has been performed for reactor M310, based on the experiences from Daya Bay project and Ling Ao project. The study shows that the critical paths for the nuclear power project are from NI civil work, NI erection, commissioning of single systems directly serving the CFT to the joint-test. For NI civil work, the critical path is the main civil work of the reactor building, pre-stressing, handover of rooms for important areas, and key CW-erection interfaces; there are four critical paths for NI erection; For startup, two stages can be identified: commissioning of 16 single systems directly serving the CFT and joint-test. (authors)

Reliable Path Selection Problem in Uncertain Traffic Network after Natural Disaster

Directory of Open Access Journals (Sweden)

Jing Wang

2013-01-01

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

Bragg peak prediction from quantitative proton computed tomography using different path estimates

International Nuclear Information System (INIS)

Wang Dongxu; Mackie, T Rockwell; Tome, Wolfgang A

2011-01-01

This paper characterizes the performance of the straight-line path (SLP) and cubic spline path (CSP) as path estimates used in reconstruction of proton computed tomography (pCT). The GEANT4 Monte Carlo simulation toolkit is employed to simulate the imaging phantom and proton projections. SLP, CSP and the most-probable path (MPP) are constructed based on the entrance and exit information of each proton. The physical deviations of SLP, CSP and MPP from the real path are calculated. Using a conditional proton path probability map, the relative probability of SLP, CSP and MPP are calculated and compared. The depth dose and Bragg peak are predicted on the pCT images reconstructed using SLP, CSP, and MPP and compared with the simulation result. The root-mean-square physical deviations and the cumulative distribution of the physical deviations show that the performance of CSP is comparable to MPP while SLP is slightly inferior. About 90% of the SLP pixels and 99% of the CSP pixels lie in the 99% relative probability envelope of the MPP. Even at an imaging dose of ∼0.1 mGy the proton Bragg peak for a given incoming energy can be predicted on the pCT image reconstructed using SLP, CSP, or MPP with 1 mm accuracy. This study shows that SLP and CSP, like MPP, are adequate path estimates for pCT reconstruction, and therefore can be chosen as the path estimation method for pCT reconstruction, which can aid the treatment planning and range prediction of proton radiation therapy.

Bragg peak prediction from quantitative proton computed tomography using different path estimates

Energy Technology Data Exchange (ETDEWEB)

Wang Dongxu; Mackie, T Rockwell; Tome, Wolfgang A, E-mail: tome@humonc.wisc.edu [Department of Medical Physics, University of Wisconsin School of Medicine and Public Health, Madison, WI 53705 (United States)

2011-02-07

This paper characterizes the performance of the straight-line path (SLP) and cubic spline path (CSP) as path estimates used in reconstruction of proton computed tomography (pCT). The GEANT4 Monte Carlo simulation toolkit is employed to simulate the imaging phantom and proton projections. SLP, CSP and the most-probable path (MPP) are constructed based on the entrance and exit information of each proton. The physical deviations of SLP, CSP and MPP from the real path are calculated. Using a conditional proton path probability map, the relative probability of SLP, CSP and MPP are calculated and compared. The depth dose and Bragg peak are predicted on the pCT images reconstructed using SLP, CSP, and MPP and compared with the simulation result. The root-mean-square physical deviations and the cumulative distribution of the physical deviations show that the performance of CSP is comparable to MPP while SLP is slightly inferior. About 90% of the SLP pixels and 99% of the CSP pixels lie in the 99% relative probability envelope of the MPP. Even at an imaging dose of {approx}0.1 mGy the proton Bragg peak for a given incoming energy can be predicted on the pCT image reconstructed using SLP, CSP, or MPP with 1 mm accuracy. This study shows that SLP and CSP, like MPP, are adequate path estimates for pCT reconstruction, and therefore can be chosen as the path estimation method for pCT reconstruction, which can aid the treatment planning and range prediction of proton radiation therapy.

Bragg peak prediction from quantitative proton computed tomography using different path estimates

Science.gov (United States)

Wang, Dongxu; Mackie, T Rockwell

2015-01-01

This paper characterizes the performance of the straight-line path (SLP) and cubic spline path (CSP) as path estimates used in reconstruction of proton computed tomography (pCT). The GEANT4 Monte Carlo simulation toolkit is employed to simulate the imaging phantom and proton projections. SLP, CSP and the most-probable path (MPP) are constructed based on the entrance and exit information of each proton. The physical deviations of SLP, CSP and MPP from the real path are calculated. Using a conditional proton path probability map, the relative probability of SLP, CSP and MPP are calculated and compared. The depth dose and Bragg peak are predicted on the pCT images reconstructed using SLP, CSP, and MPP and compared with the simulation result. The root-mean-square physical deviations and the cumulative distribution of the physical deviations show that the performance of CSP is comparable to MPP while SLP is slightly inferior. About 90% of the SLP pixels and 99% of the CSP pixels lie in the 99% relative probability envelope of the MPP. Even at an imaging dose of ~0.1 mGy the proton Bragg peak for a given incoming energy can be predicted on the pCT image reconstructed using SLP, CSP, or MPP with 1 mm accuracy. This study shows that SLP and CSP, like MPP, are adequate path estimates for pCT reconstruction, and therefore can be chosen as the path estimation method for pCT reconstruction, which can aid the treatment planning and range prediction of proton radiation therapy. PMID:21212472

Debris extrusion by glide-path establishing endodontic instruments with different geometries

Directory of Open Access Journals (Sweden)

Jung-Hong Ha

2016-06-01

Conclusion: Creating the glide-path using nickel-titanium rotary files produced lower amounts of debris extrusion than using manual stainless-steel files. The progressive taper design of ProGlider, the center-off cross-section of One G, and the alternative-pitch design of ScoutRace may have increased the efficiencies of debris removal with minimal extrusion during glide-path preparation. Glide-path preparation using NiTi rotary files have better clinical efficiency than the manual stainless-steel file.

Consistent Partial Least Squares Path Modeling via Regularization.

Science.gov (United States)

Jung, Sunho; Park, JaeHong

2018-01-01

Partial least squares (PLS) path modeling is a component-based structural equation modeling that has been adopted in social and psychological research due to its data-analytic capability and flexibility. A recent methodological advance is consistent PLS (PLSc), designed to produce consistent estimates of path coefficients in structural models involving common factors. In practice, however, PLSc may frequently encounter multicollinearity in part because it takes a strategy of estimating path coefficients based on consistent correlations among independent latent variables. PLSc has yet no remedy for this multicollinearity problem, which can cause loss of statistical power and accuracy in parameter estimation. Thus, a ridge type of regularization is incorporated into PLSc, creating a new technique called regularized PLSc. A comprehensive simulation study is conducted to evaluate the performance of regularized PLSc as compared to its non-regularized counterpart in terms of power and accuracy. The results show that our regularized PLSc is recommended for use when serious multicollinearity is present.

Consistent Partial Least Squares Path Modeling via Regularization

Directory of Open Access Journals (Sweden)

Sunho Jung

2018-02-01

Full Text Available Partial least squares (PLS path modeling is a component-based structural equation modeling that has been adopted in social and psychological research due to its data-analytic capability and flexibility. A recent methodological advance is consistent PLS (PLSc, designed to produce consistent estimates of path coefficients in structural models involving common factors. In practice, however, PLSc may frequently encounter multicollinearity in part because it takes a strategy of estimating path coefficients based on consistent correlations among independent latent variables. PLSc has yet no remedy for this multicollinearity problem, which can cause loss of statistical power and accuracy in parameter estimation. Thus, a ridge type of regularization is incorporated into PLSc, creating a new technique called regularized PLSc. A comprehensive simulation study is conducted to evaluate the performance of regularized PLSc as compared to its non-regularized counterpart in terms of power and accuracy. The results show that our regularized PLSc is recommended for use when serious multicollinearity is present.

Rigorous time slicing approach to Feynman path integrals

CERN Document Server

Fujiwara, Daisuke

2017-01-01

This book proves that Feynman's original definition of the path integral actually converges to the fundamental solution of the Schrödinger equation at least in the short term if the potential is differentiable sufficiently many times and its derivatives of order equal to or higher than two are bounded. The semi-classical asymptotic formula up to the second term of the fundamental solution is also proved by a method different from that of Birkhoff. A bound of the remainder term is also proved. The Feynman path integral is a method of quantization using the Lagrangian function, whereas Schrödinger's quantization uses the Hamiltonian function. These two methods are believed to be equivalent. But equivalence is not fully proved mathematically, because, compared with Schrödinger's method, there is still much to be done concerning rigorous mathematical treatment of Feynman's method. Feynman himself defined a path integral as the limit of a sequence of integrals over finite-dimensional spaces which is obtained by...

Path integral approach to eikonal and next-to-eikonal exponentiation

NARCIS (Netherlands)

Laenen, E.; Stavenga, G.; White, C.D.

2009-01-01

We approach the issue of exponentiation of soft gauge boson corrections to scattering amplitudes from a path integral point of view. We show that if one represents the amplitude as a first quantized path integral in a mixed coordinate-momentum space representation, a charged particle interacting

Path-sum calculations for rf current drive

International Nuclear Information System (INIS)

Belo, Jorge H.; Bizarro, Joao P.S.; Rodrigues, Paulo

2001-01-01

Path sums and Gaussian short-time propagators are used to solve two-dimensional Fokker-Planck models of lower-hybrid (LH) and electron-cyclotron (EC) current drive (CD), and are shown to be well suited to the two limiting situations where the rf quasilinear diffusion coefficient is either relatively small, D rf ≅0.1, or very large, D rf →∞, the latter case enabling a special treatment. Results are given for both LHCD and ECCD in the small D rf case, whereas the limiting situation is illustrated only for ECCD. To check the accuracy of path-sum calculations, comparisons with finite difference solutions are provided

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.

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

Directory of Open Access Journals (Sweden)

Ignace T C Hooge

2013-12-01

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

The study of system function analysis method for success path alarm design

International Nuclear Information System (INIS)

Kang, S. K.; Shin, Y. C.

1999-01-01

The key benefit to the common use of the critical function approach for safety and mission functions is that monitoring methods expected to be used by operaotrs during emergency condition are used continuously during normal operation. For each critical safety function there exists two or more success paths. Information Processing System monitors the availability, operation state and performance of the critical function success paths. In this paper, We have studied System Function Analysis(SFA) for the design of Success Path Alarm(SPA) for applying in KNGR. In here, we thought that SFA will help the design of SPA. The SFA can be applicable to the design of SPA according to NUREG-0711, also can induce the algorithm for alarm of system, train and flow path. We present a method of system function analysis for designing Success Path Alarm

Acquisition Path Analysis for a SFR Fuel Manufacturing Facility

Energy Technology Data Exchange (ETDEWEB)

Chang, H. L.; Kwon, E. H.; Ahn, S. K.; Ko, W. I.; Kim, H. D. [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)

2014-05-15

The coarse acquisition path analysis does not claim to be complete, but it identifies plausible acquisition paths detailed enough to show that the acquisition path analysis can provide reasonable insights regarding the safeguardability assessment, and demonstrates the availability of safeguards tools and measures, although not complete, required for the implementation of effective and efficient safeguards, including the coverage of the nuclear energy system (NES) by multiple intrinsic features and extrinsic measures. It also identifies strengths, weaknesses and gaps of a system in the area of proliferation resistance in a generally understandable form. The acquisition path analysis demonstrates that all acceptance limits for the safeguardability, in principle, are met although the acceptance limit for the efficiency of the IAEA safeguards can be answered only at the end of the Safeguards-by-Design process, including interaction with IAEA operations. However, procedures for destructive assay (DA) for the verification by the IAEA are not defined. Target values for non-destructive assay (NDA) for this type of nuclear material are also not defined. Therefore, there is a need to finish demonstrations of NDA measurements on novel material types and material flows. The acquisition path analysis also shows some concerns that need to be assured in the system design process: e. g., the ID number of all storage containers in all storage positions can be read or checked without moving the storage container, transfer of TRU fuel and heel/scrap (product stream) should be strictly separated from transfer routes for waste, to make the transfer of TRU fuel and heel/scrap into waste container impossible, etc.

Evaluating Status Change of Soil Potassium from Path Model

Science.gov (United States)

He, Wenming; Chen, Fang

2013-01-01

The purpose of this study is to determine critical environmental parameters of soil K availability and to quantify those contributors by using a proposed path model. In this study, plot experiments were designed into different treatments, and soil samples were collected and further analyzed in laboratory to investigate soil properties influence on soil potassium forms (water soluble K, exchangeable K, non-exchangeable K). Furthermore, path analysis based on proposed path model was carried out to evaluate the relationship between potassium forms and soil properties. Research findings were achieved as followings. Firstly, key direct factors were soil S, ratio of sodium-potassium (Na/K), the chemical index of alteration (CIA), Soil Organic Matter in soil solution (SOM), Na and total nitrogen in soil solution (TN), and key indirect factors were Carbonate (CO3), Mg, pH, Na, S, and SOM. Secondly, path model can effectively determine direction and quantities of potassium status changes between Exchangeable potassium (eK), Non-exchangeable potassium (neK) and water-soluble potassium (wsK) under influences of specific environmental parameters. In reversible equilibrium state of , K balance state was inclined to be moved into β and χ directions in treatments of potassium shortage. However in reversible equilibrium of , K balance state was inclined to be moved into θ and λ directions in treatments of water shortage. Results showed that the proposed path model was able to quantitatively disclose moving direction of K status and quantify its equilibrium threshold. It provided a theoretical and practical basis for scientific and effective fertilization in agricultural plants growth. PMID:24204659

Optimal path-finding through mental exploration based on neural energy field gradients.

Science.gov (United States)

Wang, Yihong; Wang, Rubin; Zhu, Yating

2017-02-01

Rodent animal can accomplish self-locating and path-finding task by forming a cognitive map in the hippocampus representing the environment. In the classical model of the cognitive map, the system (artificial animal) needs large amounts of physical exploration to study spatial environment to solve path-finding problems, which costs too much time and energy. Although Hopfield's mental exploration model makes up for the deficiency mentioned above, the path is still not efficient enough. Moreover, his model mainly focused on the artificial neural network, and clear physiological meanings has not been addressed. In this work, based on the concept of mental exploration, neural energy coding theory has been applied to the novel calculation model to solve the path-finding problem. Energy field is constructed on the basis of the firing power of place cell clusters, and the energy field gradient can be used in mental exploration to solve path-finding problems. The study shows that the new mental exploration model can efficiently find the optimal path, and present the learning process with biophysical meaning as well. We also analyzed the parameters of the model which affect the path efficiency. This new idea verifies the importance of place cell and synapse in spatial memory and proves that energy coding is effective to study cognitive activities. This may provide the theoretical basis for the neural dynamics mechanism of spatial memory.

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

Energy Technology Data Exchange (ETDEWEB)

McLendon, William C.,; Brost, Randolph

2016-05-01

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

World nuclear energy paths

International Nuclear Information System (INIS)

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

1979-01-01

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

Hierarchical path planning and control of a small fixed-wing UAV: Theory and experimental validation

Science.gov (United States)

Jung, Dongwon

2007-12-01

Recently there has been a tremendous growth of research emphasizing control of unmanned aerial vehicles (UAVs) either in isolation or in teams. As a matter of fact, UAVs increasingly find their way into military and law enforcement applications (e.g., reconnaissance, remote delivery of urgent equipment/material, resource assessment, environmental monitoring, battlefield monitoring, ordnance delivery, etc.). This trend will continue in the future, as UAVs are poised to replace the human-in-the-loop during dangerous missions. Civilian applications of UAVs are also envisioned such as crop dusting, geological surveying, search and rescue operations, etc. In this thesis we propose a new online multiresolution path planning algorithm for a small UAV with limited on-board computational resources. The proposed approach assumes that the UAV has detailed information of the environment and the obstacles only in its vicinity. Information about far-away obstacles is also available, albeit less accurately. The proposed algorithm uses the fast lifting wavelet transform (FLWT) to get a multiresolution cell decomposition of the environment, whose dimension is commensurate to the on-board computational resources. A topological graph representation of the multiresolution cell decomposition is constructed efficiently, directly from the approximation and detail wavelet coefficients. Dynamic path planning is sequentially executed for an optimal path using the A* algorithm over the resulting graph. The proposed path planning algorithm is implemented on-line on a small autopilot. Comparisons with the standard D*-lite algorithm are also presented. We also investigate the problem of generating a smooth, planar reference path from a discrete optimal path. Upon the optimal path being represented as a sequence of cells in square geometry, we derive a smooth B-spline path that is constrained inside a channel that is induced by the geometry of the cells. To this end, a constrained optimization

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

Science.gov (United States)

Cao, Lu; Chen, Qiwei

2018-03-01

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

Definition of mean free path for real gases

Science.gov (United States)

Bird, G. A.

1983-11-01

Attention is drawn to the inconsistency in the conventional procedure for the definition of a mean free path in a real gas through the classical hard sphere result. It is shown that the variable cross-section hard sphere, or VHS, model can be used to define a mean free path that properly accounts for the temperature exponent of the coefficient of viscosity of the gas. In addition, the VHS model is shown to have advantages over the classical inverse power law models for numerical and analytical studies.

Geometry, Heat Equation and Path Integrals on the Poincare Upper Half-Plane

OpenAIRE

Reijiro, KUBO; Research Institute for Theoretical Physics Hiroshima University

1988-01-01

Geometry, heat equation and Feynman's path integrals are studied on the Poincare upper half-plane. The fundamental solution to the heat equation ∂f/∂t=Δ_Hf is expressed in terms of a path integral defined on the upper half-plane. It is shown that Kac's statement that Feynman's path integral satisfies the Schrodinger equation is also valid for our case.

Three-Dimensional Path Planning Software-Assisted Transjugular Intrahepatic Portosystemic Shunt: A Technical Modification

Energy Technology Data Exchange (ETDEWEB)

Tsauo, Jiaywei, E-mail: 80732059@qq.com; Luo, Xuefeng, E-mail: luobo-913@126.com [West China Hospital of Sichuan University, Institute of Interventional Radiology (China); Ye, Linchao, E-mail: linchao.ye@siemens.com [Siemens Ltd, Healthcare Sector (China); Li, Xiao, E-mail: simonlixiao@gmail.com [West China Hospital of Sichuan University, Institute of Interventional Radiology (China)

2015-06-15

PurposeThis study was designed to report our results with a modified technique of three-dimensional (3D) path planning software assisted transjugular intrahepatic portosystemic shunt (TIPS).Methods3D path planning software was recently developed to facilitate TIPS creation by using two carbon dioxide portograms acquired at least 20° apart to generate a 3D path for overlay needle guidance. However, one shortcoming is that puncturing along the overlay would be technically impossible if the angle of the liver access set and the angle of the 3D path are not the same. To solve this problem, a prototype 3D path planning software was fitted with a utility to calculate the angle of the 3D path. Using this, we modified the angle of the liver access set accordingly during the procedure in ten patients.ResultsFailure for technical reasons occurred in three patients (unsuccessful wedged hepatic venography in two cases, software technical failure in one case). The procedure was successful in the remaining seven patients, and only one needle pass was required to obtain portal vein access in each case. The course of puncture was comparable to the 3D path in all patients. No procedure-related complication occurred following the procedures.ConclusionsAdjusting the angle of the liver access set to match the angle of the 3D path determined by the software appears to be a favorable modification to the technique of 3D path planning software assisted TIPS.

Qualification paths of adult educators in Sweden and Denmark

DEFF Research Database (Denmark)

Andersson, Per; Köpsén, Susanne; Larson, Anne

2013-01-01

fields of education and training. In this study, we analyse the qualification paths, or learning trajectories, of prospective adult educators in Sweden and Denmark. The analysis is based on narrative interviews with 29 students in training to become adult educators. The career paths of adult educators...... are often long and winding roads. Becoming an adult educator could be their primary desire, but it could also be their ‘Plan B’, a second choice. Individual motives and external demands interact in the professionalisation process. A shift in focus from teaching subject and methods to teaching context...... and the relation to the learners is part of the professional development. Finally, we argue that both academic studies and hands-on work in the adult education community are crucial parts of the adult educator’s qualification path....

Career Path Suggestion using String Matching and Decision Trees

Science.gov (United States)

Nagpal, Akshay; P. Panda, Supriya

2015-05-01

High school and college graduates seemingly are often battling for the courses they should major in order to achieve their target career. In this paper, we worked on suggesting a career path to a graduate to reach his/her dream career given the current educational status. Firstly, we collected the career data of professionals and academicians from various career fields and compiled the data set by using the necessary information from the data. Further, this was used as the basis to suggest the most appropriate career path for the person given his/her current educational status. Decision trees and string matching algorithms were employed to suggest the appropriate career path for a person. Finally, an analysis of the result has been done directing to further improvements in the model.

BOOK REVIEW: Path Integrals in Field Theory: An Introduction

Science.gov (United States)

Ryder, Lewis

2004-06-01

In the 1960s Feynman was known to particle physicists as one of the people who solved the major problems of quantum electrodynamics, his contribution famously introducing what are now called Feynman diagrams. To other physicists he gained a reputation as the author of the Feynman Lectures on Physics; in addition some people were aware of his work on the path integral formulation of quantum theory, and a very few knew about his work on gravitation and Yang--Mills theories, which made use of path integral methods. Forty years later the scene is rather different. Many of the problems of high energy physics are solved; and the standard model incorporates Feynman's path integral method as a way of proving the renormalisability of the gauge (Yang--Mills) theories involved. Gravitation is proving a much harder nut to crack, but here also questions of renormalisability are couched in path-integral language. What is more, theoretical studies of condensed matter physics now also appeal to this technique for quantisation, so the path integral method is becoming part of the standard apparatus of theoretical physics. Chapters on it appear in a number of recent books, and a few books have appeared devoted to this topic alone; the book under review is a very recent one. Path integral techniques have the advantage of enormous conceptual appeal and the great disadvantage of mathematical complexity, this being partly the result of messy integrals but more fundamentally due to the notions of functional differentiation and integration which are involved in the method. All in all this subject is not such an easy ride. Mosel's book, described as an introduction, is aimed at graduate students and research workers in particle physics. It assumes a background knowledge of quantum mechanics, both non-relativistic and relativistic. After three chapters on the path integral formulation of non-relativistic quantum mechanics there are eight chapters on scalar and spinor field theory, followed

Conceptual Soundness, Metric Development, Benchmarking, and Targeting for PATH Subprogram Evaluation

Energy Technology Data Exchange (ETDEWEB)

Mosey. G.; Doris, E.; Coggeshall, C.; Antes, M.; Ruch, J.; Mortensen, J.

2009-01-01

The objective of this study is to evaluate the conceptual soundness of the U.S. Department of Housing and Urban Development (HUD) Partnership for Advancing Technology in Housing (PATH) program's revised goals and establish and apply a framework to identify and recommend metrics that are the most useful for measuring PATH's progress. This report provides an evaluative review of PATH's revised goals, outlines a structured method for identifying and selecting metrics, proposes metrics and benchmarks for a sampling of individual PATH programs, and discusses other metrics that potentially could be developed that may add value to the evaluation process. The framework and individual program metrics can be used for ongoing management improvement efforts and to inform broader program-level metrics for government reporting requirements.

The diagnostic path, a useful visualisation tool in virtual microscopy

Directory of Open Access Journals (Sweden)

Hufnagl Peter

2006-11-01

Full Text Available Abstract Background The Virtual Microscopy based on completely digitalised histological slide. Concerning this digitalisation many new features in mircoscopy can be processed by the computer. New applications are possible or old, well known techniques of image analyses can be adapted for routine use. Aims A so called diagnostic path observes in the way of a professional sees through a histological virtual slide combined with the text information of the dictation process. This feature can be used for image retrieval, quality assurance or for educational purpose. Materials and methods The diagnostic path implements a metadata structure of image information. It stores and processes the different images seen by a pathologist during his "slide viewing" and the obtained image sequence ("observation path". Contemporary, the structural details of the pathology reports were analysed. The results were transferred into an XML structure. Based on this structure, a report editor and a search function were implemented. The report editor compiles the "diagnostic path", which is the connection from the image viewing sequence ("observation path" and the oral report sequence of the findings ("dictation path". The time set ups of speech and image viewing serve for the link between the two sequences. The search tool uses the obtained diagnostic path. It allows the user to search for particular histological hallmarks in pathology reports and in the corresponding images. Results The new algorithm was tested on 50 pathology reports and 74 attached histological images. The creation of a new individual diagnostic path is automatically performed during the routine diagnostic process. The test prototype experienced an insignificant prolongation of the diagnosis procedure (oral case description and stated diagnosis by the pathologist and a fast and reliable retrieval, especially useful for continuous education and quality control of case description and diagnostic work

Sequential Path Model for Grain Yield in Soybean

Directory of Open Access Journals (Sweden)

Mohammad SEDGHI

2010-09-01

Full Text Available This study was performed to determine some physiological traits that affect soybean,s grain yield via sequential path analysis. In a factorial experiment, two cultivars (Harcor and Williams were sown under four levels of nitrogen and two levels of weed management at the research station of Tabriz University, Iran, during 2004 and 2005. Grain yield, some yield components and physiological traits were measured. Correlation coefficient analysis showed that grain yield had significant positive and negative association with measured traits. A sequential path analysis was done in order to evaluate associations among grain yield and related traits by ordering the various variables in first, second and third order paths on the basis of their maximum direct effects and minimal collinearity. Two first-order variables, namely number of pods per plant and pre-flowering net photosynthesis revealed highest direct effect on total grain yield and explained 49, 44 and 47 % of the variation in grain yield based on 2004, 2005, and combined datasets, respectively. Four traits i.e. post-flowering net photosynthesis, plant height, leaf area index and intercepted radiation at the bottom layer of canopy were found to fit as second-order variables. Pre- and post-flowering chlorophyll content, main root length and intercepted radiation at the middle layer of canopy were placed at the third-order path. From the results concluded that, number of pods per plant and pre-flowering net photosynthesis are the best selection criteria in soybean for grain yield.

Accelerating Sequential Gaussian Simulation with a constant path

Science.gov (United States)

Nussbaumer, Raphaël; Mariethoz, Grégoire; Gravey, Mathieu; Gloaguen, Erwan; Holliger, Klaus

2018-03-01

Sequential Gaussian Simulation (SGS) is a stochastic simulation technique commonly employed for generating realizations of Gaussian random fields. Arguably, the main limitation of this technique is the high computational cost associated with determining the kriging weights. This problem is compounded by the fact that often many realizations are required to allow for an adequate uncertainty assessment. A seemingly simple way to address this problem is to keep the same simulation path for all realizations. This results in identical neighbourhood configurations and hence the kriging weights only need to be determined once and can then be re-used in all subsequent realizations. This approach is generally not recommended because it is expected to result in correlation between the realizations. Here, we challenge this common preconception and make the case for the use of a constant path approach in SGS by systematically evaluating the associated benefits and limitations. We present a detailed implementation, particularly regarding parallelization and memory requirements. Extensive numerical tests demonstrate that using a constant path allows for substantial computational gains with very limited loss of simulation accuracy. This is especially the case for a constant multi-grid path. The computational savings can be used to increase the neighbourhood size, thus allowing for a better reproduction of the spatial statistics. The outcome of this study is a recommendation for an optimal implementation of SGS that maximizes accurate reproduction of the covariance structure as well as computational efficiency.

JAVA PathFinder

Science.gov (United States)

Mehhtz, Peter

2005-01-01

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

PP: A graphics post-processor for the EQ6 reaction path code

International Nuclear Information System (INIS)

Stockman, H.W.

1994-09-01

The PP code is a graphics post-processor and plotting program for EQ6, a popular reaction-path code. PP runs on personal computers, allocates memory dynamically, and can handle very large reaction path runs. Plots of simple variable groups, such as fluid and solid phase composition, can be obtained with as few as two keystrokes. Navigation through the list of reaction path variables is simple and efficient. Graphics files can be exported for inclusion in word processing documents and spreadsheets, and experimental data may be imported and superposed on the reaction path runs. The EQ6 thermodynamic database can be searched from within PP, to simplify interpretation of complex plots

Detection of cervical precancerous lesions with Aptima HPV assays using SurePath preservative fluid specimens

Directory of Open Access Journals (Sweden)

Max Chernesky

2017-06-01

Full Text Available SurePath specimens from women referred to colposcopy were treated with Aptima Transfer Solution (ATS before testing in Aptima HPV (AHPV and Aptima HPV 16, 18/45 (AHPV-GT assays. Untreated SurePath specimens were tested with the cobas HPV test. PreservCyt specimens were assessed for cytology and tested with AHPV. High-grade cervical intraepithelial neoplasia lesions served as the reference standard. Excellent agreement (95.5%; k=0.91 was observed for ATS-treated SurePath specimens between Tigris and Panther systems and between the PreservCyt and ATS-treated SurePath specimens (91.1%, k=0.81 with the AHPV assay on Tigris. Agreement between the AHPV and cobas assays with SurePath specimens was substantial (89.9%, k=0.80. AHPV sensitivity for CIN2+(n=147 was 91.2% for SurePath and PreservCyt. Cobas HPV sensitivity was 93.9% for SurePath specimens. AHPV testing of SurePath specimens was more specific (59.4% than cobas (54.7% (p<0.001. Detection and genotyping showed similar absolute and relative risks. ATS-treated SurePath specimens tested with AHPV and AHPV-GT assays showed similar performance with greater specificity than cobas HPV on SurePath specimens. Similar overall results were seen using a CIN3 disease endpoint. Keywords: Human papillomavirus, SurePath, PreservCyt, Cervical intraepithelial neoplasia, CIN2+, Aptima transfer solution (ATS

Comments on nucleon mean free paths in nuclear matter

International Nuclear Information System (INIS)

Blann, M.

1977-01-01

It is suggested that recent evidence cited for a fourfold increase in the mean free path of nucleons in nuclear matter results from an error in formulation of the exciton model. The literature cited as being in support of the longer mean free path is reviewed and found to be in disagreement with the new value, and in quite reasonable agreement with results used over the past 30 years. (Auth.)

Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions

KAUST Repository

Abubeker, Jewahir Ali

2011-05-14

This paper is devoted to the consideration of an algorithm for sequential optimization of paths in directed graphs relative to di_erent cost functions. The considered algorithm is based on an extension of dynamic programming which allows to represent the initial set of paths and the set of optimal paths after each application of optimization procedure in the form of a directed acyclic graph.

Geometry, heat equation and path integrals on the Poincare upper half-plane

International Nuclear Information System (INIS)

Kubo, Reijiro.

1987-08-01

Geometry, heat equation and Feynman's path integrals are studied on the Poincare upper half-plane. The fundamental solution to the heat equation δf/δt = Δ H f is expressed in terms of a path integral defined on the upper half-plane. It is shown that Kac's proof that Feynman's path integral satisfies the Schroedinger equation is also valid for our case. (author)

Solar array deployment analysis considering path-dependent behavior of a tape spring hinge

Energy Technology Data Exchange (ETDEWEB)

Kim, Kyung Won; Park, Young Jin [KAIST, Daejeon (Korea, Republic of)

2015-05-15

Solar array deployment analysis is conducted considering the path-dependent nonlinear behavior of tape spring hinge. Such hinges offer many advantages over rigid hinges; they are self-deployable, self-locking, lightweight, and simple. However, they show strongly nonlinear behavior with respect to rotation angle, making deployment analysis difficult. To accurately consider the characteristics of tape spring hinges for deployment analysis, a path-dependent path identification (PI) method for tracing the previous path of the moment is introduced. To analyze the deployment motion, the governing equation for solar array deployment is derived within the framework of Kane's dynamic equation for three deployable solar panels. The numerical solution is compared with the Recurdyn's multi-body dynamics analysis solution using experimentally measured moment-rotation profiles. Solar array deployment analysis is conducted by considering and not considering the path-dependent PI method. This simulation example shows that the proposed path-dependent PI method is very effective for accurately predicting the deployment motion.

Power Series Expansion of Propagator for Path Integral and Its Applications

International Nuclear Information System (INIS)

Ou Yuanjin; Liang Xianting

2007-01-01

In this paper we obtain a propagator of path integral for a harmonic oscillator and a driven harmonic oscillator by using the power series expansion. It is shown that our result for the harmonic oscillator is more exact than the previous one obtained with other approximation methods. By using the same method, we obtain a propagator of path integral for the driven harmonic oscillator, which does not have any exact expansion. The more exact propagators may improve the path integral results for these systems.

Yang-Mills theory in null path space

International Nuclear Information System (INIS)

Kent, S.L.

1982-01-01

A reformulation of classical GL(n,c) Yang-Mills theory is presented. The reformulation is in terms of a single matrix-valued function G on a six-dimensional subspace of the space of paths in Minkowski space, M. This subspace is defined as the null paths beginning at each point, (X/sup a/), of M and ending at future null infinity. A convenient parametrization of these paths is to give the Minkowski coordinates x/sup a/ of the starting point and the (complex) stereographic coordinates (xi, antixi) on S 2 which label the light cone generators of x/sup a/. A path is thus labeled by (x/sup a/,xi, antixi). The function G(x/sup a/,xi, antixi) is defined by the parallel propagation (with a given connection) of n linearly independent fiber vectors from x/sup a/ to null infinity along the (xi, antixi) generator. From knowledge of G(x/sup a/,xi, antixi) the connection one-form γ/sub a/ at the point x/sup a/ can be obtained is shown. Furthermore how the vacuum Yang-Mills equations can be imposed on the G is shown. This results in a rather complicated integro-differential equation for G which involves the characteristic initial data (essentially the radiation field) acting as the driving term. Two simple special cases are immediately obtainable; in the case of self-dual (or anti-self dual) fields the author obtains a simple derivation of the Sparling equation, namely delta G = -GA, while for Abelian (Maxwell) theories obtained the equation delta anti delta log G = -anti delta A-anti delta A, where A and its conjugate anti A are the characteristic free data given on null infinity. The latter equation is equivalent to the vacuum Maxwell equations

Reaction paths based on mean first-passage times

International Nuclear Information System (INIS)

Park, Sanghyun; Sener, Melih K.; Lu Deyu; Schulten, Klaus

2003-01-01

Finding representative reaction pathways is important for understanding the mechanism of molecular processes. We propose a new approach for constructing reaction paths based on mean first-passage times. This approach incorporates information about all possible reaction events as well as the effect of temperature. As an application of this method, we study representative pathways of excitation migration in a photosynthetic light-harvesting complex, photosystem I. The paths thus computed provide a complete, yet distilled, representation of the kinetic flow of excitation toward the reaction center, thereby succinctly characterizing the function of the system

Information paths within the new product development process

DEFF Research Database (Denmark)

Jespersen, Kristina Risom

2007-01-01

collection platform to obtain measurements from within the NPD process. 42 large, international companies participated in the data collecting simulation. Results revealed five different information paths that were not connecting all stages of the NPD process. Moreover, results show that the front......-end is not driving the information acquisition through the stages of the NPD process, and that environmental turbulence disconnects stages from the information paths in the NPD process. This implies that information is at the same time a key to success and a key to entrapment in the NPD process....

Astronomers Trace Microquasar's Path Back in Time

Science.gov (United States)

2003-01-01

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

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.

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

Energy Optimal Path Planning: Integrating Coastal Ocean Modelling with Optimal Control

Science.gov (United States)

Subramani, D. N.; Haley, P. J., Jr.; Lermusiaux, P. F. J.

2016-02-01

A stochastic optimization methodology is formulated for computing energy-optimal paths from among time-optimal paths of autonomous vehicles navigating in a dynamic flow field. To set up the energy optimization, the relative vehicle speed and headings are considered to be stochastic, and new stochastic Dynamically Orthogonal (DO) level-set equations that govern their stochastic time-optimal reachability fronts are derived. Their solution provides the distribution of time-optimal reachability fronts and corresponding distribution of time-optimal paths. An optimization is then performed on the vehicle's energy-time joint distribution to select the energy-optimal paths for each arrival time, among all stochastic time-optimal paths for that arrival time. The accuracy and efficiency of the DO level-set equations for solving the governing stochastic level-set reachability fronts are quantitatively assessed, including comparisons with independent semi-analytical solutions. Energy-optimal missions are studied in wind-driven barotropic quasi-geostrophic double-gyre circulations, and in realistic data-assimilative re-analyses of multiscale coastal ocean flows. The latter re-analyses are obtained from multi-resolution 2-way nested primitive-equation simulations of tidal-to-mesoscale dynamics in the Middle Atlantic Bight and Shelbreak Front region. The effects of tidal currents, strong wind events, coastal jets, and shelfbreak fronts on the energy-optimal paths are illustrated and quantified. Results showcase the opportunities for longer-duration missions that intelligently utilize the ocean environment to save energy, rigorously integrating ocean forecasting with optimal control of autonomous vehicles.

Architecture and design of optical path networks utilizing waveband virtual links

Science.gov (United States)

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

2016-02-01

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

Evaluating status change of soil potassium from path model.

Directory of Open Access Journals (Sweden)

Wenming He

Full Text Available The purpose of this study is to determine critical environmental parameters of soil K availability and to quantify those contributors by using a proposed path model. In this study, plot experiments were designed into different treatments, and soil samples were collected and further analyzed in laboratory to investigate soil properties influence on soil potassium forms (water soluble K, exchangeable K, non-exchangeable K. Furthermore, path analysis based on proposed path model was carried out to evaluate the relationship between potassium forms and soil properties. Research findings were achieved as followings. Firstly, key direct factors were soil S, ratio of sodium-potassium (Na/K, the chemical index of alteration (CIA, Soil Organic Matter in soil solution (SOM, Na and total nitrogen in soil solution (TN, and key indirect factors were Carbonate (CO3, Mg, pH, Na, S, and SOM. Secondly, path model can effectively determine direction and quantities of potassium status changes between Exchangeable potassium (eK, Non-exchangeable potassium (neK and water-soluble potassium (wsK under influences of specific environmental parameters. In reversible equilibrium state of [Formula: see text], K balance state was inclined to be moved into β and χ directions in treatments of potassium shortage. However in reversible equilibrium of [Formula: see text], K balance state was inclined to be moved into θ and λ directions in treatments of water shortage. Results showed that the proposed path model was able to quantitatively disclose moving direction of K status and quantify its equilibrium threshold. It provided a theoretical and practical basis for scientific and effective fertilization in agricultural plants growth.

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

Science.gov (United States)

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

2013-07-01

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

Cooperative Path Planning and Constraints Analysis for Master-Slave Industrial Robots

Directory of Open Access Journals (Sweden)

Yahui Gan

2012-09-01

Full Text Available A strategy of cooperative path planning for a master-slave multiple robot system is presented in this paper. The path planning method is based on motion constraints between the end-effectors of cooperative robots. Cooperation motions have been classified into three types by relative motions between end-effectors of master and slave robots, which is concurrent cooperation, coupled synchronous cooperation and combined synchronous cooperation. Based on this classification, position /orientation constraints and joint velocity constraints are explored in-depth here. In order to validate the path planning method and the theoretical developments in motion constraints analysis, representative experiments based on two industrial robots, Motoman VA1400 and HP20, are provided at the end of the paper. The experimental results have proved both the effectiveness of the path planning method and the correctness of the constraints analysis.

Jarzynski equality in the context of maximum path entropy

Science.gov (United States)

González, Diego; Davis, Sergio

2017-06-01

In the global framework of finding an axiomatic derivation of nonequilibrium Statistical Mechanics from fundamental principles, such as the maximum path entropy - also known as Maximum Caliber principle -, this work proposes an alternative derivation of the well-known Jarzynski equality, a nonequilibrium identity of great importance today due to its applications to irreversible processes: biological systems (protein folding), mechanical systems, among others. This equality relates the free energy differences between two equilibrium thermodynamic states with the work performed when going between those states, through an average over a path ensemble. In this work the analysis of Jarzynski's equality will be performed using the formalism of inference over path space. This derivation highlights the wide generality of Jarzynski's original result, which could even be used in non-thermodynamical settings such as social systems, financial and ecological systems.

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

Insights into the mechanisms on chemical reactions: reaction paths for chemical reactions

International Nuclear Information System (INIS)

Dunning, T.H. Jr.; Rosen, E.; Eades, R.A.

1987-01-01

We report reaction paths for two prototypical chemical reactions: Li + HF, an electron transfer reaction, and OH + H 2 , an abstraction reaction. In the first reaction we consider the connection between the energetic terms in the reaction path Hamiltonian and the electronic changes which occur upon reaction. In the second reaction we consider the treatment of vibrational effects in chemical reactions in the reaction path formalism. 30 refs., 9 figs

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

Generalized causal mediation and path analysis: Extensions and practical considerations.

Science.gov (United States)

Albert, Jeffrey M; Cho, Jang Ik; Liu, Yiying; Nelson, Suchitra

2018-01-01

Causal mediation analysis seeks to decompose the effect of a treatment or exposure among multiple possible paths and provide casually interpretable path-specific effect estimates. Recent advances have extended causal mediation analysis to situations with a sequence of mediators or multiple contemporaneous mediators. However, available methods still have limitations, and computational and other challenges remain. The present paper provides an extended causal mediation and path analysis methodology. The new method, implemented in the new R package, gmediation (described in a companion paper), accommodates both a sequence (two stages) of mediators and multiple mediators at each stage, and allows for multiple types of outcomes following generalized linear models. The methodology can also handle unsaturated models and clustered data. Addressing other practical issues, we provide new guidelines for the choice of a decomposition, and for the choice of a reference group multiplier for the reduction of Monte Carlo error in mediation formula computations. The new method is applied to data from a cohort study to illuminate the contribution of alternative biological and behavioral paths in the effect of socioeconomic status on dental caries in adolescence.

Spatio-temporal structure, path characteristics and perceptual grouping in immediate serial spatial recall

Directory of Open Access Journals (Sweden)

Carlo De Lillo

2016-11-01

Full Text Available Immediate serial spatial recall measures the ability to retain sequences of locations in short-term memory and is considered the spatial equivalent of digit span. It is tested by requiring participants to reproduce sequences of movements performed by an experimenter or displayed on a monitor. Different organizational factors dramatically affect serial spatial recall but they are often confounded or underspecified. Untangling them is crucial for the characterization of working-memory models and for establishing the contribution of structure and memory capacity to spatial span. We report five experiments assessing the relative role and independence of factors that have been reported in the literature. Experiment 1 disentangled the effects of spatial clustering and path-length by manipulating the distance of items displayed on a touchscreen monitor. Long-path sequences segregated by spatial clusters were compared with short-path sequences not segregated by clusters. Recall was more accurate for sequences segregated by clusters independently from path-length. Experiment 2 featured conditions where temporal pauses were introduced between or within cluster boundaries during the presentation of sequences with the same paths. Thus, the temporal structure of the sequences was either consistent or inconsistent with a hierarchical representation based on segmentation by spatial clusters but the effect of structure could not be confounded with effects of path-characteristics. Pauses at cluster boundaries yielded more accurate recall, as predicted by a hierarchical model. In Experiment 3, the systematic manipulation of sequence structure, path-length and presence of path-crossings of sequences showed that structure explained most of the variance, followed by the presence/absence of path-crossings, and path-length. Experiments 4 and 5 replicated the results of the previous experiments in immersive virtual reality navigation tasks where the viewpoint of the

An alternative derivation of the Faddeev-Popov path integral

International Nuclear Information System (INIS)

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

1991-01-01

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

Polygonal-path approximation on the path spaces of quantum mechanical systems: extended Feynman maps

International Nuclear Information System (INIS)

Exner, R.; Kolerov, G.I.

1981-01-01

Various types of polygonal-path approximations appearing in the functional-integration theory are discussed. The uniform approximation is applied to extend the definition of the Feynman maps from our previous paper and to prove consistency of this extension. Relations of the extended Fsub(-i)-map to the Wiener integral are given. In particular, the basic theorem about the sequential Wiener integral by Cameron is improved [ru

Path planning algorithms for assembly sequence planning. [in robot kinematics

Science.gov (United States)

Krishnan, S. S.; Sanderson, Arthur C.

1991-01-01

Planning for manipulation in complex environments often requires reasoning about the geometric and mechanical constraints which are posed by the task. In planning assembly operations, the automatic generation of operations sequences depends on the geometric feasibility of paths which permit parts to be joined into subassemblies. Feasible locations and collision-free paths must be present for part motions, robot and grasping motions, and fixtures. This paper describes an approach to reasoning about the feasibility of straight-line paths among three-dimensional polyhedral parts using an algebra of polyhedral cones. A second method recasts the feasibility conditions as constraints in a nonlinear optimization framework. Both algorithms have been implemented and results are presented.

Memristor Multiport Readout: A Closed-Form Solution for Sneak Paths

KAUST Repository

Zidan, Mohammed A.; Eltawil, Ahmed M.; Fahmy, Hossam A.H.; Kurdahi, Fadi; Salama, Khaled N.

2014-01-01

In this paper, we introduce for the first time, a closed-form solution for the memristor-based memory sneak paths without using any gating elements. The introduced technique fully eliminates the effect of sneak paths by reading the stored data using multiple access points and evaluating a simple addition/subtraction on the different readings. The new method requires fewer reading steps compared to previously reported techniques, and has a very small impact on the memory density. To verify the underlying theory, the proposed system is simulated using Synopsys HSPICE showing the ability to achieve a 100% sneak-path error-free memory. In addition, the effect of quantization bits on the system performance is studied.

Memristor Multiport Readout: A Closed-Form Solution for Sneak Paths

KAUST Repository

Zidan, Mohammed A.

2014-06-18

In this paper, we introduce for the first time, a closed-form solution for the memristor-based memory sneak paths without using any gating elements. The introduced technique fully eliminates the effect of sneak paths by reading the stored data using multiple access points and evaluating a simple addition/subtraction on the different readings. The new method requires fewer reading steps compared to previously reported techniques, and has a very small impact on the memory density. To verify the underlying theory, the proposed system is simulated using Synopsys HSPICE showing the ability to achieve a 100% sneak-path error-free memory. In addition, the effect of quantization bits on the system performance is studied.

Algorithms for finding optimal paths in network games with p players

Directory of Open Access Journals (Sweden)

R. Boliac

1997-08-01

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

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

Science.gov (United States)

Iswanto, Wahyunggoro, Oyas; Cahyadi, Adha Imam

2017-04-01

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

Path-breaking books in regional science

NARCIS (Netherlands)

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,

Neck Muscle Moment Arms Obtained In-Vivo from MRI: Effect of Curved and Straight Modeled Paths.

Science.gov (United States)

Suderman, Bethany L; Vasavada, Anita N

2017-08-01

Musculoskeletal models of the cervical spine commonly represent neck muscles with straight paths. However, straight lines do not best represent the natural curvature of muscle paths in the neck, because the paths are constrained by bone and soft tissue. The purpose of this study was to estimate moment arms of curved and straight neck muscle paths using different moment arm calculation methods: tendon excursion, geometric, and effective torque. Curved and straight muscle paths were defined for two subject-specific cervical spine models derived from in vivo magnetic resonance images (MRI). Modeling neck muscle paths with curvature provides significantly different moment arm estimates than straight paths for 10 of 15 neck muscles (p straight lines to model muscle paths can lead to overestimating neck extension moment. However, moment arm methods for curved paths should be investigated further, as different methods of calculating moment arm can provide different estimates.

The expression of Path in L2 Danish by German and Turkish learners

DEFF Research Database (Denmark)

Jessen, Moiken

2014-01-01

Do language learners think in their first language (L1) when using their second language (L2)? This study explores the nature of crosslinguistic influence by investigating how German and Turkish learners of Danish express motion, paying special attention to the semantics of Path. We examined three...... aspects: overall Path frequency, Path complexity, and the subcomponents of Path. The presence of L1 influence in each aspect reflects how the interplay between form and meaning is carried over as a whole to the L2. In particular, we show how the selection of a specific Path meaning for expression in the L......2 has its root in the structural and semantic properties of the L1. This raises important questions regarding how form and meaning are organized in the learner's mind....

Dynamic Path Exploration on Mobile Devices

KAUST Repository

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.

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

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.

Robotic path-finding in inverse treatment planning for stereotactic radiosurgery with continuous dose delivery

Energy Technology Data Exchange (ETDEWEB)

Vandewouw, Marlee M., E-mail: marleev@mie.utoronto.ca; Aleman, Dionne M. [Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Ontario M5S 3G8 (Canada); Jaffray, David A. [Radiation Medicine Program, Princess Margaret Cancer Centre, Toronto, Ontario M5G 2M9 (Canada)

2016-08-15

Purpose: Continuous dose delivery in radiation therapy treatments has been shown to decrease total treatment time while improving the dose conformity and distribution homogeneity over the conventional step-and-shoot approach. The authors develop an inverse treatment planning method for Gamma Knife® Perfexion™ that continuously delivers dose along a path in the target. Methods: The authors’ method is comprised of two steps: find a path within the target, then solve a mixed integer optimization model to find the optimal collimator configurations and durations along the selected path. Robotic path-finding techniques, specifically, simultaneous localization and mapping (SLAM) using an extended Kalman filter, are used to obtain a path that travels sufficiently close to selected isocentre locations. SLAM is novelly extended to explore a 3D, discrete environment, which is the target discretized into voxels. Further novel extensions are incorporated into the steering mechanism to account for target geometry. Results: The SLAM method was tested on seven clinical cases and compared to clinical, Hamiltonian path continuous delivery, and inverse step-and-shoot treatment plans. The SLAM approach improved dose metrics compared to the clinical plans and Hamiltonian path continuous delivery plans. Beam-on times improved over clinical plans, and had mixed performance compared to Hamiltonian path continuous plans. The SLAM method is also shown to be robust to path selection inaccuracies, isocentre selection, and dose distribution. Conclusions: The SLAM method for continuous delivery provides decreased total treatment time and increased treatment quality compared to both clinical and inverse step-and-shoot plans, and outperforms existing path methods in treatment quality. It also accounts for uncertainty in treatment planning by accommodating inaccuracies.

Robotic path-finding in inverse treatment planning for stereotactic radiosurgery with continuous dose delivery

International Nuclear Information System (INIS)

Vandewouw, Marlee M.; Aleman, Dionne M.; Jaffray, David A.

2016-01-01

Purpose: Continuous dose delivery in radiation therapy treatments has been shown to decrease total treatment time while improving the dose conformity and distribution homogeneity over the conventional step-and-shoot approach. The authors develop an inverse treatment planning method for Gamma Knife® Perfexion™ that continuously delivers dose along a path in the target. Methods: The authors’ method is comprised of two steps: find a path within the target, then solve a mixed integer optimization model to find the optimal collimator configurations and durations along the selected path. Robotic path-finding techniques, specifically, simultaneous localization and mapping (SLAM) using an extended Kalman filter, are used to obtain a path that travels sufficiently close to selected isocentre locations. SLAM is novelly extended to explore a 3D, discrete environment, which is the target discretized into voxels. Further novel extensions are incorporated into the steering mechanism to account for target geometry. Results: The SLAM method was tested on seven clinical cases and compared to clinical, Hamiltonian path continuous delivery, and inverse step-and-shoot treatment plans. The SLAM approach improved dose metrics compared to the clinical plans and Hamiltonian path continuous delivery plans. Beam-on times improved over clinical plans, and had mixed performance compared to Hamiltonian path continuous plans. The SLAM method is also shown to be robust to path selection inaccuracies, isocentre selection, and dose distribution. Conclusions: The SLAM method for continuous delivery provides decreased total treatment time and increased treatment quality compared to both clinical and inverse step-and-shoot plans, and outperforms existing path methods in treatment quality. It also accounts for uncertainty in treatment planning by accommodating inaccuracies.

Vehicle path-planning in three dimensions using optics analogs for optimizing visibility and energy cost

Science.gov (United States)

Rowe, Neil C.; Lewis, David H.

1989-01-01

Path planning is an important issue for space robotics. Finding safe and energy-efficient paths in the presence of obstacles and other constraints can be complex although important. High-level (large-scale) path planning for robotic vehicles was investigated in three-dimensional space with obstacles, accounting for: (1) energy costs proportional to path length; (2) turn costs where paths change trajectory abruptly; and (3) safety costs for the danger associated with traversing a particular path due to visibility or invisibility from a fixed set of observers. Paths optimal with respect to these cost factors are found. Autonomous or semi-autonomous vehicles were considered operating either in a space environment around satellites and space platforms, or aircraft, spacecraft, or smart missiles operating just above lunar and planetary surfaces. One class of applications concerns minimizing detection, as for example determining the best way to make complex modifications to a satellite without being observed by hostile sensors; another example is verifying there are no paths (holes) through a space defense system. Another class of applications concerns maximizing detection, as finding a good trajectory between mountain ranges of a planet while staying reasonably close to the surface, or finding paths for a flight between two locations that maximize the average number of triangulation points available at any time along the path.

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.

Defect vectors and path integrals in fracture mechanics

International Nuclear Information System (INIS)

Roche, R.L.

1979-01-01

Several criteria have been proposed in Elastic Plastic Fracture Mechanics. One of the most interesting ones is the J 1 criterion where J 1 is a path integral surrounding the crack tip. Other path integrals (or surface integrals in 3D problems) can be used. But all these integrals are introduced on an elastic basis, though they are applied in plasticity. This paper shows that it is possible to introduce these integrals without any reference to the elastic behavior of the material. The method is based on the 'defect vector theory' which is an extension of the energy-momentum tensor theory. (orig.)

The Internal and External Factors of Vocational Path Choice

OpenAIRE

Urbanavičiūtė, Ieva

2010-01-01

The main objective of the doctoral thesis was to analyze the features of one’s vocational path during the time of undergraduate studies. Undergraduate studies can be treated as a pathway of transition from school to the world of work. Therefore, it is especially important to identify what makes vocational choice successful during this period of time. In the study, several psychological success indicators of vocational path choice were distinguished. Moreover, the following factors were analyz...

Dry paths effectively reduce road mortality of small and medium-sized terrestrial vertebrates.

Science.gov (United States)

Niemi, Milla; Jääskeläinen, Niina C; Nummi, Petri; Mäkelä, Tiina; Norrdahl, Kai

2014-11-01

Wildlife passages are widely used mitigation measures designed to reduce the adverse impacts of roads on animals. We investigated whether road kills of small and medium-sized terrestrial vertebrates can be reduced by constructing dry paths adjacent to streams that pass under road bridges. The study was carried out in southern Finland during the summer of 2008. We selected ten road bridges with dry paths and ten bridges without them, and an individual dry land reference site for each study bridge on the basis of landscape and traffic features. A total of 307 dead terrestrial vertebrates were identified during the ten-week study period. The presence of dry paths decreased the amount of road-killed terrestrial vertebrates (Poisson GLMM; p road-kills on mammals was not such clear. In the mammal model, a lack of dry paths increased the amount of carcasses (p = 0.001) whereas the number of casualties at dry path bridges was comparable with dry land reference sites. A direct comparison of the dead ratios suggests an average efficiency of 79% for the dry paths. When considering amphibians and mammals alone, the computed effectiveness was 88 and 70%, respectively. Our results demonstrate that dry paths under road bridges can effectively reduce road-kills of small and medium-sized terrestrial vertebrates, even without guiding fences. Dry paths seemed to especially benefit amphibians which are a threatened species group worldwide and known to suffer high traffic mortality. Copyright © 2014 Elsevier Ltd. All rights reserved.

Edge Antimagic Total Labeling on Two Copies of Path

Science.gov (United States)

Nurdin; Abrar, A. M.; Bhayangkara, A. R. M.; Muliani; Samsir, A. U.; Nahdi, M. R. An

2018-03-01

A graph G = (V(G), E(G)) denotes the vertex set and the edge set, respectively. A (p,q)-graph G is a graph such that |V(G) | = p and |E(G) | = q. Graph of order p and size q is called (a,d)-edge-anti magic total if there exists a bijection f : V(G) U E(G)→ {1,2,..., p + q} such that the edge weights w(u,v) = f(u) + f(uv) + f(v) form an arithmetic sequence {a, a + d, a + 2d,...,a + (q - 1)d} with the first term a and common difference d. Two copies of path is disjoint union of two path graph with same order (Pn ∪Pn ) denoted by 2Pn . In this paper we construct the (a,d)-edge-anti magic total labeling in two copies of path for some differences d.

Constraint-Based Local Search for Constrained Optimum Paths Problems

Science.gov (United States)

Pham, Quang Dung; Deville, Yves; van Hentenryck, Pascal

Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algorithms, which are often hard to extend with side constraints and to apply widely. This paper proposes a constraint-based local search (CBLS) framework for COP applications, bringing the compositionality, reuse, and extensibility at the core of CBLS and CP systems. The modeling contribution is the ability to express compositional models for various COP applications at a high level of abstraction, while cleanly separating the model and the search procedure. The main technical contribution is a connected neighborhood based on rooted spanning trees to find high-quality solutions to COP problems. The framework, implemented in COMET, is applied to Resource Constrained Shortest Path (RCSP) problems (with and without side constraints) and to the edge-disjoint paths problem (EDP). Computational results show the potential significance of the approach.

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

Science.gov (United States)

Stringer, Simon M; Rolls, Edmund T

2006-12-01

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

Model for calculating shock loading and release paths for multicomponent geologic media

International Nuclear Information System (INIS)

Butkovich, T.R.; Moran, B.; Burton, D.E.

1981-07-01

A model has been devised to calculate shock Hugoniots and release paths off the Hugoniots for multicomponent rocks containing silicate, carbonate, and water. Hugoniot equations of state are constructed from relatively simple measurements of rock properties including bulk density, grain density of the silicate component, and weight fractions of water and carbonate. Release paths off the composite Hugoniot are calculated by mixing release paths off the component Hugoniots according to their weight fractions. If the shock imparts sufficient energy to the component to cause vaporization, a gas equation of state is used to calculate the release paths. For less energetic shocks, the rock component will unload like a solid or liquid, taking into account the irreversible removal of air-filled porosity

Path integrals in quantum mechanics, statistics, polymer physics, and financial markets

CERN Document Server

Kleinert, Hagen

2009-01-01

This is the fifth, expanded edition of the comprehensive textbook published in 1990 on the theory and applications of path integrals. It is the first book to explicitly solve path integrals of a wide variety of nontrivial quantum-mechanical systems, in particular the hydrogen atom. The solutions have been made possible by two major advances. The first is a new euclidean path integral formula which increases the restricted range of applicability of Feynman's time-sliced formula to include singular attractive 1/r- and 1/r2-potentials. The second is a new nonholonomic mapping principle carrying p

MODIFIED PATH METHODOLOGY FOR OBTAINING INTERVAL-SCALED POSTURAL ASSESSMENTS OF FARMWORKERS.

Science.gov (United States)

Garrison, Emma B; Dropkin, Jonathan; Russell, Rebecca; Jenkins, Paul

2018-01-29

Agricultural workers perform tasks that frequently require awkward and extreme postures that are associated with musculoskeletal disorders (MSDs). The PATH (Posture, Activity, Tools, Handling) system currently provides a sound methodology for quantifying workers' exposure to these awkward postures on an ordinal scale of measurement, which places restrictions on the choice of analytic methods. This study reports a modification of the PATH methodology that instead captures these postures as degrees of flexion, an interval-scaled measurement. Rather than making live observations in the field, as in PATH, the postural assessments were performed on photographs using ImageJ photo analysis software. Capturing the postures in photographs permitted more careful measurement of the degrees of flexion. The current PATH methodology requires that the observer in the field be trained in the use of PATH, whereas the single photographer used in this modification requires only sufficient training to maintain the proper camera angle. Ultimately, these interval-scale measurements could be combined with other quantitative measures, such as those produced by electromyograms (EMGs), to provide more sophisticated estimates of future risk for MSDs. Further, these data can provide a baseline from which the effects of interventions designed to reduce hazardous postures can be calculated with greater precision. Copyright© by the American Society of Agricultural Engineers.

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

The mean free path of protons in nuclei and the nuclear radius

International Nuclear Information System (INIS)

Dymarz, R.; Kohmura, T.

1983-01-01

We determine the mean free path of protons in nuclei in the energy range 40-1000 MeV. We find that it is necessary to use in the calculation of the mean free path the nuclear radius R which reproduces the reaction and total cross sections consistently and that this radius leads to a rather small mean free path which is comparable with the value obtained in the microscopic calculation in the whole energy region. (orig.)

Double path-integral migration velocity analysis: a real data example

International Nuclear Information System (INIS)

Costa, Jessé C; Schleicher, Jörg

2011-01-01

Path-integral imaging forms an image with no knowledge of the velocity model by summing over the migrated images obtained for a set of migration velocity models. Double path-integral imaging migration extracts the stationary velocities, i.e. those velocities at which common-image gathers align horizontally, as a byproduct. An application of the technique to a real data set demonstrates that quantitative information about the time migration velocity model can be determined by double path-integral migration velocity analysis. Migrated images using interpolations with different regularizations of the extracted velocities prove the high quality of the resulting time-migration velocity information. The so-obtained velocity model can then be used as a starting model for subsequent velocity analysis tools like migration tomography or other tomographic methods

Robust Path Planning and Feedback Design Under Stochastic Uncertainty

Science.gov (United States)

Blackmore, Lars

2008-01-01

Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. This requires that mission constraint violation can occur with a probability less than a prescribed value.In this paper we describe a novel method for optimal chance constrained path planning with feedback design. The approach optimizes both the reference trajectory to be followed and the feedback controller used to reject uncertainty. Our method extends recent results in constrained control synthesis based on convex optimization to solve control problems with nonconvex constraints. This extension is essential for path planning problems, which inherently have nonconvex obstacle avoidance constraints. Unlike previous approaches to chance constrained path planning, the new approach optimizes the feedback gain as wellas the reference trajectory.The key idea is to couple a fast, nonconvex solver that does not take into account uncertainty, with existing robust approaches that apply only to convex feasible regions. By alternating between robust and nonrobust solutions, the new algorithm guarantees convergence to a global optimum. We apply the new method to an unmanned aircraft and show simulation results that demonstrate the efficacy of the approach.

MANAGING HANFORD'S LEGACY NO-PATH-FORWARD WASTES TO DISPOSITION

International Nuclear Information System (INIS)

West, L.D.

2011-01-01

The U.S. Department of Energy (DOE) Richland Operations Office (RL) has adopted the 2015 Vision for Cleanup of the Hanford Site. This vision will protect the Columbia River, reduce the Site footprint, and reduce Site mortgage costs. The CH2M HILL Plateau Remediation Company's (CHPRC) Waste and Fuels Management Project (W and FMP) and their partners support this mission by providing centralized waste management services for the Hanford Site waste generating organizations. At the time of the CHPRC contract award (August 2008) slightly more than 9,000 m 3 of waste was defined as 'no-path-forward waste.' The majority of these wastes are suspect transuranic mixed (TRUM) wastes which are currently stored in the low-level Burial Grounds (LLBG), or stored above ground in the Central Waste Complex (CWC). A portion of the waste will be generated during ongoing and future site cleanup activities. The DOE-RL and CHPRC have collaborated to identify and deliver safe, cost-effective disposition paths for 90% (∼8,000 m 3 ) of these problematic wastes. These paths include accelerated disposition through expanded use of offsite treatment capabilities. Disposal paths were selected that minimize the need to develop new technologies, minimize the need for new, on-site capabilities, and accelerate shipments of transuranic (TRU) waste to the Waste Isolation Pilot Plant (WIPP) in Carlsbad, New Mexico.

MOCUS, Minimal Cut Sets and Minimal Path Sets from Fault Tree Analysis

International Nuclear Information System (INIS)

Fussell, J.B.; Henry, E.B.; Marshall, N.H.

1976-01-01

1 - Description of problem or function: From a description of the Boolean failure logic of a system, called a fault tree, and control parameters specifying the minimal cut set length to be obtained MOCUS determines the system failure modes, or minimal cut sets, and the system success modes, or minimal path sets. 2 - Method of solution: MOCUS uses direct resolution of the fault tree into the cut and path sets. The algorithm used starts with the main failure of interest, the top event, and proceeds to basic independent component failures, called primary events, to resolve the fault tree to obtain the minimal sets. A key point of the algorithm is that an and gate alone always increases the number of path sets; an or gate alone always increases the number of cut sets and increases the size of path sets. Other types of logic gates must be described in terms of and and or logic gates. 3 - Restrictions on the complexity of the problem: Output from MOCUS can include minimal cut and path sets for up to 20 gates

Eukaryotic Pathogen Database Resources (EuPathDB)

Data.gov (United States)

U.S. Department of Health & Human Services — EuPathDB Bioinformatics Resource Center for Biodefense and Emerging/Re-emerging Infectious Diseases is a portal for accessing genomic-scale datasets associated with...

Distance Dependence of Path Loss for Millimeter Wave Inter-Vehicle Communications

Directory of Open Access Journals (Sweden)

M. Fujise

2004-12-01

Full Text Available Millimeter-wave path loss between two cars was measured to obtainthe general applicable distance for inter-vehicle communication systemsin real environments. An abrupt and substantial increase in path lossdue to interruption, curves, and different-lane traveling has been amajor concern in inter-vehicle communications. The path lossmeasurements were carried out using 60-GHz CW radiowaves and standardhorn antennas on metropolitan highways and regular roads. Because thepropagation loss is traffic-dependent, the highways were classifiedinto uncrowded and crowded highways, and the regular roads wereclassified into uncrowded and crowded roads. The path loss for thehighways exhibited 2nd-power-law attenuation and that for the regularroads exhibited 1st-power-law attenuation with an increase ininter-vehicle distance. Additional losses of 15 dB for the highways and5 dB for the regular roads were observed when the inter-vehicledistance was more than approximately 30 m. Thus, we were able todemonstrate millimeter-wave inter-vehicle communications at aninter-vehicle distance of more than 100 m.

Path Integration Applied to Structural Systems with Uncertain Properties

DEFF Research Database (Denmark)

Nielsen, Søren R.K.; Köylüoglu, H. Ugur

Path integration (cell-to-cell mapping) method is applied to evaluate the joint probability density function (jpdf) of the response of the structural systems, with uncertain properties, subject to white noise excitation. A general methodology to deal with uncertainties is outlined and applied...... to the friction controlled slip of a structure on a foundation where the friction coefficient is modelled as a random variable. Exact results derived using the total probability theorem are compared to the ones obtained via path integration....

Digital Path Approach Despeckle Filter for Ultrasound Imaging and Video

Directory of Open Access Journals (Sweden)

Marek Szczepański

2017-01-01

Full Text Available We propose a novel filtering technique capable of reducing the multiplicative noise in ultrasound images that is an extension of the denoising algorithms based on the concept of digital paths. In this approach, the filter weights are calculated taking into account the similarity between pixel intensities that belongs to the local neighborhood of the processed pixel, which is called a path. The output of the filter is estimated as the weighted average of pixels connected by the paths. The way of creating paths is pivotal and determines the effectiveness and computational complexity of the proposed filtering design. Such procedure can be effective for different types of noise but fail in the presence of multiplicative noise. To increase the filtering efficiency for this type of disturbances, we introduce some improvements of the basic concept and new classes of similarity functions and finally extend our techniques to a spatiotemporal domain. The experimental results prove that the proposed algorithm provides the comparable results with the state-of-the-art techniques for multiplicative noise removal in ultrasound images and it can be applied for real-time image enhancement of video streams.

Extended shortest path selection for package routing of complex networks