Location-based Mobile Relay Selection and Impact of Inaccurate Path Loss Model Parameters

DEFF Research Database (Denmark)

Nielsen, Jimmy Jessen; Madsen, Tatiana Kozlova; Schwefel, Hans-Peter

2010-01-01

In this paper we propose a relay selection scheme which uses collected location information together with a path loss model for relay selection, and analyze the performance impact of mobility and different error causes on this scheme. Performance is evaluated in terms of bit error rate...... by simulations. The SNR measurement based relay selection scheme proposed previously is unsuitable for use with fast moving users in e.g. vehicular scenarios due to a large signaling overhead. The proposed location based scheme is shown to work well with fast moving users due to a lower signaling overhead...... in these situations. As the location-based scheme relies on a path loss model to estimate link qualities and select relays, the sensitivity with respect to inaccurate estimates of the unknown path loss model parameters is investigated. The parameter ranges that result in useful performance were found...

Extended shortest path selection for package routing of complex networks

Science.gov (United States)

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

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

MODELING OF HARDWARE AND ALGORITHMIC STRUCTURE OF MOBILE MULTIPOSITIONING RADIO RANGEFINDING NAVIGATION AND LANDING AEROSYSTEM IN ITS SPATIAL CONFIGURATION

Directory of Open Access Journals (Sweden)

Ya. V. Kondrashov

2014-01-01

