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

Directory of Open Access Journals (Sweden)

Petruseva Silvana

2006-01-01

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

The research of the supply chain path coding based on prime encoding techonology

Directory of Open Access Journals (Sweden)

CHEN Xiong

2012-10-01

Full Text Available Radio Frequency Identification (RFID technology has been applied to many different fields.Especially,it is very useful in the monitoring and management of the supply chain.However,in such an environment,enormous RFID path information data will be generated,from which it therefore takes a long time to extract valuable information.In this paper,the path of items in the supply chain is effectively encoded by use of the prime number encoding which is currently a widely used coding technique and can not only compress the data volume but also is convenient to retrieve path information.A storage scheme is devised to support efficient query processing on an RDBMS .Finally,a method by which query templates are converted to SQL queries is proposed.

The processing of spatial information in short-term memory: insights from eye tracking the path length effect.

Science.gov (United States)

Guérard, Katherine; Tremblay, Sébastien; Saint-Aubin, Jean

2009-10-01

Serial memory for spatial locations increases as the distance between successive stimuli locations decreases. This effect, known as the path length effect [Parmentier, F. B. R., Elford, G., & Maybery, M. T. (2005). Transitional information in spatial serial memory: Path characteristics affect recall performance. Journal of Experimental Psychology: Learning, Memory & Cognition, 31, 412-427], was investigated in a systematic manner using eye tracking and interference procedures to explore the mechanisms responsible for the processing of spatial information. In Experiment 1, eye movements were monitored during a spatial serial recall task--in which the participants have to remember the location of spatially and temporally separated dots on the screen. In the experimental conditions, eye movements were suppressed by requiring participants to incessantly move their eyes between irrelevant locations. Ocular suppression abolished the path length effect whether eye movements were prevented during item presentation or during a 7s retention interval. In Experiment 2, articulatory suppression was combined with a spatial serial recall task. Although articulatory suppression impaired performance, it did not alter the path length effect. Our results suggest that rehearsal plays a key role in serial memory for spatial information, though the effect of path length seems to involve other processes located at encoding, such as the time spent fixating each location and perceptual organization.

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

Directory of Open Access Journals (Sweden)

Zheng Zhang

2013-03-01

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

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.

The impulse cutoff an entropy functional measure on trajectories of Markov diffusion process integrating in information path functional

OpenAIRE

Lerner, Vladimir S.

2012-01-01

The impulses, cutting entropy functional (EF) measure on trajectories Markov diffusion process, integrate information path functional (IPF) composing discrete information Bits extracted from observing random process. Each cut brings memory of the cutting entropy, which provides both reduction of the process entropy and discrete unit of the cutting entropy a Bit. Consequently, information is memorized entropy cutting in random observations which process interactions. The origin of information ...

PathSys: integrating molecular interaction graphs for systems biology

Directory of Open Access Journals (Sweden)

Raval Alpan

2006-02-01

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

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.

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.

STRATEGIC INFORMATION SYSTEMS PLANNING IN THE BANKING SECTOR—A PATH ANALYTIC MODEL STUDY IN THE INDIAN CONTEXT

Directory of Open Access Journals (Sweden)

A. M. Rawani

2002-01-01

Full Text Available This paper presents a path analytic model showing the cause and effect relationships among various Information Systems (IS planning variables for the banking sector in India. In recent years, there has been an increased awareness among banks of the potential of Information Technology (IT and the use of information systems. Strategic information system planning (SISP becomes an important issue in the use of IS strategically. In India, banks have now started realizing the importance of SISP. In this study, 11 IS planning variables for the banking sector in India are examined and the influence of one over the other is investigated using path analysis. Data for the study are collected from 52 banks operating in India. The results of the study indicate that top management involvement in IS planning greatly influences the whole planning exercise. Moreover, top management involvement is higher when they foresee greater future impact of IS. The study also highlights the need and importance of user training in the banking sector. Change in the focus and orientation of user-training will make the users competent to conceive with innovative IS applications.

The effect of path length and display size on memory for spatial information.

Science.gov (United States)

Guérard, Katherine; Tremblay, Sébastien

2012-01-01

In serial memory for spatial information, some studies showed that recall performance suffers when the distance between successive locations increases relatively to the size of the display in which they are presented (the path length effect; e.g., Parmentier et al., 2005) but not when distance is increased by enlarging the size of the display (e.g., Smyth & Scholey, 1994). In the present study, we examined the effect of varying the absolute and relative distance between to-be-remembered items on memory for spatial information. We manipulated path length using small (15″) and large (64″) screens within the same design. In two experiments, we showed that distance was disruptive mainly when it is varied relatively to a fixed reference frame, though increasing the size of the display also had a small deleterious effect on recall. The insertion of a retention interval did not influence these effects, suggesting that rehearsal plays a minor role in mediating the effects of distance on serial spatial memory. We discuss the potential role of perceptual organization in light of the pattern of results.

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

PathJam: a new service for integrating biological pathway information

Directory of Open Access Journals (Sweden)

Glez-Peña Daniel

2010-03-01

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

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.

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

Moving along the risk-informed path - drivers and challenges

International Nuclear Information System (INIS)

Petrella, S.; Dermarkar, F.; Austman, D.; Chun, R.

2004-01-01

The use of risk criteria and information has always been an important component of the licensing of nuclear reactors in Ontario. Early applications included the development of Safety Design Matrices in the early 80's for more comprehensive design reviews, the use of the Darlington Probabilistic Safety Evaluation in the late-80's to support the C-6 event categorization process for the initial Darlington licensing, and the use of risk-insights, along with cost benefit criteria, to evaluate design options for the Pickering A special safety system design retrofits and modifications, such as Shutdown System (SDS) enhancement and Emergency Coolant Injection System (ECIS) upgrades. Operational uses have included the management of outage risk, the review of containment test frequencies, and the review of abnormal operating configurations such as maintenance of electrical power supplies. It is envisaged that such applications will continue, aided by the continued development of Probabilistic Risk Assessments techniques. To provide enhanced assurance of safety, to evaluate current and new safety-related issues as they arise, and to realize the full safety and economic benefits of risk-insights, OPG and Bruce Power have, along with their Industry partners, embarked on a path to further increase the use of risk-information in the operation and licensing of their reactors. Drivers include the resolution of long standing safety analysis issues surrounding LBLOCA analyses and generic action items, the application of risk-insights to guide the response to design, inspection, and analysis findings, and the optimization of operating, maintenance, and testing programs. As well, a major near term driver is input to plant refurbishment decisions. In moving to a more risk-informed approach to safety assessment, challenges include developing and implementing the required suite of concepts, tools, processes and criteria, and reconciling the current largely deterministic approach to safety

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

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.

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.

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.

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

Directory of Open Access Journals (Sweden)

Z. Akbari

2014-10-01

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

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.

Interface between path and orbital angular momentum entanglement for high-dimensional photonic quantum information.

Science.gov (United States)

Fickler, Robert; Lapkiewicz, Radek; Huber, Marcus; Lavery, Martin P J; Padgett, Miles J; Zeilinger, Anton

2014-07-30

Photonics has become a mature field of quantum information science, where integrated optical circuits offer a way to scale the complexity of the set-up as well as the dimensionality of the quantum state. On photonic chips, paths are the natural way to encode information. To distribute those high-dimensional quantum states over large distances, transverse spatial modes, like orbital angular momentum possessing Laguerre Gauss modes, are favourable as flying information carriers. Here we demonstrate a quantum interface between these two vibrant photonic fields. We create three-dimensional path entanglement between two photons in a nonlinear crystal and use a mode sorter as the quantum interface to transfer the entanglement to the orbital angular momentum degree of freedom. Thus our results show a flexible way to create high-dimensional spatial mode entanglement. Moreover, they pave the way to implement broad complex quantum networks where high-dimensionally entangled states could be distributed over distant photonic chips.

innovation path exploration

Directory of Open Access Journals (Sweden)

Li Jian

2016-01-01

Full Text Available The world has entered the information age, all kinds of information technologies such as cloud technology, big data technology are in rapid development, and the “Internet plus” appeared. The main purpose of “Internet plus” is to provide an opportunity for the further development of the enterprise, the enterprise technology, business and other aspects of factors combine. For enterprises, grasp the “Internet plus” the impact of the market economy will undoubtedly pave the way for the future development of enterprises. This paper will be on the innovation path of the enterprise management “Internet plus” era tied you study, hope to be able to put forward some opinions and suggestions.

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

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.

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.

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

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.

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.

Age differences in virtual environment and real world path integration

Directory of Open Access Journals (Sweden)

Diane E Adamo

2012-09-01

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

The diagnostic path, a useful visualisation tool in virtual microscopy

Directory of Open Access Journals (Sweden)

Hufnagl Peter

2006-11-01

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

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.

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

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

An Optimization-Driven Analysis Pipeline to Uncover Biomarkers and Signaling Paths: Cervix Cancer

Directory of Open Access Journals (Sweden)

Enery Lorenzo

2015-05-01

Full Text Available Establishing how a series of potentially important genes might relate to each other is relevant to understand the origin and evolution of illnesses, such as cancer. High‑throughput biological experiments have played a critical role in providing information in this regard. A special challenge, however, is that of trying to conciliate information from separate microarray experiments to build a potential genetic signaling path. This work proposes a two-step analysis pipeline, based on optimization, to approach meta-analysis aiming to build a proxy for a genetic signaling path.

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)

Towards the development of full-fledged forest fire information systems

Science.gov (United States)

Baetens, J.; De Baets, B.

2012-12-01

Throughout the last decades much efforts have been spent in obtaining an increased understanding of wildfire dynamics and the way it is influenced by prevailing environmental conditions and settings, such as temperature, humidity, topography, vegetation abundance, and so on, since such a profound apprehension is a prerequisite for achieving enhanced wildfire prevention measures, as well as for optimizing fire fighting and disaster management. Amongst other things, this pursuit has culminated in the deployment of wildfire information systems, such as the Canadian Wildfire Information System (CWFIS), the European Forest Fire Information System (EFFIS) and the United States Active Fire Mapping Program and Landscape Fire and Resource Management Planning Tools (LANDFIRE), which inform any interested stakeholder, be it a citizen or a government official, about the current fire risk, the extent and location of current fires, the inflammability of the vegetation, and so on. Taking into account the coverage of these systems, it should be clear that they strongly rely upon satellite imagery that is obtained from dedicated sensors, such as the Moderate-Resolution Imaging Spectroradiometer (MODIS) on board of NASA's Terra and Aqua satellites and the Advanced Very High Resolution Radiometer (AVHRR) that is carried by NOAA satellites, or more general-purpose instruments on board of spacecrafts such as Landsat or SPOT. Yet, to this day the aforementioned information systems have not yet embraced the power of mathematical modeling in order to enable trustworthy forecasts of the spatio-temporal propagation of wildfires given their current extent, which would nonetheless be extremely useful for optimizing fire fighting and disaster management, taking appropriate preventive measures, and so on. The deployment of such full-fledged wildfire information systems requires a high-level integration of (real-time) satellite imagery, weather reports and forecasts, geographic information, and

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.

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

Directory of Open Access Journals (Sweden)

S. Okkyla

2014-09-01

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

PREP KITT, System Reliability by Fault Tree Analysis. PREP, Min Path Set and Min Cut Set for Fault Tree Analysis, Monte-Carlo Method. KITT, Component and System Reliability Information from Kinetic Fault Tree Theory

International Nuclear Information System (INIS)

Vesely, W.E.; Narum, R.E.

1997-01-01

1 - Description of problem or function: The PREP/KITT computer program package obtains system reliability information from a system fault tree. The PREP program finds the minimal cut sets and/or the minimal path sets of the system fault tree. (A minimal cut set is a smallest set of components such that if all the components are simultaneously failed the system is failed. A minimal path set is a smallest set of components such that if all of the components are simultaneously functioning the system is functioning.) The KITT programs determine reliability information for the components of each minimal cut or path set, for each minimal cut or path set, and for the system. Exact, time-dependent reliability information is determined for each component and for each minimal cut set or path set. For the system, reliability results are obtained by upper bound approximations or by a bracketing procedure in which various upper and lower bounds may be obtained as close to one another as desired. The KITT programs can handle independent components which are non-repairable or which have a constant repair time. Any assortment of non-repairable components and components having constant repair times can be considered. Any inhibit conditions having constant probabilities of occurrence can be handled. The failure intensity of each component is assumed to be constant with respect to time. The KITT2 program can also handle components which during different time intervals, called phases, may have different reliability properties. 2 - Method of solution: The PREP program obtains minimal cut sets by either direct deterministic testing or by an efficient Monte Carlo algorithm. The minimal path sets are obtained using the Monte Carlo algorithm. The reliability information is obtained by the KITT programs from numerical solution of the simple integral balance equations of kinetic tree theory. 3 - Restrictions on the complexity of the problem: The PREP program will obtain the minimal cut and

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.

Local Path Planning of Driverless Car Navigation Based on Jump Point Search Method Under Urban Environment

Directory of Open Access Journals (Sweden)

Kaijun Zhou

2017-09-01

Full Text Available The Jump Point Search (JPS algorithm is adopted for local path planning of the driverless car under urban environment, and it is a fast search method applied in path planning. Firstly, a vector Geographic Information System (GIS map, including Global Positioning System (GPS position, direction, and lane information, is built for global path planning. Secondly, the GIS map database is utilized in global path planning for the driverless car. Then, the JPS algorithm is adopted to avoid the front obstacle, and to find an optimal local path for the driverless car in the urban environment. Finally, 125 different simulation experiments in the urban environment demonstrate that JPS can search out the optimal and safety path successfully, and meanwhile, it has a lower time complexity compared with the Vector Field Histogram (VFH, the Rapidly Exploring Random Tree (RRT, A*, and the Probabilistic Roadmaps (PRM algorithms. Furthermore, JPS is validated usefully in the structured urban environment.

Is HO3 minimum cis or trans? An analytic full-dimensional ab initio isomerization path.

Science.gov (United States)

Varandas, A J C

2011-05-28

The minimum energy path for isomerization of HO(3) has been explored in detail using accurate high-level ab initio methods and techniques for extrapolation to the complete basis set limit. In agreement with other reports, the best estimates from both valence-only and all-electron single-reference methods here utilized predict the minimum of the cis-HO(3) isomer to be deeper than the trans-HO(3) one. They also show that the energy varies by less than 1 kcal mol(-1) or so over the full isomerization path. A similar result is found from valence-only multireference configuration interaction calculations with the size-extensive Davidson correction and a correlation consistent triple-zeta basis, which predict the energy difference between the two isomers to be of only Δ = -0.1 kcal mol(-1). However, single-point multireference calculations carried out at the optimum triple-zeta geometry with basis sets of the correlation consistent family but cardinal numbers up to X = 6 lead upon a dual-level extrapolation to the complete basis set limit of Δ = (0.12 ± 0.05) kcal mol(-1). In turn, extrapolations with the all-electron single-reference coupled-cluster method including the perturbative triples correction yield values of Δ = -0.19 and -0.03 kcal mol(-1) when done from triple-quadruple and quadruple-quintuple zeta pairs with two basis sets of increasing quality, namely cc-cpVXZ and aug-cc-pVXZ. Yet, if added a value of 0.25 kcal mol(-1) that accounts for the effect of triple and perturbative quadruple excitations with the VTZ basis set, one obtains a coupled cluster estimate of Δ = (0.14 ± 0.08) kcal mol(-1). It is then shown for the first time from systematic ab initio calculations that the trans-HO(3) isomer is more stable than the cis one, in agreement with the available experimental evidence. Inclusion of the best reported zero-point energy difference (0.382 kcal mol(-1)) from multireference configuration interaction calculations enhances further the relative

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.

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

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.

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.

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

Path-based Queries on Trajectory Data

DEFF Research Database (Denmark)

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

2014-01-01

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

Path Diversity Media Streaming over Best Effort Packet Switched Networks

Science.gov (United States)

2003-01-01

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

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.

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

International Nuclear Information System (INIS)

Costa, Jessé C; Schleicher, Jörg

2011-01-01

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

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.

Edge- and Node-Disjoint Paths in P Systems

Directory of Open Access Journals (Sweden)

Michael J. Dinneen

2010-10-01

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

Strategic Path Planning by Sequential Parametric Bayesian Decisions

Directory of Open Access Journals (Sweden)

Baro Hyun

2013-11-01

Full Text Available The objective of this research is to generate a path for a mobile agent that carries sensors used for classification, where the path is to optimize strategic objectives that account for misclassification and the consequences of misclassification, and where the weights assigned to these consequences are chosen by a strategist. We propose a model that accounts for the interaction between the agent kinematics (i.e., the ability to move, informatics (i.e., the ability to process data to information, classification (i.e., the ability to classify objects based on the information, and strategy (i.e., the mission objective. Within this model, we pose and solve a sequential decision problem that accounts for strategist preferences and the solution to the problem yields a sequence of kinematic decisions of a moving agent. The solution of the sequential decision problem yields the following flying tactics: “approach only objects whose suspected identity matters to the strategy”. These tactics are numerically illustrated in several scenarios.

A Split-Path Schema-Based RFID Data Storage Model in Supply Chain Management

Directory of Open Access Journals (Sweden)

Jianfeng Zhang

2013-05-01

Full Text Available In modern supply chain management systems, Radio Frequency IDentification (RFID technology has become an indispensable sensor technology and massive RFID data sets are expected to become commonplace. More and more space and time are needed to store and process such huge amounts of RFID data, and there is an increasing realization that the existing approaches cannot satisfy the requirements of RFID data management. In this paper, we present a split-path schema-based RFID data storage model. With a data separation mechanism, the massive RFID data produced in supply chain management systems can be stored and processed more efficiently. Then a tree structure-based path splitting approach is proposed to intelligently and automatically split the movement paths of products . Furthermore, based on the proposed new storage model, we design the relational schema to store the path information and time information of tags, and some typical query templates and SQL statements are defined. Finally, we conduct various experiments to measure the effect and performance of our model and demonstrate that it performs significantly better than the baseline approach in both the data expression and path-oriented RFID data query performance.

Design of an Automatic Path Finding Wheelchair with Intelligent Guidance System

Directory of Open Access Journals (Sweden)

Apratim MAJUMDER

2011-03-01

Full Text Available A conventional motorized wheelchair has been fitted with sensors and programmed with an intelligent guidance system to efficiently maneuver itself automatically from one point to another in a facility equipped with a grid of sensors that provide the wheelchair with the basic map of its course. The device described in this paper has been conceptualized such that once the wheelchair is given information regarding the starting and stopping point in a controlled facility, the wheelchair with this pre programmed information can efficiently construct a path towards its destination and automatically drive to that point from its present position while avoiding obstacles in its path and negotiating any turns and bends that it encounters in its course. This is achieved by means of sensors (IR and sonic located at strategic points on the chair, circuits that control the speed of the motors, and a set of microcontrollers programmed to execute the different functions of the wheelchair. The facility in which the wheelchair works has been fitted with a set of sensors that form the basis of the network which is used by the program governing the wheelchair’s automated movement to provide guidance to it by means of a course map.

NemaPath: online exploration of KEGG-based metabolic pathways for nematodes

Directory of Open Access Journals (Sweden)

Wang Zhengyuan

2008-11-01

Full Text Available Abstract Background Nematode.net http://www.nematode.net is a web-accessible resource for investigating gene sequences from parasitic and free-living nematode genomes. Beyond the well-characterized model nematode C. elegans, over 500,000 expressed sequence tags (ESTs and nearly 600,000 genome survey sequences (GSSs have been generated from 36 nematode species as part of the Parasitic Nematode Genomics Program undertaken by the Genome Center at Washington University School of Medicine. However, these sequencing data are not present in most publicly available protein databases, which only include sequences in Swiss-Prot. Swiss-Prot, in turn, relies on GenBank/Embl/DDJP for predicted proteins from complete genomes or full-length proteins. Description Here we present the NemaPath pathway server, a web-based pathway-level visualization tool for navigating putative metabolic pathways for over 30 nematode species, including 27 parasites. The NemaPath approach consists of two parts: 1 a backend tool to align and evaluate nematode genomic sequences (curated EST contigs against the annotated Kyoto Encyclopedia of Genes and Genomes (KEGG protein database; 2 a web viewing application that displays annotated KEGG pathway maps based on desired confidence levels of primary sequence similarity as defined by a user. NemaPath also provides cross-referenced access to nematode genome information provided by other tools available on Nematode.net, including: detailed NemaGene EST cluster information; putative translations; GBrowse EST cluster views; links from nematode data to external databases for corresponding synonymous C. elegans counterparts, subject matches in KEGG's gene database, and also KEGG Ontology (KO identification. Conclusion The NemaPath server hosts metabolic pathway mappings for 30 nematode species and is available on the World Wide Web at http://nematode.net/cgi-bin/keggview.cgi. The nematode source sequences used for the metabolic pathway

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

Directory of Open Access Journals (Sweden)

S. J. de A. LIMA

2015-07-01

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

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.

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

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

Meta-path based heterogeneous combat network link prediction

Science.gov (United States)

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

2017-09-01

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

KINEMATIC ANALYSES OF THE GOLF SWING HUB PATH AND ITS ROLE IN GOLFER/CLUB KINETIC TRANSFERS

Directory of Open Access Journals (Sweden)

Steven M. Nesbit

2009-06-01

Full Text Available This study analyzed the fundamental geometric and kinematic characteristics of the swing hub path of the golf shot for four diverse subjects. In addition, the role of the hub path geometry in transferring the kinetic quantities from the golfer to the club were investigated. The hub path was found to have a complex geometry with significantly changing radii, and a constantly moving center-of-curvature during the downswing for all subjects. While the size and shape of the hub path differed considerably among the subjects, a three phase radius-based pattern was revealed that aligned with distinct stages of the downswing. Artificially controlling and optimizing the hub path of the better golfer in the group indicated that a non-circular hub path was superior to a constant radius path in minimizing the kinetic loading while generating the highest possible club head velocity. The shape and purpose of the hub path geometry appears to result from a complex combination of achieving equilibrium between the golfer and the club, and a purposeful configuring of the path to control the outward movement of the club while minimizing the kinetic loading on the golfer yet transferring the maximum kinetic quantities to the club. Describing the downswing relative to the hub path phasing is presented and was found to be informative since the phases align with significant swing, kinetic and kinematic markers. These findings challenge golf swing modeling methodologies which fix the center-of-curvature of the hub path thus constraining it to constant radius motion

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.

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.

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)

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

Directory of Open Access Journals (Sweden)

Gross Benjamin E

2006-11-01

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

Rocket Flight Path

Directory of Open Access Journals (Sweden)

Jamie Waters

2014-09-01

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

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

International Nuclear Information System (INIS)

Coble, Jamie; Hines, Wesley

2014-01-01

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

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.

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.

VIRTUAL ENVIRONMENTAL PATHS AS A MEANS OF ECOTOURISM DEVELOPMENT IN NATURAL RESERVES OF RUSSIA

Directory of Open Access Journals (Sweden)

V. Korbut

2014-01-01

Full Text Available The innovate conception of virtual ecological paths as a foremost edition for ecotourism and attendance’s preparation in specially protected natural sites. It’s has a vital importance for remote and sensible ecosystems. The virtual ecological paths will be able to important stage of environmentalization of awareness on the base of modern technologies of elicitation, data processing and storage of information. The need to move Russia on the way of sustainable development, including in the tourism and recreation sector, has identified ecotourism as the most promising direction of tourism development. The problems of development ecotourism in Russia, the role of local and regional governments in the empowerment of ecotourism and its information support are considered.

On fairness, full cooperation, and quantum game with incomplete information

Science.gov (United States)

Lei, Zhen-Zhou; Liu, Bo-Yang; Yi, Ying; Dai, Hong-Yi; Zhang, Ming

2018-03-01

Quantum entanglement has emerged as a new resource to enhance cooperation and remove dilemmas. This paper aims to explore conditions under which full cooperation is achievable even when the information of payoff is incomplete. Based on the quantum version of the extended classical cash in a hat game, we demonstrate that quantum entanglement may be used for achieving full cooperation or avoiding moral hazards with the reasonable profit distribution policies even when the profit is uncertain to a certain degree. This research further suggests that the fairness of profit distribution should play an important role in promoting full cooperation. It is hopeful that quantum entanglement and fairness will promote full cooperation among distant people from various interest groups when quantum networks and quantum entanglement are accessible to the public. Project supported by the National Natural Science Foundation of China (Grant Nos. 61673389, 61273202, and 61134008.

Statistical Analysis of the First Passage Path Ensemble of Jump Processes

Science.gov (United States)

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

2018-02-01

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

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

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.

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

Full-range k-domain linearization in spectral-domain optical coherence tomography.

Science.gov (United States)

Jeon, Mansik; Kim, Jeehyun; Jung, Unsang; Lee, Changho; Jung, Woonggyu; Boppart, Stephen A

2011-03-10

A full-bandwidth k-domain linearization method for spectral-domain optical coherence tomography (SD-OCT) is demonstrated. The method uses information of the wavenumber-pixel-position provided by a translating-slit-based wavelength filter. For calibration purposes, the filter is placed either after a broadband source or at the end of the sample path, and the filtered spectrum with a narrowed line width (∼0.5 nm) is incident on a line-scan camera in the detection path. The wavelength-swept spectra are co-registered with the pixel positions according to their central wavelengths, which can be automatically measured with an optical spectrum analyzer. For imaging, the method does not require a filter or a software recalibration algorithm; it simply resamples the OCT signal from the detector array without employing rescaling or interpolation methods. The accuracy of k-linearization is maximized by increasing the k-linearization order, which is known to be a crucial parameter for maintaining a narrow point-spread function (PSF) width at increasing depths. The broadening effect is studied by changing the k-linearization order by undersampling to search for the optimal value. The system provides more position information, surpassing the optimum without compromising the imaging speed. The proposed full-range k-domain linearization method can be applied to SD-OCT systems to simplify their hardware/software, increase their speed, and improve the axial image resolution. The experimentally measured width of PSF in air has an FWHM of 8 μm at the edge of the axial measurement range. At an imaging depth of 2.5 mm, the sensitivity of the full-range calibration case drops less than 10 dB compared with the uncompensated case.

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.

Path Generation by Avoiding Obstacles using the Intersection of Bodies

Directory of Open Access Journals (Sweden)

Komák Martin

2018-02-01

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

Research and Implementation of Robot Path Planning Based onVSLAM

Directory of Open Access Journals (Sweden)

Wang Zi-Qiang

2018-01-01

Full Text Available In order to solve the problem of warehouse logistics robots planpath in different scenes, this paper proposes a method based on visual simultaneous localization and mapping (VSLAM to build grid map of different scenes and use A* algorithm to plan path on the grid map. Firstly, we use VSLAMto reconstruct the environment in three-dimensionally. Secondly, based on the three-dimensional environment data, we calculate the accessibility of each grid to prepare occupied grid map (OGM for terrain description. Rely on the terrain information, we use the A* algorithm to solve path planning problem. We also optimize the A* algorithm and improve algorithm efficiency. Lastly, we verify the effectiveness and reliability of the proposed method by simulation and experimental results.

Appendices for: Improper Signaling in Two-Path Relay Channels

KAUST Repository

Gaafar, Mohamed

2016-12-01

This document contains the appendices for the work in “Improper Signaling in Two-Path Relay Channels,” which is submitted to 2017 IEEE International Conference on Communications (ICC) Workshop on Full-Duplex Communications for Future Wireless Networks, Paris, France.

Appendices for: Improper Signaling in Two-Path Relay Channels

KAUST Repository

Gaafar, Mohamed; Amin, Osama; Schaefer, Rafael F.; Alouini, Mohamed-Slim

2016-01-01

This document contains the appendices for the work in “Improper Signaling in Two-Path Relay Channels,” which is submitted to 2017 IEEE International Conference on Communications (ICC) Workshop on Full-Duplex Communications for Future Wireless Networks, Paris, France.

The time-varying shortest path problem with fuzzy transit costs and speedup

Directory of Open Access Journals (Sweden)

Rezapour Hassan

2016-08-01

Full Text Available In this paper, we focus on the time-varying shortest path problem, where the transit costs are fuzzy numbers. Moreover, we consider this problem in which the transit time can be shortened at a fuzzy speedup cost. Speedup may also be a better decision to find the shortest path from a source vertex to a specified vertex.

The effect of system boundaries on the mean free path for confined gases

Directory of Open Access Journals (Sweden)

Sooraj K. Prabha

2013-10-01

Full Text Available The mean free path of rarefied gases is accurately determined using Molecular Dynamics simulations. The simulations are carried out on isothermal argon gas (Lennard-Jones fluid over a range of rarefaction levels under various confinements (unbounded gas, parallel reflective wall and explicit solid platinum wall bounded gas in a nanoscale domain. The system is also analyzed independently in constitutive sub-systems to calculate the corresponding local mean free paths. Our studies which predominate in the transition regime substantiate the boundary limiting effect on mean free paths owing to the sharp diminution in molecular free paths near the planar boundaries. These studies provide insight to the transport phenomena of rarefied gases through nanochannels which have established their potential in microscale and nanoscale heat transfer applications.

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.

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

Science.gov (United States)

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

2006-11-08

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

Determining paths by which farmers can adapt effectively to scarce freshwater resources

Science.gov (United States)

Watson, R.; Hornberger, G.; Carrico, A. R.

2012-12-01

Stress on freshwater resources is a significant risk associated with climatic change. The risk is even greater given the expected changes in overall resource use as the developing world develops, as the world's population continues to grow, and as land use changes dramatically. Effective water management has implications for food security, health, and political stability worldwide. This is particularly true in developing regions heavily dependent on agriculture, and where agriculture depends on irrigation. Adaptation to water stress requires both managing water allocation among competing users and ensuring that each user is efficient in his or her use of a limited allotment: the problem is a quintessential common-pool resource (CPR) dilemma. In the future even more so than in the past, adaptation will be essential as the world evolves. The problem that we identify—determining paths by which farmers can adapt effectively to increasingly scarce freshwater resources—is one of great scientific and societal importance. The issue lies at the intersection of water-cycle processes and social-psychological processes that influence and are influenced by water availability and use. This intersection harbors intriguing unresolved scientific questions; advances in natural and social sciences will stem from attacks on the overall problem. The issue is societally compelling because the ability of the world to supply adequate food for a population expected to grow to over 9 billion by 2050 may well be determined by how farmers, consumers, and government institutions adapt to changing conditions of water availability. Major strides have been made in recent decades in understanding why Hardin's envisioned "tragedy of the commons" is avoided under certain circumstances, in some cases through self-organization rather than government intervention originally considered a necessity. Furthermore, we now know that the impacts of decisions about allocation and use of water can be

Full information acquisition in scanning probe microscopy and spectroscopy

Energy Technology Data Exchange (ETDEWEB)

Jesse, Stephen; Belianinov, Alex; Kalinin, Sergei V.; Somnath, Suhas

2017-04-04

Apparatus and methods are described for scanning probe microscopy and spectroscopy based on acquisition of full probe response. The full probe response contains valuable information about the probe-sample interaction that is lost in traditional scanning probe microscopy and spectroscopy methods. The full probe response is analyzed post data acquisition using fast Fourier transform and adaptive filtering, as well as multivariate analysis. The full response data is further compressed to retain only statistically significant components before being permanently stored.

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

Directory of Open Access Journals (Sweden)

Jorge L. de Souza

2005-12-01

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

Effectiveness of Interactive Tutorials in Promoting "Which-Path" Information Reasoning in Advanced Quantum Mechanics

Science.gov (United States)

Maries, Alexandru; Sayer, Ryan; Singh, Chandralekha

2017-01-01

Research suggests that introductory physics students often have difficulty using a concept in contexts different from the ones in which they learned it without explicit guidance to help them make the connection between the different contexts. We have been investigating advanced students' learning of quantum mechanics concepts and have developed…

Efficient Unbiased Rendering using Enlightened Local Path Sampling

DEFF Research Database (Denmark)

Kristensen, Anders Wang

measurements, which are the solution to the adjoint light transport problem. The second is a representation of the distribution of radiance and importance in the scene. We also derive a new method of particle sampling, which is advantageous compared to existing methods. Together we call the resulting algorithm....... The downside to using these algorithms is that they can be slow to converge. Due to the nature of Monte Carlo methods, the results are random variables subject to variance. This manifests itself as noise in the images, which can only be reduced by generating more samples. The reason these methods are slow...... is because of a lack of eeffective methods of importance sampling. Most global illumination algorithms are based on local path sampling, which is essentially a recipe for constructing random walks. Using this procedure paths are built based on information given explicitly as part of scene description...

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

Directory of Open Access Journals (Sweden)

Huifang Chen

2013-11-01

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

A Scaffold Analysis Tool Using Mate-Pair Information in Genome Sequencing

Directory of Open Access Journals (Sweden)

Pan-Gyu Kim

2008-01-01

Full Text Available We have developed a Windows-based program, ConPath, as a scaffold analyzer. ConPath constructs scaffolds by ordering and orienting separate sequence contigs by exploiting the mate-pair information between contig-pairs. Our algorithm builds directed graphs from link information and traverses them to find the longest acyclic graphs. Using end read pairs of fixed-sized mate-pair libraries, ConPath determines relative orientations of all contigs, estimates the gap size of each adjacent contig pair, and reports wrong assembly information by validating orientations and gap sizes. We have utilized ConPath in more than 10 microbial genome projects, including Mannheimia succiniciproducens and Vibro vulnificus, where we verified contig assembly and identified several erroneous contigs using the four types of error defined in ConPath. Also, ConPath supports some convenient features and viewers that permit investigation of each contig in detail; these include contig viewer, scaffold viewer, edge information list, mate-pair list, and the printing of complex scaffold structures.

Networks in Buildings: Which Path Forward?

Energy Technology Data Exchange (ETDEWEB)

Nordman, Bruce

2008-08-17

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

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.

A comparative study on full diagonalization of Hessian matrix and Gradient-only technique to trace out reaction path in doped noble gas clusters using stochastic optimization

International Nuclear Information System (INIS)

Biring, Shyamal Kumar; Chaudhury, Pinaki

2012-01-01

Highlights: ► Estimation of critical points in Noble-gas clusters. ► Evaluation of first order saddle point or transition states. ► Construction of reaction path for structural change in clusters. ► Use of Monte-Carlo Simulated Annealing to study structural changes. - Abstract: This paper proposes Simulated Annealing based search to locate critical points in mixed noble gas clusters where Ne and Xe are individually doped in Ar-clusters. Using Lennard–Jones (LJ) atomic interaction we try to explore the search process of transformation through Minimum Energy Path (MEP) from one minimum energy geometry to another via first order saddle point on the potential energy surface of the clusters. Here we compare the results based on diagonalization of the full Hessian all through the search and quasi-gradient only technique to search saddle points and construction of reaction path (RP) for three sizes of doped Ar-clusters, (Ar) 19 Ne/Xe,(Ar) 24 Ne/Xe and (Ar) 29 Ne/Xe.

An RRT-Based path planner for use in trajectory imitation

CSIR Research Space (South Africa)

Claassens, J

2010-01-01

Full Text Available The authors propose a more robust robot programming; by demonstration system planner that produces a reproduction; path which satisfies statistical constraints derived from demonstration; trajectories and avoids obstacles given the freedom; in those...

A cost effective topology migration path towards fibre

OpenAIRE

Phillipson, F.

2013-01-01

If an operator has as starting position a Full Copper topology in which ADSL or VDSL is offered from the Central Office, the next choice he has to make is to provide Full FttH or use an other topology option, e.g. FttCab, first as intermediate step to provide a next generation service package. In this paper we present a gradual topology migration path from Full Copper via FttCab and Hybrid FttH towards Full FttH. We look at the planning issues of this topology migration and the financial impa...

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

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

Directory of Open Access Journals (Sweden)

Liang Shen

2017-01-01

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

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)

ComPath: comparative enzyme analysis and annotation in pathway/subsystem contexts

Directory of Open Access Journals (Sweden)

Kim Sun

2008-03-01

Full Text Available Abstract Background Once a new genome is sequenced, one of the important questions is to determine the presence and absence of biological pathways. Analysis of biological pathways in a genome is a complicated task since a number of biological entities are involved in pathways and biological pathways in different organisms are not identical. Computational pathway identification and analysis thus involves a number of computational tools and databases and typically done in comparison with pathways in other organisms. This computational requirement is much beyond the capability of biologists, so information systems for reconstructing, annotating, and analyzing biological pathways are much needed. We introduce a new comparative pathway analysis workbench, ComPath, which integrates various resources and computational tools using an interactive spreadsheet-style web interface for reliable pathway analyses. Results ComPath allows users to compare biological pathways in multiple genomes using a spreadsheet style web interface where various sequence-based analysis can be performed either to compare enzymes (e.g. sequence clustering and pathways (e.g. pathway hole identification, to search a genome for de novo prediction of enzymes, or to annotate a genome in comparison with reference genomes of choice. To fill in pathway holes or make de novo enzyme predictions, multiple computational methods such as FASTA, Whole-HMM, CSR-HMM (a method of our own introduced in this paper, and PDB-domain search are integrated in ComPath. Our experiments show that FASTA and CSR-HMM search methods generally outperform Whole-HMM and PDB-domain search methods in terms of sensitivity, but FASTA search performs poorly in terms of specificity, detecting more false positive as E-value cutoff increases. Overall, CSR-HMM search method performs best in terms of both sensitivity and specificity. Gene neighborhood and pathway neighborhood (global network visualization tools can be used

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

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.

Paths of Cultural Systems

Directory of Open Access Journals (Sweden)

Paul Ballonoff

2017-12-01

Full Text Available A theory of cultural structures predicts the objects observed by anthropologists. We here define those which use kinship relationships to define systems. A finite structure we call a partially defined quasigroup (or pdq, as stated by Definition 1 below on a dictionary (called a natural language allows prediction of certain anthropological descriptions, using homomorphisms of pdqs onto finite groups. A viable history (defined using pdqs states how an individual in a population following such history may perform culturally allowed associations, which allows a viable history to continue to survive. The vector states on sets of viable histories identify demographic observables on descent sequences. Paths of vector states on sets of viable histories may determine which histories can exist empirically.

Simplified path integral for supersymmetric quantum mechanics and type-A trace anomalies

Science.gov (United States)

Bastianelli, Fiorenzo; Corradini, Olindo; Iacconi, Laura

2018-05-01

Particles in a curved space are classically described by a nonlinear sigma model action that can be quantized through path integrals. The latter require a precise regularization to deal with the derivative interactions arising from the nonlinear kinetic term. Recently, for maximally symmetric spaces, simplified path integrals have been developed: they allow to trade the nonlinear kinetic term with a purely quadratic kinetic term (linear sigma model). This happens at the expense of introducing a suitable effective scalar potential, which contains the information on the curvature of the space. The simplified path integral provides a sensible gain in the efficiency of perturbative calculations. Here we extend the construction to models with N = 1 supersymmetry on the worldline, which are applicable to the first quantized description of a Dirac fermion. As an application we use the simplified worldline path integral to compute the type-A trace anomaly of a Dirac fermion in d dimensions up to d = 16.

On path hypercompositions in graphs and automata

Directory of Open Access Journals (Sweden)

Massouros Christos G.

2016-01-01

Full Text Available The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.

Consumer behaviour and the environment: Which role for information?

DEFF Research Database (Denmark)

Thøgersen, John

My aim here is to present a broad-brush overview of some of the most important roles that information has been found to play as a tool for promoting environmentally responsible consumer behaviour. Because this workshop is organized by a network of economists, I will start with the importance...... of information for getting the full potential out of economic instruments. However, my main emphasis will be on the importance of information for creating and facilitating consumers' willing participation in solving environmental problems that are in some way related to their behaviour as consumers. Information...... may be even more important for furthering other important types of behaviour, such as voter behaviour or activist behaviour, but I won't discuss the specific issues about promoting these types of behaviour today....

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

Directory of Open Access Journals (Sweden)

Yahui Gan

2012-09-01

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

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.

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

Autonomous Path Planning for Road Vehicles in Narrow Environments: An Efficient Continuous Curvature Approach

Directory of Open Access Journals (Sweden)

Domokos Kiss

2017-01-01

Full Text Available In this paper we introduce a novel method for obtaining good quality paths for autonomous road vehicles (e.g., cars or buses in narrow environments. There are many traffic situations in urban scenarios where nontrivial maneuvering in narrow places is necessary. Navigating in cluttered parking lots or having to avoid obstacles blocking the way and finding a detour even in narrow streets are challenging, especially if the vehicle has large dimensions like a bus. We present a combined approximation-based approach to solve the path planning problem in such situations. Our approach consists of a global planner which generates a preliminary path consisting of straight and turning-in-place primitives and a local planner which is used to make the preliminary path feasible to car-like vehicles. The approximation methodology is well known in the literature; however, both components proposed in this paper differ from existing similar planning methods. The approximation process with the proposed local planner is proven to be convergent for any preliminary global paths. The resulting path has continuous curvature which renders our method well suited for application on real vehicles. Simulation experiments show that the proposed method outperforms similar approaches in terms of path quality in complicated planning tasks.

Consistent Partial Least Squares Path Modeling via Regularization

Directory of Open Access Journals (Sweden)

Sunho Jung

2018-02-01

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

Inked Careers: Tattooing Professional Paths

Directory of Open Access Journals (Sweden)

Gabriela DeLuca

2016-12-01

Full Text Available The concept of career has an interdisciplinary and historical constitution, which includes persons, groups, organizations and society. Given that, we aim to deepen the interactionist notion of career from the understanding of a deviant path, supported by a theory and a method appropriated to the cited call for interdisciplinary approaches. Dilemmas (Hughes, 1958 and conflicts (Hughes, 1937 emerged as important analytical categories. Although necessary, these two concepts were not sufficient to contemplate analyses in their entirety. For this reason we conceptualized a third possibility of controversy during a career: the inquiries. The study followed the Narrative method to analyze objective and subjective changes during a tattoo artist’s career through interviews and informal conversations carried out over 22 months. The discussion presents three main contributions. Theoretically, a new understanding of the concept of careers, linking past, present and future and the idea of non-linearity of experienced and envisioned careers. Methodologically, suggesting orientations for future career studies such as the use of turning points as a methodological tool and the investigation of deviant fields. Finally, our defense of the interactionist perspective as suitable for career studies, since it allows the investigation of deviant elements.

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.

Dynamic Speed Adaptation for Path Tracking Based on Curvature Information and Speed Limits.

Science.gov (United States)

Gámez Serna, Citlalli; Ruichek, Yassine

2017-06-14

A critical concern of autonomous vehicles is safety. Different approaches have tried to enhance driving safety to reduce the number of fatal crashes and severe injuries. As an example, Intelligent Speed Adaptation (ISA) systems warn the driver when the vehicle exceeds the recommended speed limit. However, these systems only take into account fixed speed limits without considering factors like road geometry. In this paper, we consider road curvature with speed limits to automatically adjust vehicle's speed with the ideal one through our proposed Dynamic Speed Adaptation (DSA) method. Furthermore, 'curve analysis extraction' and 'speed limits database creation' are also part of our contribution. An algorithm that analyzes GPS information off-line identifies high curvature segments and estimates the speed for each curve. The speed limit database contains information about the different speed limit zones for each traveled path. Our DSA senses speed limits and curves of the road using GPS information and ensures smooth speed transitions between current and ideal speeds. Through experimental simulations with different control algorithms on real and simulated datasets, we prove that our method is able to significantly reduce lateral errors on sharp curves, to respect speed limits and consequently increase safety and comfort for the passenger.

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.

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

Design of a Path-Tracking Steering Controller for Autonomous Vehicles

Directory of Open Access Journals (Sweden)

Chuanyang Sun

2018-06-01

Full Text Available This paper presents a linearization method for the vehicle and tire models under the model predictive control (MPC scheme, and proposes a linear model-based MPC path-tracking steering controller for autonomous vehicles. The steering controller is designed to minimize lateral path-tracking deviation at high speeds. The vehicle model is linearized by a sequence of supposed steering angles, which are obtained by assuming the vehicle can reach the desired path at the end of the MPC prediction horizon and stay in a steady-state condition. The lateral force of the front tire is directly used as the control input of the model, and the rear tire’s lateral force is linearized by an equivalent cornering stiffness. The course-direction deviation, which is the angle between the velocity vector and the path heading, is chosen as a control reference state. The linearization model is validated through the simulation, and the results show high prediction accuracy even in regions of large steering angle. This steering controller is tested through simulations on the CarSim-Simulink platform (R2013b, MathWorks, Natick, MA, USA, showing the improved performance of the present controller at high speeds.

Path Models of Vocal Emotion Communication.

Directory of Open Access Journals (Sweden)

Tanja Bänziger

Full Text Available We propose to use a comprehensive path model of vocal emotion communication, encompassing encoding, transmission, and decoding processes, to empirically model data sets on emotion expression and recognition. The utility of the approach is demonstrated for two data sets from two different cultures and languages, based on corpora of vocal emotion enactment by professional actors and emotion inference by naïve listeners. Lens model equations, hierarchical regression, and multivariate path analysis are used to compare the relative contributions of objectively measured acoustic cues in the enacted expressions and subjective voice cues as perceived by listeners to the variance in emotion inference from vocal expressions for four emotion families (fear, anger, happiness, and sadness. While the results confirm the central role of arousal in vocal emotion communication, the utility of applying an extended path modeling framework is demonstrated by the identification of unique combinations of distal cues and proximal percepts carrying information about specific emotion families, independent of arousal. The statistical models generated show that more sophisticated acoustic parameters need to be developed to explain the distal underpinnings of subjective voice quality percepts that account for much of the variance in emotion inference, in particular voice instability and roughness. The general approach advocated here, as well as the specific results, open up new research strategies for work in psychology (specifically emotion and social perception research and engineering and computer science (specifically research and development in the domain of affective computing, particularly on automatic emotion detection and synthetic emotion expression in avatars.

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.

The graph-theoretic minimum energy path problem for ionic conduction

Directory of Open Access Journals (Sweden)

Ippei Kishida

2015-10-01

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

Crack path in liquid metal embrittlement: experiments with steels and modeling

Directory of Open Access Journals (Sweden)

T. Auger

2016-01-01

Full Text Available We review the recent experimental clarification of the fracture path in Liquid Metal Embrittlement with austenitic and martensitic steels. Using state of the art characterization tools (Focused Ion Beam and Transmission Electron Microscopy a clear understanding of crack path is emerging for these systems where a classical fractographic analysis fails to provide useful information. The main finding is that most of the cracking process takes place at grain boundaries, lath or mechanical twin boundaries while cleavage or plastic flow localization is rarely the observed fracture mode. Based on these experimental insights, we sketch an on-going modeling strategy for LME crack initiation and propagation at mesoscopic scale. At the microstructural scale, crystal plasticity constitutive equations are used to model the plastic deformation in metals and alloys. The microstructure used is either extracted from experimental measurements by 3D-EBSD (Electron Back Scattering Diffraction or simulated starting from a Voronoï approach. The presence of a crackwithin the polycrystalline aggregate is taken into account in order to study the surrounding plastic dissipation and the crack path. One key piece of information that can be extracted is the typical order of magnitude of the stress-strain state at GB in order to constrain crack initiation models. The challenges of building predictive LME cracking models are outlined.

Robust H∞ output-feedback control for path following of autonomous ground vehicles

Science.gov (United States)

Hu, Chuan; Jing, Hui; Wang, Rongrong; Yan, Fengjun; Chadli, Mohammed

2016-03-01

This paper presents a robust H∞ output-feedback control strategy for the path following of autonomous ground vehicles (AGVs). Considering the vehicle lateral velocity is usually hard to measure with low cost sensor, a robust H∞ static output-feedback controller based on the mixed genetic algorithms (GA)/linear matrix inequality (LMI) approach is proposed to realize the path following without the information of the lateral velocity. The proposed controller is robust to the parametric uncertainties and external disturbances, with the parameters including the tire cornering stiffness, vehicle longitudinal velocity, yaw rate and road curvature. Simulation results based on CarSim-Simulink joint platform using a high-fidelity and full-car model have verified the effectiveness of the proposed control approach.

Wide field of view common-path lateral-shearing digital holographic interference microscope.

Science.gov (United States)

Vora, Priyanka; Trivedi, Vismay; Mahajan, Swapnil; Patel, Nimit; Joglekar, Mugdha; Chhaniwal, Vani; Moradi, Ali-Reza; Javidi, Bahram; Anand, Arun

2017-12-01

Quantitative three-dimensional (3-D) imaging of living cells provides important information about the cell morphology and its time variation. Off-axis, digital holographic interference microscopy is an ideal tool for 3-D imaging, parameter extraction, and classification of living cells. Two-beam digital holographic microscopes, which are usually employed, provide high-quality 3-D images of micro-objects, albeit with lower temporal stability. Common-path digital holographic geometries, in which the reference beam is derived from the object beam, provide higher temporal stability along with high-quality 3-D images. Self-referencing geometry is the simplest of the common-path techniques, in which a portion of the object beam itself acts as the reference, leading to compact setups using fewer optical elements. However, it has reduced field of view, and the reference may contain object information. Here, we describe the development of a common-path digital holographic microscope, employing a shearing plate and converting one of the beams into a separate reference by employing a pin-hole. The setup is as compact as self-referencing geometry, while providing field of view as wide as that of a two-beam microscope. The microscope is tested by imaging and quantifying the morphology and dynamics of human erythrocytes. (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE).

New Path Based Index Structure for Processing CAS Queries over XML Database

Directory of Open Access Journals (Sweden)

Krishna Asawa

2017-01-01

Full Text Available Querying nested data has become one of the most challenging issues for retrieving desired information from the Web. Today diverse applications generate a tremendous amount of data in different formats. These data and information exchanged on the Web are commonly expressed as nested representation such as XML, JSON, etc. Unlike the traditional database system, they don't have a rigid schema. In general, the nested data is managed by storing data and its structures separately which significantly reduces the performance of data retrieving. Ensuring efficiency of processing queries which locates the exact positions of the elements has become a big challenging issue. There are different indexing structures which have been proposed in the literature to improve the performance of the query processing on the nested structure. Most of the past researches on nested structure concentrate on the structure alone. This paper proposes new index structure which combines siblings of the terminal nodes as one path which efficiently processes twig queries with less number of lookups and joins. The proposed approach is compared with some of the existing approaches. The results also show that they are processed with better performance compared to the existing ones.

Physical Layer Security Using Two-Path Successive Relaying

Directory of Open Access Journals (Sweden)

Qian Yu Liau

2016-06-01

Full Text Available Relaying is one of the useful techniques to enhance wireless physical-layer security. Existing literature shows that employing full-duplex relay instead of conventional half-duplex relay improves secrecy capacity and secrecy outage probability, but this is at the price of sophisticated implementation. As an alternative, two-path successive relaying has been proposed to emulate operation of full-duplex relay by scheduling a pair of half-duplex relays to assist the source transmission alternately. However, the performance of two-path successive relaying in secrecy communication remains unexplored. This paper proposes a secrecy two-path successive relaying protocol for a scenario with one source, one destination and two half-duplex relays. The relays operate alternately in a time division mode to forward messages continuously from source to destination in the presence of an eavesdropper. Analytical results reveal that the use of two half-duplex relays in the proposed scheme contributes towards a quadratically lower probability of interception compared to full-duplex relaying. Numerical simulations show that the proposed protocol achieves the ergodic achievable secrecy rate of full-duplex relaying while delivering the lowest probability of interception and secrecy outage probability compared to the existing half duplex relaying, full duplex relaying and full duplex jamming schemes.

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.

The path to the nest of spiders The path to the nest of spiders

Directory of Open Access Journals (Sweden)

Eliane Luz Bayer

2008-04-01

Full Text Available Italo Calvino writes in his preface to The Path to the Nest of Spiders that the novel answers to the "ripeness of the time" since ht wrote it after wartime, a period when everyone had a tale to tell. He tells us that this is a story in which iobody is a hero and nobody has the class consciousness necessary to unify them in the struggle. Calvino acknowledges that it was difficult to conciliate his experiences with the postwar literary movement which he calls Neo-expresSionism, a term which, he thinks, describes better Italian Neo-realism. This is a book with a full realistic depictior of the incongruousness of the whole situation, showing rumen beings driven by loneliness, aggressiveness, unfulfilment and failure to meet, their nerves frayed by the War. It reveals human beings in their weaknesses, subjected to deterministic fates changing roles according to circumstance. Partisans shift to the Nazi side and inform on their f rmer allies and vice-versa, being later chased in revenge. The novel has as its setting Italy under Fascism and unde German occupation, the Italian people being divided betw en the fascists of the "Black Brigade" and the "Partisa4s" who belonged to the Resistance. Although this is a pOlitical book, it has universal appeal. At the same time that it livens up historical facts about the period, it moves our feelings. Calvino's book is about World War II as it is viewed and felt by a small outcast, Pin, who makes considerable efforts to be accepted and understood by adults. In his daily life Pinsuffers the consequences Of the war. His aggressive disposition reflects the environment which he has been brought up in: since he was born, his country has been at war. Besides that, his only sister is a whore, whom he hates and despises. Italo Calvino writes in his preface to The Path to the Nest of Spiders that the novel answers to the "ripeness of the time" since ht wrote it after wartime, a period when everyone had a tale to tell

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.

Research on Navigation Path Planning for An Underground Load Haul Dump

Directory of Open Access Journals (Sweden)

Qi Yulong

2015-11-01

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

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.

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

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

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.

Simultaneous two-wavelength tri-window common-path digital holography

Science.gov (United States)

Liu, Lei; Shan, Mingguang; Zhong, Zhi

2018-06-01

Two-wavelength common-path off-axis digital holography is proposed with a tri-window in a single shot. It is established using a standard 4f optical image system with a 2D Ronchi grating placed outside the Fourier plane. The input plane consists of three windows: one for the object and the other two for reference. Aided by a spatial filter together with two orthogonal linear polarizers in the Fourier plane, the two-wavelength information is encoded into a multiplexed hologram with two orthogonal spatial frequencies that enable full separation of spectral information in the digital Fourier space without resolution loss. Theoretical analysis and experimental results illustrate that our approach can simultaneously perform quantitative phase imaging at two wavelengths.

Paths and Tableaux Descriptions of Jacobi-Trudi Determinant Associated with Quantum Affine Algebra of Type $C_n$

Directory of Open Access Journals (Sweden)

Wakako Nakai

2007-07-01

Full Text Available We study the Jacobi-Trudi-type determinant which is conjectured to be the $q$-character of a certain, in many cases irreducible, finite-dimensional representation of the quantum affine algebra of type $C_n$. Like the $D_n$ case studied by the authors recently, applying the Gessel-Viennot path method with an additional involution and a deformation of paths, we obtain an expression by a positive sum over a set of tuples of paths, which is naturally translated into the one over a set of tableaux on a skew diagram.

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.

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.

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

Science.gov (United States)

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

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

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

Photon path length distributions for cloudy skies – oxygen A-Band measurements and model calculations

Directory of Open Access Journals (Sweden)

O. Funk

2003-03-01

Full Text Available This paper addresses the statistics underlying cloudy sky radiative transfer (RT by inspection of the distribution of the path lengths of solar photons. Recent studies indicate that this approach is promising, since it might reveal characteristics about the diffusion process underlying atmospheric radiative transfer (Pfeilsticker, 1999. Moreover, it uses an observable that is directly related to the atmospheric absorption and, therefore, of climatic relevance. However, these studies are based largely on the accuracy of the measurement of the photon path length distribution (PPD. This paper presents a refined analysis method based on high resolution spectroscopy of the oxygen A-band. The method is validated by Monte Carlo simulation atmospheric spectra. Additionally, a new method to measure the effective optical thickness of cloud layers, based on fitting the measured differential transmissions with a 1-dimensional (discrete ordinate RT model, is presented. These methods are applied to measurements conducted during the cloud radar inter-comparison campaign CLARE’98, which supplied detailed cloud structure information, required for the further analysis. For some exemplary cases, measured path length distributions and optical thicknesses are presented and backed by detailed RT model calculations. For all cases, reasonable PPDs can be retrieved and the effects of the vertical cloud structure are found. The inferred cloud optical thicknesses are in agreement with liquid water path measurements. Key words. Meteorology and atmospheric dynamics (radiative processes; instruments and techniques

Photon path length distributions for cloudy skies – oxygen A-Band measurements and model calculations

Directory of Open Access Journals (Sweden)

O. Funk

Full Text Available This paper addresses the statistics underlying cloudy sky radiative transfer (RT by inspection of the distribution of the path lengths of solar photons. Recent studies indicate that this approach is promising, since it might reveal characteristics about the diffusion process underlying atmospheric radiative transfer (Pfeilsticker, 1999. Moreover, it uses an observable that is directly related to the atmospheric absorption and, therefore, of climatic relevance. However, these studies are based largely on the accuracy of the measurement of the photon path length distribution (PPD. This paper presents a refined analysis method based on high resolution spectroscopy of the oxygen A-band. The method is validated by Monte Carlo simulation atmospheric spectra. Additionally, a new method to measure the effective optical thickness of cloud layers, based on fitting the measured differential transmissions with a 1-dimensional (discrete ordinate RT model, is presented. These methods are applied to measurements conducted during the cloud radar inter-comparison campaign CLARE’98, which supplied detailed cloud structure information, required for the further analysis. For some exemplary cases, measured path length distributions and optical thicknesses are presented and backed by detailed RT model calculations. For all cases, reasonable PPDs can be retrieved and the effects of the vertical cloud structure are found. The inferred cloud optical thicknesses are in agreement with liquid water path measurements.

Key words. Meteorology and atmospheric dynamics (radiative processes; instruments and techniques

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.

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)

Storage and Management of Open-pit Transportation Path

Directory of Open Access Journals (Sweden)

Jiusheng Du

2013-07-01

Full Text Available This paper is aiming at the actual demand of open-pit mine daily production scheduling and positioning monitoring. After extracting data from existing topographic maps and other information, it discusses the feasibility of using this data to establish thematic database. By considering the extensive application of GPS data, utilizing new spatial data types of SQL Server 2008 for data storage and management. Extracting data algorithms such as the node spatial data, the regional boundary and the path are implemented, then spatial data storage and management is also realized. It provides the basis for the production of decision-making and production cost savings.

Computing paths and cycles in biological interaction graphs

Directory of Open Access Journals (Sweden)

von Kamp Axel

2009-06-01

Full Text Available Abstract Background Interaction graphs (signed directed graphs provide an important qualitative modeling approach for Systems Biology. They enable the analysis of causal relationships in cellular networks and can even be useful for predicting qualitative aspects of systems dynamics. Fundamental issues in the analysis of interaction graphs are the enumeration of paths and cycles (feedback loops and the calculation of shortest positive/negative paths. These computational problems have been discussed only to a minor extent in the context of Systems Biology and in particular the shortest signed paths problem requires algorithmic developments. Results We first review algorithms for the enumeration of paths and cycles and show that these algorithms are superior to a recently proposed enumeration approach based on elementary-modes computation. The main part of this work deals with the computation of shortest positive/negative paths, an NP-complete problem for which only very few algorithms are described in the literature. We propose extensions and several new algorithm variants for computing either exact results or approximations. Benchmarks with various concrete biological networks show that exact results can sometimes be obtained in networks with several hundred nodes. A class of even larger graphs can still be treated exactly by a new algorithm combining exhaustive and simple search strategies. For graphs, where the computation of exact solutions becomes time-consuming or infeasible, we devised an approximative algorithm with polynomial complexity. Strikingly, in realistic networks (where a comparison with exact results was possible this algorithm delivered results that are very close or equal to the exact values. This phenomenon can probably be attributed to the particular topology of cellular signaling and regulatory networks which contain a relatively low number of negative feedback loops. Conclusion The calculation of shortest positive

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

Nonadiabatic transition path sampling

International Nuclear Information System (INIS)

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

2016-01-01

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

PATHS groundwater hydrologic model

Energy Technology Data Exchange (ETDEWEB)

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

1980-04-01

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

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

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

A Note on Longest Paths in Circular Arc Graphs

Directory of Open Access Journals (Sweden)

Joos Felix

2015-08-01

Full Text Available As observed by Rautenbach and Sereni [SIAM J. Discrete Math. 28 (2014 335-341] there is a gap in the proof of the theorem of Balister et al. [Combin. Probab. Comput. 13 (2004 311-317], which states that the intersection of all longest paths in a connected circular arc graph is nonempty. In this paper we close this gap.

Synthesis of Joint Volumes, Visualization of Paths, and Revision of Viewing Sequences in a Multi-dimensional Seismic Data Viewer

Science.gov (United States)

Chen, D. M.; Clapp, R. G.; Biondi, B.

2006-12-01

Ricksep is a freely-available interactive viewer for multi-dimensional data sets. The viewer is very useful for simultaneous display of multiple data sets from different viewing angles, animation of movement along a path through the data space, and selection of local regions for data processing and information extraction. Several new viewing features are added to enhance the program's functionality in the following three aspects. First, two new data synthesis algorithms are created to adaptively combine information from a data set with mostly high-frequency content, such as seismic data, and another data set with mainly low-frequency content, such as velocity data. Using the algorithms, these two data sets can be synthesized into a single data set which resembles the high-frequency data set on a local scale and at the same time resembles the low- frequency data set on a larger scale. As a result, the originally separated high and low-frequency details can now be more accurately and conveniently studied together. Second, a projection algorithm is developed to display paths through the data space. Paths are geophysically important because they represent wells into the ground. Two difficulties often associated with tracking paths are that they normally cannot be seen clearly inside multi-dimensional spaces and depth information is lost along the direction of projection when ordinary projection techniques are used. The new algorithm projects samples along the path in three orthogonal directions and effectively restores important depth information by using variable projection parameters which are functions of the distance away from the path. Multiple paths in the data space can be generated using different character symbols as positional markers, and users can easily create, modify, and view paths in real time. Third, a viewing history list is implemented which enables Ricksep's users to create, edit and save a recipe for the sequence of viewing states. Then, the recipe

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.

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

Science.gov (United States)

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

2017-12-01

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

A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract

Directory of Open Access Journals (Sweden)

Quang Dung Pham

2009-10-01

Full Text Available Constrained Optimum Path (COP problems appear in many real-life applications, especially on communication networks. Some of these problems have been considered and solved by specific techniques which are usually difficult to extend. In this paper, we introduce a novel local search modeling for solving some COPs by local search. The modeling features the compositionality, modularity, reuse and strengthens the benefits of Constrained-Based Local Search. We also apply the modeling to the edge-disjoint paths problem (EDP. We show that side constraints can easily be added in the model. Computational results show the significance of the approach.

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.

Factors Affecting the Full Use of Library and Information Management Systems by Library Personnel

Science.gov (United States)

Skretas, Georgios

2005-01-01

Purpose: To provide a general list of factors that affects and determines the full use of library information management systems (LIMS) by library staff. Design/methodology/approach: The factors, which were identified mainly during participation in the implementation of automation projects in Greece, are listed and briefly analysed in categories…

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

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.

ICTS AND ENTERPRISE: CONCEPTUAL PROPOSALS TO GENERATE INDICATORS FOR THE INFORMATION SOCIETY

Directory of Open Access Journals (Sweden)

Fernando Peirano

2006-11-01

Full Text Available This paper is an attempt to deepen the reflection on how Information and Communication Technologies (ICTs diffusion among firms takes place. It adds to author’s previous works on the different strategies adopted by small and medium enterprises (SMEs in Argentina in order to adopt ICTs. The paper is focused in the stylization of the different stages along the evolutive path while incorporating these tools and identifying the factors that influence its dynamics, with special attention to costs. The paper is also an attempt to make progress in the description of the paths or ways through which ICTs can improve firms’ performance. Four alternatives are pointed out, named “Economies through Information”: automation, access to information, learning and innovation processes facilitation and reduction of transaction costs. Authors try to make operable some notions frequently used by other authors interested in these issues and to formulate some hypothesis which still need further elaboration, but which will probably stimulate and inspire the debate around these matters.

Core self-evaluations and work engagement: Testing a perception, action, and development path.

Directory of Open Access Journals (Sweden)

Maria Tims

Full Text Available Core self-evaluations (CSE have predictive value for important work outcomes such as job satisfaction and job performance. However, little is known about the mechanisms that may explain these relationships. The purpose of the present study is to contribute to CSE theory by proposing and subsequently providing a first test of theoretically relevant mediating paths through which CSE may be related to work engagement. Based on approach/avoidance motivation and Job Demands-Resources theory, we examined a perception (via job characteristics, action (via job crafting, and development path (via career competencies. Two independent samples were obtained from employees working in Germany and The Netherlands (N = 303 and N = 404, respectively. When taking all mediators into account, results showed that the perception path represented by autonomy and social support played a minor role in the relationship between CSE and work engagement. Specifically, autonomy did not function as a mediator in both samples while social support played a marginally significant role in the CSE-work engagement relationship in sample 1 and received full support in sample 2. The action path exemplified by job crafting mediated the relationship between CSE and work engagement in both samples. Finally, the development path operationalized with career competencies mediated the relationship between CSE and work engagement in sample 1. The study presents evidence for an action and development path over and above the often tested perception path to explain how CSE is related to work engagement. This is one of the first studies to propose and show that CSE not only influences perceptions but also triggers employee actions and developmental strategies that relate to work engagement.

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.

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

Compact wireless control network protocol with fast path switching

Directory of Open Access Journals (Sweden)

Yasutaka Kawamoto

2017-08-01

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

Derivation of groundwater flow-paths based on semi-automatic extraction of lineaments from remote sensing data

Directory of Open Access Journals (Sweden)

U. Mallast

2011-08-01

Full Text Available In this paper we present a semi-automatic method to infer groundwater flow-paths based on the extraction of lineaments from digital elevation models. This method is especially adequate in remote and inaccessible areas where in-situ data are scarce. The combined method of linear filtering and object-based classification provides a lineament map with a high degree of accuracy. Subsequently, lineaments are differentiated into geological and morphological lineaments using auxiliary information and finally evaluated in terms of hydro-geological significance. Using the example of the western catchment of the Dead Sea (Israel/Palestine, the orientation and location of the differentiated lineaments are compared to characteristics of known structural features. We demonstrate that a strong correlation between lineaments and structural features exists. Using Euclidean distances between lineaments and wells provides an assessment criterion to evaluate the hydraulic significance of detected lineaments. Based on this analysis, we suggest that the statistical analysis of lineaments allows a delineation of flow-paths and thus significant information on groundwater movements. To validate the flow-paths we compare them to existing results of groundwater models that are based on well data.

Digital Path Approach Despeckle Filter for Ultrasound Imaging and Video

Directory of Open Access Journals (Sweden)

Marek Szczepański

2017-01-01

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

Product shipping information using graceful labeling on undirected tree graph approach

Science.gov (United States)

Kuan, Yoong Kooi; Ghani, Ahmad Termimi Ab

2017-08-01

Product shipping information is the related information of an ordered product that ready to be shipped to the foreign customer's company, where the information represents as an irrefutable proof in black and white to the local manufacturer by E-mails. This messy and unordered list of information is stored in E-mail folders by the people incharge, which do not function in collating the information properly. So, in this paper, an algorithm is proposed on how to rearrange the messy information from the sequence of a path graph structure into a concise version of a caterpillar graph with achieving the concept of graceful labeling. The final graceful caterpillar graph consists of the full listed information together with the numbering, which able to assist people get the information fleetly for shipping arrangement procedure.

Vision-based path following using the 1D trifocal tensor

CSIR Research Space (South Africa)

Sabatta, D

2013-05-01

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

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.

NEW UPPER AND LOWER BOUNDS LINE OF SIGHT PATH LOSS MODELS FOR MOBILE PROPAGATION IN BUILDINGS

Directory of Open Access Journals (Sweden)

Supachai Phaiboon

2017-11-01

Full Text Available This paper proposes a method to predict line-of-sight (LOS path loss in buildings. We performed measurements in two different type of buildings at a frequency of 1.8 GHz and propose new upper and lower bounds path loss models which depend on max and min values of sample path loss data. This makes our models limit path loss within the boundary lines. The models include time-variant effects such as people moving and cars in parking areas with their influence on wave propagation that is very high.  The results have shown that the proposed models will be useful for the system and cell design of indoor wireless communication systems.

Mindfully Green and Healthy: An Indirect Path from Mindfulness to Ecological Behavior

Directory of Open Access Journals (Sweden)

Sonja M. Geiger

2018-01-01

Full Text Available This paper examines the nature of the link between mindfulness and ecological behavior. Based on the notion that mindfulness incorporates heightened awareness of bodily sensations, we suggest an indirect path from mindfulness to ecological behavior that is mediated through individual health behavior, such as improved nutrition and increased exercise. This indirect path is corroborated with two online studies (n = 147/n = 239 where mindfulness, personal health behavior and ecological behavior were assessed. We conclude that increased mindful awareness of momentary experience indeed favors more healthy lifestyles, which in turn relate to increased ecological behavior beyond personal health benefits. The findings support an agreeableness of personal and planetary health behavior and open up a path for environmental educational interventions based on mindfulness practices and personal health gains.

An Infinite Sequence of Full AFL-Structures, Each of Which Possesses an Infinite Hierarchy

NARCIS (Netherlands)

Asveld, P.R.J.

1999-01-01

We investigate different sets of operations on languages which results in corresponding algebraic structures, viz.\\ in different types of full AFL's (full Abstract Family of Languages). By iterating control on ETOL-systems we show that there exists an infinite sequence ${\\cal C}_m$ ($m\\geq1$) of

An Infinite Sequence of Full AFL-structures, Each of Which Possesses an Infinite Hierarchy

NARCIS (Netherlands)

Asveld, P.R.J.; Martin-Vide, C.; Mitrana, V.

2001-01-01

We investigate different sets of operations on languages which results in corresponding algebraic structures, viz.\\ in different types of full AFL's (full Abstract Family of Languages). By iterating control on ETOL-systems we show that there exists an infinite sequence ${\\cal C}_m$ ($m\\geq1$) of

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

International Nuclear Information System (INIS)

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

2011-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2011-02-07

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

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

Science.gov (United States)

Wang, Dongxu; Mackie, T Rockwell

2015-01-01

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

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.

[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

. Rotational path incorporated an initial straight path of placement, which gained access to undercut areas by rigid guide plate, followed by a final curved path of placement. Without showing clasps in the anterior part of the mouth, esthetics could be improved remarkably. The results of this preliminary study suggest that rotational path RPDs can get the similar retention, stability and mastication function as linear path RPDs. Meanwhile, simulative preparation on diagnostic casts, oral preparation under the guidance of indices and precise fabrication of framework are indispensable procedures.

The Full Costs of Electricity Provision

International Nuclear Information System (INIS)

Horst Keppler, Jan; Rothwell, Geoffrey; Cometto, Marco; Deffrennes, Marc; Iracane, Daniel; Ha, Jaejoo; Paillere, Henri; ); Aspelund, Karl; Aydil, Ismail; ); Berthelemy, Michel; Devezeaux De Lavergne, Jean-Guy; Burtin, Alain; Crozat, Matthew P.; D'Haeseleer, William; Friedrich, Reiner; Gonzalez Jimenez, Antonio; Hirschberg, Stefan; Kiso, Jan-Ole; ); Lee, Manki; Le Masne, Dominique; ); Lundmark, Roger J.; Neumann, Doris; ); Politis, Savvas; ); Prin, Coralie; Skonieczny, Olgierd; Voss, Alfred

2018-01-01

Electricity provision touches upon every facet of life in OECD and non-OECD countries alike, and choosing how this electricity is generated - whether from fossil fuels, nuclear energy or renewables - affects not only economic outcomes but individual and social well-being in the broader sense. Research on the overall costs of electricity is an ongoing effort, as only certain costs of electricity provision are perceived directly by producers and consumers. Other costs, such as the health impacts of air pollution, damage from climate change or the effects on the electricity system of small-scale variable production are not reflected in market prices and thus diminish well-being in unaccounted for ways. Accounting for these social costs in order to establish the full costs of electricity provision is difficult, yet such costs are too important to be disregarded in the context of the energy transitions currently under way in OECD and NEA countries. This report draws on evidence from a large number of studies concerning the social costs of electricity and identifies proven instruments for internalising them so as to improve overall welfare. The results outlined in the report should lead to new and more comprehensive research on the full costs of electricity, which in turn would allow policy makers and the public to make better informed decisions along the path towards fully sustainable electricity systems

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

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.

Information communication on complex networks

International Nuclear Information System (INIS)

Igarashi, Akito; Kawamoto, Hiroki; Maruyama, Takahiro; Morioka, Atsushi; Naganuma, Yuki

2013-01-01

Since communication networks such as the Internet, which is regarded as a complex network, have recently become a huge scale and a lot of data pass through them, the improvement of packet routing strategies for transport is one of the most significant themes in the study of computer networks. It is especially important to find routing strategies which can bear as many traffic as possible without congestion in complex networks. First, using neural networks, we introduce a strategy for packet routing on complex networks, where path lengths and queue lengths in nodes are taken into account within a framework of statistical physics. Secondly, instead of using shortest paths, we propose efficient paths which avoid hubs, nodes with a great many degrees, on scale-free networks with a weight of each node. We improve the heuristic algorithm proposed by Danila et. al. which optimizes step by step routing properties on congestion by using the information of betweenness, the probability of paths passing through a node in all optimal paths which are defined according to a rule, and mitigates the congestion. We confirm the new heuristic algorithm which balances traffic on networks by achieving minimization of the maximum betweenness in much smaller number of iteration steps. Finally, We model virus spreading and data transfer on peer-to-peer (P2P) networks. Using mean-field approximation, we obtain an analytical formulation and emulate virus spreading on the network and compare the results with those of simulation. Moreover, we investigate the mitigation of information traffic congestion in the P2P networks.

Estimation of Atmospheric Path Delays in TerraSAR-X Data using Models vs. Measurements

Directory of Open Access Journals (Sweden)

Donat Perler

2008-12-01

Full Text Available Spaceborne synthetic aperture radar (SAR measurements of the Earth’s surface depend on electromagnetic waves that are subject to atmospheric path delays, in turn affecting geolocation accuracy. The atmosphere influences radar signal propagation by modifying its velocity and direction, effects which can be modeled. We use TerraSAR-X (TSX data to investigate improvements in the knowledge of the scene geometry. To precisely estimate atmospheric path delays, we analyse the signal return of four corner reflectors with accurately surveyed positions (based on differential GPS, placed at different altitudes yet with nearly identical slant ranges to the sensor. The comparison of multiple measurements with path delay models under these geometric conditions also makes it possible to evaluate the corrections for the atmospheric path delay made by the TerraSAR processor and to propose possible improvements.

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.

A unified model of heading and path perception in primate MSTd.

Directory of Open Access Journals (Sweden)

Oliver W Layton

2014-02-01

Full Text Available Self-motion, steering, and obstacle avoidance during navigation in the real world require humans to travel along curved paths. Many perceptual models have been proposed that focus on heading, which specifies the direction of travel along straight paths, but not on path curvature, which humans accurately perceive and is critical to everyday locomotion. In primates, including humans, dorsal medial superior temporal area (MSTd has been implicated in heading perception. However, the majority of MSTd neurons respond optimally to spiral patterns, rather than to the radial expansion patterns associated with heading. No existing theory of curved path perception explains the neural mechanisms by which humans accurately assess path and no functional role for spiral-tuned cells has yet been proposed. Here we present a computational model that demonstrates how the continuum of observed cells (radial to circular in MSTd can simultaneously code curvature and heading across the neural population. Curvature is encoded through the spirality of the most active cell, and heading is encoded through the visuotopic location of the center of the most active cell's receptive field. Model curvature and heading errors fit those made by humans. Our model challenges the view that the function of MSTd is heading estimation, based on our analysis we claim that it is primarily concerned with trajectory estimation and the simultaneous representation of both curvature and heading. In our model, temporal dynamics afford time-history in the neural representation of optic flow, which may modulate its structure. This has far-reaching implications for the interpretation of studies that assume that optic flow is, and should be, represented as an instantaneous vector field. Our results suggest that spiral motion patterns that emerge in spatio-temporal optic flow are essential for guiding self-motion along complex trajectories, and that cells in MSTd are specifically tuned to extract

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.

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.

Algorithms for finding optimal paths in network games with p players

Directory of Open Access Journals (Sweden)

R. Boliac

1997-08-01

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

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…

MATHEMATICAL MODELLING OF AIRCRAFT PILOTING PROSSESS UNDER SPECIFIED FLIGHT PATH

Directory of Open Access Journals (Sweden)

И. Кузнецов

2012-04-01

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

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

Directory of Open Access Journals (Sweden)

As'ad Mahmoud As'ad ALNASER

2017-04-01

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

The path of Equal Opportunity at the University of Salerno (1991-2011

Directory of Open Access Journals (Sweden)

Maria Rosaria Pelizzari

2012-10-01

Full Text Available The subject of this paper is the story of a policy of small steps, implemented by a group of women engaged in promoting the equal opportunities culture at the University of Salerno. The reconstruction of the history of bodies delegated to Equal Opportunities policies is based, first, on the memory of the authoress, who was one of the participants in the activities described. It reconstructs, in a useful way, a path of which, otherwise, you could lose your memory. Events, people and institutions are presented. This context is of particular importance for the establishment, in 2009, of the Documentation Centre on Gender and Equal Opportunities, and, in 2011, of the OGEPO (Observatory for the diffusion of the Gender Studies and the culture of Equal Opportunity, which is connected in a web forum, to provide, among other things, information and advices  about: reconciling work and family life, labor law, issues of career.

Conceptual plural information is used to guide early parsing decisions: Evidence from garden-path sentences with reciprocal verbs.

Science.gov (United States)

Patson, Nikole D; Ferreira, Fernanda

2009-05-01

In three eyetracking studies, we investigated the role of conceptual plurality in initial parsing decisions in temporarily ambiguous sentences with reciprocal verbs (e.g., While the lovers kissed the baby played alone). We varied the subject of the first clause using three types of plural noun phrases: conjoined noun phrases (the bride and the groom), plural definite descriptions (the lovers), and numerically quantified noun phrases (the two lovers). We found no evidence for garden-path effects when the subject was conjoined (Ferreira & McClure, 1997), but traditional garden-path effects were found with the other plural noun phrases. In addition, we tested plural anaphors that had a plural antecedent present in the discourse. We found that when the antecedent was conjoined, garden-path effects were absent compared to cases in which the antecedent was a plural definite description. Our results indicate that the parser is sensitive to the conceptual representation of a plural constituent. In particular, it appears that a Complex Reference Object (Moxey et al., 2004) automatically activates a reciprocal reading of a reciprocal verb.

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.

Full-Field Indentation Damage Measurement Using Digital Image Correlation

Directory of Open Access Journals (Sweden)

Elías López-Alba

2017-07-01

Full Text Available A novel approach based on full-field indentation measurements to characterize and quantify the effect of contact in thin plates is presented. The proposed method has been employed to evaluate the indentation damage generated in the presence of bending deformation, resulting from the contact between a thin plate and a rigid sphere. For this purpose, the 3D Digital Image Correlation (3D-DIC technique has been adopted to quantify the out of plane displacements at the back face of the plate. Tests were conducted using aluminum thin plates and a rigid bearing sphere to evaluate the influence of the thickness and the material behavior during contact. Information provided by the 3D-DIC technique has been employed to perform an indirect measurement of the contact area during the loading and unloading path of the test. A symmetrical distribution in the contact damage region due to the symmetry of the indenter was always observed. In the case of aluminum plates, the presence of a high level of plasticity caused shearing deformation as the load increased. Results show the full-field contact damage area for different plates’ thicknesses at different loads. The contact damage region was bigger when the thickness of the specimen increased, and therefore, bending deformation was reduced. With the proposed approach, the elastic recovery at the contact location was quantified during the unloading, as well as the remaining permanent indentation damage after releasing the load. Results show the information obtained by full-field measurements at the contact location during the test, which implies a substantial improvement compared with pointwise techniques.

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

Directory of Open Access Journals (Sweden)

Jose Luis Blanco

2015-05-01

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

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

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)

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.

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.

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

“Robots in Space” Multiagent Problem: Complexity, Information and Cryptographic Aspects

Directory of Open Access Journals (Sweden)

A. Yu. Bernstein

2013-01-01

Full Text Available We study a multiagent algorithmic problem that we call Robot in Space (RinS: There are n ≥ 2 autonomous robots, that need to agree without outside interference on distribution of shelters, so that straight pathes to the shelters will not intersect. The problem is closely related to the assignment problem in Graph Theory, to the convex hull problem in Combinatorial Geometry, or to the path-planning problem in Artificial Intelligence. Our algorithm grew up from a local search solution of the problem suggested by E.W. Dijkstra. We present a multiagent anonymous and scalable algorithm (protocol solving the problem, give an upper bound for the algorithm, prove (manually its correctness, and examine two communication aspects of the RinS problem — the informational and cryptographic. We proved that (1 there is no protocol that solves the RinS, which transfers a bounded number of bits, and (2 suggested the protocol that allows robots to check whether their paths intersect, without revealing additional information about their relative positions (with respect to shelters. The present paper continues the research presented in Mars Robot Puzzle (a Multiagent Approach to the Dijkstra Problem (by E.V. Bodin, N.O. Garanina, and N.V. Shilov, published in Modeling and analysis of information systems, 18(2, 2011.

Equipartition terms in transition path ensemble: Insights from molecular dynamics simulations of alanine dipeptide

Science.gov (United States)

Li, Wenjin

2018-02-01

Transition path ensemble consists of reactive trajectories and possesses all the information necessary for the understanding of the mechanism and dynamics of important condensed phase processes. However, quantitative description of the properties of the transition path ensemble is far from being established. Here, with numerical calculations on a model system, the equipartition terms defined in thermal equilibrium were for the first time estimated in the transition path ensemble. It was not surprising to observe that the energy was not equally distributed among all the coordinates. However, the energies distributed on a pair of conjugated coordinates remained equal. Higher energies were observed to be distributed on several coordinates, which are highly coupled to the reaction coordinate, while the rest were almost equally distributed. In addition, the ensemble-averaged energy on each coordinate as a function of time was also quantified. These quantitative analyses on energy distributions provided new insights into the transition path ensemble.

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

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.

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

Critical crack path assessments in failure investigations

Directory of Open Access Journals (Sweden)

Robert D. Caligiuri

2015-10-01

Full Text Available This paper presents a case study in which identification of the controlling crack path was critical to identifying the root cause of the failure. The case involves the rupture of a 30-inch (0.76 m natural gas pipeline in 2010 that tragically led to the destruction of a number of homes and the loss of life. The segment of the pipeline that ruptured was installed in 1956. The longitudinal seam of the segment that ruptured was supposed to have been fabricated by double submerged arc welding. Unfortunately, portions of the segment only received a single submerged arc weld on the outside, leaving unwelded areas on the inside diameter. Post-failure examination of the segment revealed that the rupture originated at one of these unwelded areas. Examination also revealed three additional crack paths or zones emanating from the unwelded area: a zone of ductile tearing, a zone of fatigue, and a zone of cleavage fracture, in that sequence. Initial investigators ignored the ductile tear, assumed the critical crack path was the fatigue component, and (incorrectly concluded that the root cause of the incident was the failure of the operator to hydrotest the segment after it was installed in 1956. However, as discussed in this paper, the critical path or mechanism was the ductile tear. Furthermore, it was determined that the ductile tear was created during the hydrotest at installation by a mechanism known as pressure reversal. Thus the correct root cause of the rupture was the hydrotest the operator subjected the segment to at installation, helping to increase the awareness of operators and regulators about the potential problems associated with hydrotesting.

A Meta-Path-Based Prediction Method for Human miRNA-Target Association

Directory of Open Access Journals (Sweden)

Jiawei Luo

2016-01-01

Full Text Available MicroRNAs (miRNAs are short noncoding RNAs that play important roles in regulating gene expressing, and the perturbed miRNAs are often associated with development and tumorigenesis as they have effects on their target mRNA. Predicting potential miRNA-target associations from multiple types of genomic data is a considerable problem in the bioinformatics research. However, most of the existing methods did not fully use the experimentally validated miRNA-mRNA interactions. Here, we developed RMLM and RMLMSe to predict the relationship between miRNAs and their targets. RMLM and RMLMSe are global approaches as they can reconstruct the missing associations for all the miRNA-target simultaneously and RMLMSe demonstrates that the integration of sequence information can improve the performance of RMLM. In RMLM, we use RM measure to evaluate different relatedness between miRNA and its target based on different meta-paths; logistic regression and MLE method are employed to estimate the weight of different meta-paths. In RMLMSe, sequence information is utilized to improve the performance of RMLM. Here, we carry on fivefold cross validation and pathway enrichment analysis to prove the performance of our methods. The fivefold experiments show that our methods have higher AUC scores compared with other methods and the integration of sequence information can improve the performance of miRNA-target association prediction.

SERVICES OF FULL-TEXT SEARCHING IN A DISTRIBUTED INFORMATION ENVIRONMENT (PROJECT HUMANITARIANA

Directory of Open Access Journals (Sweden)

S. K. Lyapin

2015-01-01

Full Text Available Problem statement. We justify the possibility of full-text search services application in both universal and specialized (in terms of resource base digital libraries for the extraction and analysis of the context knowledge in the humanities. The architecture and services of virtual information and resource center for extracting knowledge from the humanitarian texts generated by «Humanitariana» project are described. The functional integration of the resources and services for a full-text search in a distributed decentralized environment, organized in the Internet / Intranet architecture under the control of the client (user browser accessing a variety of independent servers. An algorithm for a distributed full-text query implementation is described. Methods. Method of combining requency-ranked and paragraph-oriented full-text queries is used: the first are used for the preliminary analysis of the subject area or a combination product (explication of "vertical" context, or macro context, the second - for the explication of "horizontal" context, or micro context within copyright paragraph. The results of the frequency-ranked queries are used to compile paragraph-oriented queries. Results. The results of textual research are shown on the topics "The question of fact in Russian philosophy", "The question of loneliness in Russian philosophy and culture". About 50 pieces of context knowledge on the total resource base of about 2,500 full-text resources have been explicated and briefly described to their further expert investigating. Practical significance. The proposed technology (advanced full-text searching services in a distributed information environment can be used for the information support of humanitarian studies and education in the humanities, for functional integration of resources and services of various organizations, for carrying out interdisciplinary research.

A path flux analysis method for the reduction of detailed chemical kinetic mechanisms

Energy Technology Data Exchange (ETDEWEB)

Sun, Wenting; Ju, Yiguang [Department of Mechanical and Aerospace Engineering, Princeton University, Princeton, NJ 08544 (United States); Chen, Zheng [State Key Laboratory for Turbulence and Complex Systems, College of Engineering, Peking University, Beijing 100871 (China); Gou, Xiaolong [School of Power Engineering, Chongqing University, Chongqing 400044 (China)

2010-07-15

A direct path flux analysis (PFA) method for kinetic mechanism reduction is proposed and validated by using high temperature ignition, perfect stirred reactors, and steady and unsteady flame propagations of n-heptane and n-decane/air mixtures. The formation and consumption fluxes of each species at multiple reaction path generations are analyzed and used to identify the important reaction pathways and the associated species. The formation and consumption path fluxes used in this method retain flux conservation information and are used to define the path indexes for the first and the second generation reaction paths related to a targeted species. Based on the indexes of each reaction path for the first and second generations, different sized reduced chemical mechanisms which contain different number of species are generated. The reduced mechanisms of n-heptane and n-decane obtained by using the present method are compared to those generated by the direct relation graph (DRG) method. The reaction path analysis for n-decane is conducted to demonstrate the validity of the present method. The comparisons of the ignition delay times, flame propagation speeds, flame structures, and unsteady spherical flame propagation processes showed that with either the same or significantly less number of species, the reduced mechanisms generated by the present PFA are more accurate than that of DRG in a broad range of initial pressures and temperatures. The method is also integrated with the dynamic multi-timescale method and a further increase of computation efficiency is achieved. (author)

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.

Study of Self Medication In Patients With Diabetes Using Path Analysis

Directory of Open Access Journals (Sweden)

M Rezaei

2015-01-01

Full Text Available Self-medication is a behavior in which one tries to solve his/her health condition or problem without professional help. With regard to mortality and severe complications of diabetes, inappropriate self- medication can have severe consequences but proper planning can control this behavior to improve the patient′s health. In this study, the effect of each factor on self-medication in patients with diabetes is determined using path analysis technique. This cross-sectional study was conducted in the Kermanshah diabetes center. The number of patients with diabetes interviewed were 500. Each patient′s score of self-medication were determined according to a questionnaire, with a higher score showing greater self-medication. Demographic information and scores of trust to doctors, medical expenses, others′ recommendations and busy work environment as predictor variables were measured and analyzed using SPSS 16.0. Based on the questionnaire scores, two patients (0.4% largely, 191 (38.7% moderately and 300 (60.9% slightly were on self-medication. The variable; mistrust of doctors only directly, variables; age, the duration of diabetes and family history of heart disease only indirectly and variables; busy work environment, medical expenses, others′ recommendations and family history of hypertension directly and indirectly were related to self-medication. The results of this study showed that more than 60% of patients with diabetes had low self-medication, which represents the success of education principles and methods. Extracting causal relationships among the complexity of factors influencing a disease requires powerful statistical tools such as path analysis.

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.

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.

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.

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

A Vision-Aided 3D Path Teaching Method before Narrow Butt Joint Welding.

Science.gov (United States)

Zeng, Jinle; Chang, Baohua; Du, Dong; Peng, Guodong; Chang, Shuhe; Hong, Yuxiang; Wang, Li; Shan, Jiguo

2017-05-11

For better welding quality, accurate path teaching for actuators must be achieved before welding. Due to machining errors, assembly errors, deformations, etc., the actual groove position may be different from the predetermined path. Therefore, it is significant to recognize the actual groove position using machine vision methods and perform an accurate path teaching process. However, during the teaching process of a narrow butt joint, the existing machine vision methods may fail because of poor adaptability, low resolution, and lack of 3D information. This paper proposes a 3D path teaching method for narrow butt joint welding. This method obtains two kinds of visual information nearly at the same time, namely 2D pixel coordinates of the groove in uniform lighting condition and 3D point cloud data of the workpiece surface in cross-line laser lighting condition. The 3D position and pose between the welding torch and groove can be calculated after information fusion. The image resolution can reach 12.5 μm. Experiments are carried out at an actuator speed of 2300 mm/min and groove width of less than 0.1 mm. The results show that this method is suitable for groove recognition before narrow butt joint welding and can be applied in path teaching fields of 3D complex components.

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

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

Depolarization on Earth-space paths

Science.gov (United States)

1981-01-01

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

Full-potential theoretical investigations of electron inelastic mean free paths and extended x-ray absorption fine structure in molybdenum

International Nuclear Information System (INIS)

Chantler, C T; Bourke, J D

2014-01-01

X-ray absorption fine structure (XAFS) spectroscopy is one of the most robust, adaptable, and widely used structural analysis tools available for a range of material classes from bulk solids to aqueous solutions and active catalytic structures. Recent developments in XAFS theory have enabled high-accuracy calculations of spectra over an extended energy range using full-potential cluster modelling, and have demonstrated particular sensitivity in XAFS to a fundamental electron transport property—the electron inelastic mean free path (IMFP). We develop electron IMFP theory using a unique hybrid model that simultaneously incorporates second-order excitation losses, while precisely accounting for optical transitions dictated by the complex band structure of the solid. These advances are coupled with improved XAFS modelling to determine wide energy-range absorption spectra for molybdenum. This represents a critical test case of the theory, as measurements of molybdenum K-edge XAFS represent the most accurate determinations of XAFS spectra for any material. We find that we are able to reproduce an extended range of oscillatory structure in the absorption spectrum, and demonstrate a first-time theoretical determination of the absorption coefficient of molybdenum over the entire extended XAFS range utilizing a full-potential cluster model. (paper)

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.

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

Science.gov (United States)

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

2012-01-01

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

A Dynamic Hidden Forwarding Path Planning Method Based on Improved Q-Learning in SDN Environments

Directory of Open Access Journals (Sweden)

Yun Chen

2018-01-01

Full Text Available Currently, many methods are available to improve the target network’s security. The vast majority of them cannot obtain an optimal attack path and interdict it dynamically and conveniently. Almost all defense strategies aim to repair known vulnerabilities or limit services in target network to improve security of network. These methods cannot response to the attacks in real-time because sometimes they need to wait for manufacturers releasing corresponding countermeasures to repair vulnerabilities. In this paper, we propose an improved Q-learning algorithm to plan an optimal attack path directly and automatically. Based on this path, we use software-defined network (SDN to adjust routing paths and create hidden forwarding paths dynamically to filter vicious attack requests. Compared to other machine learning algorithms, Q-learning only needs to input the target state to its agents, which can avoid early complex training process. We improve Q-learning algorithm in two aspects. First, a reward function based on the weights of hosts and attack success rates of vulnerabilities is proposed, which can adapt to different network topologies precisely. Second, we remove the actions and merge them into every state that reduces complexity from O(N3 to O(N2. In experiments, after deploying hidden forwarding paths, the security of target network is boosted significantly without having to repair network vulnerabilities immediately.

Reaction paths based on mean first-passage times

International Nuclear Information System (INIS)

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

2003-01-01

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

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

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

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.

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.

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.

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

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

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

Investigation of the Full Spectrum Phonon Lifetime in Thin Silicon Films from the Bulk Spectral Phonon Mean-Free-Path Distribution by Using Kinetic Theory

Energy Technology Data Exchange (ETDEWEB)

Jin, Jae Sik [Chosun College of Science and Technology, Gwangju (Korea, Republic of)

2017-03-15

Phonon dynamics in nanostructure is critically important to thermoelectric and optoelectronic devices because it determines the transport and other crucial properties. However, accurately evaluating the phonon lifetimes is extremely difficult. This study reports on the development of a new semi-empirical method to estimate the full-spectrum phonon lifetimes in thin silicon films at room temperature based on the experimental data on the phonon mean-free-path spectrum in bulk silicon and a phenomenological consideration of phonon transport in thin films. The bulk of this work describes the theory and the validation; then, we discuss the trend of the phonon lifetimes in thin silicon films when their thicknesses decrease.

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

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.

Neuromorphic model of magnocellular and parvocellular visual paths: spatial resolution

International Nuclear Information System (INIS)

Aguirre, Rolando C; Felice, Carmelo J; Colombo, Elisa M

2007-01-01

Physiological studies of the human retina show the existence of at least two visual information processing channels, the magnocellular and the parvocellular ones. Both have different spatial, temporal and chromatic features. This paper focuses on the different spatial resolution of these two channels. We propose a neuromorphic model, so that they match the retina's physiology. Considering the Deutsch and Deutsch model (1992), we propose two configurations (one for each visual channel) of the connection between the retina's different cell layers. The responses of the proposed model have similar behaviour to those of the visual cells: each channel has an optimum response corresponding to a given stimulus size which decreases for larger or smaller stimuli. This size is bigger for the magno path than for the parvo path and, in the end, both channels produce a magnifying of the borders of a stimulus

Path Dependencies and Institutional Bricolage in Post-Soviet Water Governance

Directory of Open Access Journals (Sweden)

Jenniver Sehring

2009-02-01

Based on empirical findings, four variables through which the neopatrimonial context in both countries impacts water governance are identified: the decision-making process, the agricultural sector, the local governance institutions, and internal water-institutional linkages. A historical-institutionalist perspective shows how path dependencies limit reform effectiveness: institutionalised Soviet and pre-Soviet patterns of behaviour still shape actors’ responses to new challenges. Consequently, rules and organisations established formally by the state or international donor organisations are undermined by informal institutions. Yet, informal institutions are not only an obstacle to reform, but can also support it. They are not static but dynamic. This is elucidated with the concept of 'institutional bricolage', which explains how local actors recombine elements of different institutional logics and thereby change their meaning.

RSMDP-based Robust Q-learning for Optimal Path Planning in a Dynamic Environment

Directory of Open Access Journals (Sweden)

Yunfei Zhang

2014-07-01

Full Text Available This paper presents arobust Q-learning method for path planningin a dynamic environment. The method consists of three steps: first, a regime-switching Markov decision process (RSMDP is formed to present the dynamic environment; second a probabilistic roadmap (PRM is constructed, integrated with the RSMDP and stored as a graph whose nodes correspond to a collision-free world state for the robot; and third, an onlineQ-learning method with dynamic stepsize, which facilitates robust convergence of the Q-value iteration, is integrated with the PRM to determine an optimal path for reaching the goal. In this manner, the robot is able to use past experience for improving its performance in avoiding not only static obstacles but also moving obstacles, without knowing the nature of the obstacle motion. The use ofregime switching in the avoidance of obstacles with unknown motion is particularly innovative.  The developed approach is applied to a homecare robot in computer simulation. The results show that the online path planner with Q-learning is able torapidly and successfully converge to the correct path.

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

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

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.

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

Science.gov (United States)

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

2018-04-01

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

Energy-Aware Path Planning for UAS Persistent Sampling and Surveillance

Science.gov (United States)

Shaw-Cortez, Wenceslao

The focus of this work is to develop an energy-aware path planning algorithm that maximizes UAS endurance, while performing sampling and surveillance missions in a known, stationary wind environment. The energy-aware aspect is specifically tailored to extract energy from the wind to reduce thrust use, thereby increasing aircraft endurance. Wind energy extraction is performed by static soaring and dynamic soaring. Static soaring involves using upward wind currents to increase altitude and potential energy. Dynamic soaring involves taking advantage of wind gradients to exchange potential and kinetic energy. The path planning algorithm developed in this work uses optimization to combine these soaring trajectories with the overarching sampling and surveillance mission. The path planning algorithm uses a simplified aircraft model to tractably optimize soaring trajectories. This aircraft model is presented and along with the derivation of the equations of motion. A nonlinear program is used to create the soaring trajectories based on a given optimization problem. This optimization problem is defined using a heuristic decision tree, which defines appropriate problems given a sampling and surveillance mission and a wind model. Simulations are performed to assess the path planning algorithm. The results are used to identify properties of soaring trajectories as well as to determine what wind conditions support minimal thrust soaring. Additional results show how the path planning algorithm can be tuned between maximizing aircraft endurance and performing the sampling and surveillance mission. A means of trajectory stitching is demonstrated to show how the periodic soaring segments can be combined together to provide a full solution to an infinite/long horizon problem.

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

Science.gov (United States)

Jung, Dongwon

2007-12-01

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

Informal Versus Formal Search : Which Yields a Better Pay?

OpenAIRE

Semih Tumen

2015-01-01

Estimates on the effect of job contact method – i.e., informal versus formal search – on wage offers vary considerably across studies, with some of them finding a positive correlation between getting help from informal connections and obtaining high-paying jobs, while others finding a negative one. In this paper, I theoretically investigate the sources of discrepancies in these empirical results. Using a formal job search framework, I derive an equilibrium wage distribution which reveals that...

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

International Nuclear Information System (INIS)

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

1994-02-01

Path integral formulations for the Smorodinsky-Winternitz potentials in two- and three-dimensional Euclidean space are presented. We mention all coordinate systems which separate the Smorodinsky-Winternitz potentials and state the corresponding path integral formulations. Whereas in many coordinate systems an explicit path integralformulation is not possible, we list in all soluble cases the path integral evaluations explicity in terms of the propagators and the spectral expansions into the wave-functions. (orig.)

Path-space variational inference for non-equilibrium coarse-grained systems

International Nuclear Information System (INIS)

Harmandaris, Vagelis; Kalligiannaki, Evangelia; Katsoulakis, Markos; Plecháč, Petr

2016-01-01

In this paper we discuss information-theoretic tools for obtaining optimized coarse-grained molecular models for both equilibrium and non-equilibrium molecular simulations. The latter are ubiquitous in physicochemical and biological applications, where they are typically associated with coupling mechanisms, multi-physics and/or boundary conditions. In general the non-equilibrium steady states are not known explicitly as they do not necessarily have a Gibbs structure. The presented approach can compare microscopic behavior of molecular systems to parametric and non-parametric coarse-grained models using the relative entropy between distributions on the path space and setting up a corresponding path-space variational inference problem. The methods can become entirely data-driven when the microscopic dynamics are replaced with corresponding correlated data in the form of time series. Furthermore, we present connections and generalizations of force matching methods in coarse-graining with path-space information methods. We demonstrate the enhanced transferability of information-based parameterizations to different observables, at a specific thermodynamic point, due to information inequalities. We discuss methodological connections between information-based coarse-graining of molecular systems and variational inference methods primarily developed in the machine learning community. However, we note that the work presented here addresses variational inference for correlated time series due to the focus on dynamics. The applicability of the proposed methods is demonstrated on high-dimensional stochastic processes given by overdamped and driven Langevin dynamics of interacting particles.

Path-space variational inference for non-equilibrium coarse-grained systems

Energy Technology Data Exchange (ETDEWEB)

Harmandaris, Vagelis, E-mail: harman@uoc.gr [Department of Mathematics and Applied Mathematics, University of Crete (Greece); Institute of Applied and Computational Mathematics (IACM), Foundation for Research and Technology Hellas (FORTH), IACM/FORTH, GR-71110 Heraklion (Greece); Kalligiannaki, Evangelia, E-mail: ekalligian@tem.uoc.gr [Department of Mathematics and Applied Mathematics, University of Crete (Greece); Katsoulakis, Markos, E-mail: markos@math.umass.edu [Department of Mathematics and Statistics, University of Massachusetts at Amherst (United States); Plecháč, Petr, E-mail: plechac@math.udel.edu [Department of Mathematical Sciences, University of Delaware, Newark, Delaware (United States)

2016-06-01

In this paper we discuss information-theoretic tools for obtaining optimized coarse-grained molecular models for both equilibrium and non-equilibrium molecular simulations. The latter are ubiquitous in physicochemical and biological applications, where they are typically associated with coupling mechanisms, multi-physics and/or boundary conditions. In general the non-equilibrium steady states are not known explicitly as they do not necessarily have a Gibbs structure. The presented approach can compare microscopic behavior of molecular systems to parametric and non-parametric coarse-grained models using the relative entropy between distributions on the path space and setting up a corresponding path-space variational inference problem. The methods can become entirely data-driven when the microscopic dynamics are replaced with corresponding correlated data in the form of time series. Furthermore, we present connections and generalizations of force matching methods in coarse-graining with path-space information methods. We demonstrate the enhanced transferability of information-based parameterizations to different observables, at a specific thermodynamic point, due to information inequalities. We discuss methodological connections between information-based coarse-graining of molecular systems and variational inference methods primarily developed in the machine learning community. However, we note that the work presented here addresses variational inference for correlated time series due to the focus on dynamics. The applicability of the proposed methods is demonstrated on high-dimensional stochastic processes given by overdamped and driven Langevin dynamics of interacting particles.

Turbine steam path replacement at the Grafenrheinfeld Nuclear Power Station

International Nuclear Information System (INIS)

Weschenfelder, K.D.; Oeynhausen, H.; Bergmann, D.; Hosbein, P.; Termuehlen, H.

1994-01-01

In the last few years, replacement of old vintage steam turbine flow path components has been well established as a valid approach to improve thermal performance of aged turbines. In nuclear power plants, performance improvement is generally achieved only by design improvements since performance deterioration of old units is minor or nonexistent. With fossil units operating over decades loss in performance is an additional factor which can be taken into account. Such loss of performance can be caused by deposits, solid particle erosion, loss of shaft and inter-stage seal strips, etc. Improvement of performance is typically guaranteed as output increases for operation at full load. This value can be evaluated as a direct gain in unit capacity without fuel or steam supply increase. Since fuel intake does not change, the relative improvement of the net plant heat rate or efficiency is equal to the relative increase in output. The heat rate improvement is achieved not only at full load but for the entire load range. Such heat rate improvement not only moves a plant up on the load dispatch list increasing its capacity factor, but also extensive fuel savings can pay off for the investment cost of new steam path components. Another important factor is that quite often older turbine designs show a deterioration of their reliability and need costly repairs. With new flow path components an aged steam turbine starts a new useful life

A Novel Quad Harmony Search Algorithm for Grid-Based Path Finding

Directory of Open Access Journals (Sweden)

Saso Koceski

2014-09-01

Full Text Available A novel approach to the problem of grid-based path finding has been introduced. The method is a block-based search algorithm, founded on the bases of two algorithms, namely the quad-tree algorithm, which offered a great opportunity for decreasing the time needed to compute the solution, and the harmony search (HS algorithm, a meta-heuristic algorithm used to obtain the optimal solution. This quad HS algorithm uses the quad-tree decomposition of free space in the grid to mark the free areas and treat them as a single node, which greatly improves the execution. The results of the quad HS algorithm have been compared to other meta-heuristic algorithms, i.e., ant colony, genetic algorithm, particle swarm optimization and simulated annealing, and it was proved to obtain the best results in terms of time and giving the optimal path.

Path Integrals for Electronic Densities, Reactivity Indices, and Localization Functions in Quantum Systems

Directory of Open Access Journals (Sweden)

Mihai V. Putz

2009-11-01

Full Text Available The density matrix theory, the ancestor of density functional theory, provides the immediate framework for Path Integral (PI development, allowing the canonical density be extended for the many-electronic systems through the density functional closure relationship. Yet, the use of path integral formalism for electronic density prescription presents several advantages: assures the inner quantum mechanical description of the system by parameterized paths; averages the quantum fluctuations; behaves as the propagator for time-space evolution of quantum information; resembles Schrödinger equation; allows quantum statistical description of the system through partition function computing. In this framework, four levels of path integral formalism were presented: the Feynman quantum mechanical, the semiclassical, the Feynman-Kleinert effective classical, and the Fokker-Planck non-equilibrium ones. In each case the density matrix or/and the canonical density were rigorously defined and presented. The practical specializations for quantum free and harmonic motions, for statistical high and low temperature limits, the smearing justification for the Bohr’s quantum stability postulate with the paradigmatic Hydrogen atomic excursion, along the quantum chemical calculation of semiclassical electronegativity and hardness, of chemical action and Mulliken electronegativity, as well as by the Markovian generalizations of Becke-Edgecombe electronic focalization functions – all advocate for the reliability of assuming PI formalism of quantum mechanics as a versatile one, suited for analytically and/or computationally modeling of a variety of fundamental physical and chemical reactivity concepts characterizing the (density driving many-electronic systems.

THE PATH TO JOB SATISFACTION. APPLYING THE THEORY OF PURPOSEFUL BEHAVIOR TO MILITARY CONDITIONS

Directory of Open Access Journals (Sweden)

Johan ÖSTERBERG

2017-04-01

Full Text Available The aim of this study was to examine the relationships between, on one hand, personality and performance orientation and, on the other, job satisfaction and turnover intentions, using Barrick’s et al. theory of purposeful behavior. Using a questionnaire, data about job satisfaction, performance orientation and turnover intentions were collected from 300 newly recruited Swedish soldiers. A path analysis gave partial, but not full support to the assumptions behind the theory of purposeful behavior model. No relationships were found between the personality traits of emotional stability and conscientiousness, nor to either performance orientation or directly to job satisfaction. On the other hand, performance orientation showed a consistent relationship to perceived levels of the job characteristics, which mediated the path between the person-related variables and the outcome variables. Performance orientation also showed a strong direct relationship to general job satisfaction, which, in turn, was strongly related to turnover intentions.

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.

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

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

Directory of Open Access Journals (Sweden)

E. M. Waxman

2017-09-01

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

Tunnel splitting in biaxial spin models investigated with spin-coherent-state path integrals

International Nuclear Information System (INIS)

Chen Zhide; Liang, J.-Q.; Pu, F.-C.

2003-01-01

Tunnel splitting in biaxial spin models is investigated with a full evaluation of the fluctuation functional integrals of the Euclidean kernel in the framework of spin-coherent-state path integrals which leads to a magnitude of tunnel splitting quantitatively comparable with the numerical results in terms of diagonalization of the Hamilton operator. An additional factor resulted from a global time transformation converting the position-dependent mass to a constant one seems to be equivalent to the semiclassical correction of the Lagrangian proposed by Enz and Schilling. A long standing question whether the spin-coherent-state representation of path integrals can result in an accurate tunnel splitting is therefore resolved

Data Science in Radiology: A Path Forward.

Science.gov (United States)

Aerts, Hugo J W L

2018-02-01

Artificial intelligence (AI), especially deep learning, has the potential to fundamentally alter clinical radiology. AI algorithms, which excel in quantifying complex patterns in data, have shown remarkable progress in applications ranging from self-driving cars to speech recognition. The AI application within radiology, known as radiomics, can provide detailed quantifications of the radiographic characteristics of underlying tissues. This information can be used throughout the clinical care path to improve diagnosis and treatment planning, as well as assess treatment response. This tremendous potential for clinical translation has led to a vast increase in the number of research studies being conducted in the field, a number that is expected to rise sharply in the future. Many studies have reported robust and meaningful findings; however, a growing number also suffer from flawed experimental or analytic designs. Such errors could not only result in invalid discoveries, but also may lead others to perpetuate similar flaws in their own work. This perspective article aims to increase awareness of the issue, identify potential reasons why this is happening, and provide a path forward. Clin Cancer Res; 24(3); 532-4. ©2017 AACR . ©2017 American Association for Cancer Research.

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

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

ASPECTS REGARDING THE OPTIMUM CUTTING TOOL PATH IN PROCESSING FREE-FORM

Directory of Open Access Journals (Sweden)

Florin CHIFAN

2014-11-01

Full Text Available This paper describes an approach on tool paths optimization in CAM-type software for milling free forms, with the goal to improve efficiency in processing using CNC machine tools. The methodology proposed in this paper, tackles the problem of mechanical processing in 3 axes using ball nose milling cutters of small diameters, which follows a free form profile. I will consider two cases: the first one considers the ball nose end mill route on a free form with an angle of less than 30°, the second one with a tool path greater than 30°. The main objective of this paper is to determine the optimum angle in order to obtain a better surface roughness, a shorter time of processing and also a higher tool-life, all these by considering all other factors that occurs in the manufacturing process. This will be done by indicating and editing the tool path so that the tools will the minimum entries and exits on the surface of the piece. This will lead to a 10% decrease of the working time.

Evaluation of an improved technique for lumen path definition and lumen segmentation of atherosclerotic vessels in CT angiography.

Science.gov (United States)

van Velsen, Evert F S; Niessen, Wiro J; de Weert, Thomas T; de Monyé, Cécile; van der Lugt, Aad; Meijering, Erik; Stokking, Rik

2007-07-01

Vessel image analysis is crucial when considering therapeutical options for (cardio-) vascular diseases. Our method, VAMPIRE (Vascular Analysis using Multiscale Paths Inferred from Ridges and Edges), involves two parts: a user defines a start- and endpoint upon which a lumen path is automatically defined, and which is used for initialization; the automatic segmentation of the vessel lumen on computed tomographic angiography (CTA) images. Both parts are based on the detection of vessel-like structures by analyzing intensity, edge, and ridge information. A multi-observer evaluation study was performed to compare VAMPIRE with a conventional method on the CTA data of 15 patients with carotid artery stenosis. In addition to the start- and endpoint, the two radiologists required on average 2.5 (SD: 1.9) additional points to define a lumen path when using the conventional method, and 0.1 (SD: 0.3) when using VAMPIRE. The segmentation results were quantitatively evaluated using Similarity Indices, which were slightly lower between VAMPIRE and the two radiologists (respectively 0.90 and 0.88) compared with the Similarity Index between the radiologists (0.92). The evaluation shows that the improved definition of a lumen path requires minimal user interaction, and that using this path as initialization leads to good automatic lumen segmentation results.

Evaluation of an improved technique for lumen path definition and lumen segmentation of atherosclerotic vessels in CT angiography

International Nuclear Information System (INIS)

Velsen, Evert F.S. van; Niessen, Wiro J.; Meijering, Erik; Stokking, Rik; Weert, Thomas T. de; Monye, Cecile de; Lugt, Aad van der

2007-01-01

Vessel image analysis is crucial when considering therapeutical options for (cardio-) vascular diseases. Our method, VAMPIRE (Vascular Analysis using Multiscale Paths Inferred from Ridges and Edges), involves two parts: a user defines a start- and endpoint upon which a lumen path is automatically defined, and which is used for initialization; the automatic segmentation of the vessel lumen on computed tomographic angiography (CTA) images. Both parts are based on the detection of vessel-like structures by analyzing intensity, edge, and ridge information. A multi-observer evaluation study was performed to compare VAMPIRE with a conventional method on the CTA data of 15 patients with carotid artery stenosis. In addition to the start- and endpoint, the two radiologists required on average 2.5 (SD: 1.9) additional points to define a lumen path when using the conventional method, and 0.1 (SD: 0.3) when using VAMPIRE. The segmentation results were quantitatively evaluated using Similarity Indices, which were slightly lower between VAMPIRE and the two radiologists (respectively 0.90 and 0.88) compared with the Similarity Index between the radiologists (0.92). The evaluation shows that the improved definition of a lumen path requires minimal user interaction, and that using this path as initialization leads to good automatic lumen segmentation results. (orig.)

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.

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.

INFORMATION MANAGEMENT SYSTEM FOR CREATION OF INDIVIDUAL STUDENTS’ EDUCATIONAL TRAJECTORY

Directory of Open Access Journals (Sweden)

Anatolii V. Bohdanov

2016-09-01

Full Text Available The article is devoted to development of information support for building an individual educational path of a student. European Tools for Mobility, Tools for Quality, Tools for Transparency as well as Portals and Databases are analyzed. These tools may be useful for the development and following of an individual educational path. Principles and structure of open module-based portal for information support for building individual educational tracks are presented. Its core modules are described. It is recommended to integrate modules using LEARNING TOOLS INTEROPERABILITY specification. It is demonstrated how to connect modules «Knowledge area» and «Abilities definer».

Path-Wise Test Data Generation Based on Heuristic Look-Ahead Methods

Directory of Open Access Journals (Sweden)

Ying Xing

2014-01-01

Full Text Available Path-wise test data generation is generally considered an important problem in the automation of software testing. In essence, it is a constraint optimization problem, which is often solved by search methods such as backtracking algorithms. In this paper, the backtracking algorithm branch and bound and state space search in artificial intelligence are introduced to tackle the problem of path-wise test data generation. The former is utilized to explore the space of potential solutions and the latter is adopted to construct the search tree dynamically. Heuristics are employed in the look-ahead stage of the search. Dynamic variable ordering is presented with a heuristic rule to break ties, values of a variable are determined by the monotonicity analysis on branching conditions, and maintaining path consistency is achieved through analysis on the result of interval arithmetic. An optimization method is also proposed to reduce the search space. The results of empirical experiments show that the search is conducted in a basically backtrack-free manner, which ensures both test data generation with promising performance and its excellence over some currently existing static and dynamic methods in terms of coverage. The results also demonstrate that the proposed method is applicable in engineering.

Classical Solutions of Path-Dependent PDEs and Functional Forward-Backward Stochastic Systems

Directory of Open Access Journals (Sweden)

Shaolin Ji

2013-01-01

Full Text Available In this paper we study the relationship between functional forward-backward stochastic systems and path-dependent PDEs. In the framework of functional Itô calculus, we introduce a path-dependent PDE and prove that its solution is uniquely determined by a functional forward-backward stochastic system.

A split-path schema-based RFID data storage model in supply chain management.

Science.gov (United States)

Fan, Hua; Wu, Quanyuan; Lin, Yisong; Zhang, Jianfeng

2013-05-03

In modern supply chain management systems, Radio Frequency IDentification (RFID) technology has become an indispensable sensor technology and massive RFID data sets are expected to become commonplace. More and more space and time are needed to store and process such huge amounts of RFID data, and there is an increasing realization that the existing approaches cannot satisfy the requirements of RFID data management. In this paper, we present a split-path schema-based RFID data storage model. With a data separation mechanism, the massive RFID data produced in supply chain management systems can be stored and processed more efficiently. Then a tree structure-based path splitting approach is proposed to intelligently and automatically split the movement paths of products . Furthermore, based on the proposed new storage model, we design the relational schema to store the path information and time information of tags, and some typical query templates and SQL statements are defined. Finally, we conduct various experiments to measure the effect and performance of our model and demonstrate that it performs significantly better than the baseline approach in both the data expression and path-oriented RFID data query performance.

Design of an arbitrary path-following controller for a non-holonomic mobile platform

CSIR Research Space (South Africa)

Sabatta, DG

2009-11-01

Full Text Available required for the platform to asymptotically track the path. The controller derived in this paper is implemented on the Seekur platform from Mobile Robots. Results showing the following of a pre-recorded path from differential GPS are discussed....

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

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.

Career Path Suggestion using String Matching and Decision Trees

Science.gov (United States)

Nagpal, Akshay; P. Panda, Supriya

2015-05-01

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

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.

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.

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.

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

Informal contracting between and within firms

Directory of Open Access Journals (Sweden)

Ricard Gil

Full Text Available Abstract While informal contracts are widely used in modern economies, limited systematic empirical evidence is available to researchers and policy makers. This paper aims to fill the gap by discussing a selected sample of empirical works through the lens of a theoretical framework that clarifies the role of informal contracts. We also highlight unexplored research opportunities offered by more recent theoretical models that investigate how informal contracts are built over time, how they are subject to path dependency, and how relational rents are created, and are awaiting empirical analysis.

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

International Nuclear Information System (INIS)

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

1999-01-01

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

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

Directory of Open Access Journals (Sweden)

Longxiang Li

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

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.

E-Learning and Further Education: How do Individual Learning Paths support Personal Learning Processes

Directory of Open Access Journals (Sweden)

Bertil Haack

2010-02-01

Full Text Available The MOPEM project includes two fixed scenarios that have been defined to convey the idea of "learning paths". Our aim in this paper is to demonstrate the contexts and conditions for flexible learning paths that can be tailored to meet individual needs. The concept of this kind of specialised path is to enable learners to individualise the learning process and to adjust it to their personal needs. We will outline the background and pro- vide examples to explain the concept of learning stations which we use in our four courses: Online Marketing, CRM Systems, Business Communications and Event Marketing. This idea of "freely" combining subject matter naturally leads to the ques- tion of multi-applicability for the learning blocks in various educational contexts. The answers to this question are interest- ing not only in terms of the feasibility of learning paths from a content and didactic point of view, but also with regard to the economic viability of E-Learning or Blended Learning Systems, which ultimately require technical implementation. In addition we will present some first thoughts on the design of a prototype "Content Pool". It would, however, only make sense to develop and implement this within the scope of a follow-up project.

Modeling Heading and Path Perception from Optic Flow in the Case of Independently Moving Objects

Directory of Open Access Journals (Sweden)

Florian eRaudies

2013-04-01

Full Text Available Humans are usually accurate when estimating heading or path from optic flow, even in the presence of independently moving objects (IMO in an otherwise rigid scene. To invoke significant biases in perceived heading, IMOs have to be large and obscure the focus of expansion (FOE in the image plane, which is the point of approach. For the estimation of path during curvilinear self-motion no significant biases were found in the presence of IMOs. What makes humans robust in their estimation of heading or path using optic flow? We derive analytical models of optic flow for linear and curvilinear self-motion using geometric scene models. Heading biases of a linear least squares method, which builds upon these analytical models, are large, larger than those reported for humans. This motivated us to study segmentation cues that are available from optic flow. We derive models of accretion / deletion, expansion / contraction, acceleration / deceleration, local spatial curvature, and local temporal curvature, to be used as cues to segment an IMO from the background. Integrating these segmentation cues into our method of estimating heading or path now explains human psychophysical data and extends, as well as unifies, previous investigations. Our analysis suggests that various cues available from optic flow help to segment IMOs and, thus, make humans’ heading and path perception robust in the presence of such IMOs.

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

Reliable Path Selection Problem in Uncertain Traffic Network after Natural Disaster

Directory of Open Access Journals (Sweden)

Jing Wang

2013-01-01

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

Monte Carlo evaluation of path integral for the nuclear shell model

International Nuclear Information System (INIS)

Lang, G.H.

1993-01-01

The authors present a path-integral formulation of the nuclear shell model using auxillary fields; the path-integral is evaluated by Monte Carlo methods. The method scales favorably with valence-nucleon number and shell-model basis: full-basis calculations are demonstrated up to the rare-earth region, which cannot be treated by other methods. Observables are calculated for the ground state and in a thermal ensemble. Dynamical correlations are obtained, from which strength functions are extracted through the Maximum Entropy method. Examples in the s-d shell, where exact diagonalization can be carried out, compared well with exact results. The open-quotes sign problemclose quotes generic to quantum Monte Carlo calculations is found to be absent in the attractive pairing-plus-multipole interactions. The formulation is general for interacting fermion systems and is well suited for parallel computation. The authors have implemented it on the Intel Touchstone Delta System, achieving better than 99% parallelization

A Universal Concept for Robust Solving of Shortest Path Problems in Dynamically Reconfigurable Graphs

Directory of Open Access Journals (Sweden)

Jean Chamberlain Chedjou

2015-01-01

Full Text Available This paper develops a flexible analytical concept for robust shortest path detection in dynamically reconfigurable graphs. The concept is expressed by a mathematical model representing the shortest path problem solver. The proposed mathematical model is characterized by three fundamental parameters expressing (a the graph topology (through the “incidence matrix”, (b the edge weights (with dynamic external weights’ setting capability, and (c the dynamic reconfigurability through external input(s of the source-destination nodes pair. In order to demonstrate the universality of the developed concept, a general algorithm is proposed to determine the three fundamental parameters (of the mathematical model developed for all types of graphs regardless of their topology, magnitude, and size. It is demonstrated that the main advantage of the developed concept is that arc costs, the origin-destination pair setting, and the graph topology are dynamically provided by external commands, which are inputs of the shortest path solver model. This enables high flexibility and full reconfigurability of the developed concept, without any retraining need. To validate the concept developed, benchmarking is performed leading to a comparison of its performance with the performances of two well-known concepts based on neural networks.

An improved particle filtering algorithm for aircraft engine gas-path fault diagnosis

Directory of Open Access Journals (Sweden)

Qihang Wang

2016-07-01

Full Text Available In this article, an improved particle filter with electromagnetism-like mechanism algorithm is proposed for aircraft engine gas-path component abrupt fault diagnosis. In order to avoid the particle degeneracy and sample impoverishment of normal particle filter, the electromagnetism-like mechanism optimization algorithm is introduced into resampling procedure, which adjusts the position of the particles through simulating attraction–repulsion mechanism between charged particles of the electromagnetism theory. The improved particle filter can solve the particle degradation problem and ensure the diversity of the particle set. Meanwhile, it enhances the ability of tracking abrupt fault due to considering the latest measurement information. Comparison of the proposed method with three different filter algorithms is carried out on a univariate nonstationary growth model. Simulations on a turbofan engine model indicate that compared to the normal particle filter, the improved particle filter can ensure the completion of the fault diagnosis within less sampling period and the root mean square error of parameters estimation is reduced.

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

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

PRINCIPLES OF INDICATION FOR EN-ROUTE FLIGHT PATHS OF THE AIRCRAFT ON THE SCREEN OF ON-BOARD DISPLAY DEVICES

Directory of Open Access Journals (Sweden)

V. V. Markelov

2016-01-01

Full Text Available Subject of Research.We consider the principles and algorithms for construction of en-route flight paths of an aircraft (airplane in a horizontal plane for their subsequent display on the navigation situation indicators in the cockpit. Navigation situation indicatorsaredisplay devices designed on the basis of flat liquid crystal panel. Methods. Flight trajectory display by on-board multifunction indicators is performed by successive drawing of graphic primitives available in the library and defined in accordance with an array of data to display the route. An array of data is generated by on-board software complex based on the information provided in the flight task and the corresponding «Jeppesen» database or analogous one. Formation of the array is carried out by bringing the set of trajectory paths to the format of three typical trajectories described. In addition, each of the types of trajectories has a standard description of the algorithm for calculating the parameters that make up an array of data to display.Main Results.The algorithms of forming and calculating the amounts of data of routing paths required for their construction and display on the multifunction indicators applied in avionics.Practical Relevance.These novel routing algorithms for constructing trajectory paths unify algorithms of generating information for display on the navigation situation indicators and optimize a set of calculated data for flight control at the trajectory in the horizontal plane.

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

Global Appearance Applied to Visual Map Building and Path Estimation Using Multiscale Analysis

Directory of Open Access Journals (Sweden)

Francisco Amorós

2014-01-01

Full Text Available In this work we present a topological map building and localization system for mobile robots based on global appearance of visual information. We include a comparison and analysis of global-appearance techniques applied to wide-angle scenes in retrieval tasks. Next, we define multiscale analysis, which permits improving the association between images and extracting topological distances. Then, a topological map-building algorithm is proposed. At first, the algorithm has information only of some isolated positions of the navigation area in the form of nodes. Each node is composed of a collection of images that covers the complete field of view from a certain position. The algorithm solves the node retrieval and estimates their spatial arrangement. With these aims, it uses the visual information captured along some routes that cover the navigation area. As a result, the algorithm builds a graph that reflects the distribution and adjacency relations between nodes (map. After the map building, we also propose a route path estimation system. This algorithm takes advantage of the multiscale analysis. The accuracy in the pose estimation is not reduced to the nodes locations but also to intermediate positions between them. The algorithms have been tested using two different databases captured in real indoor environments under dynamic conditions.

On the Construction of a Micro-World and the Design of a Path Finding Intelligent Agent with Applications in Robotics and Game Design

Directory of Open Access Journals (Sweden)

Cristian Moldovan

2017-12-01

Full Text Available This paper presents research regarding the behavior of an IA (Intelligent Agent in a MW (Micro-World, a maze-like environment, when it has to find a path from Start to Target position. The IA’s behavior is controlled via an Informed Search Algorithm. Its perception is limited only to one tile in the N, V, S and E direction, it has no prior knowledge of the search space, it has memory on the co-ordinates of already visited path and we implement a heuristic function to direct the IA to the Target.

Design and performance analysis of global path planning techniques for autonomous mobile robots in grid environments

Directory of Open Access Journals (Sweden)

Imen Chaari

2017-03-01

Full Text Available This article presents the results of the 2-year iroboapp research project that aims at devising path planning algorithms for large grid maps with much faster execution times while tolerating very small slacks with respect to the optimal path. We investigated both exact and heuristic methods. We contributed with the design, analysis, evaluation, implementation and experimentation of several algorithms for grid map path planning for both exact and heuristic methods. We also designed an innovative algorithm called relaxed A-star that has linear complexity with relaxed constraints, which provides near-optimal solutions with an extremely reduced execution time as compared to A-star. We evaluated the performance of the different algorithms and concluded that relaxed A-star is the best path planner as it provides a good trade-off among all the metrics, but we noticed that heuristic methods have good features that can be exploited to improve the solution of the relaxed exact method. This led us to design new hybrid algorithms that combine our relaxed A-star with heuristic methods which improve the solution quality of relaxed A-star at the cost of slightly higher execution time, while remaining much faster than A* for large-scale problems. Finally, we demonstrate how to integrate the relaxed A-star algorithm in the robot operating system as a global path planner and show that it outperforms its default path planner with an execution time 38% faster on average.

A path integral for heavy-quarks in a hot plasma

CERN Document Server

Beraudo, A.; Faccioli, P.; Garberoglio, G.; 10.1016/j.nuclphysa.2010.06.007

2010-01-01

We propose a model for the propagation of a heavy-quark in a hot plasma, to be viewed as a first step towards a full description of the dynamics of heavy quark systems in a quark-gluon plasma, including bound state formation. The heavy quark is treated as a non relativistic particle interacting with a fluctuating field, whose correlator is determined by a hard thermal loop approximation. This approximation, which concerns only the medium in which the heavy quark propagates, is the only one that is made, and it can be improved. The dynamics of the heavy quark is given exactly by a quantum mechanical path integral that is calculated in this paper in the Euclidean space-time using numerical Monte Carlo techniques. The spectral function of the heavy quark in the medium is then reconstructed using a Maximum Entropy Method. The path integral is also evaluated exactly in the case where the mass of the heavy quark is infinite; one then recovers known results concerning the complex optical potential that controls the ...

Quick start users guide for the PATH/AWARE decision support system.

Energy Technology Data Exchange (ETDEWEB)

Knowlton, Robert G.; Melton, Brad J; Einfeld, Wayne; Tucker, Mark D; Franco, David Oliver; Yang, Lynn I.

2013-06-01

The Prioritization Analysis Tool for All-Hazards/Analyzer for Wide Area Restoration Effectiveness (PATH/AWARE) software system, developed by Sandia National Laboratories, is a comprehensive decision support tool designed to analyze situational awareness, as well as response and recovery actions, following a wide-area release of chemical, biological or radiological materials. The system provides capability to prioritize critical infrastructure assets and services for restoration. It also provides a capability to assess resource needs (e.g., number of sampling teams, laboratory capacity, decontamination units, etc.), timelines for consequence management activities, and costs. PATH/AWARE is a very comprehensive tool set with a considerable amount of database information managed through a Microsoft SQL (Structured Query Language) database engine, a Geographical Information System (GIS) engine that provides comprehensive mapping capabilities, as well as comprehensive decision logic to carry out the functional aspects of the tool set. This document covers the basic installation and operation of the PATH/AWARE tool in order to give the user enough information to start using the tool. A companion users manual is under development with greater specificity of the PATH/AWARE functionality.

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

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

Directory of Open Access Journals (Sweden)

V. A. Bulanov

2014-01-01

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

Ecological Security Pattern Analysis Based on InVEST and Least-Cost Path Model: A Case Study of Dongguan Water Village

Directory of Open Access Journals (Sweden)

Qian Lin

2016-02-01

Full Text Available The famous “world’s factory” city, Dongguan, like many other places in China, is a typical beneficiary of China’s Reform and Opening-up Policy. However, rapid urban sprawl and economic growth are at the expense of the destruction of the local environment. Therefore, it is of great importance to establish an ecological security network for sustainable development. InVEST models, effective tools to measure sensitivity and intensity of external threats to quantify habitat value, are used to calculate habitat quality of water and land. By combining structural connectivity and the Least-Cost Path model (LCP model, in which corridors are determined based on the minimum accumulative cost path between each critical point, ecological security patterns were calculated. According to the results, the northwest region of Dongguan, having a large quantity of farmlands and water and therefore many corridors and critical patches, is the most essential area in the overall security of ecological environments, which should be protected first. If developed, it should be dominated by eco-tourism and eco-agriculture. We hope that research on the ecological network, which includes critical patches and corridors formed by greenland and rivers, will lead toward better-informed proposals for local urban planning and regional sustainable development.

Pattern formation, logistics, and maximum path probability

Science.gov (United States)

Kirkaldy, J. S.

1985-05-01

The concept of pattern formation, which to current researchers is a synonym for self-organization, carries the connotation of deductive logic together with the process of spontaneous inference. Defining a pattern as an equivalence relation on a set of thermodynamic objects, we establish that a large class of irreversible pattern-forming systems, evolving along idealized quasisteady paths, approaches the stable steady state as a mapping upon the formal deductive imperatives of a propositional function calculus. In the preamble the classical reversible thermodynamics of composite systems is analyzed as an externally manipulated system of space partitioning and classification based on ideal enclosures and diaphragms. The diaphragms have discrete classification capabilities which are designated in relation to conserved quantities by descriptors such as impervious, diathermal, and adiabatic. Differentiability in the continuum thermodynamic calculus is invoked as equivalent to analyticity and consistency in the underlying class or sentential calculus. The seat of inference, however, rests with the thermodynamicist. In the transition to an irreversible pattern-forming system the defined nature of the composite reservoirs remains, but a given diaphragm is replaced by a pattern-forming system which by its nature is a spontaneously evolving volume partitioner and classifier of invariants. The seat of volition or inference for the classification system is thus transferred from the experimenter or theoretician to the diaphragm, and with it the full deductive facility. The equivalence relations or partitions associated with the emerging patterns may thus be associated with theorems of the natural pattern-forming calculus. The entropy function, together with its derivatives, is the vehicle which relates the logistics of reservoirs and diaphragms to the analog logistics of the continuum. Maximum path probability or second-order differentiability of the entropy in isolation are

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

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

Core self-evaluations and work engagement: Testing a perception, action, and development path

Science.gov (United States)

Akkermans, Jos

2017-01-01

Core self-evaluations (CSE) have predictive value for important work outcomes such as job satisfaction and job performance. However, little is known about the mechanisms that may explain these relationships. The purpose of the present study is to contribute to CSE theory by proposing and subsequently providing a first test of theoretically relevant mediating paths through which CSE may be related to work engagement. Based on approach/avoidance motivation and Job Demands-Resources theory, we examined a perception (via job characteristics), action (via job crafting), and development path (via career competencies). Two independent samples were obtained from employees working in Germany and The Netherlands (N = 303 and N = 404, respectively). When taking all mediators into account, results showed that the perception path represented by autonomy and social support played a minor role in the relationship between CSE and work engagement. Specifically, autonomy did not function as a mediator in both samples while social support played a marginally significant role in the CSE–work engagement relationship in sample 1 and received full support in sample 2. The action path exemplified by job crafting mediated the relationship between CSE and work engagement in both samples. Finally, the development path operationalized with career competencies mediated the relationship between CSE and work engagement in sample 1. The study presents evidence for an action and development path over and above the often tested perception path to explain how CSE is related to work engagement. This is one of the first studies to propose and show that CSE not only influences perceptions but also triggers employee actions and developmental strategies that relate to work engagement. PMID:28787464

Core self-evaluations and work engagement: Testing a perception, action, and development path.

Science.gov (United States)

Tims, Maria; Akkermans, Jos

2017-01-01

Core self-evaluations (CSE) have predictive value for important work outcomes such as job satisfaction and job performance. However, little is known about the mechanisms that may explain these relationships. The purpose of the present study is to contribute to CSE theory by proposing and subsequently providing a first test of theoretically relevant mediating paths through which CSE may be related to work engagement. Based on approach/avoidance motivation and Job Demands-Resources theory, we examined a perception (via job characteristics), action (via job crafting), and development path (via career competencies). Two independent samples were obtained from employees working in Germany and The Netherlands (N = 303 and N = 404, respectively). When taking all mediators into account, results showed that the perception path represented by autonomy and social support played a minor role in the relationship between CSE and work engagement. Specifically, autonomy did not function as a mediator in both samples while social support played a marginally significant role in the CSE-work engagement relationship in sample 1 and received full support in sample 2. The action path exemplified by job crafting mediated the relationship between CSE and work engagement in both samples. Finally, the development path operationalized with career competencies mediated the relationship between CSE and work engagement in sample 1. The study presents evidence for an action and development path over and above the often tested perception path to explain how CSE is related to work engagement. This is one of the first studies to propose and show that CSE not only influences perceptions but also triggers employee actions and developmental strategies that relate to work engagement.

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

International Nuclear Information System (INIS)

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

2017-01-01

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

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

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.

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.

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

Directory of Open Access Journals (Sweden)

Ignace T C Hooge

2013-12-01

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

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

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

Directory of Open Access Journals (Sweden)

Wen-Xiang Wu

2014-01-01

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

All new custom path photo book creation

Science.gov (United States)

Wang, Wiley; Muzzolini, Russ

2012-03-01

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

DPFFs: C2MOS Direct Path Flip-Flops for Process-Resilient Ultradynamic Voltage Scaling

Directory of Open Access Journals (Sweden)

Myeong-Eun Hwang

2016-01-01

Full Text Available We propose two master-slave flip-flops (FFs that utilize the clocked CMOS (C2MOS technique with an internal direct connection along the main signal propagation path between the master and slave latches and adopt an adaptive body bias technique to improve circuit robustness. C2MOS structure improves the setup margin and robustness while providing full compatibility with the standard cell characterization flow. Further, the direct path shortens the logic depth and thus speeds up signal propagation, which can be optimized for less power and smaller area. Measurements from test circuits fabricated in 130 nm technology show that the proposed FF operates down to 60 mV, consuming 24.7 pW while improving the propagation delay, dynamic power, and leakage by 22%, 9%, and 13%, respectively, compared with conventional FFs at the iso-output-load condition. The proposed FFs are integrated into an 8×8 FIR filter which successfully operates all the way down to 85 mV.

Integrating cell on chip—Novel waveguide platform employing ultra-long optical paths

Directory of Open Access Journals (Sweden)

Lena Simone Fohrmann

2017-09-01

Full Text Available Optical waveguides are the most fundamental building blocks of integrated optical circuits. They are extremely well understood, yet there is still room for surprises. Here, we introduce a novel 2D waveguide platform which affords a strong interaction of the evanescent tail of a guided optical wave with an external medium while only employing a very small geometrical footprint. The key feature of the platform is its ability to integrate the ultra-long path lengths by combining low propagation losses in a silicon slab with multiple reflections of the guided wave from photonic crystal (PhC mirrors. With a reflectivity of 99.1% of our tailored PhC-mirrors, we achieve interaction paths of 25 cm within an area of less than 10 mm2. This corresponds to 0.17 dB/cm effective propagation which is much lower than the state-of-the-art loss of approximately 1 dB/cm of single mode silicon channel waveguides. In contrast to conventional waveguides, our 2D-approach leads to a decay of the guided wave power only inversely proportional to the optical path length. This entirely different characteristic is the major advantage of the 2D integrating cell waveguide platform over the conventional channel waveguide concepts that obey the Beer-Lambert law.

Methodologies for tracking learning paths in the Making a filmmaker research study of young Nordic filmmakers

DEFF Research Database (Denmark)

Frølunde, Lisbeth; Lindstrand, Fredrik; Öhman-Gullberg, Lisa

The aim of this paper is twofold. On the one hand, to present an outline of the ongoing research study Making a filmmaker, which examines how young Nordic filmmakers create their own learning paths along formal and/or informal contexts. Our focus in this paper is especially directed towards issues...

A method of signal transmission path analysis for multivariate random processes

International Nuclear Information System (INIS)

Oguma, Ritsuo

1984-04-01

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

The Characteristics and Causes of Push-off During Screw Rotor Manufacture, and its Compensation by Multi-axis Machine Path Calculations

Science.gov (United States)

Wang, X.; Holmes, C. S.

2015-08-01

When grinding helical components, errors occur at the beginning and end of the contact path between the component and grinding wheel. This is due to the forces on the component changing as the grinding wheel comes into and out-of full contact with the component. In addition, shaft bending may add depth changes which vary along the length. This may result in an interrupted contact line and increased noise from the rotors. Using on-board scanning, software has been developed to calculate a compensated grinding path, which includes the adjustments of head angle, work rotation and infeed. This grinding path compensates not only lead errors, but also reduces the profile errors as well. The program has been tested in rotor production and the results are shown.

Ted Irving and the Arc of APW Paths

Science.gov (United States)

Kent, D. V.

2014-12-01

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

Communication: importance sampling including path correlation in semiclassical initial value representation calculations for time correlation functions.

Science.gov (United States)

Pan, Feng; Tao, Guohua

2013-03-07

Full semiclassical (SC) initial value representation (IVR) for time correlation functions involves a double phase space average over a set of two phase points, each of which evolves along a classical path. Conventionally, the two initial phase points are sampled independently for all degrees of freedom (DOF) in the Monte Carlo procedure. Here, we present an efficient importance sampling scheme by including the path correlation between the two initial phase points for the bath DOF, which greatly improves the performance of the SC-IVR calculations for large molecular systems. Satisfactory convergence in the study of quantum coherence in vibrational relaxation has been achieved for a benchmark system-bath model with up to 21 DOF.

Longitudinal Impact of the Project PATHS on Adolescent Risk Behavior: What Happened after Five Years?

Directory of Open Access Journals (Sweden)

Daniel T. L. Shek

2012-01-01

Full Text Available The present study investigated the longitudinal impact of the Project PATHS, a large-scale curriculum-based positive youth development program in Hong Kong, on the development of adolescents’ risk behavior over a period of five years. Using a longitudinal randomized controlled design, eight waves of data were collected from 19 experimental schools in which students participated in the Project PATHS (=2,850 at Wave 8 and 24 control schools without joining the Project PATHS (=3,640 at Wave 8. At each wave, students responded to measures assessing their current risk behaviors, including delinquency, use of different types of drug, and their intentions of participating in risk behaviors in the future. Results demonstrated that adolescents receiving the program exhibited significantly slower increases in delinquent behaviors and substance use as compared to the control participants. During two years after the completion of the program, differences in youth risk behaviors in the two groups still existed. These results suggest that the Project PATHS has long-term effect in preventing adolescent problem behavior through promoting positive youth development.

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.

Dynamic Path Exploration on Mobile Devices

KAUST Repository

Birsak, Michael

2017-03-31

We present a novel framework for visualizing routes on mobile devices. Our framework is suitable for helping users explore their environment. First, given a starting point and a maximum route length, the system retrieves nearby points of interest (POIs). Second, we automatically compute an attractive walking path through the environment trying to pass by as many highly ranked POIs as possible. Third, we automatically compute a route visualization that shows the current user position, POI locations via pins, and detail lenses for more information about the POIs. The visualization is an animation of an orthographic map view that follows the current user position. We propose an optimization based on a binary integer program (BIP) that models multiple requirements for an effective placement of detail lenses. We show that our path computation method outperforms recently proposed methods and we evaluate the overall impact of our framework in two user studies.

Robust Adaptive Photon Tracing using Photon Path Visibility

DEFF Research Database (Denmark)

Hachisuka, Toshiya; Jensen, Henrik Wann

2011-01-01

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

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.

The data-driven null models for information dissemination tree in social networks

Science.gov (United States)

Zhang, Zhiwei; Wang, Zhenyu

2017-10-01

For the purpose of detecting relatedness and co-occurrence between users, as well as the distribution features of nodes in spreading path of a social network, this paper explores topological characteristics of information dissemination trees (IDT) that can be employed indirectly to probe the information dissemination laws within social networks. Hence, three different null models of IDT are presented in this article, including the statistical-constrained 0-order IDT null model, the random-rewire-broken-edge 0-order IDT null model and the random-rewire-broken-edge 2-order IDT null model. These null models firstly generate the corresponding randomized copy of an actual IDT; then the extended significance profile, which is developed by adding the cascade ratio of information dissemination path, is exploited not only to evaluate degree correlation of two nodes associated with an edge, but also to assess the cascade ratio of different length of information dissemination paths. The experimental correspondences of the empirical analysis for several SinaWeibo IDTs and Twitter IDTs indicate that the IDT null models presented in this paper perform well in terms of degree correlation of nodes and dissemination path cascade ratio, which can be better to reveal the features of information dissemination and to fit the situation of real social networks.

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.

Path integral measure for gravitational interactions

Directory of Open Access Journals (Sweden)

Kazuo Fujikawa

1983-10-01

Full Text Available It is pointed out that the path-integral variables as well as the local measure for gravitational interactions are uniquely specified if one imposes the anomaly-free condition on the Becchi-Rouet-Stora supersymmetry associated with general coordinate transformations. This prescription is briefly illustrated for the Einstein gravity and supergravity in four space-time dimensions and the relativistic string theory in two dimensions.

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

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

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

Directory of Open Access Journals (Sweden)

Nogbou G. Anoh

2017-02-01

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

Construction of Time-Stamped Mobility Map for Path Tracking via Smith-Waterman Measurement Matching

Directory of Open Access Journals (Sweden)

Mu Zhou

2014-01-01

Full Text Available Path tracking in wireless and mobile environments is a fundamental technology for ubiquitous location-based services (LBSs. In particular, it is very challenging to develop highly accurate and cost-efficient tracking systems applied to the anonymous areas where the floor plans are not available for security and privacy reasons. This paper proposes a novel path tracking approach for large Wi-Fi areas based on the time-stamped unlabeled mobility map which is constructed from Smith-Waterman received signal strength (RSS measurement matching. Instead of conventional location fingerprinting, we construct mobility map with the technique of dimension reduction from the raw measurement space into a low-dimensional embedded manifold. The feasibility of our proposed approach is verified by the real-world experiments in the HKUST campus Wi-Fi networks, sMobileNet. The experimental results prove that our approach is adaptive and capable of achieving an adequate precision level in path tracking.

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

Directory of Open Access Journals (Sweden)

Qiang Zhang

2016-04-01

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

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.

Disordered and Multiple Destinations Path Planning Methods for Mobile Robot in Dynamic Environment

Directory of Open Access Journals (Sweden)

Yong-feng Dong

2016-01-01

Full Text Available In the smart home environment, aiming at the disordered and multiple destinations path planning, the sequencing rule is proposed to determine the order of destinations. Within each branching process, the initial feasible path set is generated according to the law of attractive destination. A sinusoidal adaptive genetic algorithm is adopted. It can calculate the crossover probability and mutation probability adaptively changing with environment at any time. According to the cultural-genetic algorithm, it introduces the concept of reducing turns by parallelogram and reducing length by triangle in the belief space, which can improve the quality of population. And the fallback strategy can help to jump out of the “U” trap effectively. The algorithm analyses the virtual collision in dynamic environment with obstacles. According to the different collision types, different strategies are executed to avoid obstacles. The experimental results show that cultural-genetic algorithm can overcome the problems of premature and convergence of original algorithm effectively. It can avoid getting into the local optimum. And it is more effective for mobile robot path planning. Even in complex environment with static and dynamic obstacles, it can avoid collision safely and plan an optimal path rapidly at the same time.

DMPD: Toll-like receptors: paving the path to T cell-driven autoimmunity? [Dynamic Macrophage Pathway CSML Database

Lifescience Database Archive (English)

Full Text Available 17888644 Toll-like receptors: paving the path to T cell-driven autoimmunity? Marsla... Toll-like receptors: paving the path to T cell-driven autoimmunity? PubmedID 17888644 Title Toll-like recep...tors: paving the path to T cell-driven autoimmunity? Authors Marsland BJ, Kopf M.

Visual target distance, but not visual cursor path length produces shifts in motor behavior

Directory of Open Access Journals (Sweden)

Nike eWendker

2014-03-01

Full Text Available When using tools effects in body space and distant space often do not correspond. Findings so far demonstrated that in this case visual feedback has more impact on action control than proprioceptive feedback. The present study varies the dimensional overlap between visual and proprioceptive action effects and investigates its impact on aftereffects in motor responses. In two experiments participants perform linear hand movements on a covered digitizer tablet to produce ∩-shaped cursor trajectories on the display. The shape of hand motion and cursor motion (linear vs. curved is dissimilar and therefore does not overlap. In one condition the length of hand amplitude and visual target distance is similar and constant while the length of the cursor path is dissimilar and varies. In another condition the length of the hand amplitude varies while the lengths of visual target distance (similar or dissimilar and cursor path (dissimilar are constant. First, we found that aftereffects depended on the relation between hand path length and visual target distance, and not on the relation between hand and cursor path length. Second, increasing contextual interference did not reveal larger aftereffects. Finally, data exploration demonstrated a considerable benefit from gain repetitions across trials when compared to gain switches. In conclusion, dimensional overlap between visual and proprioceptive action effects modulates human information processing in visually controlled actions. However, adjustment of the internal model seems to occur very fast for this kind of simple linear transformation, so that the impact of prior visual feedback is fleeting.

On Holo-Hilbert spectral analysis: a full informational spectral representation for nonlinear and non-stationary data

OpenAIRE

Huang, Norden E.; Hu, Kun; Yang, Albert C. C.; Chang, Hsing-Chih; Jia, Deng; Liang, Wei-Kuang; Yeh, Jia Rong; Kao, Chu-Lan; Juan, Chi-Hung; Peng, Chung Kang; Meijer, Johanna H.; Wang, Yung-Hung; Long, Steven R.; Wu, Zhauhua

2016-01-01

The Holo-Hilbert spectral analysis (HHSA) method is introduced to cure the deficiencies of traditional spectral analysis and to give a full informational representation of nonlinear and non-stationary data. It uses a nested empirical mode decomposition and Hilbert–Huang transform (HHT) approach to identify intrinsic amplitude and frequency modulations often present in nonlinear systems. Comparisons are first made with traditional spectrum analysis, which usually achieved its results through c...

Improved Path Loss Simulation Incorporating Three-Dimensional Terrain Model Using Parallel Coprocessors

Directory of Open Access Journals (Sweden)

Zhang Bin Loo

2017-01-01

Full Text Available Current network simulators abstract out wireless propagation models due to the high computation requirements for realistic modeling. As such, there is still a large gap between the results obtained from simulators and real world scenario. In this paper, we present a framework for improved path loss simulation built on top of an existing network simulation software, NS-3. Different from the conventional disk model, the proposed simulation also considers the diffraction loss computed using Epstein and Peterson’s model through the use of actual terrain elevation data to give an accurate estimate of path loss between a transmitter and a receiver. The drawback of high computation requirements is relaxed by offloading the computationally intensive components onto an inexpensive off-the-shelf parallel coprocessor, which is a NVIDIA GPU. Experiments are performed using actual terrain elevation data provided from United States Geological Survey. As compared to the conventional CPU architecture, the experimental result shows that a speedup of 20x to 42x is achieved by exploiting the parallel processing of GPU to compute the path loss between two nodes using terrain elevation data. The result shows that the path losses between two nodes are greatly affected by the terrain profile between these two nodes. Besides this, the result also suggests that the common strategy to place the transmitter in the highest position may not always work.

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

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

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

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)

SDN-based path hopping communication against eavesdropping attack

Science.gov (United States)

Zhang, Chuanhao; Bu, Youjun; Zhao, Zheng

2016-10-01

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

Position and Attitude Alternate of Path Tracking Heading Control

Directory of Open Access Journals (Sweden)

Baocheng Tan

2014-03-01

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

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.

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

Directory of Open Access Journals (Sweden)

Yong Ma

2013-01-01

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

Quantum information and computation for chemistry

CERN Document Server

Kais, Sabre; Rice, Stuart A

2014-01-01

Examines the intersection of quantum information and chemical physics The Advances in Chemical Physics series is dedicated to reviewing new and emerging topics as well as the latest developments in traditional areas of study in the field of chemical physics. Each volume features detailed comprehensive analyses coupled with individual points of view that integrate the many disciplines of science that are needed for a full understanding of chemical physics. This volume of the series explores the latest research findings, applications, and new research paths from the quantum information science

Full information estimations of a system of simultaneous equations with error component structure

OpenAIRE

Balestra, Pietro; Krishnakumar, Jaya

1987-01-01

In this paper we develop full information methods for estimating the parameters of a system of simultaneous equations with error component struc-ture and establish relationships between the various structural estimat

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.

Evaluating methods for estimating space-time paths of individuals in calculating long-term personal exposure to air pollution

Science.gov (United States)

Schmitz, Oliver; Soenario, Ivan; Vaartjes, Ilonca; Strak, Maciek; Hoek, Gerard; Brunekreef, Bert; Dijst, Martin; Karssenberg, Derek

2016-04-01

Air pollution is one of the major concerns for human health. Associations between air pollution and health are often calculated using long-term (i.e. years to decades) information on personal exposure for each individual in a cohort. Personal exposure is the air pollution aggregated along the space-time path visited by an individual. As air pollution may vary considerably in space and time, for instance due to motorised traffic, the estimation of the spatio-temporal location of a persons' space-time path is important to identify the personal exposure. However, long term exposure is mostly calculated using the air pollution concentration at the x, y location of someone's home which does not consider that individuals are mobile (commuting, recreation, relocation). This assumption is often made as it is a major challenge to estimate space-time paths for all individuals in large cohorts, mostly because limited information on mobility of individuals is available. We address this issue by evaluating multiple approaches for the calculation of space-time paths, thereby estimating the personal exposure along these space-time paths with hyper resolution air pollution maps at national scale. This allows us to evaluate the effect of the space-time path and resulting personal exposure. Air pollution (e.g. NO2, PM10) was mapped for the entire Netherlands at a resolution of 5×5 m2 using the land use regression models developed in the European Study of Cohorts for Air Pollution Effects (ESCAPE, http://escapeproject.eu/) and the open source software PCRaster (http://www.pcraster.eu). The models use predictor variables like population density, land use, and traffic related data sets, and are able to model spatial variation and within-city variability of annual average concentration values. We approximated space-time paths for all individuals in a cohort using various aggregations, including those representing space-time paths as the outline of a persons' home or associated parcel

Blip decomposition of the path integral: exponential acceleration of real-time calculations on quantum dissipative systems.

Science.gov (United States)

Makri, Nancy

2014-10-07

The real-time path integral representation of the reduced density matrix for a discrete system in contact with a dissipative medium is rewritten in terms of the number of blips, i.e., elementary time intervals over which the forward and backward paths are not identical. For a given set of blips, it is shown that the path sum with respect to the coordinates of all remaining time points is isomorphic to that for the wavefunction of a system subject to an external driving term and thus can be summed by an inexpensive iterative procedure. This exact decomposition reduces the number of terms by a factor that increases exponentially with propagation time. Further, under conditions (moderately high temperature and/or dissipation strength) that lead primarily to incoherent dynamics, the "fully incoherent limit" zero-blip term of the series provides a reasonable approximation to the dynamics, and the blip series converges rapidly to the exact result. Retention of only the blips required for satisfactory convergence leads to speedup of full-memory path integral calculations by many orders of magnitude.

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

DEFF Research Database (Denmark)

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

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

Performance of the S - [chi][squared] Statistic for Full-Information Bifactor Models

Science.gov (United States)

Li, Ying; Rupp, Andre A.

2011-01-01

This study investigated the Type I error rate and power of the multivariate extension of the S - [chi][squared] statistic using unidimensional and multidimensional item response theory (UIRT and MIRT, respectively) models as well as full-information bifactor (FI-bifactor) models through simulation. Manipulated factors included test length, sample…

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.

Start-up story: Yewno: an AI-driven path to a knowledge-based future

Directory of Open Access Journals (Sweden)

Ruggero Gramatica

2017-07-01

Full Text Available In today’s world of instant communication and online access to vast stores of data, researchers and students have greater access to information than at any time in history. But as information has become more and more available, it has also become increasingly dispersed and fragmented, and the path to knowledge more challenging than ever.    How can a library help researchers more effectively and meaningfully navigate this ocean of data? Traditional keyword search systems produce valuable results, but function in a linear way. Heaven help those researchers who only get exactly what they ask for! Those of us who have been involved in the development of Yewno believe that we have found a new approach – a new philosophy of research, if you will – that offers a leap forward in the world of library discovery.

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

Directory of Open Access Journals (Sweden)

Behrooz Mashadi

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

Path planning for first responders in the presence of moving obstacles

Directory of Open Access Journals (Sweden)

Zhiyong Wang

2015-06-01

Full Text Available Navigation services have gained much importance for all kinds of human activities ranging from tourist navigation to support of rescue teams in disaster management. However, despite the considerable amount of route guidance research that has been performed, many issues that are related to navigation for first responders still need to be addressed. During disasters, emergencies can result in different types of moving obstacles (e.g., fires, plumes, floods, which make some parts of the road network temporarily unavailable. After such incidents occur, responders have to go to different destinations to perform their tasks in the environment affected by the disaster. Therefore they need a path planner that is capable of dealing with such moving obstacles, as well as generating and coordinating their routes quickly and efficiently. During the past decades, more and more hazard simulations, which can modify the models with incorporation of dynamic data from the field, have been developed. These hazard simulations use methods such as data assimilation, stochastic estimation, and adaptive measurement techniques, and are able to generate more reliable results of hazards. This would allow the hazard simulation models to provide valuable information regarding the state of road networks affected by hazards, which supports path planning for first responders among the moving obstacles. The objective of this research is to develop an integrated navigation system for first responders in the presence of moving obstacles. Such system should be able to navigate one or more responders to one or multiple destinations avoiding the moving obstacles, using the predicted information of the moving obstacles generated from by hazard simulations. In this dissertation, the objective we have is expressed as the following research question: How do we safely and efficiently navigate one or more first responders to one or more destinations avoiding moving obstacles? To address

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

Machine Learning from Garden Path Sentences: The Application of Computational Linguistics

Directory of Open Access Journals (Sweden)

Jiali Du

2014-12-01

Full Text Available This paper discusses the application of computational linguistics in the machine learning (ML system for the processing of garden path sentences. ML is closely related to artificial intelligence and linguistic cognition. The rapid and efficient processing of the complex structures is an effective method to test the system. By means of parsing the garden path sentence, we draw a conclusion that the integration of theoretical and statistical methods is helpful for the development of ML system.

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

Directory of Open Access Journals (Sweden)

Minfang Huang

2016-06-01

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

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.

Design of visible and IR infrared dual-band common-path telescope system

Science.gov (United States)

Guo, YuLin; Yu, Xun; Tao, Yu; Jiang, Xu

2018-01-01

The use of visible and IR infrared dual-band combination can effectively improve the performance of photoelectric detection system,TV and IR system were designed with the common path by the common reflection optical system.A TV/IR infrared common-caliber and common-path system is designed,which can realize the Remote and all-day information.For the 640×512 cooled focal plane array,an infrared middle wave system was presented with a focal length of 600mm F number of 4 field of view(FOV) of 0.38°×0.43°, the system uses optical passive thermal design, has o compact structure and can meet 100% cold shield efficiency,meanwhile it meets the design requirements of lightweight and athermalization. For the 1920×1080 pixels CCD,a visible (TV) system ,which had 500mm focal length, 4F number,was completed.The final optical design along with their modulation transfer function is presented,showing excellent imaging performance in dual-band at the temperature range between -40° and 60°.

Individual Educational Paths in the Universities of Russia and Great Britain (Theoretical Aspects

Directory of Open Access Journals (Sweden)

Natalya Yu. Shaposhnikova

2015-01-01

Full Text Available The author highlights the necessity for higher education institutions to form and realize students' individual educational paths in the learning process, which is stated in the Federal Law on Education and FSES HPE of the third generation. The article presents an overview of the different approaches to the definition of the term «individual educational path» (IEP. It also gives a brief overview of the existing terms in the Russian terminological system, which are close in meaning to the term above. The author formulates her own tentative definition of the term «IEP» which is based on the analysis made. The article further addresses the solution to the problem of the individualization of higher education learning process in Great Britain, which is described through the term «Personal Development Planning». The meaning of the term is shown through the set of actions: planning, doing things, recording of the self experience, reviewing and evaluating, using the personal knowledge derived from reflection and self understanding as well as own learning abilities to plan future actions. In conclusion, the meanings of the terms «IEP» and «PDP» are compared. The author emphasires the importance of studying Great Britain's experience - the practice of solving problems connected with the individualization of the university learning process and the possibilities to use it to facilitate the implementation of students' individual educational paths in Russian higher education institutions.

Agility Path Through Work Values in Knowledge-Based Organizations: A Study of Virtual Universities

Directory of Open Access Journals (Sweden)

Yashar Salamzadeh

2014-05-01

Full Text Available All people enter organizations with a formed personality and some initial experiences and values depending on the culture, which will, in turn, influence their efficiency and performance. Therefore, great attention must be paid to work values of the employees and the issues which affect them, especially in organizations that are complex in their structure and culture. Today’s dynamic environment requires organizations to be agile in their processes, with the issue being even more critical in knowledge-based organizations such as virtual universities. In this research, we identify the path through which organizations can achieve agility by means of work values. Although there are many dimensions in work values and organizational agility, using the methodology applied in this research, we omit some of these dimensions and find the best methods that will enable managers to wisely invest in the most important issues and get the best results in the path to achieve agility through work values.

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

An Improved Artificial Bee Colony Algorithm Based on Balance-Evolution Strategy for Unmanned Combat Aerial Vehicle Path Planning

Directory of Open Access Journals (Sweden)

Bai Li

2014-01-01

Full Text Available Unmanned combat aerial vehicles (UCAVs have been of great interest to military organizations throughout the world due to their outstanding capabilities to operate in dangerous or hazardous environments. UCAV path planning aims to obtain an optimal flight route with the threats and constraints in the combat field well considered. In this work, a novel artificial bee colony (ABC algorithm improved by a balance-evolution strategy (BES is applied in this optimization scheme. In this new algorithm, convergence information during the iteration is fully utilized to manipulate the exploration/exploitation accuracy and to pursue a balance between local exploitation and global exploration capabilities. Simulation results confirm that BE-ABC algorithm is more competent for the UCAV path planning scheme than the conventional ABC algorithm and two other state-of-the-art modified ABC algorithms.

Path Hopping: An MTD Strategy for Long-Term Quantum-Safe Communication

Directory of Open Access Journals (Sweden)

Reihaneh Safavi-Naini

2018-01-01

Full Text Available Moving target defense (MTD strategies have been widely studied for securing computer systems. We consider using MTD strategies to provide long-term cryptographic security for message transmission against an eavesdropping adversary who has access to a quantum computer. In such a setting, today’s widely used cryptographic systems including Diffie-Hellman key agreement protocol and RSA cryptosystem will be insecure and alternative solutions are needed. We will use a physical assumption, existence of multiple communication paths between the sender and the receiver, as the basis of security, and propose a cryptographic system that uses this assumption and an MTD strategy to guarantee efficient long-term information theoretic security even when only a single path is not eavesdropped. Following the approach of Maleki et al., we model the system using a Markov chain, derive its transition probabilities, propose two security measures, and prove results that show how to calculate these measures using transition probabilities. We define two types of attackers that we call risk-taking and risk-averse and compute our proposed measures for the two types of adversaries for a concrete MTD strategy. We will use numerical analysis to study tradeoffs between system parameters, discuss our results, and propose directions for future research.

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.

Additional collection devices used in conjunction with the SurePath Liquid-Based Pap Test broom device do not enhance diagnostic utility

Directory of Open Access Journals (Sweden)

O'Connor Jason C

2004-09-01

Full Text Available Abstract Background We have previously shown that use of an EC brush device in combination with the Rovers Cervex-Brush (SurePath broom offered no significant improvement in EC recovery. Here we determine if use of additional collection devices enhance the diagnostic utility of the SurePath Pap for gynecologic cytology. Methods After informed consent, 37 women ages 18–56 receiving their routine cervical examinations were randomized into four experimental groups. Each group was first sampled with the SurePath broom then immediately re-sampled with an additional collection device or devices. Group 1: Rover endocervix brush (n = 8. Group 2: Medscand CytoBrush Plus GT (n = 7. Group 3: Rover spatula + endocervix brush (n = 11. Group 4: Medscand spatula + CytoBrush Plus GT (n = 11. Results Examination of SurePath broom-collected cytology yielded the following abnormal diagnoses: atypia (n = 2, LSIL (n = 5 and HSIL (n = 3. Comparison of these diagnoses to those obtained from paired samples using the additional collection devices showed that use of a second and or third device yielded no additional abnormal diagnoses. Importantly, use of additional devices did not improve upon the abnormal cell recovery of the SurePath broom and in 4/10 cases under-predicted or did not detect the SurePath broom-collected lesion as confirmed by cervical biopsy. Finally, in 36/37 cases, the SurePath broom successfully recovered ECs. Use of additional devices, in Group 3, augmented EC recovery to 37/37. Conclusions Use of additional collection devices in conjunction with the SurePath broom did not enhance diagnostic utility of the SurePath Pap. A potential but not significant improvement in EC recovery might be seen with the use of three devices.

Impact of Metadata on Full-text Information Retrieval Performance: An Experimental Research on a Small Scale Turkish Corpus

Directory of Open Access Journals (Sweden)

Çağdaş Çapkın

2016-12-01

Full Text Available Information institutions use text-based information retrieval systems to store, index and retrieve metadata, full-text, or both metadata and full-text (hybrid contents. The aim of this research was to evaluate impact of these contents on information retrieval performance. For this purpose, metadata (MIR, full-text (FIR and hybrid (HIR content information retrieval systems were developed with default Lucene information retrieval model for a small scale Turkish corpus. In order to evaluate performance of this three systems, “precision - recall” and “normalized recall” tests were conducted. Experimental findings showed that there were no significant differences between MIR and FIR in mean average precision (MAP performance. On the other hand, MAP performance of HIR was significantly higher in comparison to MIR and FIR. When information retrieval performance was evaluated as user-centered, the “normalized recall” performances of MIR and HIR were significantly higher than FIR. Additionally, there were no significant differences between the systems in retrieved relevant document means. Processing different types of contents such as metadata and full-text had some advantages and disadvantages for information retrieval systems in terms of term management. The advantages brought together in hybrid content processing (HIR and information retrieval performance improved.

Which climate change path are we following? Bad news from Scots pine.

Directory of Open Access Journals (Sweden)

Pierluigi Bombi

Full Text Available Current expectations on future climate derive from coordinated experiments, which compile many climate models for sampling the entire uncertainty related to emission scenarios, initial conditions, and modelling process. Quantifying this uncertainty is important for taking decisions that are robust under a wide range of possible future conditions. Nevertheless, if uncertainty is too large, it can prevent from planning specific and effective measures. For this reason, reducing the spectrum of the possible scenarios to a small number of one or a few models that actually represent the climate pathway influencing natural ecosystems would substantially increase our planning capacity. Here we adopt a multidisciplinary approach based on the comparison of observed and expected spatial patterns of response to climate change in order to identify which specific models, among those included in the CMIP5, catch the real climate variation driving the response of natural ecosystems. We used dendrochronological analyses for determining the geographic pattern of recent growth trends for three European species of trees. At the same time, we modelled the climatic niche for the same species and forecasted the suitability variation expected across Europe under each different GCM. Finally, we estimated how well each GCM explains the real response of ecosystems, by comparing the expected variation with the observed growth trends. Doing this, we identified four climatic models that are coherent with the observed trends. These models are close to the highest range limit of the climatic variations expected by the ensemble of the CMIP5 models, suggesting that current predictions of climate change impacts on ecosystems could be underestimated.

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

An Improved Path-Generating Regulator for Two-Wheeled Robots to Track the Circle/Arc Passage

Directory of Open Access Journals (Sweden)

Jun Dai

2014-01-01

Full Text Available The improved path-generating regulator (PGR is proposed to path track the circle/arc passage for two-wheeled robots. The PGR, which is a control method for robots so as to orient its heading toward the tangential direction of one of the curves belonging to the family of path functions, is applied to navigation problem originally. Driving environments for robots are usually roads, streets, paths, passages, and ridges. These tracks can be seen as they consist of straight lines and arcs. In the case of small interval, arc can be regarded as straight line approximately; therefore we extended the PGR to drive the robot move along circle/arc passage based on the theory that PGR to track the straight passage. In addition, the adjustable look-ahead method is proposed to improve the robot trajectory convergence property to the target circle/arc. The effectiveness is proved through MATLAB simulations on both the comparisons with the PGR and the improved PGR with adjustable look-ahead method. The results of numerical simulations show that the adjustable look-ahead method has better convergence property and stronger capacity of resisting disturbance.

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.

Interim Evaluation of the Tier 1 Program (Secondary 1 Curriculum of the Project P.A.T.H.S.: First Year of the Full Implementation Phase

Directory of Open Access Journals (Sweden)

Daniel T. L. Shek

2008-01-01

Full Text Available To understand the implementation quality of the Tier 1 Program (Secondary 1 Curriculum of the Project P.A.T.H.S. (Positive Adolescent Training through Holistic Social Programmes in the full implementation phase, 100 schools were randomly selected to participate in personal and/or telephone interviews regarding the quality of the implementation process of the Tier 1 Program. In the interviews, the participants described the responses of the students to the program, the perceived benefits of the program, the perceived good aspects of the program, and the areas requiring improvement, difficulties encountered in the implementation process, and perceived attributes of the worker-support scheme (“Co-Walker Scheme”. Results showed that most workers perceived that the students had positive responses to the program and the program was beneficial to the students. They also identified several good aspects in the program, although negative comments on the program design and difficulties in the implementation process were also recorded. Roughly half of the respondents had positive comments on the “Co-Walker Scheme”. In sum, the respondents generally regarded the program as beneficial to the students and they were satisfied with the Tier 1 Program (Secondary 1 Curriculum in the full implementation phase, although some implementation difficulties were also expressed.

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

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

Directory of Open Access Journals (Sweden)

M. Fujise

2004-12-01

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

Memory, museums and information science: An interdisciplinary perspective

Directory of Open Access Journals (Sweden)

Débora Adriano Sampaio

2013-10-01

Full Text Available Reflects on Museums and Information Science in an interdisciplinary perspective, tracing an interface between memory and information. Presents socio-historical approaches of Information Science in an attempt to subsidize social issues that guide this discussion - 'The Social Epistemology Shera', the 'Hermeneutics Capurro' and 'Approach of Knowledge Wersig'. Highlights the dialogue between information, memory and museum institutions, analyzing its importance in the socio-cultural dynamics of the information society. Considers the process of building interdisciplinary, under a social dimension as a vital contribution to the direction of new readings that can transform individuals in humans reflexive and critical agents capable of walking paths foreseen and unforeseen, changing social reality.

SURFACE FITTING FILTERING OF LIDAR POINT CLOUD WITH WAVEFORM INFORMATION

Directory of Open Access Journals (Sweden)

S. Xing

2017-09-01

Full Text Available Full-waveform LiDAR is an active technology of photogrammetry and remote sensing. It provides more detailed information about objects along the path of a laser pulse than discrete-return topographic LiDAR. The point cloud and waveform information with high quality can be obtained by waveform decomposition, which could make contributions to accurate filtering. The surface fitting filtering method with waveform information is proposed to present such advantage. Firstly, discrete point cloud and waveform parameters are resolved by global convergent Levenberg Marquardt decomposition. Secondly, the ground seed points are selected, of which the abnormal ones are detected by waveform parameters and robust estimation. Thirdly, the terrain surface is fitted and the height difference threshold is determined in consideration of window size and mean square error. Finally, the points are classified gradually with the rising of window size. The filtering process is finished until window size is larger than threshold. The waveform data in urban, farmland and mountain areas from “WATER (Watershed Allied Telemetry Experimental Research” are selected for experiments. Results prove that compared with traditional method, the accuracy of point cloud filtering is further improved and the proposed method has highly practical value.

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

Hybrid waveguide-bulk multi-path interferometer with switchable amplitude and phase

Directory of Open Access Journals (Sweden)

Robert Keil

2016-11-01

Full Text Available We design and realise a hybrid interferometer consisting of three paths based on integrated as well as on bulk optical components. This hybrid construction offers a good compromise between stability and footprint on one side and means of intervention on the other. As experimentally verified by the absence of higher-order interferences, amplitude and phase can be manipulated in all paths independently. In conjunction with single photons, the setup can, therefore, be applied for fundamental investigations on quantum mechanics.

Robot path planning using expert systems and machine vision

Science.gov (United States)

Malone, Denis E.; Friedrich, Werner E.

1992-02-01

This paper describes a system developed for the robotic processing of naturally variable products. In order to plan the robot motion path it was necessary to use a sensor system, in this case a machine vision system, to observe the variations occurring in workpieces and interpret this with a knowledge based expert system. The knowledge base was acquired by carrying out an in-depth study of the product using examination procedures not available in the robotic workplace and relates the nature of the required path to the information obtainable from the machine vision system. The practical application of this system to the processing of fish fillets is described and used to illustrate the techniques.

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

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.

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.

Optical Path Length Calibration: A Standard Approach for Use in Absorption Cell-Based IR-Spectrometric Gas Analysis

Directory of Open Access Journals (Sweden)

Javis Anyangwe Nwaboh

2014-01-01

Full Text Available We employed a comparison method to determine the optical path length of gas cells which can be used in spectroscopic setup based on laser absorption spectroscopy or FTIR. The method is based on absorption spectroscopy itself. A reference gas cell, whose length is a priori known and desirably traceable to the international system of units (SI, and a gas mixture are used to calibrate the path length of a cell under test. By comparing spectra derived from pressure-dependent measurements on the two cells, the path length of the gas cell under test is determined. The method relies neither on the knowledge of the gas concentration nor on the line strength parameter of the probed transition which is very rarely traceable to the SI and of which the uncertainty is often relatively large. The method is flexible such that any infrared light source and infrared active molecule with isolated lines can be used. We elaborate on the method, substantiate the method by reporting results of this calibration procedure applied to multipass and single pass gas cells of lengths from 0.38 m to 21 m, and compare this to other methods. The relative combined uncertainty of the path length results determined using the comparison method was found to be in the ±0.4% range.

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.

Amplitude and Phase Characteristics of Signals at the Output of Spatially Separated Antennas for Paths with Scattering

Science.gov (United States)

Anikin, A. S.

2018-06-01

Conditional statistical characteristics of the phase difference are considered depending on the ratio of instantaneous output signal amplitudes of spatially separated weakly directional antennas for the normal field model for paths with radio-wave scattering. The dependences obtained are related to the physical processes on the radio-wave propagation path. The normal model parameters are established at which the statistical characteristics of the phase difference depend on the ratio of the instantaneous amplitudes and hence can be used to measure the phase difference. Using Shannon's formula, the amount of information on the phase difference of signals contained in the ratio of their amplitudes is calculated depending on the parameters of the normal field model. Approaches are suggested to reduce the shift of phase difference measured for paths with radio-wave scattering. A comparison with results of computer simulation by the Monte Carlo method is performed.

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