Full Text Available The concept of structuring of radio equipment, mathematical and algorithmic tools to provide computing operations for determining the location of aircraft in spatial configuration of mobile (portable multipositioning radio rangefinding interrogation-reply navigation and landing system is considered in this article. The mathematical modeling of algorithms of aircraft traffic terminal control is carried out. The results of calculations of potential system performance and its analysis for compliance with international safety requirements are represented.

Sensor Selection for Aircraft Engine Performance Estimation and Gas Path Fault Diagnostics

Science.gov (United States)

Simon, Donald L.; Rinehart, Aidan W.

2016-01-01

This paper presents analytical techniques for aiding system designers in making aircraft engine health management sensor selection decisions. The presented techniques, which are based on linear estimation and probability theory, are tailored for gas turbine engine performance estimation and gas path fault diagnostics applications. They enable quantification of the performance estimation and diagnostic accuracy offered by different candidate sensor suites. For performance estimation, sensor selection metrics are presented for two types of estimators including a Kalman filter and a maximum a posteriori estimator. For each type of performance estimator, sensor selection is based on minimizing the theoretical sum of squared estimation errors in health parameters representing performance deterioration in the major rotating modules of the engine. For gas path fault diagnostics, the sensor selection metric is set up to maximize correct classification rate for a diagnostic strategy that performs fault classification by identifying the fault type that most closely matches the observed measurement signature in a weighted least squares sense. Results from the application of the sensor selection metrics to a linear engine model are presented and discussed. Given a baseline sensor suite and a candidate list of optional sensors, an exhaustive search is performed to determine the optimal sensor suites for performance estimation and fault diagnostics. For any given sensor suite, Monte Carlo simulation results are found to exhibit good agreement with theoretical predictions of estimation and diagnostic accuracies.

Limitations in artificial spin ice path selectivity: the challenges beyond topological control

International Nuclear Information System (INIS)

Walton, S K; Zeissler, K; Burn, D M; Cohen, L F; Branford, W R; Ladak, S; Read, D E; Tyliszczak, T

2015-01-01

Magnetic charge is carried through nanowire networks by domain walls, and the micromagnetic structure of a domain wall provides an opportunity to manipulate its movement. We have shown previously that magnetic monopole defects exist in artificial spin ice (ASI) and result from two bar switching at a vertex. To create and manipulate monopole defects and indeed magnetic charge in general, path selectivity of the domain wall at a vertex is required. We have recently shown that in connected ASI structures, transverse wall chirality (or topology) determines wall path direction, but a mechanism known as Walker breakdown, where a wall mutates into a wall of opposite chirality partially destroys selectivity. Recently it has been claimed that in isolated Y-shaped junctions that support vortex walls, selectivity is entirely determined by chirality (or topology), the suggestion being that vortex wall chirality is robust in the Walker breakdown process. Here we demonstrate that in Y-shaped junctions, magnetic switching in the important topologically protected regime exists only for a narrow window of field and bar geometry, and that it will be challenging to access this regime in field-driven ASI. This work has implications for the wider field of magnetic charge manipulation for high density memory storage. (paper)

Continuous-scanning laser Doppler vibrometry: Extensions to arbitrary areas, multi-frequency and 3D capture

International Nuclear Information System (INIS)

Weekes, B.; Ewins, D.; Acciavatti, F.

2014-01-01

To date, differing implementations of continuous scan laser Doppler vibrometry have been demonstrated by various academic institutions, but since the scan paths were defined using step or sine functions from function generators, the paths were typically limited to 1D line scans or 2D areas such as raster paths or Lissajous trajectories. The excitation was previously often limited to a single frequency due to the specific signal processing performed to convert the scan data into an ODS. In this paper, a configuration of continuous-scan laser Doppler vibrometry is demonstrated which permits scanning of arbitrary areas, with the benefit of allowing multi-frequency/broadband excitation. Various means of generating scan paths to inspect arbitrary areas are discussed and demonstrated. Further, full 3D vibration capture is demonstrated by the addition of a range-finding facility to the described configuration, and iteratively relocating a single scanning laser head. Here, the range-finding facility was provided by a Microsoft Kinect, an inexpensive piece of consumer electronics

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

CSIR Research Space (South Africa)

Mhlanga, MM

2009-01-01

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

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

CSIR Research Space (South Africa)

Mhlanga, MM

2009-08-01

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

Path analysis for selection of feijoa with greater pulp weight

Directory of Open Access Journals (Sweden)

Joel Donazzolo

Full Text Available ABSTRACT: The objective of this paper was to identify the direct and indirect effects of feijoa fruits (Acca sellowiana traitson pulp weight, in order to use these traits in indirect genotypes selection. Fruits of five feijoa plants were collected in Rio Grande do Sul, in the years of 2009, 2010 and 2011. Six traits were evaluated: diameter, length, total weight, pulp weight, peel thickness and number of seeds per fruit. In the path analysis, with or without ridge regression, pulp weight was considered as the basic variable, and the other traits were considered as explanatory variables. Total weight and fruit diameter had high direct effect, and are the main traits associated with pulp weight. These traits may serve as criteria for indirect selection to increase feijoa pulp weight, since they are easy to be measured.

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.

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

Science.gov (United States)

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

2001-07-01

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

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

Short communication: Genetic lag represents commercial herd genetic merit more accurately than the 4-path selection model.

Science.gov (United States)

Dechow, C D; Rogers, G W

2018-05-01

Expectation of genetic merit in commercial dairy herds is routinely estimated using a 4-path genetic selection model that was derived for a closed population, but commercial herds using artificial insemination sires are not closed. The 4-path model also predicts a higher rate of genetic progress in elite herds that provide artificial insemination sires than in commercial herds that use such sires, which counters other theoretical assumptions and observations of realized genetic responses. The aim of this work is to clarify whether genetic merit in commercial herds is more accurately reflected under the assumptions of the 4-path genetic response formula or by a genetic lag formula. We demonstrate by tracing the transmission of genetic merit from parents to offspring that the rate of genetic progress in commercial dairy farms is expected to be the same as that in the genetic nucleus. The lag in genetic merit between the nucleus and commercial farms is a function of sire and dam generation interval, the rate of genetic progress in elite artificial insemination herds, and genetic merit of sires and dams. To predict how strategies such as the use of young versus daughter-proven sires, culling heifers following genomic testing, or selective use of sexed semen will alter genetic merit in commercial herds, genetic merit expectations for commercial herds should be modeled using genetic lag expectations. Copyright © 2018 American Dairy Science Association. Published by Elsevier Inc. All rights reserved.

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.

GRASP with path-relinking for the selective pickup and delivery problem

DEFF Research Database (Denmark)

Ho, Sin C.; Szeto, W. Y.

2016-01-01

Bike sharing systems are very popular nowadays. One of the characteristics is that bikes are picked up from some surplus bike stations and transported to all deficit bike stations by a repositioning vehicle with limited capacity to satisfy the demand of deficit bike stations. Motivated by this real...... world bicycle repositioning problem, we study the selective pickup and delivery problem, where demand at every delivery node has to be satisfied by the supply collected from a subset of pickup nodes. The objective is to minimize the total travel cost incurred from visiting the nodes. We present a GRASP...... with path-relinking for solving the described problem. Experimental results show that this simple heuristic improves the existing results in the literature with an average improvement of 5.72% using small computing times. The proposed heuristic can contribute to the development of effective and efficient...

Mapping ionospheric backscatter measured by the SuperDARN HF radars – Part 2: Assessing SuperDARN virtual height models

Directory of Open Access Journals (Sweden)

T. K. Yeoman

2008-05-01

Full Text Available The Super Dual Auroral Radar Network (SuperDARN network of HF coherent backscatter radars form a unique global diagnostic of large-scale ionospheric and magnetospheric dynamics in the Northern and Southern Hemispheres. Currently the ground projections of the HF radar returns are routinely determined by a simple rangefinding algorithm, which takes no account of the prevailing, or indeed the average, HF propagation conditions. This is in spite of the fact that both direct E- and F-region backscatter and 1½-hop E- and F-region backscatter are commonly used in geophysical interpretation of the data. In a companion paper, Chisham et al. (2008 have suggested a new virtual height model for SuperDARN, based on average measured propagation paths. Over shorter propagation paths the existing rangefinding algorithm is adequate, but mapping errors become significant for longer paths where the roundness of the Earth becomes important, and a correct assumption of virtual height becomes more difficult. The SuperDARN radar at Hankasalmi has a propagation path to high power HF ionospheric modification facilities at both Tromsø on a ½-hop path and SPEAR on a 1½-hop path. The SuperDARN radar at Þykkvibǽr has propagation paths to both facilities over 1½-hop paths. These paths provide an opportunity to quantitatively test the available SuperDARN virtual height models. It is also possible to use HF radar backscatter which has been artificially induced by the ionospheric heaters as an accurate calibration point for the Hankasalmi elevation angle of arrival data, providing a range correction algorithm for the SuperDARN radars which directly uses elevation angle. These developments enable the accurate mappings of the SuperDARN electric field measurements which are required for the growing number of multi-instrument studies of the Earth's ionosphere and magnetosphere.

Investigation of controlled flight into terrain : descriptions of flight paths for selected controlled flight into terrain (CFIT) aircraft accidents, 1985-1997

Science.gov (United States)

1999-03-01

This report documents an investigation of the flight paths of 13 selected controlled flight into terrain (CFIT) aircraft accidents that occurred between 1985 and 1997. The Operations Assessment Division (DTS-43) and the Aviation Safety Division (DTS-...

Characterization of the Hokuyo URG-04LX laser rangefinder for mobile robot obstacle negotiation

Science.gov (United States)

Okubo, Yoichi; Ye, Cang; Borenstein, Johann

2009-05-01

This paper presents a characterization study of the Hokuyo URG-04LX scanning laser rangefinder (LRF). The Hokuyo LRF is similar in function to the Sick LRF, which has been the de-facto standard range sensor for mobile robot obstacle avoidance and mapping applications for the last decade. Problems with the Sick LRF are its relatively large size, weight, and power consumption, allowing its use only on relatively large mobile robots. The Hokuyo LRF is substantially smaller, lighter, and consumes less power, and is therefore more suitable for small mobile robots. The question is whether it performs just as well as the Sick LRF in typical mobile robot applications. In 2002, two of the authors of the present paper published a characterization study of the Sick LRF. For the present paper we used the exact same test apparatus and test procedures as we did in the 2002 paper, but this time to characterize the Hokuyo LRF. As a result, we are in the unique position of being able to provide not only a detailed characterization study of the Hokuyo LRF, but also to compare the Hokuyo LRF with the Sick LRF under identical test conditions. Among the tested characteristics are sensitivity to a variety of target surface properties and incidence angles, which may potentially affect the sensing performance. We also discuss the performance of the Hokuyo LRF with regard to the mixed pixels problem associated with LRFs. Lastly, the present paper provides a calibration model for improving the accuracy of the Hokuyo LRF.

Your choice MATor(s) : large-scale quantitative anonymity assessment of Tor path selection algorithms against structural attacks

OpenAIRE

Backes, Michael; Meiser, Sebastian; Slowik, Marcin

2015-01-01

In this paper, we present a rigorous methodology for quantifying the anonymity provided by Tor against a variety of structural attacks, i.e., adversaries that compromise Tor nodes and thereby perform eavesdropping attacks to deanonymize Tor users. First, we provide an algorithmic approach for computing the anonymity impact of such structural attacks against Tor. The algorithm is parametric in the considered path selection algorithm and is, hence, capable of reasoning about variants of Tor and...

The Best Path Analysis in Military Highway Transport Based on DEA and Multiobjective Fuzzy Decision-Making

Directory of Open Access Journals (Sweden)

Wu Juan

2014-01-01

Full Text Available Military transport path selection directly affects the transport speed, efficiency, and safety. To a certain degree, the results of the path selection determine success or failure of the war situation. The purpose of this paper is to propose a model based on DEA (data envelopment analysis and multiobjective fuzzy decision-making for path selection. The path decision set is established according to a search algorithm based on overlapping section punishment. Considering the influence of various fuzzy factors, the model of optimal path is constructed based on DEA and multitarget fuzzy decision-making theory, where travel time, transport risk, quick response capability, and transport cost constitute the evaluation target set. A reasonable path set can be calculated and sorted according to the comprehensive scores of the paths. The numerical results show that the model and the related algorithms are effective for path selection of military transport.

Selective influence of prior allocentric knowledge on the kinesthetic learning of a path.

Science.gov (United States)

Lafon, Matthieu; Vidal, Manuel; Berthoz, Alain

2009-04-01

Spatial cognition studies have described two main cognitive strategies involved in the memorization of traveled paths in human navigation. One of these strategies uses the action-based memory (egocentric) of the traveled route or paths, which involves kinesthetic memory, optic flow, and episodic memory, whereas the other strategy privileges a survey memory of cartographic type (allocentric). Most studies have dealt with these two strategies separately, but none has tried to show the interaction between them in spite of the fact that we commonly use a map to imagine our journey and then proceed using egocentric navigation. An interesting question is therefore: how does prior allocentric knowledge of the environment affect the egocentric, purely kinesthetic navigation processes involved in human navigation? We designed an experiment in which blindfolded subjects had first to walk and memorize a path with kinesthetic cues only. They had previously been shown a map of the path, which was either correct or distorted (consistent shrinking or growing). The latter transformations were studied in order to observe what influence a distorted prior knowledge could have on spatial mechanisms. After having completed the first learning travel along the path, they had to perform several spatial tasks during the testing phase: (1) pointing towards the origin and (2) to specific points encountered along the path, (3) a free locomotor reproduction, and (4) a drawing of the memorized path. The results showed that prior cartographic knowledge influences the paths drawn and the spatial inference capacity, whereas neither locomotor reproduction nor spatial updating was disturbed. Our results strongly support the notion that (1) there are two independent neural bases underlying these mechanisms: a map-like representation allowing allocentric spatial inferences, and a kinesthetic memory of self-motion in space; and (2) a common use of, or a switching between, these two strategies is

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

Directory of Open Access Journals (Sweden)

Wu Xing

2014-03-01

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

High Altitude Balloon Flight Path Prediction and Site Selection Based On Computer Simulations

Science.gov (United States)

Linford, Joel

2010-10-01

Interested in the upper atmosphere, Weber State University Physics department has developed a High Altitude Reconnaissance Balloon for Outreach and Research team, also known as HARBOR. HARBOR enables Weber State University to take a variety of measurements from ground level to altitudes as high as 100,000 feet. The flight paths of these balloons can extend as long as 100 miles from the launch zone, making the choice of where and when to fly critical. To ensure the ability to recover the packages in a reasonable amount of time, days and times are carefully selected using computer simulations limiting flight tracks to approximately 40 miles from the launch zone. The computer simulations take atmospheric data collected by National Oceanic and Atmospheric Administration (NOAA) to plot what flights might have looked like in the past, and to predict future flights. Using these simulations a launch zone has been selected in Duchesne Utah, which has hosted eight successful flights over the course of the last three years, all of which have been recovered. Several secondary launch zones in western Wyoming, Southern Idaho, and Northern Utah are also being considered.

A Study of the r-Process Path Nuclides,$^{137,138,139}$Sb using the Enhanced Selectivity of Resonance Ionization Laser Ionization

CERN Multimedia

Walters, W

2002-01-01

The particular features of the r-process abundances with 100 < A < 150 have demonstrated the close connection between knowledge of nuclear structure and decay along the r-process path and the astrophysical environement in which these elements are produced. Key to this connection has been the measurement of data for nuclides (mostly even-N nuclides) that lie in the actual r-process path. Such data are of direct use in r-process calculations and they also serve to refine and test the predictive power of nuclear models where little or no data now exist. In this experiment we seek to use the newly developed ionization scheme for the Resonance Ionization Laser Ion Source (RILIS) to achieve selective ionization of neutron-rich antimony isotopes in order to measure the decay properties of r-process path nuclides $^{137,138,139}$Sb. These properties include the half-lives, delayed neutron branches, and daughter $\\gamma$-rays. The new nuclear structure data for the daughter Te nuclides is also of considerable in...

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

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.

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.

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.

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.

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.

Hard paths, soft paths or no paths? Cross-cultural perceptions of water solutions

Science.gov (United States)

Wutich, A.; White, A. C.; White, D. D.; Larson, K. L.; Brewis, A.; Roberts, C.

2014-01-01

In this study, we examine how development status and water scarcity shape people's perceptions of "hard path" and "soft path" water solutions. Based on ethnographic research conducted in four semi-rural/peri-urban sites (in Bolivia, Fiji, New Zealand, and the US), we use content analysis to conduct statistical and thematic comparisons of interview data. Our results indicate clear differences associated with development status and, to a lesser extent, water scarcity. People in the two less developed sites were more likely to suggest hard path solutions, less likely to suggest soft path solutions, and more likely to see no path to solutions than people in the more developed sites. Thematically, people in the two less developed sites envisioned solutions that involve small-scale water infrastructure and decentralized, community-based solutions, while people in the more developed sites envisioned solutions that involve large-scale infrastructure and centralized, regulatory water solutions. People in the two water-scarce sites were less likely to suggest soft path solutions and more likely to see no path to solutions (but no more likely to suggest hard path solutions) than people in the water-rich sites. Thematically, people in the two water-rich sites seemed to perceive a wider array of unrealized potential soft path solutions than those in the water-scarce sites. On balance, our findings are encouraging in that they indicate that people are receptive to soft path solutions in a range of sites, even those with limited financial or water resources. Our research points to the need for more studies that investigate the social feasibility of soft path water solutions, particularly in sites with significant financial and natural resource constraints.

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.

Path coupling and aggregate path coupling

CERN Document Server

Kovchegov, Yevgeniy

2018-01-01

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

Path Creation, Path Dependence and Breaking Away from the Path

OpenAIRE

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

2016-01-01

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

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.

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

Capacity bounds for kth best path selection over generalized fading channels

KAUST Repository

Hanif, Muhammad Fainan; Yang, Hongchuan; Alouini, Mohamed-Slim

2014-01-01

Exact ergodic capacity calculation for fading wireless channels typically involves time-consuming numerical evaluation of infinite integrals. In this paper, lower and upper bounds on ergodic capacity for kth best path are presented. These bounds

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.

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

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

Path Dependency

OpenAIRE

Mark Setterfield

2015-01-01

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

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.

Quivers of Bound Path Algebras and Bound Path Coalgebras

Directory of Open Access Journals (Sweden)

Dr. Intan Muchtadi

2010-09-01

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

Fractional path planning and path tracking

International Nuclear Information System (INIS)

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

2011-01-01

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

Feynman's path integrals and Bohm's particle paths

International Nuclear Information System (INIS)

Tumulka, Roderich

2005-01-01

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

Multi-Dimensional Path Queries

DEFF Research Database (Denmark)

Bækgaard, Lars

1998-01-01

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

Polygonal-path approximations on the path spaces of quantum-mechanical systems: properties of the polygonal paths

International Nuclear Information System (INIS)

Exner, P.; Kolerov, G.I.

1981-01-01

Properties of the subset of polygonal paths in the Hilbert space H of paths referring to a d-dimensional quantum-mechanical system are examined. Using the reproduction kernel technique we prove that each element of H is approximated by polygonal paths uniformly with respect to the ''norm'' of time-interval partitions. This result will be applied in the second part of the present paper to prove consistency of the uniform polygonal-path extension of the Feynman maps [ru

Photonic integrated circuit as a picosecond pulse timing discriminator.

Science.gov (United States)

Lowery, Arthur James; Zhuang, Leimeng

2016-04-18

We report the first experimental demonstration of a compact on-chip optical pulse timing discriminator that is able to provide an output voltage proportional to the relative timing of two 60-ps input pulses on separate paths. The output voltage is intrinsically low-pass-filtered, so the discriminator forms an interface between high-speed optics and low-speed electronics. Potential applications include timing synchronization of multiple pulse trains as a precursor for optical time-division multiplexing, and compact rangefinders with millimeter dimensions.

Pulled Motzkin paths

International Nuclear Information System (INIS)

Janse van Rensburg, E J

2010-01-01

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

Pulled Motzkin paths

Energy Technology Data Exchange (ETDEWEB)

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

2010-08-20

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

Pulled Motzkin paths

Science.gov (United States)

Janse van Rensburg, E. J.

2010-08-01

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

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.

Capacity bounds for kth best path selection over generalized fading channels

KAUST Repository

Hanif, Muhammad Fainan

2014-02-01

Exact ergodic capacity calculation for fading wireless channels typically involves time-consuming numerical evaluation of infinite integrals. In this paper, lower and upper bounds on ergodic capacity for kth best path are presented. These bounds have simple analytic expressions which allow their fast evaluation. Numerical results show that the newly proposed bounds closely approximate the exact ergodic capacity for a large variety of system configurations. © 1997-2012 IEEE.

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.

Path Expressions

Science.gov (United States)

1975-06-01

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

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.

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…

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.

Path analysis and multi-criteria decision making: an approach for multivariate model selection and analysis in health.

Science.gov (United States)

Vasconcelos, A G; Almeida, R M; Nobre, F F

2001-08-01

This paper introduces an approach that includes non-quantitative factors for the selection and assessment of multivariate complex models in health. A goodness-of-fit based methodology combined with fuzzy multi-criteria decision-making approach is proposed for model selection. Models were obtained using the Path Analysis (PA) methodology in order to explain the interrelationship between health determinants and the post-neonatal component of infant mortality in 59 municipalities of Brazil in the year 1991. Socioeconomic and demographic factors were used as exogenous variables, and environmental, health service and agglomeration as endogenous variables. Five PA models were developed and accepted by statistical criteria of goodness-of fit. These models were then submitted to a group of experts, seeking to characterize their preferences, according to predefined criteria that tried to evaluate model relevance and plausibility. Fuzzy set techniques were used to rank the alternative models according to the number of times a model was superior to ("dominated") the others. The best-ranked model explained above 90% of the endogenous variables variation, and showed the favorable influences of income and education levels on post-neonatal mortality. It also showed the unfavorable effect on mortality of fast population growth, through precarious dwelling conditions and decreased access to sanitation. It was possible to aggregate expert opinions in model evaluation. The proposed procedure for model selection allowed the inclusion of subjective information in a clear and systematic manner.

Career path for operations personnel

International Nuclear Information System (INIS)

Asher, J.A.

1985-01-01

This paper explains how selected personnel can now obtain a Bachelor of Science degree in Physics with a Nuclear Power Operations option. The program went into effect the Fall of 1984. Another program was worked out in 1982 whereby students attending the Nuclear Operators Training Program could obtain an Associates of Science degree in Mechanical Engineering Technology at the end of two years of study. This paper presents tables and charts which describe these programs and outline the career path for operators

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

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

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

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

Science.gov (United States)

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

2011-01-01

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

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

Science.gov (United States)

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

2018-04-23

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

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

Directory of Open Access Journals (Sweden)

Weigang Bai

2018-04-01

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

Cyclone: A laser scanner for mobile robot navigation

Science.gov (United States)

Singh, Sanjiv; West, Jay

1991-09-01

Researchers at Carnegie Mellon's Field Robotics Center have designed and implemented a scanning laser rangefinder. The device uses a commercially available time-of-flight ranging instrument that is capable of making up to 7200 measurements per second. The laser beam is reflected by a rotating mirror, producing up to a 360 degree view. Mounted on a robot vehicle, the scanner can be used to detect obstacles in the vehicle's path or to locate the robot on a map. This report discusses the motivation, design, and some applications of the scanner.

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

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.

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.

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.

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

Variability, correlation and path coefficient analysis of seedling traits ...

African Journals Online (AJOL)

Indirect selection is a useful means for improving yield in cotton crop. The objective of the present study was to determine the genetic variability, broad sense heritability, genetic advance and correlation among the six seedling traits and their direct and indirect effects on cotton yield by using path coefficient analysis.

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.

Variability, correlation and path coefficient analysis of seedling traits ...

African Journals Online (AJOL)

use

2011-12-12

Dec 12, 2011 ... Indirect selection is a useful means for improving yield in cotton crop. The objective of the present study was to determine the genetic variability, broad sense heritability, genetic advance and correlation among the six seedling traits and their direct and indirect effects on cotton yield by using path coefficient ...

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

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.

Reaction path of energetic materials using THOR code

Science.gov (United States)

Durães, L.; Campos, J.; Portugal, A.

1998-07-01

The method of predicting reaction path, using THOR code, allows for isobar and isochor adiabatic combustion and CJ detonation regimes, the calculation of the composition and thermodynamic properties of reaction products of energetic materials. THOR code assumes the thermodynamic equilibria of all possible products, for the minimum Gibbs free energy, using HL EoS. The code allows the possibility of estimating various sets of reaction products, obtained successively by the decomposition of the original reacting compound, as a function of the released energy. Two case studies of thermal decomposition procedure were selected, calculated and discussed—pure Ammonium Nitrate and its based explosive ANFO, and Nitromethane—because their equivalence ratio is respectively lower, near and greater than the stoicheiometry. Predictions of reaction path are in good correlation with experimental values, proving the validity of proposed method.

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.

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

Judgments in the selection of path generation techniques: a meta-analytic approach

DEFF Research Database (Denmark)

Prato, Carlo Giacomo

2012-01-01

objective judgments for effective route choice set generation. Initially, path generation techniques are implemented within a synthetic network to generate possible subjective choice sets considered by travelers. Next, “true model estimates” and “postulated predicted routes” are assumed from the simulation...... of a route choice model. Then, objective choice sets are applied for model estimation and results are compared to the “true model estimates”. Last, predictions from the simulation of models estimated with objective choice sets are compared to the “postulated predicted routes”. Meta-analysis allows...

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

Ted Irving and the Arc of APW Paths

Science.gov (United States)

Kent, D. V.

2014-12-01

Late Jurassic, which had been missed in seemingly more robust (certainly more populated) APW paths to date. This prompts the suggestion that a threshold criterion for pole selection might be whether a result was publishable by today's standards, which could provide motivation for the generation of new data for better resolved APW paths as a legacy to Ted.

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.

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.

Visual search in scenes involves selective and non-selective pathways

Science.gov (United States)

Wolfe, Jeremy M; Vo, Melissa L-H; Evans, Karla K; Greene, Michelle R

2010-01-01

How do we find objects in scenes? For decades, visual search models have been built on experiments in which observers search for targets, presented among distractor items, isolated and randomly arranged on blank backgrounds. Are these models relevant to search in continuous scenes? This paper argues that the mechanisms that govern artificial, laboratory search tasks do play a role in visual search in scenes. However, scene-based information is used to guide search in ways that had no place in earlier models. Search in scenes may be best explained by a dual-path model: A “selective” path in which candidate objects must be individually selected for recognition and a “non-selective” path in which information can be extracted from global / statistical information. PMID:21227734

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.

Cellular scanning strategy for selective laser melting: Generating reliable, optimized scanning paths and processing parameters

DEFF Research Database (Denmark)

Mohanty, Sankhya; Hattel, Jesper Henri

2015-01-01

method based uncertainty and reliability analysis. The reliability of the scanning paths are established using cumulative probability distribution functions for process output criteria such as sample density, thermal homogeneity, etc. A customized genetic algorithm is used along with the simulation model...

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

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.

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.

Opportunistic Relay Selection with Cooperative Macro Diversity

Directory of Open Access Journals (Sweden)

Yu Chia-Hao

2010-01-01

Full Text Available We apply a fully opportunistic relay selection scheme to study cooperative diversity in a semianalytical manner. In our framework, idle Mobile Stations (MSs are capable of being used as Relay Stations (RSs and no relaying is required if the direct path is strong. Our relay selection scheme is fully selection based: either the direct path or one of the relaying paths is selected. Macro diversity, which is often ignored in analytical works, is taken into account together with micro diversity by using a complete channel model that includes both shadow fading and fast fading effects. The stochastic geometry of the network is taken into account by having a random number of randomly located MSs. The outage probability analysis of the selection differs from the case where only fast fading is considered. Under our framework, distribution of the received power is formulated using different Channel State Information (CSI assumptions to simulate both optimistic and practical environments. The results show that the relay selection gain can be significant given a suitable amount of candidate RSs. Also, while relay selection according to incomplete CSI is diversity suboptimal compared to relay selection based on full CSI, the loss in average throughput is not too significant. This is a consequence of the dominance of geometry over fast fading.

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

Actively learning human gaze shifting paths for semantics-aware photo cropping.

Science.gov (United States)

Zhang, Luming; Gao, Yue; Ji, Rongrong; Xia, Yingjie; Dai, Qionghai; Li, Xuelong

2014-05-01

Photo cropping is a widely used tool in printing industry, photography, and cinematography. Conventional cropping models suffer from the following three challenges. First, the deemphasized role of semantic contents that are many times more important than low-level features in photo aesthetics. Second, the absence of a sequential ordering in the existing models. In contrast, humans look at semantically important regions sequentially when viewing a photo. Third, the difficulty of leveraging inputs from multiple users. Experience from multiple users is particularly critical in cropping as photo assessment is quite a subjective task. To address these challenges, this paper proposes semantics-aware photo cropping, which crops a photo by simulating the process of humans sequentially perceiving semantically important regions of a photo. We first project the local features (graphlets in this paper) onto the semantic space, which is constructed based on the category information of the training photos. An efficient learning algorithm is then derived to sequentially select semantically representative graphlets of a photo, and the selecting process can be interpreted by a path, which simulates humans actively perceiving semantics in a photo. Furthermore, we learn a prior distribution of such active graphlet paths from training photos that are marked as aesthetically pleasing by multiple users. The learned priors enforce the corresponding active graphlet path of a test photo to be maximally similar to those from the training photos. Experimental results show that: 1) the active graphlet path accurately predicts human gaze shifting, and thus is more indicative for photo aesthetics than conventional saliency maps and 2) the cropped photos produced by our approach outperform its competitors in both qualitative and quantitative comparisons.

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

The influence of parenting style on academic achievement and career path.

Science.gov (United States)

Zahed Zahedani, Zahra; Rezaee, Rita; Yazdani, Zahra; Bagheri, Sina; Nabeiei, Parisa

2016-07-01

Several factors affect the academic performance of college students and parenting style is one significant factor. The current study has been done with the purpose of investigating the relationship between parenting styles, academic achievement and career path of students at Shiraz University of Medical Sciences. This is a correlation study carried out at Shiraz University of Medical Sciences. Among 1600 students, 310 students were selected randomly as the sample. Baumrind's Parenting Style and Moqimi's Career Path questionnaires were used and the obtained scores were correlated with the students' transcripts. To study the relation between variables Pearson correlation coefficient was used. There was a significant relationship between authoritarian parenting style and educational success (p=0.03). Also findings showed a significant relationship between firm parenting style and Career Path of the students, authoritarian parenting style and Career Path of the students, educational success and Career Path of the students (p=0.001). Parents have an important role in identifying children's talent and guiding them. Mutual understanding and close relationship between parents and children are recommended. Therefore, it is recommended that the methods of correct interaction of parents and children be more valued and parents familiarize their children with roles of businesses in society and the need for employment in legitimate businesses and this important affair should be more emphasized through mass media and family training classes.

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.

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.

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

International Nuclear Information System (INIS)

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

2010-01-01

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

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

Travel path and transport mode identification method using ''less-frequently-detected'' position data

International Nuclear Information System (INIS)

Shimizu, T; Yamaguchi, T; Ai, H; Katagiri, Y; Kawase, J

2014-01-01

This study aims to seek method on travel path and transport mode identification in case positions of travellers are detected in low frequency. The survey in which ten test travellers with GPS logger move around Tokyo city centre was conducted. Travel path datasets of each traveller in which position data are selected every five minutes are processed from our survey data. Coverage index analysis based on the buffer analysis using GIS software is conducted. The condition and possibility to identify a path and a transport mode used are discussed

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.

Design Change Model for Effective Scheduling Change Propagation Paths

Science.gov (United States)

Zhang, Hai-Zhu; Ding, Guo-Fu; Li, Rong; Qin, Sheng-Feng; Yan, Kai-Yin

2017-09-01

Changes in requirements may result in the increasing of product development project cost and lead time, therefore, it is important to understand how requirement changes propagate in the design of complex product systems and be able to select best options to guide design. Currently, a most approach for design change is lack of take the multi-disciplinary coupling relationships and the number of parameters into account integrally. A new design change model is presented to systematically analyze and search change propagation paths. Firstly, a PDS-Behavior-Structure-based design change model is established to describe requirement changes causing the design change propagation in behavior and structure domains. Secondly, a multi-disciplinary oriented behavior matrix is utilized to support change propagation analysis of complex product systems, and the interaction relationships of the matrix elements are used to obtain an initial set of change paths. Finally, a rough set-based propagation space reducing tool is developed to assist in narrowing change propagation paths by computing the importance of the design change parameters. The proposed new design change model and its associated tools have been demonstrated by the scheduling change propagation paths of high speed train's bogie to show its feasibility and effectiveness. This model is not only supportive to response quickly to diversified market requirements, but also helpful to satisfy customer requirements and reduce product development lead time. The proposed new design change model can be applied in a wide range of engineering systems design with improved efficiency.

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

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.

Dynamic path planning for autonomous driving on various roads with avoidance of static and moving obstacles

Science.gov (United States)

Hu, Xuemin; Chen, Long; Tang, Bo; Cao, Dongpu; He, Haibo

2018-02-01

This paper presents a real-time dynamic path planning method for autonomous driving that avoids both static and moving obstacles. The proposed path planning method determines not only an optimal path, but also the appropriate acceleration and speed for a vehicle. In this method, we first construct a center line from a set of predefined waypoints, which are usually obtained from a lane-level map. A series of path candidates are generated by the arc length and offset to the center line in the s - ρ coordinate system. Then, all of these candidates are converted into Cartesian coordinates. The optimal path is selected considering the total cost of static safety, comfortability, and dynamic safety; meanwhile, the appropriate acceleration and speed for the optimal path are also identified. Various types of roads, including single-lane roads and multi-lane roads with static and moving obstacles, are designed to test the proposed method. The simulation results demonstrate the effectiveness of the proposed method, and indicate its wide practical application to autonomous driving.

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

The influence of parenting style on academic achievement and career path

Directory of Open Access Journals (Sweden)

ZAHRA ZAHED ZAHEDANI

2016-07-01

Full Text Available Introduction: Several factors affect the academic performance of college students and parenting style is one significant factor. The current study has been done with the purpose of investigating the relationship between parenting styles, academic achievement and career path of students at Shiraz University of Medical Sciences. Methods: This is a correlation study carried out at Shiraz University of Medical Sciences. Among 1600 students, 310 students were selected randomly as the sample. Baumrind’s Parenting Style and Moqimi’s Career Path questionnaires were used and the obtained scores were correlated with the students’ transcripts. To study the relation between variables Pearson correlation coefficient was used. Results: There was a significant relationship between authoritarian parenting style and educational success (p=0.03. Also findings showed a significant relationship between firm parenting style and Career Path of the students, authoritarian parenting style and Career Path of the students, educational success and Career Path of the students (p=0.001. Conclusion: Parents have an important role in identifying children’s talent and guiding them. Mutual understanding and close relationship between parents and children are recommended. Therefore, it is recommended that the methods of correct interaction of parents and children be more valued and parents familiarize their children with roles of businesses in society and the need for employment in legitimate businesses and this important affair should be more emphasized through mass media and family training classes.

The influence of parenting style on academic achievement and career path

Science.gov (United States)

ZAHED ZAHEDANI, ZAHRA; REZAEE, RITA; YAZDANI, ZAHRA; BAGHERI, SINA; NABEIEI, PARISA

2016-01-01

Introduction Several factors affect the academic performance of college students and parenting style is one significant factor. The current study has been done with the purpose of investigating the relationship between parenting styles, academic achievement and career path of students at Shiraz University of Medical Sciences.     Methods This is a correlation study carried out at Shiraz University of Medical Sciences. Among 1600 students, 310 students were selected randomly as the sample. Baumrind’s Parenting Style and Moqimi’s Career Path questionnaires were used and the obtained scores were correlated with the students' transcripts. To study the relation between variables Pearson correlation coefficient was used. Results There was a significant relationship between authoritarian parenting style and educational success (p=0.03). Also findings showed a significant relationship between firm parenting style and Career Path of the students, authoritarian parenting style and Career Path of the students, educational success and Career Path of the students (p=0.001). Conclusion Parents have an important role in identifying children’s talent and guiding them. Mutual understanding and close relationship between parents and children are recommended. Therefore, it is recommended that the methods of correct interaction of parents and children be more valued and parents familiarize their children with roles of businesses in society and the need for employment in legitimate businesses and this important affair should be more emphasized through mass media and family training classes. PMID:27382580

Comparison among manual instruments and PathFile and Mtwo rotary instruments to create a glide path in the root canal preparation of curved canals.

Science.gov (United States)

Alves, Vanessa de Oliveira; Bueno, Carlos Eduardo da Silveira; Cunha, Rodrigo Sanches; Pinheiro, Sérgio Luiz; Fontana, Carlos Eduardo; de Martin, Alexandre Sigrist

2012-01-01

Nickel-titanium rotary instruments reduce procedural errors and the time required to finish root canal preparation. The goal of this study was to evaluate the occurrences of apical transportation and canal aberrations produced with different instruments used to create a glide path in the preparation of curved root canals, namely manual K-files (Dentsply Maillefer, Ballaigues, Switzerland) and PathFile (Dentsply Maillefer) and Mtwo (Sweden and Martina, Padua, Italy) nickel-titanium rotary files. The mesial canals of 45 mandibular first and second molars (with curvature angles between 25° and 35°) were selected for this study. The specimens were divided randomly into 3 groups with 15 canals each, and canal preparation was performed by an endodontist using #10-15-20 K-type stainless steel manual files (group M), #13-16-19 PathFile rotary instruments (group PF), and #10-15-20 Mtwo rotary instruments (group MT). The double digital radiograph technique was used, pre- and postinstrumentation, to assess whether apical transportation and/or aberration in root canal morphology occurred. The initial and final images of the central axis of the canals were compared by superimposition through computerized analysis and with the aid of magnification. The specimens were analyzed by 3 evaluators, whose calibration was checked using the Kendall agreement test. No apical transportation or aberration in root canal morphology occurred in any of the teeth; therefore, no statistical analysis was conducted. Neither the manual instruments nor the PathFile or Mtwo rotary instruments used to create a glide path had any influence on the occurrence of apical transportation or produced any canal aberration. Copyright © 2012 American Association of Endodontists. Published by Elsevier Inc. All rights reserved.

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.

Ontology-based concept map learning path reasoning system using SWRL rules

Energy Technology Data Exchange (ETDEWEB)

Chu, K.-K.; Lee, C.-I. [National Univ. of Tainan, Taiwan (China). Dept. of Computer Science and Information Learning Technology

2010-08-13

Concept maps are graphical representations of knowledge. Concept mapping may reduce students' cognitive load and extend simple memory function. The purpose of this study was on the diagnosis of students' concept map learning abilities and the provision of personally constructive advice dependant on their learning path and progress. Ontology is a useful method with which to represent and store concept map information. Semantic web rule language (SWRL) rules are easy to understand and to use as specific reasoning services. This paper discussed the selection of grade 7 lakes and rivers curriculum for which to devise a concept map learning path reasoning service. The paper defined a concept map e-learning ontology and two SWRL semantic rules, and collected users' concept map learning path data to infer implicit knowledge and to recommend the next learning path for users. It was concluded that the designs devised in this study were feasible and advanced and the ontology kept the domain knowledge preserved. SWRL rules identified an abstraction model for inferred properties. Since they were separate systems, they did not interfere with each other, while ontology or SWRL rules were maintained, ensuring persistent system extensibility and robustness. 15 refs., 1 tab., 8 figs.

Analysis of Known Linear Distributed Average Consensus Algorithms on Cycles and Paths

Directory of Open Access Journals (Sweden)

Jesús Gutiérrez-Gutiérrez

2018-03-01

Full Text Available In this paper, we compare six known linear distributed average consensus algorithms on a sensor network in terms of convergence time (and therefore, in terms of the number of transmissions required. The selected network topologies for the analysis (comparison are the cycle and the path. Specifically, in the present paper, we compute closed-form expressions for the convergence time of four known deterministic algorithms and closed-form bounds for the convergence time of two known randomized algorithms on cycles and paths. Moreover, we also compute a closed-form expression for the convergence time of the fastest deterministic algorithm considered on grids.

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.

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

International Nuclear Information System (INIS)

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

2014-01-01

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

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.

Genetic parameters and path analysis in cowpea genotypes grown in the Cerrado/Pantanal ecotone.

Science.gov (United States)

Lopes, K V; Teodoro, P E; Silva, F A; Silva, M T; Fernandes, R L; Rodrigues, T C; Faria, T C; Corrêa, A M

2017-05-18

Estimating genetic parameters in plant breeding allows us to know the population potential for selecting and designing strategies that can maximize the achievement of superior genotypes. The objective of this study was to evaluate the genetic potential of a population of 20 cowpea genotypes by estimating genetic parameters and path analysis among the traits to guide the selection strategies. The trial was conducted in randomized block design with four replications. Its morphophysiological components, components of green grain production and dry grain yield were estimated from genetic use and correlations between the traits. Phenotypic correlations were deployed through path analysis into direct and indirect effects of morphophysiological traits and yield components on dry grain yield. There were significant differences (P < 0.01) between the genotypes for most the traits, indicating the presence of genetic variability in the population and the possibility of practicing selection. The population presents the potential for future genetic breeding studies and is highly promising for the selection of traits dry grain yield, the number of grains per pod, and hundred grains mass. A number of grains per green pod is the main determinant trait of dry grain yield that is also influenced by the cultivar cycle and that the selection for the dry grain yield can be made indirectly by selecting the green pod mass and green pod length.

Correlation, path analysis and heritability estimation for agronomic traits contribute to yield on soybean

Science.gov (United States)

Sulistyo, A.; Purwantoro; Sari, K. P.

2018-01-01

Selection is a routine activity in plant breeding programs that must be done by plant breeders in obtaining superior plant genotypes. The use of appropriate selection criteria will determine the effectiveness of selection activities. The purpose of this study was to analysis the inheritable agronomic traits that contribute to soybean yield. A total of 91 soybean lines were planted in Muneng Experimental Station, Probolinggo District, East Java Province, Indonesia in 2016. All soybean lines were arranged in randomized complete block design with two replicates. Correlation analysis, path analysis and heritability estimation were performed on days to flowering, days to maturing, plant height, number of branches, number of fertile nodes, number of filled pods, weight of 100 seeds, and yield to determine selection criteria on soybean breeding program. The results showed that the heritability value of almost all agronomic traits observed is high except for the number of fertile nodes with low heritability. The result of correlation analysis shows that days to flowering, plant height and number of fertile nodes have positive correlation with seed yield per plot (0.056, 0.444, and 0.100, respectively). In addition, path analysis showed that plant height and number of fertile nodes have highest positive direct effect on soybean yield. Based on this result, plant height can be selected as one of selection criteria in soybean breeding program to obtain high yielding soybean variety.

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

Efficient growth of complex graph states via imperfect path erasure

International Nuclear Information System (INIS)

Campbell, Earl T; Fitzsimons, Joseph; Benjamin, Simon C; Kok, Pieter

2007-01-01

Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: path erasure techniques allow one to entangle multiple qubits by determining only global properties of the qubits. Here, this powerful approach is extended by demonstrating that even imperfect path erasure can produce the required graph states with high efficiency. By characterizing the degree of error in each path erasure attempt, one can subsume the resulting imperfect entanglement into an extended graph state formalism. The subsequent growth of the improper graph state can be guided, through a series of strategic decisions, in such a way as to bound the growth of the error and eventually yield a high-fidelity graph state. As an implementation of these techniques, we develop an analytic model for atom (or atom-like) qubits in mismatched cavities, under the double-heralding entanglement procedure of Barrett and Kok (2005 Phys. Rev. A 71 060310). Compared to straightforward post-selection techniques our protocol offers a dramatic improvement in growing complex high-fidelity graph states

ITS Multi-path Communications Access Decision Scheme

Directory of Open Access Journals (Sweden)

Miroslav Svitek

2008-02-01

Full Text Available Intelligent Transport Systems (ITS require widely spread and guarantied quality communications services. Method of ITS decomposition to set of subsystems and quantification of communications subsystems parameters is introduced. Due to typical complexity of the IST solution and mobility as the typical system elements property idea of communications systems with multipath multivendor structures is adopted. Resolution of seamless switching within a set of available wireless access solutions is presented. CALM based system or specifically designed and configured L3/L2 switching can be relevant solution for multi-path access communication system. These systems meet requirements of the seamless secure communications functionality within even extensive cluster of moving objects. Competent decision processes based on precisely quantified system requirements and each performance indicator tolerance range must be implemented to keep service up and running with no influence of continuously changing conditions in time and served space. Method of different paths service quality evaluation and selection of the best possible active communications access path is introduced. Proposed approach is based on Kalman filtering, which separates reasonable part of noise and also allows prediction of the individual parameters near future behavior. Presented classification algorithm applied on filtered measured data combined with deterministic parameters is trained using training data, i.e. combination of parameters vectors line and relevant decisions. Quality of classification is dependent on the size and quality of the training sets. This method is studied within projects e-Ident, DOTEK and SRATVU which are elaborating results of project CAMNA.

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

Directory of Open Access Journals (Sweden)

Wan-Yu Liu

2014-07-01

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

Reorientation simplified: A device for recording and reproducing the path of insertion for removable partial dentures

Directory of Open Access Journals (Sweden)

Vaibhav D Kamble

2014-01-01

Full Text Available Aim: The record of path of insertion on the dental cast is part of the dentist′s work authorization to the dental laboratory technician. The path of insertion record enables the dental technician to replace the cast on a surveyor in the same position that the dentist selected. Analysis of factors that influence the path of insertion should determine a path of insertion that will reduce the potential for dislodgement and promote stability of removable partial denture (RPD. Materials and Methods: The recording of the relation of a cast to a dental surveyor and the transfer of this relationship to the dental laboratory may be done by tripodization, by scoring the base of the cast, or by cementing a reference pin on the cast. Conclusion: Recording the established path of insertion can be difficult when the procedure uses a cemented pin and the casts are mounted in an articulator. This article describes a procedure for innovative dowel pin and sleeve device to record the path of insertion of RPDs, which serves the same purpose as the cemented pin but can be easily removed and replaced.

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.

Towards heterogeneous robot team path planning: acquisition of multiple routes with a modified spline-based algorithm

Directory of Open Access Journals (Sweden)

Lavrenov Roman

2017-01-01

Full Text Available Our research focuses on operation of a heterogeneous robotic group that carries out point-to point navigation in GPS-denied dynamic environment, applying a combined local and global planning approach. In this paper, we introduce a homotopy-based high-level planner, which uses a modified splinebased path-planning algorithm. The algorithm utilizes Voronoi graph for global planning and a set of optimization criteria for local improvements of selected paths. The simulation was implemented in Matlab environment.

Transformation Paths from Cubic to Low-Symmetry Structures in Heusler Ni2MnGa Compound.

Science.gov (United States)

Zelený, Martin; Straka, Ladislav; Sozinov, Alexei; Heczko, Oleg

2018-05-08

In order to explain the formation of low-temperature phases in stoichiometric Ni 2 MnGa magnetic shape memory alloy, we investigate the phase transformation paths from cubic austenite with Heusler structure to low-symmetry martensitic structures. We used ab initio calculations combined with the generalized solid state nudged elastic band method to determine the minimum energy path and corresponding changes in crystal lattice. The four-, five-, and seven-layered modulated phases of martensite (4O, 10M, and 14M) are built as the relaxed nanotwinned non-modulated (NM) phase. Despite having a total energy larger than the other martensitic phases, the 10M phase will spontaneously form at 0 K, because there is no energy barrier on the path and the energy decreases with a large negative slope. Moreover, a similar negative slope in the beginning of path is found also for the transformation to the 6M premartensite, which appears as a local minimum on the path leading further to 10M martensite. Transformation paths to other structures exhibit more or less significant barriers in the beginning hindering such a transformation from austenite. These findings correspond to experiment and demonstrates that the kinetics of the transformation is decisive for the selection of the particular low-symmetry structure.

Chronic Fluoxetine Induces the Enlargement of Perforant Path-Granule Cell Synapses in the Mouse Dentate Gyrus

Science.gov (United States)

Kitahara, Yosuke; Ohta, Keisuke; Hasuo, Hiroshi; Shuto, Takahide; Kuroiwa, Mahomi; Sotogaku, Naoki; Togo, Akinobu; Nakamura, Kei-ichiro; Nishi, Akinori

2016-01-01

A selective serotonin reuptake inhibitor is the most commonly prescribed antidepressant for the treatment of major depression. However, the mechanisms underlying the actions of selective serotonin reuptake inhibitors are not fully understood. In the dentate gyrus, chronic fluoxetine treatment induces increased excitability of mature granule cells (GCs) as well as neurogenesis. The major input to the dentate gyrus is the perforant path axons (boutons) from the entorhinal cortex (layer II). Through voltage-sensitive dye imaging, we found that the excitatory neurotransmission of the perforant path synapse onto the GCs in the middle molecular layer of the mouse dentate gyrus (perforant path-GC synapse) is enhanced after chronic fluoxetine treatment (15 mg/kg/day, 14 days). Therefore, we further examined whether chronic fluoxetine treatment affects the morphology of the perforant path-GC synapse, using FIB/SEM (focused ion beam/scanning electron microscopy). A three-dimensional reconstruction of dendritic spines revealed the appearance of extremely large-sized spines after chronic fluoxetine treatment. The large-sized spines had a postsynaptic density with a large volume. However, chronic fluoxetine treatment did not affect spine density. The presynaptic boutons that were in contact with the large-sized spines were large in volume, and the volumes of the mitochondria and synaptic vesicles inside the boutons were correlated with the size of the boutons. Thus, the large-sized perforant path-GC synapse induced by chronic fluoxetine treatment contains synaptic components that correlate with the synapse size and that may be involved in enhanced glutamatergic neurotransmission. PMID:26788851

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.

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

Science.gov (United States)

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

2018-03-01

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

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

Energy Technology Data Exchange (ETDEWEB)

WEST LD

2011-01-13

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&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{sup 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% ({approx}8,000 m{sup 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.

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

An area-efficient path memory structure for VLSI Implementation of high speed Viterbi decoders

DEFF Research Database (Denmark)

Paaske, Erik; Pedersen, Steen; Sparsø, Jens

1991-01-01

Path storage and selection methods for Viterbi decoders are investigated with special emphasis on VLSI implementations. Two well-known algorithms, the register exchange, algorithm, REA, and the trace back algorithm, TBA, are considered. The REA requires the smallest number of storage elements...

Prograph Based Analysis of Single Source Shortest Path Problem with Few Distinct Positive Lengths

Directory of Open Access Journals (Sweden)

B. Bhowmik

2011-08-01

Full Text Available In this paper we propose an experimental study model S3P2 of a fast fully dynamic programming algorithm design technique in finite directed graphs with few distinct nonnegative real edge weights. The Bellman-Ford’s approach for shortest path problems has come out in various implementations. In this paper the approach once again is re-investigated with adjacency matrix selection in associate least running time. The model tests proposed algorithm against arbitrarily but positive valued weighted digraphs introducing notion of Prograph that speeds up finding the shortest path over previous implementations. Our experiments have established abstract results with the intention that the proposed algorithm can consistently dominate other existing algorithms for Single Source Shortest Path Problems. A comparison study is also shown among Dijkstra’s algorithm, Bellman-Ford algorithm, and our algorithm.

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$

Calculation of beam paths in optical systems containing inhomogeneous isotropic media with cylindrical distribution of the refractive index

International Nuclear Information System (INIS)

Grammatin, A.P.; Degen, A.B.; Katranova, N.A.

1995-01-01

A system of differential equations convenient for numerical computer integrating is proposed to calculate beam paths, elementary astigmatic beams, and the optical path in isotropic media with cylindrical distribution of the refractive index. A method for selecting the step of this integration is proposed. This technique is implemented in the program package for computers of the VAX series meant for the computer-aided design of optical systems. 4 refs

Comparison of some evolutionary algorithms for optimization of the path synthesis problem

Science.gov (United States)

Grabski, Jakub Krzysztof; Walczak, Tomasz; Buśkiewicz, Jacek; Michałowska, Martyna

2018-01-01

The paper presents comparison of the results obtained in a mechanism synthesis by means of some selected evolutionary algorithms. The optimization problem considered in the paper as an example is the dimensional synthesis of the path generating four-bar mechanism. In order to solve this problem, three different artificial intelligence algorithms are employed in this study.

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

Unstable decay and state selection

International Nuclear Information System (INIS)

McKane, Alan; Tarlie, Martin

2001-01-01

The decay of unstable states when several metastable states are available for occupation is investigated using path-integral techniques. Specifically, a method is described that enables the probabilities with which the metastable states are occupied to be calculated by finding optimal paths, and fluctuations about them, in the weak-noise limit. The method is illustrated on a system described by two coupled Langevin equations, which are found in the study of instabilities in fluid dynamics and superconductivity. The problem involves a subtle interplay between nonlinearities and noise, and a naive approximation scheme that does not take this into account is shown to be unsatisfactory. The use of optimal paths is briefly reviewed and then applied to finding the conditional probability of ending up in one of the metastable states, having begun in the unstable state. There are several aspects of the calculation that distinguish it from most others involving optimal paths: (i) the paths do not begin and end on an attractor, and moreover, the final point is to a large extent arbitrary, (ii) the interplay between the fluctuations and the leading-order contribution are at the heart of the method, and (iii) the final result involves quantities that are not exponentially small in the noise strength. This final result, which gives the probability of a particular state being selected in terms of the parameters of the dynamics, is remarkably simple and agrees well with the results of numerical simulations. The method should be applicable to similar problems in a number of other areas, such as state selection in lasers, activationless chemical reactions, and population dynamics in fluctuating environments

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

Directory of Open Access Journals (Sweden)

Hyunhun Cho

2015-05-01

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

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

Interference factors regarding the path of insertion of rotational-path removable partial dentures.

Science.gov (United States)

Huang, Chan-Te; Liu, Fang-Chun; Luk, Kwing-Chi

2017-02-01

The aims of this study were to evaluate the effect of the location of the rotational center and the morphology of teeth resulting in interference with the rotational path of insertion and to estimate when an interference test should be performed. A total of 400 dental radiograms of maxillary and mandibular first and second molars (100 for each position) were selected. The radiograms were used to hand-sketch the outlines on tracing paper. Then, an interference test was simulated using calipers. Mesial long occlusal rest seats with three different lengths were designed. A curve-simulated rotational path was drawn on the tracing paper showing the outline of a molar. If the curve was intersected by the mesial outline, interference was occurred. A total of 1200 tests were performed. A significant number of interference cases (18.5%, N = 400) occurred when the rotational center was placed at the most distal margin of the occlusal surface. The interference was reduced (2.75%, N = 400) but still present at the distal fourth of the occlusal surface. At the distal one-third of the occlusal surface, interference did not occur (0%, N = 400). There was a significant difference between the results of the three rotational centers (p < 0.0001). The interference test was not required for a rotational center at the distal third to half of the occlusal surface. However, if the length of the long occlusal rest extends beyond the distal third, an interference test is recommended before final impression. Copyright © 2017 Chang Gung University. Published by Elsevier B.V. All rights reserved.

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

PATH1 self-teaching curriculum: example problems for Pathways-to-Man Model

International Nuclear Information System (INIS)

Helton, J.C.; Finley, N.C.

1982-10-01

The Pathways-to-Man Model was developed at Sandia National Laboratories to represent the environmental movement and human uptake of radionuclides. This model is implemented by the computer program PATH1. The purpose of this document is to present a sequence of examples of facilitate use of the model and the computer program which implements it. Each example consists of a brief description of the problem under consideration, a discussion of the data cards required to input the problem to PATH1, and the resultant program output. These examples are intended for use in conjunction with the technical report which describes the model and the computer progam which implements it (NUREG/CR-1636, Vol 1; SAND78-1711). In addition, a sequence of appendices provides the following: a description of a surface hydrologic system used in constructing several of the examples, a discussion of mixed-cell models, and a discussion of selected mathematical topics related to the Pathways Model. A copy of the program PATH1 is included with the report

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

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

Directory of Open Access Journals (Sweden)

P. Chitra

2017-04-01

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

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

Directory of Open Access Journals (Sweden)

D. W. T. Griffith

2018-03-01

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

Evaluation of selected mechanical properties of NiTi rotary glide path files manufactured from controlled memory wires.

Science.gov (United States)

Nishijo, Miki; Ebihara, Arata; Tokita, Daisuke; Doi, Hisashi; Hanawa, Takao; Okiji, Takashi

2018-03-28

This study aimed to investigate mechanical properties related to flexibility and fracture resistance of controlled memory wiremanufactured nickel-titanium rotary glide path files [HyFlex EDM Glide Path File (EDM) and HyFlex GPF (GPF)]. Scout RaCe (RaCe) served as control. Bending loads, torsional/cyclic fatigue resistance, and screw-in forces were measured. EDM showed a significantly larger torque at fracture, a longer time to cyclic fracture in reciprocation and a larger screw-in force compared with GPF and RaCe. GPF showed significantly lower bending loads and higher angular deflection values than EDM and RaCe, and a significantly longer time to cyclic fracture than RaCe. The time to cyclic fracture was significantly longer in reciprocation compared with continuous rotation in EDM and GPF. It can be concluded that EDM and/or GPF showed higher flexibility and cyclic/torsional fatigue resistance compared with RaCe; and that reciprocation conferred better cyclic fatigue resistance to EDM and GPF.

Analysis of switch and examine combining with post-examining selection in cognitive radio

Science.gov (United States)

Agarwal, Rupali; Srivastava, Neelam; Katiyar, Himanshu

2018-06-01

To perform spectrum sensing in fading environment is one of the most challenging tasks for a CR system. Diversity combining schemes are used to combat the effect of fading and hence detection probability of CR gets improved. Among many diversity combining techniques, switched diversity offers one of the lowest complexity solutions. The receiver embedded with switched diversity looks for an acceptable diversity path (having signal to noise ratio (SNR) above the required threshold) to receive the data. In conventional switch and examine combining (SEC) scheme, when no acceptable path is found after all the paths are examined, the receiver randomly chooses an unacceptable path. Switch and examine combining with post-examining selection (SECp) is a modified version of conventional SEC. In SECp, the conventional SEC scheme is altered in a way that it selects the best path when no acceptable path is found after all paths have been examined. In this paper, formula for probability of detection ( ?) is derived using SECp and SEC diversity combining technique over Rayleigh fading channel. Also the performance of SECp is compared with SEC and no diversity case. Performance comparison is done with the help of SNR vs. ? and complementary receiver operating characteristic curves.

Influence of a glide path on the dentinal crack formation of ProTaper Next system

Directory of Open Access Journals (Sweden)

Sevinç Aktemur Türker

2015-11-01

Full Text Available Objectives The aim was to evaluate dentinal crack formation after root canal preparation with ProTaper Next system (PTN with and without a glide path. Materials and Methods Forty-five mesial roots of mandibular first molars were selected. Fifteen teeth were left unprepared and served as controls. The experimental groups consist of mesiobuccal and mesiolingual root canals of remaining 30 teeth, which were divided into 2 groups (n = 15: Group PG/PTN, glide path was created with ProGlider (PG and then canals were shaped with PTN system; Group PTN, glide path was not prepared and canals were shaped with PTN system only. All roots were sectioned perpendicular to the long axis at 1, 2, 3, 4, 6, and 8 mm from the apex, and the sections were observed under a stereomicroscope. The presence/absence of cracks was recorded. Data were analyzed with chi-square tests with Yates correction. Results There were no significant differences in crack formation between the PTN with and without glide path preparation. The incidence of cracks observed in PG/PTN and PTN groups was 17.8% and 28.9%, respectively. Conclusions The creation of a glide path with ProGlider before ProTaper Next rotary system did not influence dentinal crack formation in root canals.

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

Poster abstract: Water level estimation in urban ultrasonic/passive infrared flash flood sensor networks using supervised learning

KAUST Repository

Mousa, Mustafa

2014-04-01

This article describes a machine learning approach to water level estimation in a dual ultrasonic/passive infrared urban flood sensor system. We first show that an ultrasonic rangefinder alone is unable to accurately measure the level of water on a road due to thermal effects. Using additional passive infrared sensors, we show that ground temperature and local sensor temperature measurements are sufficient to correct the rangefinder readings and improve the flood detection performance. Since floods occur very rarely, we use a supervised learning approach to estimate the correction to the ultrasonic rangefinder caused by temperature fluctuations. Preliminary data shows that water level can be estimated with an absolute error of less than 2 cm. © 2014 IEEE.

Optimal path planning for video-guided smart munitions via multitarget tracking

Science.gov (United States)

Borkowski, Jeffrey M.; Vasquez, Juan R.

2006-05-01

An advent in the development of smart munitions entails autonomously modifying target selection during flight in order to maximize the value of the target being destroyed. A unique guidance law can be constructed that exploits both attribute and kinematic data obtained from an onboard video sensor. An optimal path planning algorithm has been developed with the goals of obstacle avoidance and maximizing the value of the target impacted by the munition. Target identification and classification provides a basis for target value which is used in conjunction with multi-target tracks to determine an optimal waypoint for the munition. A dynamically feasible trajectory is computed to provide constraints on the waypoint selection. Results demonstrate the ability of the autonomous system to avoid moving obstacles and revise target selection in flight.

Identifying influential spreaders in complex networks through local effective spreading paths

Science.gov (United States)

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

2017-05-01

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

Kinetic Constrained Optimization of the Golf Swing Hub Path

Directory of Open Access Journals (Sweden)

Steven M. Nesbit

2014-12-01

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

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

Evolutionistic or revolutionary paths? A PACS maturity model for strategic situational planning.

Science.gov (United States)

van de Wetering, Rogier; Batenburg, Ronald; Lederman, Reeva

2010-07-01

While many hospitals are re-evaluating their current Picture Archiving and Communication System (PACS), few have a mature strategy for PACS deployment. Furthermore, strategies for implementation, strategic and situational planning methods for the evolution of PACS maturity are scarce in the scientific literature. Consequently, in this paper we propose a strategic planning method for PACS deployment. This method builds upon a PACS maturity model (PMM), based on the elaboration of the strategic alignment concept and the maturity growth path concept previously developed in the PACS domain. First, we review the literature on strategic planning for information systems and information technology and PACS maturity. Secondly, the PMM is extended by applying four different strategic perspectives of the Strategic Alignment Framework whereupon two types of growth paths (evolutionistic and revolutionary) are applied that focus on a roadmap for PMM. This roadmap builds a path to get from one level of maturity and evolve to the next. An extended method for PACS strategic planning is developed. This method defines eight distinctive strategies for PACS strategic situational planning that allow decision-makers in hospitals to decide which approach best suits their hospitals' current situation and future ambition and what in principle is needed to evolve through the different maturity levels. The proposed method allows hospitals to strategically plan for PACS maturation. It is situational in that the required investments and activities depend on the alignment between the hospital strategy and the selected growth path. The inclusion of both strategic alignment and maturity growth path concepts make the planning method rigorous, and provide a framework for further empirical research and clinical practice.

The influence of parenting style on academic achievement and career path

OpenAIRE

ZAHRA ZAHED ZAHEDANI; RITA REZAEE; ZAHRA YAZDANI; SINA BAGHERI; PARISA NABEIEI

2016-01-01

Introduction Several factors affect the academic performance of college students and parenting style is one significant factor. The current study has been done with the purpose of investigating the relationship between parenting styles, academic achievement and career path of students at Shiraz University of Medical Sciences.???? Methods This is a correlation study carried out at Shiraz University of Medical Sciences. Among 1600 students, 310 students were selected randomly as the sample. Bau...

Choosing the Right Path: Image Schema Theory as a Foundation for Concept Invention

Science.gov (United States)

Hedblom, Maria M.; Kutz, Oliver; Neuhaus, Fabian

2015-12-01

Image schemas are recognised as a fundamental ingredient in human cognition and creative thought. They have been studied extensively in areas such as cognitive linguistics. With the goal of exploring their potential role in computational creative systems, we here study the viability of the idea to formalise image schemas as a set of interlinked theories. We discuss in particular a selection of image schemas related to the notion of `path', and show how they can be mapped to a formalised family of microtheories reflecting the different aspects of path following. Finally, we illustrate the potential of this approach in the area of concept invention, namely by providing several examples illustrating in detail in what way formalised image schema families support the computational modelling of conceptual blending.

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

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

Directory of Open Access Journals (Sweden)

Liu Liu

2015-12-01

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

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.

Career path determinants of Eco-Tourism and Hospitality Management university graduates

Directory of Open Access Journals (Sweden)

Antoneta Njeri Kariru

2013-01-01

Full Text Available There has been an increase in the number of hospitality management university graduates working in non hospitality organizations in Kenya. Despite this, studies have not been undertaken to investigate the factors that influence these graduates’ career decisions. The purpose of this study was thus to investigate the career path determinants of Maseno University’s hospitality management graduates. The population of study was ecotourism, hotel and institution management graduates of Maseno University working within and outside the hospitality industry. 150 respondents, from the sampling frame consisting of students who graduated between the years 2005 and 2010, were selected through snowballing. Structured questionnaires were self-administered to the respondents. Frequencies, percentages, means, factor loadings and regressions were computed and presented using SPSS version 17. The study revealed that the graduates’ major career path determinants are unpredictable events, career satisfaction levels, chance and permanency of career.

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.

REML/BLUP and sequential path analysis in estimating genotypic values and interrelationships among simple maize grain yield-related traits.

Science.gov (United States)

Olivoto, T; Nardino, M; Carvalho, I R; Follmann, D N; Ferrari, M; Szareski, V J; de Pelegrin, A J; de Souza, V Q

2017-03-22

Methodologies using restricted maximum likelihood/best linear unbiased prediction (REML/BLUP) in combination with sequential path analysis in maize are still limited in the literature. Therefore, the aims of this study were: i) to use REML/BLUP-based procedures in order to estimate variance components, genetic parameters, and genotypic values of simple maize hybrids, and ii) to fit stepwise regressions considering genotypic values to form a path diagram with multi-order predictors and minimum multicollinearity that explains the relationships of cause and effect among grain yield-related traits. Fifteen commercial simple maize hybrids were evaluated in multi-environment trials in a randomized complete block design with four replications. The environmental variance (78.80%) and genotype-vs-environment variance (20.83%) accounted for more than 99% of the phenotypic variance of grain yield, which difficult the direct selection of breeders for this trait. The sequential path analysis model allowed the selection of traits with high explanatory power and minimum multicollinearity, resulting in models with elevated fit (R 2 > 0.9 and ε analysis is effective in the evaluation of maize-breeding trials.

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.

Observation of Biological Tissues Using Common Path Optical Coherence Tomography with Gold Coated Conical Tip Lens Fiber

International Nuclear Information System (INIS)

Taguchi, K; Sugiyama, J; Totsuka, M; Imanaka, S

2012-01-01

In this paper, we proposed a high lateral resolution common-path Fourier domain optical coherence tomography(OCT) system with the use of a chemically etched single mode fiber. In our experiments, single mode optical fiber for 1310nm was used for preparing the tapered tips. Our system used a conical microlens that was chemically etched by selective chemical etching technique using an etching solution of buffered hydrofluoric acid (BHF). From experimental results, we verified that our proposed optical coherence tomography system could operate as a common-path Fourier domain OCT system and conical tip lens fiber was very useful for a high lateral resolution common-path Fourier domain OCT system. Furthermore, we could observe a surface of paramecium bursaria and symbiotic chlorella in the paramecium bursaria using gold coated conical-tip fiber in the water.

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

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

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.

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

PATH COEFFICIENT ANALYSIS G39×CIHERANG AND MENTIK WANGI×G39 RICE IN F4 GENERATION

Directory of Open Access Journals (Sweden)

Totok Agung D.H.

2014-02-01

Full Text Available Current research was conducted with the objectives to identify the utmost traits that may be beneficial for the higher productivity of the grains on high protein content genotypes lines by path coefficient. Path coefficient can define coefficient correlation directly and indirectly to gain information about nature relationship between yield component and protein content to grain yield. Research material consisted of 61 selected plants from G39×Ciherang and 66 selected plants from Mentik Wangi×G39 at F4 generation. Plants were planted in Banyumas in May 2011. Number of panicles per plant, panicle length, 1000 g of grain weight, percentage of filled grain per panicle, protein content, and grain yield were correlated by using Pearson correlation and were followed by path coefficient. Number of panicles per plant, panicle length, 1000 g of grain weight, percentage filled grain per panicle, and protein content were used as dependent variable, while grain yield was used as independent variable. The result showed that protein content in both populations was not correlated with all yield components. The numbers of panicles, followed by panicle length, had highest positive direct effect to yield. The number of panicle was a positive mediator variable to yield from another variable.

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)

Tuning of Lee Path Loss Model based on recent RF measurements in 400 MHZ conducted in Riyadh City, Saudi Arabia

International Nuclear Information System (INIS)

Alotaibi, Faihan D.; Ali, Adel A.

2008-01-01

In mobile radio systems, path loss models are necessary for proper planning, interference estimations, frequently assignments and cell parameters which are basic for network planning process as well as Location Based Services (LBS) techniques that are not based on GPS system. Empirical models are the most adjustable models that can be suited to different types of environments. In this paper, the Lee path loss model has been tuned using Least Square (LS) algorithm to fit measured data for TETRA system operating 400 MHz in Riyadh urban and suburbs. Consequently, Lee model's parameter (L0, y) are obtained for the targeted areas. The performance of the tuned Lee model is then compared to the three most widely used empirical path loss models: Hat, ITU-R and Cost 231 Walfisch-Ikegami non line-of-sight (CWI-NLOS) path loss models. The performance criterion selected for the comparison of various empirical path loss models are the Root Mean Square Error (RMSE) and goodness of fit (R2). The RMSE and R2between the actual and predicted data are calculated for various path loss models. It turned that the tuned Lee model outperforms the other empirical models. (author)

Arrangement for selectively irradiating webs

International Nuclear Information System (INIS)

Ihme, B.

1975-01-01

The arrangement for selectively irradiating a web includes a perforated band of a radiation impermeable substance which is guided in an endless path via a pair of guide rollers and has two juxtaposed runs in this path. A take-up roller conveys a web of material past one of the runs at a side thereof remote from the other run, the direction of movement of the web being other than parallel to that of the band and, preferably, normal thereto. An electron accelerator is provided at the far side of the run remote from the web and is effective for directing a radiation beam at the web through the perforations

Selective epidemic vaccination under the performant routing algorithms

Science.gov (United States)

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

2018-04-01

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

High throughput route selection in multi-rate wireless mesh networks

Institute of Scientific and Technical Information of China (English)

WEI Yi-fei; GUO Xiang-li; SONG Mei; SONG Jun-de

2008-01-01

Most existing Ad-hoc routing protocols use the shortest path algorithm with a hop count metric to select paths. It is appropriate in single-rate wireless networks, but has a tendency to select paths containing long-distance links that have low data rates and reduced reliability in multi-rate networks. This article introduces a high throughput routing algorithm utilizing the multi-rate capability and some mesh characteristics in wireless fidelity (WiFi) mesh networks. It uses the medium access control (MAC) transmission time as the routing metric, which is estimated by the information passed up from the physical layer. When the proposed algorithm is adopted, the Ad-hoc on-demand distance vector (AODV) routing can be improved as high throughput AODV (HT-AODV). Simulation results show that HT-AODV is capable of establishing a route that has high data-rate, short end-to-end delay and great network throughput.

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

Are in vivo selections on the path to extinction?

Science.gov (United States)

Berenguer, José; Mencía, Mario; Hidalgo, Aurelio

2017-01-01

Droplet microfluidics will become a disruptive technology in the field of library screening and replace biological selections if the central dogma of biology and other processes are successfully implemented within microdroplets. © 2017 The Authors. Microbial Biotechnology published by John Wiley & Sons Ltd and Society for Applied Microbiology.

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

Task Assignment and Path Planning for Multiple Autonomous Underwater Vehicles Using 3D Dubins Curves †.

Science.gov (United States)

Cai, Wenyu; Zhang, Meiyan; Zheng, Yahong Rosa

2017-07-11

This paper investigates the task assignment and path planning problem for multiple AUVs in three dimensional (3D) underwater wireless sensor networks where nonholonomic motion constraints of underwater AUVs in 3D space are considered. The multi-target task assignment and path planning problem is modeled by the Multiple Traveling Sales Person (MTSP) problem and the Genetic Algorithm (GA) is used to solve the MTSP problem with Euclidean distance as the cost function and the Tour Hop Balance (THB) or Tour Length Balance (TLB) constraints as the stop criterion. The resulting tour sequences are mapped to 2D Dubins curves in the X - Y plane, and then interpolated linearly to obtain the Z coordinates. We demonstrate that the linear interpolation fails to achieve G 1 continuity in the 3D Dubins path for multiple targets. Therefore, the interpolated 3D Dubins curves are checked against the AUV dynamics constraint and the ones satisfying the constraint are accepted to finalize the 3D Dubins curve selection. Simulation results demonstrate that the integration of the 3D Dubins curve with the MTSP model is successful and effective for solving the 3D target assignment and path planning problem.

In-training factors predictive of choosing and sustaining a productive academic career path in neurological surgery.

Science.gov (United States)

Crowley, R Webster; Asthagiri, Ashok R; Starke, Robert M; Zusman, Edie E; Chiocca, E Antonio; Lonser, Russell R

2012-04-01

Factors during neurosurgical residency that are predictive of an academic career path and promotion have not been defined. To determine factors associated with selecting and sustaining an academic career in neurosurgery by analyzing in-training factors for all graduates of American College of Graduate Medical Education (ACGME)-accredited programs between 1985 and 1990. Neurological surgery residency graduates (between 1985 and 1990) from ACGME-approved training programs were analyzed to determine factors associated with choosing an academic career path and having academic success. Information was available for 717 of the 720 (99%) neurological surgery resident training graduates (678 male, 39 female). One hundred thirty-eight graduates (19.3%) held full-time academic positions. One hundred seven (14.9%) were professors and 35 (4.9%) were department chairs/chiefs. An academic career path/success was associated with more total (5.1 vs 1.9; P female trainees (2.6 vs 0.9 publications; P career but not predictive of becoming professor or chair/chief (P > .05). Defined in-training factors including number of total publications, number of first-author publications, and program size are predictive of residents choosing and succeeding in an academic career path.

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)

Mathematic Model of Technical Process of Heavy Mixtures Classifying on the Basis of Dispersion of Particles Flight Path

OpenAIRE

Normahmad Ravshanov; Bozorboy Palvanov; Gulnora Shermatova

2014-01-01

The article presents mathematic model and results of computer calculations of heavy mixtures classifying and farm crops full seeds selection. They enable to determine major process parameters and variation range, providing maximum dispersion of particles flight path, depending on feedstock modules.

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.

Nanosatellite Maneuver Planning for Point Cloud Generation With a Rangefinder

Science.gov (United States)

2015-06-05

may drive large eccentricity changes or pull the chaser too far away from its target. Limitations on waypoint selection are considered below. B...the local horizontal (RAAN ∼0◦) will have high relative orbit eccentricities and consequently result in increased propellant consumption. The...obtain an edge metric score below 0.3. Coverage time is capped at 36 h. It is assumed that the chaser employs reaction wheels as the actuators of the

Research on atmospheric CO2 remote sensing with open-path tunable diode laser absorption spectroscopy and comparison methods

Science.gov (United States)

Xin, Fengxin; Guo, Jinjia; Sun, Jiayun; Li, Jie; Zhao, Chaofang; Liu, Zhishen

2017-06-01

An open-path atmospheric CO2 measurement system was built based on tunable diode laser absorption spectroscopy (TDLAS). The CO2 absorption line near 2 μm was selected, measuring the atmospheric CO2 with direct absorption spectroscopy and carrying on the comparative experiment with multipoint measuring instruments of the open-path. The detection limit of the TDLAS system is 1.94×10-6. The calibration experiment of three AZ-7752 handheld CO2 measuring instruments was carried out with the Los Gatos Research gas analyzer. The consistency of the results was good, and the handheld instrument could be used in the TDLAS system after numerical calibration. With the contrast of three AZ-7752 and their averages, the correlation coefficients are 0.8828, 0.9004, 0.9079, and 0.9393 respectively, which shows that the open-path TDLAS has the best correlation with the average of three AZ-7752 and measures the concentration of atmospheric CO2 accurately. Multipoint measurement provides a convenient comparative method for open-path TDLAS.

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

Interim Evaluation of the Project P.A.T.H.S.: Findings Based on Different Datasets

Directory of Open Access Journals (Sweden)

Daniel T. L. Shek

2012-01-01

Full Text Available Interim evaluation studies were carried out in order to examine the implementation details of the Tier 1 Program of the Project P.A.T.H.S. (Positive Adolescent Training through Holistic Social Programmes in Hong Kong. Quantitative results of the interim evaluation findings based on eight datasets collected from 2006 to 2009 are reported in this paper. Three hundred and seventy-eight schools were randomly selected to provide information on the implementation details of the program via face-to-face interviews, telephone interviews, and self-completed questionnaires. Results showed that a majority of the workers perceived that the students had positive responses to the program and the program was helpful to the students. In conjunction with other process evaluation findings, the present study suggests that the implementation quality of the Tier 1 Program of the Project P.A.T.H.S. is high. The present study also provides support for the effectiveness of the Tier 1 Program of the Project P.A.T.H.S. in Hong Kong.

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

Critical incidents in headteachers’ professional paths

Directory of Open Access Journals (Sweden)

Jurema Silvia de Souza Alves

2015-11-01

Full Text Available School management is considered one of the greatest challenges in achieving quality standards in contemporary education. Understanding the path of its main protagonist, the manager, living in a time and context that is different from those in which he/she acts, is essential to guide continued career management as well as to re-advise the initial career of teachersand future managers. In order to contribute to this knowledge, we present the result of a biographical-narrative research project that seeks to identify the critical incidents present in the professional lives of school managers from a medium-sized municipality in São Paulo state, Brazil. The answers to a questionnaire made it possible to characterize 25 managers, 32 of which being from school units in the city, and to select nine for interview. The interviews, which were transcribed and organized into biograms, showed that these professionals, mostly women, unlike the men surveyed, did not direct their careers to a role in management. Most of the regular critical incidents on their professional paths refer to the influence of supervisors who recommended them or encouraged them to study for admission tests related to management; the birth of their children, which motivated them to progress in their careers and/or promoting a break for future investment; their initial training, for many the Faculty of Education, was considered by participants as being insufficient for a role in management. It is considered that the career in management must be intensified as a continued career and be revised/altered from its initial background, so that managing activities correspond to the objectives of a high quality education.

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.

Mathematic Model of Technical Process of Heavy Mixtures Classifying on the Basis of Dispersion of Particles Flight Path

Directory of Open Access Journals (Sweden)

Normahmad Ravshanov

2014-05-01

Full Text Available The article presents mathematic model and results of computer calculations of heavy mixtures classifying and farm crops full seeds selection. They enable to determine major process parameters and variation range, providing maximum dispersion of particles flight path, depending on feedstock modules.

Micro-CT evaluation of several glide path techniques and ProTaper Next shaping outcomes in maxillary first molar curved canals.

Science.gov (United States)

Alovisi, M; Cemenasco, A; Mancini, L; Paolino, D; Scotti, N; Bianchi, C C; Pasqualini, D

2017-04-01

To evaluate the ability of ProGlider instruments, PathFiles and K-files to maintain canal anatomy during glide path preparation using X-ray computed micro-tomography (micro-CT). Forty-five extracted maxillary first permanent molars were selected. Mesio-buccal canals were randomly assigned (n = 15) to manual K-file, PathFile or ProGlider groups for glide path preparation. Irrigation was achieved with 5% NaOCl and 10% EDTA. After glide path preparation, each canal was shaped with ProTaper Next X1 and X2 to working length. Specimens were scanned (isotropic voxel size 9.1 μm) for matching volumes and surface areas and post-treatment analyses. Canal volume, surface area, centroid shift, canal geometry variation through ratio of diameter ratios and ratio of cross-sectional areas were assessed in the apical and coronal levels and at the point of maximum canal curvature. One-way factorial anovas were used to evaluate the significance of instrument in the various canal regions. Post-glide path analysis revealed that instrument factor was significant at the apical level for both the ratio of diameter ratios and the ratio of cross-sectional areas (P flare the root canal compared with K-file and PathFile. PathFile and ProGlider demonstrated a significantly lower centroid shift compared with K-file at the apical level (P = 0.023). Post-shaping analysis demonstrated a more centred preparation of ProGlider, compared with PathFile and K-files, with no significant differences for other parameters. Use of ProGlider instruments led to less canal transportation than PathFiles and K-files. © 2016 International Endodontic Journal. Published by John Wiley & Sons Ltd.

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

Task Assignment and Path Planning for Multiple Autonomous Underwater Vehicles Using 3D Dubins Curves †

Directory of Open Access Journals (Sweden)

Wenyu Cai

2017-07-01

Full Text Available This paper investigates the task assignment and path planning problem for multiple AUVs in three dimensional (3D underwater wireless sensor networks where nonholonomic motion constraints of underwater AUVs in 3D space are considered. The multi-target task assignment and path planning problem is modeled by the Multiple Traveling Sales Person (MTSP problem and the Genetic Algorithm (GA is used to solve the MTSP problem with Euclidean distance as the cost function and the Tour Hop Balance (THB or Tour Length Balance (TLB constraints as the stop criterion. The resulting tour sequences are mapped to 2D Dubins curves in the X − Y plane, and then interpolated linearly to obtain the Z coordinates. We demonstrate that the linear interpolation fails to achieve G 1 continuity in the 3D Dubins path for multiple targets. Therefore, the interpolated 3D Dubins curves are checked against the AUV dynamics constraint and the ones satisfying the constraint are accepted to finalize the 3D Dubins curve selection. Simulation results demonstrate that the integration of the 3D Dubins curve with the MTSP model is successful and effective for solving the 3D target assignment and path planning problem.

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.

Optimized path planning for soft tissue resection via laser vaporization

Science.gov (United States)

Ross, Weston; Cornwell, Neil; Tucker, Matthew; Mann, Brian; Codd, Patrick

2018-02-01

Robotic and robotic-assisted surgeries are becoming more prevalent with the promise of improving surgical outcomes through increased precision, reduced operating times, and minimally invasive procedures. The handheld laser scalpel in neurosurgery has been shown to provide a more gentle approach to tissue manipulation on or near critical structures over classical tooling, though difficulties of control have prevented large scale adoption of the tool. This paper presents a novel approach to generating a cutting path for the volumetric resection of tissue using a computer-guided laser scalpel. A soft tissue ablation simulator is developed and used in conjunction with an optimization routine to select parameters which maximize the total resection of target tissue while minimizing the damage to surrounding tissue. The simulator predicts the ablative properties of tissue from an interrogation cut for tuning and simulates the removal of a tumorous tissue embedded on the surface of healthy tissue using a laser scalpel. We demonstrate the ability to control depth and smoothness of cut using genetic algorithms to optimize the ablation parameters and cutting path. The laser power level, cutting rate and spacing between cuts are optimized over multiple surface cuts to achieve the desired resection volumes.

Correlation and path coefficient analysis of quantitative characters in spine gourd (Momordica dioica Roxb.).

Science.gov (United States)

Aliya, F; Begum, H; Reddy, M T; Sivaraj, N; Pandravada, S R; Narshimulu, G

2014-05-01

Fifty genotypes of spine gourd (Momordica dioica Roxb.) were evaluated in a randomized block design with two replications at the Vegetable Research Station, Rajendranagar, Hyderabad, Andhra Pradesh, India during kharif, 2012. Correlation and path coefficient analysis were carried out to study the character association and contribution, respectively for twelve quantitative characters namely vine length (m), number of stems per plant, days to first female flower appearance, first female flowering node, days to first fruit harvest, days to last fruit harvest, fruiting period (days), fruit length (cm), fruit width (cm), fruit weight (g), number of fruits per plant and fruit yield per plant (kg) for identification of the potential selection indices. Correlation and path coefficient analyses revealed that fruiting period and number of fruits per plant not only had positively significant correlation with fruit yield but also had positively high direct effect on it and are regarded as the main determinants of fruit yield. Days to first fruit harvest had positively moderate direct effect on fruit yield and its association was negatively significant, days to last fruit harvest had negatively high direct effect on fruit yield and its association was significant positively, hence restricted simultaneous selection can be made for days to first fruit harvest and days to last fruit harvest. The improvement in fruit yield can be effective if selection is based on days to first fruit harvest, days to last fruit harvest, fruiting period and number of fruits per plant.

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.

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

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

Directory of Open Access Journals (Sweden)

J R Managbanag

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

The influence of the selection of macronutrients coupled with dietary energy density on the performance of broiler chickens.

Science.gov (United States)

Liu, Sonia Y; Chrystal, Peter V; Cowieson, Aaron J; Truong, Ha H; Moss, Amy F; Selle, Peter H

2017-01-01

A total of 360 male Ross 308 broiler chickens were used in a feeding study to assess the influence of macronutrients and energy density on feed intakes from 10 to 31 days post-hatch. The study comprised ten dietary treatments from five dietary combinations and two feeding approaches: sequential and choice feeding. The study included eight experimental diets and each dietary combination was made from three experimental diets. Choice fed birds selected between three diets in separate feed trays at the same time; whereas the three diets were offered to sequentially fed birds on an alternate basis during the experimental period. There were no differences between starch and protein intakes between choice and sequentially fed birds (P > 0.05) when broiler chickens selected between diets with different starch, protein and lipid concentrations. When broiler chickens selected between diets with different starch and protein but similar lipid concentrations, both sequentially and choice fed birds selected similar ratios of starch and protein intake (P > 0.05). However, when broiler chickens selected from diets with different protein and lipid but similar starch concentrations, choice fed birds had higher lipid intake (129 versus 118 g/bird, P = 0.027) and selected diets with lower protein concentrations (258 versus 281 g/kg, P = 0.042) than birds offered sequential diet options. Choice fed birds had greater intakes of the high energy diet (1471 g/bird, P macronutrients from 10-31 days in choice and sequential feeding groups were plotted and compared with the null path if broiler chickens selected equal amounts of the three diets in the combination. Regardless of feeding regimen, the intake paths of starch and protein are very close to the null path; however, lipid and protein intake paths in choice fed birds are father from the null path than sequentially fed birds.

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

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

An Improved Ant Colony Algorithm for Solving the Path Planning Problem of the Omnidirectional Mobile Vehicle

Directory of Open Access Journals (Sweden)

Jiang Zhao

2016-01-01

Full Text Available This paper presents an improved ant colony algorithm for the path planning of the omnidirectional mobile vehicle. The purpose of the improved ant colony algorithm is to design an appropriate route to connect the starting point and ending point of the environment with obstacles. Ant colony algorithm, which is used to solve the path planning problem, is improved according to the characteristics of the omnidirectional mobile vehicle. And in the improved algorithm, the nonuniform distribution of the initial pheromone and the selection strategy with direction play a very positive role in the path search. The coverage and updating strategy of pheromone is introduced to avoid repeated search reducing the effect of the number of ants on the performance of the algorithm. In addition, the pheromone evaporation coefficient is segmented and adjusted, which can effectively balance the convergence speed and search ability. Finally, this paper provides a theoretical basis for the improved ant colony algorithm by strict mathematical derivation, and some numerical simulations are also given to illustrate the effectiveness of the theoretical results.

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

Technique for selection of transient radiation-hard junction-isolated integrated circuits

International Nuclear Information System (INIS)

Crowley, J.L.; Junga, F.A.; Stultz, T.J.

1976-01-01

A technique is presented which demonstrates the feasibility of selecting junction-isolated integrated circuits (JI/ICS) for use in transient radiation environments. The procedure guarantees that all PNPN paths within the integrated circuit are identified and describes the methods used to determine whether the paths represent latchup susceptible structures. Two examples of the latchup analysis are given involving an SSI and an LSI bipolar junction-isolated integrated circuit

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.

Selective Europeanization

DEFF Research Database (Denmark)

Hoch Jovanovic, Tamara; Lynggaard, Kennet

2014-01-01

and rules. The article examines the reasons for both resistance and selectiveness to Europeanization of the Danish minority policy through a “path dependency” perspective accentuating decision makers’ reluctance to deviate from existing institutional commitments, even in subsequently significantly altered...... political contexts at the European level. We further show how the “translation” of international norms to a domestic context has worked to reinforce the original institutional setup, dating back to the mid-1950s. The translation of European-level minority policy developed in the 1990s and 2000s works most...

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

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

A path integral methodology for obtaining thermodynamic properties of nonadiabatic systems using Gaussian mixture distributions

Science.gov (United States)

Raymond, Neil; Iouchtchenko, Dmitri; Roy, Pierre-Nicholas; Nooijen, Marcel

2018-05-01

We introduce a new path integral Monte Carlo method for investigating nonadiabatic systems in thermal equilibrium and demonstrate an approach to reducing stochastic error. We derive a general path integral expression for the partition function in a product basis of continuous nuclear and discrete electronic degrees of freedom without the use of any mapping schemes. We separate our Hamiltonian into a harmonic portion and a coupling portion; the partition function can then be calculated as the product of a Monte Carlo estimator (of the coupling contribution to the partition function) and a normalization factor (that is evaluated analytically). A Gaussian mixture model is used to evaluate the Monte Carlo estimator in a computationally efficient manner. Using two model systems, we demonstrate our approach to reduce the stochastic error associated with the Monte Carlo estimator. We show that the selection of the harmonic oscillators comprising the sampling distribution directly affects the efficiency of the method. Our results demonstrate that our path integral Monte Carlo method's deviation from exact Trotter calculations is dominated by the choice of the sampling distribution. By improving the sampling distribution, we can drastically reduce the stochastic error leading to lower computational cost.

A biomimetic, energy-harvesting, obstacle-avoiding, path-planning algorithm for UAVs

Science.gov (United States)

Gudmundsson, Snorri

This dissertation presents two new approaches to energy harvesting for Unmanned Aerial Vehicles (UAV). One method is based on the Potential Flow Method (PFM); the other method seeds a wind-field map based on updraft peak analysis and then applies a variant of the Bellman-Ford algorithm to find the minimum-cost path. Both methods are enhanced by taking into account the performance characteristics of the aircraft using advanced performance theory. The combined approach yields five possible trajectories from which the one with the minimum energy cost is selected. The dissertation concludes by using the developed theory and modeling tools to simulate the flight paths of two small Unmanned Aerial Vehicles (sUAV) in the 500 kg and 250 kg class. The results show that, in mountainous regions, substantial energy can be recovered, depending on topography and wind characteristics. For the examples presented, as much as 50% of the energy was recovered for a complex, multi-heading, multi-altitude, 170 km mission in an average wind speed of 9 m/s. The algorithms constitute a Generic Intelligent Control Algorithm (GICA) for autonomous unmanned aerial vehicles that enables an extraction of atmospheric energy while completing a mission trajectory. At the same time, the algorithm. automatically adjusts the flight path in order to avoid obstacles, in a fashion not unlike what one would expect from living organisms, such as birds and insects. This multi-disciplinary approach renders the approach biomimetic, i.e. it constitutes a synthetic system that “mimics the formation and function of biological mechanisms and processes.”.

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

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

Directory of Open Access Journals (Sweden)

Fronita Mona

2018-01-01

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

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.

Occlusal contacting condition and masticatory function of 2 types of pattern that differ in the closing path of the mandibular incisal point during chewing.

Science.gov (United States)

Watanabe, Atsushi; Shiga, Hiroshi; Kobayashi, Yoshinori

2011-10-01

To clarify the difference in the state of occlusal contact and masticatory function between two patterns of masticatory movement path that differed in the closing path. Fifteen healthy subjects with Pattern I (a linear or concave opening path and a convex closing path) and Pattern II (similar opening path to that in Pattern I and a concave closing path) were selected. The state of occlusal contact on the working and balancing sides and the masticatory function (integral value of the masseter muscular activity, gape, masticatory width, cycle time, indicators representing the stability of the path and rhythm, and glucose extraction) were compared between the two patterns. The occlusal contact on the working side was about the same. For the balancing side, occlusal contact at the molar region was observed for Pattern II in most cases, whereas no occlusal contact was observed for Pattern I. The integral value of the masseter muscular activity and the glucose extraction were greater for Pattern I. The gape was not different between the two patterns. Pattern I had a wide masticatory width and a short cycle time. The values of the indicators representing the stability of the path and rhythm were smaller for Pattern I. It was suggested that Pattern I with a convex closing path had a functional difference and a superior masticatory function from Pattern II with a concave closing path, and the difference in the occlusal contact on the balancing side was related. Copyright © 2011 Japan Prosthodontic Society. Published by Elsevier Ltd. All rights reserved.

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

Competence-based multiple learning paths: on the road of implementation

Directory of Open Access Journals (Sweden)

María Dolores de Prada

2014-12-01

Full Text Available This article presents the results of an action-research implementation project based on a system that weaves together five different routes to facilitate the development of competences through the use of multiple learning paths for primary and secondary teachers. The first and initial results that the article deals with relate to the experience of math teachers for ages 11 to 14. Other levels and other fields are in the process of being developed. The article deals briefly with the justification, the background and the fundamental principles that underpin the research methodology and introduces a number of elements such as the method followed by the research, the resources and the materials used as well as the results obtained at the end of the second year of this experience. It also justifies the model chosen and the criteria and strategies selected for its reliability and verification. In addition, it provides significant elements of reflection about a number of burning issues: The development of a new profile of the “teacher” in a studentcentred system and the implementation system to be followed, the importance of multiple but integrated learning paths and the relevance as well as the reflection on real cases of competence evaluation.

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.

TEM Imaging of Mass-selected Polymer Molecules

International Nuclear Information System (INIS)

Nasibulin, Albert G.; Kauppinen, Esko I.; Thomson, Bruce A.; Fernandez de la Mora, J.

2002-01-01

Polyethylene glycol (PEG) molecules with masses below 1300 amu are electrosprayed (ES) from solution, mobility-selected at high resolution in a differential mobility analyzer (DMA), collected on a grid and imaged by transmission electron microscopy (ES-DMA-TEM). The DMA resolves individual n-mers, and selects only one out of the many present in the original sample. Ion identity is established from parallel mass spectra (ES-MS). The images reveal spherical particles 1.46 nm in diameter, in good agreement with the known ion mass and bulk density. The DMA-selection technique opens new paths for the study of very small particles

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

Analysis of terrain map matching using multisensing techniques for applications to autonomous vehicle navigation

Science.gov (United States)

Page, Lance; Shen, C. N.

1991-01-01

This paper describes skyline-based terrain matching, a new method for locating the vantage point of laser range-finding measurements on a global map previously prepared by satellite or aerial mapping. Skylines can be extracted from the range-finding measurements and modelled from the global map, and are represented in parametric, cylindrical form with azimuth angle as the independent variable. The three translational parameters of the vantage point are determined with a three-dimensional matching of these two sets of skylines.

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

Four new topological indices based on the molecular path code.

Science.gov (United States)

Balaban, Alexandru T; Beteringhe, Adrian; Constantinescu, Titus; Filip, Petru A; Ivanciuc, Ovidiu

2007-01-01

The sequence of all paths pi of lengths i = 1 to the maximum possible length in a hydrogen-depleted molecular graph (which sequence is also called the molecular path code) contains significant information on the molecular topology, and as such it is a reasonable choice to be selected as the basis of topological indices (TIs). Four new (or five partly new) TIs with progressively improved performance (judged by correctly reflecting branching, centricity, and cyclicity of graphs, ordering of alkanes, and low degeneracy) have been explored. (i) By summing the squares of all numbers in the sequence one obtains Sigmaipi(2), and by dividing this sum by one plus the cyclomatic number, a Quadratic TI is obtained: Q = Sigmaipi(2)/(mu+1). (ii) On summing the Square roots of all numbers in the sequence one obtains Sigmaipi(1/2), and by dividing this sum by one plus the cyclomatic number, the TI denoted by S is obtained: S = Sigmaipi(1/2)/(mu+1). (iii) On dividing terms in this sum by the corresponding topological distances, one obtains the Distance-reduced index D = Sigmai{pi(1/2)/[i(mu+1)]}. Two similar formulas define the next two indices, the first one with no square roots: (iv) distance-Attenuated index: A = Sigmai{pi/[i(mu + 1)]}; and (v) the last TI with two square roots: Path-count index: P = Sigmai{pi(1/2)/[i(1/2)(mu + 1)]}. These five TIs are compared for their degeneracy, ordering of alkanes, and performance in QSPR (for all alkanes with 3-12 carbon atoms and for all possible chemical cyclic or acyclic graphs with 4-6 carbon atoms) in correlations with six physical properties and one chemical property.

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.

Career Pathing among General Administrative and Support Services Employees Based on Holland?s Typology of Personality Theory and Personal Style Inventory

Science.gov (United States)

Mendoza, Catalino N.

2009-01-01

The study is about the prevailing differences, commonalities and significant contributions of the career pathing among the general administrative and support services employees based on Holland's Typology of Personality Theory and Personal Style Inventory of selected higher educational institutions in Metro Manila.

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

Solution path for manifold regularized semisupervised classification.

Science.gov (United States)

Wang, Gang; Wang, Fei; Chen, Tao; Yeung, Dit-Yan; Lochovsky, Frederick H

2012-04-01

Traditional learning algorithms use only labeled data for training. However, labeled examples are often difficult or time consuming to obtain since they require substantial human labeling efforts. On the other hand, unlabeled data are often relatively easy to collect. Semisupervised learning addresses this problem by using large quantities of unlabeled data with labeled data to build better learning algorithms. In this paper, we use the manifold regularization approach to formulate the semisupervised learning problem where a regularization framework which balances a tradeoff between loss and penalty is established. We investigate different implementations of the loss function and identify the methods which have the least computational expense. The regularization hyperparameter, which determines the balance between loss and penalty, is crucial to model selection. Accordingly, we derive an algorithm that can fit the entire path of solutions for every value of the hyperparameter. Its computational complexity after preprocessing is quadratic only in the number of labeled examples rather than the total number of labeled and unlabeled examples.

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

An adaptive dual-optimal path-planning technique for unmanned air vehicles with application to solar-regenerative high altitude long endurance flight

Science.gov (United States)

Whitfield, Clifford A.

2009-12-01

A multi-objective technique for Unmanned Air Vehicle (UAV) path and trajectory autonomy generation, through task allocation and sensor fusion has been developed. The Dual-Optimal Path-Planning (D-O.P-P.) Technique generates on-line adaptive flight paths for UAVs based on available flight windows and environmental influenced objectives. The environmental influenced optimal condition, known as the driver' determines the condition, within a downstream virtual window of possible vehicle destinations and orientation built from the UAV kinematics. The intermittent results are pursued by a dynamic optimization technique to determine the flight path. This sequential optimization technique is a multi-objective optimization procedure consisting of two goals, without requiring additional information to combine the conflicting objectives into a single-objective. An example case-study and additional applications are developed and the results are discussed; including the application to the field of Solar Regenerative (SR) High Altitude Long Endurance (HALE) UAV flight. Harnessing solar energy has recently been adapted for use on high altitude UAV platforms. An aircraft that uses solar panels and powered by the sun during the day and through the night by SR systems, in principle could sustain flight for weeks or months. The requirements and limitations of solar powered flight were determined. The SR-HALE UAV platform geometry and flight characteristics were selected from an existing aircraft that has demonstrated the capability for sustained flight through flight tests. The goals were to maintain continual Situational Awareness (SA) over a case-study selected Area of Interest (AOI) and existing UAV power and surveillance systems. This was done for still wind and constant wind conditions at altitude along with variations in latitude. The characteristics of solar flux and the dependence on the surface location and orientation were established along with fixed flight maneuvers for

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.

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.

Fast mapping of the local environment of an autonomous mobile robot

International Nuclear Information System (INIS)

Fanton, Herve

1989-01-01

The construction of a map of the local world for the navigation of an autonomous mobile robot leads to the following problem: how to extract among the sensor data information accurate an reliable enough to plan a path, in a way that enables a reasonable displacement speed. Choice has been made not to tele-operate the vehicle nor to design any custom architecture. So the only way to match the computational cost is to look for the most efficient sensor-algorithms-architecture combination. A good solution is described in this study, using a laser range-finder, a grid model of the world and both SIMD and MIMD parallel processors. A short review of some possible approaches is made first; the mapping algorithms are then described as also the parallel implementations with the corresponding speedup and efficiency factors. (author) [fr

Path E alloys: ferritic material development for magnetic fusion energy applications

International Nuclear Information System (INIS)

Holmes, J.J.

1980-09-01

The application of ferritic materials in irradiation environments has received greatly expanded attention in the last few years, both internationally and in the United States. Ferritic materials are found to be resistant to irradiation damage and have in many cases superior properties to those of AISI 316. It has been shown that for magnetic fusion energy applications the low thermal expansion behavior of the ferritic alloy class will result in lower thermal stresses during reactor operation, leading to significantly longer ETF operating lifetimes. The Magnetic Fusion Energy Program therefore now includes a ferritic alloy option for alloy selection and this option has been designated Path E

Laser ignition device and its application to forestry, fire and land management

International Nuclear Information System (INIS)

Waterworth, M.D.

1987-01-01

A laser ignition device for controlled burning of forest logging slash has been developed and successfully tested. The device, which uses a kilowatt class carbon dioxide laser, operates at distances of 50 to 1500 meters. Acquisition and focus control are achieved by the use of a laser rangefinder and acquisition telescope. Additional uses for the device include back burning, selected undergrowth removal, safe ignition of oil spills, and deicing. A truck mounted version will be operational by fall 1987 and an airborne version by summer 1988. (author)

Laser ignition device and its application to forestry, fire and land management

Energy Technology Data Exchange (ETDEWEB)

Waterworth, M. D.

1987-11-15

A laser ignition device for controlled burning of forest logging slash has been developed and successfully tested. The device, which uses a kilowatt class carbon dioxide laser, operates at distances of 50 to 1500 meters. Acquisition and focus control are achieved by the use of a laser rangefinder and acquisition telescope. Additional uses for the device include back burning, selected undergrowth removal, safe ignition of oil spills, and deicing. A truck mounted version will be operational by fall 1987 and an airborne version by summer 1988. (author)

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.

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

Directory of Open Access Journals (Sweden)

Ming-Chorng Hwang

2015-01-01

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

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.

Inter-rater reliability of PATH observations for assessment of ergonomic risk factors in hospital work.

Science.gov (United States)

Park, Jung-Keun; Boyer, Jon; Tessler, Jamie; Casey, Jeffrey; Schemm, Linda; Gore, Rebecca; Punnett, Laura

2009-07-01

This study examined the inter-rater reliability of expert observations of ergonomic risk factors by four analysts. Ten jobs were observed at a hospital using a newly expanded version of the PATH method (Buchholz et al. 1996), to which selected upper extremity exposures had been added. Two of the four raters simultaneously observed each worker onsite for a total of 443 observation pairs containing 18 categorical exposure items each. For most exposure items, kappa coefficients were 0.4 or higher. For some items, agreement was higher both for the jobs with less rapid hand activity and for the analysts with a higher level of ergonomic job analysis experience. These upper extremity exposures could be characterised reliably with real-time observation, given adequate experience and training of the observers. The revised version of PATH is applicable to the analysis of jobs where upper extremity musculoskeletal strain is of concern.

Local and Global Path Generation for Autonomous Vehicles Using SplinesGeneración Local y Global de Trayectorias para Vehículo Autónomos Usando Splines

Directory of Open Access Journals (Sweden)

Randerson Lemos

2016-05-01

Full Text Available Abstract Context: Before autonomous vehicles being a reality in daily situations, outstanding issues regarding the techniques of autonomous mobility must be solved. Hence, relevant aspects of a path planning for terrestrial vehicles are shown. Method: The approached path planning technique uses splines to generate the global route. For this goal, waypoints obtained from online map services are used. With the global route parametrized in the arc-length, candidate local paths are computed and the optimal one is selected by cost functions. Results: Different routes are used to show that the number and distribution of waypoints are highly correlated to a satisfactory arc-length parameterization of the global route, which is essential to the proper behavior of the path planning technique. Conclusions: The cubic splines approach to the path planning problem successfully generates the global and local paths. Nevertheless, the use of raw data from the online map services showed to be unfeasible due the consistency of the data. Hence, a preprocessing stage of the raw data is proposed to guarantee the well behavior and robustness of the technique.

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

Ophthalmic Care of the Combat Casualty

Science.gov (United States)

2003-01-01

Resulting From War IOFBs (%) IOFBs (%) IOFBs (%) WW2 (US Army)1 63.7 55.4 30.8 WW2 (British Army: Libyan campaign 1941–1943)2 75.3 — 25.4 Vietnam3 32.7...905.0 Near- infrared Nd:YAG Rangefinder, target designator 1,064.0 Near- infrared Carbon Dioxide Rangefinder 10,600.0 Far- infrared MILES: multiple...pulsed) mode at 1,064 nm ( infrared ). Although the technology is available to produce an- tipersonnel lasers, no use of such a laser has been documented

The influence of the selection of macronutrients coupled with dietary energy density on the performance of broiler chickens.

Directory of Open Access Journals (Sweden)

Sonia Y Liu

Full Text Available A total of 360 male Ross 308 broiler chickens were used in a feeding study to assess the influence of macronutrients and energy density on feed intakes from 10 to 31 days post-hatch. The study comprised ten dietary treatments from five dietary combinations and two feeding approaches: sequential and choice feeding. The study included eight experimental diets and each dietary combination was made from three experimental diets. Choice fed birds selected between three diets in separate feed trays at the same time; whereas the three diets were offered to sequentially fed birds on an alternate basis during the experimental period. There were no differences between starch and protein intakes between choice and sequentially fed birds (P > 0.05 when broiler chickens selected between diets with different starch, protein and lipid concentrations. When broiler chickens selected between diets with different starch and protein but similar lipid concentrations, both sequentially and choice fed birds selected similar ratios of starch and protein intake (P > 0.05. However, when broiler chickens selected from diets with different protein and lipid but similar starch concentrations, choice fed birds had higher lipid intake (129 versus 118 g/bird, P = 0.027 and selected diets with lower protein concentrations (258 versus 281 g/kg, P = 0.042 than birds offered sequential diet options. Choice fed birds had greater intakes of the high energy diet (1471 g/bird, P < 0.0001 than low energy (197 g/bird or medium energy diets (663 g/bird whilst broiler chickens were offered diets with different energy densities but high crude protein (300 g/kg or digestible lysine (17.5 g/kg concentrations. Choice fed birds had lower FCR (1.217 versus 1.327 g/g, P < 0.0001 and higher carcass yield (88.1 versus 87.3%, P = 0.012 than sequentially fed birds. This suggests that the dietary balance between protein and energy is essential for optimal feed conversion efficiency. The intake path

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.

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.

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

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

Science.gov (United States)

Hoomod, Haider K.; Kareem Jebur, Tuka

2018-05-01

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

Running shoes and running injuries: mythbusting and a proposal for two new paradigms: 'preferred movement path' and 'comfort filter'.

Science.gov (United States)

Nigg, B M; Baltich, J; Hoerzer, S; Enders, H

2015-10-01

In the past 100 years, running shoes experienced dramatic changes. The question then arises whether or not running shoes (or sport shoes in general) influence the frequency of running injuries at all. This paper addresses five aspects related to running injuries and shoe selection, including (1) the changes in running injuries over the past 40 years, (2) the relationship between sport shoes, sport inserts and running injuries, (3) previously researched mechanisms of injury related to footwear and two new paradigms for injury prevention including (4) the 'preferred movement path' and (5) the 'comfort filter'. Specifically, the data regarding the relationship between impact characteristics and ankle pronation to the risk of developing a running-related injury is reviewed. Based on the lack of conclusive evidence for these two variables, which were once thought to be the prime predictors of running injuries, two new paradigms are suggested to elucidate the association between footwear and injury. These two paradigms, 'the preferred movement path' and 'the comfort filter', suggest that a runner intuitively selects a comfortable product using their own comfort filter that allows them to remain in the preferred movement path. This may automatically reduce the injury risk and may explain why there does not seem to be a secular trend in running injury rates. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://group.bmj.com/group/rights-licensing/permissions.

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

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

Science.gov (United States)

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

2017-01-01

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

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

Ablation of selected conducting layers by fiber laser

Science.gov (United States)

Pawlak, Ryszard; Tomczyk, Mariusz; Walczak, Maria

2014-08-01

Laser Direct Writing (LDW) are used in the manufacture of electronic circuits, pads, and paths in sub millimeter scale. They can also be used in the sensors systems. Ablative laser writing in a thin functional layer of material deposited on the dielectric substrate is one of the LDW methods. Nowadays functional conductive layers are composed from graphene paint or nanosilver paint, indium tin oxide (ITO), AgHTTM and layers containing carbon nanotubes. Creating conducting structures in transparent layers (ITO, AgHT and carbon nanotubes layers) may have special importance e.g. for flexi electronics. The paper presents research on the fabrication of systems of paths and appropriate pattern systems of paths and selected electronic circuits in AgHTTM and ITO layers deposited on glass and polymer substrates. An influence of parameters of ablative fiber laser treatment in nanosecond regime as well as an influence of scanning mode of laser beam on the pattern fidelity and on electrical parameters of a generated circuit was investigated.

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.

Ultrasonic Ranging System With Increased Resolution

Science.gov (United States)

Meyer, William E.; Johnson, William G.

1987-01-01

Master-oscillator frequency increased. Ultrasonic range-measuring system with 0.1-in. resolution provides continuous digital display of four distance readings, each updated four times per second. Four rangefinder modules in system are modified versions of rangefinder used for automatic focusing in commercial series of cameras. Ultrasonic pulses emitted by system innocuous to both people and equipment. Provides economical solutions to such distance-measurement problems as posed by boats approaching docks, truck backing toward loading platform, runway-clearance readout for tail of airplane with high angle attack, or burglar alarm.

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)

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.

ARTICLE - Path analysis of iron and zinc contents and others traits in cowpea

Directory of Open Access Journals (Sweden)

Jeane de Oliveira Moura

2012-12-01

Full Text Available The objective of this study was to estimate the direct and indirect effects of agronomic and culinary traits on iron and zinc contents in 11 cowpea populations. Correlations between traits were estimated and decomposed into direct and indirect effects using path analysis. For the study populations, breeding for larger grain size, higher number of grains per pod, grain yield, reduced cooking time, and number of days to flowering can lead to decreases in the levels of iron and zinc in the grain. Genetic gains for the iron content can be obtained by direct selection for protein content by indirect effects on the number of grains per pod, 100-grain weight and grain yield. The positive direct effect of grain size and protein content on the zinc content indicates the possibility of simultaneous gain by combined selection of these traits.

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

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

Directory of Open Access Journals (Sweden)

Yueyue Deng

2013-01-01

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

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.

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.

Mechanism-based PK/PD modeling of selective serotonin reuptake inhibitors

NARCIS (Netherlands)

Geldof, Marian

2007-01-01

The main objective of the investigations was to explore the PK/PD correlations of fluvoxamine, as a prototype for the Selective Serotonin Reuptake Inhibitors (SSRIs). In the various investigations, a spectrum of different biomarkers was used, each reflecting a specific process on the causal path

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